git-svn-id: https://server.scottellis.com.au/svn/mim_plugs@16 4f64403b-2f21-0410-a795-97e2b3489a10

author: sje <sje@4f64403b-2f21-0410-a795-97e2b3489a10> 2006-11-01 14:48:34 +0000
committer: sje <sje@4f64403b-2f21-0410-a795-97e2b3489a10> 2006-11-01 14:48:34 +0000
commit: d123e0ce94bf90b2adb0a4000930eb467e293226 (patch)
tree: d414dea59908105c4d2f256199a610e0a69c8690
parent: a13e82647294da4add976a24335fec50d7bfe905 (diff)
517 files changed, 190373 insertions, 0 deletions
diff --git a/updater/Docs/licence_updater.txt b/updater/Docs/licence_updater.txt
new file mode 100644
index 0000000..1ee28cf
--- /dev/null
+++ b/updater/Docs/licence_updater.txt
@@ -0,0 +1,52 @@
+// This software is Copyright (c) 2005 Scott Ellis (mail@scottellis.com.au)
+// http://www.scottellis.com.au
+// It is released under the General Public Licence, available here:
+// http://www.gnu.org/copyleft/gpl.html
+
+// *except* for the zip decompression, which is covered by the following licence:
+
+
+// Copyright (c) 1990-1999 Info-ZIP.  All rights reserved.
+//
+// For the purposes of this copyright and license, "Info-ZIP" is defined as
+// the following set of individuals:
+//
+//   Mark Adler, John Bush, Karl Davis, Harald Denker, Jean-Michel Dubois,
+//   Jean-loup Gailly, Hunter Goatley, Ian Gorman, Chris Herborth, Dirk Haase,
+//   Greg Hartwig, Robert Heath, Jonathan Hudson, Paul Kienitz, David Kirschbaum,
+//   Johnny Lee, Onno van der Linden, Igor Mandrichenko, Steve P. Miller,
+//   Sergio Monesi, Keith Owens, George Petrov, Greg Roelofs, Kai Uwe Rommel,
+//   Steve Salisbury, Dave Smith, Christian Spieler, Antoine Verheijen,
+//   Paul von Behren, Rich Wales, Mike White
+//
+// This software is provided "as is," without warranty of any kind, express
+// or implied.  In no event shall Info-ZIP or its contributors be held liable
+// for any direct, indirect, incidental, special or consequential damages
+// arising out of the use of or inability to use this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+//    1. Redistributions of source code must retain the above copyright notice,
+//       definition, disclaimer, and this list of conditions.
+//
+//    2. Redistributions in binary form must reproduce the above copyright
+//       notice, definition, disclaimer, and this list of conditions in
+//       documentation and/or other materials provided with the distribution.
+//
+//    3. Altered versions--including, but not limited to, ports to new operating
+//       systems, existing ports with new graphical interfaces, and dynamic,
+//       shared, or static library versions--must be plainly marked as such
+//       and must not be misrepresented as being the original source.  Such
+//       altered versions also must not be misrepresented as being Info-ZIP
+//       releases--including, but not limited to, labeling of the altered
+//       versions with the names "Info-ZIP" (or any variation thereof, including,
+//       but not limited to, different capitalizations), "Pocket UnZip," "WiZ"
+//       or "MacZip" without the explicit permission of Info-ZIP.  Such altered
+//       versions are further prohibited from misrepresentative use of the
+//       Zip-Bugs or Info-ZIP e-mail addresses or of the Info-ZIP URL(s).
+//
+//    4. Info-ZIP retains the right to use the names "Info-ZIP," "Zip," "UnZip,"
+//       "WiZ," "Pocket UnZip," "Pocket Zip," and "MacZip" for its own source and
+//       binary releases.
diff --git a/updater/Docs/m_popup.h b/updater/Docs/m_popup.h
new file mode 100644
index 0000000..f0a92a4
--- /dev/null
+++ b/updater/Docs/m_popup.h
@@ -0,0 +1,339 @@
+/*
+===============================================================================
+                                PopUp plugin
+Plugin Name: PopUp
+Plugin authors: Luca Santarelli aka hrk (hrk@users.sourceforge.net)
+                Victor Pavlychko aka zazoo (nullbie@gmail.com)
+===============================================================================
+The purpose of this plugin is to give developers a common "platform/interface"
+to show PopUps. It is born from the source code of NewStatusNotify, another
+plugin I've made.
+
+Remember that users *must* have this plugin enabled, or they won't get any
+popup. Write this in the requirements, do whatever you wish ;-)... but tell
+them!
+===============================================================================
+*/
+
+#ifndef __m_popup_h__
+#define __m_popup_h__
+
+/*
+NOTE! Since Popup 1.0.1.2 there is a main meun group called "PopUps" where I
+have put a "Enable/Disable" item. You can add your own "enable/disable" items
+by adding these lines before you call MS_CLIST_ADDMAINMENUITEM:
+mi.pszPopUpName = Translate("PopUps");
+mi.position = 0; //You don't need it and it's better if you put it to zero.
+*/
+
+#define MAX_CONTACTNAME 2048
+#define MAX_SECONDLINE  2048
+
+// This is the basic data you'll need to fill and pass to the service function.
+typedef struct
+{
+	HANDLE lchContact;							// Handle to the contact, can be NULL (main contact).
+	HICON lchIcon;								// Handle to a icon to be shown. Cannot be NULL.
+	union
+	{
+		char lptzContactName[MAX_CONTACTNAME];	// This is the contact name or the first line in the plugin. Cannot be NULL.
+		char lpzContactName[MAX_CONTACTNAME];	
+	};
+	union
+	{
+		char lptzText[MAX_SECONDLINE];			// This is the second line text. Users can choose to hide it. Cannot be NULL.
+		char lpzText[MAX_SECONDLINE];			
+	};
+	COLORREF colorBack;							// COLORREF to be used for the background. Can be NULL, default will be used.
+	COLORREF colorText;							// COLORREF to be used for the text. Can be NULL, default will be used.
+	WNDPROC PluginWindowProc;					// Read below. Can be NULL; default will be used.
+	void * PluginData;							// Read below. Can be NULL.
+} POPUPDATA, * LPPOPUPDATA;
+
+// Extended popup data
+typedef struct
+{
+	HANDLE lchContact;
+	HICON lchIcon;
+	union
+	{
+		char lptzContactName[MAX_CONTACTNAME];
+		char lpzContactName[MAX_CONTACTNAME];	
+	};
+	union
+	{
+		char lptzText[MAX_SECONDLINE];
+		char lpzText[MAX_SECONDLINE];			
+	};
+	COLORREF colorBack;
+	COLORREF colorText;
+	WNDPROC PluginWindowProc;
+	void * PluginData;
+	int iSeconds;								// Custom delay time in seconds. -1 means "forever", 0 means "default time".
+	char cZero[16];								// Some unused bytes which may come useful in the future.
+} POPUPDATAEX, *LPPOPUPDATAEX;
+
+// Unicode version of POPUPDATAEX
+typedef struct
+{
+	HANDLE lchContact;
+	HICON lchIcon;
+	union
+	{
+		WCHAR lptzContactName[MAX_CONTACTNAME];
+		WCHAR lpwzContactName[MAX_CONTACTNAME];	
+	};
+	union
+	{
+		WCHAR lptzText[MAX_CONTACTNAME];
+		WCHAR lpwzText[MAX_CONTACTNAME];	
+	};
+	COLORREF colorBack;                   
+	COLORREF colorText;
+	WNDPROC PluginWindowProc;
+	void * PluginData;
+	int iSeconds;
+	char cZero[16];
+} POPUPDATAW, *LPPOPUPDATAW;
+
+#if defined(_UNICODE) || defined(UNICODE)
+	typedef POPUPDATAW		POPUPDATAT;
+	typedef LPPOPUPDATAW	LPPOPUPDATAT;
+#else
+	typedef POPUPDATAEX		POPUPDATAT;
+	typedef LPPOPUPDATAEX	LPPOPUPDATAT;
+#endif
+
+/* PopUp/AddPopup
+Creates, adds and shows a popup, given a (valid) POPUPDATA structure pointer.
+
+wParam = (WPARAM)(*POPUPDATA)PopUpDataAddress
+lParam = 0
+
+Returns: > 0 on success, 0 if creation went bad, -1 if the PopUpData contained unacceptable values.
+NOTE: it returns -1 if the PopUpData was not valid, if there were already too many popups, if the module was disabled.
+Otherwise, it can return anything else...
+
+Popup Plus 2.0.4.0+
+You may pass additional creation flags via lParam:
+	APF_RETURN_HWND ....... function returns handle to newly created popup window (however this calls are a bit slower)
+	APF_CUSTOM_POPUP ...... new popup is created in hidden state and doesn't obey to popup queue rules.
+							you may control it via UM_* messages and custom window procedure
+*/
+#define APF_RETURN_HWND  0x1
+#define APF_CUSTOM_POPUP 0x2
+
+#define MS_POPUP_ADDPOPUP "PopUp/AddPopUp"
+static int __inline PUAddPopUp(POPUPDATA* ppdp) {
+	return CallService(MS_POPUP_ADDPOPUP, (WPARAM)ppdp,0);
+}
+
+#define MS_POPUP_ADDPOPUPEX "PopUp/AddPopUpEx"
+static int __inline PUAddPopUpEx(POPUPDATAEX* ppdp) {
+	return CallService(MS_POPUP_ADDPOPUPEX, (WPARAM)ppdp,0);
+}
+
+#define MS_POPUP_ADDPOPUPW "PopUp/AddPopUpW"
+static int __inline PUAddPopUpW(POPUPDATAW* ppdp) {
+	return CallService(MS_POPUP_ADDPOPUPW, (WPARAM)ppdp,0);
+}
+
+#if defined(_UNICODE) || defined(UNICODE)
+	#define MS_POPUP_ADDPOPUPT	MS_POPUP_ADDPOPUPW
+	#define PUAddPopUpT			PUAddPopUpW
+#else
+	#define MS_POPUP_ADDPOPUPT	MS_POPUP_ADDPOPUPEX
+	#define PUAddPopUpT			PUAddPopUpEx
+#endif
+
+
+/* PopUp/GetContact
+Returns the handle to the contact associated to the specified PopUpWindow.
+
+wParam = (WPARAM)(HWND)hPopUpWindow
+lParam = 0;
+
+Returns: the HANDLE of the contact. Can return NULL, meaning it's the main contact. -1 means failure.
+*/
+#define MS_POPUP_GETCONTACT "PopUp/GetContact"
+static HANDLE __inline PUGetContact(HWND hPopUpWindow) {
+	return (HANDLE)CallService(MS_POPUP_GETCONTACT, (WPARAM)hPopUpWindow,0);
+}
+
+/* PopUp/GetPluginData
+Returns custom plugin date associated with popup
+
+wParam = (WPARAM)(HWND)hPopUpWindow
+lParam = (LPARAM)(PLUGINDATA*)PluginDataAddress;
+
+Returns: the address of the PLUGINDATA structure. Can return NULL, meaning nothing was given. -1 means failure.
+
+IMPORTANT NOTE: it doesn't seem to work if you do:
+CallService(..., (LPARAM)aPointerToAStruct);
+and then use that struct.
+Do this, instead:
+aPointerToStruct = CallService(..., (LPARAM)aPointerToAStruct);
+and it will work. Just look at the example I've written above (PopUpDlgProc).
+
+*/
+#define MS_POPUP_GETPLUGINDATA "PopUp/GetPluginData"
+static void __inline * PUGetPluginData(HWND hPopUpWindow) {
+	long * uselessPointer = NULL;
+	return (void*)CallService(MS_POPUP_GETPLUGINDATA,(WPARAM)hPopUpWindow,(LPARAM)uselessPointer);
+}
+
+/* PopUp/IsSecondLineShown
+Checks if second line is enable
+
+wParam = 0
+lParam = 0
+
+Returns: 0 if the user has chosen not to have the second line, 1 if he choose to have the second line.
+*/
+#define MS_POPUP_ISSECONDLINESHOWN "PopUp/IsSecondLineShown"
+static BOOL __inline PUIsSecondLineShown() {
+	return (BOOL)CallService(MS_POPUP_ISSECONDLINESHOWN,0,0);
+}
+
+/* PopUp/Query
+
+Requests an action or an answer from PopUp module.
+
+wParam = (WPARAM)wpQuery
+
+returns 0 on success, -1 on error, 1 on stupid calls ;-)
+*/
+
+#define PUQS_ENABLEPOPUPS	1	// returns 0 if state was changed, 1 if state wasn't changed
+#define PUQS_DISABLEPOPUPS	2	// " "
+#define PUQS_GETSTATUS		3	//Returns 1 (TRUE) if popups are enabled, 0 (FALSE) if popups are disabled.
+
+#define MS_POPUP_QUERY "PopUp/Query"
+
+/* UM_FREEPLUGINDATA
+Process this message if you have allocated your own memory. (i.e.: POPUPDATA.PluginData != NULL)
+
+wParam = 0
+lParam = 0
+*/
+#define UM_FREEPLUGINDATA        (WM_USER + 0x0200)
+
+/* UM_DESTROYPOPUP
+Send this message when you want to destroy the popup, or use the function below.
+
+wParam = 0
+lParam = 0
+*/
+#define UM_DESTROYPOPUP          (WM_USER + 0x0201)
+static int __inline PUDeletePopUp(HWND hWndPopUp) {
+	return (int)SendMessage(hWndPopUp, UM_DESTROYPOPUP,0,0);
+}
+
+/* UM_INITPOPUP
+This message is sent to the PopUp when its creation has been finished, so POPUPDATA (and thus your PluginData) is reachable.
+Catch it if you needed to catch WM_CREATE or WM_INITDIALOG, which you'll never ever get in your entire popup-life.
+Return value: if you process this message, return 0. If you don't process it, return 0. Do whatever you like ;-)
+
+wParam = (WPARAM)(HWND)hPopUpWindow (this is useless, you get message inside your popup window)
+lParam = 0
+*/
+#define UM_INITPOPUP             (WM_USER + 0x0202)
+
+/* PopUp/Changetext
+Changes the text displayed in the second line of the popup.
+
+wParam = (WPARAM)(HWND)hPopUpWindow
+lParam = (LPARAM)(char*)lpzNewText
+
+returns: > 0 for success, -1 for failure, 0 if the failure is due to second line not being shown. (but you could call
+PUIsSecondLineShown() before changing the text...)
+*/
+#define MS_POPUP_CHANGETEXT "PopUp/Changetext"
+static int __inline PUChangeText(HWND hWndPopUp, LPCTSTR lpzNewText) {
+	return (int)CallService(MS_POPUP_CHANGETEXT, (WPARAM)hWndPopUp, (LPARAM)lpzNewText);
+}
+
+#define MS_POPUP_CHANGETEXTW "PopUp/ChangetextW"
+static int __inline PUChangeTextW(HWND hWndPopUp, LPCWSTR lpwzNewText) {
+	return (int)CallService(MS_POPUP_CHANGETEXTW, (WPARAM)hWndPopUp, (LPARAM)lpwzNewText);
+}
+
+#if defined(_UNICODE) || defined(UNICODE)
+	#define MS_POPUP_CHANGETEXTT	MS_POPUP_CHANGETEXTW
+	#define PUChangeTextT			PUChangeTextW
+#else
+	#define MS_POPUP_CHANGETEXTT	MS_POPUP_CHANGETEXT
+	#define PUChangeTextT			PUChangeText
+#endif
+
+/* PopUp/Change
+Changes the entire popup
+
+wParam = (WPARAM)(HWND)hPopUpWindow
+lParam = (LPARAM)(POPUPDATAEX*)newData
+*/
+#define MS_POPUP_CHANGE "PopUp/Change"
+static int __inline PUChange(HWND hWndPopUp, POPUPDATAEX *newData) {
+	return (int)CallService(MS_POPUP_CHANGE, (WPARAM)hWndPopUp, (LPARAM)newData);
+}
+
+#define MS_POPUP_CHANGEW "PopUp/ChangeW"
+static int __inline PUChangeW(HWND hWndPopUp, POPUPDATAW *newData) {
+	return (int)CallService(MS_POPUP_CHANGE, (WPARAM)hWndPopUp, (LPARAM)newData);
+}
+
+#if defined(_UNICODE) || defined(UNICODE)
+	#define MS_POPUP_CHANGET	MS_POPUP_CHANGEW
+	#define PUChangeT			PUChangeW
+#else
+	#define MS_POPUP_CHANGET	MS_POPUP_CHANGE
+	#define PUChangeT			PUChange
+#endif
+
+/* UM_CHANGEPOPUP
+This message is triggered by Change/ChangeText services. You also may post it directly :)
+
+wParam = Modification type
+lParam = value of type defined by wParam
+*/
+
+#define CPT_TEXT	1 // lParam = (char *)text
+#define CPT_TEXTW	2 // lParam = (WCHAR *)text
+#define CPT_TITLE	3 // lParam = (char *)title
+#define CPT_TITLEW	4 // lParam = (WCHAR *)title
+#define CPT_DATA	5 // lParam = (POPUPDATA *)data
+#define CPT_DATAEX	6 // lParam = (POPUPDATAEX *)data
+#define CPT_DATAW	7 // lParam = (POPUPDATAW *)data
+
+#define UM_CHANGEPOPUP			(WM_USER + 0x0203)
+
+#if defined(_UNICODE) || defined(UNICODE)
+	#define CPT_TEXTT	CPT_TEXTW
+	#define CPT_TITLET	CPT_TITLEW
+	#define CPT_DATAT	CPT_DATAW
+#else
+	#define CPT_TEXTT	CPT_TEXT
+	#define CPT_TITLET	CPT_TITLE
+	#define CPT_DATAT	CPT_DATA
+#endif
+
+/* PopUp/ShowMessage
+This is mainly for developers.
+Shows a warning message in a PopUp. It's useful if you need a "MessageBox" like function, but you don't want a modal
+window (which will interfere with a DialogProcedure. MessageBox steals focus and control, this one not.
+
+wParam = (char *)lpzMessage
+lParam = 0;
+
+Returns: 0 if the popup was shown, -1 in case of failure.
+*/
+#define SM_WARNING	0x01	//Triangle icon.
+#define SM_NOTIFY	0x02	//Exclamation mark icon.
+#define MS_POPUP_SHOWMESSAGE "PopUp/ShowMessage"
+
+static int __inline PUShowMessage(char *lpzText, BYTE kind) {
+	return (int)CallService(MS_POPUP_SHOWMESSAGE, (WPARAM)lpzText,(LPARAM)kind);
+}
+
+#endif // __m_popup_h__
+
diff --git a/updater/Docs/m_updater.h b/updater/Docs/m_updater.h
new file mode 100644
index 0000000..371b743
--- /dev/null
+++ b/updater/Docs/m_updater.h
@@ -0,0 +1,146 @@
+#ifndef _M_UPDATER_H
+#define _M_UPDATER_H
+
+// NOTES:
+// - For langpack updates, include a string of the following format in the langpack text file:
+//    ";FLID: <file listing name> <version>"
+//    version must be four numbers seperated by '.', in the range 0-255 inclusive
+// - Updater will disable plugins that are downloaded but were not active prior to the update (this is so that, if an archive contains e.g. ansi and 
+//    unicode versions, the correct plugin will be the only one active after the new version is installed)...so if you add a support plugin, you may need 
+//    to install an ini file to make the plugin activate when miranda restarts after the update
+// - Updater will replace all dlls that have the same internal shortName as a downloaded update dll (this is so that msn1.dll and msn2.dll, for example,
+//    will both be updated) - so if you have a unicode and a non-unicode version of a plugin in your archive, you should make the internal names different (which will break automatic 
+//    updates from the file listing if there is only one file listing entry for both versions, unless you use the 'MS_UPDATE_REGISTER' service below)
+// - Updater will install all files in the root of the archive into the plugins folder, except for langpack files that contain the FLID string which go into the root folder (same
+//    folder as miranda32.exe)...all folders in the archive will also be copied to miranda's root folder, and their contents transferred into the new folders. The only exception is a 
+//    special folder called 'root_files' - if there is a folder by that name in the archive, it's contents will also be copied into miranda's root folder - this is intended to be used 
+//    to install additional dlls etc that a plugin may require)
+
+// if you set Update.szUpdateURL to the following value when registering, as well as setting your beta site and version data,
+// Updater will ignore szVersionURL and pbVersionPrefix, and attempt to find the file listing URL's from the backend XML data.
+// for this to work, the plugin name in pluginInfo.shortName must match the file listing exactly (except for case)
+#define UPDATER_AUTOREGISTER		"UpdaterAUTOREGISTER"
+// Updater will also use the backend xml data if you provide URL's that reference the miranda file listing for updates (so you can use that method 
+// if e.g. your plugin shortName does not match the file listing) - it will grab the file listing id from the end of these URLs
+
+typedef struct Update_tag {
+  int cbSize;     
+  char *szComponentName;		// component name as it will appear in the UI (will be translated before displaying)
+
+  char *szVersionURL;			// URL where the current version can be found (NULL to disable)
+  BYTE *pbVersionPrefix;		// bytes occuring in VersionURL before the version, used to locate the version information within the URL data
+								// (note that this URL could point at a binary file - dunno why, but it could :)
+  int cpbVersionPrefix;			// number of bytes pointed to by pbVersionPrefix
+  char *szUpdateURL;			// URL where dll/zip is located
+								// set to UPDATER_AUTOREGISTER if you want Updater to find the file listing URLs (ensure plugin shortName matches file listing!)
+
+  char *szBetaVersionURL;		// URL where the beta version can be found (NULL to disable betas)
+  BYTE *pbBetaVersionPrefix;	// bytes occuring in VersionURL before the version, used to locate the version information within the URL data
+  int cpbBetaVersionPrefix;		// number of bytes pointed to by pbVersionPrefix
+  char *szBetaUpdateURL;		// URL where dll/zip is located
+
+  BYTE *pbVersion;				// bytes of current version, used for comparison with those in VersionURL
+  int cpbVersion;				// number of bytes pointed to by pbVersion
+
+  char *szBetaChangelogURL;		// url for displaying changelog for beta versions
+} Update;
+
+// register a comonent with Updater
+//
+// wparam = 0
+// lparam = (LPARAM)&Update
+#define MS_UPDATE_REGISTER      "Update/Register"
+
+// utility functions to create a version string from a DWORD or from pluginInfo
+// point buf at a buffer at least 16 chars wide - but note the version string returned may be shorter
+//
+__inline static char *CreateVersionString(DWORD version, char *buf) {
+	mir_snprintf(buf, 16, "%d.%d.%d.%d", (version >> 24) & 0xFF, (version >> 16) & 0xFF, (version >> 8) & 0xFF, version & 0xFF);
+	return buf;
+}
+
+__inline static char *CreateVersionStringPlugin(PLUGININFO *pluginInfo, char *buf) {
+	return CreateVersionString(pluginInfo->version, buf);
+}
+
+
+// register the 'easy' way - use this method if you have no beta URL and the plugin is on the miranda file listing
+// NOTE: the plugin version string on the file listing must be the string version of the version in pluginInfo (i.e. 0.0.0.1,
+// four numbers between 0 and 255 inclusivem, so no letters, brackets, etc.)
+//
+// wParam = (int)fileID				- this is the file ID from the file listing (i.e. the number at the end of the download link)
+// lParam = (PLUGININFO*)&pluginInfo
+#define MS_UPDATE_REGISTERFL	"Update/RegisterFL"
+
+// this function can be used to 'unregister' components - useful for plugins that register non-plugin/langpack components and
+// may need to change those components on the fly
+// lParam = (char *)szComponentName
+#define MS_UPDATE_UNREGISTER	"Update/Unregister"
+
+// this event is fired when the startup process is complete, but NOT if a restart is imminent
+// it is designed for status managment plugins to use as a trigger for beggining their own startup process
+// wParam = lParam = 0 (unused)
+// (added in version 0.1.6.0)
+#define ME_UPDATE_STARTUPDONE	"Update/StartupDone"
+
+// this service can be used to enable/disable Updater's global status control
+// it can be called from the StartupDone event handler
+// wParam = (BOOL)enable
+// lParam = 0
+// (added in version 0.1.6.0)
+#define MS_UPDATE_ENABLESTATUSCONTROL	"Update/EnableStatusControl"
+
+// An description of usage of the above service and event:
+// Say you are a status control plugin that normally sets protocol or global statuses in your ModulesLoaded event handler.
+// In order to make yourself 'Updater compatible', you would move the status control code from ModulesLoaded to another function, 
+// say DoStartup. Then, in ModulesLoaded you would check for the existence of the MS_UPDATE_ENABLESTATUSCONTROL service.
+// If it does not exist, call DoStartup. If it does exist, hook the ME_UPDATE_STARTUPDONE event and call DoStartup from there. You may
+// also wish to call MS_UPDATE_ENABLESTATUSCONTROL with wParam == FALSE at this time, to disable Updater's own status control feature.
+
+// this service can be used to determine whether updates are possible for a component with the given name
+// wParam = 0
+// lParam = (char *)szComponentName
+// returns TRUE if updates are supported, FALSE otherwise
+#define MS_UPDATE_ISUPDATESUPPORTED		"Update/IsUpdateSupported"
+
+#endif
+
+
+/////////////// Usage Example ///////////////
+
+#ifdef EXAMPLE_CODE
+
+// you need to #include "m_updater.h" and HookEvent(ME_SYSTEM_MODULESLOADED, OnModulesLoaded) in your Load function...
+
+int OnModulesLoaded(WPARAM wParam, LPARAM lParam) {
+
+	Update update = {0}; // for c you'd use memset or ZeroMemory...
+	char szVersion[16];
+
+	update.cbSize = sizeof(Update);
+
+	update.szComponentName = pluginInfo.shortName;
+	update.pbVersion = (BYTE *)CreateVersionString(&pluginInfo, szVersion);
+	update.cpbVersion = strlen((char *)update.pbVersion);
+
+	// these are the three lines that matter - the archive, the page containing the version string, and the text (or data) 
+	// before the version that we use to locate it on the page
+	// (note that if the update URL and the version URL point to standard file listing entries, the backend xml
+	// data will be used to check for updates rather than the actual web page - this is not true for beta urls)
+	update.szUpdateURL = "http://scottellis.com.au:81/test/updater.zip";
+	update.szVersionURL = "http://scottellis.com.au:81/test/updater_test.html";
+	update.pbVersionPrefix = (BYTE *)"Updater version ";
+	
+	update.cpbVersionPrefix = strlen((char *)update.pbVersionPrefix);
+
+	// do the same for the beta versions of the above struct members if you wish to allow beta updates from another URL
+
+	CallService(MS_UPDATE_REGISTER, 0, (WPARAM)&update);
+
+	// Alternatively, to register a plugin with e.g. file ID 2254 on the file listing...
+	// CallService(MS_UPDATE_REGISTERFL, (WPARAM)2254, (LPARAM)&pluginInfo);
+
+	return 0;
+}
+
+#endif
diff --git a/updater/IcoLib.h b/updater/IcoLib.h
new file mode 100644
index 0000000..1817df6
--- /dev/null
+++ b/updater/IcoLib.h
@@ -0,0 +1,37 @@
+typedef struct {
+	int cbSize;
+    char *pszSection;     //section name used to group icons
+	char *pszDescription; //description for options dialog
+	char *pszName;        //name to refer to icon when playing and in db
+	                      //this name is miranda-wide. so use prefixes of your plugin
+	                      //e.g: "isee_connect", "clist_delete", etc
+    char *pszDefaultFile; //default icon file to use
+	int  iDefaultIndex;
+} SKINICONDESC;
+
+typedef struct {    
+	int cbSize;
+    char *pszSection;
+	char *pszDescription;
+	char *pszName;
+    char *pszDefaultFile;
+	int  iDefaultIndex;
+	HICON hDefaultIcon;
+} SKINICONDESC2;
+
+//
+//  Add a icon into options UI
+//
+//  wParam = (WPARAM)0
+//  lParam = (LPARAM)(SKINICONDESC*)sid;
+//
+#define MS_SKIN2_ADDICON "Skin2/Icons/AddIcon"
+//
+//  Retrieve HICON with name specified in lParam
+//  Returned HICON SHOULDN'T be destroyed, it managed by IcoLib
+//
+#define MS_SKIN2_GETICON "Skin2/Icons/GetIcon"
+//
+//  Icons change notification
+//
+#define ME_SKIN2_ICONSCHANGED "Skin2/IconsChanged"
diff --git a/updater/allocations.cpp b/updater/allocations.cpp
new file mode 100644
index 0000000..733e414
--- /dev/null
+++ b/updater/allocations.cpp
@@ -0,0 +1,5 @@
+#include "common.h"
+#include "allocations.h"
+
+Allocations allocations;
+
diff --git a/updater/allocations.h b/updater/allocations.h
new file mode 100644
index 0000000..ee9127a
--- /dev/null
+++ b/updater/allocations.h
@@ -0,0 +1,72 @@
+#ifndef _ALLOCATION_INC
+#define _ALLOCATION_INC
+
+// store allocated memory pointers for deallocation when shutting down
+class Allocations {
+public:
+	Allocations(): head(0) {}
+	virtual ~Allocations() { free_all(); }
+
+	void push_back(void *pt) { Node *n = new Node; n->value = pt; n->next = head; head = n;}
+
+protected:
+	
+	class Node {
+	public:
+		void *value;
+		Node *next;
+	};
+
+	Node *head;
+
+	void free_all() {
+		Node *current;
+		while(head) {
+			current = head;
+			head = head->next;
+			free(current->value);
+			delete current;
+		}
+	}
+};
+
+extern Allocations allocations;
+
+__inline static void *safe_alloc(int bytes) {
+	if(bytes == 0) return 0;
+	void *ret = malloc(bytes);
+	allocations.push_back(ret);
+	return ret;
+}
+
+__inline static char *safe_strdup(const char *s) {
+	if(!s) return 0;
+	char *ret = _strdup(s);
+	allocations.push_back(ret);
+	return ret;
+}
+
+__inline static wchar_t *safe_wstrdup(const wchar_t *s) {
+	if(!s) return 0;
+	wchar_t *ret = wcsdup(s);
+	allocations.push_back(ret);
+	return ret;
+}
+
+#ifdef _UNICODE
+#define safe_tstrdup(x)		safe_wstrdup(x)
+#else
+#define sage_tstrdup(x)		safe_strdup(x)
+#endif
+
+__inline static BYTE *safe_bytedup(BYTE *bytes, int size) {
+	if(!bytes || size == 0) return 0;
+
+	BYTE *ret = (BYTE *)malloc(size + 1);
+	memcpy(ret, bytes, size);
+	*(ret + size) = 0;
+	allocations.push_back(ret);
+	return ret;
+}
+
+#endif
diff --git a/updater/bzip2-1.0.3/CHANGES b/updater/bzip2-1.0.3/CHANGES
new file mode 100644
index 0000000..e31b03a
--- /dev/null
+++ b/updater/bzip2-1.0.3/CHANGES
@@ -0,0 +1,275 @@
+
+
+0.9.0
+~~~~~
+First version.
+
+
+0.9.0a
+~~~~~~
+Removed 'ranlib' from Makefile, since most modern Unix-es 
+don't need it, or even know about it.
+
+
+0.9.0b
+~~~~~~
+Fixed a problem with error reporting in bzip2.c.  This does not effect
+the library in any way.  Problem is: versions 0.9.0 and 0.9.0a (of the
+program proper) compress and decompress correctly, but give misleading
+error messages (internal panics) when an I/O error occurs, instead of
+reporting the problem correctly.  This shouldn't give any data loss
+(as far as I can see), but is confusing.
+
+Made the inline declarations disappear for non-GCC compilers.
+
+
+0.9.0c
+~~~~~~
+Fixed some problems in the library pertaining to some boundary cases.
+This makes the library behave more correctly in those situations.  The
+fixes apply only to features (calls and parameters) not used by
+bzip2.c, so the non-fixedness of them in previous versions has no
+effect on reliability of bzip2.c.
+
+In bzlib.c:
+   * made zero-length BZ_FLUSH work correctly in bzCompress().
+   * fixed bzWrite/bzRead to ignore zero-length requests.
+   * fixed bzread to correctly handle read requests after EOF.
+   * wrong parameter order in call to bzDecompressInit in
+     bzBuffToBuffDecompress.  Fixed.
+
+In compress.c:
+   * changed setting of nGroups in sendMTFValues() so as to 
+     do a bit better on small files.  This _does_ effect
+     bzip2.c.
+
+
+0.9.5a
+~~~~~~
+Major change: add a fallback sorting algorithm (blocksort.c)
+to give reasonable behaviour even for very repetitive inputs.
+Nuked --repetitive-best and --repetitive-fast since they are
+no longer useful.
+
+Minor changes: mostly a whole bunch of small changes/
+bugfixes in the driver (bzip2.c).  Changes pertaining to the
+user interface are:
+
+   allow decompression of symlink'd files to stdout
+   decompress/test files even without .bz2 extension
+   give more accurate error messages for I/O errors
+   when compressing/decompressing to stdout, don't catch control-C
+   read flags from BZIP2 and BZIP environment variables
+   decline to break hard links to a file unless forced with -f
+   allow -c flag even with no filenames
+   preserve file ownerships as far as possible
+   make -s -1 give the expected block size (100k)
+   add a flag -q --quiet to suppress nonessential warnings
+   stop decoding flags after --, so files beginning in - can be handled
+   resolved inconsistent naming: bzcat or bz2cat ?
+   bzip2 --help now returns 0
+
+Programming-level changes are:
+
+   fixed syntax error in GET_LL4 for Borland C++ 5.02
+   let bzBuffToBuffDecompress return BZ_DATA_ERROR{_MAGIC}
+   fix overshoot of mode-string end in bzopen_or_bzdopen
+   wrapped bzlib.h in #ifdef __cplusplus ... extern "C" { ... }
+   close file handles under all error conditions
+   added minor mods so it compiles with DJGPP out of the box
+   fixed Makefile so it doesn't give problems with BSD make
+   fix uninitialised memory reads in dlltest.c
+
+0.9.5b
+~~~~~~
+Open stdin/stdout in binary mode for DJGPP.
+
+0.9.5c
+~~~~~~
+Changed BZ_N_OVERSHOOT to be ... + 2 instead of ... + 1.  The + 1
+version could cause the sorted order to be wrong in some extremely
+obscure cases.  Also changed setting of quadrant in blocksort.c.
+
+0.9.5d
+~~~~~~
+The only functional change is to make bzlibVersion() in the library
+return the correct string.  This has no effect whatsoever on the
+functioning of the bzip2 program or library.  Added a couple of casts
+so the library compiles without warnings at level 3 in MS Visual
+Studio 6.0.  Included a Y2K statement in the file Y2K_INFO.  All other
+changes are minor documentation changes.
+
+1.0
+~~~
+Several minor bugfixes and enhancements:
+
+* Large file support.  The library uses 64-bit counters to
+  count the volume of data passing through it.  bzip2.c 
+  is now compiled with -D_FILE_OFFSET_BITS=64 to get large
+  file support from the C library.  -v correctly prints out
+  file sizes greater than 4 gigabytes.  All these changes have
+  been made without assuming a 64-bit platform or a C compiler
+  which supports 64-bit ints, so, except for the C library
+  aspect, they are fully portable.
+
+* Decompression robustness.  The library/program should be
+  robust to any corruption of compressed data, detecting and
+  handling _all_ corruption, instead of merely relying on
+  the CRCs.  What this means is that the program should 
+  never crash, given corrupted data, and the library should
+  always return BZ_DATA_ERROR.
+
+* Fixed an obscure race-condition bug only ever observed on
+  Solaris, in which, if you were very unlucky and issued
+  control-C at exactly the wrong time, both input and output
+  files would be deleted.
+
+* Don't run out of file handles on test/decompression when
+  large numbers of files have invalid magic numbers.
+
+* Avoid library namespace pollution.  Prefix all exported 
+  symbols with BZ2_.
+
+* Minor sorting enhancements from my DCC2000 paper.
+
+* Advance the version number to 1.0, so as to counteract the
+  (false-in-this-case) impression some people have that programs 
+  with version numbers less than 1.0 are in some way, experimental,
+  pre-release versions.
+
+* Create an initial Makefile-libbz2_so to build a shared library.
+  Yes, I know I should really use libtool et al ...
+
+* Make the program exit with 2 instead of 0 when decompression
+  fails due to a bad magic number (ie, an invalid bzip2 header).
+  Also exit with 1 (as the manual claims :-) whenever a diagnostic
+  message would have been printed AND the corresponding operation 
+  is aborted, for example
+     bzip2: Output file xx already exists.
+  When a diagnostic message is printed but the operation is not 
+  aborted, for example
+     bzip2: Can't guess original name for wurble -- using wurble.out
+  then the exit value 0 is returned, unless some other problem is
+  also detected.
+
+  I think it corresponds more closely to what the manual claims now.
+
+
+1.0.1
+~~~~~
+* Modified dlltest.c so it uses the new BZ2_ naming scheme.
+* Modified makefile-msc to fix minor build probs on Win2k.
+* Updated README.COMPILATION.PROBLEMS.
+
+There are no functionality changes or bug fixes relative to version
+1.0.0.  This is just a documentation update + a fix for minor Win32
+build problems.  For almost everyone, upgrading from 1.0.0 to 1.0.1 is
+utterly pointless.  Don't bother.
+
+
+1.0.2
+~~~~~
+A bug fix release, addressing various minor issues which have appeared
+in the 18 or so months since 1.0.1 was released.  Most of the fixes
+are to do with file-handling or documentation bugs.  To the best of my
+knowledge, there have been no data-loss-causing bugs reported in the
+compression/decompression engine of 1.0.0 or 1.0.1.
+
+Note that this release does not improve the rather crude build system
+for Unix platforms.  The general plan here is to autoconfiscate/
+libtoolise 1.0.2 soon after release, and release the result as 1.1.0
+or perhaps 1.2.0.  That, however, is still just a plan at this point.
+
+Here are the changes in 1.0.2.  Bug-reporters and/or patch-senders in
+parentheses.
+
+* Fix an infinite segfault loop in 1.0.1 when a directory is
+  encountered in -f (force) mode.
+     (Trond Eivind Glomsrod, Nicholas Nethercote, Volker Schmidt)
+
+* Avoid double fclose() of output file on certain I/O error paths.
+     (Solar Designer)
+
+* Don't fail with internal error 1007 when fed a long stream (> 48MB)
+  of byte 251.  Also print useful message suggesting that 1007s may be
+  caused by bad memory.
+     (noticed by Juan Pedro Vallejo, fixed by me)
+
+* Fix uninitialised variable silly bug in demo prog dlltest.c.
+     (Jorj Bauer)
+
+* Remove 512-MB limitation on recovered file size for bzip2recover
+  on selected platforms which support 64-bit ints.  At the moment
+  all GCC supported platforms, and Win32.
+     (me, Alson van der Meulen)
+
+* Hard-code header byte values, to give correct operation on platforms
+  using EBCDIC as their native character set (IBM's OS/390).
+     (Leland Lucius)
+
+* Copy file access times correctly.
+     (Marty Leisner)
+
+* Add distclean and check targets to Makefile.
+     (Michael Carmack)
+
+* Parameterise use of ar and ranlib in Makefile.  Also add $(LDFLAGS).
+     (Rich Ireland, Bo Thorsen)
+
+* Pass -p (create parent dirs as needed) to mkdir during make install.
+     (Jeremy Fusco)
+
+* Dereference symlinks when copying file permissions in -f mode.
+     (Volker Schmidt)
+
+* Majorly simplify implementation of uInt64_qrm10.
+     (Bo Lindbergh)
+
+* Check the input file still exists before deleting the output one,
+  when aborting in cleanUpAndFail().
+     (Joerg Prante, Robert Linden, Matthias Krings)
+
+Also a bunch of patches courtesy of Philippe Troin, the Debian maintainer
+of bzip2:
+
+* Wrapper scripts (with manpages): bzdiff, bzgrep, bzmore.
+
+* Spelling changes and minor enhancements in bzip2.1.
+
+* Avoid race condition between creating the output file and setting its
+  interim permissions safely, by using fopen_output_safely().
+  No changes to bzip2recover since there is no issue with file
+  permissions there.
+
+* do not print senseless report with -v when compressing an empty
+  file.
+
+* bzcat -f works on non-bzip2 files.
+
+* do not try to escape shell meta-characters on unix (the shell takes
+  care of these).
+
+* added --fast and --best aliases for -1 -9 for gzip compatibility.
+
+
+1.0.3 (15 Feb 05)
+~~~~~~~~~~~~~~~~~
+Fixes some minor bugs since the last version, 1.0.2.
+
+* Further robustification against corrupted compressed data.
+  There are currently no known bitstreams which can cause the
+  decompressor to crash, loop or access memory which does not
+  belong to it.  If you are using bzip2 or the library to 
+  decompress bitstreams from untrusted sources, an upgrade
+  to 1.0.3 is recommended.
+
+* The documentation has been converted to XML, from which html
+  and pdf can be derived.
+
+* Various minor bugs in the documentation have been fixed.
+
+* Fixes for various compilation warnings with newer versions of
+  gcc, and on 64-bit platforms.
+
+* The BZ_NO_STDIO cpp symbol was not properly observed in 1.0.2.
+  This has been fixed.
diff --git a/updater/bzip2-1.0.3/LICENSE b/updater/bzip2-1.0.3/LICENSE
new file mode 100644
index 0000000..e60845b
--- /dev/null
+++ b/updater/bzip2-1.0.3/LICENSE
@@ -0,0 +1,40 @@
+
+This program, "bzip2", the associated library "libbzip2", and all
+documentation, are copyright (C) 1996-2005 Julian R Seward.  All
+rights reserved.
+
+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. The origin of this software must not be misrepresented; you must 
+   not claim that you wrote the original software.  If you use this 
+   software in a product, an acknowledgment in the product 
+   documentation would be appreciated but is not required.
+
+3. Altered source versions must be plainly marked as such, and must
+   not be misrepresented as being the original software.
+
+4. 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 ``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 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.
+
+Julian Seward, Cambridge, UK.
+jseward@acm.org
+bzip2/libbzip2 version 1.0.3 of 15 February 2005
+
diff --git a/updater/bzip2-1.0.3/Makefile b/updater/bzip2-1.0.3/Makefile
new file mode 100644
index 0000000..eea329a
--- /dev/null
+++ b/updater/bzip2-1.0.3/Makefile
@@ -0,0 +1,205 @@
+
+SHELL=/bin/sh
+
+# To assist in cross-compiling
+CC=gcc
+AR=ar
+RANLIB=ranlib
+LDFLAGS=
+
+BIGFILES=-D_FILE_OFFSET_BITS=64
+CFLAGS=-Wall -Winline -O -g $(BIGFILES)
+
+# Where you want it installed when you do 'make install'
+PREFIX=/usr
+
+
+OBJS= blocksort.o  \
+      huffman.o    \
+      crctable.o   \
+      randtable.o  \
+      compress.o   \
+      decompress.o \
+      bzlib.o
+
+all: libbz2.a bzip2 bzip2recover test
+
+bzip2: libbz2.a bzip2.o
+	$(CC) $(CFLAGS) $(LDFLAGS) -o bzip2 bzip2.o -L. -lbz2
+
+bzip2recover: bzip2recover.o
+	$(CC) $(CFLAGS) $(LDFLAGS) -o bzip2recover bzip2recover.o
+
+libbz2.a: $(OBJS)
+	rm -f libbz2.a
+	$(AR) cq libbz2.a $(OBJS)
+	@if ( test -f $(RANLIB) -o -f /usr/bin/ranlib -o \
+		-f /bin/ranlib -o -f /usr/ccs/bin/ranlib ) ; then \
+		echo $(RANLIB) libbz2.a ; \
+		$(RANLIB) libbz2.a ; \
+	fi
+
+check: test
+test: bzip2
+	@cat words1
+	./bzip2 -1  < sample1.ref > sample1.rb2
+	./bzip2 -2  < sample2.ref > sample2.rb2
+	./bzip2 -3  < sample3.ref > sample3.rb2
+	./bzip2 -d  < sample1.bz2 > sample1.tst
+	./bzip2 -d  < sample2.bz2 > sample2.tst
+	./bzip2 -ds < sample3.bz2 > sample3.tst
+	cmp sample1.bz2 sample1.rb2 
+	cmp sample2.bz2 sample2.rb2
+	cmp sample3.bz2 sample3.rb2
+	cmp sample1.tst sample1.ref
+	cmp sample2.tst sample2.ref
+	cmp sample3.tst sample3.ref
+	@cat words3
+
+install: bzip2 bzip2recover
+	if ( test ! -d $(PREFIX)/bin ) ; then mkdir -p $(PREFIX)/bin ; fi
+	if ( test ! -d $(PREFIX)/lib ) ; then mkdir -p $(PREFIX)/lib ; fi
+	if ( test ! -d $(PREFIX)/man ) ; then mkdir -p $(PREFIX)/man ; fi
+	if ( test ! -d $(PREFIX)/man/man1 ) ; then mkdir -p $(PREFIX)/man/man1 ; fi
+	if ( test ! -d $(PREFIX)/include ) ; then mkdir -p $(PREFIX)/include ; fi
+	cp -f bzip2 $(PREFIX)/bin/bzip2
+	cp -f bzip2 $(PREFIX)/bin/bunzip2
+	cp -f bzip2 $(PREFIX)/bin/bzcat
+	cp -f bzip2recover $(PREFIX)/bin/bzip2recover
+	chmod a+x $(PREFIX)/bin/bzip2
+	chmod a+x $(PREFIX)/bin/bunzip2
+	chmod a+x $(PREFIX)/bin/bzcat
+	chmod a+x $(PREFIX)/bin/bzip2recover
+	cp -f bzip2.1 $(PREFIX)/man/man1
+	chmod a+r $(PREFIX)/man/man1/bzip2.1
+	cp -f bzlib.h $(PREFIX)/include
+	chmod a+r $(PREFIX)/include/bzlib.h
+	cp -f libbz2.a $(PREFIX)/lib
+	chmod a+r $(PREFIX)/lib/libbz2.a
+	cp -f bzgrep $(PREFIX)/bin/bzgrep
+	ln $(PREFIX)/bin/bzgrep $(PREFIX)/bin/bzegrep
+	ln $(PREFIX)/bin/bzgrep $(PREFIX)/bin/bzfgrep
+	chmod a+x $(PREFIX)/bin/bzgrep
+	cp -f bzmore $(PREFIX)/bin/bzmore
+	ln $(PREFIX)/bin/bzmore $(PREFIX)/bin/bzless
+	chmod a+x $(PREFIX)/bin/bzmore
+	cp -f bzdiff $(PREFIX)/bin/bzdiff
+	ln $(PREFIX)/bin/bzdiff $(PREFIX)/bin/bzcmp
+	chmod a+x $(PREFIX)/bin/bzdiff
+	cp -f bzgrep.1 bzmore.1 bzdiff.1 $(PREFIX)/man/man1
+	chmod a+r $(PREFIX)/man/man1/bzgrep.1
+	chmod a+r $(PREFIX)/man/man1/bzmore.1
+	chmod a+r $(PREFIX)/man/man1/bzdiff.1
+	echo ".so man1/bzgrep.1" > $(PREFIX)/man/man1/bzegrep.1
+	echo ".so man1/bzgrep.1" > $(PREFIX)/man/man1/bzfgrep.1
+	echo ".so man1/bzmore.1" > $(PREFIX)/man/man1/bzless.1
+	echo ".so man1/bzdiff.1" > $(PREFIX)/man/man1/bzcmp.1
+
+clean: 
+	rm -f *.o libbz2.a bzip2 bzip2recover \
+	sample1.rb2 sample2.rb2 sample3.rb2 \
+	sample1.tst sample2.tst sample3.tst
+
+blocksort.o: blocksort.c
+	@cat words0
+	$(CC) $(CFLAGS) -c blocksort.c
+huffman.o: huffman.c
+	$(CC) $(CFLAGS) -c huffman.c
+crctable.o: crctable.c
+	$(CC) $(CFLAGS) -c crctable.c
+randtable.o: randtable.c
+	$(CC) $(CFLAGS) -c randtable.c
+compress.o: compress.c
+	$(CC) $(CFLAGS) -c compress.c
+decompress.o: decompress.c
+	$(CC) $(CFLAGS) -c decompress.c
+bzlib.o: bzlib.c
+	$(CC) $(CFLAGS) -c bzlib.c
+bzip2.o: bzip2.c
+	$(CC) $(CFLAGS) -c bzip2.c
+bzip2recover.o: bzip2recover.c
+	$(CC) $(CFLAGS) -c bzip2recover.c
+
+
+distclean: clean
+	rm -f manual.ps manual.html manual.pdf
+
+DISTNAME=bzip2-1.0.3
+dist: check manual
+	rm -f $(DISTNAME)
+	ln -sf . $(DISTNAME)
+	tar cvf $(DISTNAME).tar \
+	   $(DISTNAME)/blocksort.c \
+	   $(DISTNAME)/huffman.c \
+	   $(DISTNAME)/crctable.c \
+	   $(DISTNAME)/randtable.c \
+	   $(DISTNAME)/compress.c \
+	   $(DISTNAME)/decompress.c \
+	   $(DISTNAME)/bzlib.c \
+	   $(DISTNAME)/bzip2.c \
+	   $(DISTNAME)/bzip2recover.c \
+	   $(DISTNAME)/bzlib.h \
+	   $(DISTNAME)/bzlib_private.h \
+	   $(DISTNAME)/Makefile \
+	   $(DISTNAME)/LICENSE \
+	   $(DISTNAME)/bzip2.1 \
+	   $(DISTNAME)/bzip2.1.preformatted \
+	   $(DISTNAME)/bzip2.txt \
+	   $(DISTNAME)/words0 \
+	   $(DISTNAME)/words1 \
+	   $(DISTNAME)/words2 \
+	   $(DISTNAME)/words3 \
+	   $(DISTNAME)/sample1.ref \
+	   $(DISTNAME)/sample2.ref \
+	   $(DISTNAME)/sample3.ref \
+	   $(DISTNAME)/sample1.bz2 \
+	   $(DISTNAME)/sample2.bz2 \
+	   $(DISTNAME)/sample3.bz2 \
+	   $(DISTNAME)/dlltest.c \
+	   $(DISTNAME)/manual.html \
+	   $(DISTNAME)/manual.pdf \
+	   $(DISTNAME)/manual.ps \
+	   $(DISTNAME)/README \
+	   $(DISTNAME)/README.COMPILATION.PROBLEMS \
+	   $(DISTNAME)/README.XML.STUFF \
+	   $(DISTNAME)/CHANGES \
+	   $(DISTNAME)/libbz2.def \
+	   $(DISTNAME)/libbz2.dsp \
+	   $(DISTNAME)/dlltest.dsp \
+	   $(DISTNAME)/makefile.msc \
+	   $(DISTNAME)/Y2K_INFO \
+	   $(DISTNAME)/unzcrash.c \
+	   $(DISTNAME)/spewG.c \
+	   $(DISTNAME)/mk251.c \
+	   $(DISTNAME)/bzdiff \
+	   $(DISTNAME)/bzdiff.1 \
+	   $(DISTNAME)/bzmore \
+	   $(DISTNAME)/bzmore.1 \
+	   $(DISTNAME)/bzgrep \
+	   $(DISTNAME)/bzgrep.1 \
+	   $(DISTNAME)/Makefile-libbz2_so \
+	   $(DISTNAME)/bz-common.xsl \
+	   $(DISTNAME)/bz-fo.xsl \
+	   $(DISTNAME)/bz-html.xsl \
+	   $(DISTNAME)/bzip.css \
+	   $(DISTNAME)/entities.xml \
+	   $(DISTNAME)/manual.xml \
+	   $(DISTNAME)/format.pl \
+	   $(DISTNAME)/xmlproc.sh
+	gzip -v $(DISTNAME).tar
+
+# For rebuilding the manual from sources on my SuSE 9.1 box
+
+MANUAL_SRCS= 	bz-common.xsl bz-fo.xsl bz-html.xsl bzip.css \
+		entities.xml manual.xml 
+
+manual: manual.html manual.ps manual.pdf
+
+manual.ps: $(MANUAL_SRCS)
+	./xmlproc.sh -ps manual.xml
+
+manual.pdf: $(MANUAL_SRCS)
+	./xmlproc.sh -pdf manual.xml
+
+manual.html: $(MANUAL_SRCS)
+	./xmlproc.sh -html manual.xml
diff --git a/updater/bzip2-1.0.3/Makefile-libbz2_so b/updater/bzip2-1.0.3/Makefile-libbz2_so
new file mode 100644
index 0000000..458c5a1
--- /dev/null
+++ b/updater/bzip2-1.0.3/Makefile-libbz2_so
@@ -0,0 +1,44 @@
+
+# This Makefile builds a shared version of the library, 
+# libbz2.so.1.0.3, with soname libbz2.so.1.0,
+# at least on x86-Linux (RedHat 7.2), 
+# with gcc-2.96 20000731 (Red Hat Linux 7.1 2.96-98).  
+# Please see the README file for some 
+# important info about building the library like this.
+
+SHELL=/bin/sh
+CC=gcc
+BIGFILES=-D_FILE_OFFSET_BITS=64
+CFLAGS=-fpic -fPIC -Wall -Winline -O -g
+
+OBJS= blocksort.o  \
+      huffman.o    \
+      crctable.o   \
+      randtable.o  \
+      compress.o   \
+      decompress.o \
+      bzlib.o
+
+all: $(OBJS)
+	$(CC) -shared -Wl,-soname -Wl,libbz2.so.1.0 -o libbz2.so.1.0.3 $(OBJS)
+	$(CC) $(CFLAGS) -o bzip2-shared bzip2.c libbz2.so.1.0.3
+	rm -f libbz2.so.1.0
+	ln -s libbz2.so.1.0.3 libbz2.so.1.0
+
+clean: 
+	rm -f $(OBJS) bzip2.o libbz2.so.1.0.3 libbz2.so.1.0 bzip2-shared
+
+blocksort.o: blocksort.c
+	$(CC) $(CFLAGS) -c blocksort.c
+huffman.o: huffman.c
+	$(CC) $(CFLAGS) -c huffman.c
+crctable.o: crctable.c
+	$(CC) $(CFLAGS) -c crctable.c
+randtable.o: randtable.c
+	$(CC) $(CFLAGS) -c randtable.c
+compress.o: compress.c
+	$(CC) $(CFLAGS) -c compress.c
+decompress.o: decompress.c
+	$(CC) $(CFLAGS) -c decompress.c
+bzlib.o: bzlib.c
+	$(CC) $(CFLAGS) -c bzlib.c
diff --git a/updater/bzip2-1.0.3/README b/updater/bzip2-1.0.3/README
new file mode 100644
index 0000000..1aff448
--- /dev/null
+++ b/updater/bzip2-1.0.3/README
@@ -0,0 +1,185 @@
+
+This is the README for bzip2, a block-sorting file compressor, version
+1.0.3.  This version is fully compatible with the previous public
+releases, versions 0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1 and 1.0.2.
+
+bzip2-1.0.3 is distributed under a BSD-style license.  For details,
+see the file LICENSE.
+
+Complete documentation is available in Postscript form (manual.ps),
+PDF (manual.pdf) or html (manual.html).  A plain-text version of the
+manual page is available as bzip2.txt.  A statement about Y2K issues
+is now included in the file Y2K_INFO.
+
+
+HOW TO BUILD -- UNIX
+
+Type `make'.  This builds the library libbz2.a and then the
+programs bzip2 and bzip2recover.  Six self-tests are run.
+If the self-tests complete ok, carry on to installation:
+
+To install in /usr/bin, /usr/lib, /usr/man and /usr/include, type
+   make install
+To install somewhere else, eg, /xxx/yyy/{bin,lib,man,include}, type 
+   make install PREFIX=/xxx/yyy
+If you are (justifiably) paranoid and want to see what 'make install'
+is going to do, you can first do
+   make -n install                      or
+   make -n install PREFIX=/xxx/yyy      respectively.
+The -n instructs make to show the commands it would execute, but
+not actually execute them.
+
+
+HOW TO BUILD -- UNIX, shared library libbz2.so.
+
+Do 'make -f Makefile-libbz2_so'.  This Makefile seems to work for
+Linux-ELF (RedHat 7.2 on an x86 box), with gcc.  I make no claims
+that it works for any other platform, though I suspect it probably
+will work for most platforms employing both ELF and gcc.
+
+bzip2-shared, a client of the shared library, is also built, but not
+self-tested.  So I suggest you also build using the normal Makefile,
+since that conducts a self-test.  A second reason to prefer the
+version statically linked to the library is that, on x86 platforms,
+building shared objects makes a valuable register (%ebx) unavailable
+to gcc, resulting in a slowdown of 10%-20%, at least for bzip2.
+
+Important note for people upgrading .so's from 0.9.0/0.9.5 to version
+1.0.X.  All the functions in the library have been renamed, from (eg)
+bzCompress to BZ2_bzCompress, to avoid namespace pollution.
+Unfortunately this means that the libbz2.so created by
+Makefile-libbz2_so will not work with any program which used an older
+version of the library.  Sorry.  I do encourage library clients to
+make the effort to upgrade to use version 1.0, since it is both faster
+and more robust than previous versions.
+
+
+HOW TO BUILD -- Windows 95, NT, DOS, Mac, etc.
+
+It's difficult for me to support compilation on all these platforms.
+My approach is to collect binaries for these platforms, and put them
+on the master web page (http://sources.redhat.com/bzip2).  Look there.
+However (FWIW), bzip2-1.0.X is very standard ANSI C and should compile
+unmodified with MS Visual C.  If you have difficulties building, you
+might want to read README.COMPILATION.PROBLEMS.
+
+At least using MS Visual C++ 6, you can build from the unmodified
+sources by issuing, in a command shell: 
+   nmake -f makefile.msc
+(you may need to first run the MSVC-provided script VCVARS32.BAT
+ so as to set up paths to the MSVC tools correctly).
+
+
+VALIDATION
+
+Correct operation, in the sense that a compressed file can always be
+decompressed to reproduce the original, is obviously of paramount
+importance.  To validate bzip2, I used a modified version of Mark
+Nelson's churn program.  Churn is an automated test driver which
+recursively traverses a directory structure, using bzip2 to compress
+and then decompress each file it encounters, and checking that the
+decompressed data is the same as the original.
+
+
+
+Please read and be aware of the following:
+
+WARNING:
+
+   This program (attempts to) compress data by performing several
+   non-trivial transformations on it.  Unless you are 100% familiar
+   with *all* the algorithms contained herein, and with the
+   consequences of modifying them, you should NOT meddle with the
+   compression or decompression machinery.  Incorrect changes can and
+   very likely *will* lead to disastrous loss of data.
+
+
+DISCLAIMER:
+
+   I TAKE NO RESPONSIBILITY FOR ANY LOSS OF DATA ARISING FROM THE
+   USE OF THIS PROGRAM, HOWSOEVER CAUSED.
+
+   Every compression of a file implies an assumption that the
+   compressed file can be decompressed to reproduce the original.
+   Great efforts in design, coding and testing have been made to
+   ensure that this program works correctly.  However, the complexity
+   of the algorithms, and, in particular, the presence of various
+   special cases in the code which occur with very low but non-zero
+   probability make it impossible to rule out the possibility of bugs
+   remaining in the program.  DO NOT COMPRESS ANY DATA WITH THIS
+   PROGRAM UNLESS YOU ARE PREPARED TO ACCEPT THE POSSIBILITY, HOWEVER
+   SMALL, THAT THE DATA WILL NOT BE RECOVERABLE.
+
+   That is not to say this program is inherently unreliable.  Indeed,
+   I very much hope the opposite is true.  bzip2 has been carefully
+   constructed and extensively tested.
+
+
+PATENTS:
+
+   To the best of my knowledge, bzip2 does not use any patented
+   algorithms.  However, I do not have the resources to carry out
+   a patent search.  Therefore I cannot give any guarantee of the
+   above statement.
+
+End of legalities.
+
+
+WHAT'S NEW IN 0.9.0 (as compared to 0.1pl2) ?
+
+   * Approx 10% faster compression, 30% faster decompression
+   * -t (test mode) is a lot quicker
+   * Can decompress concatenated compressed files
+   * Programming interface, so programs can directly read/write .bz2 files
+   * Less restrictive (BSD-style) licensing
+   * Flag handling more compatible with GNU gzip
+   * Much more documentation, i.e., a proper user manual
+   * Hopefully, improved portability (at least of the library)
+
+WHAT'S NEW IN 0.9.5 ?
+
+   * Compression speed is much less sensitive to the input
+     data than in previous versions.  Specifically, the very
+     slow performance caused by repetitive data is fixed.
+   * Many small improvements in file and flag handling.
+   * A Y2K statement.
+
+WHAT'S NEW IN 1.0.0 ?
+
+   See the CHANGES file.
+
+WHAT'S NEW IN 1.0.2 ?
+
+   See the CHANGES file.
+
+WHAT'S NEW IN 1.0.3 ?
+
+   See the CHANGES file.
+
+
+I hope you find bzip2 useful.  Feel free to contact me at
+   jseward@bzip.org
+if you have any suggestions or queries.  Many people mailed me with
+comments, suggestions and patches after the releases of bzip-0.15,
+bzip-0.21, and bzip2 versions 0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1 and
+1.0.2, and the changes in bzip2 are largely a result of this feedback.
+I thank you for your comments.
+
+At least for the time being, bzip2's "home" is (or can be reached via)
+http://www.bzip.org
+
+Julian Seward
+jseward@bzip.org
+
+Cambridge, UK.
+
+18     July 1996 (version 0.15)
+25   August 1996 (version 0.21)
+ 7   August 1997 (bzip2, version 0.1)
+29   August 1997 (bzip2, version 0.1pl2)
+23   August 1998 (bzip2, version 0.9.0)
+ 8     June 1999 (bzip2, version 0.9.5)
+ 4     Sept 1999 (bzip2, version 0.9.5d)
+ 5      May 2000 (bzip2, version 1.0pre8)
+30 December 2001 (bzip2, version 1.0.2pre1)
+15 February 2005 (bzip2, version 1.0.3)
diff --git a/updater/bzip2-1.0.3/README.COMPILATION.PROBLEMS b/updater/bzip2-1.0.3/README.COMPILATION.PROBLEMS
new file mode 100644
index 0000000..f1bc396
--- /dev/null
+++ b/updater/bzip2-1.0.3/README.COMPILATION.PROBLEMS
@@ -0,0 +1,39 @@
+
+bzip2-1.0.3 should compile without problems on the vast majority of
+platforms.  Using the supplied Makefile, I've built and tested it
+myself for x86-linux and x86_64-linux.  With makefile.msc, Visual C++
+6.0 and nmake, you can build a native Win32 version too.  Large file
+support seems to work correctly on at least alpha-tru64unix and
+x86-cygwin32 (on Windows 2000).
+
+When I say "large file" I mean a file of size 2,147,483,648 (2^31)
+bytes or above.  Many older OSs can't handle files above this size,
+but many newer ones can.  Large files are pretty huge -- most files
+you'll encounter are not Large Files.
+
+Earlier versions of bzip2 (0.1, 0.9.0, 0.9.5) compiled on a wide
+variety of platforms without difficulty, and I hope this version will
+continue in that tradition.  However, in order to support large files,
+I've had to include the define -D_FILE_OFFSET_BITS=64 in the Makefile.
+This can cause problems.
+
+The technique of adding -D_FILE_OFFSET_BITS=64 to get large file
+support is, as far as I know, the Recommended Way to get correct large
+file support.  For more details, see the Large File Support
+Specification, published by the Large File Summit, at
+   http://ftp.sas.com/standards/large.file
+
+As a general comment, if you get compilation errors which you think
+are related to large file support, try removing the above define from
+the Makefile, ie, delete the line
+   BIGFILES=-D_FILE_OFFSET_BITS=64 
+from the Makefile, and do 'make clean ; make'.  This will give you a
+version of bzip2 without large file support, which, for most
+applications, is probably not a problem.  
+
+Alternatively, try some of the platform-specific hints listed below.
+
+You can use the spewG.c program to generate huge files to test bzip2's
+large file support, if you are feeling paranoid.  Be aware though that
+any compilation problems which affect bzip2 will also affect spewG.c,
+alas.
diff --git a/updater/bzip2-1.0.3/README.XML.STUFF b/updater/bzip2-1.0.3/README.XML.STUFF
new file mode 100644
index 0000000..0ff209f
--- /dev/null
+++ b/updater/bzip2-1.0.3/README.XML.STUFF
@@ -0,0 +1,31 @@
+The script xmlproc.sh takes an xml file as input,
+and processes it to create .pdf, .html or .ps output.
+It uses format.pl, a perl script to format <pre> blocks nicely,
+ and add CDATA tags so writers do not have to use eg. &lt; 
+
+The file "entities.xml" must be edited to reflect current
+version, year, etc.
+
+
+Usage:
+
+  xmlproc.sh -v manual.xml
+  Validates an xml file to ensure no dtd-compliance errors
+
+  xmlproc.sh -html manual.xml
+  Output: manual.html
+
+  xmlproc.sh -pdf manual.xml
+  Output: manual.pdf
+
+  xmlproc.sh -ps manual.xml
+  Output: manual.ps
+
+
+Notum bene: 
+- pdfxmltex barfs if given a filename with an underscore in it
+
+- xmltex won't work yet - there's a bug in passivetex
+    which we are all waiting for Sebastian to fix.
+  So we are going the xml -> pdf -> ps route for the time being,
+    using pdfxmltex.
diff --git a/updater/bzip2-1.0.3/Y2K_INFO b/updater/bzip2-1.0.3/Y2K_INFO
new file mode 100644
index 0000000..55fd56a
--- /dev/null
+++ b/updater/bzip2-1.0.3/Y2K_INFO
@@ -0,0 +1,34 @@
+
+Y2K status of bzip2 and libbzip2, versions 0.1, 0.9.0 and 0.9.5
+~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+Informally speaking:
+   bzip2 is a compression program built on top of libbzip2, 
+   a library which does the real work of compression and 
+   decompression.  As far as I am aware, libbzip2 does not have 
+   any date-related code at all.
+
+   bzip2 itself copies dates from source to destination files 
+   when compressing or decompressing, using the 'stat' and 'utime' 
+   UNIX system calls.  It doesn't examine, manipulate or store the 
+   dates in any way.  So as far as I can see, there shouldn't be any 
+   problem with bzip2 providing 'stat' and 'utime' work correctly 
+   on your system.
+
+   On non-unix platforms (those for which BZ_UNIX in bzip2.c is
+   not set to 1), bzip2 doesn't even do the date copying.
+
+   Overall, informally speaking, I don't think bzip2 or libbzip2 
+   have a Y2K problem.
+
+Formally speaking:
+   I am not prepared to offer you any assurance whatsoever 
+   regarding Y2K issues in my software.  You alone assume the 
+   entire risk of using the software.  The disclaimer of liability 
+   in the LICENSE file in the bzip2 source distribution continues 
+   to apply on this issue as with every other issue pertaining 
+   to the software.
+
+Julian Seward
+Cambridge, UK
+25 August 1999
diff --git a/updater/bzip2-1.0.3/blocksort.c b/updater/bzip2-1.0.3/blocksort.c
new file mode 100644
index 0000000..33ec9f5
--- /dev/null
+++ b/updater/bzip2-1.0.3/blocksort.c
@@ -0,0 +1,1141 @@
+
+/*-------------------------------------------------------------*/
+/*--- Block sorting machinery                               ---*/
+/*---                                           blocksort.c ---*/
+/*-------------------------------------------------------------*/
+
+/*--
+  This file is a part of bzip2 and/or libbzip2, a program and
+  library for lossless, block-sorting data compression.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0 of 21 March 2000
+
+  This program is based on (at least) the work of:
+     Mike Burrows
+     David Wheeler
+     Peter Fenwick
+     Alistair Moffat
+     Radford Neal
+     Ian H. Witten
+     Robert Sedgewick
+     Jon L. Bentley
+
+  For more information on these sources, see the manual.
+
+  To get some idea how the block sorting algorithms in this file 
+  work, read my paper 
+     On the Performance of BWT Sorting Algorithms
+  in Proceedings of the IEEE Data Compression Conference 2000,
+  Snowbird, Utah, USA, 27-30 March 2000.  The main sort in this
+  file implements the algorithm called  cache  in the paper.
+--*/
+
+
+#include "bzlib_private.h"
+
+/*---------------------------------------------*/
+/*--- Fallback O(N log(N)^2) sorting        ---*/
+/*--- algorithm, for repetitive blocks      ---*/
+/*---------------------------------------------*/
+
+/*---------------------------------------------*/
+static 
+__inline__
+void fallbackSimpleSort ( UInt32* fmap, 
+                          UInt32* eclass, 
+                          Int32   lo, 
+                          Int32   hi )
+{
+   Int32 i, j, tmp;
+   UInt32 ec_tmp;
+
+   if (lo == hi) return;
+
+   if (hi - lo > 3) {
+      for ( i = hi-4; i >= lo; i-- ) {
+         tmp = fmap[i];
+         ec_tmp = eclass[tmp];
+         for ( j = i+4; j <= hi && ec_tmp > eclass[fmap[j]]; j += 4 )
+            fmap[j-4] = fmap[j];
+         fmap[j-4] = tmp;
+      }
+   }
+
+   for ( i = hi-1; i >= lo; i-- ) {
+      tmp = fmap[i];
+      ec_tmp = eclass[tmp];
+      for ( j = i+1; j <= hi && ec_tmp > eclass[fmap[j]]; j++ )
+         fmap[j-1] = fmap[j];
+      fmap[j-1] = tmp;
+   }
+}
+
+
+/*---------------------------------------------*/
+#define fswap(zz1, zz2) \
+   { Int32 zztmp = zz1; zz1 = zz2; zz2 = zztmp; }
+
+#define fvswap(zzp1, zzp2, zzn)       \
+{                                     \
+   Int32 yyp1 = (zzp1);               \
+   Int32 yyp2 = (zzp2);               \
+   Int32 yyn  = (zzn);                \
+   while (yyn > 0) {                  \
+      fswap(fmap[yyp1], fmap[yyp2]);  \
+      yyp1++; yyp2++; yyn--;          \
+   }                                  \
+}
+
+
+#define fmin(a,b) ((a) < (b)) ? (a) : (b)
+
+#define fpush(lz,hz) { stackLo[sp] = lz; \
+                       stackHi[sp] = hz; \
+                       sp++; }
+
+#define fpop(lz,hz) { sp--;              \
+                      lz = stackLo[sp];  \
+                      hz = stackHi[sp]; }
+
+#define FALLBACK_QSORT_SMALL_THRESH 10
+#define FALLBACK_QSORT_STACK_SIZE   100
+
+
+static
+void fallbackQSort3 ( UInt32* fmap, 
+                      UInt32* eclass,
+                      Int32   loSt, 
+                      Int32   hiSt )
+{
+   Int32 unLo, unHi, ltLo, gtHi, n, m;
+   Int32 sp, lo, hi;
+   UInt32 med, r, r3;
+   Int32 stackLo[FALLBACK_QSORT_STACK_SIZE];
+   Int32 stackHi[FALLBACK_QSORT_STACK_SIZE];
+
+   r = 0;
+
+   sp = 0;
+   fpush ( loSt, hiSt );
+
+   while (sp > 0) {
+
+      AssertH ( sp < FALLBACK_QSORT_STACK_SIZE, 1004 );
+
+      fpop ( lo, hi );
+      if (hi - lo < FALLBACK_QSORT_SMALL_THRESH) {
+         fallbackSimpleSort ( fmap, eclass, lo, hi );
+         continue;
+      }
+
+      /* Random partitioning.  Median of 3 sometimes fails to
+         avoid bad cases.  Median of 9 seems to help but 
+         looks rather expensive.  This too seems to work but
+         is cheaper.  Guidance for the magic constants 
+         7621 and 32768 is taken from Sedgewick's algorithms
+         book, chapter 35.
+      */
+      r = ((r * 7621) + 1) % 32768;
+      r3 = r % 3;
+      if (r3 == 0) med = eclass[fmap[lo]]; else
+      if (r3 == 1) med = eclass[fmap[(lo+hi)>>1]]; else
+                   med = eclass[fmap[hi]];
+
+      unLo = ltLo = lo;
+      unHi = gtHi = hi;
+
+      while (1) {
+         while (1) {
+            if (unLo > unHi) break;
+            n = (Int32)eclass[fmap[unLo]] - (Int32)med;
+            if (n == 0) { 
+               fswap(fmap[unLo], fmap[ltLo]); 
+               ltLo++; unLo++; 
+               continue; 
+            };
+            if (n > 0) break;
+            unLo++;
+         }
+         while (1) {
+            if (unLo > unHi) break;
+            n = (Int32)eclass[fmap[unHi]] - (Int32)med;
+            if (n == 0) { 
+               fswap(fmap[unHi], fmap[gtHi]); 
+               gtHi--; unHi--; 
+               continue; 
+            };
+            if (n < 0) break;
+            unHi--;
+         }
+         if (unLo > unHi) break;
+         fswap(fmap[unLo], fmap[unHi]); unLo++; unHi--;
+      }
+
+      AssertD ( unHi == unLo-1, "fallbackQSort3(2)" );
+
+      if (gtHi < ltLo) continue;
+
+      n = fmin(ltLo-lo, unLo-ltLo); fvswap(lo, unLo-n, n);
+      m = fmin(hi-gtHi, gtHi-unHi); fvswap(unLo, hi-m+1, m);
+
+      n = lo + unLo - ltLo - 1;
+      m = hi - (gtHi - unHi) + 1;
+
+      if (n - lo > hi - m) {
+         fpush ( lo, n );
+         fpush ( m, hi );
+      } else {
+         fpush ( m, hi );
+         fpush ( lo, n );
+      }
+   }
+}
+
+#undef fmin
+#undef fpush
+#undef fpop
+#undef fswap
+#undef fvswap
+#undef FALLBACK_QSORT_SMALL_THRESH
+#undef FALLBACK_QSORT_STACK_SIZE
+
+
+/*---------------------------------------------*/
+/* Pre:
+      nblock > 0
+      eclass exists for [0 .. nblock-1]
+      ((UChar*)eclass) [0 .. nblock-1] holds block
+      ptr exists for [0 .. nblock-1]
+
+   Post:
+      ((UChar*)eclass) [0 .. nblock-1] holds block
+      All other areas of eclass destroyed
+      fmap [0 .. nblock-1] holds sorted order
+      bhtab [ 0 .. 2+(nblock/32) ] destroyed
+*/
+
+#define       SET_BH(zz)  bhtab[(zz) >> 5] |= (1 << ((zz) & 31))
+#define     CLEAR_BH(zz)  bhtab[(zz) >> 5] &= ~(1 << ((zz) & 31))
+#define     ISSET_BH(zz)  (bhtab[(zz) >> 5] & (1 << ((zz) & 31)))
+#define      WORD_BH(zz)  bhtab[(zz) >> 5]
+#define UNALIGNED_BH(zz)  ((zz) & 0x01f)
+
+static
+void fallbackSort ( UInt32* fmap, 
+                    UInt32* eclass, 
+                    UInt32* bhtab,
+                    Int32   nblock,
+                    Int32   verb )
+{
+   Int32 ftab[257];
+   Int32 ftabCopy[256];
+   Int32 H, i, j, k, l, r, cc, cc1;
+   Int32 nNotDone;
+   Int32 nBhtab;
+   UChar* eclass8 = (UChar*)eclass;
+
+   /*--
+      Initial 1-char radix sort to generate
+      initial fmap and initial BH bits.
+   --*/
+   if (verb >= 4)
+      VPrintf0 ( "        bucket sorting ...\n" );
+   for (i = 0; i < 257;    i++) ftab[i] = 0;
+   for (i = 0; i < nblock; i++) ftab[eclass8[i]]++;
+   for (i = 0; i < 256;    i++) ftabCopy[i] = ftab[i];
+   for (i = 1; i < 257;    i++) ftab[i] += ftab[i-1];
+
+   for (i = 0; i < nblock; i++) {
+      j = eclass8[i];
+      k = ftab[j] - 1;
+      ftab[j] = k;
+      fmap[k] = i;
+   }
+
+   nBhtab = 2 + (nblock / 32);
+   for (i = 0; i < nBhtab; i++) bhtab[i] = 0;
+   for (i = 0; i < 256; i++) SET_BH(ftab[i]);
+
+   /*--
+      Inductively refine the buckets.  Kind-of an
+      "exponential radix sort" (!), inspired by the
+      Manber-Myers suffix array construction algorithm.
+   --*/
+
+   /*-- set sentinel bits for block-end detection --*/
+   for (i = 0; i < 32; i++) { 
+      SET_BH(nblock + 2*i);
+      CLEAR_BH(nblock + 2*i + 1);
+   }
+
+   /*-- the log(N) loop --*/
+   H = 1;
+   while (1) {
+
+      if (verb >= 4) 
+         VPrintf1 ( "        depth %6d has ", H );
+
+      j = 0;
+      for (i = 0; i < nblock; i++) {
+         if (ISSET_BH(i)) j = i;
+         k = fmap[i] - H; if (k < 0) k += nblock;
+         eclass[k] = j;
+      }
+
+      nNotDone = 0;
+      r = -1;
+      while (1) {
+
+	 /*-- find the next non-singleton bucket --*/
+         k = r + 1;
+         while (ISSET_BH(k) && UNALIGNED_BH(k)) k++;
+         if (ISSET_BH(k)) {
+            while (WORD_BH(k) == 0xffffffff) k += 32;
+            while (ISSET_BH(k)) k++;
+         }
+         l = k - 1;
+         if (l >= nblock) break;
+         while (!ISSET_BH(k) && UNALIGNED_BH(k)) k++;
+         if (!ISSET_BH(k)) {
+            while (WORD_BH(k) == 0x00000000) k += 32;
+            while (!ISSET_BH(k)) k++;
+         }
+         r = k - 1;
+         if (r >= nblock) break;
+
+         /*-- now [l, r] bracket current bucket --*/
+         if (r > l) {
+            nNotDone += (r - l + 1);
+            fallbackQSort3 ( fmap, eclass, l, r );
+
+            /*-- scan bucket and generate header bits-- */
+            cc = -1;
+            for (i = l; i <= r; i++) {
+               cc1 = eclass[fmap[i]];
+               if (cc != cc1) { SET_BH(i); cc = cc1; };
+            }
+         }
+      }
+
+      if (verb >= 4) 
+         VPrintf1 ( "%6d unresolved strings\n", nNotDone );
+
+      H *= 2;
+      if (H > nblock || nNotDone == 0) break;
+   }
+
+   /*-- 
+      Reconstruct the original block in
+      eclass8 [0 .. nblock-1], since the
+      previous phase destroyed it.
+   --*/
+   if (verb >= 4)
+      VPrintf0 ( "        reconstructing block ...\n" );
+   j = 0;
+   for (i = 0; i < nblock; i++) {
+      while (ftabCopy[j] == 0) j++;
+      ftabCopy[j]--;
+      eclass8[fmap[i]] = (UChar)j;
+   }
+   AssertH ( j < 256, 1005 );
+}
+
+#undef       SET_BH
+#undef     CLEAR_BH
+#undef     ISSET_BH
+#undef      WORD_BH
+#undef UNALIGNED_BH
+
+
+/*---------------------------------------------*/
+/*--- The main, O(N^2 log(N)) sorting       ---*/
+/*--- algorithm.  Faster for "normal"       ---*/
+/*--- non-repetitive blocks.                ---*/
+/*---------------------------------------------*/
+
+/*---------------------------------------------*/
+static
+__inline__
+Bool mainGtU ( UInt32  i1, 
+               UInt32  i2,
+               UChar*  block, 
+               UInt16* quadrant,
+               UInt32  nblock,
+               Int32*  budget )
+{
+   Int32  k;
+   UChar  c1, c2;
+   UInt16 s1, s2;
+
+   AssertD ( i1 != i2, "mainGtU" );
+   /* 1 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 2 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 3 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 4 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 5 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 6 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 7 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 8 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 9 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 10 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 11 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+   /* 12 */
+   c1 = block[i1]; c2 = block[i2];
+   if (c1 != c2) return (c1 > c2);
+   i1++; i2++;
+
+   k = nblock + 8;
+
+   do {
+      /* 1 */
+      c1 = block[i1]; c2 = block[i2];
+      if (c1 != c2) return (c1 > c2);
+      s1 = quadrant[i1]; s2 = quadrant[i2];
+      if (s1 != s2) return (s1 > s2);
+      i1++; i2++;
+      /* 2 */
+      c1 = block[i1]; c2 = block[i2];
+      if (c1 != c2) return (c1 > c2);
+      s1 = quadrant[i1]; s2 = quadrant[i2];
+      if (s1 != s2) return (s1 > s2);
+      i1++; i2++;
+      /* 3 */
+      c1 = block[i1]; c2 = block[i2];
+      if (c1 != c2) return (c1 > c2);
+      s1 = quadrant[i1]; s2 = quadrant[i2];
+      if (s1 != s2) return (s1 > s2);
+      i1++; i2++;
+      /* 4 */
+      c1 = block[i1]; c2 = block[i2];
+      if (c1 != c2) return (c1 > c2);
+      s1 = quadrant[i1]; s2 = quadrant[i2];
+      if (s1 != s2) return (s1 > s2);
+      i1++; i2++;
+      /* 5 */
+      c1 = block[i1]; c2 = block[i2];
+      if (c1 != c2) return (c1 > c2);
+      s1 = quadrant[i1]; s2 = quadrant[i2];
+      if (s1 != s2) return (s1 > s2);
+      i1++; i2++;
+      /* 6 */
+      c1 = block[i1]; c2 = block[i2];
+      if (c1 != c2) return (c1 > c2);
+      s1 = quadrant[i1]; s2 = quadrant[i2];
+      if (s1 != s2) return (s1 > s2);
+      i1++; i2++;
+      /* 7 */
+      c1 = block[i1]; c2 = block[i2];
+      if (c1 != c2) return (c1 > c2);
+      s1 = quadrant[i1]; s2 = quadrant[i2];
+      if (s1 != s2) return (s1 > s2);
+      i1++; i2++;
+      /* 8 */
+      c1 = block[i1]; c2 = block[i2];
+      if (c1 != c2) return (c1 > c2);
+      s1 = quadrant[i1]; s2 = quadrant[i2];
+      if (s1 != s2) return (s1 > s2);
+      i1++; i2++;
+
+      if (i1 >= nblock) i1 -= nblock;
+      if (i2 >= nblock) i2 -= nblock;
+
+      k -= 8;
+      (*budget)--;
+   }
+      while (k >= 0);
+
+   return False;
+}
+
+
+/*---------------------------------------------*/
+/*--
+   Knuth's increments seem to work better
+   than Incerpi-Sedgewick here.  Possibly
+   because the number of elems to sort is
+   usually small, typically <= 20.
+--*/
+static
+Int32 incs[14] = { 1, 4, 13, 40, 121, 364, 1093, 3280,
+                   9841, 29524, 88573, 265720,
+                   797161, 2391484 };
+
+static
+void mainSimpleSort ( UInt32* ptr,
+                      UChar*  block,
+                      UInt16* quadrant,
+                      Int32   nblock,
+                      Int32   lo, 
+                      Int32   hi, 
+                      Int32   d,
+                      Int32*  budget )
+{
+   Int32 i, j, h, bigN, hp;
+   UInt32 v;
+
+   bigN = hi - lo + 1;
+   if (bigN < 2) return;
+
+   hp = 0;
+   while (incs[hp] < bigN) hp++;
+   hp--;
+
+   for (; hp >= 0; hp--) {
+      h = incs[hp];
+
+      i = lo + h;
+      while (True) {
+
+         /*-- copy 1 --*/
+         if (i > hi) break;
+         v = ptr[i];
+         j = i;
+         while ( mainGtU ( 
+                    ptr[j-h]+d, v+d, block, quadrant, nblock, budget 
+                 ) ) {
+            ptr[j] = ptr[j-h];
+            j = j - h;
+            if (j <= (lo + h - 1)) break;
+         }
+         ptr[j] = v;
+         i++;
+
+         /*-- copy 2 --*/
+         if (i > hi) break;
+         v = ptr[i];
+         j = i;
+         while ( mainGtU ( 
+                    ptr[j-h]+d, v+d, block, quadrant, nblock, budget 
+                 ) ) {
+            ptr[j] = ptr[j-h];
+            j = j - h;
+            if (j <= (lo + h - 1)) break;
+         }
+         ptr[j] = v;
+         i++;
+
+         /*-- copy 3 --*/
+         if (i > hi) break;
+         v = ptr[i];
+         j = i;
+         while ( mainGtU ( 
+                    ptr[j-h]+d, v+d, block, quadrant, nblock, budget 
+                 ) ) {
+            ptr[j] = ptr[j-h];
+            j = j - h;
+            if (j <= (lo + h - 1)) break;
+         }
+         ptr[j] = v;
+         i++;
+
+         if (*budget < 0) return;
+      }
+   }
+}
+
+
+/*---------------------------------------------*/
+/*--
+   The following is an implementation of
+   an elegant 3-way quicksort for strings,
+   described in a paper "Fast Algorithms for
+   Sorting and Searching Strings", by Robert
+   Sedgewick and Jon L. Bentley.
+--*/
+
+#define mswap(zz1, zz2) \
+   { Int32 zztmp = zz1; zz1 = zz2; zz2 = zztmp; }
+
+#define mvswap(zzp1, zzp2, zzn)       \
+{                                     \
+   Int32 yyp1 = (zzp1);               \
+   Int32 yyp2 = (zzp2);               \
+   Int32 yyn  = (zzn);                \
+   while (yyn > 0) {                  \
+      mswap(ptr[yyp1], ptr[yyp2]);    \
+      yyp1++; yyp2++; yyn--;          \
+   }                                  \
+}
+
+static 
+__inline__
+UChar mmed3 ( UChar a, UChar b, UChar c )
+{
+   UChar t;
+   if (a > b) { t = a; a = b; b = t; };
+   if (b > c) { 
+      b = c;
+      if (a > b) b = a;
+   }
+   return b;
+}
+
+#define mmin(a,b) ((a) < (b)) ? (a) : (b)
+
+#define mpush(lz,hz,dz) { stackLo[sp] = lz; \
+                          stackHi[sp] = hz; \
+                          stackD [sp] = dz; \
+                          sp++; }
+
+#define mpop(lz,hz,dz) { sp--;             \
+                         lz = stackLo[sp]; \
+                         hz = stackHi[sp]; \
+                         dz = stackD [sp]; }
+
+
+#define mnextsize(az) (nextHi[az]-nextLo[az])
+
+#define mnextswap(az,bz)                                        \
+   { Int32 tz;                                                  \
+     tz = nextLo[az]; nextLo[az] = nextLo[bz]; nextLo[bz] = tz; \
+     tz = nextHi[az]; nextHi[az] = nextHi[bz]; nextHi[bz] = tz; \
+     tz = nextD [az]; nextD [az] = nextD [bz]; nextD [bz] = tz; }
+
+
+#define MAIN_QSORT_SMALL_THRESH 20
+#define MAIN_QSORT_DEPTH_THRESH (BZ_N_RADIX + BZ_N_QSORT)
+#define MAIN_QSORT_STACK_SIZE 100
+
+static
+void mainQSort3 ( UInt32* ptr,
+                  UChar*  block,
+                  UInt16* quadrant,
+                  Int32   nblock,
+                  Int32   loSt, 
+                  Int32   hiSt, 
+                  Int32   dSt,
+                  Int32*  budget )
+{
+   Int32 unLo, unHi, ltLo, gtHi, n, m, med;
+   Int32 sp, lo, hi, d;
+
+   Int32 stackLo[MAIN_QSORT_STACK_SIZE];
+   Int32 stackHi[MAIN_QSORT_STACK_SIZE];
+   Int32 stackD [MAIN_QSORT_STACK_SIZE];
+
+   Int32 nextLo[3];
+   Int32 nextHi[3];
+   Int32 nextD [3];
+
+   sp = 0;
+   mpush ( loSt, hiSt, dSt );
+
+   while (sp > 0) {
+
+      AssertH ( sp < MAIN_QSORT_STACK_SIZE, 1001 );
+
+      mpop ( lo, hi, d );
+      if (hi - lo < MAIN_QSORT_SMALL_THRESH || 
+          d > MAIN_QSORT_DEPTH_THRESH) {
+         mainSimpleSort ( ptr, block, quadrant, nblock, lo, hi, d, budget );
+         if (*budget < 0) return;
+         continue;
+      }
+
+      med = (Int32) 
+            mmed3 ( block[ptr[ lo         ]+d],
+                    block[ptr[ hi         ]+d],
+                    block[ptr[ (lo+hi)>>1 ]+d] );
+
+      unLo = ltLo = lo;
+      unHi = gtHi = hi;
+
+      while (True) {
+         while (True) {
+            if (unLo > unHi) break;
+            n = ((Int32)block[ptr[unLo]+d]) - med;
+            if (n == 0) { 
+               mswap(ptr[unLo], ptr[ltLo]); 
+               ltLo++; unLo++; continue; 
+            };
+            if (n >  0) break;
+            unLo++;
+         }
+         while (True) {
+            if (unLo > unHi) break;
+            n = ((Int32)block[ptr[unHi]+d]) - med;
+            if (n == 0) { 
+               mswap(ptr[unHi], ptr[gtHi]); 
+               gtHi--; unHi--; continue; 
+            };
+            if (n <  0) break;
+            unHi--;
+         }
+         if (unLo > unHi) break;
+         mswap(ptr[unLo], ptr[unHi]); unLo++; unHi--;
+      }
+
+      AssertD ( unHi == unLo-1, "mainQSort3(2)" );
+
+      if (gtHi < ltLo) {
+         mpush(lo, hi, d+1 );
+         continue;
+      }
+
+      n = mmin(ltLo-lo, unLo-ltLo); mvswap(lo, unLo-n, n);
+      m = mmin(hi-gtHi, gtHi-unHi); mvswap(unLo, hi-m+1, m);
+
+      n = lo + unLo - ltLo - 1;
+      m = hi - (gtHi - unHi) + 1;
+
+      nextLo[0] = lo;  nextHi[0] = n;   nextD[0] = d;
+      nextLo[1] = m;   nextHi[1] = hi;  nextD[1] = d;
+      nextLo[2] = n+1; nextHi[2] = m-1; nextD[2] = d+1;
+
+      if (mnextsize(0) < mnextsize(1)) mnextswap(0,1);
+      if (mnextsize(1) < mnextsize(2)) mnextswap(1,2);
+      if (mnextsize(0) < mnextsize(1)) mnextswap(0,1);
+
+      AssertD (mnextsize(0) >= mnextsize(1), "mainQSort3(8)" );
+      AssertD (mnextsize(1) >= mnextsize(2), "mainQSort3(9)" );
+
+      mpush (nextLo[0], nextHi[0], nextD[0]);
+      mpush (nextLo[1], nextHi[1], nextD[1]);
+      mpush (nextLo[2], nextHi[2], nextD[2]);
+   }
+}
+
+#undef mswap
+#undef mvswap
+#undef mpush
+#undef mpop
+#undef mmin
+#undef mnextsize
+#undef mnextswap
+#undef MAIN_QSORT_SMALL_THRESH
+#undef MAIN_QSORT_DEPTH_THRESH
+#undef MAIN_QSORT_STACK_SIZE
+
+
+/*---------------------------------------------*/
+/* Pre:
+      nblock > N_OVERSHOOT
+      block32 exists for [0 .. nblock-1 +N_OVERSHOOT]
+      ((UChar*)block32) [0 .. nblock-1] holds block
+      ptr exists for [0 .. nblock-1]
+
+   Post:
+      ((UChar*)block32) [0 .. nblock-1] holds block
+      All other areas of block32 destroyed
+      ftab [0 .. 65536 ] destroyed
+      ptr [0 .. nblock-1] holds sorted order
+      if (*budget < 0), sorting was abandoned
+*/
+
+#define BIGFREQ(b) (ftab[((b)+1) << 8] - ftab[(b) << 8])
+#define SETMASK (1 << 21)
+#define CLEARMASK (~(SETMASK))
+
+static
+void mainSort ( UInt32* ptr, 
+                UChar*  block,
+                UInt16* quadrant, 
+                UInt32* ftab,
+                Int32   nblock,
+                Int32   verb,
+                Int32*  budget )
+{
+   Int32  i, j, k, ss, sb;
+   Int32  runningOrder[256];
+   Bool   bigDone[256];
+   Int32  copyStart[256];
+   Int32  copyEnd  [256];
+   UChar  c1;
+   Int32  numQSorted;
+   UInt16 s;
+   if (verb >= 4) VPrintf0 ( "        main sort initialise ...\n" );
+
+   /*-- set up the 2-byte frequency table --*/
+   for (i = 65536; i >= 0; i--) ftab[i] = 0;
+
+   j = block[0] << 8;
+   i = nblock-1;
+   for (; i >= 3; i -= 4) {
+      quadrant[i] = 0;
+      j = (j >> 8) | ( ((UInt16)block[i]) << 8);
+      ftab[j]++;
+      quadrant[i-1] = 0;
+      j = (j >> 8) | ( ((UInt16)block[i-1]) << 8);
+      ftab[j]++;
+      quadrant[i-2] = 0;
+      j = (j >> 8) | ( ((UInt16)block[i-2]) << 8);
+      ftab[j]++;
+      quadrant[i-3] = 0;
+      j = (j >> 8) | ( ((UInt16)block[i-3]) << 8);
+      ftab[j]++;
+   }
+   for (; i >= 0; i--) {
+      quadrant[i] = 0;
+      j = (j >> 8) | ( ((UInt16)block[i]) << 8);
+      ftab[j]++;
+   }
+
+   /*-- (emphasises close relationship of block & quadrant) --*/
+   for (i = 0; i < BZ_N_OVERSHOOT; i++) {
+      block   [nblock+i] = block[i];
+      quadrant[nblock+i] = 0;
+   }
+
+   if (verb >= 4) VPrintf0 ( "        bucket sorting ...\n" );
+
+   /*-- Complete the initial radix sort --*/
+   for (i = 1; i <= 65536; i++) ftab[i] += ftab[i-1];
+
+   s = block[0] << 8;
+   i = nblock-1;
+   for (; i >= 3; i -= 4) {
+      s = (s >> 8) | (block[i] << 8);
+      j = ftab[s] -1;
+      ftab[s] = j;
+      ptr[j] = i;
+      s = (s >> 8) | (block[i-1] << 8);
+      j = ftab[s] -1;
+      ftab[s] = j;
+      ptr[j] = i-1;
+      s = (s >> 8) | (block[i-2] << 8);
+      j = ftab[s] -1;
+      ftab[s] = j;
+      ptr[j] = i-2;
+      s = (s >> 8) | (block[i-3] << 8);
+      j = ftab[s] -1;
+      ftab[s] = j;
+      ptr[j] = i-3;
+   }
+   for (; i >= 0; i--) {
+      s = (s >> 8) | (block[i] << 8);
+      j = ftab[s] -1;
+      ftab[s] = j;
+      ptr[j] = i;
+   }
+
+   /*--
+      Now ftab contains the first loc of every small bucket.
+      Calculate the running order, from smallest to largest
+      big bucket.
+   --*/
+   for (i = 0; i <= 255; i++) {
+      bigDone     [i] = False;
+      runningOrder[i] = i;
+   }
+
+   {
+      Int32 vv;
+      Int32 h = 1;
+      do h = 3 * h + 1; while (h <= 256);
+      do {
+         h = h / 3;
+         for (i = h; i <= 255; i++) {
+            vv = runningOrder[i];
+            j = i;
+            while ( BIGFREQ(runningOrder[j-h]) > BIGFREQ(vv) ) {
+               runningOrder[j] = runningOrder[j-h];
+               j = j - h;
+               if (j <= (h - 1)) goto zero;
+            }
+            zero:
+            runningOrder[j] = vv;
+         }
+      } while (h != 1);
+   }
+
+   /*--
+      The main sorting loop.
+   --*/
+
+   numQSorted = 0;
+
+   for (i = 0; i <= 255; i++) {
+
+      /*--
+         Process big buckets, starting with the least full.
+         Basically this is a 3-step process in which we call
+         mainQSort3 to sort the small buckets [ss, j], but
+         also make a big effort to avoid the calls if we can.
+      --*/
+      ss = runningOrder[i];
+
+      /*--
+         Step 1:
+         Complete the big bucket [ss] by quicksorting
+         any unsorted small buckets [ss, j], for j != ss.  
+         Hopefully previous pointer-scanning phases have already
+         completed many of the small buckets [ss, j], so
+         we don't have to sort them at all.
+      --*/
+      for (j = 0; j <= 255; j++) {
+         if (j != ss) {
+            sb = (ss << 8) + j;
+            if ( ! (ftab[sb] & SETMASK) ) {
+               Int32 lo = ftab[sb]   & CLEARMASK;
+               Int32 hi = (ftab[sb+1] & CLEARMASK) - 1;
+               if (hi > lo) {
+                  if (verb >= 4)
+                     VPrintf4 ( "        qsort [0x%x, 0x%x]   "
+                                "done %d   this %d\n",
+                                ss, j, numQSorted, hi - lo + 1 );
+                  mainQSort3 ( 
+                     ptr, block, quadrant, nblock, 
+                     lo, hi, BZ_N_RADIX, budget 
+                  );   
+                  numQSorted += (hi - lo + 1);
+                  if (*budget < 0) return;
+               }
+            }
+            ftab[sb] |= SETMASK;
+         }
+      }
+
+      AssertH ( !bigDone[ss], 1006 );
+
+      /*--
+         Step 2:
+         Now scan this big bucket [ss] so as to synthesise the
+         sorted order for small buckets [t, ss] for all t,
+         including, magically, the bucket [ss,ss] too.
+         This will avoid doing Real Work in subsequent Step 1's.
+      --*/
+      {
+         for (j = 0; j <= 255; j++) {
+            copyStart[j] =  ftab[(j << 8) + ss]     & CLEARMASK;
+            copyEnd  [j] = (ftab[(j << 8) + ss + 1] & CLEARMASK) - 1;
+         }
+         for (j = ftab[ss << 8] & CLEARMASK; j < copyStart[ss]; j++) {
+            k = ptr[j]-1; if (k < 0) k += nblock;
+            c1 = block[k];
+            if (!bigDone[c1])
+               ptr[ copyStart[c1]++ ] = k;
+         }
+         for (j = (ftab[(ss+1) << 8] & CLEARMASK) - 1; j > copyEnd[ss]; j--) {
+            k = ptr[j]-1; if (k < 0) k += nblock;
+            c1 = block[k];
+            if (!bigDone[c1]) 
+               ptr[ copyEnd[c1]-- ] = k;
+         }
+      }
+
+      AssertH ( (copyStart[ss]-1 == copyEnd[ss])
+                || 
+                /* Extremely rare case missing in bzip2-1.0.0 and 1.0.1.
+                   Necessity for this case is demonstrated by compressing 
+                   a sequence of approximately 48.5 million of character 
+                   251; 1.0.0/1.0.1 will then die here. */
+                (copyStart[ss] == 0 && copyEnd[ss] == nblock-1),
+                1007 )
+
+      for (j = 0; j <= 255; j++) ftab[(j << 8) + ss] |= SETMASK;
+
+      /*--
+         Step 3:
+         The [ss] big bucket is now done.  Record this fact,
+         and update the quadrant descriptors.  Remember to
+         update quadrants in the overshoot area too, if
+         necessary.  The "if (i < 255)" test merely skips
+         this updating for the last bucket processed, since
+         updating for the last bucket is pointless.
+
+         The quadrant array provides a way to incrementally
+         cache sort orderings, as they appear, so as to 
+         make subsequent comparisons in fullGtU() complete
+         faster.  For repetitive blocks this makes a big
+         difference (but not big enough to be able to avoid
+         the fallback sorting mechanism, exponential radix sort).
+
+         The precise meaning is: at all times:
+
+            for 0 <= i < nblock and 0 <= j <= nblock
+
+            if block[i] != block[j], 
+
+               then the relative values of quadrant[i] and 
+                    quadrant[j] are meaningless.
+
+               else {
+                  if quadrant[i] < quadrant[j]
+                     then the string starting at i lexicographically
+                     precedes the string starting at j
+
+                  else if quadrant[i] > quadrant[j]
+                     then the string starting at j lexicographically
+                     precedes the string starting at i
+
+                  else
+                     the relative ordering of the strings starting
+                     at i and j has not yet been determined.
+               }
+      --*/
+      bigDone[ss] = True;
+
+      if (i < 255) {
+         Int32 bbStart  = ftab[ss << 8] & CLEARMASK;
+         Int32 bbSize   = (ftab[(ss+1) << 8] & CLEARMASK) - bbStart;
+         Int32 shifts   = 0;
+
+         while ((bbSize >> shifts) > 65534) shifts++;
+
+         for (j = bbSize-1; j >= 0; j--) {
+            Int32 a2update     = ptr[bbStart + j];
+            UInt16 qVal        = (UInt16)(j >> shifts);
+            quadrant[a2update] = qVal;
+            if (a2update < BZ_N_OVERSHOOT)
+               quadrant[a2update + nblock] = qVal;
+         }
+         AssertH ( ((bbSize-1) >> shifts) <= 65535, 1002 );
+      }
+
+   }
+
+   if (verb >= 4)
+      VPrintf3 ( "        %d pointers, %d sorted, %d scanned\n",
+                 nblock, numQSorted, nblock - numQSorted );
+}
+
+#undef BIGFREQ
+#undef SETMASK
+#undef CLEARMASK
+
+
+/*---------------------------------------------*/
+/* Pre:
+      nblock > 0
+      arr2 exists for [0 .. nblock-1 +N_OVERSHOOT]
+      ((UChar*)arr2)  [0 .. nblock-1] holds block
+      arr1 exists for [0 .. nblock-1]
+
+   Post:
+      ((UChar*)arr2) [0 .. nblock-1] holds block
+      All other areas of block destroyed
+      ftab [ 0 .. 65536 ] destroyed
+      arr1 [0 .. nblock-1] holds sorted order
+*/
+void BZ2_blockSort ( EState* s )
+{
+   UInt32* ptr    = s->ptr; 
+   UChar*  block  = s->block;
+   UInt32* ftab   = s->ftab;
+   Int32   nblock = s->nblock;
+   Int32   verb   = s->verbosity;
+   Int32   wfact  = s->workFactor;
+   UInt16* quadrant;
+   Int32   budget;
+   Int32   budgetInit;
+   Int32   i;
+
+   if (nblock < 10000) {
+      fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
+   } else {
+      /* Calculate the location for quadrant, remembering to get
+         the alignment right.  Assumes that &(block[0]) is at least
+         2-byte aligned -- this should be ok since block is really
+         the first section of arr2.
+      */
+      i = nblock+BZ_N_OVERSHOOT;
+      if (i & 1) i++;
+      quadrant = (UInt16*)(&(block[i]));
+
+      /* (wfact-1) / 3 puts the default-factor-30
+         transition point at very roughly the same place as 
+         with v0.1 and v0.9.0.  
+         Not that it particularly matters any more, since the
+         resulting compressed stream is now the same regardless
+         of whether or not we use the main sort or fallback sort.
+      */
+      if (wfact < 1  ) wfact = 1;
+      if (wfact > 100) wfact = 100;
+      budgetInit = nblock * ((wfact-1) / 3);
+      budget = budgetInit;
+
+      mainSort ( ptr, block, quadrant, ftab, nblock, verb, &budget );
+      if (verb >= 3) 
+         VPrintf3 ( "      %d work, %d block, ratio %5.2f\n",
+                    budgetInit - budget,
+                    nblock, 
+                    (float)(budgetInit - budget) /
+                    (float)(nblock==0 ? 1 : nblock) ); 
+      if (budget < 0) {
+         if (verb >= 2) 
+            VPrintf0 ( "    too repetitive; using fallback"
+                       " sorting algorithm\n" );
+         fallbackSort ( s->arr1, s->arr2, ftab, nblock, verb );
+      }
+   }
+
+   s->origPtr = -1;
+   for (i = 0; i < s->nblock; i++)
+      if (ptr[i] == 0)
+         { s->origPtr = i; break; };
+
+   AssertH( s->origPtr != -1, 1003 );
+}
+
+
+/*-------------------------------------------------------------*/
+/*--- end                                       blocksort.c ---*/
+/*-------------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/bz-common.xsl b/updater/bzip2-1.0.3/bz-common.xsl
new file mode 100644
index 0000000..66fcd6f
--- /dev/null
+++ b/updater/bzip2-1.0.3/bz-common.xsl
@@ -0,0 +1,39 @@
+<?xml version="1.0"?> <!-- -*- sgml -*- -->
+<xsl:stylesheet 
+     xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
+
+<!-- we like '1.2 Title' -->
+<xsl:param name="section.autolabel" select="'1'"/> 
+<xsl:param name="section.label.includes.component.label" select="'1'"/>
+
+<!-- Do not put 'Chapter' at the start of eg 'Chapter 1. Doing This' -->
+<xsl:param name="local.l10n.xml" select="document('')"/> 
+<l:i18n xmlns:l="http://docbook.sourceforge.net/xmlns/l10n/1.0"> 
+  <l:l10n language="en"> 
+    <l:context name="title-numbered">
+      <l:template name="chapter" text="%n.&#160;%t"/>
+    </l:context> 
+  </l:l10n>
+</l:i18n>
+
+<!-- don't generate sub-tocs for qanda sets -->
+<xsl:param name="generate.toc">
+set       toc,title
+book      toc,title,figure,table,example,equation
+chapter   toc,title
+section   toc
+sect1     toc
+sect2     toc
+sect3     toc
+sect4     nop
+sect5     nop
+qandaset  toc
+qandadiv  nop
+appendix  toc,title
+article/appendix  nop
+article   toc,title
+preface   toc,title
+reference toc,title
+</xsl:param>
+
+</xsl:stylesheet>
diff --git a/updater/bzip2-1.0.3/bz-fo.xsl b/updater/bzip2-1.0.3/bz-fo.xsl
new file mode 100644
index 0000000..7f2a767
--- /dev/null
+++ b/updater/bzip2-1.0.3/bz-fo.xsl
@@ -0,0 +1,257 @@
+<?xml version="1.0" encoding="UTF-8"?> <!-- -*- sgml -*- -->
+<xsl:stylesheet xmlns:xsl="http://www.w3.org/1999/XSL/Transform" 
+     xmlns:fo="http://www.w3.org/1999/XSL/Format" version="1.0">
+
+<xsl:import href="http://docbook.sourceforge.net/release/xsl/current/fo/docbook.xsl"/>
+<xsl:import href="bz-common.xsl"/>
+
+<!-- set indent = yes while debugging, then change to NO -->
+<xsl:output method="xml" indent="yes"/>
+
+<!-- ensure only passivetex extensions are on -->
+<xsl:param name="stylesheet.result.type" select="'fo'"/>
+<!-- fo extensions: PDF bookmarks and index terms -->
+<xsl:param name="use.extensions" select="'1'"/>
+<xsl:param name="xep.extensions" select="0"/>      
+<xsl:param name="fop.extensions" select="0"/>     
+<xsl:param name="saxon.extensions" select="0"/>   
+<xsl:param name="passivetex.extensions" select="1"/>
+<xsl:param name="tablecolumns.extension" select="'1'"/>
+
+<!-- ensure we are using single sided -->
+<xsl:param name="double.sided" select="'0'"/> 
+
+<!-- insert cross references to page numbers -->
+<xsl:param name="insert.xref.page.number" select="1"/>
+
+<!-- <?custom-pagebreak?> inserts a page break at this point -->
+<xsl:template match="processing-instruction('custom-pagebreak')">
+  <fo:block break-before='page'/>
+</xsl:template>
+
+<!-- show links in color -->
+<xsl:attribute-set name="xref.properties">
+  <xsl:attribute name="color">blue</xsl:attribute>
+</xsl:attribute-set>
+
+<!-- make pre listings indented a bit + a bg colour -->
+<xsl:template match="programlisting | screen">
+  <fo:block start-indent="0.25in" wrap-option="no-wrap" 
+            white-space-collapse="false" text-align="start" 
+            font-family="monospace" background-color="#f2f2f9"
+            linefeed-treatment="preserve" 
+            xsl:use-attribute-sets="normal.para.spacing">
+    <xsl:apply-templates/>
+  </fo:block>
+</xsl:template>
+<!-- make verbatim output prettier -->
+<xsl:template match="literallayout">
+  <fo:block start-indent="0.25in" wrap-option="no-wrap" 
+            white-space-collapse="false" text-align="start" 
+            font-family="monospace" background-color="#edf7f4"
+            linefeed-treatment="preserve" 
+            space-before="0em" space-after="0em">
+    <xsl:apply-templates/>
+  </fo:block>
+</xsl:template>
+
+<!-- workaround bug in passivetex fo output for itemizedlist -->
+<xsl:template match="itemizedlist/listitem">
+  <xsl:variable name="id">
+  <xsl:call-template name="object.id"/></xsl:variable>
+  <xsl:variable name="itemsymbol">
+    <xsl:call-template name="list.itemsymbol">
+      <xsl:with-param name="node" select="parent::itemizedlist"/>
+    </xsl:call-template>
+  </xsl:variable>
+  <xsl:variable name="item.contents">
+    <fo:list-item-label end-indent="label-end()">
+      <fo:block>
+        <xsl:choose>
+          <xsl:when test="$itemsymbol='disc'">&#x2022;</xsl:when>
+          <xsl:when test="$itemsymbol='bullet'">&#x2022;</xsl:when>
+          <xsl:otherwise>&#x2022;</xsl:otherwise>
+        </xsl:choose>
+      </fo:block>
+    </fo:list-item-label>
+    <fo:list-item-body start-indent="body-start()">
+      <xsl:apply-templates/>    <!-- removed extra block wrapper -->
+    </fo:list-item-body>
+  </xsl:variable>
+  <xsl:choose>
+    <xsl:when test="parent::*/@spacing = 'compact'">
+      <fo:list-item id="{$id}" 
+          xsl:use-attribute-sets="compact.list.item.spacing">
+        <xsl:copy-of select="$item.contents"/>
+      </fo:list-item>
+    </xsl:when>
+    <xsl:otherwise>
+      <fo:list-item id="{$id}" xsl:use-attribute-sets="list.item.spacing">
+        <xsl:copy-of select="$item.contents"/>
+      </fo:list-item>
+    </xsl:otherwise>
+  </xsl:choose>
+</xsl:template>
+
+<!-- workaround bug in passivetex fo output for orderedlist -->
+<xsl:template match="orderedlist/listitem">
+  <xsl:variable name="id">
+  <xsl:call-template name="object.id"/></xsl:variable>
+  <xsl:variable name="item.contents">
+    <fo:list-item-label end-indent="label-end()">
+      <fo:block>
+        <xsl:apply-templates select="." mode="item-number"/>
+      </fo:block>
+    </fo:list-item-label>
+    <fo:list-item-body start-indent="body-start()">
+      <xsl:apply-templates/>    <!-- removed extra block wrapper -->
+    </fo:list-item-body>
+  </xsl:variable>
+  <xsl:choose>
+    <xsl:when test="parent::*/@spacing = 'compact'">
+      <fo:list-item id="{$id}" 
+          xsl:use-attribute-sets="compact.list.item.spacing">
+        <xsl:copy-of select="$item.contents"/>
+      </fo:list-item>
+    </xsl:when>
+    <xsl:otherwise>
+      <fo:list-item id="{$id}" xsl:use-attribute-sets="list.item.spacing">
+        <xsl:copy-of select="$item.contents"/>
+      </fo:list-item>
+    </xsl:otherwise>
+  </xsl:choose>
+</xsl:template>
+
+<!-- workaround bug in passivetex fo output for variablelist -->
+<xsl:param name="variablelist.as.blocks" select="1"/>
+<xsl:template match="varlistentry" mode="vl.as.blocks">
+  <xsl:variable name="id">
+    <xsl:call-template name="object.id"/></xsl:variable>
+  <fo:block id="{$id}" xsl:use-attribute-sets="list.item.spacing"  
+      keep-together.within-column="always" 
+      keep-with-next.within-column="always">
+    <xsl:apply-templates select="term"/>
+  </fo:block>
+  <fo:block start-indent="0.5in" end-indent="0in" 
+            space-after.minimum="0.2em" 
+            space-after.optimum="0.4em" 
+            space-after.maximum="0.6em">
+    <fo:block>
+      <xsl:apply-templates select="listitem"/>
+    </fo:block>
+  </fo:block>
+</xsl:template>
+
+
+<!-- workaround bug in footers: force right-align w/two 80|30 cols -->
+<xsl:template name="footer.table">
+  <xsl:param name="pageclass" select="''"/>
+  <xsl:param name="sequence" select="''"/>
+  <xsl:param name="gentext-key" select="''"/>
+  <xsl:choose>
+    <xsl:when test="$pageclass = 'index'">
+      <xsl:attribute name="margin-left">0pt</xsl:attribute>
+    </xsl:when>
+  </xsl:choose>
+  <xsl:variable name="candidate">
+    <fo:table table-layout="fixed" width="100%">
+      <fo:table-column column-number="1" column-width="80%"/>
+      <fo:table-column column-number="2" column-width="20%"/>
+      <fo:table-body>
+        <fo:table-row height="14pt">
+          <fo:table-cell text-align="left" display-align="after">
+            <xsl:attribute name="relative-align">baseline</xsl:attribute>
+            <fo:block> 
+              <fo:block> </fo:block><!-- empty cell -->
+            </fo:block>
+          </fo:table-cell>
+          <fo:table-cell text-align="center" display-align="after">
+            <xsl:attribute name="relative-align">baseline</xsl:attribute>
+            <fo:block>
+              <xsl:call-template name="footer.content">
+                <xsl:with-param name="pageclass" select="$pageclass"/>
+                <xsl:with-param name="sequence" select="$sequence"/>
+                <xsl:with-param name="position" select="'center'"/>
+                <xsl:with-param name="gentext-key" select="$gentext-key"/>
+              </xsl:call-template>
+            </fo:block>
+          </fo:table-cell>
+        </fo:table-row>
+      </fo:table-body>
+    </fo:table>
+  </xsl:variable>
+  <!-- Really output a footer? -->
+  <xsl:choose>
+    <xsl:when test="$pageclass='titlepage' and $gentext-key='book'
+                    and $sequence='first'">
+      <!-- no, book titlepages have no footers at all -->
+    </xsl:when>
+    <xsl:when test="$sequence = 'blank' and $footers.on.blank.pages = 0">
+      <!-- no output -->
+    </xsl:when>
+    <xsl:otherwise>
+      <xsl:copy-of select="$candidate"/>
+    </xsl:otherwise>
+  </xsl:choose>
+</xsl:template>
+
+
+<!-- fix bug in headers: force right-align w/two 40|60 cols -->
+<xsl:template name="header.table">
+  <xsl:param name="pageclass" select="''"/>
+  <xsl:param name="sequence" select="''"/>
+  <xsl:param name="gentext-key" select="''"/>
+  <xsl:choose>
+    <xsl:when test="$pageclass = 'index'">
+      <xsl:attribute name="margin-left">0pt</xsl:attribute>
+    </xsl:when>
+  </xsl:choose>
+  <xsl:variable name="candidate">
+    <fo:table table-layout="fixed" width="100%">
+      <xsl:call-template name="head.sep.rule">
+        <xsl:with-param name="pageclass" select="$pageclass"/>
+        <xsl:with-param name="sequence" select="$sequence"/>
+        <xsl:with-param name="gentext-key" select="$gentext-key"/>
+      </xsl:call-template>
+      <fo:table-column column-number="1" column-width="40%"/>
+      <fo:table-column column-number="2" column-width="60%"/>
+      <fo:table-body>
+        <fo:table-row height="14pt">
+          <fo:table-cell text-align="left" display-align="before">
+            <xsl:attribute name="relative-align">baseline</xsl:attribute>
+            <fo:block>
+              <fo:block> </fo:block><!-- empty cell -->
+            </fo:block>
+          </fo:table-cell>
+          <fo:table-cell text-align="center" display-align="before">
+            <xsl:attribute name="relative-align">baseline</xsl:attribute>
+            <fo:block>
+              <xsl:call-template name="header.content">
+                <xsl:with-param name="pageclass" select="$pageclass"/>
+                <xsl:with-param name="sequence" select="$sequence"/>
+                <xsl:with-param name="position" select="'center'"/>
+                <xsl:with-param name="gentext-key" select="$gentext-key"/>
+              </xsl:call-template>
+            </fo:block>
+          </fo:table-cell>
+        </fo:table-row>
+      </fo:table-body>
+    </fo:table>
+  </xsl:variable>
+  <!-- Really output a header? -->
+  <xsl:choose>
+    <xsl:when test="$pageclass = 'titlepage' and $gentext-key = 'book'
+                    and $sequence='first'">
+      <!-- no, book titlepages have no headers at all -->
+    </xsl:when>
+    <xsl:when test="$sequence = 'blank' and $headers.on.blank.pages = 0">
+      <!-- no output -->
+    </xsl:when>
+    <xsl:otherwise>
+      <xsl:copy-of select="$candidate"/>
+    </xsl:otherwise>
+  </xsl:choose>
+</xsl:template>
+
+
+</xsl:stylesheet>
diff --git a/updater/bzip2-1.0.3/bz-html.xsl b/updater/bzip2-1.0.3/bz-html.xsl
new file mode 100644
index 0000000..1785fff
--- /dev/null
+++ b/updater/bzip2-1.0.3/bz-html.xsl
@@ -0,0 +1,20 @@
+<?xml version="1.0"?> <!-- -*- sgml -*- -->
+<!DOCTYPE xsl:stylesheet [ <!ENTITY bz-css SYSTEM "./bzip.css"> ]>
+
+<xsl:stylesheet 
+   xmlns:xsl="http://www.w3.org/1999/XSL/Transform" version="1.0">
+
+<xsl:import href="http://docbook.sourceforge.net/release/xsl/current/html/docbook.xsl"/>
+<xsl:import href="bz-common.xsl"/>
+
+<!-- use 8859-1 encoding -->
+<xsl:output method="html" encoding="ISO-8859-1" indent="yes"/>
+
+<!-- we include the css directly when generating one large file -->
+<xsl:template name="user.head.content">  
+  <style type="text/css" media="screen">
+    <xsl:text>&bz-css;</xsl:text>
+  </style>
+</xsl:template>
+
+</xsl:stylesheet>
diff --git a/updater/bzip2-1.0.3/bzdiff b/updater/bzip2-1.0.3/bzdiff
new file mode 100644
index 0000000..3c2eb85
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzdiff
@@ -0,0 +1,76 @@
+#!/bin/sh
+# sh is buggy on RS/6000 AIX 3.2. Replace above line with #!/bin/ksh
+
+# Bzcmp/diff wrapped for bzip2, 
+# adapted from zdiff by Philippe Troin <phil@fifi.org> for Debian GNU/Linux.
+
+# Bzcmp and bzdiff are used to invoke the cmp or the  diff  pro-
+# gram  on compressed files.  All options specified are passed
+# directly to cmp or diff.  If only 1 file is specified,  then
+# the  files  compared  are file1 and an uncompressed file1.gz.
+# If two files are specified, then they are  uncompressed  (if
+# necessary) and fed to cmp or diff.  The exit status from cmp
+# or diff is preserved.
+
+PATH="/usr/bin:$PATH"; export PATH
+prog=`echo $0 | sed 's|.*/||'`
+case "$prog" in
+  *cmp) comp=${CMP-cmp}   ;;
+  *)    comp=${DIFF-diff} ;;
+esac
+
+OPTIONS=
+FILES=
+for ARG
+do
+    case "$ARG" in
+    -*)	OPTIONS="$OPTIONS $ARG";;
+     *)	if test -f "$ARG"; then
+            FILES="$FILES $ARG"
+        else
+            echo "${prog}: $ARG not found or not a regular file"
+	    exit 1
+        fi ;;
+    esac
+done
+if test -z "$FILES"; then
+	echo "Usage: $prog [${comp}_options] file [file]"
+	exit 1
+fi
+tmp=`tempfile -d /tmp -p bz` || {
+      echo 'cannot create a temporary file' >&2
+      exit 1
+}
+set $FILES
+if test $# -eq 1; then
+	FILE=`echo "$1" | sed 's/.bz2$//'`
+	bzip2 -cd "$FILE.bz2" | $comp $OPTIONS - "$FILE"
+	STAT="$?"
+
+elif test $# -eq 2; then
+	case "$1" in
+        *.bz2)
+                case "$2" in
+	        *.bz2)
+			F=`echo "$2" | sed 's|.*/||;s|.bz2$||'`
+                        bzip2 -cdfq "$2" > $tmp
+                        bzip2 -cdfq "$1" | $comp $OPTIONS - $tmp
+                        STAT="$?"
+			/bin/rm -f $tmp;;
+
+                *)      bzip2 -cdfq "$1" | $comp $OPTIONS - "$2"
+                        STAT="$?";;
+                esac;;
+        *)      case "$2" in
+	        *.bz2)
+                        bzip2 -cdfq "$2" | $comp $OPTIONS "$1" -
+                        STAT="$?";;
+                *)      $comp $OPTIONS "$1" "$2"
+                        STAT="$?";;
+                esac;;
+	esac
+        exit "$STAT"
+else
+	echo "Usage: $prog [${comp}_options] file [file]"
+	exit 1
+fi
diff --git a/updater/bzip2-1.0.3/bzdiff.1 b/updater/bzip2-1.0.3/bzdiff.1
new file mode 100644
index 0000000..adb7a8e
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzdiff.1
@@ -0,0 +1,47 @@
+\"Shamelessly copied from zmore.1 by Philippe Troin <phil@fifi.org>
+\"for Debian GNU/Linux
+.TH BZDIFF 1
+.SH NAME
+bzcmp, bzdiff \- compare bzip2 compressed files
+.SH SYNOPSIS
+.B bzcmp
+[ cmp_options ] file1
+[ file2 ]
+.br
+.B bzdiff
+[ diff_options ] file1
+[ file2 ]
+.SH DESCRIPTION
+.I  Bzcmp
+and 
+.I bzdiff
+are used to invoke the
+.I cmp
+or the
+.I diff
+program on bzip2 compressed files.  All options specified are passed
+directly to
+.I cmp
+or
+.IR diff "."
+If only 1 file is specified, then the files compared are
+.I file1
+and an uncompressed
+.IR file1 ".bz2."
+If two files are specified, then they are uncompressed if necessary and fed to
+.I cmp
+or
+.IR diff "."
+The exit status from 
+.I cmp
+or
+.I diff
+is preserved.
+.SH "SEE ALSO"
+cmp(1), diff(1), bzmore(1), bzless(1), bzgrep(1), bzip2(1)
+.SH BUGS
+Messages from the
+.I cmp
+or
+.I diff
+programs refer to temporary filenames instead of those specified.
diff --git a/updater/bzip2-1.0.3/bzgrep b/updater/bzip2-1.0.3/bzgrep
new file mode 100644
index 0000000..dbfc00e
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzgrep
@@ -0,0 +1,71 @@
+#!/bin/sh
+
+# Bzgrep wrapped for bzip2, 
+# adapted from zgrep by Philippe Troin <phil@fifi.org> for Debian GNU/Linux.
+## zgrep notice:
+## zgrep -- a wrapper around a grep program that decompresses files as needed
+## Adapted from a version sent by Charles Levert <charles@comm.polymtl.ca>
+
+PATH="/usr/bin:$PATH"; export PATH
+
+prog=`echo $0 | sed 's|.*/||'`
+case "$prog" in
+	*egrep)	grep=${EGREP-egrep}	;;
+	*fgrep)	grep=${FGREP-fgrep}	;;
+	*)	grep=${GREP-grep}	;;
+esac
+pat=""
+while test $# -ne 0; do
+  case "$1" in
+  -e | -f) opt="$opt $1"; shift; pat="$1"
+           if test "$grep" = grep; then  # grep is buggy with -e on SVR4
+             grep=egrep
+           fi;;
+  -A | -B) opt="$opt $1 $2"; shift;;
+  -*)	   opt="$opt $1";;
+   *)      if test -z "$pat"; then
+	     pat="$1"
+	   else
+	     break;
+           fi;;
+  esac
+  shift
+done
+
+if test -z "$pat"; then
+  echo "grep through bzip2 files"
+  echo "usage: $prog [grep_options] pattern [files]"
+  exit 1
+fi
+
+list=0
+silent=0
+op=`echo "$opt" | sed -e 's/ //g' -e 's/-//g'`
+case "$op" in
+  *l*) list=1
+esac
+case "$op" in
+  *h*) silent=1
+esac
+
+if test $# -eq 0; then
+  bzip2 -cdfq | $grep $opt "$pat"
+  exit $?
+fi
+
+res=0
+for i do
+  if test -f "$i"; then :; else if test -f "$i.bz2"; then i="$i.bz2"; fi; fi
+  if test $list -eq 1; then
+    bzip2 -cdfq "$i" | $grep $opt "$pat" 2>&1 > /dev/null && echo $i
+    r=$?
+  elif test $# -eq 1 -o $silent -eq 1; then
+    bzip2 -cdfq "$i" | $grep $opt "$pat"
+    r=$?
+  else
+    bzip2 -cdfq "$i" | $grep $opt "$pat" | sed "s|^|${i}:|"
+    r=$?
+  fi
+  test "$r" -ne 0 && res="$r"
+done
+exit $res
diff --git a/updater/bzip2-1.0.3/bzgrep.1 b/updater/bzip2-1.0.3/bzgrep.1
new file mode 100644
index 0000000..930af8c
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzgrep.1
@@ -0,0 +1,56 @@
+\"Shamelessly copied from zmore.1 by Philippe Troin <phil@fifi.org>
+\"for Debian GNU/Linux
+.TH BZGREP 1
+.SH NAME
+bzgrep, bzfgrep, bzegrep \- search possibly bzip2 compressed files for a regular expression
+.SH SYNOPSIS
+.B bzgrep
+[ grep_options ]
+.BI  [\ -e\ ] " pattern"
+.IR filename ".\|.\|."
+.br
+.B bzegrep
+[ egrep_options ]
+.BI  [\ -e\ ] " pattern"
+.IR filename ".\|.\|."
+.br
+.B bzfgrep
+[ fgrep_options ]
+.BI  [\ -e\ ] " pattern"
+.IR filename ".\|.\|."
+.SH DESCRIPTION
+.IR  Bzgrep
+is used to invoke the
+.I grep
+on bzip2-compressed files. All options specified are passed directly to
+.I grep.
+If no file is specified, then the standard input is decompressed
+if necessary and fed to grep.
+Otherwise the given files are uncompressed if necessary and fed to
+.I grep.
+.PP
+If
+.I bzgrep
+is invoked as
+.I bzegrep
+or
+.I bzfgrep
+then
+.I egrep
+or
+.I fgrep
+is used instead of
+.I grep.
+If the GREP environment variable is set,
+.I bzgrep
+uses it as the
+.I grep
+program to be invoked. For example:
+
+    for sh:  GREP=fgrep  bzgrep string files
+    for csh: (setenv GREP fgrep; bzgrep string files)
+.SH AUTHOR
+Charles Levert (charles@comm.polymtl.ca). Adapted to bzip2 by Philippe
+Troin <phil@fifi.org> for Debian GNU/Linux.
+.SH "SEE ALSO"
+grep(1), egrep(1), fgrep(1), bzdiff(1), bzmore(1), bzless(1), bzip2(1)
diff --git a/updater/bzip2-1.0.3/bzip.css b/updater/bzip2-1.0.3/bzip.css
new file mode 100644
index 0000000..43193d8
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzip.css
@@ -0,0 +1,74 @@
+/* Colours:
+#74240f  dark brown      h1, h2, h3, h4
+#336699  medium blue     links
+#339999  turquoise       link hover colour
+#202020  almost black    general text
+#761596  purple          md5sum text
+#626262  dark gray       pre border
+#eeeeee  very light gray pre background
+#f2f2f9  very light blue nav table background
+#3366cc  medium blue     nav table border
+*/
+
+a, a:link, a:visited, a:active { color: #336699; }
+a:hover { color: #339999; }
+
+body { font: 80%/126% sans-serif; }
+h1, h2, h3, h4 { color: #74240f; }
+
+dt { color: #336699; font-weight: bold }
+dd { 
+ margin-left: 1.5em; 
+ padding-bottom: 0.8em;
+}
+
+/* -- ruler -- */
+div.hr_blue { 
+  height:  3px; 
+  background:#ffffff url("/images/hr_blue.png") repeat-x; }
+div.hr_blue hr { display:none; }
+
+/* release styles */
+#release p { margin-top: 0.4em; }
+#release .md5sum { color: #761596; }
+
+
+/* ------ styles for docs|manuals|howto ------ */
+/* -- lists -- */
+ul  { 
+ margin:     0px 4px 16px 16px;
+ padding:    0px;
+ list-style: url("/images/li-blue.png"); 
+}
+ul li { 
+ margin-bottom: 10px;
+}
+ul ul	{ 
+ list-style-type:  none; 
+ list-style-image: none; 
+ margin-left:      0px; 
+}
+
+/* header / footer nav tables */
+table.nav {
+ border:     solid 1px #3366cc;
+ background: #f2f2f9;
+ background-color: #f2f2f9;
+ margin-bottom: 0.5em;
+}
+/* don't have underlined links in chunked nav menus */
+table.nav a { text-decoration: none; }
+table.nav a:hover { text-decoration: underline; }
+table.nav td { font-size: 85%; }
+
+code, tt, pre { font-size: 120%; }
+code, tt { color: #761596; }
+
+div.literallayout, pre.programlisting, pre.screen {
+ color:      #000000;
+ padding:    0.5em;
+ background: #eeeeee;
+ border:     1px solid #626262;
+ background-color: #eeeeee;
+ margin: 4px 0px 4px 0px; 
+}
diff --git a/updater/bzip2-1.0.3/bzip2.1 b/updater/bzip2-1.0.3/bzip2.1
new file mode 100644
index 0000000..d2c0661
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzip2.1
@@ -0,0 +1,454 @@
+.PU
+.TH bzip2 1
+.SH NAME
+bzip2, bunzip2 \- a block-sorting file compressor, v1.0.3
+.br
+bzcat \- decompresses files to stdout
+.br
+bzip2recover \- recovers data from damaged bzip2 files
+
+.SH SYNOPSIS
+.ll +8
+.B bzip2
+.RB [ " \-cdfkqstvzVL123456789 " ]
+[
+.I "filenames \&..."
+]
+.ll -8
+.br
+.B bunzip2
+.RB [ " \-fkvsVL " ]
+[ 
+.I "filenames \&..."
+]
+.br
+.B bzcat
+.RB [ " \-s " ]
+[ 
+.I "filenames \&..."
+]
+.br
+.B bzip2recover
+.I "filename"
+
+.SH DESCRIPTION
+.I bzip2
+compresses files using the Burrows-Wheeler block sorting
+text compression algorithm, and Huffman coding.  Compression is
+generally considerably better than that achieved by more conventional
+LZ77/LZ78-based compressors, and approaches the performance of the PPM
+family of statistical compressors.
+
+The command-line options are deliberately very similar to 
+those of 
+.I GNU gzip, 
+but they are not identical.
+
+.I bzip2
+expects a list of file names to accompany the
+command-line flags.  Each file is replaced by a compressed version of
+itself, with the name "original_name.bz2".  
+Each compressed file
+has the same modification date, permissions, and, when possible,
+ownership as the corresponding original, so that these properties can
+be correctly restored at decompression time.  File name handling is
+naive in the sense that there is no mechanism for preserving original
+file names, permissions, ownerships or dates in filesystems which lack
+these concepts, or have serious file name length restrictions, such as
+MS-DOS.
+
+.I bzip2
+and
+.I bunzip2
+will by default not overwrite existing
+files.  If you want this to happen, specify the \-f flag.
+
+If no file names are specified,
+.I bzip2
+compresses from standard
+input to standard output.  In this case,
+.I bzip2
+will decline to
+write compressed output to a terminal, as this would be entirely
+incomprehensible and therefore pointless.
+
+.I bunzip2
+(or
+.I bzip2 \-d) 
+decompresses all
+specified files.  Files which were not created by 
+.I bzip2
+will be detected and ignored, and a warning issued.  
+.I bzip2
+attempts to guess the filename for the decompressed file 
+from that of the compressed file as follows:
+
+       filename.bz2    becomes   filename
+       filename.bz     becomes   filename
+       filename.tbz2   becomes   filename.tar
+       filename.tbz    becomes   filename.tar
+       anyothername    becomes   anyothername.out
+
+If the file does not end in one of the recognised endings, 
+.I .bz2, 
+.I .bz, 
+.I .tbz2
+or
+.I .tbz, 
+.I bzip2 
+complains that it cannot
+guess the name of the original file, and uses the original name
+with
+.I .out
+appended.
+
+As with compression, supplying no
+filenames causes decompression from 
+standard input to standard output.
+
+.I bunzip2 
+will correctly decompress a file which is the
+concatenation of two or more compressed files.  The result is the
+concatenation of the corresponding uncompressed files.  Integrity
+testing (\-t) 
+of concatenated 
+compressed files is also supported.
+
+You can also compress or decompress files to the standard output by
+giving the \-c flag.  Multiple files may be compressed and
+decompressed like this.  The resulting outputs are fed sequentially to
+stdout.  Compression of multiple files 
+in this manner generates a stream
+containing multiple compressed file representations.  Such a stream
+can be decompressed correctly only by
+.I bzip2 
+version 0.9.0 or
+later.  Earlier versions of
+.I bzip2
+will stop after decompressing
+the first file in the stream.
+
+.I bzcat
+(or
+.I bzip2 -dc) 
+decompresses all specified files to
+the standard output.
+
+.I bzip2
+will read arguments from the environment variables
+.I BZIP2
+and
+.I BZIP,
+in that order, and will process them
+before any arguments read from the command line.  This gives a 
+convenient way to supply default arguments.
+
+Compression is always performed, even if the compressed 
+file is slightly
+larger than the original.  Files of less than about one hundred bytes
+tend to get larger, since the compression mechanism has a constant
+overhead in the region of 50 bytes.  Random data (including the output
+of most file compressors) is coded at about 8.05 bits per byte, giving
+an expansion of around 0.5%.
+
+As a self-check for your protection, 
+.I 
+bzip2
+uses 32-bit CRCs to
+make sure that the decompressed version of a file is identical to the
+original.  This guards against corruption of the compressed data, and
+against undetected bugs in
+.I bzip2
+(hopefully very unlikely).  The
+chances of data corruption going undetected is microscopic, about one
+chance in four billion for each file processed.  Be aware, though, that
+the check occurs upon decompression, so it can only tell you that
+something is wrong.  It can't help you 
+recover the original uncompressed
+data.  You can use 
+.I bzip2recover
+to try to recover data from
+damaged files.
+
+Return values: 0 for a normal exit, 1 for environmental problems (file
+not found, invalid flags, I/O errors, &c), 2 to indicate a corrupt
+compressed file, 3 for an internal consistency error (eg, bug) which
+caused
+.I bzip2
+to panic.
+
+.SH OPTIONS
+.TP
+.B \-c --stdout
+Compress or decompress to standard output.
+.TP
+.B \-d --decompress
+Force decompression.  
+.I bzip2, 
+.I bunzip2 
+and
+.I bzcat 
+are
+really the same program, and the decision about what actions to take is
+done on the basis of which name is used.  This flag overrides that
+mechanism, and forces 
+.I bzip2
+to decompress.
+.TP
+.B \-z --compress
+The complement to \-d: forces compression, regardless of the
+invocation name.
+.TP
+.B \-t --test
+Check integrity of the specified file(s), but don't decompress them.
+This really performs a trial decompression and throws away the result.
+.TP
+.B \-f --force
+Force overwrite of output files.  Normally,
+.I bzip2 
+will not overwrite
+existing output files.  Also forces 
+.I bzip2 
+to break hard links
+to files, which it otherwise wouldn't do.
+
+bzip2 normally declines to decompress files which don't have the
+correct magic header bytes.  If forced (-f), however, it will pass
+such files through unmodified.  This is how GNU gzip behaves.
+.TP
+.B \-k --keep
+Keep (don't delete) input files during compression
+or decompression.
+.TP
+.B \-s --small
+Reduce memory usage, for compression, decompression and testing.  Files
+are decompressed and tested using a modified algorithm which only
+requires 2.5 bytes per block byte.  This means any file can be
+decompressed in 2300k of memory, albeit at about half the normal speed.
+
+During compression, \-s selects a block size of 200k, which limits
+memory use to around the same figure, at the expense of your compression
+ratio.  In short, if your machine is low on memory (8 megabytes or
+less), use \-s for everything.  See MEMORY MANAGEMENT below.
+.TP
+.B \-q --quiet
+Suppress non-essential warning messages.  Messages pertaining to
+I/O errors and other critical events will not be suppressed.
+.TP
+.B \-v --verbose
+Verbose mode -- show the compression ratio for each file processed.
+Further \-v's increase the verbosity level, spewing out lots of
+information which is primarily of interest for diagnostic purposes.
+.TP
+.B \-L --license -V --version
+Display the software version, license terms and conditions.
+.TP
+.B \-1 (or \-\-fast) to \-9 (or \-\-best)
+Set the block size to 100 k, 200 k ..  900 k when compressing.  Has no
+effect when decompressing.  See MEMORY MANAGEMENT below.
+The \-\-fast and \-\-best aliases are primarily for GNU gzip 
+compatibility.  In particular, \-\-fast doesn't make things
+significantly faster.  
+And \-\-best merely selects the default behaviour.
+.TP
+.B \--
+Treats all subsequent arguments as file names, even if they start
+with a dash.  This is so you can handle files with names beginning
+with a dash, for example: bzip2 \-- \-myfilename.
+.TP
+.B \--repetitive-fast --repetitive-best
+These flags are redundant in versions 0.9.5 and above.  They provided
+some coarse control over the behaviour of the sorting algorithm in
+earlier versions, which was sometimes useful.  0.9.5 and above have an
+improved algorithm which renders these flags irrelevant.
+
+.SH MEMORY MANAGEMENT
+.I bzip2 
+compresses large files in blocks.  The block size affects
+both the compression ratio achieved, and the amount of memory needed for
+compression and decompression.  The flags \-1 through \-9
+specify the block size to be 100,000 bytes through 900,000 bytes (the
+default) respectively.  At decompression time, the block size used for
+compression is read from the header of the compressed file, and
+.I bunzip2
+then allocates itself just enough memory to decompress
+the file.  Since block sizes are stored in compressed files, it follows
+that the flags \-1 to \-9 are irrelevant to and so ignored
+during decompression.
+
+Compression and decompression requirements, 
+in bytes, can be estimated as:
+
+       Compression:   400k + ( 8 x block size )
+
+       Decompression: 100k + ( 4 x block size ), or
+                      100k + ( 2.5 x block size )
+
+Larger block sizes give rapidly diminishing marginal returns.  Most of
+the compression comes from the first two or three hundred k of block
+size, a fact worth bearing in mind when using
+.I bzip2
+on small machines.
+It is also important to appreciate that the decompression memory
+requirement is set at compression time by the choice of block size.
+
+For files compressed with the default 900k block size,
+.I bunzip2
+will require about 3700 kbytes to decompress.  To support decompression
+of any file on a 4 megabyte machine, 
+.I bunzip2
+has an option to
+decompress using approximately half this amount of memory, about 2300
+kbytes.  Decompression speed is also halved, so you should use this
+option only where necessary.  The relevant flag is -s.
+
+In general, try and use the largest block size memory constraints allow,
+since that maximises the compression achieved.  Compression and
+decompression speed are virtually unaffected by block size.
+
+Another significant point applies to files which fit in a single block
+-- that means most files you'd encounter using a large block size.  The
+amount of real memory touched is proportional to the size of the file,
+since the file is smaller than a block.  For example, compressing a file
+20,000 bytes long with the flag -9 will cause the compressor to
+allocate around 7600k of memory, but only touch 400k + 20000 * 8 = 560
+kbytes of it.  Similarly, the decompressor will allocate 3700k but only
+touch 100k + 20000 * 4 = 180 kbytes.
+
+Here is a table which summarises the maximum memory usage for different
+block sizes.  Also recorded is the total compressed size for 14 files of
+the Calgary Text Compression Corpus totalling 3,141,622 bytes.  This
+column gives some feel for how compression varies with block size.
+These figures tend to understate the advantage of larger block sizes for
+larger files, since the Corpus is dominated by smaller files.
+
+           Compress   Decompress   Decompress   Corpus
+    Flag     usage      usage       -s usage     Size
+
+     -1      1200k       500k         350k      914704
+     -2      2000k       900k         600k      877703
+     -3      2800k      1300k         850k      860338
+     -4      3600k      1700k        1100k      846899
+     -5      4400k      2100k        1350k      845160
+     -6      5200k      2500k        1600k      838626
+     -7      6100k      2900k        1850k      834096
+     -8      6800k      3300k        2100k      828642
+     -9      7600k      3700k        2350k      828642
+
+.SH RECOVERING DATA FROM DAMAGED FILES
+.I bzip2
+compresses files in blocks, usually 900kbytes long.  Each
+block is handled independently.  If a media or transmission error causes
+a multi-block .bz2
+file to become damaged, it may be possible to
+recover data from the undamaged blocks in the file.
+
+The compressed representation of each block is delimited by a 48-bit
+pattern, which makes it possible to find the block boundaries with
+reasonable certainty.  Each block also carries its own 32-bit CRC, so
+damaged blocks can be distinguished from undamaged ones.
+
+.I bzip2recover
+is a simple program whose purpose is to search for
+blocks in .bz2 files, and write each block out into its own .bz2 
+file.  You can then use
+.I bzip2 
+\-t
+to test the
+integrity of the resulting files, and decompress those which are
+undamaged.
+
+.I bzip2recover
+takes a single argument, the name of the damaged file, 
+and writes a number of files "rec00001file.bz2",
+"rec00002file.bz2", etc, containing the  extracted  blocks.
+The  output  filenames  are  designed  so  that the use of
+wildcards in subsequent processing -- for example,  
+"bzip2 -dc  rec*file.bz2 > recovered_data" -- processes the files in
+the correct order.
+
+.I bzip2recover
+should be of most use dealing with large .bz2
+files,  as  these will contain many blocks.  It is clearly
+futile to use it on damaged single-block  files,  since  a
+damaged  block  cannot  be recovered.  If you wish to minimise 
+any potential data loss through media  or  transmission errors, 
+you might consider compressing with a smaller
+block size.
+
+.SH PERFORMANCE NOTES
+The sorting phase of compression gathers together similar strings in the
+file.  Because of this, files containing very long runs of repeated
+symbols, like "aabaabaabaab ..."  (repeated several hundred times) may
+compress more slowly than normal.  Versions 0.9.5 and above fare much
+better than previous versions in this respect.  The ratio between
+worst-case and average-case compression time is in the region of 10:1.
+For previous versions, this figure was more like 100:1.  You can use the
+\-vvvv option to monitor progress in great detail, if you want.
+
+Decompression speed is unaffected by these phenomena.
+
+.I bzip2
+usually allocates several megabytes of memory to operate
+in, and then charges all over it in a fairly random fashion.  This means
+that performance, both for compressing and decompressing, is largely
+determined by the speed at which your machine can service cache misses.
+Because of this, small changes to the code to reduce the miss rate have
+been observed to give disproportionately large performance improvements.
+I imagine 
+.I bzip2
+will perform best on machines with very large caches.
+
+.SH CAVEATS
+I/O error messages are not as helpful as they could be.
+.I bzip2
+tries hard to detect I/O errors and exit cleanly, but the details of
+what the problem is sometimes seem rather misleading.
+
+This manual page pertains to version 1.0.3 of
+.I bzip2.  
+Compressed data created by this version is entirely forwards and
+backwards compatible with the previous public releases, versions
+0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1 and 1.0.2, but with the following
+exception: 0.9.0 and above can correctly decompress multiple
+concatenated compressed files.  0.1pl2 cannot do this; it will stop
+after decompressing just the first file in the stream.
+
+.I bzip2recover
+versions prior to 1.0.2 used 32-bit integers to represent
+bit positions in compressed files, so they could not handle compressed
+files more than 512 megabytes long.  Versions 1.0.2 and above use
+64-bit ints on some platforms which support them (GNU supported
+targets, and Windows).  To establish whether or not bzip2recover was
+built with such a limitation, run it without arguments.  In any event
+you can build yourself an unlimited version if you can recompile it
+with MaybeUInt64 set to be an unsigned 64-bit integer.
+
+
+
+.SH AUTHOR
+Julian Seward, jsewardbzip.org.
+
+http://www.bzip.org
+
+The ideas embodied in
+.I bzip2
+are due to (at least) the following
+people: Michael Burrows and David Wheeler (for the block sorting
+transformation), David Wheeler (again, for the Huffman coder), Peter
+Fenwick (for the structured coding model in the original
+.I bzip,
+and many refinements), and Alistair Moffat, Radford Neal and Ian Witten
+(for the arithmetic coder in the original
+.I bzip).  
+I am much
+indebted for their help, support and advice.  See the manual in the
+source distribution for pointers to sources of documentation.  Christian
+von Roques encouraged me to look for faster sorting algorithms, so as to
+speed up compression.  Bela Lubkin encouraged me to improve the
+worst-case compression performance.  
+Donna Robinson XMLised the documentation.
+The bz* scripts are derived from those of GNU gzip.
+Many people sent patches, helped
+with portability problems, lent machines, gave advice and were generally
+helpful.
diff --git a/updater/bzip2-1.0.3/bzip2.1.preformatted b/updater/bzip2-1.0.3/bzip2.1.preformatted
new file mode 100644
index 0000000..129ca83
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzip2.1.preformatted
@@ -0,0 +1,399 @@
+bzip2(1)                                                 bzip2(1)
+
+
+
+NNAAMMEE
+       bzip2, bunzip2 − a block‐sorting file compressor, v1.0.3
+       bzcat − decompresses files to stdout
+       bzip2recover − recovers data from damaged bzip2 files
+
+
+SSYYNNOOPPSSIISS
+       bbzziipp22 [ −−ccddffkkqqssttvvzzVVLL112233445566778899 ] [ _f_i_l_e_n_a_m_e_s _._._.  ]
+       bbuunnzziipp22 [ −−ffkkvvssVVLL ] [ _f_i_l_e_n_a_m_e_s _._._.  ]
+       bbzzccaatt [ −−ss ] [ _f_i_l_e_n_a_m_e_s _._._.  ]
+       bbzziipp22rreeccoovveerr _f_i_l_e_n_a_m_e
+
+
+DDEESSCCRRIIPPTTIIOONN
+       _b_z_i_p_2  compresses  files  using  the Burrows‐Wheeler block
+       sorting text compression algorithm,  and  Huffman  coding.
+       Compression  is  generally  considerably  better than that
+       achieved by more conventional LZ77/LZ78‐based compressors,
+       and  approaches  the performance of the PPM family of sta
+       tistical compressors.
+
+       The command‐line options are deliberately very similar  to
+       those of _G_N_U _g_z_i_p_, but they are not identical.
+
+       _b_z_i_p_2  expects  a list of file names to accompany the com
+       mand‐line flags.  Each file is replaced  by  a  compressed
+       version  of  itself,  with  the  name "original_name.bz2".
+       Each compressed file has the same modification date,  per
+       missions, and, when possible, ownership as the correspond
+       ing original, so that these properties  can  be  correctly
+       restored  at  decompression  time.   File name handling is
+       naive in the sense that there is no mechanism for preserv
+       ing  original file names, permissions, ownerships or dates
+       in filesystems which lack these concepts, or have  serious
+       file name length restrictions, such as MS‐DOS.
+
+       _b_z_i_p_2  and  _b_u_n_z_i_p_2 will by default not overwrite existing
+       files.  If you want this to happen, specify the −f flag.
+
+       If no file names  are  specified,  _b_z_i_p_2  compresses  from
+       standard  input  to  standard output.  In this case, _b_z_i_p_2
+       will decline to write compressed output to a terminal,  as
+       this  would  be  entirely  incomprehensible  and therefore
+       pointless.
+
+       _b_u_n_z_i_p_2 (or _b_z_i_p_2 _−_d_) decompresses  all  specified  files.
+       Files which were not created by _b_z_i_p_2 will be detected and
+       ignored, and a warning issued.  _b_z_i_p_2  attempts  to  guess
+       the  filename  for  the decompressed file from that of the
+       compressed file as follows:
+
+              filename.bz2    becomes   filename
+              filename.bz     becomes   filename
+              filename.tbz2   becomes   filename.tar
+              filename.tbz    becomes   filename.tar
+              anyothername    becomes   anyothername.out
+
+       If the file does not end in one of the recognised endings,
+       _._b_z_2_,  _._b_z_,  _._t_b_z_2 or _._t_b_z_, _b_z_i_p_2 complains that it cannot
+       guess the name of the original file, and uses the original
+       name with _._o_u_t appended.
+
+       As  with compression, supplying no filenames causes decom
+       pression from standard input to standard output.
+
+       _b_u_n_z_i_p_2 will correctly decompress a file which is the con
+       catenation of two or more compressed files.  The result is
+       the concatenation of the corresponding uncompressed files.
+       Integrity testing (−t) of concatenated compressed files is
+       also supported.
+
+       You can also compress or decompress files to the  standard
+       output  by giving the −c flag.  Multiple files may be com
+       pressed and decompressed like this.  The resulting outputs
+       are  fed  sequentially to stdout.  Compression of multiple
+       files in this manner generates a stream containing  multi
+       ple compressed file representations.  Such a stream can be
+       decompressed correctly only  by  _b_z_i_p_2  version  0.9.0  or
+       later.   Earlier  versions of _b_z_i_p_2 will stop after decom
+       pressing the first file in the stream.
+
+       _b_z_c_a_t (or _b_z_i_p_2 _‐_d_c_) decompresses all specified  files  to
+       the standard output.
+
+       _b_z_i_p_2  will  read arguments from the environment variables
+       _B_Z_I_P_2 and _B_Z_I_P_, in  that  order,  and  will  process  them
+       before  any  arguments  read  from the command line.  This
+       gives a convenient way to supply default arguments.
+
+       Compression is always performed, even  if  the  compressed
+       file  is slightly larger than the original.  Files of less
+       than about one hundred bytes tend to get larger, since the
+       compression  mechanism  has  a  constant  overhead  in the
+       region of 50 bytes.  Random data (including the output  of
+       most  file  compressors)  is  coded at about 8.05 bits per
+       byte, giving an expansion of around 0.5%.
+
+       As a self‐check for your  protection,  _b_z_i_p_2  uses  32‐bit
+       CRCs  to make sure that the decompressed version of a file
+       is identical to the original.  This guards against corrup
+       tion  of  the compressed data, and against undetected bugs
+       in _b_z_i_p_2 (hopefully very unlikely).  The chances  of  data
+       corruption  going  undetected  is  microscopic,  about one
+       chance in four billion for each file processed.  Be aware,
+       though,  that  the  check occurs upon decompression, so it
+       can only tell you that something is wrong.  It can’t  help
+       you  recover  the original uncompressed data.  You can use
+       _b_z_i_p_2_r_e_c_o_v_e_r to try to recover data from damaged files.
+
+       Return values: 0 for a normal exit,  1  for  environmental
+       problems  (file not found, invalid flags, I/O errors, &c),
+       2 to indicate a corrupt compressed file, 3 for an internal
+       consistency error (eg, bug) which caused _b_z_i_p_2 to panic.
+
+
+OOPPTTIIOONNSS
+       −−cc ‐‐‐‐ssttddoouutt
+              Compress or decompress to standard output.
+
+       −−dd ‐‐‐‐ddeeccoommpprreessss
+              Force  decompression.  _b_z_i_p_2_, _b_u_n_z_i_p_2 and _b_z_c_a_t are
+              really the same program,  and  the  decision  about
+              what  actions to take is done on the basis of which
+              name is used.  This flag overrides that  mechanism,
+              and forces _b_z_i_p_2 to decompress.
+
+       −−zz ‐‐‐‐ccoommpprreessss
+              The   complement   to   −d:   forces   compression,
+              regardless of the invocation name.
+
+       −−tt ‐‐‐‐tteesstt
+              Check integrity of the specified file(s), but don’t
+              decompress  them.   This  really  performs  a trial
+              decompression and throws away the result.
+
+       −−ff ‐‐‐‐ffoorrccee
+              Force overwrite of output files.   Normally,  _b_z_i_p_2
+              will  not  overwrite  existing  output files.  Also
+              forces _b_z_i_p_2 to break hard links to files, which it
+              otherwise wouldn’t do.
+
+              bzip2  normally  declines to decompress files which
+              don’t have the  correct  magic  header  bytes.   If
+              forced  (‐f),  however,  it  will  pass  such files
+              through unmodified.  This is how GNU gzip  behaves.
+
+       −−kk ‐‐‐‐kkeeeepp
+              Keep  (don’t delete) input files during compression
+              or decompression.
+
+       −−ss ‐‐‐‐ssmmaallll
+              Reduce memory usage, for compression, decompression
+              and  testing.   Files  are  decompressed and tested
+              using a modified algorithm which only requires  2.5
+              bytes  per  block byte.  This means any file can be
+              decompressed in 2300k of memory,  albeit  at  about
+              half the normal speed.
+
+              During  compression,  −s  selects  a  block size of
+              200k, which limits memory use to  around  the  same
+              figure,  at  the expense of your compression ratio.
+              In short, if your  machine  is  low  on  memory  (8
+              megabytes  or  less),  use  −s for everything.  See
+              MEMORY MANAGEMENT below.
+
+       −−qq ‐‐‐‐qquuiieett
+              Suppress non‐essential warning messages.   Messages
+              pertaining  to I/O errors and other critical events
+              will not be suppressed.
+
+       −−vv ‐‐‐‐vveerrbboossee
+              Verbose mode ‐‐ show the compression ratio for each
+              file  processed.   Further  −v’s  increase the ver
+              bosity level, spewing out lots of information which
+              is primarily of interest for diagnostic purposes.
+
+       −−LL ‐‐‐‐lliicceennssee ‐‐VV ‐‐‐‐vveerrssiioonn
+              Display  the  software  version,  license terms and
+              conditions.
+
+       −−11 ((oorr −−−−ffaasstt)) ttoo −−99 ((oorr −−−−bbeesstt))
+              Set the block size to 100 k, 200 k ..  900  k  when
+              compressing.   Has  no  effect  when decompressing.
+              See MEMORY MANAGEMENT below.  The −−fast and −−best
+              aliases  are  primarily for GNU gzip compatibility.
+              In particular, −−fast doesn’t make things  signifi
+              cantly  faster.   And  −−best  merely  selects  the
+              default behaviour.
+
+       −−‐‐     Treats all subsequent arguments as file names, even
+              if they start with a dash.  This is so you can han
+              dle files with names beginning  with  a  dash,  for
+              example: bzip2 −‐ −myfilename.
+
+       −−‐‐rreeppeettiittiivvee‐‐ffaasstt ‐‐‐‐rreeppeettiittiivvee‐‐bbeesstt
+              These  flags  are  redundant  in versions 0.9.5 and
+              above.  They provided some coarse control over  the
+              behaviour  of the sorting algorithm in earlier ver
+              sions, which was sometimes useful.  0.9.5 and above
+              have  an  improved  algorithm  which  renders these
+              flags irrelevant.
+
+
+MMEEMMOORRYY MMAANNAAGGEEMMEENNTT
+       _b_z_i_p_2 compresses large files in blocks.   The  block  size
+       affects  both  the  compression  ratio  achieved,  and the
+       amount of memory needed for compression and decompression.
+       The  flags  −1  through  −9  specify  the block size to be
+       100,000 bytes through 900,000 bytes (the default)  respec
+       tively.   At  decompression  time, the block size used for
+       compression is read from  the  header  of  the  compressed
+       file, and _b_u_n_z_i_p_2 then allocates itself just enough memory
+       to decompress the file.  Since block sizes are  stored  in
+       compressed  files,  it follows that the flags −1 to −9 are
+       irrelevant to and so ignored during decompression.
+
+       Compression and decompression requirements, in bytes,  can
+       be estimated as:
+
+              Compression:   400k + ( 8 x block size )
+
+              Decompression: 100k + ( 4 x block size ), or
+                             100k + ( 2.5 x block size )
+
+       Larger  block  sizes  give  rapidly  diminishing  marginal
+       returns.  Most of the compression comes from the first two
+       or  three hundred k of block size, a fact worth bearing in
+       mind when using _b_z_i_p_2  on  small  machines.   It  is  also
+       important  to  appreciate  that  the  decompression memory
+       requirement is set at compression time by  the  choice  of
+       block size.
+
+       For  files  compressed  with  the default 900k block size,
+       _b_u_n_z_i_p_2 will require about 3700 kbytes to decompress.   To
+       support decompression of any file on a 4 megabyte machine,
+       _b_u_n_z_i_p_2 has an option to  decompress  using  approximately
+       half this amount of memory, about 2300 kbytes.  Decompres
+       sion speed is also halved, so you should use  this  option
+       only where necessary.  The relevant flag is ‐s.
+
+       In general, try and use the largest block size memory con
+       straints  allow,  since  that  maximises  the  compression
+       achieved.   Compression and decompression speed are virtu
+       ally unaffected by block size.
+
+       Another significant point applies to files which fit in  a
+       single  block  ‐‐  that  means  most files you’d encounter
+       using a large block  size.   The  amount  of  real  memory
+       touched is proportional to the size of the file, since the
+       file is smaller than a block.  For example, compressing  a
+       file  20,000  bytes  long  with the flag ‐9 will cause the
+       compressor to allocate around 7600k of  memory,  but  only
+       touch 400k + 20000 * 8 = 560 kbytes of it.  Similarly, the
+       decompressor will allocate 3700k but  only  touch  100k  +
+       20000 * 4 = 180 kbytes.
+
+       Here  is a table which summarises the maximum memory usage
+       for different block sizes.  Also  recorded  is  the  total
+       compressed  size for 14 files of the Calgary Text Compres
+       sion Corpus totalling 3,141,622 bytes.  This column  gives
+       some  feel  for  how  compression  varies with block size.
+       These figures tend to understate the advantage  of  larger
+       block  sizes  for  larger files, since the Corpus is domi
+       nated by smaller files.
+
+                  Compress   Decompress   Decompress   Corpus
+           Flag     usage      usage       ‐s usage     Size
+
+            ‐1      1200k       500k         350k      914704
+            ‐2      2000k       900k         600k      877703
+            ‐3      2800k      1300k         850k      860338
+            ‐4      3600k      1700k        1100k      846899
+            ‐5      4400k      2100k        1350k      845160
+            ‐6      5200k      2500k        1600k      838626
+            ‐7      6100k      2900k        1850k      834096
+            ‐8      6800k      3300k        2100k      828642
+            ‐9      7600k      3700k        2350k      828642
+
+
+RREECCOOVVEERRIINNGG DDAATTAA FFRROOMM DDAAMMAAGGEEDD FFIILLEESS
+       _b_z_i_p_2 compresses files in blocks, usually 900kbytes  long.
+       Each block is handled independently.  If a media or trans
+       mission error causes a multi‐block  .bz2  file  to  become
+       damaged,  it  may  be  possible  to  recover data from the
+       undamaged blocks in the file.
+
+       The compressed representation of each block  is  delimited
+       by  a  48‐bit pattern, which makes it possible to find the
+       block boundaries with reasonable  certainty.   Each  block
+       also  carries its own 32‐bit CRC, so damaged blocks can be
+       distinguished from undamaged ones.
+
+       _b_z_i_p_2_r_e_c_o_v_e_r is a  simple  program  whose  purpose  is  to
+       search  for blocks in .bz2 files, and write each block out
+       into its own .bz2 file.  You can then use _b_z_i_p_2 −t to test
+       the integrity of the resulting files, and decompress those
+       which are undamaged.
+
+       _b_z_i_p_2_r_e_c_o_v_e_r takes a single argument, the name of the dam
+       aged    file,    and    writes    a    number   of   files
+       "rec00001file.bz2",  "rec00002file.bz2",  etc,  containing
+       the   extracted   blocks.   The   output   filenames   are
+       designed  so  that the use of wildcards in subsequent pro
+       cessing  ‐‐ for example, "bzip2 ‐dc  rec*file.bz2 > recov
+       ered_data" ‐‐ processes the files in the correct order.
+
+       _b_z_i_p_2_r_e_c_o_v_e_r should be of most use dealing with large .bz2
+       files,  as  these will contain many blocks.  It is clearly
+       futile to use it on damaged single‐block  files,  since  a
+       damaged  block  cannot  be recovered.  If you wish to min
+       imise any potential data loss through media  or  transmis
+       sion errors, you might consider compressing with a smaller
+       block size.
+
+
+PPEERRFFOORRMMAANNCCEE NNOOTTEESS
+       The sorting phase of compression gathers together  similar
+       strings  in  the  file.  Because of this, files containing
+       very long runs of  repeated  symbols,  like  "aabaabaabaab
+       ..."   (repeated  several hundred times) may compress more
+       slowly than normal.  Versions 0.9.5 and  above  fare  much
+       better  than previous versions in this respect.  The ratio
+       between worst‐case and average‐case compression time is in
+       the  region  of  10:1.  For previous versions, this figure
+       was more like 100:1.  You can use the −vvvv option to mon
+       itor progress in great detail, if you want.
+
+       Decompression speed is unaffected by these phenomena.
+
+       _b_z_i_p_2  usually  allocates  several  megabytes of memory to
+       operate in, and then charges all over it in a fairly  ran
+       dom  fashion.   This means that performance, both for com
+       pressing and decompressing, is largely determined  by  the
+       speed  at  which  your  machine  can service cache misses.
+       Because of this, small changes to the code to  reduce  the
+       miss  rate  have  been observed to give disproportionately
+       large performance improvements.  I imagine _b_z_i_p_2 will per
+       form best on machines with very large caches.
+
+
+CCAAVVEEAATTSS
+       I/O  error  messages  are not as helpful as they could be.
+       _b_z_i_p_2 tries hard to detect I/O errors  and  exit  cleanly,
+       but  the  details  of  what  the problem is sometimes seem
+       rather misleading.
+
+       This manual page pertains to version 1.0.3 of _b_z_i_p_2_.  Com
+       pressed  data created by this version is entirely forwards
+       and  backwards  compatible  with   the   previous   public
+       releases,  versions 0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1 and
+       1.0.2, but with the following exception: 0.9.0  and  above
+       can  correctly decompress multiple concatenated compressed
+       files.  0.1pl2 cannot do this; it will stop  after  decom
+       pressing just the first file in the stream.
+
+       _b_z_i_p_2_r_e_c_o_v_e_r  versions prior to 1.0.2 used 32‐bit integers
+       to represent bit positions in compressed  files,  so  they
+       could  not handle compressed files more than 512 megabytes
+       long.  Versions 1.0.2 and above use 64‐bit  ints  on  some
+       platforms  which  support them (GNU supported targets, and
+       Windows).  To establish whether or  not  bzip2recover  was
+       built  with  such  a limitation, run it without arguments.
+       In any event you can build yourself an  unlimited  version
+       if  you  can  recompile  it  with MaybeUInt64 set to be an
+       unsigned 64‐bit integer.
+
+
+
+
+AAUUTTHHOORR
+       Julian Seward, jsewardbzip.org.
+
+       http://www.bzip.org
+
+       The ideas embodied in _b_z_i_p_2 are due to (at least) the fol
+       lowing  people: Michael Burrows and David Wheeler (for the
+       block sorting transformation), David Wheeler  (again,  for
+       the Huffman coder), Peter Fenwick (for the structured cod
+       ing model in the original _b_z_i_p_, and many refinements), and
+       Alistair  Moffat,  Radford  Neal  and  Ian Witten (for the
+       arithmetic  coder  in  the  original  _b_z_i_p_)_.   I  am  much
+       indebted for their help, support and advice.  See the man
+       ual in the source distribution for pointers to sources  of
+       documentation.  Christian von Roques encouraged me to look
+       for faster sorting algorithms, so as to speed up  compres
+       sion.  Bela Lubkin encouraged me to improve the worst‐case
+       compression performance.  Donna Robinson XMLised the docu
+       mentation.   The bz* scripts are derived from those of GNU
+       gzip.  Many people sent patches, helped  with  portability
+       problems,  lent  machines,  gave advice and were generally
+       helpful.
+
+
+
+                                                         bzip2(1)
diff --git a/updater/bzip2-1.0.3/bzip2.c b/updater/bzip2-1.0.3/bzip2.c
new file mode 100644
index 0000000..79f87a5
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzip2.c
@@ -0,0 +1,2107 @@
+
+/*-----------------------------------------------------------*/
+/*--- A block-sorting, lossless compressor        bzip2.c ---*/
+/*-----------------------------------------------------------*/
+
+/*--
+  This file is a part of bzip2 and/or libbzip2, a program and
+  library for lossless, block-sorting data compression.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0 of 21 March 2000
+
+  This program is based on (at least) the work of:
+     Mike Burrows
+     David Wheeler
+     Peter Fenwick
+     Alistair Moffat
+     Radford Neal
+     Ian H. Witten
+     Robert Sedgewick
+     Jon L. Bentley
+
+  For more information on these sources, see the manual.
+--*/
+
+
+/*----------------------------------------------------*/
+/*--- IMPORTANT                                    ---*/
+/*----------------------------------------------------*/
+
+/*--
+   WARNING:
+      This program and library (attempts to) compress data by 
+      performing several non-trivial transformations on it.  
+      Unless you are 100% familiar with *all* the algorithms 
+      contained herein, and with the consequences of modifying them, 
+      you should NOT meddle with the compression or decompression 
+      machinery.  Incorrect changes can and very likely *will* 
+      lead to disasterous loss of data.
+
+   DISCLAIMER:
+      I TAKE NO RESPONSIBILITY FOR ANY LOSS OF DATA ARISING FROM THE
+      USE OF THIS PROGRAM, HOWSOEVER CAUSED.
+
+      Every compression of a file implies an assumption that the
+      compressed file can be decompressed to reproduce the original.
+      Great efforts in design, coding and testing have been made to
+      ensure that this program works correctly.  However, the
+      complexity of the algorithms, and, in particular, the presence
+      of various special cases in the code which occur with very low
+      but non-zero probability make it impossible to rule out the
+      possibility of bugs remaining in the program.  DO NOT COMPRESS
+      ANY DATA WITH THIS PROGRAM AND/OR LIBRARY UNLESS YOU ARE PREPARED 
+      TO ACCEPT THE POSSIBILITY, HOWEVER SMALL, THAT THE DATA WILL 
+      NOT BE RECOVERABLE.
+
+      That is not to say this program is inherently unreliable.
+      Indeed, I very much hope the opposite is true.  bzip2/libbzip2
+      has been carefully constructed and extensively tested.
+
+   PATENTS:
+      To the best of my knowledge, bzip2/libbzip2 does not use any 
+      patented algorithms.  However, I do not have the resources 
+      available to carry out a full patent search.  Therefore I cannot 
+      give any guarantee of the above statement.
+--*/
+
+
+
+/*----------------------------------------------------*/
+/*--- and now for something much more pleasant :-) ---*/
+/*----------------------------------------------------*/
+
+/*---------------------------------------------*/
+/*--
+  Place a 1 beside your platform, and 0 elsewhere.
+--*/
+
+/*--
+  Generic 32-bit Unix.
+  Also works on 64-bit Unix boxes.
+  This is the default.
+--*/
+#define BZ_UNIX      1
+
+/*--
+  Win32, as seen by Jacob Navia's excellent
+  port of (Chris Fraser & David Hanson)'s excellent
+  lcc compiler.  Or with MS Visual C.
+  This is selected automatically if compiled by a compiler which
+  defines _WIN32, not including the Cygwin GCC.
+--*/
+#define BZ_LCCWIN32  0
+
+#if defined(_WIN32) && !defined(__CYGWIN__)
+#undef  BZ_LCCWIN32
+#define BZ_LCCWIN32 1
+#undef  BZ_UNIX
+#define BZ_UNIX 0
+#endif
+
+
+/*---------------------------------------------*/
+/*--
+  Some stuff for all platforms.
+--*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <signal.h>
+#include <math.h>
+#include <errno.h>
+#include <ctype.h>
+#include "bzlib.h"
+
+#define ERROR_IF_EOF(i)       { if ((i) == EOF)  ioError(); }
+#define ERROR_IF_NOT_ZERO(i)  { if ((i) != 0)    ioError(); }
+#define ERROR_IF_MINUS_ONE(i) { if ((i) == (-1)) ioError(); }
+
+
+/*---------------------------------------------*/
+/*--
+   Platform-specific stuff.
+--*/
+
+#if BZ_UNIX
+#   include <fcntl.h>
+#   include <sys/types.h>
+#   include <utime.h>
+#   include <unistd.h>
+#   include <sys/stat.h>
+#   include <sys/times.h>
+
+#   define PATH_SEP    '/'
+#   define MY_LSTAT    lstat
+#   define MY_STAT     stat
+#   define MY_S_ISREG  S_ISREG
+#   define MY_S_ISDIR  S_ISDIR
+
+#   define APPEND_FILESPEC(root, name) \
+      root=snocString((root), (name))
+
+#   define APPEND_FLAG(root, name) \
+      root=snocString((root), (name))
+
+#   define SET_BINARY_MODE(fd) /**/
+
+#   ifdef __GNUC__
+#      define NORETURN __attribute__ ((noreturn))
+#   else
+#      define NORETURN /**/
+#   endif
+
+#   ifdef __DJGPP__
+#     include <io.h>
+#     include <fcntl.h>
+#     undef MY_LSTAT
+#     undef MY_STAT
+#     define MY_LSTAT stat
+#     define MY_STAT stat
+#     undef SET_BINARY_MODE
+#     define SET_BINARY_MODE(fd)                        \
+        do {                                            \
+           int retVal = setmode ( fileno ( fd ),        \
+                                  O_BINARY );           \
+           ERROR_IF_MINUS_ONE ( retVal );               \
+        } while ( 0 )
+#   endif
+
+#   ifdef __CYGWIN__
+#     include <io.h>
+#     include <fcntl.h>
+#     undef SET_BINARY_MODE
+#     define SET_BINARY_MODE(fd)                        \
+        do {                                            \
+           int retVal = setmode ( fileno ( fd ),        \
+                                  O_BINARY );           \
+           ERROR_IF_MINUS_ONE ( retVal );               \
+        } while ( 0 )
+#   endif
+#endif /* BZ_UNIX */
+
+
+
+#if BZ_LCCWIN32
+#   include <io.h>
+#   include <fcntl.h>
+#   include <sys\stat.h>
+
+#   define NORETURN       /**/
+#   define PATH_SEP       '\\'
+#   define MY_LSTAT       _stat
+#   define MY_STAT        _stat
+#   define MY_S_ISREG(x)  ((x) & _S_IFREG)
+#   define MY_S_ISDIR(x)  ((x) & _S_IFDIR)
+
+#   define APPEND_FLAG(root, name) \
+      root=snocString((root), (name))
+
+#   define APPEND_FILESPEC(root, name)                \
+      root = snocString ((root), (name))
+
+#   define SET_BINARY_MODE(fd)                        \
+      do {                                            \
+         int retVal = setmode ( fileno ( fd ),        \
+                                O_BINARY );           \
+         ERROR_IF_MINUS_ONE ( retVal );               \
+      } while ( 0 )
+
+#endif /* BZ_LCCWIN32 */
+
+
+/*---------------------------------------------*/
+/*--
+  Some more stuff for all platforms :-)
+--*/
+
+typedef char            Char;
+typedef unsigned char   Bool;
+typedef unsigned char   UChar;
+typedef int             Int32;
+typedef unsigned int    UInt32;
+typedef short           Int16;
+typedef unsigned short  UInt16;
+                                       
+#define True  ((Bool)1)
+#define False ((Bool)0)
+
+/*--
+  IntNative is your platform's `native' int size.
+  Only here to avoid probs with 64-bit platforms.
+--*/
+typedef int IntNative;
+
+
+/*---------------------------------------------------*/
+/*--- Misc (file handling) data decls             ---*/
+/*---------------------------------------------------*/
+
+Int32   verbosity;
+Bool    keepInputFiles, smallMode, deleteOutputOnInterrupt;
+Bool    forceOverwrite, testFailsExist, unzFailsExist, noisy;
+Int32   numFileNames, numFilesProcessed, blockSize100k;
+Int32   exitValue;
+
+/*-- source modes; F==file, I==stdin, O==stdout --*/
+#define SM_I2O           1
+#define SM_F2O           2
+#define SM_F2F           3
+
+/*-- operation modes --*/
+#define OM_Z             1
+#define OM_UNZ           2
+#define OM_TEST          3
+
+Int32   opMode;
+Int32   srcMode;
+
+#define FILE_NAME_LEN 1034
+
+Int32   longestFileName;
+Char    inName [FILE_NAME_LEN];
+Char    outName[FILE_NAME_LEN];
+Char    tmpName[FILE_NAME_LEN];
+Char    *progName;
+Char    progNameReally[FILE_NAME_LEN];
+FILE    *outputHandleJustInCase;
+Int32   workFactor;
+
+static void    panic                 ( Char* )   NORETURN;
+static void    ioError               ( void )    NORETURN;
+static void    outOfMemory           ( void )    NORETURN;
+static void    configError           ( void )    NORETURN;
+static void    crcError              ( void )    NORETURN;
+static void    cleanUpAndFail        ( Int32 )   NORETURN;
+static void    compressedStreamEOF   ( void )    NORETURN;
+
+static void    copyFileName ( Char*, Char* );
+static void*   myMalloc     ( Int32 );
+
+
+
+/*---------------------------------------------------*/
+/*--- An implementation of 64-bit ints.  Sigh.    ---*/
+/*--- Roll on widespread deployment of ANSI C9X ! ---*/
+/*---------------------------------------------------*/
+
+typedef
+   struct { UChar b[8]; } 
+   UInt64;
+
+
+static
+void uInt64_from_UInt32s ( UInt64* n, UInt32 lo32, UInt32 hi32 )
+{
+   n->b[7] = (UChar)((hi32 >> 24) & 0xFF);
+   n->b[6] = (UChar)((hi32 >> 16) & 0xFF);
+   n->b[5] = (UChar)((hi32 >> 8)  & 0xFF);
+   n->b[4] = (UChar) (hi32        & 0xFF);
+   n->b[3] = (UChar)((lo32 >> 24) & 0xFF);
+   n->b[2] = (UChar)((lo32 >> 16) & 0xFF);
+   n->b[1] = (UChar)((lo32 >> 8)  & 0xFF);
+   n->b[0] = (UChar) (lo32        & 0xFF);
+}
+
+
+static
+double uInt64_to_double ( UInt64* n )
+{
+   Int32  i;
+   double base = 1.0;
+   double sum  = 0.0;
+   for (i = 0; i < 8; i++) {
+      sum  += base * (double)(n->b[i]);
+      base *= 256.0;
+   }
+   return sum;
+}
+
+
+static
+Bool uInt64_isZero ( UInt64* n )
+{
+   Int32 i;
+   for (i = 0; i < 8; i++)
+      if (n->b[i] != 0) return 0;
+   return 1;
+}
+
+
+/* Divide *n by 10, and return the remainder.  */
+static 
+Int32 uInt64_qrm10 ( UInt64* n )
+{
+   UInt32 rem, tmp;
+   Int32  i;
+   rem = 0;
+   for (i = 7; i >= 0; i--) {
+      tmp = rem * 256 + n->b[i];
+      n->b[i] = tmp / 10;
+      rem = tmp % 10;
+   }
+   return rem;
+}
+
+
+/* ... and the Whole Entire Point of all this UInt64 stuff is
+   so that we can supply the following function.
+*/
+static
+void uInt64_toAscii ( char* outbuf, UInt64* n )
+{
+   Int32  i, q;
+   UChar  buf[32];
+   Int32  nBuf   = 0;
+   UInt64 n_copy = *n;
+   do {
+      q = uInt64_qrm10 ( &n_copy );
+      buf[nBuf] = q + '0';
+      nBuf++;
+   } while (!uInt64_isZero(&n_copy));
+   outbuf[nBuf] = 0;
+   for (i = 0; i < nBuf; i++) 
+      outbuf[i] = buf[nBuf-i-1];
+}
+
+
+/*---------------------------------------------------*/
+/*--- Processing of complete files and streams    ---*/
+/*---------------------------------------------------*/
+
+/*---------------------------------------------*/
+static 
+Bool myfeof ( FILE* f )
+{
+   Int32 c = fgetc ( f );
+   if (c == EOF) return True;
+   ungetc ( c, f );
+   return False;
+}
+
+
+/*---------------------------------------------*/
+static 
+void compressStream ( FILE *stream, FILE *zStream )
+{
+   BZFILE* bzf = NULL;
+   UChar   ibuf[5000];
+   Int32   nIbuf;
+   UInt32  nbytes_in_lo32, nbytes_in_hi32;
+   UInt32  nbytes_out_lo32, nbytes_out_hi32;
+   Int32   bzerr, bzerr_dummy, ret;
+
+   SET_BINARY_MODE(stream);
+   SET_BINARY_MODE(zStream);
+
+   if (ferror(stream)) goto errhandler_io;
+   if (ferror(zStream)) goto errhandler_io;
+
+   bzf = BZ2_bzWriteOpen ( &bzerr, zStream, 
+                           blockSize100k, verbosity, workFactor );   
+   if (bzerr != BZ_OK) goto errhandler;
+
+   if (verbosity >= 2) fprintf ( stderr, "\n" );
+
+   while (True) {
+
+      if (myfeof(stream)) break;
+      nIbuf = fread ( ibuf, sizeof(UChar), 5000, stream );
+      if (ferror(stream)) goto errhandler_io;
+      if (nIbuf > 0) BZ2_bzWrite ( &bzerr, bzf, (void*)ibuf, nIbuf );
+      if (bzerr != BZ_OK) goto errhandler;
+
+   }
+
+   BZ2_bzWriteClose64 ( &bzerr, bzf, 0, 
+                        &nbytes_in_lo32, &nbytes_in_hi32,
+                        &nbytes_out_lo32, &nbytes_out_hi32 );
+   if (bzerr != BZ_OK) goto errhandler;
+
+   if (ferror(zStream)) goto errhandler_io;
+   ret = fflush ( zStream );
+   if (ret == EOF) goto errhandler_io;
+   if (zStream != stdout) {
+      ret = fclose ( zStream );
+      outputHandleJustInCase = NULL;
+      if (ret == EOF) goto errhandler_io;
+   }
+   outputHandleJustInCase = NULL;
+   if (ferror(stream)) goto errhandler_io;
+   ret = fclose ( stream );
+   if (ret == EOF) goto errhandler_io;
+
+   if (verbosity >= 1) {
+      if (nbytes_in_lo32 == 0 && nbytes_in_hi32 == 0) {
+	 fprintf ( stderr, " no data compressed.\n");
+      } else {
+	 Char   buf_nin[32], buf_nout[32];
+	 UInt64 nbytes_in,   nbytes_out;
+	 double nbytes_in_d, nbytes_out_d;
+	 uInt64_from_UInt32s ( &nbytes_in, 
+			       nbytes_in_lo32, nbytes_in_hi32 );
+	 uInt64_from_UInt32s ( &nbytes_out, 
+			       nbytes_out_lo32, nbytes_out_hi32 );
+	 nbytes_in_d  = uInt64_to_double ( &nbytes_in );
+	 nbytes_out_d = uInt64_to_double ( &nbytes_out );
+	 uInt64_toAscii ( buf_nin, &nbytes_in );
+	 uInt64_toAscii ( buf_nout, &nbytes_out );
+	 fprintf ( stderr, "%6.3f:1, %6.3f bits/byte, "
+		   "%5.2f%% saved, %s in, %s out.\n",
+		   nbytes_in_d / nbytes_out_d,
+		   (8.0 * nbytes_out_d) / nbytes_in_d,
+		   100.0 * (1.0 - nbytes_out_d / nbytes_in_d),
+		   buf_nin,
+		   buf_nout
+		 );
+      }
+   }
+
+   return;
+
+   errhandler:
+   BZ2_bzWriteClose64 ( &bzerr_dummy, bzf, 1, 
+                        &nbytes_in_lo32, &nbytes_in_hi32,
+                        &nbytes_out_lo32, &nbytes_out_hi32 );
+   switch (bzerr) {
+      case BZ_CONFIG_ERROR:
+         configError(); break;
+      case BZ_MEM_ERROR:
+         outOfMemory (); break;
+      case BZ_IO_ERROR:
+         errhandler_io:
+         ioError(); break;
+      default:
+         panic ( "compress:unexpected error" );
+   }
+
+   panic ( "compress:end" );
+   /*notreached*/
+}
+
+
+
+/*---------------------------------------------*/
+static 
+Bool uncompressStream ( FILE *zStream, FILE *stream )
+{
+   BZFILE* bzf = NULL;
+   Int32   bzerr, bzerr_dummy, ret, nread, streamNo, i;
+   UChar   obuf[5000];
+   UChar   unused[BZ_MAX_UNUSED];
+   Int32   nUnused;
+   void*   unusedTmpV;
+   UChar*  unusedTmp;
+
+   nUnused = 0;
+   streamNo = 0;
+
+   SET_BINARY_MODE(stream);
+   SET_BINARY_MODE(zStream);
+
+   if (ferror(stream)) goto errhandler_io;
+   if (ferror(zStream)) goto errhandler_io;
+
+   while (True) {
+
+      bzf = BZ2_bzReadOpen ( 
+               &bzerr, zStream, verbosity, 
+               (int)smallMode, unused, nUnused
+            );
+      if (bzf == NULL || bzerr != BZ_OK) goto errhandler;
+      streamNo++;
+
+      while (bzerr == BZ_OK) {
+         nread = BZ2_bzRead ( &bzerr, bzf, obuf, 5000 );
+         if (bzerr == BZ_DATA_ERROR_MAGIC) goto trycat;
+         if ((bzerr == BZ_OK || bzerr == BZ_STREAM_END) && nread > 0)
+            fwrite ( obuf, sizeof(UChar), nread, stream );
+         if (ferror(stream)) goto errhandler_io;
+      }
+      if (bzerr != BZ_STREAM_END) goto errhandler;
+
+      BZ2_bzReadGetUnused ( &bzerr, bzf, &unusedTmpV, &nUnused );
+      if (bzerr != BZ_OK) panic ( "decompress:bzReadGetUnused" );
+
+      unusedTmp = (UChar*)unusedTmpV;
+      for (i = 0; i < nUnused; i++) unused[i] = unusedTmp[i];
+
+      BZ2_bzReadClose ( &bzerr, bzf );
+      if (bzerr != BZ_OK) panic ( "decompress:bzReadGetUnused" );
+
+      if (nUnused == 0 && myfeof(zStream)) break;
+   }
+
+   closeok:
+   if (ferror(zStream)) goto errhandler_io;
+   ret = fclose ( zStream );
+   if (ret == EOF) goto errhandler_io;
+
+   if (ferror(stream)) goto errhandler_io;
+   ret = fflush ( stream );
+   if (ret != 0) goto errhandler_io;
+   if (stream != stdout) {
+      ret = fclose ( stream );
+      outputHandleJustInCase = NULL;
+      if (ret == EOF) goto errhandler_io;
+   }
+   outputHandleJustInCase = NULL;
+   if (verbosity >= 2) fprintf ( stderr, "\n    " );
+   return True;
+
+   trycat: 
+   if (forceOverwrite) {
+      rewind(zStream);
+      while (True) {
+      	 if (myfeof(zStream)) break;
+      	 nread = fread ( obuf, sizeof(UChar), 5000, zStream );
+      	 if (ferror(zStream)) goto errhandler_io;
+      	 if (nread > 0) fwrite ( obuf, sizeof(UChar), nread, stream );
+      	 if (ferror(stream)) goto errhandler_io;
+      }
+      goto closeok;
+   }
+  
+   errhandler:
+   BZ2_bzReadClose ( &bzerr_dummy, bzf );
+   switch (bzerr) {
+      case BZ_CONFIG_ERROR:
+         configError(); break;
+      case BZ_IO_ERROR:
+         errhandler_io:
+         ioError(); break;
+      case BZ_DATA_ERROR:
+         crcError();
+      case BZ_MEM_ERROR:
+         outOfMemory();
+      case BZ_UNEXPECTED_EOF:
+         compressedStreamEOF();
+      case BZ_DATA_ERROR_MAGIC:
+         if (zStream != stdin) fclose(zStream);
+         if (stream != stdout) fclose(stream);
+         if (streamNo == 1) {
+            return False;
+         } else {
+            if (noisy)
+            fprintf ( stderr, 
+                      "\n%s: %s: trailing garbage after EOF ignored\n",
+                      progName, inName );
+            return True;       
+         }
+      default:
+         panic ( "decompress:unexpected error" );
+   }
+
+   panic ( "decompress:end" );
+   return True; /*notreached*/
+}
+
+
+/*---------------------------------------------*/
+static 
+Bool testStream ( FILE *zStream )
+{
+   BZFILE* bzf = NULL;
+   Int32   bzerr, bzerr_dummy, ret, nread, streamNo, i;
+   UChar   obuf[5000];
+   UChar   unused[BZ_MAX_UNUSED];
+   Int32   nUnused;
+   void*   unusedTmpV;
+   UChar*  unusedTmp;
+
+   nUnused = 0;
+   streamNo = 0;
+
+   SET_BINARY_MODE(zStream);
+   if (ferror(zStream)) goto errhandler_io;
+
+   while (True) {
+
+      bzf = BZ2_bzReadOpen ( 
+               &bzerr, zStream, verbosity, 
+               (int)smallMode, unused, nUnused
+            );
+      if (bzf == NULL || bzerr != BZ_OK) goto errhandler;
+      streamNo++;
+
+      while (bzerr == BZ_OK) {
+         nread = BZ2_bzRead ( &bzerr, bzf, obuf, 5000 );
+         if (bzerr == BZ_DATA_ERROR_MAGIC) goto errhandler;
+      }
+      if (bzerr != BZ_STREAM_END) goto errhandler;
+
+      BZ2_bzReadGetUnused ( &bzerr, bzf, &unusedTmpV, &nUnused );
+      if (bzerr != BZ_OK) panic ( "test:bzReadGetUnused" );
+
+      unusedTmp = (UChar*)unusedTmpV;
+      for (i = 0; i < nUnused; i++) unused[i] = unusedTmp[i];
+
+      BZ2_bzReadClose ( &bzerr, bzf );
+      if (bzerr != BZ_OK) panic ( "test:bzReadGetUnused" );
+      if (nUnused == 0 && myfeof(zStream)) break;
+
+   }
+
+   if (ferror(zStream)) goto errhandler_io;
+   ret = fclose ( zStream );
+   if (ret == EOF) goto errhandler_io;
+
+   if (verbosity >= 2) fprintf ( stderr, "\n    " );
+   return True;
+
+   errhandler:
+   BZ2_bzReadClose ( &bzerr_dummy, bzf );
+   if (verbosity == 0) 
+      fprintf ( stderr, "%s: %s: ", progName, inName );
+   switch (bzerr) {
+      case BZ_CONFIG_ERROR:
+         configError(); break;
+      case BZ_IO_ERROR:
+         errhandler_io:
+         ioError(); break;
+      case BZ_DATA_ERROR:
+         fprintf ( stderr,
+                   "data integrity (CRC) error in data\n" );
+         return False;
+      case BZ_MEM_ERROR:
+         outOfMemory();
+      case BZ_UNEXPECTED_EOF:
+         fprintf ( stderr,
+                   "file ends unexpectedly\n" );
+         return False;
+      case BZ_DATA_ERROR_MAGIC:
+         if (zStream != stdin) fclose(zStream);
+         if (streamNo == 1) {
+          fprintf ( stderr, 
+                    "bad magic number (file not created by bzip2)\n" );
+            return False;
+         } else {
+            if (noisy)
+            fprintf ( stderr, 
+                      "trailing garbage after EOF ignored\n" );
+            return True;       
+         }
+      default:
+         panic ( "test:unexpected error" );
+   }
+
+   panic ( "test:end" );
+   return True; /*notreached*/
+}
+
+
+/*---------------------------------------------------*/
+/*--- Error [non-] handling grunge                ---*/
+/*---------------------------------------------------*/
+
+/*---------------------------------------------*/
+static
+void setExit ( Int32 v )
+{
+   if (v > exitValue) exitValue = v;
+}
+
+
+/*---------------------------------------------*/
+static 
+void cadvise ( void )
+{
+   if (noisy)
+   fprintf (
+      stderr,
+      "\nIt is possible that the compressed file(s) have become corrupted.\n"
+        "You can use the -tvv option to test integrity of such files.\n\n"
+        "You can use the `bzip2recover' program to attempt to recover\n"
+        "data from undamaged sections of corrupted files.\n\n"
+    );
+}
+
+
+/*---------------------------------------------*/
+static 
+void showFileNames ( void )
+{
+   if (noisy)
+   fprintf (
+      stderr,
+      "\tInput file = %s, output file = %s\n",
+      inName, outName 
+   );
+}
+
+
+/*---------------------------------------------*/
+static 
+void cleanUpAndFail ( Int32 ec )
+{
+   IntNative      retVal;
+   struct MY_STAT statBuf;
+
+   if ( srcMode == SM_F2F 
+        && opMode != OM_TEST
+        && deleteOutputOnInterrupt ) {
+
+      /* Check whether input file still exists.  Delete output file
+         only if input exists to avoid loss of data.  Joerg Prante, 5
+         January 2002.  (JRS 06-Jan-2002: other changes in 1.0.2 mean
+         this is less likely to happen.  But to be ultra-paranoid, we
+         do the check anyway.)  */
+      retVal = MY_STAT ( inName, &statBuf );
+      if (retVal == 0) {
+         if (noisy)
+            fprintf ( stderr, 
+                      "%s: Deleting output file %s, if it exists.\n",
+                      progName, outName );
+         if (outputHandleJustInCase != NULL)
+            fclose ( outputHandleJustInCase );
+         retVal = remove ( outName );
+         if (retVal != 0)
+            fprintf ( stderr,
+                      "%s: WARNING: deletion of output file "
+                      "(apparently) failed.\n",
+                      progName );
+      } else {
+         fprintf ( stderr,
+                   "%s: WARNING: deletion of output file suppressed\n",
+                    progName );
+         fprintf ( stderr,
+                   "%s:    since input file no longer exists.  Output file\n",
+                   progName );
+         fprintf ( stderr,
+                   "%s:    `%s' may be incomplete.\n",
+                   progName, outName );
+         fprintf ( stderr, 
+                   "%s:    I suggest doing an integrity test (bzip2 -tv)"
+                   " of it.\n",
+                   progName );
+      }
+   }
+
+   if (noisy && numFileNames > 0 && numFilesProcessed < numFileNames) {
+      fprintf ( stderr, 
+                "%s: WARNING: some files have not been processed:\n"
+                "%s:    %d specified on command line, %d not processed yet.\n\n",
+                progName, progName,
+                numFileNames, numFileNames - numFilesProcessed );
+   }
+   setExit(ec);
+   exit(exitValue);
+}
+
+
+/*---------------------------------------------*/
+static 
+void panic ( Char* s )
+{
+   fprintf ( stderr,
+             "\n%s: PANIC -- internal consistency error:\n"
+             "\t%s\n"
+             "\tThis is a BUG.  Please report it to me at:\n"
+             "\tjseward@bzip.org\n",
+             progName, s );
+   showFileNames();
+   cleanUpAndFail( 3 );
+}
+
+
+/*---------------------------------------------*/
+static 
+void crcError ( void )
+{
+   fprintf ( stderr,
+             "\n%s: Data integrity error when decompressing.\n",
+             progName );
+   showFileNames();
+   cadvise();
+   cleanUpAndFail( 2 );
+}
+
+
+/*---------------------------------------------*/
+static 
+void compressedStreamEOF ( void )
+{
+  if (noisy) {
+    fprintf ( stderr,
+	      "\n%s: Compressed file ends unexpectedly;\n\t"
+	      "perhaps it is corrupted?  *Possible* reason follows.\n",
+	      progName );
+    perror ( progName );
+    showFileNames();
+    cadvise();
+  }
+  cleanUpAndFail( 2 );
+}
+
+
+/*---------------------------------------------*/
+static 
+void ioError ( void )
+{
+   fprintf ( stderr,
+             "\n%s: I/O or other error, bailing out.  "
+             "Possible reason follows.\n",
+             progName );
+   perror ( progName );
+   showFileNames();
+   cleanUpAndFail( 1 );
+}
+
+
+/*---------------------------------------------*/
+static 
+void mySignalCatcher ( IntNative n )
+{
+   fprintf ( stderr,
+             "\n%s: Control-C or similar caught, quitting.\n",
+             progName );
+   cleanUpAndFail(1);
+}
+
+
+/*---------------------------------------------*/
+static 
+void mySIGSEGVorSIGBUScatcher ( IntNative n )
+{
+   if (opMode == OM_Z)
+      fprintf ( 
+      stderr,
+      "\n%s: Caught a SIGSEGV or SIGBUS whilst compressing.\n"
+      "\n"
+      "   Possible causes are (most likely first):\n"
+      "   (1) This computer has unreliable memory or cache hardware\n"
+      "       (a surprisingly common problem; try a different machine.)\n"
+      "   (2) A bug in the compiler used to create this executable\n"
+      "       (unlikely, if you didn't compile bzip2 yourself.)\n"
+      "   (3) A real bug in bzip2 -- I hope this should never be the case.\n"
+      "   The user's manual, Section 4.3, has more info on (1) and (2).\n"
+      "   \n"
+      "   If you suspect this is a bug in bzip2, or are unsure about (1)\n"
+      "   or (2), feel free to report it to me at: jseward@bzip.org.\n"
+      "   Section 4.3 of the user's manual describes the info a useful\n"
+      "   bug report should have.  If the manual is available on your\n"
+      "   system, please try and read it before mailing me.  If you don't\n"
+      "   have the manual or can't be bothered to read it, mail me anyway.\n"
+      "\n",
+      progName );
+      else
+      fprintf ( 
+      stderr,
+      "\n%s: Caught a SIGSEGV or SIGBUS whilst decompressing.\n"
+      "\n"
+      "   Possible causes are (most likely first):\n"
+      "   (1) The compressed data is corrupted, and bzip2's usual checks\n"
+      "       failed to detect this.  Try bzip2 -tvv my_file.bz2.\n"
+      "   (2) This computer has unreliable memory or cache hardware\n"
+      "       (a surprisingly common problem; try a different machine.)\n"
+      "   (3) A bug in the compiler used to create this executable\n"
+      "       (unlikely, if you didn't compile bzip2 yourself.)\n"
+      "   (4) A real bug in bzip2 -- I hope this should never be the case.\n"
+      "   The user's manual, Section 4.3, has more info on (2) and (3).\n"
+      "   \n"
+      "   If you suspect this is a bug in bzip2, or are unsure about (2)\n"
+      "   or (3), feel free to report it to me at: jseward@bzip.org.\n"
+      "   Section 4.3 of the user's manual describes the info a useful\n"
+      "   bug report should have.  If the manual is available on your\n"
+      "   system, please try and read it before mailing me.  If you don't\n"
+      "   have the manual or can't be bothered to read it, mail me anyway.\n"
+      "\n",
+      progName );
+
+   showFileNames();
+   if (opMode == OM_Z)
+      cleanUpAndFail( 3 ); else
+      { cadvise(); cleanUpAndFail( 2 ); }
+}
+
+
+/*---------------------------------------------*/
+static 
+void outOfMemory ( void )
+{
+   fprintf ( stderr,
+             "\n%s: couldn't allocate enough memory\n",
+             progName );
+   showFileNames();
+   cleanUpAndFail(1);
+}
+
+
+/*---------------------------------------------*/
+static 
+void configError ( void )
+{
+   fprintf ( stderr,
+             "bzip2: I'm not configured correctly for this platform!\n"
+             "\tI require Int32, Int16 and Char to have sizes\n"
+             "\tof 4, 2 and 1 bytes to run properly, and they don't.\n"
+             "\tProbably you can fix this by defining them correctly,\n"
+             "\tand recompiling.  Bye!\n" );
+   setExit(3);
+   exit(exitValue);
+}
+
+
+/*---------------------------------------------------*/
+/*--- The main driver machinery                   ---*/
+/*---------------------------------------------------*/
+
+/* All rather crufty.  The main problem is that input files
+   are stat()d multiple times before use.  This should be
+   cleaned up. 
+*/
+
+/*---------------------------------------------*/
+static 
+void pad ( Char *s )
+{
+   Int32 i;
+   if ( (Int32)strlen(s) >= longestFileName ) return;
+   for (i = 1; i <= longestFileName - (Int32)strlen(s); i++)
+      fprintf ( stderr, " " );
+}
+
+
+/*---------------------------------------------*/
+static 
+void copyFileName ( Char* to, Char* from ) 
+{
+   if ( strlen(from) > FILE_NAME_LEN-10 )  {
+      fprintf (
+         stderr,
+         "bzip2: file name\n`%s'\n"
+         "is suspiciously (more than %d chars) long.\n"
+         "Try using a reasonable file name instead.  Sorry! :-)\n",
+         from, FILE_NAME_LEN-10
+      );
+      setExit(1);
+      exit(exitValue);
+   }
+
+  strncpy(to,from,FILE_NAME_LEN-10);
+  to[FILE_NAME_LEN-10]='\0';
+}
+
+
+/*---------------------------------------------*/
+static 
+Bool fileExists ( Char* name )
+{
+   FILE *tmp   = fopen ( name, "rb" );
+   Bool exists = (tmp != NULL);
+   if (tmp != NULL) fclose ( tmp );
+   return exists;
+}
+
+
+/*---------------------------------------------*/
+/* Open an output file safely with O_EXCL and good permissions.
+   This avoids a race condition in versions < 1.0.2, in which
+   the file was first opened and then had its interim permissions
+   set safely.  We instead use open() to create the file with
+   the interim permissions required. (--- --- rw-).
+
+   For non-Unix platforms, if we are not worrying about
+   security issues, simple this simply behaves like fopen.
+*/
+FILE* fopen_output_safely ( Char* name, const char* mode )
+{
+#  if BZ_UNIX
+   FILE*     fp;
+   IntNative fh;
+   fh = open(name, O_WRONLY|O_CREAT|O_EXCL, S_IWUSR|S_IRUSR);
+   if (fh == -1) return NULL;
+   fp = fdopen(fh, mode);
+   if (fp == NULL) close(fh);
+   return fp;
+#  else
+   return fopen(name, mode);
+#  endif
+}
+
+
+/*---------------------------------------------*/
+/*--
+  if in doubt, return True
+--*/
+static 
+Bool notAStandardFile ( Char* name )
+{
+   IntNative      i;
+   struct MY_STAT statBuf;
+
+   i = MY_LSTAT ( name, &statBuf );
+   if (i != 0) return True;
+   if (MY_S_ISREG(statBuf.st_mode)) return False;
+   return True;
+}
+
+
+/*---------------------------------------------*/
+/*--
+  rac 11/21/98 see if file has hard links to it
+--*/
+static 
+Int32 countHardLinks ( Char* name )
+{  
+   IntNative      i;
+   struct MY_STAT statBuf;
+
+   i = MY_LSTAT ( name, &statBuf );
+   if (i != 0) return 0;
+   return (statBuf.st_nlink - 1);
+}
+
+
+/*---------------------------------------------*/
+/* Copy modification date, access date, permissions and owner from the
+   source to destination file.  We have to copy this meta-info off
+   into fileMetaInfo before starting to compress / decompress it,
+   because doing it afterwards means we get the wrong access time.
+
+   To complicate matters, in compress() and decompress() below, the
+   sequence of tests preceding the call to saveInputFileMetaInfo()
+   involves calling fileExists(), which in turn establishes its result
+   by attempting to fopen() the file, and if successful, immediately
+   fclose()ing it again.  So we have to assume that the fopen() call
+   does not cause the access time field to be updated.
+
+   Reading of the man page for stat() (man 2 stat) on RedHat 7.2 seems
+   to imply that merely doing open() will not affect the access time.
+   Therefore we merely need to hope that the C library only does
+   open() as a result of fopen(), and not any kind of read()-ahead
+   cleverness.
+
+   It sounds pretty fragile to me.  Whether this carries across
+   robustly to arbitrary Unix-like platforms (or even works robustly
+   on this one, RedHat 7.2) is unknown to me.  Nevertheless ...  
+*/
+#if BZ_UNIX
+static 
+struct MY_STAT fileMetaInfo;
+#endif
+
+static 
+void saveInputFileMetaInfo ( Char *srcName )
+{
+#  if BZ_UNIX
+   IntNative retVal;
+   /* Note use of stat here, not lstat. */
+   retVal = MY_STAT( srcName, &fileMetaInfo );
+   ERROR_IF_NOT_ZERO ( retVal );
+#  endif
+}
+
+
+static 
+void applySavedMetaInfoToOutputFile ( Char *dstName )
+{
+#  if BZ_UNIX
+   IntNative      retVal;
+   struct utimbuf uTimBuf;
+
+   uTimBuf.actime = fileMetaInfo.st_atime;
+   uTimBuf.modtime = fileMetaInfo.st_mtime;
+
+   retVal = chmod ( dstName, fileMetaInfo.st_mode );
+   ERROR_IF_NOT_ZERO ( retVal );
+
+   retVal = utime ( dstName, &uTimBuf );
+   ERROR_IF_NOT_ZERO ( retVal );
+
+   retVal = chown ( dstName, fileMetaInfo.st_uid, fileMetaInfo.st_gid );
+   /* chown() will in many cases return with EPERM, which can
+      be safely ignored.
+   */
+#  endif
+}
+
+
+/*---------------------------------------------*/
+static 
+Bool containsDubiousChars ( Char* name )
+{
+#  if BZ_UNIX
+   /* On unix, files can contain any characters and the file expansion
+    * is performed by the shell.
+    */
+   return False;
+#  else /* ! BZ_UNIX */
+   /* On non-unix (Win* platforms), wildcard characters are not allowed in 
+    * filenames.
+    */
+   for (; *name != '\0'; name++)
+      if (*name == '?' || *name == '*') return True;
+   return False;
+#  endif /* BZ_UNIX */
+}
+
+
+/*---------------------------------------------*/
+#define BZ_N_SUFFIX_PAIRS 4
+
+Char* zSuffix[BZ_N_SUFFIX_PAIRS] 
+   = { ".bz2", ".bz", ".tbz2", ".tbz" };
+Char* unzSuffix[BZ_N_SUFFIX_PAIRS] 
+   = { "", "", ".tar", ".tar" };
+
+static 
+Bool hasSuffix ( Char* s, Char* suffix )
+{
+   Int32 ns = strlen(s);
+   Int32 nx = strlen(suffix);
+   if (ns < nx) return False;
+   if (strcmp(s + ns - nx, suffix) == 0) return True;
+   return False;
+}
+
+static 
+Bool mapSuffix ( Char* name, 
+                 Char* oldSuffix, Char* newSuffix )
+{
+   if (!hasSuffix(name,oldSuffix)) return False;
+   name[strlen(name)-strlen(oldSuffix)] = 0;
+   strcat ( name, newSuffix );
+   return True;
+}
+
+
+/*---------------------------------------------*/
+static 
+void compress ( Char *name )
+{
+   FILE  *inStr;
+   FILE  *outStr;
+   Int32 n, i;
+   struct MY_STAT statBuf;
+
+   deleteOutputOnInterrupt = False;
+
+   if (name == NULL && srcMode != SM_I2O)
+      panic ( "compress: bad modes\n" );
+
+   switch (srcMode) {
+      case SM_I2O: 
+         copyFileName ( inName, "(stdin)" );
+         copyFileName ( outName, "(stdout)" ); 
+         break;
+      case SM_F2F: 
+         copyFileName ( inName, name );
+         copyFileName ( outName, name );
+         strcat ( outName, ".bz2" ); 
+         break;
+      case SM_F2O: 
+         copyFileName ( inName, name );
+         copyFileName ( outName, "(stdout)" ); 
+         break;
+   }
+
+   if ( srcMode != SM_I2O && containsDubiousChars ( inName ) ) {
+      if (noisy)
+      fprintf ( stderr, "%s: There are no files matching `%s'.\n",
+                progName, inName );
+      setExit(1);
+      return;
+   }
+   if ( srcMode != SM_I2O && !fileExists ( inName ) ) {
+      fprintf ( stderr, "%s: Can't open input file %s: %s.\n",
+                progName, inName, strerror(errno) );
+      setExit(1);
+      return;
+   }
+   for (i = 0; i < BZ_N_SUFFIX_PAIRS; i++) {
+      if (hasSuffix(inName, zSuffix[i])) {
+         if (noisy)
+         fprintf ( stderr, 
+                   "%s: Input file %s already has %s suffix.\n",
+                   progName, inName, zSuffix[i] );
+         setExit(1);
+         return;
+      }
+   }
+   if ( srcMode == SM_F2F || srcMode == SM_F2O ) {
+      MY_STAT(inName, &statBuf);
+      if ( MY_S_ISDIR(statBuf.st_mode) ) {
+         fprintf( stderr,
+                  "%s: Input file %s is a directory.\n",
+                  progName,inName);
+         setExit(1);
+         return;
+      }
+   }
+   if ( srcMode == SM_F2F && !forceOverwrite && notAStandardFile ( inName )) {
+      if (noisy)
+      fprintf ( stderr, "%s: Input file %s is not a normal file.\n",
+                progName, inName );
+      setExit(1);
+      return;
+   }
+   if ( srcMode == SM_F2F && fileExists ( outName ) ) {
+      if (forceOverwrite) {
+	 remove(outName);
+      } else {
+	 fprintf ( stderr, "%s: Output file %s already exists.\n",
+		   progName, outName );
+	 setExit(1);
+	 return;
+      }
+   }
+   if ( srcMode == SM_F2F && !forceOverwrite &&
+        (n=countHardLinks ( inName )) > 0) {
+      fprintf ( stderr, "%s: Input file %s has %d other link%s.\n",
+                progName, inName, n, n > 1 ? "s" : "" );
+      setExit(1);
+      return;
+   }
+
+   if ( srcMode == SM_F2F ) {
+      /* Save the file's meta-info before we open it.  Doing it later
+         means we mess up the access times. */
+      saveInputFileMetaInfo ( inName );
+   }
+
+   switch ( srcMode ) {
+
+      case SM_I2O:
+         inStr = stdin;
+         outStr = stdout;
+         if ( isatty ( fileno ( stdout ) ) ) {
+            fprintf ( stderr,
+                      "%s: I won't write compressed data to a terminal.\n",
+                      progName );
+            fprintf ( stderr, "%s: For help, type: `%s --help'.\n",
+                              progName, progName );
+            setExit(1);
+            return;
+         };
+         break;
+
+      case SM_F2O:
+         inStr = fopen ( inName, "rb" );
+         outStr = stdout;
+         if ( isatty ( fileno ( stdout ) ) ) {
+            fprintf ( stderr,
+                      "%s: I won't write compressed data to a terminal.\n",
+                      progName );
+            fprintf ( stderr, "%s: For help, type: `%s --help'.\n",
+                              progName, progName );
+            if ( inStr != NULL ) fclose ( inStr );
+            setExit(1);
+            return;
+         };
+         if ( inStr == NULL ) {
+            fprintf ( stderr, "%s: Can't open input file %s: %s.\n",
+                      progName, inName, strerror(errno) );
+            setExit(1);
+            return;
+         };
+         break;
+
+      case SM_F2F:
+         inStr = fopen ( inName, "rb" );
+         outStr = fopen_output_safely ( outName, "wb" );
+         if ( outStr == NULL) {
+            fprintf ( stderr, "%s: Can't create output file %s: %s.\n",
+                      progName, outName, strerror(errno) );
+            if ( inStr != NULL ) fclose ( inStr );
+            setExit(1);
+            return;
+         }
+         if ( inStr == NULL ) {
+            fprintf ( stderr, "%s: Can't open input file %s: %s.\n",
+                      progName, inName, strerror(errno) );
+            if ( outStr != NULL ) fclose ( outStr );
+            setExit(1);
+            return;
+         };
+         break;
+
+      default:
+         panic ( "compress: bad srcMode" );
+         break;
+   }
+
+   if (verbosity >= 1) {
+      fprintf ( stderr,  "  %s: ", inName );
+      pad ( inName );
+      fflush ( stderr );
+   }
+
+   /*--- Now the input and output handles are sane.  Do the Biz. ---*/
+   outputHandleJustInCase = outStr;
+   deleteOutputOnInterrupt = True;
+   compressStream ( inStr, outStr );
+   outputHandleJustInCase = NULL;
+
+   /*--- If there was an I/O error, we won't get here. ---*/
+   if ( srcMode == SM_F2F ) {
+      applySavedMetaInfoToOutputFile ( outName );
+      deleteOutputOnInterrupt = False;
+      if ( !keepInputFiles ) {
+         IntNative retVal = remove ( inName );
+         ERROR_IF_NOT_ZERO ( retVal );
+      }
+   }
+
+   deleteOutputOnInterrupt = False;
+}
+
+
+/*---------------------------------------------*/
+static 
+void uncompress ( Char *name )
+{
+   FILE  *inStr;
+   FILE  *outStr;
+   Int32 n, i;
+   Bool  magicNumberOK;
+   Bool  cantGuess;
+   struct MY_STAT statBuf;
+
+   deleteOutputOnInterrupt = False;
+
+   if (name == NULL && srcMode != SM_I2O)
+      panic ( "uncompress: bad modes\n" );
+
+   cantGuess = False;
+   switch (srcMode) {
+      case SM_I2O: 
+         copyFileName ( inName, "(stdin)" );
+         copyFileName ( outName, "(stdout)" ); 
+         break;
+      case SM_F2F: 
+         copyFileName ( inName, name );
+         copyFileName ( outName, name );
+         for (i = 0; i < BZ_N_SUFFIX_PAIRS; i++)
+            if (mapSuffix(outName,zSuffix[i],unzSuffix[i]))
+               goto zzz; 
+         cantGuess = True;
+         strcat ( outName, ".out" );
+         break;
+      case SM_F2O: 
+         copyFileName ( inName, name );
+         copyFileName ( outName, "(stdout)" ); 
+         break;
+   }
+
+   zzz:
+   if ( srcMode != SM_I2O && containsDubiousChars ( inName ) ) {
+      if (noisy)
+      fprintf ( stderr, "%s: There are no files matching `%s'.\n",
+                progName, inName );
+      setExit(1);
+      return;
+   }
+   if ( srcMode != SM_I2O && !fileExists ( inName ) ) {
+      fprintf ( stderr, "%s: Can't open input file %s: %s.\n",
+                progName, inName, strerror(errno) );
+      setExit(1);
+      return;
+   }
+   if ( srcMode == SM_F2F || srcMode == SM_F2O ) {
+      MY_STAT(inName, &statBuf);
+      if ( MY_S_ISDIR(statBuf.st_mode) ) {
+         fprintf( stderr,
+                  "%s: Input file %s is a directory.\n",
+                  progName,inName);
+         setExit(1);
+         return;
+      }
+   }
+   if ( srcMode == SM_F2F && !forceOverwrite && notAStandardFile ( inName )) {
+      if (noisy)
+      fprintf ( stderr, "%s: Input file %s is not a normal file.\n",
+                progName, inName );
+      setExit(1);
+      return;
+   }
+   if ( /* srcMode == SM_F2F implied && */ cantGuess ) {
+      if (noisy)
+      fprintf ( stderr, 
+                "%s: Can't guess original name for %s -- using %s\n",
+                progName, inName, outName );
+      /* just a warning, no return */
+   }   
+   if ( srcMode == SM_F2F && fileExists ( outName ) ) {
+      if (forceOverwrite) {
+	remove(outName);
+      } else {
+        fprintf ( stderr, "%s: Output file %s already exists.\n",
+                  progName, outName );
+        setExit(1);
+        return;
+      }
+   }
+   if ( srcMode == SM_F2F && !forceOverwrite &&
+        (n=countHardLinks ( inName ) ) > 0) {
+      fprintf ( stderr, "%s: Input file %s has %d other link%s.\n",
+                progName, inName, n, n > 1 ? "s" : "" );
+      setExit(1);
+      return;
+   }
+
+   if ( srcMode == SM_F2F ) {
+      /* Save the file's meta-info before we open it.  Doing it later
+         means we mess up the access times. */
+      saveInputFileMetaInfo ( inName );
+   }
+
+   switch ( srcMode ) {
+
+      case SM_I2O:
+         inStr = stdin;
+         outStr = stdout;
+         if ( isatty ( fileno ( stdin ) ) ) {
+            fprintf ( stderr,
+                      "%s: I won't read compressed data from a terminal.\n",
+                      progName );
+            fprintf ( stderr, "%s: For help, type: `%s --help'.\n",
+                              progName, progName );
+            setExit(1);
+            return;
+         };
+         break;
+
+      case SM_F2O:
+         inStr = fopen ( inName, "rb" );
+         outStr = stdout;
+         if ( inStr == NULL ) {
+            fprintf ( stderr, "%s: Can't open input file %s:%s.\n",
+                      progName, inName, strerror(errno) );
+            if ( inStr != NULL ) fclose ( inStr );
+            setExit(1);
+            return;
+         };
+         break;
+
+      case SM_F2F:
+         inStr = fopen ( inName, "rb" );
+         outStr = fopen_output_safely ( outName, "wb" );
+         if ( outStr == NULL) {
+            fprintf ( stderr, "%s: Can't create output file %s: %s.\n",
+                      progName, outName, strerror(errno) );
+            if ( inStr != NULL ) fclose ( inStr );
+            setExit(1);
+            return;
+         }
+         if ( inStr == NULL ) {
+            fprintf ( stderr, "%s: Can't open input file %s: %s.\n",
+                      progName, inName, strerror(errno) );
+            if ( outStr != NULL ) fclose ( outStr );
+            setExit(1);
+            return;
+         };
+         break;
+
+      default:
+         panic ( "uncompress: bad srcMode" );
+         break;
+   }
+
+   if (verbosity >= 1) {
+      fprintf ( stderr, "  %s: ", inName );
+      pad ( inName );
+      fflush ( stderr );
+   }
+
+   /*--- Now the input and output handles are sane.  Do the Biz. ---*/
+   outputHandleJustInCase = outStr;
+   deleteOutputOnInterrupt = True;
+   magicNumberOK = uncompressStream ( inStr, outStr );
+   outputHandleJustInCase = NULL;
+
+   /*--- If there was an I/O error, we won't get here. ---*/
+   if ( magicNumberOK ) {
+      if ( srcMode == SM_F2F ) {
+         applySavedMetaInfoToOutputFile ( outName );
+         deleteOutputOnInterrupt = False;
+         if ( !keepInputFiles ) {
+            IntNative retVal = remove ( inName );
+            ERROR_IF_NOT_ZERO ( retVal );
+         }
+      }
+   } else {
+      unzFailsExist = True;
+      deleteOutputOnInterrupt = False;
+      if ( srcMode == SM_F2F ) {
+         IntNative retVal = remove ( outName );
+         ERROR_IF_NOT_ZERO ( retVal );
+      }
+   }
+   deleteOutputOnInterrupt = False;
+
+   if ( magicNumberOK ) {
+      if (verbosity >= 1)
+         fprintf ( stderr, "done\n" );
+   } else {
+      setExit(2);
+      if (verbosity >= 1)
+         fprintf ( stderr, "not a bzip2 file.\n" ); else
+         fprintf ( stderr,
+                   "%s: %s is not a bzip2 file.\n",
+                   progName, inName );
+   }
+
+}
+
+
+/*---------------------------------------------*/
+static 
+void testf ( Char *name )
+{
+   FILE *inStr;
+   Bool allOK;
+   struct MY_STAT statBuf;
+
+   deleteOutputOnInterrupt = False;
+
+   if (name == NULL && srcMode != SM_I2O)
+      panic ( "testf: bad modes\n" );
+
+   copyFileName ( outName, "(none)" );
+   switch (srcMode) {
+      case SM_I2O: copyFileName ( inName, "(stdin)" ); break;
+      case SM_F2F: copyFileName ( inName, name ); break;
+      case SM_F2O: copyFileName ( inName, name ); break;
+   }
+
+   if ( srcMode != SM_I2O && containsDubiousChars ( inName ) ) {
+      if (noisy)
+      fprintf ( stderr, "%s: There are no files matching `%s'.\n",
+                progName, inName );
+      setExit(1);
+      return;
+   }
+   if ( srcMode != SM_I2O && !fileExists ( inName ) ) {
+      fprintf ( stderr, "%s: Can't open input %s: %s.\n",
+                progName, inName, strerror(errno) );
+      setExit(1);
+      return;
+   }
+   if ( srcMode != SM_I2O ) {
+      MY_STAT(inName, &statBuf);
+      if ( MY_S_ISDIR(statBuf.st_mode) ) {
+         fprintf( stderr,
+                  "%s: Input file %s is a directory.\n",
+                  progName,inName);
+         setExit(1);
+         return;
+      }
+   }
+
+   switch ( srcMode ) {
+
+      case SM_I2O:
+         if ( isatty ( fileno ( stdin ) ) ) {
+            fprintf ( stderr,
+                      "%s: I won't read compressed data from a terminal.\n",
+                      progName );
+            fprintf ( stderr, "%s: For help, type: `%s --help'.\n",
+                              progName, progName );
+            setExit(1);
+            return;
+         };
+         inStr = stdin;
+         break;
+
+      case SM_F2O: case SM_F2F:
+         inStr = fopen ( inName, "rb" );
+         if ( inStr == NULL ) {
+            fprintf ( stderr, "%s: Can't open input file %s:%s.\n",
+                      progName, inName, strerror(errno) );
+            setExit(1);
+            return;
+         };
+         break;
+
+      default:
+         panic ( "testf: bad srcMode" );
+         break;
+   }
+
+   if (verbosity >= 1) {
+      fprintf ( stderr, "  %s: ", inName );
+      pad ( inName );
+      fflush ( stderr );
+   }
+
+   /*--- Now the input handle is sane.  Do the Biz. ---*/
+   outputHandleJustInCase = NULL;
+   allOK = testStream ( inStr );
+
+   if (allOK && verbosity >= 1) fprintf ( stderr, "ok\n" );
+   if (!allOK) testFailsExist = True;
+}
+
+
+/*---------------------------------------------*/
+static 
+void license ( void )
+{
+   fprintf ( stderr,
+
+    "bzip2, a block-sorting file compressor.  "
+    "Version %s.\n"
+    "   \n"
+    "   Copyright (C) 1996-2005 by Julian Seward.\n"
+    "   \n"
+    "   This program is free software; you can redistribute it and/or modify\n"
+    "   it under the terms set out in the LICENSE file, which is included\n"
+    "   in the bzip2-1.0 source distribution.\n"
+    "   \n"
+    "   This program is distributed in the hope that it will be useful,\n"
+    "   but WITHOUT ANY WARRANTY; without even the implied warranty of\n"
+    "   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the\n"
+    "   LICENSE file for more details.\n"
+    "   \n",
+    BZ2_bzlibVersion()
+   );
+}
+
+
+/*---------------------------------------------*/
+static 
+void usage ( Char *fullProgName )
+{
+   fprintf (
+      stderr,
+      "bzip2, a block-sorting file compressor.  "
+      "Version %s.\n"
+      "\n   usage: %s [flags and input files in any order]\n"
+      "\n"
+      "   -h --help           print this message\n"
+      "   -d --decompress     force decompression\n"
+      "   -z --compress       force compression\n"
+      "   -k --keep           keep (don't delete) input files\n"
+      "   -f --force          overwrite existing output files\n"
+      "   -t --test           test compressed file integrity\n"
+      "   -c --stdout         output to standard out\n"
+      "   -q --quiet          suppress noncritical error messages\n"
+      "   -v --verbose        be verbose (a 2nd -v gives more)\n"
+      "   -L --license        display software version & license\n"
+      "   -V --version        display software version & license\n"
+      "   -s --small          use less memory (at most 2500k)\n"
+      "   -1 .. -9            set block size to 100k .. 900k\n"
+      "   --fast              alias for -1\n"
+      "   --best              alias for -9\n"
+      "\n"
+      "   If invoked as `bzip2', default action is to compress.\n"
+      "              as `bunzip2',  default action is to decompress.\n"
+      "              as `bzcat', default action is to decompress to stdout.\n"
+      "\n"
+      "   If no file names are given, bzip2 compresses or decompresses\n"
+      "   from standard input to standard output.  You can combine\n"
+      "   short flags, so `-v -4' means the same as -v4 or -4v, &c.\n"
+#     if BZ_UNIX
+      "\n"
+#     endif
+      ,
+
+      BZ2_bzlibVersion(),
+      fullProgName
+   );
+}
+
+
+/*---------------------------------------------*/
+static 
+void redundant ( Char* flag )
+{
+   fprintf ( 
+      stderr, 
+      "%s: %s is redundant in versions 0.9.5 and above\n",
+      progName, flag );
+}
+
+
+/*---------------------------------------------*/
+/*--
+  All the garbage from here to main() is purely to
+  implement a linked list of command-line arguments,
+  into which main() copies argv[1 .. argc-1].
+
+  The purpose of this exercise is to facilitate 
+  the expansion of wildcard characters * and ? in 
+  filenames for OSs which don't know how to do it
+  themselves, like MSDOS, Windows 95 and NT.
+
+  The actual Dirty Work is done by the platform-
+  specific macro APPEND_FILESPEC.
+--*/
+
+typedef
+   struct zzzz {
+      Char        *name;
+      struct zzzz *link;
+   }
+   Cell;
+
+
+/*---------------------------------------------*/
+static 
+void *myMalloc ( Int32 n )
+{
+   void* p;
+
+   p = malloc ( (size_t)n );
+   if (p == NULL) outOfMemory ();
+   return p;
+}
+
+
+/*---------------------------------------------*/
+static 
+Cell *mkCell ( void )
+{
+   Cell *c;
+
+   c = (Cell*) myMalloc ( sizeof ( Cell ) );
+   c->name = NULL;
+   c->link = NULL;
+   return c;
+}
+
+
+/*---------------------------------------------*/
+static 
+Cell *snocString ( Cell *root, Char *name )
+{
+   if (root == NULL) {
+      Cell *tmp = mkCell();
+      tmp->name = (Char*) myMalloc ( 5 + strlen(name) );
+      strcpy ( tmp->name, name );
+      return tmp;
+   } else {
+      Cell *tmp = root;
+      while (tmp->link != NULL) tmp = tmp->link;
+      tmp->link = snocString ( tmp->link, name );
+      return root;
+   }
+}
+
+
+/*---------------------------------------------*/
+static 
+void addFlagsFromEnvVar ( Cell** argList, Char* varName ) 
+{
+   Int32 i, j, k;
+   Char *envbase, *p;
+
+   envbase = getenv(varName);
+   if (envbase != NULL) {
+      p = envbase;
+      i = 0;
+      while (True) {
+         if (p[i] == 0) break;
+         p += i;
+         i = 0;
+         while (isspace((Int32)(p[0]))) p++;
+         while (p[i] != 0 && !isspace((Int32)(p[i]))) i++;
+         if (i > 0) {
+            k = i; if (k > FILE_NAME_LEN-10) k = FILE_NAME_LEN-10;
+            for (j = 0; j < k; j++) tmpName[j] = p[j];
+            tmpName[k] = 0;
+            APPEND_FLAG(*argList, tmpName);
+         }
+      }
+   }
+}
+
+
+/*---------------------------------------------*/
+#define ISFLAG(s) (strcmp(aa->name, (s))==0)
+
+IntNative main ( IntNative argc, Char *argv[] )
+{
+   Int32  i, j;
+   Char   *tmp;
+   Cell   *argList;
+   Cell   *aa;
+   Bool   decode;
+
+   /*-- Be really really really paranoid :-) --*/
+   if (sizeof(Int32) != 4 || sizeof(UInt32) != 4  ||
+       sizeof(Int16) != 2 || sizeof(UInt16) != 2  ||
+       sizeof(Char)  != 1 || sizeof(UChar)  != 1)
+      configError();
+
+   /*-- Initialise --*/
+   outputHandleJustInCase  = NULL;
+   smallMode               = False;
+   keepInputFiles          = False;
+   forceOverwrite          = False;
+   noisy                   = True;
+   verbosity               = 0;
+   blockSize100k           = 9;
+   testFailsExist          = False;
+   unzFailsExist           = False;
+   numFileNames            = 0;
+   numFilesProcessed       = 0;
+   workFactor              = 30;
+   deleteOutputOnInterrupt = False;
+   exitValue               = 0;
+   i = j = 0; /* avoid bogus warning from egcs-1.1.X */
+
+   /*-- Set up signal handlers for mem access errors --*/
+   signal (SIGSEGV, mySIGSEGVorSIGBUScatcher);
+#  if BZ_UNIX
+#  ifndef __DJGPP__
+   signal (SIGBUS,  mySIGSEGVorSIGBUScatcher);
+#  endif
+#  endif
+
+   copyFileName ( inName,  "(none)" );
+   copyFileName ( outName, "(none)" );
+
+   copyFileName ( progNameReally, argv[0] );
+   progName = &progNameReally[0];
+   for (tmp = &progNameReally[0]; *tmp != '\0'; tmp++)
+      if (*tmp == PATH_SEP) progName = tmp + 1;
+
+
+   /*-- Copy flags from env var BZIP2, and 
+        expand filename wildcards in arg list.
+   --*/
+   argList = NULL;
+   addFlagsFromEnvVar ( &argList,  "BZIP2" );
+   addFlagsFromEnvVar ( &argList,  "BZIP" );
+   for (i = 1; i <= argc-1; i++)
+      APPEND_FILESPEC(argList, argv[i]);
+
+
+   /*-- Find the length of the longest filename --*/
+   longestFileName = 7;
+   numFileNames    = 0;
+   decode          = True;
+   for (aa = argList; aa != NULL; aa = aa->link) {
+      if (ISFLAG("--")) { decode = False; continue; }
+      if (aa->name[0] == '-' && decode) continue;
+      numFileNames++;
+      if (longestFileName < (Int32)strlen(aa->name) )
+         longestFileName = (Int32)strlen(aa->name);
+   }
+
+
+   /*-- Determine source modes; flag handling may change this too. --*/
+   if (numFileNames == 0)
+      srcMode = SM_I2O; else srcMode = SM_F2F;
+
+
+   /*-- Determine what to do (compress/uncompress/test/cat). --*/
+   /*-- Note that subsequent flag handling may change this. --*/
+   opMode = OM_Z;
+
+   if ( (strstr ( progName, "unzip" ) != 0) ||
+        (strstr ( progName, "UNZIP" ) != 0) )
+      opMode = OM_UNZ;
+
+   if ( (strstr ( progName, "z2cat" ) != 0) ||
+        (strstr ( progName, "Z2CAT" ) != 0) ||
+        (strstr ( progName, "zcat" ) != 0)  ||
+        (strstr ( progName, "ZCAT" ) != 0) )  {
+      opMode = OM_UNZ;
+      srcMode = (numFileNames == 0) ? SM_I2O : SM_F2O;
+   }
+
+
+   /*-- Look at the flags. --*/
+   for (aa = argList; aa != NULL; aa = aa->link) {
+      if (ISFLAG("--")) break;
+      if (aa->name[0] == '-' && aa->name[1] != '-') {
+         for (j = 1; aa->name[j] != '\0'; j++) {
+            switch (aa->name[j]) {
+               case 'c': srcMode          = SM_F2O; break;
+               case 'd': opMode           = OM_UNZ; break;
+               case 'z': opMode           = OM_Z; break;
+               case 'f': forceOverwrite   = True; break;
+               case 't': opMode           = OM_TEST; break;
+               case 'k': keepInputFiles   = True; break;
+               case 's': smallMode        = True; break;
+               case 'q': noisy            = False; break;
+               case '1': blockSize100k    = 1; break;
+               case '2': blockSize100k    = 2; break;
+               case '3': blockSize100k    = 3; break;
+               case '4': blockSize100k    = 4; break;
+               case '5': blockSize100k    = 5; break;
+               case '6': blockSize100k    = 6; break;
+               case '7': blockSize100k    = 7; break;
+               case '8': blockSize100k    = 8; break;
+               case '9': blockSize100k    = 9; break;
+               case 'V':
+               case 'L': license();            break;
+               case 'v': verbosity++; break;
+               case 'h': usage ( progName );
+                         exit ( 0 );
+                         break;
+               default:  fprintf ( stderr, "%s: Bad flag `%s'\n",
+                                   progName, aa->name );
+                         usage ( progName );
+                         exit ( 1 );
+                         break;
+            }
+         }
+      }
+   }
+   
+   /*-- And again ... --*/
+   for (aa = argList; aa != NULL; aa = aa->link) {
+      if (ISFLAG("--")) break;
+      if (ISFLAG("--stdout"))            srcMode          = SM_F2O;  else
+      if (ISFLAG("--decompress"))        opMode           = OM_UNZ;  else
+      if (ISFLAG("--compress"))          opMode           = OM_Z;    else
+      if (ISFLAG("--force"))             forceOverwrite   = True;    else
+      if (ISFLAG("--test"))              opMode           = OM_TEST; else
+      if (ISFLAG("--keep"))              keepInputFiles   = True;    else
+      if (ISFLAG("--small"))             smallMode        = True;    else
+      if (ISFLAG("--quiet"))             noisy            = False;   else
+      if (ISFLAG("--version"))           license();                  else
+      if (ISFLAG("--license"))           license();                  else
+      if (ISFLAG("--exponential"))       workFactor = 1;             else 
+      if (ISFLAG("--repetitive-best"))   redundant(aa->name);        else
+      if (ISFLAG("--repetitive-fast"))   redundant(aa->name);        else
+      if (ISFLAG("--fast"))              blockSize100k = 1;          else
+      if (ISFLAG("--best"))              blockSize100k = 9;          else
+      if (ISFLAG("--verbose"))           verbosity++;                else
+      if (ISFLAG("--help"))              { usage ( progName ); exit ( 0 ); }
+         else
+         if (strncmp ( aa->name, "--", 2) == 0) {
+            fprintf ( stderr, "%s: Bad flag `%s'\n", progName, aa->name );
+            usage ( progName );
+            exit ( 1 );
+         }
+   }
+
+   if (verbosity > 4) verbosity = 4;
+   if (opMode == OM_Z && smallMode && blockSize100k > 2) 
+      blockSize100k = 2;
+
+   if (opMode == OM_TEST && srcMode == SM_F2O) {
+      fprintf ( stderr, "%s: -c and -t cannot be used together.\n",
+                progName );
+      exit ( 1 );
+   }
+
+   if (srcMode == SM_F2O && numFileNames == 0)
+      srcMode = SM_I2O;
+
+   if (opMode != OM_Z) blockSize100k = 0;
+
+   if (srcMode == SM_F2F) {
+      signal (SIGINT,  mySignalCatcher);
+      signal (SIGTERM, mySignalCatcher);
+#     if BZ_UNIX
+      signal (SIGHUP,  mySignalCatcher);
+#     endif
+   }
+
+   if (opMode == OM_Z) {
+     if (srcMode == SM_I2O) {
+        compress ( NULL );
+     } else {
+        decode = True;
+        for (aa = argList; aa != NULL; aa = aa->link) {
+           if (ISFLAG("--")) { decode = False; continue; }
+           if (aa->name[0] == '-' && decode) continue;
+           numFilesProcessed++;
+           compress ( aa->name );
+        }
+     }
+   } 
+   else
+
+   if (opMode == OM_UNZ) {
+      unzFailsExist = False;
+      if (srcMode == SM_I2O) {
+         uncompress ( NULL );
+      } else {
+         decode = True;
+         for (aa = argList; aa != NULL; aa = aa->link) {
+            if (ISFLAG("--")) { decode = False; continue; }
+            if (aa->name[0] == '-' && decode) continue;
+            numFilesProcessed++;
+            uncompress ( aa->name );
+         }      
+      }
+      if (unzFailsExist) { 
+         setExit(2); 
+         exit(exitValue);
+      }
+   } 
+
+   else {
+      testFailsExist = False;
+      if (srcMode == SM_I2O) {
+         testf ( NULL );
+      } else {
+         decode = True;
+         for (aa = argList; aa != NULL; aa = aa->link) {
+	    if (ISFLAG("--")) { decode = False; continue; }
+            if (aa->name[0] == '-' && decode) continue;
+            numFilesProcessed++;
+            testf ( aa->name );
+	 }
+      }
+      if (testFailsExist && noisy) {
+         fprintf ( stderr,
+           "\n"
+           "You can use the `bzip2recover' program to attempt to recover\n"
+           "data from undamaged sections of corrupted files.\n\n"
+         );
+         setExit(2);
+         exit(exitValue);
+      }
+   }
+
+   /* Free the argument list memory to mollify leak detectors 
+      (eg) Purify, Checker.  Serves no other useful purpose.
+   */
+   aa = argList;
+   while (aa != NULL) {
+      Cell* aa2 = aa->link;
+      if (aa->name != NULL) free(aa->name);
+      free(aa);
+      aa = aa2;
+   }
+
+   return exitValue;
+}
+
+
+/*-----------------------------------------------------------*/
+/*--- end                                         bzip2.c ---*/
+/*-----------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/bzip2.txt b/updater/bzip2-1.0.3/bzip2.txt
new file mode 100644
index 0000000..bf895b6
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzip2.txt
@@ -0,0 +1,391 @@
+
+NAME
+       bzip2, bunzip2 - a block-sorting file compressor, v1.0.3
+       bzcat - decompresses files to stdout
+       bzip2recover - recovers data from damaged bzip2 files
+
+
+SYNOPSIS
+       bzip2 [ -cdfkqstvzVL123456789 ] [ filenames ...  ]
+       bunzip2 [ -fkvsVL ] [ filenames ...  ]
+       bzcat [ -s ] [ filenames ...  ]
+       bzip2recover filename
+
+
+DESCRIPTION
+       bzip2  compresses  files  using  the Burrows-Wheeler block
+       sorting text compression algorithm,  and  Huffman  coding.
+       Compression  is  generally  considerably  better than that
+       achieved by more conventional LZ77/LZ78-based compressors,
+       and  approaches  the performance of the PPM family of sta-
+       tistical compressors.
+
+       The command-line options are deliberately very similar  to
+       those of GNU gzip, but they are not identical.
+
+       bzip2  expects  a list of file names to accompany the com-
+       mand-line flags.  Each file is replaced  by  a  compressed
+       version  of  itself,  with  the  name "original_name.bz2".
+       Each compressed file has the same modification date,  per-
+       missions, and, when possible, ownership as the correspond-
+       ing original, so that these properties  can  be  correctly
+       restored  at  decompression  time.   File name handling is
+       naive in the sense that there is no mechanism for preserv-
+       ing  original file names, permissions, ownerships or dates
+       in filesystems which lack these concepts, or have  serious
+       file name length restrictions, such as MS-DOS.
+
+       bzip2  and  bunzip2 will by default not overwrite existing
+       files.  If you want this to happen, specify the -f flag.
+
+       If no file names  are  specified,  bzip2  compresses  from
+       standard  input  to  standard output.  In this case, bzip2
+       will decline to write compressed output to a terminal,  as
+       this  would  be  entirely  incomprehensible  and therefore
+       pointless.
+
+       bunzip2 (or bzip2 -d) decompresses  all  specified  files.
+       Files which were not created by bzip2 will be detected and
+       ignored, and a warning issued.  bzip2  attempts  to  guess
+       the  filename  for  the decompressed file from that of the
+       compressed file as follows:
+
+              filename.bz2    becomes   filename
+              filename.bz     becomes   filename
+              filename.tbz2   becomes   filename.tar
+              filename.tbz    becomes   filename.tar
+              anyothername    becomes   anyothername.out
+
+       If the file does not end in one of the recognised endings,
+       .bz2,  .bz,  .tbz2 or .tbz, bzip2 complains that it cannot
+       guess the name of the original file, and uses the original
+       name with .out appended.
+
+       As  with compression, supplying no filenames causes decom-
+       pression from standard input to standard output.
+
+       bunzip2 will correctly decompress a file which is the con-
+       catenation of two or more compressed files.  The result is
+       the concatenation of the corresponding uncompressed files.
+       Integrity testing (-t) of concatenated compressed files is
+       also supported.
+
+       You can also compress or decompress files to the  standard
+       output  by giving the -c flag.  Multiple files may be com-
+       pressed and decompressed like this.  The resulting outputs
+       are  fed  sequentially to stdout.  Compression of multiple
+       files in this manner generates a stream containing  multi-
+       ple compressed file representations.  Such a stream can be
+       decompressed correctly only  by  bzip2  version  0.9.0  or
+       later.   Earlier  versions of bzip2 will stop after decom-
+       pressing the first file in the stream.
+
+       bzcat (or bzip2 -dc) decompresses all specified  files  to
+       the standard output.
+
+       bzip2  will  read arguments from the environment variables
+       BZIP2 and BZIP, in  that  order,  and  will  process  them
+       before  any  arguments  read  from the command line.  This
+       gives a convenient way to supply default arguments.
+
+       Compression is always performed, even  if  the  compressed
+       file  is slightly larger than the original.  Files of less
+       than about one hundred bytes tend to get larger, since the
+       compression  mechanism  has  a  constant  overhead  in the
+       region of 50 bytes.  Random data (including the output  of
+       most  file  compressors)  is  coded at about 8.05 bits per
+       byte, giving an expansion of around 0.5%.
+
+       As a self-check for your  protection,  bzip2  uses  32-bit
+       CRCs  to make sure that the decompressed version of a file
+       is identical to the original.  This guards against corrup-
+       tion  of  the compressed data, and against undetected bugs
+       in bzip2 (hopefully very unlikely).  The chances  of  data
+       corruption  going  undetected  is  microscopic,  about one
+       chance in four billion for each file processed.  Be aware,
+       though,  that  the  check occurs upon decompression, so it
+       can only tell you that something is wrong.  It can't  help
+       you  recover  the original uncompressed data.  You can use
+       bzip2recover to try to recover data from damaged files.
+
+       Return values: 0 for a normal exit,  1  for  environmental
+       problems  (file not found, invalid flags, I/O errors, &c),
+       2 to indicate a corrupt compressed file, 3 for an internal
+       consistency error (eg, bug) which caused bzip2 to panic.
+
+
+OPTIONS
+       -c --stdout
+              Compress or decompress to standard output.
+
+       -d --decompress
+              Force  decompression.  bzip2, bunzip2 and bzcat are
+              really the same program,  and  the  decision  about
+              what  actions to take is done on the basis of which
+              name is used.  This flag overrides that  mechanism,
+              and forces bzip2 to decompress.
+
+       -z --compress
+              The   complement   to   -d:   forces   compression,
+              regardless of the invocation name.
+
+       -t --test
+              Check integrity of the specified file(s), but don't
+              decompress  them.   This  really  performs  a trial
+              decompression and throws away the result.
+
+       -f --force
+              Force overwrite of output files.   Normally,  bzip2
+              will  not  overwrite  existing  output files.  Also
+              forces bzip2 to break hard links to files, which it
+              otherwise wouldn't do.
+
+              bzip2  normally  declines to decompress files which
+              don't have the  correct  magic  header  bytes.   If
+              forced  (-f),  however,  it  will  pass  such files
+              through unmodified.  This is how GNU gzip  behaves.
+
+       -k --keep
+              Keep  (don't delete) input files during compression
+              or decompression.
+
+       -s --small
+              Reduce memory usage, for compression, decompression
+              and  testing.   Files  are  decompressed and tested
+              using a modified algorithm which only requires  2.5
+              bytes  per  block byte.  This means any file can be
+              decompressed in 2300k of memory,  albeit  at  about
+              half the normal speed.
+
+              During  compression,  -s  selects  a  block size of
+              200k, which limits memory use to  around  the  same
+              figure,  at  the expense of your compression ratio.
+              In short, if your  machine  is  low  on  memory  (8
+              megabytes  or  less),  use  -s for everything.  See
+              MEMORY MANAGEMENT below.
+
+       -q --quiet
+              Suppress non-essential warning messages.   Messages
+              pertaining  to I/O errors and other critical events
+              will not be suppressed.
+
+       -v --verbose
+              Verbose mode -- show the compression ratio for each
+              file  processed.   Further  -v's  increase the ver-
+              bosity level, spewing out lots of information which
+              is primarily of interest for diagnostic purposes.
+
+       -L --license -V --version
+              Display  the  software  version,  license terms and
+              conditions.
+
+       -1 (or --fast) to -9 (or --best)
+              Set the block size to 100 k, 200 k ..  900  k  when
+              compressing.   Has  no  effect  when decompressing.
+              See MEMORY MANAGEMENT below.  The --fast and --best
+              aliases  are  primarily for GNU gzip compatibility.
+              In particular, --fast doesn't make things  signifi-
+              cantly  faster.   And  --best  merely  selects  the
+              default behaviour.
+
+       --     Treats all subsequent arguments as file names, even
+              if they start with a dash.  This is so you can han-
+              dle files with names beginning  with  a  dash,  for
+              example: bzip2 -- -myfilename.
+
+       --repetitive-fast --repetitive-best
+              These  flags  are  redundant  in versions 0.9.5 and
+              above.  They provided some coarse control over  the
+              behaviour  of the sorting algorithm in earlier ver-
+              sions, which was sometimes useful.  0.9.5 and above
+              have  an  improved  algorithm  which  renders these
+              flags irrelevant.
+
+
+MEMORY MANAGEMENT
+       bzip2 compresses large files in blocks.   The  block  size
+       affects  both  the  compression  ratio  achieved,  and the
+       amount of memory needed for compression and decompression.
+       The  flags  -1  through  -9  specify  the block size to be
+       100,000 bytes through 900,000 bytes (the default)  respec-
+       tively.   At  decompression  time, the block size used for
+       compression is read from  the  header  of  the  compressed
+       file, and bunzip2 then allocates itself just enough memory
+       to decompress the file.  Since block sizes are  stored  in
+       compressed  files,  it follows that the flags -1 to -9 are
+       irrelevant to and so ignored during decompression.
+
+       Compression and decompression requirements, in bytes,  can
+       be estimated as:
+
+              Compression:   400k + ( 8 x block size )
+
+              Decompression: 100k + ( 4 x block size ), or
+                             100k + ( 2.5 x block size )
+
+       Larger  block  sizes  give  rapidly  diminishing  marginal
+       returns.  Most of the compression comes from the first two
+       or  three hundred k of block size, a fact worth bearing in
+       mind when using bzip2  on  small  machines.   It  is  also
+       important  to  appreciate  that  the  decompression memory
+       requirement is set at compression time by  the  choice  of
+       block size.
+
+       For  files  compressed  with  the default 900k block size,
+       bunzip2 will require about 3700 kbytes to decompress.   To
+       support decompression of any file on a 4 megabyte machine,
+       bunzip2 has an option to  decompress  using  approximately
+       half this amount of memory, about 2300 kbytes.  Decompres-
+       sion speed is also halved, so you should use  this  option
+       only where necessary.  The relevant flag is -s.
+
+       In general, try and use the largest block size memory con-
+       straints  allow,  since  that  maximises  the  compression
+       achieved.   Compression and decompression speed are virtu-
+       ally unaffected by block size.
+
+       Another significant point applies to files which fit in  a
+       single  block  --  that  means  most files you'd encounter
+       using a large block  size.   The  amount  of  real  memory
+       touched is proportional to the size of the file, since the
+       file is smaller than a block.  For example, compressing  a
+       file  20,000  bytes  long  with the flag -9 will cause the
+       compressor to allocate around 7600k of  memory,  but  only
+       touch 400k + 20000 * 8 = 560 kbytes of it.  Similarly, the
+       decompressor will allocate 3700k but  only  touch  100k  +
+       20000 * 4 = 180 kbytes.
+
+       Here  is a table which summarises the maximum memory usage
+       for different block sizes.  Also  recorded  is  the  total
+       compressed  size for 14 files of the Calgary Text Compres-
+       sion Corpus totalling 3,141,622 bytes.  This column  gives
+       some  feel  for  how  compression  varies with block size.
+       These figures tend to understate the advantage  of  larger
+       block  sizes  for  larger files, since the Corpus is domi-
+       nated by smaller files.
+
+                  Compress   Decompress   Decompress   Corpus
+           Flag     usage      usage       -s usage     Size
+
+            -1      1200k       500k         350k      914704
+            -2      2000k       900k         600k      877703
+            -3      2800k      1300k         850k      860338
+            -4      3600k      1700k        1100k      846899
+            -5      4400k      2100k        1350k      845160
+            -6      5200k      2500k        1600k      838626
+            -7      6100k      2900k        1850k      834096
+            -8      6800k      3300k        2100k      828642
+            -9      7600k      3700k        2350k      828642
+
+
+RECOVERING DATA FROM DAMAGED FILES
+       bzip2 compresses files in blocks, usually 900kbytes  long.
+       Each block is handled independently.  If a media or trans-
+       mission error causes a multi-block  .bz2  file  to  become
+       damaged,  it  may  be  possible  to  recover data from the
+       undamaged blocks in the file.
+
+       The compressed representation of each block  is  delimited
+       by  a  48-bit pattern, which makes it possible to find the
+       block boundaries with reasonable  certainty.   Each  block
+       also  carries its own 32-bit CRC, so damaged blocks can be
+       distinguished from undamaged ones.
+
+       bzip2recover is a  simple  program  whose  purpose  is  to
+       search  for blocks in .bz2 files, and write each block out
+       into its own .bz2 file.  You can then use bzip2 -t to test
+       the integrity of the resulting files, and decompress those
+       which are undamaged.
+
+       bzip2recover takes a single argument, the name of the dam-
+       aged    file,    and    writes    a    number   of   files
+       "rec00001file.bz2",  "rec00002file.bz2",  etc,  containing
+       the   extracted   blocks.   The   output   filenames   are
+       designed  so  that the use of wildcards in subsequent pro-
+       cessing  -- for example, "bzip2 -dc  rec*file.bz2 > recov-
+       ered_data" -- processes the files in the correct order.
+
+       bzip2recover should be of most use dealing with large .bz2
+       files,  as  these will contain many blocks.  It is clearly
+       futile to use it on damaged single-block  files,  since  a
+       damaged  block  cannot  be recovered.  If you wish to min-
+       imise any potential data loss through media  or  transmis-
+       sion errors, you might consider compressing with a smaller
+       block size.
+
+
+PERFORMANCE NOTES
+       The sorting phase of compression gathers together  similar
+       strings  in  the  file.  Because of this, files containing
+       very long runs of  repeated  symbols,  like  "aabaabaabaab
+       ..."   (repeated  several hundred times) may compress more
+       slowly than normal.  Versions 0.9.5 and  above  fare  much
+       better  than previous versions in this respect.  The ratio
+       between worst-case and average-case compression time is in
+       the  region  of  10:1.  For previous versions, this figure
+       was more like 100:1.  You can use the -vvvv option to mon-
+       itor progress in great detail, if you want.
+
+       Decompression speed is unaffected by these phenomena.
+
+       bzip2  usually  allocates  several  megabytes of memory to
+       operate in, and then charges all over it in a fairly  ran-
+       dom  fashion.   This means that performance, both for com-
+       pressing and decompressing, is largely determined  by  the
+       speed  at  which  your  machine  can service cache misses.
+       Because of this, small changes to the code to  reduce  the
+       miss  rate  have  been observed to give disproportionately
+       large performance improvements.  I imagine bzip2 will per-
+       form best on machines with very large caches.
+
+
+CAVEATS
+       I/O  error  messages  are not as helpful as they could be.
+       bzip2 tries hard to detect I/O errors  and  exit  cleanly,
+       but  the  details  of  what  the problem is sometimes seem
+       rather misleading.
+
+       This manual page pertains to version 1.0.3 of bzip2.  Com-
+       pressed  data created by this version is entirely forwards
+       and  backwards  compatible  with   the   previous   public
+       releases,  versions 0.1pl2, 0.9.0, 0.9.5, 1.0.0, 1.0.1 and
+       1.0.2, but with the following exception: 0.9.0  and  above
+       can  correctly decompress multiple concatenated compressed
+       files.  0.1pl2 cannot do this; it will stop  after  decom-
+       pressing just the first file in the stream.
+
+       bzip2recover  versions prior to 1.0.2 used 32-bit integers
+       to represent bit positions in compressed  files,  so  they
+       could  not handle compressed files more than 512 megabytes
+       long.  Versions 1.0.2 and above use 64-bit  ints  on  some
+       platforms  which  support them (GNU supported targets, and
+       Windows).  To establish whether or  not  bzip2recover  was
+       built  with  such  a limitation, run it without arguments.
+       In any event you can build yourself an  unlimited  version
+       if  you  can  recompile  it  with MaybeUInt64 set to be an
+       unsigned 64-bit integer.
+
+
+AUTHOR
+       Julian Seward, jsewardbzip.org.
+
+       http://www.bzip.org
+
+       The ideas embodied in bzip2 are due to (at least) the fol-
+       lowing  people: Michael Burrows and David Wheeler (for the
+       block sorting transformation), David Wheeler  (again,  for
+       the Huffman coder), Peter Fenwick (for the structured cod-
+       ing model in the original bzip, and many refinements), and
+       Alistair  Moffat,  Radford  Neal  and  Ian Witten (for the
+       arithmetic  coder  in  the  original  bzip).   I  am  much
+       indebted for their help, support and advice.  See the man-
+       ual in the source distribution for pointers to sources  of
+       documentation.  Christian von Roques encouraged me to look
+       for faster sorting algorithms, so as to speed up  compres-
+       sion.  Bela Lubkin encouraged me to improve the worst-case
+       compression performance.  Donna Robinson XMLised the docu-
+       mentation.   The bz* scripts are derived from those of GNU
+       gzip.  Many people sent patches, helped  with  portability
+       problems,  lent  machines,  gave advice and were generally
+       helpful.
+
diff --git a/updater/bzip2-1.0.3/bzip2recover.c b/updater/bzip2-1.0.3/bzip2recover.c
new file mode 100644
index 0000000..5cd405d
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzip2recover.c
@@ -0,0 +1,546 @@
+
+/*-----------------------------------------------------------*/
+/*--- Block recoverer program for bzip2                   ---*/
+/*---                                      bzip2recover.c ---*/
+/*-----------------------------------------------------------*/
+
+/*--
+  This program is bzip2recover, a program to attempt data 
+  salvage from damaged files created by the accompanying
+  bzip2-1.0.3 program.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0.3 of 15 February 2005
+--*/
+
+/*--
+  This program is a complete hack and should be rewritten
+  properly.  It isn't very complicated.
+--*/
+
+#include <stdio.h>
+#include <errno.h>
+#include <stdlib.h>
+#include <string.h>
+
+
+/* This program records bit locations in the file to be recovered.
+   That means that if 64-bit ints are not supported, we will not
+   be able to recover .bz2 files over 512MB (2^32 bits) long.
+   On GNU supported platforms, we take advantage of the 64-bit
+   int support to circumvent this problem.  Ditto MSVC.
+
+   This change occurred in version 1.0.2; all prior versions have
+   the 512MB limitation.
+*/
+#ifdef __GNUC__
+   typedef  unsigned long long int  MaybeUInt64;
+#  define MaybeUInt64_FMT "%Lu"
+#else
+#ifdef _MSC_VER
+   typedef  unsigned __int64  MaybeUInt64;
+#  define MaybeUInt64_FMT "%I64u"
+#else
+   typedef  unsigned int   MaybeUInt64;
+#  define MaybeUInt64_FMT "%u"
+#endif
+#endif
+
+typedef  unsigned int   UInt32;
+typedef  int            Int32;
+typedef  unsigned char  UChar;
+typedef  char           Char;
+typedef  unsigned char  Bool;
+#define True    ((Bool)1)
+#define False   ((Bool)0)
+
+
+#define BZ_MAX_FILENAME 2000
+
+Char inFileName[BZ_MAX_FILENAME];
+Char outFileName[BZ_MAX_FILENAME];
+Char progName[BZ_MAX_FILENAME];
+
+MaybeUInt64 bytesOut = 0;
+MaybeUInt64 bytesIn  = 0;
+
+
+/*---------------------------------------------------*/
+/*--- Header bytes                                ---*/
+/*---------------------------------------------------*/
+
+#define BZ_HDR_B 0x42                         /* 'B' */
+#define BZ_HDR_Z 0x5a                         /* 'Z' */
+#define BZ_HDR_h 0x68                         /* 'h' */
+#define BZ_HDR_0 0x30                         /* '0' */
+ 
+
+/*---------------------------------------------------*/
+/*--- I/O errors                                  ---*/
+/*---------------------------------------------------*/
+
+/*---------------------------------------------*/
+void readError ( void )
+{
+   fprintf ( stderr,
+             "%s: I/O error reading `%s', possible reason follows.\n",
+            progName, inFileName );
+   perror ( progName );
+   fprintf ( stderr, "%s: warning: output file(s) may be incomplete.\n",
+             progName );
+   exit ( 1 );
+}
+
+
+/*---------------------------------------------*/
+void writeError ( void )
+{
+   fprintf ( stderr,
+             "%s: I/O error reading `%s', possible reason follows.\n",
+            progName, inFileName );
+   perror ( progName );
+   fprintf ( stderr, "%s: warning: output file(s) may be incomplete.\n",
+             progName );
+   exit ( 1 );
+}
+
+
+/*---------------------------------------------*/
+void mallocFail ( Int32 n )
+{
+   fprintf ( stderr,
+             "%s: malloc failed on request for %d bytes.\n",
+            progName, n );
+   fprintf ( stderr, "%s: warning: output file(s) may be incomplete.\n",
+             progName );
+   exit ( 1 );
+}
+
+
+/*---------------------------------------------*/
+void tooManyBlocks ( Int32 max_handled_blocks )
+{
+   fprintf ( stderr,
+             "%s: `%s' appears to contain more than %d blocks\n",
+            progName, inFileName, max_handled_blocks );
+   fprintf ( stderr,
+             "%s: and cannot be handled.  To fix, increase\n",
+             progName );
+   fprintf ( stderr, 
+             "%s: BZ_MAX_HANDLED_BLOCKS in bzip2recover.c, and recompile.\n",
+             progName );
+   exit ( 1 );
+}
+
+
+
+/*---------------------------------------------------*/
+/*--- Bit stream I/O                              ---*/
+/*---------------------------------------------------*/
+
+typedef
+   struct {
+      FILE*  handle;
+      Int32  buffer;
+      Int32  buffLive;
+      Char   mode;
+   }
+   BitStream;
+
+
+/*---------------------------------------------*/
+BitStream* bsOpenReadStream ( FILE* stream )
+{
+   BitStream *bs = malloc ( sizeof(BitStream) );
+   if (bs == NULL) mallocFail ( sizeof(BitStream) );
+   bs->handle = stream;
+   bs->buffer = 0;
+   bs->buffLive = 0;
+   bs->mode = 'r';
+   return bs;
+}
+
+
+/*---------------------------------------------*/
+BitStream* bsOpenWriteStream ( FILE* stream )
+{
+   BitStream *bs = malloc ( sizeof(BitStream) );
+   if (bs == NULL) mallocFail ( sizeof(BitStream) );
+   bs->handle = stream;
+   bs->buffer = 0;
+   bs->buffLive = 0;
+   bs->mode = 'w';
+   return bs;
+}
+
+
+/*---------------------------------------------*/
+void bsPutBit ( BitStream* bs, Int32 bit )
+{
+   if (bs->buffLive == 8) {
+      Int32 retVal = putc ( (UChar) bs->buffer, bs->handle );
+      if (retVal == EOF) writeError();
+      bytesOut++;
+      bs->buffLive = 1;
+      bs->buffer = bit & 0x1;
+   } else {
+      bs->buffer = ( (bs->buffer << 1) | (bit & 0x1) );
+      bs->buffLive++;
+   };
+}
+
+
+/*---------------------------------------------*/
+/*--
+   Returns 0 or 1, or 2 to indicate EOF.
+--*/
+Int32 bsGetBit ( BitStream* bs )
+{
+   if (bs->buffLive > 0) {
+      bs->buffLive --;
+      return ( ((bs->buffer) >> (bs->buffLive)) & 0x1 );
+   } else {
+      Int32 retVal = getc ( bs->handle );
+      if ( retVal == EOF ) {
+         if (errno != 0) readError();
+         return 2;
+      }
+      bs->buffLive = 7;
+      bs->buffer = retVal;
+      return ( ((bs->buffer) >> 7) & 0x1 );
+   }
+}
+
+
+/*---------------------------------------------*/
+void bsClose ( BitStream* bs )
+{
+   Int32 retVal;
+
+   if ( bs->mode == 'w' ) {
+      while ( bs->buffLive < 8 ) {
+         bs->buffLive++;
+         bs->buffer <<= 1;
+      };
+      retVal = putc ( (UChar) (bs->buffer), bs->handle );
+      if (retVal == EOF) writeError();
+      bytesOut++;
+      retVal = fflush ( bs->handle );
+      if (retVal == EOF) writeError();
+   }
+   retVal = fclose ( bs->handle );
+   if (retVal == EOF) {
+      if (bs->mode == 'w') writeError(); else readError();
+   }
+   free ( bs );
+}
+
+
+/*---------------------------------------------*/
+void bsPutUChar ( BitStream* bs, UChar c )
+{
+   Int32 i;
+   for (i = 7; i >= 0; i--)
+      bsPutBit ( bs, (((UInt32) c) >> i) & 0x1 );
+}
+
+
+/*---------------------------------------------*/
+void bsPutUInt32 ( BitStream* bs, UInt32 c )
+{
+   Int32 i;
+
+   for (i = 31; i >= 0; i--)
+      bsPutBit ( bs, (c >> i) & 0x1 );
+}
+
+
+/*---------------------------------------------*/
+Bool endsInBz2 ( Char* name )
+{
+   Int32 n = strlen ( name );
+   if (n <= 4) return False;
+   return
+      (name[n-4] == '.' &&
+       name[n-3] == 'b' &&
+       name[n-2] == 'z' &&
+       name[n-1] == '2');
+}
+
+
+/*---------------------------------------------------*/
+/*---                                             ---*/
+/*---------------------------------------------------*/
+
+/* This logic isn't really right when it comes to Cygwin. */
+#ifdef _WIN32
+#  define  BZ_SPLIT_SYM  '\\'  /* path splitter on Windows platform */
+#else
+#  define  BZ_SPLIT_SYM  '/'   /* path splitter on Unix platform */
+#endif
+
+#define BLOCK_HEADER_HI  0x00003141UL
+#define BLOCK_HEADER_LO  0x59265359UL
+
+#define BLOCK_ENDMARK_HI 0x00001772UL
+#define BLOCK_ENDMARK_LO 0x45385090UL
+
+/* Increase if necessary.  However, a .bz2 file with > 50000 blocks
+   would have an uncompressed size of at least 40GB, so the chances
+   are low you'll need to up this.
+*/
+#define BZ_MAX_HANDLED_BLOCKS 50000
+
+MaybeUInt64 bStart [BZ_MAX_HANDLED_BLOCKS];
+MaybeUInt64 bEnd   [BZ_MAX_HANDLED_BLOCKS];
+MaybeUInt64 rbStart[BZ_MAX_HANDLED_BLOCKS];
+MaybeUInt64 rbEnd  [BZ_MAX_HANDLED_BLOCKS];
+
+Int32 main ( Int32 argc, Char** argv )
+{
+   FILE*       inFile;
+   FILE*       outFile;
+   BitStream*  bsIn, *bsWr;
+   Int32       b, wrBlock, currBlock, rbCtr;
+   MaybeUInt64 bitsRead;
+
+   UInt32      buffHi, buffLo, blockCRC;
+   Char*       p;
+
+   strcpy ( progName, argv[0] );
+   inFileName[0] = outFileName[0] = 0;
+
+   fprintf ( stderr, 
+             "bzip2recover 1.0.3: extracts blocks from damaged .bz2 files.\n" );
+
+   if (argc != 2) {
+      fprintf ( stderr, "%s: usage is `%s damaged_file_name'.\n",
+                        progName, progName );
+      switch (sizeof(MaybeUInt64)) {
+         case 8:
+            fprintf(stderr, 
+                    "\trestrictions on size of recovered file: None\n");
+            break;
+         case 4:
+            fprintf(stderr, 
+                    "\trestrictions on size of recovered file: 512 MB\n");
+            fprintf(stderr, 
+                    "\tto circumvent, recompile with MaybeUInt64 as an\n"
+                    "\tunsigned 64-bit int.\n");
+            break;
+         default:
+            fprintf(stderr, 
+                    "\tsizeof(MaybeUInt64) is not 4 or 8 -- "
+                    "configuration error.\n");
+            break;
+      }
+      exit(1);
+   }
+
+   if (strlen(argv[1]) >= BZ_MAX_FILENAME-20) {
+      fprintf ( stderr, 
+                "%s: supplied filename is suspiciously (>= %d chars) long.  Bye!\n",
+                progName, (int)strlen(argv[1]) );
+      exit(1);
+   }
+
+   strcpy ( inFileName, argv[1] );
+
+   inFile = fopen ( inFileName, "rb" );
+   if (inFile == NULL) {
+      fprintf ( stderr, "%s: can't read `%s'\n", progName, inFileName );
+      exit(1);
+   }
+
+   bsIn = bsOpenReadStream ( inFile );
+   fprintf ( stderr, "%s: searching for block boundaries ...\n", progName );
+
+   bitsRead = 0;
+   buffHi = buffLo = 0;
+   currBlock = 0;
+   bStart[currBlock] = 0;
+
+   rbCtr = 0;
+
+   while (True) {
+      b = bsGetBit ( bsIn );
+      bitsRead++;
+      if (b == 2) {
+         if (bitsRead >= bStart[currBlock] &&
+            (bitsRead - bStart[currBlock]) >= 40) {
+            bEnd[currBlock] = bitsRead-1;
+            if (currBlock > 0)
+               fprintf ( stderr, "   block %d runs from " MaybeUInt64_FMT 
+                                 " to " MaybeUInt64_FMT " (incomplete)\n",
+                         currBlock,  bStart[currBlock], bEnd[currBlock] );
+         } else
+            currBlock--;
+         break;
+      }
+      buffHi = (buffHi << 1) | (buffLo >> 31);
+      buffLo = (buffLo << 1) | (b & 1);
+      if ( ( (buffHi & 0x0000ffff) == BLOCK_HEADER_HI 
+             && buffLo == BLOCK_HEADER_LO)
+           || 
+           ( (buffHi & 0x0000ffff) == BLOCK_ENDMARK_HI 
+             && buffLo == BLOCK_ENDMARK_LO)
+         ) {
+         if (bitsRead > 49) {
+            bEnd[currBlock] = bitsRead-49;
+         } else {
+            bEnd[currBlock] = 0;
+         }
+         if (currBlock > 0 &&
+	     (bEnd[currBlock] - bStart[currBlock]) >= 130) {
+            fprintf ( stderr, "   block %d runs from " MaybeUInt64_FMT 
+                              " to " MaybeUInt64_FMT "\n",
+                      rbCtr+1,  bStart[currBlock], bEnd[currBlock] );
+            rbStart[rbCtr] = bStart[currBlock];
+            rbEnd[rbCtr] = bEnd[currBlock];
+            rbCtr++;
+         }
+         if (currBlock >= BZ_MAX_HANDLED_BLOCKS)
+            tooManyBlocks(BZ_MAX_HANDLED_BLOCKS);
+         currBlock++;
+
+         bStart[currBlock] = bitsRead;
+      }
+   }
+
+   bsClose ( bsIn );
+
+   /*-- identified blocks run from 1 to rbCtr inclusive. --*/
+
+   if (rbCtr < 1) {
+      fprintf ( stderr,
+                "%s: sorry, I couldn't find any block boundaries.\n",
+                progName );
+      exit(1);
+   };
+
+   fprintf ( stderr, "%s: splitting into blocks\n", progName );
+
+   inFile = fopen ( inFileName, "rb" );
+   if (inFile == NULL) {
+      fprintf ( stderr, "%s: can't open `%s'\n", progName, inFileName );
+      exit(1);
+   }
+   bsIn = bsOpenReadStream ( inFile );
+
+   /*-- placate gcc's dataflow analyser --*/
+   blockCRC = 0; bsWr = 0;
+
+   bitsRead = 0;
+   outFile = NULL;
+   wrBlock = 0;
+   while (True) {
+      b = bsGetBit(bsIn);
+      if (b == 2) break;
+      buffHi = (buffHi << 1) | (buffLo >> 31);
+      buffLo = (buffLo << 1) | (b & 1);
+      if (bitsRead == 47+rbStart[wrBlock]) 
+         blockCRC = (buffHi << 16) | (buffLo >> 16);
+
+      if (outFile != NULL && bitsRead >= rbStart[wrBlock]
+                          && bitsRead <= rbEnd[wrBlock]) {
+         bsPutBit ( bsWr, b );
+      }
+
+      bitsRead++;
+
+      if (bitsRead == rbEnd[wrBlock]+1) {
+         if (outFile != NULL) {
+            bsPutUChar ( bsWr, 0x17 ); bsPutUChar ( bsWr, 0x72 );
+            bsPutUChar ( bsWr, 0x45 ); bsPutUChar ( bsWr, 0x38 );
+            bsPutUChar ( bsWr, 0x50 ); bsPutUChar ( bsWr, 0x90 );
+            bsPutUInt32 ( bsWr, blockCRC );
+            bsClose ( bsWr );
+         }
+         if (wrBlock >= rbCtr) break;
+         wrBlock++;
+      } else
+      if (bitsRead == rbStart[wrBlock]) {
+         /* Create the output file name, correctly handling leading paths. 
+            (31.10.2001 by Sergey E. Kusikov) */
+         Char* split;
+         Int32 ofs, k;
+         for (k = 0; k < BZ_MAX_FILENAME; k++) 
+            outFileName[k] = 0;
+         strcpy (outFileName, inFileName);
+         split = strrchr (outFileName, BZ_SPLIT_SYM);
+         if (split == NULL) {
+            split = outFileName;
+         } else {
+            ++split;
+	 }
+	 /* Now split points to the start of the basename. */
+         ofs  = split - outFileName;
+         sprintf (split, "rec%5d", wrBlock+1);
+         for (p = split; *p != 0; p++) if (*p == ' ') *p = '0';
+         strcat (outFileName, inFileName + ofs);
+
+         if ( !endsInBz2(outFileName)) strcat ( outFileName, ".bz2" );
+
+         fprintf ( stderr, "   writing block %d to `%s' ...\n",
+                           wrBlock+1, outFileName );
+
+         outFile = fopen ( outFileName, "wb" );
+         if (outFile == NULL) {
+            fprintf ( stderr, "%s: can't write `%s'\n",
+                      progName, outFileName );
+            exit(1);
+         }
+         bsWr = bsOpenWriteStream ( outFile );
+         bsPutUChar ( bsWr, BZ_HDR_B );    
+         bsPutUChar ( bsWr, BZ_HDR_Z );    
+         bsPutUChar ( bsWr, BZ_HDR_h );    
+         bsPutUChar ( bsWr, BZ_HDR_0 + 9 );
+         bsPutUChar ( bsWr, 0x31 ); bsPutUChar ( bsWr, 0x41 );
+         bsPutUChar ( bsWr, 0x59 ); bsPutUChar ( bsWr, 0x26 );
+         bsPutUChar ( bsWr, 0x53 ); bsPutUChar ( bsWr, 0x59 );
+      }
+   }
+
+   fprintf ( stderr, "%s: finished\n", progName );
+   return 0;
+}
+
+
+
+/*-----------------------------------------------------------*/
+/*--- end                                  bzip2recover.c ---*/
+/*-----------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/bzlib.c b/updater/bzip2-1.0.3/bzlib.c
new file mode 100644
index 0000000..1f6e9e4
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzlib.c
@@ -0,0 +1,1616 @@
+
+/*-------------------------------------------------------------*/
+/*--- Library top-level functions.                          ---*/
+/*---                                               bzlib.c ---*/
+/*-------------------------------------------------------------*/
+
+/*--
+  This file is a part of bzip2 and/or libbzip2, a program and
+  library for lossless, block-sorting data compression.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0 of 21 March 2000
+
+  This program is based on (at least) the work of:
+     Mike Burrows
+     David Wheeler
+     Peter Fenwick
+     Alistair Moffat
+     Radford Neal
+     Ian H. Witten
+     Robert Sedgewick
+     Jon L. Bentley
+
+  For more information on these sources, see the manual.
+--*/
+
+/*--
+   CHANGES
+   ~~~~~~~
+   0.9.0 -- original version.
+
+   0.9.0a/b -- no changes in this file.
+
+   0.9.0c
+      * made zero-length BZ_FLUSH work correctly in bzCompress().
+      * fixed bzWrite/bzRead to ignore zero-length requests.
+      * fixed bzread to correctly handle read requests after EOF.
+      * wrong parameter order in call to bzDecompressInit in
+        bzBuffToBuffDecompress.  Fixed.
+--*/
+
+#include "bzlib_private.h"
+
+
+/*---------------------------------------------------*/
+/*--- Compression stuff                           ---*/
+/*---------------------------------------------------*/
+
+
+/*---------------------------------------------------*/
+#ifndef BZ_NO_STDIO
+void BZ2_bz__AssertH__fail ( int errcode )
+{
+   fprintf(stderr, 
+      "\n\nbzip2/libbzip2: internal error number %d.\n"
+      "This is a bug in bzip2/libbzip2, %s.\n"
+      "Please report it to me at: jseward@bzip.org.  If this happened\n"
+      "when you were using some program which uses libbzip2 as a\n"
+      "component, you should also report this bug to the author(s)\n"
+      "of that program.  Please make an effort to report this bug;\n"
+      "timely and accurate bug reports eventually lead to higher\n"
+      "quality software.  Thanks.  Julian Seward, 15 February 2005.\n\n",
+      errcode,
+      BZ2_bzlibVersion()
+   );
+
+   if (errcode == 1007) {
+   fprintf(stderr,
+      "\n*** A special note about internal error number 1007 ***\n"
+      "\n"
+      "Experience suggests that a common cause of i.e. 1007\n"
+      "is unreliable memory or other hardware.  The 1007 assertion\n"
+      "just happens to cross-check the results of huge numbers of\n"
+      "memory reads/writes, and so acts (unintendedly) as a stress\n"
+      "test of your memory system.\n"
+      "\n"
+      "I suggest the following: try compressing the file again,\n"
+      "possibly monitoring progress in detail with the -vv flag.\n"
+      "\n"
+      "* If the error cannot be reproduced, and/or happens at different\n"
+      "  points in compression, you may have a flaky memory system.\n"
+      "  Try a memory-test program.  I have used Memtest86\n"
+      "  (www.memtest86.com).  At the time of writing it is free (GPLd).\n"
+      "  Memtest86 tests memory much more thorougly than your BIOSs\n"
+      "  power-on test, and may find failures that the BIOS doesn't.\n"
+      "\n"
+      "* If the error can be repeatably reproduced, this is a bug in\n"
+      "  bzip2, and I would very much like to hear about it.  Please\n"
+      "  let me know, and, ideally, save a copy of the file causing the\n"
+      "  problem -- without which I will be unable to investigate it.\n"
+      "\n"
+   );
+   }
+
+   exit(3);
+}
+#endif
+
+
+/*---------------------------------------------------*/
+static
+int bz_config_ok ( void )
+{
+   if (sizeof(int)   != 4) return 0;
+   if (sizeof(short) != 2) return 0;
+   if (sizeof(char)  != 1) return 0;
+   return 1;
+}
+
+
+/*---------------------------------------------------*/
+static
+void* default_bzalloc ( void* opaque, Int32 items, Int32 size )
+{
+   void* v = malloc ( items * size );
+   return v;
+}
+
+static
+void default_bzfree ( void* opaque, void* addr )
+{
+   if (addr != NULL) free ( addr );
+}
+
+
+/*---------------------------------------------------*/
+static
+void prepare_new_block ( EState* s )
+{
+   Int32 i;
+   s->nblock = 0;
+   s->numZ = 0;
+   s->state_out_pos = 0;
+   BZ_INITIALISE_CRC ( s->blockCRC );
+   for (i = 0; i < 256; i++) s->inUse[i] = False;
+   s->blockNo++;
+}
+
+
+/*---------------------------------------------------*/
+static
+void init_RL ( EState* s )
+{
+   s->state_in_ch  = 256;
+   s->state_in_len = 0;
+}
+
+
+static
+Bool isempty_RL ( EState* s )
+{
+   if (s->state_in_ch < 256 && s->state_in_len > 0)
+      return False; else
+      return True;
+}
+
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzCompressInit) 
+                    ( bz_stream* strm, 
+                     int        blockSize100k,
+                     int        verbosity,
+                     int        workFactor )
+{
+   Int32   n;
+   EState* s;
+
+   if (!bz_config_ok()) return BZ_CONFIG_ERROR;
+
+   if (strm == NULL || 
+       blockSize100k < 1 || blockSize100k > 9 ||
+       workFactor < 0 || workFactor > 250)
+     return BZ_PARAM_ERROR;
+
+   if (workFactor == 0) workFactor = 30;
+   if (strm->bzalloc == NULL) strm->bzalloc = default_bzalloc;
+   if (strm->bzfree == NULL) strm->bzfree = default_bzfree;
+
+   s = (EState *)BZALLOC( sizeof(EState) );
+   if (s == NULL) return BZ_MEM_ERROR;
+   s->strm = strm;
+
+   s->arr1 = NULL;
+   s->arr2 = NULL;
+   s->ftab = NULL;
+
+   n       = 100000 * blockSize100k;
+   s->arr1 = (UInt32 *)BZALLOC( n                  * sizeof(UInt32) );
+   s->arr2 = (UInt32 *)BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) );
+   s->ftab = (UInt32 *)BZALLOC( 65537              * sizeof(UInt32) );
+
+   if (s->arr1 == NULL || s->arr2 == NULL || s->ftab == NULL) {
+      if (s->arr1 != NULL) BZFREE(s->arr1);
+      if (s->arr2 != NULL) BZFREE(s->arr2);
+      if (s->ftab != NULL) BZFREE(s->ftab);
+      if (s       != NULL) BZFREE(s);
+      return BZ_MEM_ERROR;
+   }
+
+   s->blockNo           = 0;
+   s->state             = BZ_S_INPUT;
+   s->mode              = BZ_M_RUNNING;
+   s->combinedCRC       = 0;
+   s->blockSize100k     = blockSize100k;
+   s->nblockMAX         = 100000 * blockSize100k - 19;
+   s->verbosity         = verbosity;
+   s->workFactor        = workFactor;
+
+   s->block             = (UChar*)s->arr2;
+   s->mtfv              = (UInt16*)s->arr1;
+   s->zbits             = NULL;
+   s->ptr               = (UInt32*)s->arr1;
+
+   strm->state          = s;
+   strm->total_in_lo32  = 0;
+   strm->total_in_hi32  = 0;
+   strm->total_out_lo32 = 0;
+   strm->total_out_hi32 = 0;
+   init_RL ( s );
+   prepare_new_block ( s );
+   return BZ_OK;
+}
+
+
+/*---------------------------------------------------*/
+static
+void add_pair_to_block ( EState* s )
+{
+   Int32 i;
+   UChar ch = (UChar)(s->state_in_ch);
+   for (i = 0; i < s->state_in_len; i++) {
+      BZ_UPDATE_CRC( s->blockCRC, ch );
+   }
+   s->inUse[s->state_in_ch] = True;
+   switch (s->state_in_len) {
+      case 1:
+         s->block[s->nblock] = (UChar)ch; s->nblock++;
+         break;
+      case 2:
+         s->block[s->nblock] = (UChar)ch; s->nblock++;
+         s->block[s->nblock] = (UChar)ch; s->nblock++;
+         break;
+      case 3:
+         s->block[s->nblock] = (UChar)ch; s->nblock++;
+         s->block[s->nblock] = (UChar)ch; s->nblock++;
+         s->block[s->nblock] = (UChar)ch; s->nblock++;
+         break;
+      default:
+         s->inUse[s->state_in_len-4] = True;
+         s->block[s->nblock] = (UChar)ch; s->nblock++;
+         s->block[s->nblock] = (UChar)ch; s->nblock++;
+         s->block[s->nblock] = (UChar)ch; s->nblock++;
+         s->block[s->nblock] = (UChar)ch; s->nblock++;
+         s->block[s->nblock] = ((UChar)(s->state_in_len-4));
+         s->nblock++;
+         break;
+   }
+}
+
+
+/*---------------------------------------------------*/
+static
+void flush_RL ( EState* s )
+{
+   if (s->state_in_ch < 256) add_pair_to_block ( s );
+   init_RL ( s );
+}
+
+
+/*---------------------------------------------------*/
+#define ADD_CHAR_TO_BLOCK(zs,zchh0)               \
+{                                                 \
+   UInt32 zchh = (UInt32)(zchh0);                 \
+   /*-- fast track the common case --*/           \
+   if (zchh != zs->state_in_ch &&                 \
+       zs->state_in_len == 1) {                   \
+      UChar ch = (UChar)(zs->state_in_ch);        \
+      BZ_UPDATE_CRC( zs->blockCRC, ch );          \
+      zs->inUse[zs->state_in_ch] = True;          \
+      zs->block[zs->nblock] = (UChar)ch;          \
+      zs->nblock++;                               \
+      zs->state_in_ch = zchh;                     \
+   }                                              \
+   else                                           \
+   /*-- general, uncommon cases --*/              \
+   if (zchh != zs->state_in_ch ||                 \
+      zs->state_in_len == 255) {                  \
+      if (zs->state_in_ch < 256)                  \
+         add_pair_to_block ( zs );                \
+      zs->state_in_ch = zchh;                     \
+      zs->state_in_len = 1;                       \
+   } else {                                       \
+      zs->state_in_len++;                         \
+   }                                              \
+}
+
+
+/*---------------------------------------------------*/
+static
+Bool copy_input_until_stop ( EState* s )
+{
+   Bool progress_in = False;
+
+   if (s->mode == BZ_M_RUNNING) {
+
+      /*-- fast track the common case --*/
+      while (True) {
+         /*-- block full? --*/
+         if (s->nblock >= s->nblockMAX) break;
+         /*-- no input? --*/
+         if (s->strm->avail_in == 0) break;
+         progress_in = True;
+         ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 
+         s->strm->next_in++;
+         s->strm->avail_in--;
+         s->strm->total_in_lo32++;
+         if (s->strm->total_in_lo32 == 0) s->strm->total_in_hi32++;
+      }
+
+   } else {
+
+      /*-- general, uncommon case --*/
+      while (True) {
+         /*-- block full? --*/
+         if (s->nblock >= s->nblockMAX) break;
+         /*-- no input? --*/
+         if (s->strm->avail_in == 0) break;
+         /*-- flush/finish end? --*/
+         if (s->avail_in_expect == 0) break;
+         progress_in = True;
+         ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 
+         s->strm->next_in++;
+         s->strm->avail_in--;
+         s->strm->total_in_lo32++;
+         if (s->strm->total_in_lo32 == 0) s->strm->total_in_hi32++;
+         s->avail_in_expect--;
+      }
+   }
+   return progress_in;
+}
+
+
+/*---------------------------------------------------*/
+static
+Bool copy_output_until_stop ( EState* s )
+{
+   Bool progress_out = False;
+
+   while (True) {
+
+      /*-- no output space? --*/
+      if (s->strm->avail_out == 0) break;
+
+      /*-- block done? --*/
+      if (s->state_out_pos >= s->numZ) break;
+
+      progress_out = True;
+      *(s->strm->next_out) = s->zbits[s->state_out_pos];
+      s->state_out_pos++;
+      s->strm->avail_out--;
+      s->strm->next_out++;
+      s->strm->total_out_lo32++;
+      if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
+   }
+
+   return progress_out;
+}
+
+
+/*---------------------------------------------------*/
+static
+Bool handle_compress ( bz_stream* strm )
+{
+   Bool progress_in  = False;
+   Bool progress_out = False;
+   EState* s = (EState *)strm->state;
+   
+   while (True) {
+
+      if (s->state == BZ_S_OUTPUT) {
+         progress_out |= copy_output_until_stop ( s );
+         if (s->state_out_pos < s->numZ) break;
+         if (s->mode == BZ_M_FINISHING && 
+             s->avail_in_expect == 0 &&
+             isempty_RL(s)) break;
+         prepare_new_block ( s );
+         s->state = BZ_S_INPUT;
+         if (s->mode == BZ_M_FLUSHING && 
+             s->avail_in_expect == 0 &&
+             isempty_RL(s)) break;
+      }
+
+      if (s->state == BZ_S_INPUT) {
+         progress_in |= copy_input_until_stop ( s );
+         if (s->mode != BZ_M_RUNNING && s->avail_in_expect == 0) {
+            flush_RL ( s );
+            BZ2_compressBlock ( s, (Bool)(s->mode == BZ_M_FINISHING) );
+            s->state = BZ_S_OUTPUT;
+         }
+         else
+         if (s->nblock >= s->nblockMAX) {
+            BZ2_compressBlock ( s, False );
+            s->state = BZ_S_OUTPUT;
+         }
+         else
+         if (s->strm->avail_in == 0) {
+            break;
+         }
+      }
+
+   }
+
+   return progress_in || progress_out;
+}
+
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzCompress) ( bz_stream *strm, int action )
+{
+   Bool progress;
+   EState* s;
+   if (strm == NULL) return BZ_PARAM_ERROR;
+   s = (EState *)strm->state;
+   if (s == NULL) return BZ_PARAM_ERROR;
+   if (s->strm != strm) return BZ_PARAM_ERROR;
+
+   preswitch:
+   switch (s->mode) {
+
+      case BZ_M_IDLE:
+         return BZ_SEQUENCE_ERROR;
+
+      case BZ_M_RUNNING:
+         if (action == BZ_RUN) {
+            progress = handle_compress ( strm );
+            return progress ? BZ_RUN_OK : BZ_PARAM_ERROR;
+         } 
+         else
+	 if (action == BZ_FLUSH) {
+            s->avail_in_expect = strm->avail_in;
+            s->mode = BZ_M_FLUSHING;
+            goto preswitch;
+         }
+         else
+         if (action == BZ_FINISH) {
+            s->avail_in_expect = strm->avail_in;
+            s->mode = BZ_M_FINISHING;
+            goto preswitch;
+         }
+         else 
+            return BZ_PARAM_ERROR;
+
+      case BZ_M_FLUSHING:
+         if (action != BZ_FLUSH) return BZ_SEQUENCE_ERROR;
+         if (s->avail_in_expect != s->strm->avail_in) 
+            return BZ_SEQUENCE_ERROR;
+         progress = handle_compress ( strm );
+         if (s->avail_in_expect > 0 || !isempty_RL(s) ||
+             s->state_out_pos < s->numZ) return BZ_FLUSH_OK;
+         s->mode = BZ_M_RUNNING;
+         return BZ_RUN_OK;
+
+      case BZ_M_FINISHING:
+         if (action != BZ_FINISH) return BZ_SEQUENCE_ERROR;
+         if (s->avail_in_expect != s->strm->avail_in) 
+            return BZ_SEQUENCE_ERROR;
+         progress = handle_compress ( strm );
+         if (!progress) return BZ_SEQUENCE_ERROR;
+         if (s->avail_in_expect > 0 || !isempty_RL(s) ||
+             s->state_out_pos < s->numZ) return BZ_FINISH_OK;
+         s->mode = BZ_M_IDLE;
+         return BZ_STREAM_END;
+   }
+   return BZ_OK; /*--not reached--*/
+}
+
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzCompressEnd)  ( bz_stream *strm )
+{
+   EState* s;
+   if (strm == NULL) return BZ_PARAM_ERROR;
+   s = (EState *)strm->state;
+   if (s == NULL) return BZ_PARAM_ERROR;
+   if (s->strm != strm) return BZ_PARAM_ERROR;
+
+   if (s->arr1 != NULL) BZFREE(s->arr1);
+   if (s->arr2 != NULL) BZFREE(s->arr2);
+   if (s->ftab != NULL) BZFREE(s->ftab);
+   BZFREE(strm->state);
+
+   strm->state = NULL;   
+
+   return BZ_OK;
+}
+
+
+/*---------------------------------------------------*/
+/*--- Decompression stuff                         ---*/
+/*---------------------------------------------------*/
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzDecompressInit) 
+                     ( bz_stream* strm, 
+                       int        verbosity,
+                       int        small )
+{
+   DState* s;
+
+   if (!bz_config_ok()) return BZ_CONFIG_ERROR;
+
+   if (strm == NULL) return BZ_PARAM_ERROR;
+   if (small != 0 && small != 1) return BZ_PARAM_ERROR;
+   if (verbosity < 0 || verbosity > 4) return BZ_PARAM_ERROR;
+
+   if (strm->bzalloc == NULL) strm->bzalloc = default_bzalloc;
+   if (strm->bzfree == NULL) strm->bzfree = default_bzfree;
+
+   s = (DState *)BZALLOC( sizeof(DState) );
+   if (s == NULL) return BZ_MEM_ERROR;
+   s->strm                  = strm;
+   strm->state              = s;
+   s->state                 = BZ_X_MAGIC_1;
+   s->bsLive                = 0;
+   s->bsBuff                = 0;
+   s->calculatedCombinedCRC = 0;
+   strm->total_in_lo32      = 0;
+   strm->total_in_hi32      = 0;
+   strm->total_out_lo32     = 0;
+   strm->total_out_hi32     = 0;
+   s->smallDecompress       = (Bool)small;
+   s->ll4                   = NULL;
+   s->ll16                  = NULL;
+   s->tt                    = NULL;
+   s->currBlockNo           = 0;
+   s->verbosity             = verbosity;
+
+   return BZ_OK;
+}
+
+
+/*---------------------------------------------------*/
+/* Return  True iff data corruption is discovered.
+   Returns False if there is no problem.
+*/
+static
+Bool unRLE_obuf_to_output_FAST ( DState* s )
+{
+   UChar k1;
+
+   if (s->blockRandomised) {
+
+      while (True) {
+         /* try to finish existing run */
+         while (True) {
+            if (s->strm->avail_out == 0) return False;
+            if (s->state_out_len == 0) break;
+            *( (UChar*)(s->strm->next_out) ) = s->state_out_ch;
+            BZ_UPDATE_CRC ( s->calculatedBlockCRC, s->state_out_ch );
+            s->state_out_len--;
+            s->strm->next_out++;
+            s->strm->avail_out--;
+            s->strm->total_out_lo32++;
+            if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
+         }
+
+         /* can a new run be started? */
+         if (s->nblock_used == s->save_nblock+1) return False;
+               
+         /* Only caused by corrupt data stream? */
+         if (s->nblock_used > s->save_nblock+1)
+            return True;
+   
+         s->state_out_len = 1;
+         s->state_out_ch = s->k0;
+         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
+         k1 ^= BZ_RAND_MASK; s->nblock_used++;
+         if (s->nblock_used == s->save_nblock+1) continue;
+         if (k1 != s->k0) { s->k0 = k1; continue; };
+   
+         s->state_out_len = 2;
+         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
+         k1 ^= BZ_RAND_MASK; s->nblock_used++;
+         if (s->nblock_used == s->save_nblock+1) continue;
+         if (k1 != s->k0) { s->k0 = k1; continue; };
+   
+         s->state_out_len = 3;
+         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
+         k1 ^= BZ_RAND_MASK; s->nblock_used++;
+         if (s->nblock_used == s->save_nblock+1) continue;
+         if (k1 != s->k0) { s->k0 = k1; continue; };
+   
+         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
+         k1 ^= BZ_RAND_MASK; s->nblock_used++;
+         s->state_out_len = ((Int32)k1) + 4;
+         BZ_GET_FAST(s->k0); BZ_RAND_UPD_MASK; 
+         s->k0 ^= BZ_RAND_MASK; s->nblock_used++;
+      }
+
+   } else {
+
+      /* restore */
+      UInt32        c_calculatedBlockCRC = s->calculatedBlockCRC;
+      UChar         c_state_out_ch       = s->state_out_ch;
+      Int32         c_state_out_len      = s->state_out_len;
+      Int32         c_nblock_used        = s->nblock_used;
+      Int32         c_k0                 = s->k0;
+      UInt32*       c_tt                 = s->tt;
+      UInt32        c_tPos               = s->tPos;
+      char*         cs_next_out          = s->strm->next_out;
+      unsigned int  cs_avail_out         = s->strm->avail_out;
+      /* end restore */
+
+      UInt32       avail_out_INIT = cs_avail_out;
+      Int32        s_save_nblockPP = s->save_nblock+1;
+      unsigned int total_out_lo32_old;
+
+      while (True) {
+
+         /* try to finish existing run */
+         if (c_state_out_len > 0) {
+            while (True) {
+               if (cs_avail_out == 0) goto return_notr;
+               if (c_state_out_len == 1) break;
+               *( (UChar*)(cs_next_out) ) = c_state_out_ch;
+               BZ_UPDATE_CRC ( c_calculatedBlockCRC, c_state_out_ch );
+               c_state_out_len--;
+               cs_next_out++;
+               cs_avail_out--;
+            }
+            s_state_out_len_eq_one:
+            {
+               if (cs_avail_out == 0) { 
+                  c_state_out_len = 1; goto return_notr;
+               };
+               *( (UChar*)(cs_next_out) ) = c_state_out_ch;
+               BZ_UPDATE_CRC ( c_calculatedBlockCRC, c_state_out_ch );
+               cs_next_out++;
+               cs_avail_out--;
+            }
+         }   
+         /* Only caused by corrupt data stream? */
+         if (c_nblock_used > s_save_nblockPP)
+            return True;
+
+         /* can a new run be started? */
+         if (c_nblock_used == s_save_nblockPP) {
+            c_state_out_len = 0; goto return_notr;
+         };   
+         c_state_out_ch = c_k0;
+         BZ_GET_FAST_C(k1); c_nblock_used++;
+         if (k1 != c_k0) { 
+            c_k0 = k1; goto s_state_out_len_eq_one; 
+         };
+         if (c_nblock_used == s_save_nblockPP) 
+            goto s_state_out_len_eq_one;
+   
+         c_state_out_len = 2;
+         BZ_GET_FAST_C(k1); c_nblock_used++;
+         if (c_nblock_used == s_save_nblockPP) continue;
+         if (k1 != c_k0) { c_k0 = k1; continue; };
+   
+         c_state_out_len = 3;
+         BZ_GET_FAST_C(k1); c_nblock_used++;
+         if (c_nblock_used == s_save_nblockPP) continue;
+         if (k1 != c_k0) { c_k0 = k1; continue; };
+   
+         BZ_GET_FAST_C(k1); c_nblock_used++;
+         c_state_out_len = ((Int32)k1) + 4;
+         BZ_GET_FAST_C(c_k0); c_nblock_used++;
+      }
+
+      return_notr:
+      total_out_lo32_old = s->strm->total_out_lo32;
+      s->strm->total_out_lo32 += (avail_out_INIT - cs_avail_out);
+      if (s->strm->total_out_lo32 < total_out_lo32_old)
+         s->strm->total_out_hi32++;
+
+      /* save */
+      s->calculatedBlockCRC = c_calculatedBlockCRC;
+      s->state_out_ch       = c_state_out_ch;
+      s->state_out_len      = c_state_out_len;
+      s->nblock_used        = c_nblock_used;
+      s->k0                 = c_k0;
+      s->tt                 = c_tt;
+      s->tPos               = c_tPos;
+      s->strm->next_out     = cs_next_out;
+      s->strm->avail_out    = cs_avail_out;
+      /* end save */
+   }
+   return False;
+}
+
+
+
+/*---------------------------------------------------*/
+__inline__ Int32 BZ2_indexIntoF ( Int32 indx, Int32 *cftab )
+{
+   Int32 nb, na, mid;
+   nb = 0;
+   na = 256;
+   do {
+      mid = (nb + na) >> 1;
+      if (indx >= cftab[mid]) nb = mid; else na = mid;
+   }
+   while (na - nb != 1);
+   return nb;
+}
+
+
+/*---------------------------------------------------*/
+/* Return  True iff data corruption is discovered.
+   Returns False if there is no problem.
+*/
+static
+Bool unRLE_obuf_to_output_SMALL ( DState* s )
+{
+   UChar k1;
+
+   if (s->blockRandomised) {
+
+      while (True) {
+         /* try to finish existing run */
+         while (True) {
+            if (s->strm->avail_out == 0) return False;
+            if (s->state_out_len == 0) break;
+            *( (UChar*)(s->strm->next_out) ) = s->state_out_ch;
+            BZ_UPDATE_CRC ( s->calculatedBlockCRC, s->state_out_ch );
+            s->state_out_len--;
+            s->strm->next_out++;
+            s->strm->avail_out--;
+            s->strm->total_out_lo32++;
+            if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
+         }
+   
+         /* can a new run be started? */
+         if (s->nblock_used == s->save_nblock+1) return False;
+
+         /* Only caused by corrupt data stream? */
+         if (s->nblock_used > s->save_nblock+1)
+            return True;
+   
+         s->state_out_len = 1;
+         s->state_out_ch = s->k0;
+         BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK; 
+         k1 ^= BZ_RAND_MASK; s->nblock_used++;
+         if (s->nblock_used == s->save_nblock+1) continue;
+         if (k1 != s->k0) { s->k0 = k1; continue; };
+   
+         s->state_out_len = 2;
+         BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK; 
+         k1 ^= BZ_RAND_MASK; s->nblock_used++;
+         if (s->nblock_used == s->save_nblock+1) continue;
+         if (k1 != s->k0) { s->k0 = k1; continue; };
+   
+         s->state_out_len = 3;
+         BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK; 
+         k1 ^= BZ_RAND_MASK; s->nblock_used++;
+         if (s->nblock_used == s->save_nblock+1) continue;
+         if (k1 != s->k0) { s->k0 = k1; continue; };
+   
+         BZ_GET_SMALL(k1); BZ_RAND_UPD_MASK; 
+         k1 ^= BZ_RAND_MASK; s->nblock_used++;
+         s->state_out_len = ((Int32)k1) + 4;
+         BZ_GET_SMALL(s->k0); BZ_RAND_UPD_MASK; 
+         s->k0 ^= BZ_RAND_MASK; s->nblock_used++;
+      }
+
+   } else {
+
+      while (True) {
+         /* try to finish existing run */
+         while (True) {
+            if (s->strm->avail_out == 0) return False;
+            if (s->state_out_len == 0) break;
+            *( (UChar*)(s->strm->next_out) ) = s->state_out_ch;
+            BZ_UPDATE_CRC ( s->calculatedBlockCRC, s->state_out_ch );
+            s->state_out_len--;
+            s->strm->next_out++;
+            s->strm->avail_out--;
+            s->strm->total_out_lo32++;
+            if (s->strm->total_out_lo32 == 0) s->strm->total_out_hi32++;
+         }
+   
+         /* can a new run be started? */
+         if (s->nblock_used == s->save_nblock+1) return False;
+
+         /* Only caused by corrupt data stream? */
+         if (s->nblock_used > s->save_nblock+1)
+            return True;
+   
+         s->state_out_len = 1;
+         s->state_out_ch = s->k0;
+         BZ_GET_SMALL(k1); s->nblock_used++;
+         if (s->nblock_used == s->save_nblock+1) continue;
+         if (k1 != s->k0) { s->k0 = k1; continue; };
+   
+         s->state_out_len = 2;
+         BZ_GET_SMALL(k1); s->nblock_used++;
+         if (s->nblock_used == s->save_nblock+1) continue;
+         if (k1 != s->k0) { s->k0 = k1; continue; };
+   
+         s->state_out_len = 3;
+         BZ_GET_SMALL(k1); s->nblock_used++;
+         if (s->nblock_used == s->save_nblock+1) continue;
+         if (k1 != s->k0) { s->k0 = k1; continue; };
+   
+         BZ_GET_SMALL(k1); s->nblock_used++;
+         s->state_out_len = ((Int32)k1) + 4;
+         BZ_GET_SMALL(s->k0); s->nblock_used++;
+      }
+
+   }
+}
+
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzDecompress) ( bz_stream *strm )
+{
+   Bool    corrupt;
+   DState* s;
+   if (strm == NULL) return BZ_PARAM_ERROR;
+   s = (DState *)strm->state;
+   if (s == NULL) return BZ_PARAM_ERROR;
+   if (s->strm != strm) return BZ_PARAM_ERROR;
+
+   while (True) {
+      if (s->state == BZ_X_IDLE) return BZ_SEQUENCE_ERROR;
+      if (s->state == BZ_X_OUTPUT) {
+         if (s->smallDecompress)
+            corrupt = unRLE_obuf_to_output_SMALL ( s ); else
+            corrupt = unRLE_obuf_to_output_FAST  ( s );
+         if (corrupt) return BZ_DATA_ERROR;
+         if (s->nblock_used == s->save_nblock+1 && s->state_out_len == 0) {
+            BZ_FINALISE_CRC ( s->calculatedBlockCRC );
+            if (s->verbosity >= 3) 
+               VPrintf2 ( " {0x%08x, 0x%08x}", s->storedBlockCRC, 
+                          s->calculatedBlockCRC );
+            if (s->verbosity >= 2) VPrintf0 ( "]" );
+            if (s->calculatedBlockCRC != s->storedBlockCRC)
+               return BZ_DATA_ERROR;
+            s->calculatedCombinedCRC 
+               = (s->calculatedCombinedCRC << 1) | 
+                    (s->calculatedCombinedCRC >> 31);
+            s->calculatedCombinedCRC ^= s->calculatedBlockCRC;
+            s->state = BZ_X_BLKHDR_1;
+         } else {
+            return BZ_OK;
+         }
+      }
+      if (s->state >= BZ_X_MAGIC_1) {
+         Int32 r = BZ2_decompress ( s );
+         if (r == BZ_STREAM_END) {
+            if (s->verbosity >= 3)
+               VPrintf2 ( "\n    combined CRCs: stored = 0x%08x, computed = 0x%08x", 
+                          s->storedCombinedCRC, s->calculatedCombinedCRC );
+            if (s->calculatedCombinedCRC != s->storedCombinedCRC)
+               return BZ_DATA_ERROR;
+            return r;
+         }
+         if (s->state != BZ_X_OUTPUT) return r;
+      }
+   }
+
+   AssertH ( 0, 6001 );
+
+   return 0;  /*NOTREACHED*/
+}
+
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzDecompressEnd)  ( bz_stream *strm )
+{
+   DState* s;
+   if (strm == NULL) return BZ_PARAM_ERROR;
+   s = (DState *)strm->state;
+   if (s == NULL) return BZ_PARAM_ERROR;
+   if (s->strm != strm) return BZ_PARAM_ERROR;
+
+   if (s->tt   != NULL) BZFREE(s->tt);
+   if (s->ll16 != NULL) BZFREE(s->ll16);
+   if (s->ll4  != NULL) BZFREE(s->ll4);
+
+   BZFREE(strm->state);
+   strm->state = NULL;
+
+   return BZ_OK;
+}
+
+
+#ifndef BZ_NO_STDIO
+/*---------------------------------------------------*/
+/*--- File I/O stuff                              ---*/
+/*---------------------------------------------------*/
+
+#define BZ_SETERR(eee)                    \
+{                                         \
+   if (bzerror != NULL) *bzerror = eee;   \
+   if (bzf != NULL) bzf->lastErr = eee;   \
+}
+
+typedef 
+   struct {
+      FILE*     handle;
+      Char      buf[BZ_MAX_UNUSED];
+      Int32     bufN;
+      Bool      writing;
+      bz_stream strm;
+      Int32     lastErr;
+      Bool      initialisedOk;
+   }
+   bzFile;
+
+
+/*---------------------------------------------*/
+static Bool myfeof ( FILE* f )
+{
+   Int32 c = fgetc ( f );
+   if (c == EOF) return True;
+   ungetc ( c, f );
+   return False;
+}
+
+
+/*---------------------------------------------------*/
+BZFILE* BZ_API(BZ2_bzWriteOpen) 
+                    ( int*  bzerror,      
+                      FILE* f, 
+                      int   blockSize100k, 
+                      int   verbosity,
+                      int   workFactor )
+{
+   Int32   ret;
+   bzFile* bzf = NULL;
+
+   BZ_SETERR(BZ_OK);
+
+   if (f == NULL ||
+       (blockSize100k < 1 || blockSize100k > 9) ||
+       (workFactor < 0 || workFactor > 250) ||
+       (verbosity < 0 || verbosity > 4))
+      { BZ_SETERR(BZ_PARAM_ERROR); return NULL; };
+
+   if (ferror(f))
+      { BZ_SETERR(BZ_IO_ERROR); return NULL; };
+
+   bzf = (bzFile *)malloc ( sizeof(bzFile) );
+   if (bzf == NULL)
+      { BZ_SETERR(BZ_MEM_ERROR); return NULL; };
+
+   BZ_SETERR(BZ_OK);
+   bzf->initialisedOk = False;
+   bzf->bufN          = 0;
+   bzf->handle        = f;
+   bzf->writing       = True;
+   bzf->strm.bzalloc  = NULL;
+   bzf->strm.bzfree   = NULL;
+   bzf->strm.opaque   = NULL;
+
+   if (workFactor == 0) workFactor = 30;
+   ret = BZ2_bzCompressInit ( &(bzf->strm), blockSize100k, 
+                              verbosity, workFactor );
+   if (ret != BZ_OK)
+      { BZ_SETERR(ret); free(bzf); return NULL; };
+
+   bzf->strm.avail_in = 0;
+   bzf->initialisedOk = True;
+   return bzf;   
+}
+
+
+
+/*---------------------------------------------------*/
+void BZ_API(BZ2_bzWrite)
+             ( int*    bzerror, 
+               BZFILE* b, 
+               void*   buf, 
+               int     len )
+{
+   Int32 n, n2, ret;
+   bzFile* bzf = (bzFile*)b;
+
+   BZ_SETERR(BZ_OK);
+   if (bzf == NULL || buf == NULL || len < 0)
+      { BZ_SETERR(BZ_PARAM_ERROR); return; };
+   if (!(bzf->writing))
+      { BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
+   if (ferror(bzf->handle))
+      { BZ_SETERR(BZ_IO_ERROR); return; };
+
+   if (len == 0)
+      { BZ_SETERR(BZ_OK); return; };
+
+   bzf->strm.avail_in = len;
+   bzf->strm.next_in  = (char *)buf;
+
+   while (True) {
+      bzf->strm.avail_out = BZ_MAX_UNUSED;
+      bzf->strm.next_out = bzf->buf;
+      ret = BZ2_bzCompress ( &(bzf->strm), BZ_RUN );
+      if (ret != BZ_RUN_OK)
+         { BZ_SETERR(ret); return; };
+
+      if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
+         n = BZ_MAX_UNUSED - bzf->strm.avail_out;
+         n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar), 
+                       n, bzf->handle );
+         if (n != n2 || ferror(bzf->handle))
+            { BZ_SETERR(BZ_IO_ERROR); return; };
+      }
+
+      if (bzf->strm.avail_in == 0)
+         { BZ_SETERR(BZ_OK); return; };
+   }
+}
+
+
+/*---------------------------------------------------*/
+void BZ_API(BZ2_bzWriteClose)
+                  ( int*          bzerror, 
+                    BZFILE*       b, 
+                    int           abandon,
+                    unsigned int* nbytes_in,
+                    unsigned int* nbytes_out )
+{
+   BZ2_bzWriteClose64 ( bzerror, b, abandon, 
+                        nbytes_in, NULL, nbytes_out, NULL );
+}
+
+
+void BZ_API(BZ2_bzWriteClose64)
+                  ( int*          bzerror, 
+                    BZFILE*       b, 
+                    int           abandon,
+                    unsigned int* nbytes_in_lo32,
+                    unsigned int* nbytes_in_hi32,
+                    unsigned int* nbytes_out_lo32,
+                    unsigned int* nbytes_out_hi32 )
+{
+   Int32   n, n2, ret;
+   bzFile* bzf = (bzFile*)b;
+
+   if (bzf == NULL)
+      { BZ_SETERR(BZ_OK); return; };
+   if (!(bzf->writing))
+      { BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
+   if (ferror(bzf->handle))
+      { BZ_SETERR(BZ_IO_ERROR); return; };
+
+   if (nbytes_in_lo32 != NULL) *nbytes_in_lo32 = 0;
+   if (nbytes_in_hi32 != NULL) *nbytes_in_hi32 = 0;
+   if (nbytes_out_lo32 != NULL) *nbytes_out_lo32 = 0;
+   if (nbytes_out_hi32 != NULL) *nbytes_out_hi32 = 0;
+
+   if ((!abandon) && bzf->lastErr == BZ_OK) {
+      while (True) {
+         bzf->strm.avail_out = BZ_MAX_UNUSED;
+         bzf->strm.next_out = bzf->buf;
+         ret = BZ2_bzCompress ( &(bzf->strm), BZ_FINISH );
+         if (ret != BZ_FINISH_OK && ret != BZ_STREAM_END)
+            { BZ_SETERR(ret); return; };
+
+         if (bzf->strm.avail_out < BZ_MAX_UNUSED) {
+            n = BZ_MAX_UNUSED - bzf->strm.avail_out;
+            n2 = fwrite ( (void*)(bzf->buf), sizeof(UChar), 
+                          n, bzf->handle );
+            if (n != n2 || ferror(bzf->handle))
+               { BZ_SETERR(BZ_IO_ERROR); return; };
+         }
+
+         if (ret == BZ_STREAM_END) break;
+      }
+   }
+
+   if ( !abandon && !ferror ( bzf->handle ) ) {
+      fflush ( bzf->handle );
+      if (ferror(bzf->handle))
+         { BZ_SETERR(BZ_IO_ERROR); return; };
+   }
+
+   if (nbytes_in_lo32 != NULL)
+      *nbytes_in_lo32 = bzf->strm.total_in_lo32;
+   if (nbytes_in_hi32 != NULL)
+      *nbytes_in_hi32 = bzf->strm.total_in_hi32;
+   if (nbytes_out_lo32 != NULL)
+      *nbytes_out_lo32 = bzf->strm.total_out_lo32;
+   if (nbytes_out_hi32 != NULL)
+      *nbytes_out_hi32 = bzf->strm.total_out_hi32;
+
+   BZ_SETERR(BZ_OK);
+   BZ2_bzCompressEnd ( &(bzf->strm) );
+   free ( bzf );
+}
+
+
+/*---------------------------------------------------*/
+BZFILE* BZ_API(BZ2_bzReadOpen) 
+                   ( int*  bzerror, 
+                     FILE* f, 
+                     int   verbosity,
+                     int   small,
+                     void* unused,
+                     int   nUnused )
+{
+   bzFile* bzf = NULL;
+   int     ret;
+
+   BZ_SETERR(BZ_OK);
+
+   if (f == NULL || 
+       (small != 0 && small != 1) ||
+       (verbosity < 0 || verbosity > 4) ||
+       (unused == NULL && nUnused != 0) ||
+       (unused != NULL && (nUnused < 0 || nUnused > BZ_MAX_UNUSED)))
+      { BZ_SETERR(BZ_PARAM_ERROR); return NULL; };
+
+   if (ferror(f))
+      { BZ_SETERR(BZ_IO_ERROR); return NULL; };
+
+   bzf = (bzFile *)malloc ( sizeof(bzFile) );
+   if (bzf == NULL) 
+      { BZ_SETERR(BZ_MEM_ERROR); return NULL; };
+
+   BZ_SETERR(BZ_OK);
+
+   bzf->initialisedOk = False;
+   bzf->handle        = f;
+   bzf->bufN          = 0;
+   bzf->writing       = False;
+   bzf->strm.bzalloc  = NULL;
+   bzf->strm.bzfree   = NULL;
+   bzf->strm.opaque   = NULL;
+   
+   while (nUnused > 0) {
+      bzf->buf[bzf->bufN] = *((UChar*)(unused)); bzf->bufN++;
+      unused = ((void*)( 1 + ((UChar*)(unused))  ));
+      nUnused--;
+   }
+
+   ret = BZ2_bzDecompressInit ( &(bzf->strm), verbosity, small );
+   if (ret != BZ_OK)
+      { BZ_SETERR(ret); free(bzf); return NULL; };
+
+   bzf->strm.avail_in = bzf->bufN;
+   bzf->strm.next_in  = bzf->buf;
+
+   bzf->initialisedOk = True;
+   return bzf;   
+}
+
+
+/*---------------------------------------------------*/
+void BZ_API(BZ2_bzReadClose) ( int *bzerror, BZFILE *b )
+{
+   bzFile* bzf = (bzFile*)b;
+
+   BZ_SETERR(BZ_OK);
+   if (bzf == NULL)
+      { BZ_SETERR(BZ_OK); return; };
+
+   if (bzf->writing)
+      { BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
+
+   if (bzf->initialisedOk)
+      (void)BZ2_bzDecompressEnd ( &(bzf->strm) );
+   free ( bzf );
+}
+
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzRead) 
+           ( int*    bzerror, 
+             BZFILE* b, 
+             void*   buf, 
+             int     len )
+{
+   Int32   n, ret;
+   bzFile* bzf = (bzFile*)b;
+
+   BZ_SETERR(BZ_OK);
+
+   if (bzf == NULL || buf == NULL || len < 0)
+      { BZ_SETERR(BZ_PARAM_ERROR); return 0; };
+
+   if (bzf->writing)
+      { BZ_SETERR(BZ_SEQUENCE_ERROR); return 0; };
+
+   if (len == 0)
+      { BZ_SETERR(BZ_OK); return 0; };
+
+   bzf->strm.avail_out = len;
+   bzf->strm.next_out = (char *)buf;
+
+   while (True) {
+
+      if (ferror(bzf->handle)) 
+         { BZ_SETERR(BZ_IO_ERROR); return 0; };
+
+      if (bzf->strm.avail_in == 0 && !myfeof(bzf->handle)) {
+         n = fread ( bzf->buf, sizeof(UChar), 
+                     BZ_MAX_UNUSED, bzf->handle );
+         if (ferror(bzf->handle))
+            { BZ_SETERR(BZ_IO_ERROR); return 0; };
+         bzf->bufN = n;
+         bzf->strm.avail_in = bzf->bufN;
+         bzf->strm.next_in = bzf->buf;
+      }
+
+      ret = BZ2_bzDecompress ( &(bzf->strm) );
+
+      if (ret != BZ_OK && ret != BZ_STREAM_END)
+         { BZ_SETERR(ret); return 0; };
+
+      if (ret == BZ_OK && myfeof(bzf->handle) && 
+          bzf->strm.avail_in == 0 && bzf->strm.avail_out > 0)
+         { BZ_SETERR(BZ_UNEXPECTED_EOF); return 0; };
+
+      if (ret == BZ_STREAM_END)
+         { BZ_SETERR(BZ_STREAM_END);
+           return len - bzf->strm.avail_out; };
+      if (bzf->strm.avail_out == 0)
+         { BZ_SETERR(BZ_OK); return len; };
+      
+   }
+
+   return 0; /*not reached*/
+}
+
+
+/*---------------------------------------------------*/
+void BZ_API(BZ2_bzReadGetUnused) 
+                     ( int*    bzerror, 
+                       BZFILE* b, 
+                       void**  unused, 
+                       int*    nUnused )
+{
+   bzFile* bzf = (bzFile*)b;
+   if (bzf == NULL)
+      { BZ_SETERR(BZ_PARAM_ERROR); return; };
+   if (bzf->lastErr != BZ_STREAM_END)
+      { BZ_SETERR(BZ_SEQUENCE_ERROR); return; };
+   if (unused == NULL || nUnused == NULL)
+      { BZ_SETERR(BZ_PARAM_ERROR); return; };
+
+   BZ_SETERR(BZ_OK);
+   *nUnused = bzf->strm.avail_in;
+   *unused = bzf->strm.next_in;
+}
+#endif
+
+
+/*---------------------------------------------------*/
+/*--- Misc convenience stuff                      ---*/
+/*---------------------------------------------------*/
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzBuffToBuffCompress) 
+                         ( char*         dest, 
+                           unsigned int* destLen,
+                           char*         source, 
+                           unsigned int  sourceLen,
+                           int           blockSize100k, 
+                           int           verbosity, 
+                           int           workFactor )
+{
+   bz_stream strm;
+   int ret;
+
+   if (dest == NULL || destLen == NULL || 
+       source == NULL ||
+       blockSize100k < 1 || blockSize100k > 9 ||
+       verbosity < 0 || verbosity > 4 ||
+       workFactor < 0 || workFactor > 250) 
+      return BZ_PARAM_ERROR;
+
+   if (workFactor == 0) workFactor = 30;
+   strm.bzalloc = NULL;
+   strm.bzfree = NULL;
+   strm.opaque = NULL;
+   ret = BZ2_bzCompressInit ( &strm, blockSize100k, 
+                              verbosity, workFactor );
+   if (ret != BZ_OK) return ret;
+
+   strm.next_in = source;
+   strm.next_out = dest;
+   strm.avail_in = sourceLen;
+   strm.avail_out = *destLen;
+
+   ret = BZ2_bzCompress ( &strm, BZ_FINISH );
+   if (ret == BZ_FINISH_OK) goto output_overflow;
+   if (ret != BZ_STREAM_END) goto errhandler;
+
+   /* normal termination */
+   *destLen -= strm.avail_out;   
+   BZ2_bzCompressEnd ( &strm );
+   return BZ_OK;
+
+   output_overflow:
+   BZ2_bzCompressEnd ( &strm );
+   return BZ_OUTBUFF_FULL;
+
+   errhandler:
+   BZ2_bzCompressEnd ( &strm );
+   return ret;
+}
+
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzBuffToBuffDecompress) 
+                           ( char*         dest, 
+                             unsigned int* destLen,
+                             char*         source, 
+                             unsigned int  sourceLen,
+                             int           small,
+                             int           verbosity )
+{
+   bz_stream strm;
+   int ret;
+
+   if (dest == NULL || destLen == NULL || 
+       source == NULL ||
+       (small != 0 && small != 1) ||
+       verbosity < 0 || verbosity > 4) 
+          return BZ_PARAM_ERROR;
+
+   strm.bzalloc = NULL;
+   strm.bzfree = NULL;
+   strm.opaque = NULL;
+   ret = BZ2_bzDecompressInit ( &strm, verbosity, small );
+   if (ret != BZ_OK) return ret;
+
+   strm.next_in = source;
+   strm.next_out = dest;
+   strm.avail_in = sourceLen;
+   strm.avail_out = *destLen;
+
+   ret = BZ2_bzDecompress ( &strm );
+   if (ret == BZ_OK) goto output_overflow_or_eof;
+   if (ret != BZ_STREAM_END) goto errhandler;
+
+   /* normal termination */
+   *destLen -= strm.avail_out;
+   BZ2_bzDecompressEnd ( &strm );
+   return BZ_OK;
+
+   output_overflow_or_eof:
+   if (strm.avail_out > 0) {
+      BZ2_bzDecompressEnd ( &strm );
+      return BZ_UNEXPECTED_EOF;
+   } else {
+      BZ2_bzDecompressEnd ( &strm );
+      return BZ_OUTBUFF_FULL;
+   };      
+
+   errhandler:
+   BZ2_bzDecompressEnd ( &strm );
+   return ret; 
+}
+
+
+/*---------------------------------------------------*/
+/*--
+   Code contributed by Yoshioka Tsuneo
+   (QWF00133@niftyserve.or.jp/tsuneo-y@is.aist-nara.ac.jp),
+   to support better zlib compatibility.
+   This code is not _officially_ part of libbzip2 (yet);
+   I haven't tested it, documented it, or considered the
+   threading-safeness of it.
+   If this code breaks, please contact both Yoshioka and me.
+--*/
+/*---------------------------------------------------*/
+
+/*---------------------------------------------------*/
+/*--
+   return version like "0.9.0c".
+--*/
+const char * BZ_API(BZ2_bzlibVersion)(void)
+{
+   return BZ_VERSION;
+}
+
+
+#ifndef BZ_NO_STDIO
+/*---------------------------------------------------*/
+
+#if defined(_WIN32) || defined(OS2) || defined(MSDOS)
+#   include <fcntl.h>
+#   include <io.h>
+#   define SET_BINARY_MODE(file) setmode(fileno(file),O_BINARY)
+#else
+#   define SET_BINARY_MODE(file)
+#endif
+static
+BZFILE * bzopen_or_bzdopen
+               ( const char *path,   /* no use when bzdopen */
+                 int fd,             /* no use when bzdopen */
+                 const char *mode,
+                 int open_mode)      /* bzopen: 0, bzdopen:1 */
+{
+   int    bzerr;
+   char   unused[BZ_MAX_UNUSED];
+   int    blockSize100k = 9;
+   int    writing       = 0;
+   char   mode2[10]     = "";
+   FILE   *fp           = NULL;
+   BZFILE *bzfp         = NULL;
+   int    verbosity     = 0;
+   int    workFactor    = 30;
+   int    smallMode     = 0;
+   int    nUnused       = 0; 
+
+   if (mode == NULL) return NULL;
+   while (*mode) {
+      switch (*mode) {
+      case 'r':
+         writing = 0; break;
+      case 'w':
+         writing = 1; break;
+      case 's':
+         smallMode = 1; break;
+      default:
+         if (isdigit((int)(*mode))) {
+            blockSize100k = *mode-BZ_HDR_0;
+         }
+      }
+      mode++;
+   }
+   strcat(mode2, writing ? "w" : "r" );
+   strcat(mode2,"b");   /* binary mode */
+
+   if (open_mode==0) {
+      if (path==NULL || strcmp(path,"")==0) {
+        fp = (writing ? stdout : stdin);
+        SET_BINARY_MODE(fp);
+      } else {
+        fp = fopen(path,mode2);
+      }
+   } else {
+#ifdef BZ_STRICT_ANSI
+      fp = NULL;
+#else
+      fp = fdopen(fd,mode2);
+#endif
+   }
+   if (fp == NULL) return NULL;
+
+   if (writing) {
+      /* Guard against total chaos and anarchy -- JRS */
+      if (blockSize100k < 1) blockSize100k = 1;
+      if (blockSize100k > 9) blockSize100k = 9; 
+      bzfp = BZ2_bzWriteOpen(&bzerr,fp,blockSize100k,
+                             verbosity,workFactor);
+   } else {
+      bzfp = BZ2_bzReadOpen(&bzerr,fp,verbosity,smallMode,
+                            unused,nUnused);
+   }
+   if (bzfp == NULL) {
+      if (fp != stdin && fp != stdout) fclose(fp);
+      return NULL;
+   }
+   return bzfp;
+}
+
+
+/*---------------------------------------------------*/
+/*--
+   open file for read or write.
+      ex) bzopen("file","w9")
+      case path="" or NULL => use stdin or stdout.
+--*/
+BZFILE * BZ_API(BZ2_bzopen)
+               ( const char *path,
+                 const char *mode )
+{
+   return bzopen_or_bzdopen(path,-1,mode,/*bzopen*/0);
+}
+
+
+/*---------------------------------------------------*/
+BZFILE * BZ_API(BZ2_bzdopen)
+               ( int fd,
+                 const char *mode )
+{
+   return bzopen_or_bzdopen(NULL,fd,mode,/*bzdopen*/1);
+}
+
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzread) (BZFILE* b, void* buf, int len )
+{
+   int bzerr, nread;
+   if (((bzFile*)b)->lastErr == BZ_STREAM_END) return 0;
+   nread = BZ2_bzRead(&bzerr,b,buf,len);
+   if (bzerr == BZ_OK || bzerr == BZ_STREAM_END) {
+      return nread;
+   } else {
+      return -1;
+   }
+}
+
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzwrite) (BZFILE* b, void* buf, int len )
+{
+   int bzerr;
+
+   BZ2_bzWrite(&bzerr,b,buf,len);
+   if(bzerr == BZ_OK){
+      return len;
+   }else{
+      return -1;
+   }
+}
+
+
+/*---------------------------------------------------*/
+int BZ_API(BZ2_bzflush) (BZFILE *b)
+{
+   /* do nothing now... */
+   return 0;
+}
+
+
+/*---------------------------------------------------*/
+void BZ_API(BZ2_bzclose) (BZFILE* b)
+{
+   int bzerr;
+   FILE *fp = ((bzFile *)b)->handle;
+   
+   if (b==NULL) {return;}
+   if(((bzFile*)b)->writing){
+      BZ2_bzWriteClose(&bzerr,b,0,NULL,NULL);
+      if(bzerr != BZ_OK){
+         BZ2_bzWriteClose(NULL,b,1,NULL,NULL);
+      }
+   }else{
+      BZ2_bzReadClose(&bzerr,b);
+   }
+   if(fp!=stdin && fp!=stdout){
+      fclose(fp);
+   }
+}
+
+
+/*---------------------------------------------------*/
+/*--
+   return last error code 
+--*/
+static char *bzerrorstrings[] = {
+       "OK"
+      ,"SEQUENCE_ERROR"
+      ,"PARAM_ERROR"
+      ,"MEM_ERROR"
+      ,"DATA_ERROR"
+      ,"DATA_ERROR_MAGIC"
+      ,"IO_ERROR"
+      ,"UNEXPECTED_EOF"
+      ,"OUTBUFF_FULL"
+      ,"CONFIG_ERROR"
+      ,"???"   /* for future */
+      ,"???"   /* for future */
+      ,"???"   /* for future */
+      ,"???"   /* for future */
+      ,"???"   /* for future */
+      ,"???"   /* for future */
+};
+
+
+const char * BZ_API(BZ2_bzerror) (BZFILE *b, int *errnum)
+{
+   int err = ((bzFile *)b)->lastErr;
+
+   if(err>0) err = 0;
+   *errnum = err;
+   return bzerrorstrings[err*-1];
+}
+#endif
+
+
+/*-------------------------------------------------------------*/
+/*--- end                                           bzlib.c ---*/
+/*-------------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/bzlib.h b/updater/bzip2-1.0.3/bzlib.h
new file mode 100644
index 0000000..3237243
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzlib.h
@@ -0,0 +1,323 @@
+
+/*-------------------------------------------------------------*/
+/*--- Public header file for the library.                   ---*/
+/*---                                               bzlib.h ---*/
+/*-------------------------------------------------------------*/
+
+/*--
+  This file is a part of bzip2 and/or libbzip2, a program and
+  library for lossless, block-sorting data compression.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0 of 21 March 2000
+
+  This program is based on (at least) the work of:
+     Mike Burrows
+     David Wheeler
+     Peter Fenwick
+     Alistair Moffat
+     Radford Neal
+     Ian H. Witten
+     Robert Sedgewick
+     Jon L. Bentley
+
+  For more information on these sources, see the manual.
+--*/
+
+
+#ifndef _BZLIB_H
+#define _BZLIB_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#define BZ_RUN               0
+#define BZ_FLUSH             1
+#define BZ_FINISH            2
+
+#define BZ_OK                0
+#define BZ_RUN_OK            1
+#define BZ_FLUSH_OK          2
+#define BZ_FINISH_OK         3
+#define BZ_STREAM_END        4
+#define BZ_SEQUENCE_ERROR    (-1)
+#define BZ_PARAM_ERROR       (-2)
+#define BZ_MEM_ERROR         (-3)
+#define BZ_DATA_ERROR        (-4)
+#define BZ_DATA_ERROR_MAGIC  (-5)
+#define BZ_IO_ERROR          (-6)
+#define BZ_UNEXPECTED_EOF    (-7)
+#define BZ_OUTBUFF_FULL      (-8)
+#define BZ_CONFIG_ERROR      (-9)
+
+typedef 
+   struct {
+      char *next_in;
+      unsigned int avail_in;
+      unsigned int total_in_lo32;
+      unsigned int total_in_hi32;
+
+      char *next_out;
+      unsigned int avail_out;
+      unsigned int total_out_lo32;
+      unsigned int total_out_hi32;
+
+      void *state;
+
+      void *(*bzalloc)(void *,int,int);
+      void (*bzfree)(void *,void *);
+      void *opaque;
+   } 
+   bz_stream;
+
+
+#ifndef BZ_IMPORT
+#define BZ_EXPORT
+#endif
+
+#ifndef BZ_NO_STDIO
+/* Need a definitition for FILE */
+#include <stdio.h>
+#endif
+
+#ifdef _WIN32
+#   include <windows.h>
+#   ifdef small
+      /* windows.h define small to char */
+#      undef small
+#   endif
+#   ifdef BZ_EXPORT
+#   define BZ_API(func) WINAPI func
+#   define BZ_EXTERN extern
+#   else
+   /* import windows dll dynamically */
+#   define BZ_API(func) (WINAPI * func)
+#   define BZ_EXTERN
+#   endif
+#else
+#   define BZ_API(func) func
+#   define BZ_EXTERN extern
+#endif
+
+
+/*-- Core (low-level) library functions --*/
+
+BZ_EXTERN int BZ_API(BZ2_bzCompressInit) ( 
+      bz_stream* strm, 
+      int        blockSize100k, 
+      int        verbosity, 
+      int        workFactor 
+   );
+
+BZ_EXTERN int BZ_API(BZ2_bzCompress) ( 
+      bz_stream* strm, 
+      int action 
+   );
+
+BZ_EXTERN int BZ_API(BZ2_bzCompressEnd) ( 
+      bz_stream* strm 
+   );
+
+BZ_EXTERN int BZ_API(BZ2_bzDecompressInit) ( 
+      bz_stream *strm, 
+      int       verbosity, 
+      int       small
+   );
+
+BZ_EXTERN int BZ_API(BZ2_bzDecompress) ( 
+      bz_stream* strm 
+   );
+
+BZ_EXTERN int BZ_API(BZ2_bzDecompressEnd) ( 
+      bz_stream *strm 
+   );
+
+
+
+/*-- High(er) level library functions --*/
+
+#ifndef BZ_NO_STDIO
+#define BZ_MAX_UNUSED 5000
+
+typedef void BZFILE;
+
+BZ_EXTERN BZFILE* BZ_API(BZ2_bzReadOpen) ( 
+      int*  bzerror,   
+      FILE* f, 
+      int   verbosity, 
+      int   small,
+      void* unused,    
+      int   nUnused 
+   );
+
+BZ_EXTERN void BZ_API(BZ2_bzReadClose) ( 
+      int*    bzerror, 
+      BZFILE* b 
+   );
+
+BZ_EXTERN void BZ_API(BZ2_bzReadGetUnused) ( 
+      int*    bzerror, 
+      BZFILE* b, 
+      void**  unused,  
+      int*    nUnused 
+   );
+
+BZ_EXTERN int BZ_API(BZ2_bzRead) ( 
+      int*    bzerror, 
+      BZFILE* b, 
+      void*   buf, 
+      int     len 
+   );
+
+BZ_EXTERN BZFILE* BZ_API(BZ2_bzWriteOpen) ( 
+      int*  bzerror,      
+      FILE* f, 
+      int   blockSize100k, 
+      int   verbosity, 
+      int   workFactor 
+   );
+
+BZ_EXTERN void BZ_API(BZ2_bzWrite) ( 
+      int*    bzerror, 
+      BZFILE* b, 
+      void*   buf, 
+      int     len 
+   );
+
+BZ_EXTERN void BZ_API(BZ2_bzWriteClose) ( 
+      int*          bzerror, 
+      BZFILE*       b, 
+      int           abandon, 
+      unsigned int* nbytes_in, 
+      unsigned int* nbytes_out 
+   );
+
+BZ_EXTERN void BZ_API(BZ2_bzWriteClose64) ( 
+      int*          bzerror, 
+      BZFILE*       b, 
+      int           abandon, 
+      unsigned int* nbytes_in_lo32, 
+      unsigned int* nbytes_in_hi32, 
+      unsigned int* nbytes_out_lo32, 
+      unsigned int* nbytes_out_hi32
+   );
+#endif
+
+
+/*-- Utility functions --*/
+
+BZ_EXTERN int BZ_API(BZ2_bzBuffToBuffCompress) ( 
+      char*         dest, 
+      unsigned int* destLen,
+      char*         source, 
+      unsigned int  sourceLen,
+      int           blockSize100k, 
+      int           verbosity, 
+      int           workFactor 
+   );
+
+BZ_EXTERN int BZ_API(BZ2_bzBuffToBuffDecompress) ( 
+      char*         dest, 
+      unsigned int* destLen,
+      char*         source, 
+      unsigned int  sourceLen,
+      int           small, 
+      int           verbosity 
+   );
+
+
+/*--
+   Code contributed by Yoshioka Tsuneo
+   (QWF00133@niftyserve.or.jp/tsuneo-y@is.aist-nara.ac.jp),
+   to support better zlib compatibility.
+   This code is not _officially_ part of libbzip2 (yet);
+   I haven't tested it, documented it, or considered the
+   threading-safeness of it.
+   If this code breaks, please contact both Yoshioka and me.
+--*/
+
+BZ_EXTERN const char * BZ_API(BZ2_bzlibVersion) (
+      void
+   );
+
+#ifndef BZ_NO_STDIO
+BZ_EXTERN BZFILE * BZ_API(BZ2_bzopen) (
+      const char *path,
+      const char *mode
+   );
+
+BZ_EXTERN BZFILE * BZ_API(BZ2_bzdopen) (
+      int        fd,
+      const char *mode
+   );
+         
+BZ_EXTERN int BZ_API(BZ2_bzread) (
+      BZFILE* b, 
+      void* buf, 
+      int len 
+   );
+
+BZ_EXTERN int BZ_API(BZ2_bzwrite) (
+      BZFILE* b, 
+      void*   buf, 
+      int     len 
+   );
+
+BZ_EXTERN int BZ_API(BZ2_bzflush) (
+      BZFILE* b
+   );
+
+BZ_EXTERN void BZ_API(BZ2_bzclose) (
+      BZFILE* b
+   );
+
+BZ_EXTERN const char * BZ_API(BZ2_bzerror) (
+      BZFILE *b, 
+      int    *errnum
+   );
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
+
+/*-------------------------------------------------------------*/
+/*--- end                                           bzlib.h ---*/
+/*-------------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/bzlib_private.h b/updater/bzip2-1.0.3/bzlib_private.h
new file mode 100644
index 0000000..835c62c
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzlib_private.h
@@ -0,0 +1,537 @@
+
+/*-------------------------------------------------------------*/
+/*--- Private header file for the library.                  ---*/
+/*---                                       bzlib_private.h ---*/
+/*-------------------------------------------------------------*/
+
+/*--
+  This file is a part of bzip2 and/or libbzip2, a program and
+  library for lossless, block-sorting data compression.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0 of 21 March 2000
+
+  This program is based on (at least) the work of:
+     Mike Burrows
+     David Wheeler
+     Peter Fenwick
+     Alistair Moffat
+     Radford Neal
+     Ian H. Witten
+     Robert Sedgewick
+     Jon L. Bentley
+
+  For more information on these sources, see the manual.
+--*/
+
+
+#ifndef _BZLIB_PRIVATE_H
+#define _BZLIB_PRIVATE_H
+
+#include <stdlib.h>
+
+#ifndef BZ_NO_STDIO
+#include <stdio.h>
+#include <ctype.h>
+#include <string.h>
+#endif
+
+#include "bzlib.h"
+
+
+
+/*-- General stuff. --*/
+
+#define BZ_VERSION  "1.0.3, 15-Feb-2005"
+
+typedef char            Char;
+typedef unsigned char   Bool;
+typedef unsigned char   UChar;
+typedef int             Int32;
+typedef unsigned int    UInt32;
+typedef short           Int16;
+typedef unsigned short  UInt16;
+
+#define True  ((Bool)1)
+#define False ((Bool)0)
+
+//#ifndef __GNUC__
+#define __inline__  /* */
+//#endif 
+
+#ifndef BZ_NO_STDIO
+extern void BZ2_bz__AssertH__fail ( int errcode );
+#define AssertH(cond,errcode) \
+   { if (!(cond)) BZ2_bz__AssertH__fail ( errcode ); }
+#if BZ_DEBUG
+#define AssertD(cond,msg) \
+   { if (!(cond)) {       \
+      fprintf ( stderr,   \
+        "\n\nlibbzip2(debug build): internal error\n\t%s\n", msg );\
+      exit(1); \
+   }}
+#else
+#define AssertD(cond,msg) /* */
+#endif
+#define VPrintf0(zf) \
+   fprintf(stderr,zf)
+#define VPrintf1(zf,za1) \
+   fprintf(stderr,zf,za1)
+#define VPrintf2(zf,za1,za2) \
+   fprintf(stderr,zf,za1,za2)
+#define VPrintf3(zf,za1,za2,za3) \
+   fprintf(stderr,zf,za1,za2,za3)
+#define VPrintf4(zf,za1,za2,za3,za4) \
+   fprintf(stderr,zf,za1,za2,za3,za4)
+#define VPrintf5(zf,za1,za2,za3,za4,za5) \
+   fprintf(stderr,zf,za1,za2,za3,za4,za5)
+#else
+extern void bz_internal_error ( int errcode );
+#define AssertH(cond,errcode) \
+   { if (!(cond)) bz_internal_error ( errcode ); }
+#define AssertD(cond,msg) /* */
+#define VPrintf0(zf) /* */
+#define VPrintf1(zf,za1) /* */
+#define VPrintf2(zf,za1,za2) /* */
+#define VPrintf3(zf,za1,za2,za3) /* */
+#define VPrintf4(zf,za1,za2,za3,za4) /* */
+#define VPrintf5(zf,za1,za2,za3,za4,za5) /* */
+#endif
+
+
+#define BZALLOC(nnn) (strm->bzalloc)(strm->opaque,(nnn),1)
+#define BZFREE(ppp)  (strm->bzfree)(strm->opaque,(ppp))
+
+
+/*-- Header bytes. --*/
+
+#define BZ_HDR_B 0x42   /* 'B' */
+#define BZ_HDR_Z 0x5a   /* 'Z' */
+#define BZ_HDR_h 0x68   /* 'h' */
+#define BZ_HDR_0 0x30   /* '0' */
+  
+/*-- Constants for the back end. --*/
+
+#define BZ_MAX_ALPHA_SIZE 258
+#define BZ_MAX_CODE_LEN    23
+
+#define BZ_RUNA 0
+#define BZ_RUNB 1
+
+#define BZ_N_GROUPS 6
+#define BZ_G_SIZE   50
+#define BZ_N_ITERS  4
+
+#define BZ_MAX_SELECTORS (2 + (900000 / BZ_G_SIZE))
+
+
+
+/*-- Stuff for randomising repetitive blocks. --*/
+
+extern Int32 BZ2_rNums[512];
+
+#define BZ_RAND_DECLS                          \
+   Int32 rNToGo;                               \
+   Int32 rTPos                                 \
+
+#define BZ_RAND_INIT_MASK                      \
+   s->rNToGo = 0;                              \
+   s->rTPos  = 0                               \
+
+#define BZ_RAND_MASK ((s->rNToGo == 1) ? 1 : 0)
+
+#define BZ_RAND_UPD_MASK                       \
+   if (s->rNToGo == 0) {                       \
+      s->rNToGo = BZ2_rNums[s->rTPos];         \
+      s->rTPos++;                              \
+      if (s->rTPos == 512) s->rTPos = 0;       \
+   }                                           \
+   s->rNToGo--;
+
+
+
+/*-- Stuff for doing CRCs. --*/
+
+extern UInt32 BZ2_crc32Table[256];
+
+#define BZ_INITIALISE_CRC(crcVar)              \
+{                                              \
+   crcVar = 0xffffffffL;                       \
+}
+
+#define BZ_FINALISE_CRC(crcVar)                \
+{                                              \
+   crcVar = ~(crcVar);                         \
+}
+
+#define BZ_UPDATE_CRC(crcVar,cha)              \
+{                                              \
+   crcVar = (crcVar << 8) ^                    \
+            BZ2_crc32Table[(crcVar >> 24) ^    \
+                           ((UChar)cha)];      \
+}
+
+
+
+/*-- States and modes for compression. --*/
+
+#define BZ_M_IDLE      1
+#define BZ_M_RUNNING   2
+#define BZ_M_FLUSHING  3
+#define BZ_M_FINISHING 4
+
+#define BZ_S_OUTPUT    1
+#define BZ_S_INPUT     2
+
+#define BZ_N_RADIX 2
+#define BZ_N_QSORT 12
+#define BZ_N_SHELL 18
+#define BZ_N_OVERSHOOT (BZ_N_RADIX + BZ_N_QSORT + BZ_N_SHELL + 2)
+
+
+
+
+/*-- Structure holding all the compression-side stuff. --*/
+
+typedef
+   struct {
+      /* pointer back to the struct bz_stream */
+      bz_stream* strm;
+
+      /* mode this stream is in, and whether inputting */
+      /* or outputting data */
+      Int32    mode;
+      Int32    state;
+
+      /* remembers avail_in when flush/finish requested */
+      UInt32   avail_in_expect;
+
+      /* for doing the block sorting */
+      UInt32*  arr1;
+      UInt32*  arr2;
+      UInt32*  ftab;
+      Int32    origPtr;
+
+      /* aliases for arr1 and arr2 */
+      UInt32*  ptr;
+      UChar*   block;
+      UInt16*  mtfv;
+      UChar*   zbits;
+
+      /* for deciding when to use the fallback sorting algorithm */
+      Int32    workFactor;
+
+      /* run-length-encoding of the input */
+      UInt32   state_in_ch;
+      Int32    state_in_len;
+      BZ_RAND_DECLS;
+
+      /* input and output limits and current posns */
+      Int32    nblock;
+      Int32    nblockMAX;
+      Int32    numZ;
+      Int32    state_out_pos;
+
+      /* map of bytes used in block */
+      Int32    nInUse;
+      Bool     inUse[256];
+      UChar    unseqToSeq[256];
+
+      /* the buffer for bit stream creation */
+      UInt32   bsBuff;
+      Int32    bsLive;
+
+      /* block and combined CRCs */
+      UInt32   blockCRC;
+      UInt32   combinedCRC;
+
+      /* misc administratium */
+      Int32    verbosity;
+      Int32    blockNo;
+      Int32    blockSize100k;
+
+      /* stuff for coding the MTF values */
+      Int32    nMTF;
+      Int32    mtfFreq    [BZ_MAX_ALPHA_SIZE];
+      UChar    selector   [BZ_MAX_SELECTORS];
+      UChar    selectorMtf[BZ_MAX_SELECTORS];
+
+      UChar    len     [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
+      Int32    code    [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
+      Int32    rfreq   [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
+      /* second dimension: only 3 needed; 4 makes index calculations faster */
+      UInt32   len_pack[BZ_MAX_ALPHA_SIZE][4];
+
+   }
+   EState;
+
+
+
+/*-- externs for compression. --*/
+
+extern void 
+BZ2_blockSort ( EState* );
+
+extern void 
+BZ2_compressBlock ( EState*, Bool );
+
+extern void 
+BZ2_bsInitWrite ( EState* );
+
+extern void 
+BZ2_hbAssignCodes ( Int32*, UChar*, Int32, Int32, Int32 );
+
+extern void 
+BZ2_hbMakeCodeLengths ( UChar*, Int32*, Int32, Int32 );
+
+
+
+/*-- states for decompression. --*/
+
+#define BZ_X_IDLE        1
+#define BZ_X_OUTPUT      2
+
+#define BZ_X_MAGIC_1     10
+#define BZ_X_MAGIC_2     11
+#define BZ_X_MAGIC_3     12
+#define BZ_X_MAGIC_4     13
+#define BZ_X_BLKHDR_1    14
+#define BZ_X_BLKHDR_2    15
+#define BZ_X_BLKHDR_3    16
+#define BZ_X_BLKHDR_4    17
+#define BZ_X_BLKHDR_5    18
+#define BZ_X_BLKHDR_6    19
+#define BZ_X_BCRC_1      20
+#define BZ_X_BCRC_2      21
+#define BZ_X_BCRC_3      22
+#define BZ_X_BCRC_4      23
+#define BZ_X_RANDBIT     24
+#define BZ_X_ORIGPTR_1   25
+#define BZ_X_ORIGPTR_2   26
+#define BZ_X_ORIGPTR_3   27
+#define BZ_X_MAPPING_1   28
+#define BZ_X_MAPPING_2   29
+#define BZ_X_SELECTOR_1  30
+#define BZ_X_SELECTOR_2  31
+#define BZ_X_SELECTOR_3  32
+#define BZ_X_CODING_1    33
+#define BZ_X_CODING_2    34
+#define BZ_X_CODING_3    35
+#define BZ_X_MTF_1       36
+#define BZ_X_MTF_2       37
+#define BZ_X_MTF_3       38
+#define BZ_X_MTF_4       39
+#define BZ_X_MTF_5       40
+#define BZ_X_MTF_6       41
+#define BZ_X_ENDHDR_2    42
+#define BZ_X_ENDHDR_3    43
+#define BZ_X_ENDHDR_4    44
+#define BZ_X_ENDHDR_5    45
+#define BZ_X_ENDHDR_6    46
+#define BZ_X_CCRC_1      47
+#define BZ_X_CCRC_2      48
+#define BZ_X_CCRC_3      49
+#define BZ_X_CCRC_4      50
+
+
+
+/*-- Constants for the fast MTF decoder. --*/
+
+#define MTFA_SIZE 4096
+#define MTFL_SIZE 16
+
+
+
+/*-- Structure holding all the decompression-side stuff. --*/
+
+typedef
+   struct {
+      /* pointer back to the struct bz_stream */
+      bz_stream* strm;
+
+      /* state indicator for this stream */
+      Int32    state;
+
+      /* for doing the final run-length decoding */
+      UChar    state_out_ch;
+      Int32    state_out_len;
+      Bool     blockRandomised;
+      BZ_RAND_DECLS;
+
+      /* the buffer for bit stream reading */
+      UInt32   bsBuff;
+      Int32    bsLive;
+
+      /* misc administratium */
+      Int32    blockSize100k;
+      Bool     smallDecompress;
+      Int32    currBlockNo;
+      Int32    verbosity;
+
+      /* for undoing the Burrows-Wheeler transform */
+      Int32    origPtr;
+      UInt32   tPos;
+      Int32    k0;
+      Int32    unzftab[256];
+      Int32    nblock_used;
+      Int32    cftab[257];
+      Int32    cftabCopy[257];
+
+      /* for undoing the Burrows-Wheeler transform (FAST) */
+      UInt32   *tt;
+
+      /* for undoing the Burrows-Wheeler transform (SMALL) */
+      UInt16   *ll16;
+      UChar    *ll4;
+
+      /* stored and calculated CRCs */
+      UInt32   storedBlockCRC;
+      UInt32   storedCombinedCRC;
+      UInt32   calculatedBlockCRC;
+      UInt32   calculatedCombinedCRC;
+
+      /* map of bytes used in block */
+      Int32    nInUse;
+      Bool     inUse[256];
+      Bool     inUse16[16];
+      UChar    seqToUnseq[256];
+
+      /* for decoding the MTF values */
+      UChar    mtfa   [MTFA_SIZE];
+      Int32    mtfbase[256 / MTFL_SIZE];
+      UChar    selector   [BZ_MAX_SELECTORS];
+      UChar    selectorMtf[BZ_MAX_SELECTORS];
+      UChar    len  [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
+
+      Int32    limit  [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
+      Int32    base   [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
+      Int32    perm   [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
+      Int32    minLens[BZ_N_GROUPS];
+
+      /* save area for scalars in the main decompress code */
+      Int32    save_i;
+      Int32    save_j;
+      Int32    save_t;
+      Int32    save_alphaSize;
+      Int32    save_nGroups;
+      Int32    save_nSelectors;
+      Int32    save_EOB;
+      Int32    save_groupNo;
+      Int32    save_groupPos;
+      Int32    save_nextSym;
+      Int32    save_nblockMAX;
+      Int32    save_nblock;
+      Int32    save_es;
+      Int32    save_N;
+      Int32    save_curr;
+      Int32    save_zt;
+      Int32    save_zn; 
+      Int32    save_zvec;
+      Int32    save_zj;
+      Int32    save_gSel;
+      Int32    save_gMinlen;
+      Int32*   save_gLimit;
+      Int32*   save_gBase;
+      Int32*   save_gPerm;
+
+   }
+   DState;
+
+
+
+/*-- Macros for decompression. --*/
+
+#define BZ_GET_FAST(cccc)                     \
+    s->tPos = s->tt[s->tPos];                 \
+    cccc = (UChar)(s->tPos & 0xff);           \
+    s->tPos >>= 8;
+
+#define BZ_GET_FAST_C(cccc)                   \
+    c_tPos = c_tt[c_tPos];                    \
+    cccc = (UChar)(c_tPos & 0xff);            \
+    c_tPos >>= 8;
+
+#define SET_LL4(i,n)                                          \
+   { if (((i) & 0x1) == 0)                                    \
+        s->ll4[(i) >> 1] = (s->ll4[(i) >> 1] & 0xf0) | (n); else    \
+        s->ll4[(i) >> 1] = (s->ll4[(i) >> 1] & 0x0f) | ((n) << 4);  \
+   }
+
+#define GET_LL4(i)                             \
+   ((((UInt32)(s->ll4[(i) >> 1])) >> (((i) << 2) & 0x4)) & 0xF)
+
+#define SET_LL(i,n)                          \
+   { s->ll16[i] = (UInt16)(n & 0x0000ffff);  \
+     SET_LL4(i, n >> 16);                    \
+   }
+
+#define GET_LL(i) \
+   (((UInt32)s->ll16[i]) | (GET_LL4(i) << 16))
+
+#define BZ_GET_SMALL(cccc)                            \
+      cccc = BZ2_indexIntoF ( s->tPos, s->cftab );    \
+      s->tPos = GET_LL(s->tPos);
+
+
+/*-- externs for decompression. --*/
+
+extern Int32 
+BZ2_indexIntoF ( Int32, Int32* );
+
+extern Int32 
+BZ2_decompress ( DState* );
+
+extern void 
+BZ2_hbCreateDecodeTables ( Int32*, Int32*, Int32*, UChar*,
+                           Int32,  Int32, Int32 );
+
+
+#endif
+
+
+/*-- BZ_NO_STDIO seems to make NULL disappear on some platforms. --*/
+
+#ifdef BZ_NO_STDIO
+#ifndef NULL
+#define NULL 0
+#endif
+#endif
+
+
+/*-------------------------------------------------------------*/
+/*--- end                                   bzlib_private.h ---*/
+/*-------------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/bzmore b/updater/bzip2-1.0.3/bzmore
new file mode 100644
index 0000000..d314043
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzmore
@@ -0,0 +1,61 @@
+#!/bin/sh
+
+# Bzmore wrapped for bzip2, 
+# adapted from zmore by Philippe Troin <phil@fifi.org> for Debian GNU/Linux.
+
+PATH="/usr/bin:$PATH"; export PATH
+
+prog=`echo $0 | sed 's|.*/||'`
+case "$prog" in
+	*less)	more=less	;;
+	*)	more=more       ;;
+esac
+
+if test "`echo -n a`" = "-n a"; then
+  # looks like a SysV system:
+  n1=''; n2='\c'
+else
+  n1='-n'; n2=''
+fi
+oldtty=`stty -g 2>/dev/null`
+if stty -cbreak 2>/dev/null; then
+  cb='cbreak'; ncb='-cbreak'
+else
+  # 'stty min 1' resets eof to ^a on both SunOS and SysV!
+  cb='min 1 -icanon'; ncb='icanon eof ^d'
+fi
+if test $? -eq 0 -a -n "$oldtty"; then
+   trap 'stty $oldtty 2>/dev/null; exit' 0 2 3 5 10 13 15
+else
+   trap 'stty $ncb echo 2>/dev/null; exit' 0 2 3 5 10 13 15
+fi
+
+if test $# = 0; then
+    if test -t 0; then
+	echo usage: $prog files...
+    else
+	bzip2 -cdfq | eval $more
+    fi
+else
+    FIRST=1
+    for FILE
+    do
+	if test $FIRST -eq 0; then
+		echo $n1 "--More--(Next file: $FILE)$n2"
+		stty $cb -echo 2>/dev/null
+		ANS=`dd bs=1 count=1 2>/dev/null` 
+		stty $ncb echo 2>/dev/null
+		echo " "
+		if test "$ANS" = 'e' -o "$ANS" = 'q'; then
+			exit
+		fi
+	fi
+	if test "$ANS" != 's'; then
+		echo "------> $FILE <------"
+		bzip2 -cdfq "$FILE" | eval $more
+	fi
+	if test -t; then
+		FIRST=0
+	fi
+    done
+fi
diff --git a/updater/bzip2-1.0.3/bzmore.1 b/updater/bzip2-1.0.3/bzmore.1
new file mode 100644
index 0000000..b437d3b
--- /dev/null
+++ b/updater/bzip2-1.0.3/bzmore.1
@@ -0,0 +1,152 @@
+.\"Shamelessly copied from zmore.1 by Philippe Troin <phil@fifi.org>
+.\"for Debian GNU/Linux
+.TH BZMORE 1
+.SH NAME
+bzmore, bzless \- file perusal filter for crt viewing of bzip2 compressed text
+.SH SYNOPSIS
+.B bzmore
+[ name ...  ]
+.br
+.B bzless
+[ name ...  ]
+.SH NOTE
+In the following description,
+.I bzless
+and
+.I less
+can be used interchangeably with
+.I bzmore
+and
+.I more.
+.SH DESCRIPTION
+.I  Bzmore
+is a filter which allows examination of compressed or plain text files
+one screenful at a time on a soft-copy terminal.
+.I bzmore
+works on files compressed with
+.I bzip2
+and also on uncompressed files.
+If a file does not exist,
+.I bzmore
+looks for a file of the same name with the addition of a .bz2 suffix.
+.PP
+.I Bzmore
+normally pauses after each screenful, printing --More--
+at the bottom of the screen.
+If the user then types a carriage return, one more line is displayed.
+If the user hits a space,
+another screenful is displayed.  Other possibilities are enumerated later.
+.PP
+.I Bzmore
+looks in the file
+.I /etc/termcap
+to determine terminal characteristics,
+and to determine the default window size.
+On a terminal capable of displaying 24 lines,
+the default window size is 22 lines.
+Other sequences which may be typed when
+.I bzmore
+pauses, and their effects, are as follows (\fIi\fP is an optional integer
+argument, defaulting to 1) :
+.PP
+.IP \fIi\|\fP<space>
+display
+.I i
+more lines, (or another screenful if no argument is given)
+.PP
+.IP ^D
+display 11 more lines (a ``scroll'').
+If
+.I i
+is given, then the scroll size is set to \fIi\|\fP.
+.PP
+.IP d
+same as ^D (control-D)
+.PP
+.IP \fIi\|\fPz
+same as typing a space except that \fIi\|\fP, if present, becomes the new
+window size.  Note that the window size reverts back to the default at the
+end of the current file.
+.PP
+.IP \fIi\|\fPs
+skip \fIi\|\fP lines and print a screenful of lines
+.PP
+.IP \fIi\|\fPf
+skip \fIi\fP screenfuls and print a screenful of lines
+.PP
+.IP "q or Q"
+quit reading the current file; go on to the next (if any)
+.PP
+.IP "e or q"
+When the prompt --More--(Next file: 
+.IR file )
+is printed, this command causes bzmore to exit.
+.PP
+.IP s
+When the prompt --More--(Next file: 
+.IR file )
+is printed, this command causes bzmore to skip the next file and continue.
+.PP 
+.IP =
+Display the current line number.
+.PP
+.IP \fIi\|\fP/expr
+search for the \fIi\|\fP-th occurrence of the regular expression \fIexpr.\fP
+If the pattern is not found,
+.I bzmore
+goes on to the next file (if any).
+Otherwise, a screenful is displayed, starting two lines before the place
+where the expression was found.
+The user's erase and kill characters may be used to edit the regular
+expression.
+Erasing back past the first column cancels the search command.
+.PP
+.IP \fIi\|\fPn
+search for the \fIi\|\fP-th occurrence of the last regular expression entered.
+.PP
+.IP !command
+invoke a shell with \fIcommand\|\fP. 
+The character `!' in "command" are replaced with the
+previous shell command.  The sequence "\\!" is replaced by "!".
+.PP
+.IP ":q or :Q"
+quit reading the current file; go on to the next (if any)
+(same as q or Q).
+.PP
+.IP .
+(dot) repeat the previous command.
+.PP
+The commands take effect immediately, i.e., it is not necessary to
+type a carriage return.
+Up to the time when the command character itself is given,
+the user may hit the line kill character to cancel the numerical
+argument being formed.
+In addition, the user may hit the erase character to redisplay the
+--More-- message.
+.PP
+At any time when output is being sent to the terminal, the user can
+hit the quit key (normally control\-\\).
+.I Bzmore
+will stop sending output, and will display the usual --More--
+prompt.
+The user may then enter one of the above commands in the normal manner.
+Unfortunately, some output is lost when this is done, due to the
+fact that any characters waiting in the terminal's output queue
+are flushed when the quit signal occurs.
+.PP
+The terminal is set to
+.I noecho
+mode by this program so that the output can be continuous.
+What you type will thus not show on your terminal, except for the / and !
+commands.
+.PP
+If the standard output is not a teletype, then
+.I bzmore
+acts just like
+.I bzcat,
+except that a header is printed before each file.
+.SH FILES
+.DT
+/etc/termcap		Terminal data base
+.SH "SEE ALSO"
+more(1), less(1), bzip2(1), bzdiff(1), bzgrep(1)
diff --git a/updater/bzip2-1.0.3/compress.c b/updater/bzip2-1.0.3/compress.c
new file mode 100644
index 0000000..7e0c291
--- /dev/null
+++ b/updater/bzip2-1.0.3/compress.c
@@ -0,0 +1,716 @@
+
+/*-------------------------------------------------------------*/
+/*--- Compression machinery (not incl block sorting)        ---*/
+/*---                                            compress.c ---*/
+/*-------------------------------------------------------------*/
+
+/*--
+  This file is a part of bzip2 and/or libbzip2, a program and
+  library for lossless, block-sorting data compression.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0 of 21 March 2000
+
+  This program is based on (at least) the work of:
+     Mike Burrows
+     David Wheeler
+     Peter Fenwick
+     Alistair Moffat
+     Radford Neal
+     Ian H. Witten
+     Robert Sedgewick
+     Jon L. Bentley
+
+  For more information on these sources, see the manual.
+--*/
+
+/*--
+   CHANGES
+   ~~~~~~~
+   0.9.0 -- original version.
+
+   0.9.0a/b -- no changes in this file.
+
+   0.9.0c
+      * changed setting of nGroups in sendMTFValues() so as to 
+        do a bit better on small files
+--*/
+
+#include "bzlib_private.h"
+
+
+/*---------------------------------------------------*/
+/*--- Bit stream I/O                              ---*/
+/*---------------------------------------------------*/
+
+/*---------------------------------------------------*/
+void BZ2_bsInitWrite ( EState* s )
+{
+   s->bsLive = 0;
+   s->bsBuff = 0;
+}
+
+
+/*---------------------------------------------------*/
+static
+void bsFinishWrite ( EState* s )
+{
+   while (s->bsLive > 0) {
+      s->zbits[s->numZ] = (UChar)(s->bsBuff >> 24);
+      s->numZ++;
+      s->bsBuff <<= 8;
+      s->bsLive -= 8;
+   }
+}
+
+
+/*---------------------------------------------------*/
+#define bsNEEDW(nz)                           \
+{                                             \
+   while (s->bsLive >= 8) {                   \
+      s->zbits[s->numZ]                       \
+         = (UChar)(s->bsBuff >> 24);          \
+      s->numZ++;                              \
+      s->bsBuff <<= 8;                        \
+      s->bsLive -= 8;                         \
+   }                                          \
+}
+
+
+/*---------------------------------------------------*/
+static
+__inline__
+void bsW ( EState* s, Int32 n, UInt32 v )
+{
+   bsNEEDW ( n );
+   s->bsBuff |= (v << (32 - s->bsLive - n));
+   s->bsLive += n;
+}
+
+
+/*---------------------------------------------------*/
+static
+void bsPutUInt32 ( EState* s, UInt32 u )
+{
+   bsW ( s, 8, (u >> 24) & 0xffL );
+   bsW ( s, 8, (u >> 16) & 0xffL );
+   bsW ( s, 8, (u >>  8) & 0xffL );
+   bsW ( s, 8,  u        & 0xffL );
+}
+
+
+/*---------------------------------------------------*/
+static
+void bsPutUChar ( EState* s, UChar c )
+{
+   bsW( s, 8, (UInt32)c );
+}
+
+
+/*---------------------------------------------------*/
+/*--- The back end proper                         ---*/
+/*---------------------------------------------------*/
+
+/*---------------------------------------------------*/
+static
+void makeMaps_e ( EState* s )
+{
+   Int32 i;
+   s->nInUse = 0;
+   for (i = 0; i < 256; i++)
+      if (s->inUse[i]) {
+         s->unseqToSeq[i] = s->nInUse;
+         s->nInUse++;
+      }
+}
+
+
+/*---------------------------------------------------*/
+static
+void generateMTFValues ( EState* s )
+{
+   UChar   yy[256];
+   Int32   i, j;
+   Int32   zPend;
+   Int32   wr;
+   Int32   EOB;
+
+   /* 
+      After sorting (eg, here),
+         s->arr1 [ 0 .. s->nblock-1 ] holds sorted order,
+         and
+         ((UChar*)s->arr2) [ 0 .. s->nblock-1 ] 
+         holds the original block data.
+
+      The first thing to do is generate the MTF values,
+      and put them in
+         ((UInt16*)s->arr1) [ 0 .. s->nblock-1 ].
+      Because there are strictly fewer or equal MTF values
+      than block values, ptr values in this area are overwritten
+      with MTF values only when they are no longer needed.
+
+      The final compressed bitstream is generated into the
+      area starting at
+         (UChar*) (&((UChar*)s->arr2)[s->nblock])
+
+      These storage aliases are set up in bzCompressInit(),
+      except for the last one, which is arranged in 
+      compressBlock().
+   */
+   UInt32* ptr   = s->ptr;
+   UChar* block  = s->block;
+   UInt16* mtfv  = s->mtfv;
+
+   makeMaps_e ( s );
+   EOB = s->nInUse+1;
+
+   for (i = 0; i <= EOB; i++) s->mtfFreq[i] = 0;
+
+   wr = 0;
+   zPend = 0;
+   for (i = 0; i < s->nInUse; i++) yy[i] = (UChar) i;
+
+   for (i = 0; i < s->nblock; i++) {
+      UChar ll_i;
+      AssertD ( wr <= i, "generateMTFValues(1)" );
+      j = ptr[i]-1; if (j < 0) j += s->nblock;
+      ll_i = s->unseqToSeq[block[j]];
+      AssertD ( ll_i < s->nInUse, "generateMTFValues(2a)" );
+
+      if (yy[0] == ll_i) { 
+         zPend++;
+      } else {
+
+         if (zPend > 0) {
+            zPend--;
+            while (True) {
+               if (zPend & 1) {
+                  mtfv[wr] = BZ_RUNB; wr++; 
+                  s->mtfFreq[BZ_RUNB]++; 
+               } else {
+                  mtfv[wr] = BZ_RUNA; wr++; 
+                  s->mtfFreq[BZ_RUNA]++; 
+               }
+               if (zPend < 2) break;
+               zPend = (zPend - 2) / 2;
+            };
+            zPend = 0;
+         }
+         {
+            register UChar  rtmp;
+            register UChar* ryy_j;
+            register UChar  rll_i;
+            rtmp  = yy[1];
+            yy[1] = yy[0];
+            ryy_j = &(yy[1]);
+            rll_i = ll_i;
+            while ( rll_i != rtmp ) {
+               register UChar rtmp2;
+               ryy_j++;
+               rtmp2  = rtmp;
+               rtmp   = *ryy_j;
+               *ryy_j = rtmp2;
+            };
+            yy[0] = rtmp;
+            j = ryy_j - &(yy[0]);
+            mtfv[wr] = j+1; wr++; s->mtfFreq[j+1]++;
+         }
+
+      }
+   }
+
+   if (zPend > 0) {
+      zPend--;
+      while (True) {
+         if (zPend & 1) {
+            mtfv[wr] = BZ_RUNB; wr++; 
+            s->mtfFreq[BZ_RUNB]++; 
+         } else {
+            mtfv[wr] = BZ_RUNA; wr++; 
+            s->mtfFreq[BZ_RUNA]++; 
+         }
+         if (zPend < 2) break;
+         zPend = (zPend - 2) / 2;
+      };
+      zPend = 0;
+   }
+
+   mtfv[wr] = EOB; wr++; s->mtfFreq[EOB]++;
+
+   s->nMTF = wr;
+}
+
+
+/*---------------------------------------------------*/
+#define BZ_LESSER_ICOST  0
+#define BZ_GREATER_ICOST 15
+
+static
+void sendMTFValues ( EState* s )
+{
+   Int32 v, t, i, j, gs, ge, totc, bt, bc, iter;
+   Int32 nSelectors, alphaSize, minLen, maxLen, selCtr;
+   Int32 nGroups, nBytes;
+
+   /*--
+   UChar  len [BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
+   is a global since the decoder also needs it.
+
+   Int32  code[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
+   Int32  rfreq[BZ_N_GROUPS][BZ_MAX_ALPHA_SIZE];
+   are also globals only used in this proc.
+   Made global to keep stack frame size small.
+   --*/
+
+
+   UInt16 cost[BZ_N_GROUPS];
+   Int32  fave[BZ_N_GROUPS];
+
+   UInt16* mtfv = s->mtfv;
+
+   if (s->verbosity >= 3)
+      VPrintf3( "      %d in block, %d after MTF & 1-2 coding, "
+                "%d+2 syms in use\n", 
+                s->nblock, s->nMTF, s->nInUse );
+
+   alphaSize = s->nInUse+2;
+   for (t = 0; t < BZ_N_GROUPS; t++)
+      for (v = 0; v < alphaSize; v++)
+         s->len[t][v] = BZ_GREATER_ICOST;
+
+   /*--- Decide how many coding tables to use ---*/
+   AssertH ( s->nMTF > 0, 3001 );
+   if (s->nMTF < 200)  nGroups = 2; else
+   if (s->nMTF < 600)  nGroups = 3; else
+   if (s->nMTF < 1200) nGroups = 4; else
+   if (s->nMTF < 2400) nGroups = 5; else
+                       nGroups = 6;
+
+   /*--- Generate an initial set of coding tables ---*/
+   { 
+      Int32 nPart, remF, tFreq, aFreq;
+
+      nPart = nGroups;
+      remF  = s->nMTF;
+      gs = 0;
+      while (nPart > 0) {
+         tFreq = remF / nPart;
+         ge = gs-1;
+         aFreq = 0;
+         while (aFreq < tFreq && ge < alphaSize-1) {
+            ge++;
+            aFreq += s->mtfFreq[ge];
+         }
+
+         if (ge > gs 
+             && nPart != nGroups && nPart != 1 
+             && ((nGroups-nPart) % 2 == 1)) {
+            aFreq -= s->mtfFreq[ge];
+            ge--;
+         }
+
+         if (s->verbosity >= 3)
+            VPrintf5( "      initial group %d, [%d .. %d], "
+                      "has %d syms (%4.1f%%)\n",
+                      nPart, gs, ge, aFreq, 
+                      (100.0 * (float)aFreq) / (float)(s->nMTF) );
+ 
+         for (v = 0; v < alphaSize; v++)
+            if (v >= gs && v <= ge) 
+               s->len[nPart-1][v] = BZ_LESSER_ICOST; else
+               s->len[nPart-1][v] = BZ_GREATER_ICOST;
+ 
+         nPart--;
+         gs = ge+1;
+         remF -= aFreq;
+      }
+   }
+
+   /*--- 
+      Iterate up to BZ_N_ITERS times to improve the tables.
+   ---*/
+   for (iter = 0; iter < BZ_N_ITERS; iter++) {
+
+      for (t = 0; t < nGroups; t++) fave[t] = 0;
+
+      for (t = 0; t < nGroups; t++)
+         for (v = 0; v < alphaSize; v++)
+            s->rfreq[t][v] = 0;
+
+      /*---
+        Set up an auxiliary length table which is used to fast-track
+	the common case (nGroups == 6). 
+      ---*/
+      if (nGroups == 6) {
+         for (v = 0; v < alphaSize; v++) {
+            s->len_pack[v][0] = (s->len[1][v] << 16) | s->len[0][v];
+            s->len_pack[v][1] = (s->len[3][v] << 16) | s->len[2][v];
+            s->len_pack[v][2] = (s->len[5][v] << 16) | s->len[4][v];
+	 }
+      }
+
+      nSelectors = 0;
+      totc = 0;
+      gs = 0;
+      while (True) {
+
+         /*--- Set group start & end marks. --*/
+         if (gs >= s->nMTF) break;
+         ge = gs + BZ_G_SIZE - 1; 
+         if (ge >= s->nMTF) ge = s->nMTF-1;
+
+         /*-- 
+            Calculate the cost of this group as coded
+            by each of the coding tables.
+         --*/
+         for (t = 0; t < nGroups; t++) cost[t] = 0;
+
+         if (nGroups == 6 && 50 == ge-gs+1) {
+            /*--- fast track the common case ---*/
+            register UInt32 cost01, cost23, cost45;
+            register UInt16 icv;
+            cost01 = cost23 = cost45 = 0;
+
+#           define BZ_ITER(nn)                \
+               icv = mtfv[gs+(nn)];           \
+               cost01 += s->len_pack[icv][0]; \
+               cost23 += s->len_pack[icv][1]; \
+               cost45 += s->len_pack[icv][2]; \
+
+            BZ_ITER(0);  BZ_ITER(1);  BZ_ITER(2);  BZ_ITER(3);  BZ_ITER(4);
+            BZ_ITER(5);  BZ_ITER(6);  BZ_ITER(7);  BZ_ITER(8);  BZ_ITER(9);
+            BZ_ITER(10); BZ_ITER(11); BZ_ITER(12); BZ_ITER(13); BZ_ITER(14);
+            BZ_ITER(15); BZ_ITER(16); BZ_ITER(17); BZ_ITER(18); BZ_ITER(19);
+            BZ_ITER(20); BZ_ITER(21); BZ_ITER(22); BZ_ITER(23); BZ_ITER(24);
+            BZ_ITER(25); BZ_ITER(26); BZ_ITER(27); BZ_ITER(28); BZ_ITER(29);
+            BZ_ITER(30); BZ_ITER(31); BZ_ITER(32); BZ_ITER(33); BZ_ITER(34);
+            BZ_ITER(35); BZ_ITER(36); BZ_ITER(37); BZ_ITER(38); BZ_ITER(39);
+            BZ_ITER(40); BZ_ITER(41); BZ_ITER(42); BZ_ITER(43); BZ_ITER(44);
+            BZ_ITER(45); BZ_ITER(46); BZ_ITER(47); BZ_ITER(48); BZ_ITER(49);
+
+#           undef BZ_ITER
+
+            cost[0] = cost01 & 0xffff; cost[1] = cost01 >> 16;
+            cost[2] = cost23 & 0xffff; cost[3] = cost23 >> 16;
+            cost[4] = cost45 & 0xffff; cost[5] = cost45 >> 16;
+
+         } else {
+	    /*--- slow version which correctly handles all situations ---*/
+            for (i = gs; i <= ge; i++) { 
+               UInt16 icv = mtfv[i];
+               for (t = 0; t < nGroups; t++) cost[t] += s->len[t][icv];
+            }
+         }
+ 
+         /*-- 
+            Find the coding table which is best for this group,
+            and record its identity in the selector table.
+         --*/
+         bc = 999999999; bt = -1;
+         for (t = 0; t < nGroups; t++)
+            if (cost[t] < bc) { bc = cost[t]; bt = t; };
+         totc += bc;
+         fave[bt]++;
+         s->selector[nSelectors] = bt;
+         nSelectors++;
+
+         /*-- 
+            Increment the symbol frequencies for the selected table.
+          --*/
+         if (nGroups == 6 && 50 == ge-gs+1) {
+            /*--- fast track the common case ---*/
+
+#           define BZ_ITUR(nn) s->rfreq[bt][ mtfv[gs+(nn)] ]++
+
+            BZ_ITUR(0);  BZ_ITUR(1);  BZ_ITUR(2);  BZ_ITUR(3);  BZ_ITUR(4);
+            BZ_ITUR(5);  BZ_ITUR(6);  BZ_ITUR(7);  BZ_ITUR(8);  BZ_ITUR(9);
+            BZ_ITUR(10); BZ_ITUR(11); BZ_ITUR(12); BZ_ITUR(13); BZ_ITUR(14);
+            BZ_ITUR(15); BZ_ITUR(16); BZ_ITUR(17); BZ_ITUR(18); BZ_ITUR(19);
+            BZ_ITUR(20); BZ_ITUR(21); BZ_ITUR(22); BZ_ITUR(23); BZ_ITUR(24);
+            BZ_ITUR(25); BZ_ITUR(26); BZ_ITUR(27); BZ_ITUR(28); BZ_ITUR(29);
+            BZ_ITUR(30); BZ_ITUR(31); BZ_ITUR(32); BZ_ITUR(33); BZ_ITUR(34);
+            BZ_ITUR(35); BZ_ITUR(36); BZ_ITUR(37); BZ_ITUR(38); BZ_ITUR(39);
+            BZ_ITUR(40); BZ_ITUR(41); BZ_ITUR(42); BZ_ITUR(43); BZ_ITUR(44);
+            BZ_ITUR(45); BZ_ITUR(46); BZ_ITUR(47); BZ_ITUR(48); BZ_ITUR(49);
+
+#           undef BZ_ITUR
+
+         } else {
+	    /*--- slow version which correctly handles all situations ---*/
+            for (i = gs; i <= ge; i++)
+               s->rfreq[bt][ mtfv[i] ]++;
+         }
+
+         gs = ge+1;
+      }
+      if (s->verbosity >= 3) {
+         VPrintf2 ( "      pass %d: size is %d, grp uses are ", 
+                   iter+1, totc/8 );
+         for (t = 0; t < nGroups; t++)
+            VPrintf1 ( "%d ", fave[t] );
+         VPrintf0 ( "\n" );
+      }
+
+      /*--
+        Recompute the tables based on the accumulated frequencies.
+      --*/
+      /* maxLen was changed from 20 to 17 in bzip2-1.0.3.  See 
+         comment in huffman.c for details. */
+      for (t = 0; t < nGroups; t++)
+         BZ2_hbMakeCodeLengths ( &(s->len[t][0]), &(s->rfreq[t][0]), 
+                                 alphaSize, 17 /*20*/ );
+   }
+
+
+   AssertH( nGroups < 8, 3002 );
+   AssertH( nSelectors < 32768 &&
+            nSelectors <= (2 + (900000 / BZ_G_SIZE)),
+            3003 );
+
+
+   /*--- Compute MTF values for the selectors. ---*/
+   {
+      UChar pos[BZ_N_GROUPS], ll_i, tmp2, tmp;
+      for (i = 0; i < nGroups; i++) pos[i] = i;
+      for (i = 0; i < nSelectors; i++) {
+         ll_i = s->selector[i];
+         j = 0;
+         tmp = pos[j];
+         while ( ll_i != tmp ) {
+            j++;
+            tmp2 = tmp;
+            tmp = pos[j];
+            pos[j] = tmp2;
+         };
+         pos[0] = tmp;
+         s->selectorMtf[i] = j;
+      }
+   };
+
+   /*--- Assign actual codes for the tables. --*/
+   for (t = 0; t < nGroups; t++) {
+      minLen = 32;
+      maxLen = 0;
+      for (i = 0; i < alphaSize; i++) {
+         if (s->len[t][i] > maxLen) maxLen = s->len[t][i];
+         if (s->len[t][i] < minLen) minLen = s->len[t][i];
+      }
+      AssertH ( !(maxLen > 17 /*20*/ ), 3004 );
+      AssertH ( !(minLen < 1),  3005 );
+      BZ2_hbAssignCodes ( &(s->code[t][0]), &(s->len[t][0]), 
+                          minLen, maxLen, alphaSize );
+   }
+
+   /*--- Transmit the mapping table. ---*/
+   { 
+      Bool inUse16[16];
+      for (i = 0; i < 16; i++) {
+          inUse16[i] = False;
+          for (j = 0; j < 16; j++)
+             if (s->inUse[i * 16 + j]) inUse16[i] = True;
+      }
+     
+      nBytes = s->numZ;
+      for (i = 0; i < 16; i++)
+         if (inUse16[i]) bsW(s,1,1); else bsW(s,1,0);
+
+      for (i = 0; i < 16; i++)
+         if (inUse16[i])
+            for (j = 0; j < 16; j++) {
+               if (s->inUse[i * 16 + j]) bsW(s,1,1); else bsW(s,1,0);
+            }
+
+      if (s->verbosity >= 3) 
+         VPrintf1( "      bytes: mapping %d, ", s->numZ-nBytes );
+   }
+
+   /*--- Now the selectors. ---*/
+   nBytes = s->numZ;
+   bsW ( s, 3, nGroups );
+   bsW ( s, 15, nSelectors );
+   for (i = 0; i < nSelectors; i++) { 
+      for (j = 0; j < s->selectorMtf[i]; j++) bsW(s,1,1);
+      bsW(s,1,0);
+   }
+   if (s->verbosity >= 3)
+      VPrintf1( "selectors %d, ", s->numZ-nBytes );
+
+   /*--- Now the coding tables. ---*/
+   nBytes = s->numZ;
+
+   for (t = 0; t < nGroups; t++) {
+      Int32 curr = s->len[t][0];
+      bsW ( s, 5, curr );
+      for (i = 0; i < alphaSize; i++) {
+         while (curr < s->len[t][i]) { bsW(s,2,2); curr++; /* 10 */ };
+         while (curr > s->len[t][i]) { bsW(s,2,3); curr--; /* 11 */ };
+         bsW ( s, 1, 0 );
+      }
+   }
+
+   if (s->verbosity >= 3)
+      VPrintf1 ( "code lengths %d, ", s->numZ-nBytes );
+
+   /*--- And finally, the block data proper ---*/
+   nBytes = s->numZ;
+   selCtr = 0;
+   gs = 0;
+   while (True) {
+      if (gs >= s->nMTF) break;
+      ge = gs + BZ_G_SIZE - 1; 
+      if (ge >= s->nMTF) ge = s->nMTF-1;
+      AssertH ( s->selector[selCtr] < nGroups, 3006 );
+
+      if (nGroups == 6 && 50 == ge-gs+1) {
+            /*--- fast track the common case ---*/
+            UInt16 mtfv_i;
+            UChar* s_len_sel_selCtr 
+               = &(s->len[s->selector[selCtr]][0]);
+            Int32* s_code_sel_selCtr
+               = &(s->code[s->selector[selCtr]][0]);
+
+#           define BZ_ITAH(nn)                      \
+               mtfv_i = mtfv[gs+(nn)];              \
+               bsW ( s,                             \
+                     s_len_sel_selCtr[mtfv_i],      \
+                     s_code_sel_selCtr[mtfv_i] )
+
+            BZ_ITAH(0);  BZ_ITAH(1);  BZ_ITAH(2);  BZ_ITAH(3);  BZ_ITAH(4);
+            BZ_ITAH(5);  BZ_ITAH(6);  BZ_ITAH(7);  BZ_ITAH(8);  BZ_ITAH(9);
+            BZ_ITAH(10); BZ_ITAH(11); BZ_ITAH(12); BZ_ITAH(13); BZ_ITAH(14);
+            BZ_ITAH(15); BZ_ITAH(16); BZ_ITAH(17); BZ_ITAH(18); BZ_ITAH(19);
+            BZ_ITAH(20); BZ_ITAH(21); BZ_ITAH(22); BZ_ITAH(23); BZ_ITAH(24);
+            BZ_ITAH(25); BZ_ITAH(26); BZ_ITAH(27); BZ_ITAH(28); BZ_ITAH(29);
+            BZ_ITAH(30); BZ_ITAH(31); BZ_ITAH(32); BZ_ITAH(33); BZ_ITAH(34);
+            BZ_ITAH(35); BZ_ITAH(36); BZ_ITAH(37); BZ_ITAH(38); BZ_ITAH(39);
+            BZ_ITAH(40); BZ_ITAH(41); BZ_ITAH(42); BZ_ITAH(43); BZ_ITAH(44);
+            BZ_ITAH(45); BZ_ITAH(46); BZ_ITAH(47); BZ_ITAH(48); BZ_ITAH(49);
+
+#           undef BZ_ITAH
+
+      } else {
+	 /*--- slow version which correctly handles all situations ---*/
+         for (i = gs; i <= ge; i++) {
+            bsW ( s, 
+                  s->len  [s->selector[selCtr]] [mtfv[i]],
+                  s->code [s->selector[selCtr]] [mtfv[i]] );
+         }
+      }
+
+
+      gs = ge+1;
+      selCtr++;
+   }
+   AssertH( selCtr == nSelectors, 3007 );
+
+   if (s->verbosity >= 3)
+      VPrintf1( "codes %d\n", s->numZ-nBytes );
+}
+
+
+/*---------------------------------------------------*/
+void BZ2_compressBlock ( EState* s, Bool is_last_block )
+{
+   if (s->nblock > 0) {
+
+      BZ_FINALISE_CRC ( s->blockCRC );
+      s->combinedCRC = (s->combinedCRC << 1) | (s->combinedCRC >> 31);
+      s->combinedCRC ^= s->blockCRC;
+      if (s->blockNo > 1) s->numZ = 0;
+
+      if (s->verbosity >= 2)
+         VPrintf4( "    block %d: crc = 0x%08x, "
+                   "combined CRC = 0x%08x, size = %d\n",
+                   s->blockNo, s->blockCRC, s->combinedCRC, s->nblock );
+
+      BZ2_blockSort ( s );
+   }
+
+   s->zbits = (UChar*) (&((UChar*)s->arr2)[s->nblock]);
+
+   /*-- If this is the first block, create the stream header. --*/
+   if (s->blockNo == 1) {
+      BZ2_bsInitWrite ( s );
+      bsPutUChar ( s, BZ_HDR_B );
+      bsPutUChar ( s, BZ_HDR_Z );
+      bsPutUChar ( s, BZ_HDR_h );
+      bsPutUChar ( s, (UChar)(BZ_HDR_0 + s->blockSize100k) );
+   }
+
+   if (s->nblock > 0) {
+
+      bsPutUChar ( s, 0x31 ); bsPutUChar ( s, 0x41 );
+      bsPutUChar ( s, 0x59 ); bsPutUChar ( s, 0x26 );
+      bsPutUChar ( s, 0x53 ); bsPutUChar ( s, 0x59 );
+
+      /*-- Now the block's CRC, so it is in a known place. --*/
+      bsPutUInt32 ( s, s->blockCRC );
+
+      /*-- 
+         Now a single bit indicating (non-)randomisation. 
+         As of version 0.9.5, we use a better sorting algorithm
+         which makes randomisation unnecessary.  So always set
+         the randomised bit to 'no'.  Of course, the decoder
+         still needs to be able to handle randomised blocks
+         so as to maintain backwards compatibility with
+         older versions of bzip2.
+      --*/
+      bsW(s,1,0);
+
+      bsW ( s, 24, s->origPtr );
+      generateMTFValues ( s );
+      sendMTFValues ( s );
+   }
+
+
+   /*-- If this is the last block, add the stream trailer. --*/
+   if (is_last_block) {
+
+      bsPutUChar ( s, 0x17 ); bsPutUChar ( s, 0x72 );
+      bsPutUChar ( s, 0x45 ); bsPutUChar ( s, 0x38 );
+      bsPutUChar ( s, 0x50 ); bsPutUChar ( s, 0x90 );
+      bsPutUInt32 ( s, s->combinedCRC );
+      if (s->verbosity >= 2)
+         VPrintf1( "    final combined CRC = 0x%08x\n   ", s->combinedCRC );
+      bsFinishWrite ( s );
+   }
+}
+
+
+/*-------------------------------------------------------------*/
+/*--- end                                        compress.c ---*/
+/*-------------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/crctable.c b/updater/bzip2-1.0.3/crctable.c
new file mode 100644
index 0000000..b6dadfc
--- /dev/null
+++ b/updater/bzip2-1.0.3/crctable.c
@@ -0,0 +1,144 @@
+
+/*-------------------------------------------------------------*/
+/*--- Table for doing CRCs                                  ---*/
+/*---                                            crctable.c ---*/
+/*-------------------------------------------------------------*/
+
+/*--
+  This file is a part of bzip2 and/or libbzip2, a program and
+  library for lossless, block-sorting data compression.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0 of 21 March 2000
+
+  This program is based on (at least) the work of:
+     Mike Burrows
+     David Wheeler
+     Peter Fenwick
+     Alistair Moffat
+     Radford Neal
+     Ian H. Witten
+     Robert Sedgewick
+     Jon L. Bentley
+
+  For more information on these sources, see the manual.
+--*/
+
+
+#include "bzlib_private.h"
+
+/*--
+  I think this is an implementation of the AUTODIN-II,
+  Ethernet & FDDI 32-bit CRC standard.  Vaguely derived
+  from code by Rob Warnock, in Section 51 of the
+  comp.compression FAQ.
+--*/
+
+UInt32 BZ2_crc32Table[256] = {
+
+   /*-- Ugly, innit? --*/
+
+   0x00000000L, 0x04c11db7L, 0x09823b6eL, 0x0d4326d9L,
+   0x130476dcL, 0x17c56b6bL, 0x1a864db2L, 0x1e475005L,
+   0x2608edb8L, 0x22c9f00fL, 0x2f8ad6d6L, 0x2b4bcb61L,
+   0x350c9b64L, 0x31cd86d3L, 0x3c8ea00aL, 0x384fbdbdL,
+   0x4c11db70L, 0x48d0c6c7L, 0x4593e01eL, 0x4152fda9L,
+   0x5f15adacL, 0x5bd4b01bL, 0x569796c2L, 0x52568b75L,
+   0x6a1936c8L, 0x6ed82b7fL, 0x639b0da6L, 0x675a1011L,
+   0x791d4014L, 0x7ddc5da3L, 0x709f7b7aL, 0x745e66cdL,
+   0x9823b6e0L, 0x9ce2ab57L, 0x91a18d8eL, 0x95609039L,
+   0x8b27c03cL, 0x8fe6dd8bL, 0x82a5fb52L, 0x8664e6e5L,
+   0xbe2b5b58L, 0xbaea46efL, 0xb7a96036L, 0xb3687d81L,
+   0xad2f2d84L, 0xa9ee3033L, 0xa4ad16eaL, 0xa06c0b5dL,
+   0xd4326d90L, 0xd0f37027L, 0xddb056feL, 0xd9714b49L,
+   0xc7361b4cL, 0xc3f706fbL, 0xceb42022L, 0xca753d95L,
+   0xf23a8028L, 0xf6fb9d9fL, 0xfbb8bb46L, 0xff79a6f1L,
+   0xe13ef6f4L, 0xe5ffeb43L, 0xe8bccd9aL, 0xec7dd02dL,
+   0x34867077L, 0x30476dc0L, 0x3d044b19L, 0x39c556aeL,
+   0x278206abL, 0x23431b1cL, 0x2e003dc5L, 0x2ac12072L,
+   0x128e9dcfL, 0x164f8078L, 0x1b0ca6a1L, 0x1fcdbb16L,
+   0x018aeb13L, 0x054bf6a4L, 0x0808d07dL, 0x0cc9cdcaL,
+   0x7897ab07L, 0x7c56b6b0L, 0x71159069L, 0x75d48ddeL,
+   0x6b93dddbL, 0x6f52c06cL, 0x6211e6b5L, 0x66d0fb02L,
+   0x5e9f46bfL, 0x5a5e5b08L, 0x571d7dd1L, 0x53dc6066L,
+   0x4d9b3063L, 0x495a2dd4L, 0x44190b0dL, 0x40d816baL,
+   0xaca5c697L, 0xa864db20L, 0xa527fdf9L, 0xa1e6e04eL,
+   0xbfa1b04bL, 0xbb60adfcL, 0xb6238b25L, 0xb2e29692L,
+   0x8aad2b2fL, 0x8e6c3698L, 0x832f1041L, 0x87ee0df6L,
+   0x99a95df3L, 0x9d684044L, 0x902b669dL, 0x94ea7b2aL,
+   0xe0b41de7L, 0xe4750050L, 0xe9362689L, 0xedf73b3eL,
+   0xf3b06b3bL, 0xf771768cL, 0xfa325055L, 0xfef34de2L,
+   0xc6bcf05fL, 0xc27dede8L, 0xcf3ecb31L, 0xcbffd686L,
+   0xd5b88683L, 0xd1799b34L, 0xdc3abdedL, 0xd8fba05aL,
+   0x690ce0eeL, 0x6dcdfd59L, 0x608edb80L, 0x644fc637L,
+   0x7a089632L, 0x7ec98b85L, 0x738aad5cL, 0x774bb0ebL,
+   0x4f040d56L, 0x4bc510e1L, 0x46863638L, 0x42472b8fL,
+   0x5c007b8aL, 0x58c1663dL, 0x558240e4L, 0x51435d53L,
+   0x251d3b9eL, 0x21dc2629L, 0x2c9f00f0L, 0x285e1d47L,
+   0x36194d42L, 0x32d850f5L, 0x3f9b762cL, 0x3b5a6b9bL,
+   0x0315d626L, 0x07d4cb91L, 0x0a97ed48L, 0x0e56f0ffL,
+   0x1011a0faL, 0x14d0bd4dL, 0x19939b94L, 0x1d528623L,
+   0xf12f560eL, 0xf5ee4bb9L, 0xf8ad6d60L, 0xfc6c70d7L,
+   0xe22b20d2L, 0xe6ea3d65L, 0xeba91bbcL, 0xef68060bL,
+   0xd727bbb6L, 0xd3e6a601L, 0xdea580d8L, 0xda649d6fL,
+   0xc423cd6aL, 0xc0e2d0ddL, 0xcda1f604L, 0xc960ebb3L,
+   0xbd3e8d7eL, 0xb9ff90c9L, 0xb4bcb610L, 0xb07daba7L,
+   0xae3afba2L, 0xaafbe615L, 0xa7b8c0ccL, 0xa379dd7bL,
+   0x9b3660c6L, 0x9ff77d71L, 0x92b45ba8L, 0x9675461fL,
+   0x8832161aL, 0x8cf30badL, 0x81b02d74L, 0x857130c3L,
+   0x5d8a9099L, 0x594b8d2eL, 0x5408abf7L, 0x50c9b640L,
+   0x4e8ee645L, 0x4a4ffbf2L, 0x470cdd2bL, 0x43cdc09cL,
+   0x7b827d21L, 0x7f436096L, 0x7200464fL, 0x76c15bf8L,
+   0x68860bfdL, 0x6c47164aL, 0x61043093L, 0x65c52d24L,
+   0x119b4be9L, 0x155a565eL, 0x18197087L, 0x1cd86d30L,
+   0x029f3d35L, 0x065e2082L, 0x0b1d065bL, 0x0fdc1becL,
+   0x3793a651L, 0x3352bbe6L, 0x3e119d3fL, 0x3ad08088L,
+   0x2497d08dL, 0x2056cd3aL, 0x2d15ebe3L, 0x29d4f654L,
+   0xc5a92679L, 0xc1683bceL, 0xcc2b1d17L, 0xc8ea00a0L,
+   0xd6ad50a5L, 0xd26c4d12L, 0xdf2f6bcbL, 0xdbee767cL,
+   0xe3a1cbc1L, 0xe760d676L, 0xea23f0afL, 0xeee2ed18L,
+   0xf0a5bd1dL, 0xf464a0aaL, 0xf9278673L, 0xfde69bc4L,
+   0x89b8fd09L, 0x8d79e0beL, 0x803ac667L, 0x84fbdbd0L,
+   0x9abc8bd5L, 0x9e7d9662L, 0x933eb0bbL, 0x97ffad0cL,
+   0xafb010b1L, 0xab710d06L, 0xa6322bdfL, 0xa2f33668L,
+   0xbcb4666dL, 0xb8757bdaL, 0xb5365d03L, 0xb1f740b4L
+};
+
+
+/*-------------------------------------------------------------*/
+/*--- end                                        crctable.c ---*/
+/*-------------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/decompress.c b/updater/bzip2-1.0.3/decompress.c
new file mode 100644
index 0000000..a1c39d6
--- /dev/null
+++ b/updater/bzip2-1.0.3/decompress.c
@@ -0,0 +1,666 @@
+
+/*-------------------------------------------------------------*/
+/*--- Decompression machinery                               ---*/
+/*---                                          decompress.c ---*/
+/*-------------------------------------------------------------*/
+
+/*--
+  This file is a part of bzip2 and/or libbzip2, a program and
+  library for lossless, block-sorting data compression.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0 of 21 March 2000
+
+  This program is based on (at least) the work of:
+     Mike Burrows
+     David Wheeler
+     Peter Fenwick
+     Alistair Moffat
+     Radford Neal
+     Ian H. Witten
+     Robert Sedgewick
+     Jon L. Bentley
+
+  For more information on these sources, see the manual.
+--*/
+
+
+#include "bzlib_private.h"
+
+
+/*---------------------------------------------------*/
+static
+void makeMaps_d ( DState* s )
+{
+   Int32 i;
+   s->nInUse = 0;
+   for (i = 0; i < 256; i++)
+      if (s->inUse[i]) {
+         s->seqToUnseq[s->nInUse] = i;
+         s->nInUse++;
+      }
+}
+
+
+/*---------------------------------------------------*/
+#define RETURN(rrr)                               \
+   { retVal = rrr; goto save_state_and_return; };
+
+#define GET_BITS(lll,vvv,nnn)                     \
+   case lll: s->state = lll;                      \
+   while (True) {                                 \
+      if (s->bsLive >= nnn) {                     \
+         UInt32 v;                                \
+         v = (s->bsBuff >>                        \
+             (s->bsLive-nnn)) & ((1 << nnn)-1);   \
+         s->bsLive -= nnn;                        \
+         vvv = v;                                 \
+         break;                                   \
+      }                                           \
+      if (s->strm->avail_in == 0) RETURN(BZ_OK);  \
+      s->bsBuff                                   \
+         = (s->bsBuff << 8) |                     \
+           ((UInt32)                              \
+              (*((UChar*)(s->strm->next_in))));   \
+      s->bsLive += 8;                             \
+      s->strm->next_in++;                         \
+      s->strm->avail_in--;                        \
+      s->strm->total_in_lo32++;                   \
+      if (s->strm->total_in_lo32 == 0)            \
+         s->strm->total_in_hi32++;                \
+   }
+
+#define GET_UCHAR(lll,uuu)                        \
+   GET_BITS(lll,uuu,8)
+
+#define GET_BIT(lll,uuu)                          \
+   GET_BITS(lll,uuu,1)
+
+/*---------------------------------------------------*/
+#define GET_MTF_VAL(label1,label2,lval)           \
+{                                                 \
+   if (groupPos == 0) {                           \
+      groupNo++;                                  \
+      if (groupNo >= nSelectors)                  \
+         RETURN(BZ_DATA_ERROR);                   \
+      groupPos = BZ_G_SIZE;                       \
+      gSel = s->selector[groupNo];                \
+      gMinlen = s->minLens[gSel];                 \
+      gLimit = &(s->limit[gSel][0]);              \
+      gPerm = &(s->perm[gSel][0]);                \
+      gBase = &(s->base[gSel][0]);                \
+   }                                              \
+   groupPos--;                                    \
+   zn = gMinlen;                                  \
+   GET_BITS(label1, zvec, zn);                    \
+   while (1) {                                    \
+      if (zn > 20 /* the longest code */)         \
+         RETURN(BZ_DATA_ERROR);                   \
+      if (zvec <= gLimit[zn]) break;              \
+      zn++;                                       \
+      GET_BIT(label2, zj);                        \
+      zvec = (zvec << 1) | zj;                    \
+   };                                             \
+   if (zvec - gBase[zn] < 0                       \
+       || zvec - gBase[zn] >= BZ_MAX_ALPHA_SIZE)  \
+      RETURN(BZ_DATA_ERROR);                      \
+   lval = gPerm[zvec - gBase[zn]];                \
+}
+
+
+/*---------------------------------------------------*/
+Int32 BZ2_decompress ( DState* s )
+{
+   UChar      uc;
+   Int32      retVal;
+   Int32      minLen, maxLen;
+   bz_stream* strm = s->strm;
+
+   /* stuff that needs to be saved/restored */
+   Int32  i;
+   Int32  j;
+   Int32  t;
+   Int32  alphaSize;
+   Int32  nGroups;
+   Int32  nSelectors;
+   Int32  EOB;
+   Int32  groupNo;
+   Int32  groupPos;
+   Int32  nextSym;
+   Int32  nblockMAX;
+   Int32  nblock;
+   Int32  es;
+   Int32  N;
+   Int32  curr;
+   Int32  zt;
+   Int32  zn; 
+   Int32  zvec;
+   Int32  zj;
+   Int32  gSel;
+   Int32  gMinlen;
+   Int32* gLimit;
+   Int32* gBase;
+   Int32* gPerm;
+
+   if (s->state == BZ_X_MAGIC_1) {
+      /*initialise the save area*/
+      s->save_i           = 0;
+      s->save_j           = 0;
+      s->save_t           = 0;
+      s->save_alphaSize   = 0;
+      s->save_nGroups     = 0;
+      s->save_nSelectors  = 0;
+      s->save_EOB         = 0;
+      s->save_groupNo     = 0;
+      s->save_groupPos    = 0;
+      s->save_nextSym     = 0;
+      s->save_nblockMAX   = 0;
+      s->save_nblock      = 0;
+      s->save_es          = 0;
+      s->save_N           = 0;
+      s->save_curr        = 0;
+      s->save_zt          = 0;
+      s->save_zn          = 0;
+      s->save_zvec        = 0;
+      s->save_zj          = 0;
+      s->save_gSel        = 0;
+      s->save_gMinlen     = 0;
+      s->save_gLimit      = NULL;
+      s->save_gBase       = NULL;
+      s->save_gPerm       = NULL;
+   }
+
+   /*restore from the save area*/
+   i           = s->save_i;
+   j           = s->save_j;
+   t           = s->save_t;
+   alphaSize   = s->save_alphaSize;
+   nGroups     = s->save_nGroups;
+   nSelectors  = s->save_nSelectors;
+   EOB         = s->save_EOB;
+   groupNo     = s->save_groupNo;
+   groupPos    = s->save_groupPos;
+   nextSym     = s->save_nextSym;
+   nblockMAX   = s->save_nblockMAX;
+   nblock      = s->save_nblock;
+   es          = s->save_es;
+   N           = s->save_N;
+   curr        = s->save_curr;
+   zt          = s->save_zt;
+   zn          = s->save_zn; 
+   zvec        = s->save_zvec;
+   zj          = s->save_zj;
+   gSel        = s->save_gSel;
+   gMinlen     = s->save_gMinlen;
+   gLimit      = s->save_gLimit;
+   gBase       = s->save_gBase;
+   gPerm       = s->save_gPerm;
+
+   retVal = BZ_OK;
+
+   switch (s->state) {
+
+      GET_UCHAR(BZ_X_MAGIC_1, uc);
+      if (uc != BZ_HDR_B) RETURN(BZ_DATA_ERROR_MAGIC);
+
+      GET_UCHAR(BZ_X_MAGIC_2, uc);
+      if (uc != BZ_HDR_Z) RETURN(BZ_DATA_ERROR_MAGIC);
+
+      GET_UCHAR(BZ_X_MAGIC_3, uc)
+      if (uc != BZ_HDR_h) RETURN(BZ_DATA_ERROR_MAGIC);
+
+      GET_BITS(BZ_X_MAGIC_4, s->blockSize100k, 8)
+      if (s->blockSize100k < (BZ_HDR_0 + 1) || 
+          s->blockSize100k > (BZ_HDR_0 + 9)) RETURN(BZ_DATA_ERROR_MAGIC);
+      s->blockSize100k -= BZ_HDR_0;
+
+      if (s->smallDecompress) {
+         s->ll16 = (UInt16 *)BZALLOC( s->blockSize100k * 100000 * sizeof(UInt16) );
+         s->ll4  = (UChar *)BZALLOC( 
+                      ((1 + s->blockSize100k * 100000) >> 1) * sizeof(UChar) 
+                   );
+         if (s->ll16 == NULL || s->ll4 == NULL) RETURN(BZ_MEM_ERROR);
+      } else {
+         s->tt  = (UInt32 *)BZALLOC( s->blockSize100k * 100000 * sizeof(Int32) );
+         if (s->tt == NULL) RETURN(BZ_MEM_ERROR);
+      }
+
+      GET_UCHAR(BZ_X_BLKHDR_1, uc);
+
+      if (uc == 0x17) goto endhdr_2;
+      if (uc != 0x31) RETURN(BZ_DATA_ERROR);
+      GET_UCHAR(BZ_X_BLKHDR_2, uc);
+      if (uc != 0x41) RETURN(BZ_DATA_ERROR);
+      GET_UCHAR(BZ_X_BLKHDR_3, uc);
+      if (uc != 0x59) RETURN(BZ_DATA_ERROR);
+      GET_UCHAR(BZ_X_BLKHDR_4, uc);
+      if (uc != 0x26) RETURN(BZ_DATA_ERROR);
+      GET_UCHAR(BZ_X_BLKHDR_5, uc);
+      if (uc != 0x53) RETURN(BZ_DATA_ERROR);
+      GET_UCHAR(BZ_X_BLKHDR_6, uc);
+      if (uc != 0x59) RETURN(BZ_DATA_ERROR);
+
+      s->currBlockNo++;
+      if (s->verbosity >= 2)
+         VPrintf1 ( "\n    [%d: huff+mtf ", s->currBlockNo );
+ 
+      s->storedBlockCRC = 0;
+      GET_UCHAR(BZ_X_BCRC_1, uc);
+      s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
+      GET_UCHAR(BZ_X_BCRC_2, uc);
+      s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
+      GET_UCHAR(BZ_X_BCRC_3, uc);
+      s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
+      GET_UCHAR(BZ_X_BCRC_4, uc);
+      s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
+
+      GET_BITS(BZ_X_RANDBIT, s->blockRandomised, 1);
+
+      s->origPtr = 0;
+      GET_UCHAR(BZ_X_ORIGPTR_1, uc);
+      s->origPtr = (s->origPtr << 8) | ((Int32)uc);
+      GET_UCHAR(BZ_X_ORIGPTR_2, uc);
+      s->origPtr = (s->origPtr << 8) | ((Int32)uc);
+      GET_UCHAR(BZ_X_ORIGPTR_3, uc);
+      s->origPtr = (s->origPtr << 8) | ((Int32)uc);
+
+      if (s->origPtr < 0)
+         RETURN(BZ_DATA_ERROR);
+      if (s->origPtr > 10 + 100000*s->blockSize100k) 
+         RETURN(BZ_DATA_ERROR);
+
+      /*--- Receive the mapping table ---*/
+      for (i = 0; i < 16; i++) {
+         GET_BIT(BZ_X_MAPPING_1, uc);
+         if (uc == 1) 
+            s->inUse16[i] = True; else 
+            s->inUse16[i] = False;
+      }
+
+      for (i = 0; i < 256; i++) s->inUse[i] = False;
+
+      for (i = 0; i < 16; i++)
+         if (s->inUse16[i])
+            for (j = 0; j < 16; j++) {
+               GET_BIT(BZ_X_MAPPING_2, uc);
+               if (uc == 1) s->inUse[i * 16 + j] = True;
+            }
+      makeMaps_d ( s );
+      if (s->nInUse == 0) RETURN(BZ_DATA_ERROR);
+      alphaSize = s->nInUse+2;
+
+      /*--- Now the selectors ---*/
+      GET_BITS(BZ_X_SELECTOR_1, nGroups, 3);
+      if (nGroups < 2 || nGroups > 6) RETURN(BZ_DATA_ERROR);
+      GET_BITS(BZ_X_SELECTOR_2, nSelectors, 15);
+      if (nSelectors < 1) RETURN(BZ_DATA_ERROR);
+      for (i = 0; i < nSelectors; i++) {
+         j = 0;
+         while (True) {
+            GET_BIT(BZ_X_SELECTOR_3, uc);
+            if (uc == 0) break;
+            j++;
+            if (j >= nGroups) RETURN(BZ_DATA_ERROR);
+         }
+         s->selectorMtf[i] = j;
+      }
+
+      /*--- Undo the MTF values for the selectors. ---*/
+      {
+         UChar pos[BZ_N_GROUPS], tmp, v;
+         for (v = 0; v < nGroups; v++) pos[v] = v;
+   
+         for (i = 0; i < nSelectors; i++) {
+            v = s->selectorMtf[i];
+            tmp = pos[v];
+            while (v > 0) { pos[v] = pos[v-1]; v--; }
+            pos[0] = tmp;
+            s->selector[i] = tmp;
+         }
+      }
+
+      /*--- Now the coding tables ---*/
+      for (t = 0; t < nGroups; t++) {
+         GET_BITS(BZ_X_CODING_1, curr, 5);
+         for (i = 0; i < alphaSize; i++) {
+            while (True) {
+               if (curr < 1 || curr > 20) RETURN(BZ_DATA_ERROR);
+               GET_BIT(BZ_X_CODING_2, uc);
+               if (uc == 0) break;
+               GET_BIT(BZ_X_CODING_3, uc);
+               if (uc == 0) curr++; else curr--;
+            }
+            s->len[t][i] = curr;
+         }
+      }
+
+      /*--- Create the Huffman decoding tables ---*/
+      for (t = 0; t < nGroups; t++) {
+         minLen = 32;
+         maxLen = 0;
+         for (i = 0; i < alphaSize; i++) {
+            if (s->len[t][i] > maxLen) maxLen = s->len[t][i];
+            if (s->len[t][i] < minLen) minLen = s->len[t][i];
+         }
+         BZ2_hbCreateDecodeTables ( 
+            &(s->limit[t][0]), 
+            &(s->base[t][0]), 
+            &(s->perm[t][0]), 
+            &(s->len[t][0]),
+            minLen, maxLen, alphaSize
+         );
+         s->minLens[t] = minLen;
+      }
+
+      /*--- Now the MTF values ---*/
+
+      EOB      = s->nInUse+1;
+      nblockMAX = 100000 * s->blockSize100k;
+      groupNo  = -1;
+      groupPos = 0;
+
+      for (i = 0; i <= 255; i++) s->unzftab[i] = 0;
+
+      /*-- MTF init --*/
+      {
+         Int32 ii, jj, kk;
+         kk = MTFA_SIZE-1;
+         for (ii = 256 / MTFL_SIZE - 1; ii >= 0; ii--) {
+            for (jj = MTFL_SIZE-1; jj >= 0; jj--) {
+               s->mtfa[kk] = (UChar)(ii * MTFL_SIZE + jj);
+               kk--;
+            }
+            s->mtfbase[ii] = kk + 1;
+         }
+      }
+      /*-- end MTF init --*/
+
+      nblock = 0;
+      GET_MTF_VAL(BZ_X_MTF_1, BZ_X_MTF_2, nextSym);
+
+      while (True) {
+
+         if (nextSym == EOB) break;
+
+         if (nextSym == BZ_RUNA || nextSym == BZ_RUNB) {
+
+            es = -1;
+            N = 1;
+            do {
+               if (nextSym == BZ_RUNA) es = es + (0+1) * N; else
+               if (nextSym == BZ_RUNB) es = es + (1+1) * N;
+               N = N * 2;
+               GET_MTF_VAL(BZ_X_MTF_3, BZ_X_MTF_4, nextSym);
+            }
+               while (nextSym == BZ_RUNA || nextSym == BZ_RUNB);
+
+            es++;
+            uc = s->seqToUnseq[ s->mtfa[s->mtfbase[0]] ];
+            s->unzftab[uc] += es;
+
+            if (s->smallDecompress)
+               while (es > 0) {
+                  if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
+                  s->ll16[nblock] = (UInt16)uc;
+                  nblock++;
+                  es--;
+               }
+            else
+               while (es > 0) {
+                  if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
+                  s->tt[nblock] = (UInt32)uc;
+                  nblock++;
+                  es--;
+               };
+
+            continue;
+
+         } else {
+
+            if (nblock >= nblockMAX) RETURN(BZ_DATA_ERROR);
+
+            /*-- uc = MTF ( nextSym-1 ) --*/
+            {
+               Int32 ii, jj, kk, pp, lno, off;
+               UInt32 nn;
+               nn = (UInt32)(nextSym - 1);
+
+               if (nn < MTFL_SIZE) {
+                  /* avoid general-case expense */
+                  pp = s->mtfbase[0];
+                  uc = s->mtfa[pp+nn];
+                  while (nn > 3) {
+                     Int32 z = pp+nn;
+                     s->mtfa[(z)  ] = s->mtfa[(z)-1];
+                     s->mtfa[(z)-1] = s->mtfa[(z)-2];
+                     s->mtfa[(z)-2] = s->mtfa[(z)-3];
+                     s->mtfa[(z)-3] = s->mtfa[(z)-4];
+                     nn -= 4;
+                  }
+                  while (nn > 0) { 
+                     s->mtfa[(pp+nn)] = s->mtfa[(pp+nn)-1]; nn--; 
+                  };
+                  s->mtfa[pp] = uc;
+               } else { 
+                  /* general case */
+                  lno = nn / MTFL_SIZE;
+                  off = nn % MTFL_SIZE;
+                  pp = s->mtfbase[lno] + off;
+                  uc = s->mtfa[pp];
+                  while (pp > s->mtfbase[lno]) { 
+                     s->mtfa[pp] = s->mtfa[pp-1]; pp--; 
+                  };
+                  s->mtfbase[lno]++;
+                  while (lno > 0) {
+                     s->mtfbase[lno]--;
+                     s->mtfa[s->mtfbase[lno]] 
+                        = s->mtfa[s->mtfbase[lno-1] + MTFL_SIZE - 1];
+                     lno--;
+                  }
+                  s->mtfbase[0]--;
+                  s->mtfa[s->mtfbase[0]] = uc;
+                  if (s->mtfbase[0] == 0) {
+                     kk = MTFA_SIZE-1;
+                     for (ii = 256 / MTFL_SIZE-1; ii >= 0; ii--) {
+                        for (jj = MTFL_SIZE-1; jj >= 0; jj--) {
+                           s->mtfa[kk] = s->mtfa[s->mtfbase[ii] + jj];
+                           kk--;
+                        }
+                        s->mtfbase[ii] = kk + 1;
+                     }
+                  }
+               }
+            }
+            /*-- end uc = MTF ( nextSym-1 ) --*/
+
+            s->unzftab[s->seqToUnseq[uc]]++;
+            if (s->smallDecompress)
+               s->ll16[nblock] = (UInt16)(s->seqToUnseq[uc]); else
+               s->tt[nblock]   = (UInt32)(s->seqToUnseq[uc]);
+            nblock++;
+
+            GET_MTF_VAL(BZ_X_MTF_5, BZ_X_MTF_6, nextSym);
+            continue;
+         }
+      }
+
+      /* Now we know what nblock is, we can do a better sanity
+         check on s->origPtr.
+      */
+      if (s->origPtr < 0 || s->origPtr >= nblock)
+         RETURN(BZ_DATA_ERROR);
+
+      /*-- Set up cftab to facilitate generation of T^(-1) --*/
+      s->cftab[0] = 0;
+      for (i = 1; i <= 256; i++) s->cftab[i] = s->unzftab[i-1];
+      for (i = 1; i <= 256; i++) s->cftab[i] += s->cftab[i-1];
+      for (i = 0; i <= 256; i++) {
+         if (s->cftab[i] < 0 || s->cftab[i] > nblock) {
+            /* s->cftab[i] can legitimately be == nblock */
+            RETURN(BZ_DATA_ERROR);
+         }
+      }
+
+      s->state_out_len = 0;
+      s->state_out_ch  = 0;
+      BZ_INITIALISE_CRC ( s->calculatedBlockCRC );
+      s->state = BZ_X_OUTPUT;
+      if (s->verbosity >= 2) VPrintf0 ( "rt+rld" );
+
+      if (s->smallDecompress) {
+
+         /*-- Make a copy of cftab, used in generation of T --*/
+         for (i = 0; i <= 256; i++) s->cftabCopy[i] = s->cftab[i];
+
+         /*-- compute the T vector --*/
+         for (i = 0; i < nblock; i++) {
+            uc = (UChar)(s->ll16[i]);
+            SET_LL(i, s->cftabCopy[uc]);
+            s->cftabCopy[uc]++;
+         }
+
+         /*-- Compute T^(-1) by pointer reversal on T --*/
+         i = s->origPtr;
+         j = GET_LL(i);
+         do {
+            Int32 tmp = GET_LL(j);
+            SET_LL(j, i);
+            i = j;
+            j = tmp;
+         }
+            while (i != s->origPtr);
+
+         s->tPos = s->origPtr;
+         s->nblock_used = 0;
+         if (s->blockRandomised) {
+            BZ_RAND_INIT_MASK;
+            BZ_GET_SMALL(s->k0); s->nblock_used++;
+            BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK; 
+         } else {
+            BZ_GET_SMALL(s->k0); s->nblock_used++;
+         }
+
+      } else {
+
+         /*-- compute the T^(-1) vector --*/
+         for (i = 0; i < nblock; i++) {
+            uc = (UChar)(s->tt[i] & 0xff);
+            s->tt[s->cftab[uc]] |= (i << 8);
+            s->cftab[uc]++;
+         }
+
+         s->tPos = s->tt[s->origPtr] >> 8;
+         s->nblock_used = 0;
+         if (s->blockRandomised) {
+            BZ_RAND_INIT_MASK;
+            BZ_GET_FAST(s->k0); s->nblock_used++;
+            BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK; 
+         } else {
+            BZ_GET_FAST(s->k0); s->nblock_used++;
+         }
+
+      }
+
+      RETURN(BZ_OK);
+
+
+
+    endhdr_2:
+
+      GET_UCHAR(BZ_X_ENDHDR_2, uc);
+      if (uc != 0x72) RETURN(BZ_DATA_ERROR);
+      GET_UCHAR(BZ_X_ENDHDR_3, uc);
+      if (uc != 0x45) RETURN(BZ_DATA_ERROR);
+      GET_UCHAR(BZ_X_ENDHDR_4, uc);
+      if (uc != 0x38) RETURN(BZ_DATA_ERROR);
+      GET_UCHAR(BZ_X_ENDHDR_5, uc);
+      if (uc != 0x50) RETURN(BZ_DATA_ERROR);
+      GET_UCHAR(BZ_X_ENDHDR_6, uc);
+      if (uc != 0x90) RETURN(BZ_DATA_ERROR);
+
+      s->storedCombinedCRC = 0;
+      GET_UCHAR(BZ_X_CCRC_1, uc);
+      s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
+      GET_UCHAR(BZ_X_CCRC_2, uc);
+      s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
+      GET_UCHAR(BZ_X_CCRC_3, uc);
+      s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
+      GET_UCHAR(BZ_X_CCRC_4, uc);
+      s->storedCombinedCRC = (s->storedCombinedCRC << 8) | ((UInt32)uc);
+
+      s->state = BZ_X_IDLE;
+      RETURN(BZ_STREAM_END);
+
+      default: AssertH ( False, 4001 );
+   }
+
+   AssertH ( False, 4002 );
+
+   save_state_and_return:
+
+   s->save_i           = i;
+   s->save_j           = j;
+   s->save_t           = t;
+   s->save_alphaSize   = alphaSize;
+   s->save_nGroups     = nGroups;
+   s->save_nSelectors  = nSelectors;
+   s->save_EOB         = EOB;
+   s->save_groupNo     = groupNo;
+   s->save_groupPos    = groupPos;
+   s->save_nextSym     = nextSym;
+   s->save_nblockMAX   = nblockMAX;
+   s->save_nblock      = nblock;
+   s->save_es          = es;
+   s->save_N           = N;
+   s->save_curr        = curr;
+   s->save_zt          = zt;
+   s->save_zn          = zn;
+   s->save_zvec        = zvec;
+   s->save_zj          = zj;
+   s->save_gSel        = gSel;
+   s->save_gMinlen     = gMinlen;
+   s->save_gLimit      = gLimit;
+   s->save_gBase       = gBase;
+   s->save_gPerm       = gPerm;
+
+   return retVal;   
+}
+
+
+/*-------------------------------------------------------------*/
+/*--- end                                      decompress.c ---*/
+/*-------------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/dlltest.c b/updater/bzip2-1.0.3/dlltest.c
new file mode 100644
index 0000000..2d7dcca
--- /dev/null
+++ b/updater/bzip2-1.0.3/dlltest.c
@@ -0,0 +1,176 @@
+/*
+   minibz2
+      libbz2.dll test program.
+      by Yoshioka Tsuneo(QWF00133@nifty.ne.jp/tsuneo-y@is.aist-nara.ac.jp)
+      This file is Public Domain.
+      welcome any email to me.
+
+   usage: minibz2 [-d] [-{1,2,..9}] [[srcfilename] destfilename]
+*/
+
+#define BZ_IMPORT
+#include <stdio.h>
+#include <stdlib.h>
+#include "bzlib.h"
+#ifdef _WIN32
+#include <io.h>
+#endif
+
+
+#ifdef _WIN32
+
+#define BZ2_LIBNAME "libbz2-1.0.2.DLL" 
+
+#include <windows.h>
+static int BZ2DLLLoaded = 0;
+static HINSTANCE BZ2DLLhLib;
+int BZ2DLLLoadLibrary(void)
+{
+   HINSTANCE hLib;
+
+   if(BZ2DLLLoaded==1){return 0;}
+   hLib=LoadLibrary(BZ2_LIBNAME);
+   if(hLib == NULL){
+      fprintf(stderr,"Can't load %s\n",BZ2_LIBNAME);
+      return -1;
+   }
+   BZ2_bzlibVersion=GetProcAddress(hLib,"BZ2_bzlibVersion");
+   BZ2_bzopen=GetProcAddress(hLib,"BZ2_bzopen");
+   BZ2_bzdopen=GetProcAddress(hLib,"BZ2_bzdopen");
+   BZ2_bzread=GetProcAddress(hLib,"BZ2_bzread");
+   BZ2_bzwrite=GetProcAddress(hLib,"BZ2_bzwrite");
+   BZ2_bzflush=GetProcAddress(hLib,"BZ2_bzflush");
+   BZ2_bzclose=GetProcAddress(hLib,"BZ2_bzclose");
+   BZ2_bzerror=GetProcAddress(hLib,"BZ2_bzerror");
+
+   if (!BZ2_bzlibVersion || !BZ2_bzopen || !BZ2_bzdopen
+       || !BZ2_bzread || !BZ2_bzwrite || !BZ2_bzflush
+       || !BZ2_bzclose || !BZ2_bzerror) {
+      fprintf(stderr,"GetProcAddress failed.\n");
+      return -1;
+   }
+   BZ2DLLLoaded=1;
+   BZ2DLLhLib=hLib;
+   return 0;
+
+}
+int BZ2DLLFreeLibrary(void)
+{
+   if(BZ2DLLLoaded==0){return 0;}
+   FreeLibrary(BZ2DLLhLib);
+   BZ2DLLLoaded=0;
+}
+#endif /* WIN32 */
+
+void usage(void)
+{
+   puts("usage: minibz2 [-d] [-{1,2,..9}] [[srcfilename] destfilename]");
+}
+
+int main(int argc,char *argv[])
+{
+   int decompress = 0;
+   int level = 9;
+   char *fn_r = NULL;
+   char *fn_w = NULL;
+
+#ifdef _WIN32
+   if(BZ2DLLLoadLibrary()<0){
+      fprintf(stderr,"Loading of %s failed.  Giving up.\n", BZ2_LIBNAME);
+      exit(1);
+   }
+   printf("Loading of %s succeeded.  Library version is %s.\n",
+          BZ2_LIBNAME, BZ2_bzlibVersion() );
+#endif
+   while(++argv,--argc){
+      if(**argv =='-' || **argv=='/'){
+         char *p;
+
+         for(p=*argv+1;*p;p++){
+            if(*p=='d'){
+               decompress = 1;
+            }else if('1'<=*p && *p<='9'){
+               level = *p - '0';
+            }else{
+               usage();
+               exit(1);
+            }
+         }
+      }else{
+         break;
+      }
+   }
+   if(argc>=1){
+      fn_r = *argv;
+      argc--;argv++;
+   }else{
+      fn_r = NULL;
+   }
+   if(argc>=1){
+      fn_w = *argv;
+      argc--;argv++;
+   }else{
+      fn_w = NULL;
+   }
+   {
+      int len;
+      char buff[0x1000];
+      char mode[10];
+
+      if(decompress){
+         BZFILE *BZ2fp_r = NULL;
+         FILE *fp_w = NULL;
+
+         if(fn_w){
+            if((fp_w = fopen(fn_w,"wb"))==NULL){
+               printf("can't open [%s]\n",fn_w);
+               perror("reason:");
+               exit(1);
+            }
+         }else{
+            fp_w = stdout;
+         }
+         if((fn_r == NULL && (BZ2fp_r = BZ2_bzdopen(fileno(stdin),"rb"))==NULL)
+            || (fn_r != NULL && (BZ2fp_r = BZ2_bzopen(fn_r,"rb"))==NULL)){
+            printf("can't bz2openstream\n");
+            exit(1);
+         }
+         while((len=BZ2_bzread(BZ2fp_r,buff,0x1000))>0){
+            fwrite(buff,1,len,fp_w);
+         }
+         BZ2_bzclose(BZ2fp_r);
+         if(fp_w != stdout) fclose(fp_w);
+      }else{
+         BZFILE *BZ2fp_w = NULL;
+         FILE *fp_r = NULL;
+
+         if(fn_r){
+            if((fp_r = fopen(fn_r,"rb"))==NULL){
+               printf("can't open [%s]\n",fn_r);
+               perror("reason:");
+               exit(1);
+            }
+         }else{
+            fp_r = stdin;
+         }
+         mode[0]='w';
+         mode[1] = '0' + level;
+         mode[2] = '\0';
+
+         if((fn_w == NULL && (BZ2fp_w = BZ2_bzdopen(fileno(stdout),mode))==NULL)
+            || (fn_w !=NULL && (BZ2fp_w = BZ2_bzopen(fn_w,mode))==NULL)){
+            printf("can't bz2openstream\n");
+            exit(1);
+         }
+         while((len=fread(buff,1,0x1000,fp_r))>0){
+            BZ2_bzwrite(BZ2fp_w,buff,len);
+         }
+         BZ2_bzclose(BZ2fp_w);
+         if(fp_r!=stdin)fclose(fp_r);
+      }
+   }
+#ifdef _WIN32
+   BZ2DLLFreeLibrary();
+#endif
+   return 0;
+}
diff --git a/updater/bzip2-1.0.3/dlltest.dsp b/updater/bzip2-1.0.3/dlltest.dsp
new file mode 100644
index 0000000..4b1615e
--- /dev/null
+++ b/updater/bzip2-1.0.3/dlltest.dsp
@@ -0,0 +1,93 @@
+# Microsoft Developer Studio Project File - Name="dlltest" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 5.00
+# ** �ҏW���Ȃ��ł������� **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=dlltest - Win32 Debug
+!MESSAGE ����͗L����Ҳ�̧�قł͂���܂���B ������ۼު�Ă�����ނ��邽�߂ɂ� NMAKE ���g�p���Ă��������B
+!MESSAGE [Ҳ�̧�ق̴���߰�] ����ނ��g�p���Ď��s���Ă�������
+!MESSAGE 
+!MESSAGE NMAKE /f "dlltest.mak".
+!MESSAGE 
+!MESSAGE NMAKE �̎��s���ɍ\�����w��ł��܂�
+!MESSAGE ����� ײݏ��ϸۂ̐ݒ���`���܂��B��:
+!MESSAGE 
+!MESSAGE NMAKE /f "dlltest.mak" CFG="dlltest - Win32 Debug"
+!MESSAGE 
+!MESSAGE �I���\������� Ӱ��:
+!MESSAGE 
+!MESSAGE "dlltest - Win32 Release" ("Win32 (x86) Console Application" �p)
+!MESSAGE "dlltest - Win32 Debug" ("Win32 (x86) Console Application" �p)
+!MESSAGE 
+
+# Begin Project
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "dlltest - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD BASE RSC /l 0x411 /d "NDEBUG"
+# ADD RSC /l 0x411 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386 /out:"minibz2.exe"
+
+!ELSEIF  "$(CFG)" == "dlltest - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "dlltest_"
+# PROP BASE Intermediate_Dir "dlltest_"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "dlltest_"
+# PROP Intermediate_Dir "dlltest_"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD CPP /nologo /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_CONSOLE" /D "_MBCS" /YX /FD /c
+# ADD BASE RSC /l 0x411 /d "_DEBUG"
+# ADD RSC /l 0x411 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /out:"minibz2.exe" /pdbtype:sept
+
+!ENDIF 
+
+# Begin Target
+
+# Name "dlltest - Win32 Release"
+# Name "dlltest - Win32 Debug"
+# Begin Source File
+
+SOURCE=.\bzlib.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\dlltest.c
+# End Source File
+# End Target
+# End Project
diff --git a/updater/bzip2-1.0.3/entities.xml b/updater/bzip2-1.0.3/entities.xml
new file mode 100644
index 0000000..6d0975f
--- /dev/null
+++ b/updater/bzip2-1.0.3/entities.xml
@@ -0,0 +1,9 @@
+<!-- misc. strings -->
+<!ENTITY bz-url "http://www.bzip.org">
+<!ENTITY bz-email "jseward@bzip.org">
+<!ENTITY bz-lifespan "1996-2005">
+
+<!ENTITY bz-version "1.0.3">
+<!ENTITY bz-date "15 February 2005">
+
+<!ENTITY manual-title "bzip2 Manual">
diff --git a/updater/bzip2-1.0.3/format.pl b/updater/bzip2-1.0.3/format.pl
new file mode 100644
index 0000000..8ab47ac
--- /dev/null
+++ b/updater/bzip2-1.0.3/format.pl
@@ -0,0 +1,53 @@
+#!/usr/bin/perl -w
+use strict;
+
+# get command line values:
+if ( $#ARGV !=1 ) {
+    die "Usage:  $0 xml_infile xml_outfile\n";
+}
+
+my $infile = shift;
+# check infile exists
+die "Can't find file \"$infile\""
+  unless -f $infile;
+# check we can read infile
+if (! -r $infile) {
+    die "Can't read input $infile\n";
+}
+# check we can open infile
+open( INFILE,"<$infile" ) or 
+    die "Can't input $infile $!";
+
+#my $outfile = 'fmt-manual.xml';
+my $outfile = shift;
+#print "Infile: $infile, Outfile: $outfile\n";
+# check we can write to outfile
+open( OUTFILE,">$outfile" ) or 
+    die "Can't output $outfile $! for writing";
+
+my ($prev, $curr, $str);
+$prev = ''; $curr = '';
+while ( <INFILE> ) {
+
+		print OUTFILE $prev;
+    $prev = $curr;
+    $curr = $_;
+    $str = '';
+
+    if ( $prev =~ /<programlisting>$|<screen>$/ ) {
+        chomp $prev;
+        $curr = join( '', $prev, "<![CDATA[", $curr );
+				$prev = '';
+        next;
+    }
+    elsif ( $curr =~ /<\/programlisting>|<\/screen>/ ) {
+        chomp $prev;
+        $curr = join( '', $prev, "]]>", $curr );
+				$prev = '';
+        next;
+    }
+}
+print OUTFILE $curr;
+close INFILE;
+close OUTFILE;
+exit;
diff --git a/updater/bzip2-1.0.3/huffman.c b/updater/bzip2-1.0.3/huffman.c
new file mode 100644
index 0000000..5bf190b
--- /dev/null
+++ b/updater/bzip2-1.0.3/huffman.c
@@ -0,0 +1,245 @@
+
+/*-------------------------------------------------------------*/
+/*--- Huffman coding low-level stuff                        ---*/
+/*---                                             huffman.c ---*/
+/*-------------------------------------------------------------*/
+
+/*--
+  This file is a part of bzip2 and/or libbzip2, a program and
+  library for lossless, block-sorting data compression.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0 of 21 March 2000
+
+  This program is based on (at least) the work of:
+     Mike Burrows
+     David Wheeler
+     Peter Fenwick
+     Alistair Moffat
+     Radford Neal
+     Ian H. Witten
+     Robert Sedgewick
+     Jon L. Bentley
+
+  For more information on these sources, see the manual.
+--*/
+
+
+#include "bzlib_private.h"
+
+/*---------------------------------------------------*/
+#define WEIGHTOF(zz0)  ((zz0) & 0xffffff00)
+#define DEPTHOF(zz1)   ((zz1) & 0x000000ff)
+#define MYMAX(zz2,zz3) ((zz2) > (zz3) ? (zz2) : (zz3))
+
+#define ADDWEIGHTS(zw1,zw2)                           \
+   (WEIGHTOF(zw1)+WEIGHTOF(zw2)) |                    \
+   (1 + MYMAX(DEPTHOF(zw1),DEPTHOF(zw2)))
+
+#define UPHEAP(z)                                     \
+{                                                     \
+   Int32 zz, tmp;                                     \
+   zz = z; tmp = heap[zz];                            \
+   while (weight[tmp] < weight[heap[zz >> 1]]) {      \
+      heap[zz] = heap[zz >> 1];                       \
+      zz >>= 1;                                       \
+   }                                                  \
+   heap[zz] = tmp;                                    \
+}
+
+#define DOWNHEAP(z)                                   \
+{                                                     \
+   Int32 zz, yy, tmp;                                 \
+   zz = z; tmp = heap[zz];                            \
+   while (True) {                                     \
+      yy = zz << 1;                                   \
+      if (yy > nHeap) break;                          \
+      if (yy < nHeap &&                               \
+          weight[heap[yy+1]] < weight[heap[yy]])      \
+         yy++;                                        \
+      if (weight[tmp] < weight[heap[yy]]) break;      \
+      heap[zz] = heap[yy];                            \
+      zz = yy;                                        \
+   }                                                  \
+   heap[zz] = tmp;                                    \
+}
+
+
+/*---------------------------------------------------*/
+void BZ2_hbMakeCodeLengths ( UChar *len, 
+                             Int32 *freq,
+                             Int32 alphaSize,
+                             Int32 maxLen )
+{
+   /*--
+      Nodes and heap entries run from 1.  Entry 0
+      for both the heap and nodes is a sentinel.
+   --*/
+   Int32 nNodes, nHeap, n1, n2, i, j, k;
+   Bool  tooLong;
+
+   Int32 heap   [ BZ_MAX_ALPHA_SIZE + 2 ];
+   Int32 weight [ BZ_MAX_ALPHA_SIZE * 2 ];
+   Int32 parent [ BZ_MAX_ALPHA_SIZE * 2 ]; 
+
+   for (i = 0; i < alphaSize; i++)
+      weight[i+1] = (freq[i] == 0 ? 1 : freq[i]) << 8;
+
+   while (True) {
+
+      nNodes = alphaSize;
+      nHeap = 0;
+
+      heap[0] = 0;
+      weight[0] = 0;
+      parent[0] = -2;
+
+      for (i = 1; i <= alphaSize; i++) {
+         parent[i] = -1;
+         nHeap++;
+         heap[nHeap] = i;
+         UPHEAP(nHeap);
+      }
+
+      AssertH( nHeap < (BZ_MAX_ALPHA_SIZE+2), 2001 );
+   
+      while (nHeap > 1) {
+         n1 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
+         n2 = heap[1]; heap[1] = heap[nHeap]; nHeap--; DOWNHEAP(1);
+         nNodes++;
+         parent[n1] = parent[n2] = nNodes;
+         weight[nNodes] = ADDWEIGHTS(weight[n1], weight[n2]);
+         parent[nNodes] = -1;
+         nHeap++;
+         heap[nHeap] = nNodes;
+         UPHEAP(nHeap);
+      }
+
+      AssertH( nNodes < (BZ_MAX_ALPHA_SIZE * 2), 2002 );
+
+      tooLong = False;
+      for (i = 1; i <= alphaSize; i++) {
+         j = 0;
+         k = i;
+         while (parent[k] >= 0) { k = parent[k]; j++; }
+         len[i-1] = j;
+         if (j > maxLen) tooLong = True;
+      }
+      
+      if (! tooLong) break;
+
+      /* 17 Oct 04: keep-going condition for the following loop used
+         to be 'i < alphaSize', which missed the last element,
+         theoretically leading to the possibility of the compressor
+         looping.  However, this count-scaling step is only needed if
+         one of the generated Huffman code words is longer than
+         maxLen, which up to and including version 1.0.2 was 20 bits,
+         which is extremely unlikely.  In version 1.0.3 maxLen was
+         changed to 17 bits, which has minimal effect on compression
+         ratio, but does mean this scaling step is used from time to
+         time, enough to verify that it works.
+
+         This means that bzip2-1.0.3 and later will only produce
+         Huffman codes with a maximum length of 17 bits.  However, in
+         order to preserve backwards compatibility with bitstreams
+         produced by versions pre-1.0.3, the decompressor must still
+         handle lengths of up to 20. */
+
+      for (i = 1; i <= alphaSize; i++) {
+         j = weight[i] >> 8;
+         j = 1 + (j / 2);
+         weight[i] = j << 8;
+      }
+   }
+}
+
+
+/*---------------------------------------------------*/
+void BZ2_hbAssignCodes ( Int32 *code,
+                         UChar *length,
+                         Int32 minLen,
+                         Int32 maxLen,
+                         Int32 alphaSize )
+{
+   Int32 n, vec, i;
+
+   vec = 0;
+   for (n = minLen; n <= maxLen; n++) {
+      for (i = 0; i < alphaSize; i++)
+         if (length[i] == n) { code[i] = vec; vec++; };
+      vec <<= 1;
+   }
+}
+
+
+/*---------------------------------------------------*/
+void BZ2_hbCreateDecodeTables ( Int32 *limit,
+                                Int32 *base,
+                                Int32 *perm,
+                                UChar *length,
+                                Int32 minLen,
+                                Int32 maxLen,
+                                Int32 alphaSize )
+{
+   Int32 pp, i, j, vec;
+
+   pp = 0;
+   for (i = minLen; i <= maxLen; i++)
+      for (j = 0; j < alphaSize; j++)
+         if (length[j] == i) { perm[pp] = j; pp++; };
+
+   for (i = 0; i < BZ_MAX_CODE_LEN; i++) base[i] = 0;
+   for (i = 0; i < alphaSize; i++) base[length[i]+1]++;
+
+   for (i = 1; i < BZ_MAX_CODE_LEN; i++) base[i] += base[i-1];
+
+   for (i = 0; i < BZ_MAX_CODE_LEN; i++) limit[i] = 0;
+   vec = 0;
+
+   for (i = minLen; i <= maxLen; i++) {
+      vec += (base[i+1] - base[i]);
+      limit[i] = vec-1;
+      vec <<= 1;
+   }
+   for (i = minLen + 1; i <= maxLen; i++)
+      base[i] = ((limit[i-1] + 1) << 1) - base[i];
+}
+
+
+/*-------------------------------------------------------------*/
+/*--- end                                         huffman.c ---*/
+/*-------------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/libbz2.001 b/updater/bzip2-1.0.3/libbz2.001
new file mode 100644
index 0000000..a21a20f
--- /dev/null
+++ b/updater/bzip2-1.0.3/libbz2.001
@@ -0,0 +1,130 @@
+# Microsoft Developer Studio Project File - Name="libbz2" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 5.00
+# ** �ҏW���Ȃ��ł������� **
+
+# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
+
+CFG=libbz2 - Win32 Debug
+!MESSAGE ����͗L����Ҳ�̧�قł͂���܂���B ������ۼު�Ă�����ނ��邽�߂ɂ� NMAKE ���g�p���Ă��������B
+!MESSAGE [Ҳ�̧�ق̴���߰�] ����ނ��g�p���Ď��s���Ă�������
+!MESSAGE 
+!MESSAGE NMAKE /f "libbz2.mak".
+!MESSAGE 
+!MESSAGE NMAKE �̎��s���ɍ\�����w��ł��܂�
+!MESSAGE ����� ײݏ��ϸۂ̐ݒ���`���܂��B��:
+!MESSAGE 
+!MESSAGE NMAKE /f "libbz2.mak" CFG="libbz2 - Win32 Debug"
+!MESSAGE 
+!MESSAGE �I���\������� Ӱ��:
+!MESSAGE 
+!MESSAGE "libbz2 - Win32 Release" ("Win32 (x86) Dynamic-Link Library" �p)
+!MESSAGE "libbz2 - Win32 Debug" ("Win32 (x86) Dynamic-Link Library" �p)
+!MESSAGE 
+
+# Begin Project
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+MTL=midl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "libbz2 - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /YX /FD /c
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /o NUL /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /o NUL /win32
+# ADD BASE RSC /l 0x411 /d "NDEBUG"
+# ADD RSC /l 0x411 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /machine:I386
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /machine:I386 /out:"libbz2.dll"
+
+!ELSEIF  "$(CFG)" == "libbz2 - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MTd /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /YX /FD /c
+# ADD CPP /nologo /MTd /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /YX /FD /c
+# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /o NUL /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /o NUL /win32
+# ADD BASE RSC /l 0x411 /d "_DEBUG"
+# ADD RSC /l 0x411 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /debug /machine:I386 /out:"libbz2.dll" /pdbtype:sept
+
+!ENDIF 
+
+# Begin Target
+
+# Name "libbz2 - Win32 Release"
+# Name "libbz2 - Win32 Debug"
+# Begin Source File
+
+SOURCE=.\blocksort.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\bzlib.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\bzlib.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\bzlib_private.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\compress.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\crctable.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\decompress.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\huffman.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\libbz2.def
+# End Source File
+# Begin Source File
+
+SOURCE=.\randtable.c
+# End Source File
+# End Target
+# End Project
diff --git a/updater/bzip2-1.0.3/libbz2.def b/updater/bzip2-1.0.3/libbz2.def
new file mode 100644
index 0000000..2dc0dd8
--- /dev/null
+++ b/updater/bzip2-1.0.3/libbz2.def
@@ -0,0 +1,27 @@
+LIBRARY			LIBBZ2
+DESCRIPTION		"libbzip2: library for data compression"
+EXPORTS
+	BZ2_bzCompressInit
+	BZ2_bzCompress
+	BZ2_bzCompressEnd
+	BZ2_bzDecompressInit
+	BZ2_bzDecompress
+	BZ2_bzDecompressEnd
+	BZ2_bzReadOpen
+	BZ2_bzReadClose
+	BZ2_bzReadGetUnused
+	BZ2_bzRead
+	BZ2_bzWriteOpen
+	BZ2_bzWrite
+	BZ2_bzWriteClose
+	BZ2_bzWriteClose64
+	BZ2_bzBuffToBuffCompress
+	BZ2_bzBuffToBuffDecompress
+	BZ2_bzlibVersion
+	BZ2_bzopen
+	BZ2_bzdopen
+	BZ2_bzread
+	BZ2_bzwrite
+	BZ2_bzflush
+	BZ2_bzclose
+	BZ2_bzerror
diff --git a/updater/bzip2-1.0.3/libbz2.dll b/updater/bzip2-1.0.3/libbz2.dll
new file mode 100644
index 0000000..5452b54
--- /dev/null
+++ b/updater/bzip2-1.0.3/libbz2.dll
diff --git a/updater/bzip2-1.0.3/libbz2.dsp b/updater/bzip2-1.0.3/libbz2.dsp
new file mode 100644
index 0000000..4568aba
--- /dev/null
+++ b/updater/bzip2-1.0.3/libbz2.dsp
@@ -0,0 +1,131 @@
+# Microsoft Developer Studio Project File - Name="libbz2" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
+
+CFG=libbz2 - Win32 Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "libbz2.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "libbz2.mak" CFG="libbz2 - Win32 Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "libbz2 - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "libbz2 - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+MTL=midl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "libbz2 - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /YX /FD /c
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /o "NUL" /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /o "NUL" /win32
+# ADD BASE RSC /l 0x411 /d "NDEBUG"
+# ADD RSC /l 0x411 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /machine:I386
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /machine:I386 /out:"libbz2.dll"
+
+!ELSEIF  "$(CFG)" == "libbz2 - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MTd /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /YX /FD /c
+# ADD CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /YX /FD /c
+# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /o "NUL" /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /o "NUL" /win32
+# ADD BASE RSC /l 0x411 /d "_DEBUG"
+# ADD RSC /l 0x411 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /debug /machine:I386 /out:"libbz2.dll" /pdbtype:sept
+
+!ENDIF 
+
+# Begin Target
+
+# Name "libbz2 - Win32 Release"
+# Name "libbz2 - Win32 Debug"
+# Begin Source File
+
+SOURCE=.\blocksort.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\bzlib.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\bzlib.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\bzlib_private.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\compress.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\crctable.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\decompress.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\huffman.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\libbz2.def
+# End Source File
+# Begin Source File
+
+SOURCE=.\randtable.c
+# End Source File
+# End Target
+# End Project
diff --git a/updater/bzip2-1.0.3/libbz2.dsw b/updater/bzip2-1.0.3/libbz2.dsw
new file mode 100644
index 0000000..38476ef
--- /dev/null
+++ b/updater/bzip2-1.0.3/libbz2.dsw
@@ -0,0 +1,29 @@
+Microsoft Developer Studio Workspace File, Format Version 6.00
+# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
+
+###############################################################################
+
+Project: "libbz2"=".\libbz2.dsp" - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Global:
+
+Package=<5>
+{{{
+}}}
+
+Package=<3>
+{{{
+}}}
+
+###############################################################################
+
diff --git a/updater/bzip2-1.0.3/libbz2.ilk b/updater/bzip2-1.0.3/libbz2.ilk
new file mode 100644
index 0000000..4172c7c
--- /dev/null
+++ b/updater/bzip2-1.0.3/libbz2.ilk
diff --git a/updater/bzip2-1.0.3/libbz2.plg b/updater/bzip2-1.0.3/libbz2.plg
new file mode 100644
index 0000000..3fc4fea
--- /dev/null
+++ b/updater/bzip2-1.0.3/libbz2.plg
@@ -0,0 +1,95 @@
+<html>
+<body>
+<pre>
+<h1>Build Log</h1>
+<h3>
+--------------------Configuration: libbz2 - Win32 Release--------------------
+</h3>
+<h3>Command Lines</h3>
+Creating temporary file "C:\DOCUME~1\sje\LOCALS~1\Temp\RSP9.tmp" with contents
+[
+/nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /Fp"Release/libbz2.pch" /YX /Fo"Release/" /Fd"Release/" /FD /c 
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\blocksort.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\bzlib.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\compress.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\crctable.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\decompress.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\huffman.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\randtable.c"
+]
+Creating command line "cl.exe @C:\DOCUME~1\sje\LOCALS~1\Temp\RSP9.tmp" 
+Creating temporary file "C:\DOCUME~1\sje\LOCALS~1\Temp\RSPA.tmp" with contents
+[
+kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /incremental:no /pdb:"Release/libbz2.pdb" /machine:I386 /def:".\libbz2.def" /out:"libbz2.dll" /implib:"Release/libbz2.lib" 
+".\Release\blocksort.obj"
+".\Release\bzlib.obj"
+".\Release\compress.obj"
+".\Release\crctable.obj"
+".\Release\decompress.obj"
+".\Release\huffman.obj"
+".\Release\randtable.obj"
+]
+Creating command line "link.exe @C:\DOCUME~1\sje\LOCALS~1\Temp\RSPA.tmp"
+<h3>Output Window</h3>
+Compiling...
+blocksort.c
+bzlib.c
+compress.c
+crctable.c
+decompress.c
+huffman.c
+randtable.c
+Linking...
+   Creating library Release/libbz2.lib and object Release/libbz2.exp
+
+
+
+<h3>Results</h3>
+libbz2.dll - 0 error(s), 0 warning(s)
+<h3>
+--------------------Configuration: libbz2 - Win32 Debug--------------------
+</h3>
+<h3>Command Lines</h3>
+Creating temporary file "C:\DOCUME~1\sje\LOCALS~1\Temp\RSPE.tmp" with contents
+[
+/nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /Fp"Debug/libbz2.pch" /YX /Fo"Debug/" /Fd"Debug/" /FD /c 
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\blocksort.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\bzlib.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\compress.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\crctable.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\decompress.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\huffman.c"
+"C:\Documents and Settings\sje\My Documents\MyProjects\miranda\plugins\updater\bzip2-1.0.3\randtable.c"
+]
+Creating command line "cl.exe @C:\DOCUME~1\sje\LOCALS~1\Temp\RSPE.tmp" 
+Creating temporary file "C:\DOCUME~1\sje\LOCALS~1\Temp\RSPF.tmp" with contents
+[
+kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:windows /dll /incremental:yes /pdb:"Debug/libbz2.pdb" /debug /machine:I386 /def:".\libbz2.def" /out:"libbz2.dll" /implib:"Debug/libbz2.lib" /pdbtype:sept 
+".\Debug\blocksort.obj"
+".\Debug\bzlib.obj"
+".\Debug\compress.obj"
+".\Debug\crctable.obj"
+".\Debug\decompress.obj"
+".\Debug\huffman.obj"
+".\Debug\randtable.obj"
+]
+Creating command line "link.exe @C:\DOCUME~1\sje\LOCALS~1\Temp\RSPF.tmp"
+<h3>Output Window</h3>
+Compiling...
+blocksort.c
+bzlib.c
+compress.c
+crctable.c
+decompress.c
+huffman.c
+randtable.c
+Linking...
+   Creating library Debug/libbz2.lib and object Debug/libbz2.exp
+
+
+
+<h3>Results</h3>
+libbz2.dll - 0 error(s), 0 warning(s)
+</pre>
+</body>
+</html>
diff --git a/updater/bzip2-1.0.3/makefile.msc b/updater/bzip2-1.0.3/makefile.msc
new file mode 100644
index 0000000..799a18a
--- /dev/null
+++ b/updater/bzip2-1.0.3/makefile.msc
@@ -0,0 +1,63 @@
+# Makefile for Microsoft Visual C++ 6.0
+# usage: nmake -f makefile.msc
+# K.M. Syring (syring@gsf.de)
+# Fixed up by JRS for bzip2-0.9.5d release.
+
+CC=cl
+CFLAGS= -DWIN32 -MD -Ox -D_FILE_OFFSET_BITS=64 -nologo
+
+OBJS= blocksort.obj  \
+      huffman.obj    \
+      crctable.obj   \
+      randtable.obj  \
+      compress.obj   \
+      decompress.obj \
+      bzlib.obj
+
+all: lib bzip2 test
+
+bzip2: lib
+	$(CC) $(CFLAGS) -o bzip2 bzip2.c libbz2.lib setargv.obj
+	$(CC) $(CFLAGS) -o bzip2recover bzip2recover.c
+
+lib: $(OBJS)
+	lib /out:libbz2.lib $(OBJS)
+
+test: bzip2
+	type words1
+	.\\bzip2 -1  < sample1.ref > sample1.rb2
+	.\\bzip2 -2  < sample2.ref > sample2.rb2
+	.\\bzip2 -3  < sample3.ref > sample3.rb2
+	.\\bzip2 -d  < sample1.bz2 > sample1.tst
+	.\\bzip2 -d  < sample2.bz2 > sample2.tst
+	.\\bzip2 -ds < sample3.bz2 > sample3.tst
+	@echo All six of the fc's should find no differences.
+	@echo If fc finds an error on sample3.bz2, this could be
+	@echo because WinZip's 'TAR file smart CR/LF conversion'
+	@echo is too clever for its own good.  Disable this option.
+	@echo The correct size for sample3.ref is 120,244.  If it
+	@echo is 150,251, WinZip has messed it up.
+	fc sample1.bz2 sample1.rb2 
+	fc sample2.bz2 sample2.rb2
+	fc sample3.bz2 sample3.rb2
+	fc sample1.tst sample1.ref
+	fc sample2.tst sample2.ref
+	fc sample3.tst sample3.ref
+
+
+
+clean: 
+	del *.obj
+	del libbz2.lib 
+	del bzip2.exe
+	del bzip2recover.exe
+	del sample1.rb2 
+	del sample2.rb2 
+	del sample3.rb2
+	del sample1.tst 
+	del sample2.tst
+	del sample3.tst
+
+.c.obj: 
+	$(CC) $(CFLAGS) -c $*.c -o $*.obj
+
diff --git a/updater/bzip2-1.0.3/manual.html b/updater/bzip2-1.0.3/manual.html
new file mode 100644
index 0000000..b28cc79
--- /dev/null
+++ b/updater/bzip2-1.0.3/manual.html
@@ -0,0 +1,2687 @@
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>bzip2 and libbzip2, version 1.0.3</title>
+<meta name="generator" content="DocBook XSL Stylesheets V1.64.1">
+<style type="text/css" media="screen">/* Colours:
+#74240f  dark brown      h1, h2, h3, h4
+#336699  medium blue     links
+#339999  turquoise       link hover colour
+#202020  almost black    general text
+#761596  purple          md5sum text
+#626262  dark gray       pre border
+#eeeeee  very light gray pre background
+#f2f2f9  very light blue nav table background
+#3366cc  medium blue     nav table border
+*/
+
+a, a:link, a:visited, a:active { color: #336699; }
+a:hover { color: #339999; }
+
+body { font: 80%/126% sans-serif; }
+h1, h2, h3, h4 { color: #74240f; }
+
+dt { color: #336699; font-weight: bold }
+dd { 
+ margin-left: 1.5em; 
+ padding-bottom: 0.8em;
+}
+
+/* -- ruler -- */
+div.hr_blue { 
+  height:  3px; 
+  background:#ffffff url("/images/hr_blue.png") repeat-x; }
+div.hr_blue hr { display:none; }
+
+/* release styles */
+#release p { margin-top: 0.4em; }
+#release .md5sum { color: #761596; }
+
+
+/* ------ styles for docs|manuals|howto ------ */
+/* -- lists -- */
+ul  { 
+ margin:     0px 4px 16px 16px;
+ padding:    0px;
+ list-style: url("/images/li-blue.png"); 
+}
+ul li { 
+ margin-bottom: 10px;
+}
+ul ul	{ 
+ list-style-type:  none; 
+ list-style-image: none; 
+ margin-left:      0px; 
+}
+
+/* header / footer nav tables */
+table.nav {
+ border:     solid 1px #3366cc;
+ background: #f2f2f9;
+ background-color: #f2f2f9;
+ margin-bottom: 0.5em;
+}
+/* don't have underlined links in chunked nav menus */
+table.nav a { text-decoration: none; }
+table.nav a:hover { text-decoration: underline; }
+table.nav td { font-size: 85%; }
+
+code, tt, pre { font-size: 120%; }
+code, tt { color: #761596; }
+
+div.literallayout, pre.programlisting, pre.screen {
+ color:      #000000;
+ padding:    0.5em;
+ background: #eeeeee;
+ border:     1px solid #626262;
+ background-color: #eeeeee;
+ margin: 4px 0px 4px 0px; 
+}
+</style>
+</head>
+<body bgcolor="white" text="black" link="#0000FF" vlink="#840084" alink="#0000FF"><div class="book" lang="en">
+<div class="titlepage">
+<div>
+<div><h1 class="title">
+<a name="userman"></a>bzip2 and libbzip2, version 1.0.3</h1></div>
+<div><h2 class="subtitle">A program and library for data compression</h2></div>
+<div><div class="authorgroup"><div class="author">
+<h3 class="author">
+<span class="firstname">Julian</span> <span class="surname">Seward</span>
+</h3>
+<div class="affiliation"><span class="orgname">http://www.bzip.org<br></span></div>
+</div></div></div>
+<div><p class="releaseinfo">Version 1.0.3 of 15 February 2005</p></div>
+<div><p class="copyright">Copyright � 1996-2005 Julian Seward</p></div>
+<div><div class="legalnotice">
+<p>This program, <tt class="computeroutput">bzip2</tt>, the
+  associated library <tt class="computeroutput">libbzip2</tt>, and
+  all documentation, are copyright � 1996-2005 Julian Seward.
+  All rights reserved.</p>
+<p>Redistribution and use in source and binary forms, with
+  or without modification, are permitted provided that the
+  following conditions are met:</p>
+<div class="itemizedlist"><ul type="bullet">
+<li style="list-style-type: disc"><p>Redistributions of source code must retain the
+   above copyright notice, this list of conditions and the
+   following disclaimer.</p></li>
+<li style="list-style-type: disc"><p>The origin of this software must not be
+   misrepresented; you must not claim that you wrote the original
+   software.  If you use this software in a product, an
+   acknowledgment in the product documentation would be
+   appreciated but is not required.</p></li>
+<li style="list-style-type: disc"><p>Altered source versions must be plainly marked
+   as such, and must not be misrepresented as being the original
+   software.</p></li>
+<li style="list-style-type: disc"><p>The name of the author may not be used to
+   endorse or promote products derived from this software without
+   specific prior written permission.</p></li>
+</ul></div>
+<p>THIS SOFTWARE IS PROVIDED BY THE AUTHOR "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 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.</p>
+<p>PATENTS: To the best of my knowledge,
+ <tt class="computeroutput">bzip2</tt> and
+ <tt class="computeroutput">libbzip2</tt> do not use any patented
+ algorithms.  However, I do not have the resources to carry
+ out a patent search.  Therefore I cannot give any guarantee of
+ the above statement.
+ </p>
+</div></div>
+</div>
+<div></div>
+<hr>
+</div>
+<div class="toc">
+<p><b>Table of Contents</b></p>
+<dl>
+<dt><span class="chapter"><a href="#intro">1. Introduction</a></span></dt>
+<dt><span class="chapter"><a href="#using">2. How to use bzip2</a></span></dt>
+<dd><dl>
+<dt><span class="sect1"><a href="#name">2.1. NAME</a></span></dt>
+<dt><span class="sect1"><a href="#synopsis">2.2. SYNOPSIS</a></span></dt>
+<dt><span class="sect1"><a href="#description">2.3. DESCRIPTION</a></span></dt>
+<dt><span class="sect1"><a href="#options">2.4. OPTIONS</a></span></dt>
+<dt><span class="sect1"><a href="#memory-management">2.5. MEMORY MANAGEMENT</a></span></dt>
+<dt><span class="sect1"><a href="#recovering">2.6. RECOVERING DATA FROM DAMAGED FILES</a></span></dt>
+<dt><span class="sect1"><a href="#performance">2.7. PERFORMANCE NOTES</a></span></dt>
+<dt><span class="sect1"><a href="#caveats">2.8. CAVEATS</a></span></dt>
+<dt><span class="sect1"><a href="#author">2.9. AUTHOR</a></span></dt>
+</dl></dd>
+<dt><span class="chapter"><a href="#libprog">3. 
+Programming with libbzip2
+</a></span></dt>
+<dd><dl>
+<dt><span class="sect1"><a href="#top-level">3.1. Top-level structure</a></span></dt>
+<dd><dl>
+<dt><span class="sect2"><a href="#ll-summary">3.1.1. Low-level summary</a></span></dt>
+<dt><span class="sect2"><a href="#hl-summary">3.1.2. High-level summary</a></span></dt>
+<dt><span class="sect2"><a href="#util-fns-summary">3.1.3. Utility functions summary</a></span></dt>
+</dl></dd>
+<dt><span class="sect1"><a href="#err-handling">3.2. Error handling</a></span></dt>
+<dt><span class="sect1"><a href="#low-level">3.3. Low-level interface</a></span></dt>
+<dd><dl>
+<dt><span class="sect2"><a href="#bzcompress-init">3.3.1. BZ2_bzCompressInit</a></span></dt>
+<dt><span class="sect2"><a href="#bzCompress">3.3.2. BZ2_bzCompress</a></span></dt>
+<dt><span class="sect2"><a href="#bzCompress-end">3.3.3. BZ2_bzCompressEnd</a></span></dt>
+<dt><span class="sect2"><a href="#bzDecompress-init">3.3.4. BZ2_bzDecompressInit</a></span></dt>
+<dt><span class="sect2"><a href="#bzDecompress">3.3.5. BZ2_bzDecompress</a></span></dt>
+<dt><span class="sect2"><a href="#bzDecompress-end">3.3.6. BZ2_bzDecompressEnd</a></span></dt>
+</dl></dd>
+<dt><span class="sect1"><a href="#hl-interface">3.4. High-level interface</a></span></dt>
+<dd><dl>
+<dt><span class="sect2"><a href="#bzreadopen">3.4.1. BZ2_bzReadOpen</a></span></dt>
+<dt><span class="sect2"><a href="#bzread">3.4.2. BZ2_bzRead</a></span></dt>
+<dt><span class="sect2"><a href="#bzreadgetunused">3.4.3. BZ2_bzReadGetUnused</a></span></dt>
+<dt><span class="sect2"><a href="#bzreadclose">3.4.4. BZ2_bzReadClose</a></span></dt>
+<dt><span class="sect2"><a href="#bzwriteopen">3.4.5. BZ2_bzWriteOpen</a></span></dt>
+<dt><span class="sect2"><a href="#bzwrite">3.4.6. BZ2_bzWrite</a></span></dt>
+<dt><span class="sect2"><a href="#bzwriteclose">3.4.7. BZ2_bzWriteClose</a></span></dt>
+<dt><span class="sect2"><a href="#embed">3.4.8. Handling embedded compressed data streams</a></span></dt>
+<dt><span class="sect2"><a href="#std-rdwr">3.4.9. Standard file-reading/writing code</a></span></dt>
+</dl></dd>
+<dt><span class="sect1"><a href="#util-fns">3.5. Utility functions</a></span></dt>
+<dd><dl>
+<dt><span class="sect2"><a href="#bzbufftobuffcompress">3.5.1. BZ2_bzBuffToBuffCompress</a></span></dt>
+<dt><span class="sect2"><a href="#bzbufftobuffdecompress">3.5.2. BZ2_bzBuffToBuffDecompress</a></span></dt>
+</dl></dd>
+<dt><span class="sect1"><a href="#zlib-compat">3.6. zlib compatibility functions</a></span></dt>
+<dt><span class="sect1"><a href="#stdio-free">3.7. Using the library in a stdio-free environment</a></span></dt>
+<dd><dl>
+<dt><span class="sect2"><a href="#stdio-bye">3.7.1. Getting rid of stdio</a></span></dt>
+<dt><span class="sect2"><a href="#critical-error">3.7.2. Critical error handling</a></span></dt>
+</dl></dd>
+<dt><span class="sect1"><a href="#win-dll">3.8. Making a Windows DLL</a></span></dt>
+</dl></dd>
+<dt><span class="chapter"><a href="#misc">4. Miscellanea</a></span></dt>
+<dd><dl>
+<dt><span class="sect1"><a href="#limits">4.1. Limitations of the compressed file format</a></span></dt>
+<dt><span class="sect1"><a href="#port-issues">4.2. Portability issues</a></span></dt>
+<dt><span class="sect1"><a href="#bugs">4.3. Reporting bugs</a></span></dt>
+<dt><span class="sect1"><a href="#package">4.4. Did you get the right package?</a></span></dt>
+<dt><span class="sect1"><a href="#reading">4.5. Further Reading</a></span></dt>
+</dl></dd>
+</dl>
+</div>
+<div class="chapter" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title">
+<a name="intro"></a>1.�Introduction</h2></div></div>
+<div></div>
+</div>
+<p><tt class="computeroutput">bzip2</tt> compresses files
+using the Burrows-Wheeler block-sorting text compression
+algorithm, and Huffman coding.  Compression is generally
+considerably better than that achieved by more conventional
+LZ77/LZ78-based compressors, and approaches the performance of
+the PPM family of statistical compressors.</p>
+<p><tt class="computeroutput">bzip2</tt> is built on top of
+<tt class="computeroutput">libbzip2</tt>, a flexible library for
+handling compressed data in the
+<tt class="computeroutput">bzip2</tt> format.  This manual
+describes both how to use the program and how to work with the
+library interface.  Most of the manual is devoted to this
+library, not the program, which is good news if your interest is
+only in the program.</p>
+<div class="itemizedlist"><ul type="bullet">
+<li style="list-style-type: disc"><p><a href="#using">How to use bzip2</a> describes how to use
+ <tt class="computeroutput">bzip2</tt>; this is the only part
+ you need to read if you just want to know how to operate the
+ program.</p></li>
+<li style="list-style-type: disc"><p><a href="#libprog">Programming with libbzip2</a> describes the
+ programming interfaces in detail, and</p></li>
+<li style="list-style-type: disc"><p><a href="#misc">Miscellanea</a> records some
+ miscellaneous notes which I thought ought to be recorded
+ somewhere.</p></li>
+</ul></div>
+</div>
+<div class="chapter" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title">
+<a name="using"></a>2.�How to use bzip2</h2></div></div>
+<div></div>
+</div>
+<div class="toc">
+<p><b>Table of Contents</b></p>
+<dl>
+<dt><span class="sect1"><a href="#name">2.1. NAME</a></span></dt>
+<dt><span class="sect1"><a href="#synopsis">2.2. SYNOPSIS</a></span></dt>
+<dt><span class="sect1"><a href="#description">2.3. DESCRIPTION</a></span></dt>
+<dt><span class="sect1"><a href="#options">2.4. OPTIONS</a></span></dt>
+<dt><span class="sect1"><a href="#memory-management">2.5. MEMORY MANAGEMENT</a></span></dt>
+<dt><span class="sect1"><a href="#recovering">2.6. RECOVERING DATA FROM DAMAGED FILES</a></span></dt>
+<dt><span class="sect1"><a href="#performance">2.7. PERFORMANCE NOTES</a></span></dt>
+<dt><span class="sect1"><a href="#caveats">2.8. CAVEATS</a></span></dt>
+<dt><span class="sect1"><a href="#author">2.9. AUTHOR</a></span></dt>
+</dl>
+</div>
+<p>This chapter contains a copy of the
+<tt class="computeroutput">bzip2</tt> man page, and nothing
+else.</p>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="name"></a>2.1.�NAME</h2></div></div>
+<div></div>
+</div>
+<div class="itemizedlist"><ul type="bullet">
+<li style="list-style-type: disc"><p><tt class="computeroutput">bzip2</tt>,
+  <tt class="computeroutput">bunzip2</tt> - a block-sorting file
+  compressor, v1.0.3</p></li>
+<li style="list-style-type: disc"><p><tt class="computeroutput">bzcat</tt> -
+   decompresses files to stdout</p></li>
+<li style="list-style-type: disc"><p><tt class="computeroutput">bzip2recover</tt> -
+   recovers data from damaged bzip2 files</p></li>
+</ul></div>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="synopsis"></a>2.2.�SYNOPSIS</h2></div></div>
+<div></div>
+</div>
+<div class="itemizedlist"><ul type="bullet">
+<li style="list-style-type: disc"><p><tt class="computeroutput">bzip2</tt> [
+  -cdfkqstvzVL123456789 ] [ filenames ...  ]</p></li>
+<li style="list-style-type: disc"><p><tt class="computeroutput">bunzip2</tt> [
+  -fkvsVL ] [ filenames ...  ]</p></li>
+<li style="list-style-type: disc"><p><tt class="computeroutput">bzcat</tt> [ -s ] [
+  filenames ...  ]</p></li>
+<li style="list-style-type: disc"><p><tt class="computeroutput">bzip2recover</tt>
+  filename</p></li>
+</ul></div>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="description"></a>2.3.�DESCRIPTION</h2></div></div>
+<div></div>
+</div>
+<p><tt class="computeroutput">bzip2</tt> compresses files
+using the Burrows-Wheeler block sorting text compression
+algorithm, and Huffman coding.  Compression is generally
+considerably better than that achieved by more conventional
+LZ77/LZ78-based compressors, and approaches the performance of
+the PPM family of statistical compressors.</p>
+<p>The command-line options are deliberately very similar to
+those of GNU <tt class="computeroutput">gzip</tt>, but they are
+not identical.</p>
+<p><tt class="computeroutput">bzip2</tt> expects a list of
+file names to accompany the command-line flags.  Each file is
+replaced by a compressed version of itself, with the name
+<tt class="computeroutput">original_name.bz2</tt>.  Each
+compressed file has the same modification date, permissions, and,
+when possible, ownership as the corresponding original, so that
+these properties can be correctly restored at decompression time.
+File name handling is naive in the sense that there is no
+mechanism for preserving original file names, permissions,
+ownerships or dates in filesystems which lack these concepts, or
+have serious file name length restrictions, such as
+MS-DOS.</p>
+<p><tt class="computeroutput">bzip2</tt> and
+<tt class="computeroutput">bunzip2</tt> will by default not
+overwrite existing files.  If you want this to happen, specify
+the <tt class="computeroutput">-f</tt> flag.</p>
+<p>If no file names are specified,
+<tt class="computeroutput">bzip2</tt> compresses from standard
+input to standard output.  In this case,
+<tt class="computeroutput">bzip2</tt> will decline to write
+compressed output to a terminal, as this would be entirely
+incomprehensible and therefore pointless.</p>
+<p><tt class="computeroutput">bunzip2</tt> (or
+<tt class="computeroutput">bzip2 -d</tt>) decompresses all
+specified files.  Files which were not created by
+<tt class="computeroutput">bzip2</tt> will be detected and
+ignored, and a warning issued.
+<tt class="computeroutput">bzip2</tt> attempts to guess the
+filename for the decompressed file from that of the compressed
+file as follows:</p>
+<div class="itemizedlist"><ul type="bullet">
+<li style="list-style-type: disc"><p><tt class="computeroutput">filename.bz2 </tt>
+  becomes
+  <tt class="computeroutput">filename</tt></p></li>
+<li style="list-style-type: disc"><p><tt class="computeroutput">filename.bz </tt>
+  becomes
+  <tt class="computeroutput">filename</tt></p></li>
+<li style="list-style-type: disc"><p><tt class="computeroutput">filename.tbz2</tt>
+  becomes
+  <tt class="computeroutput">filename.tar</tt></p></li>
+<li style="list-style-type: disc"><p><tt class="computeroutput">filename.tbz </tt>
+  becomes
+  <tt class="computeroutput">filename.tar</tt></p></li>
+<li style="list-style-type: disc"><p><tt class="computeroutput">anyothername </tt>
+  becomes
+  <tt class="computeroutput">anyothername.out</tt></p></li>
+</ul></div>
+<p>If the file does not end in one of the recognised endings,
+<tt class="computeroutput">.bz2</tt>,
+<tt class="computeroutput">.bz</tt>,
+<tt class="computeroutput">.tbz2</tt> or
+<tt class="computeroutput">.tbz</tt>,
+<tt class="computeroutput">bzip2</tt> complains that it cannot
+guess the name of the original file, and uses the original name
+with <tt class="computeroutput">.out</tt> appended.</p>
+<p>As with compression, supplying no filenames causes
+decompression from standard input to standard output.</p>
+<p><tt class="computeroutput">bunzip2</tt> will correctly
+decompress a file which is the concatenation of two or more
+compressed files.  The result is the concatenation of the
+corresponding uncompressed files.  Integrity testing
+(<tt class="computeroutput">-t</tt>) of concatenated compressed
+files is also supported.</p>
+<p>You can also compress or decompress files to the standard
+output by giving the <tt class="computeroutput">-c</tt> flag.
+Multiple files may be compressed and decompressed like this.  The
+resulting outputs are fed sequentially to stdout.  Compression of
+multiple files in this manner generates a stream containing
+multiple compressed file representations.  Such a stream can be
+decompressed correctly only by
+<tt class="computeroutput">bzip2</tt> version 0.9.0 or later.
+Earlier versions of <tt class="computeroutput">bzip2</tt> will
+stop after decompressing the first file in the stream.</p>
+<p><tt class="computeroutput">bzcat</tt> (or
+<tt class="computeroutput">bzip2 -dc</tt>) decompresses all
+specified files to the standard output.</p>
+<p><tt class="computeroutput">bzip2</tt> will read arguments
+from the environment variables
+<tt class="computeroutput">BZIP2</tt> and
+<tt class="computeroutput">BZIP</tt>, in that order, and will
+process them before any arguments read from the command line.
+This gives a convenient way to supply default arguments.</p>
+<p>Compression is always performed, even if the compressed
+file is slightly larger than the original.  Files of less than
+about one hundred bytes tend to get larger, since the compression
+mechanism has a constant overhead in the region of 50 bytes.
+Random data (including the output of most file compressors) is
+coded at about 8.05 bits per byte, giving an expansion of around
+0.5%.</p>
+<p>As a self-check for your protection,
+<tt class="computeroutput">bzip2</tt> uses 32-bit CRCs to make
+sure that the decompressed version of a file is identical to the
+original.  This guards against corruption of the compressed data,
+and against undetected bugs in
+<tt class="computeroutput">bzip2</tt> (hopefully very unlikely).
+The chances of data corruption going undetected is microscopic,
+about one chance in four billion for each file processed.  Be
+aware, though, that the check occurs upon decompression, so it
+can only tell you that something is wrong.  It can't help you
+recover the original uncompressed data.  You can use
+<tt class="computeroutput">bzip2recover</tt> to try to recover
+data from damaged files.</p>
+<p>Return values: 0 for a normal exit, 1 for environmental
+problems (file not found, invalid flags, I/O errors, etc.), 2
+to indicate a corrupt compressed file, 3 for an internal
+consistency error (eg, bug) which caused
+<tt class="computeroutput">bzip2</tt> to panic.</p>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="options"></a>2.4.�OPTIONS</h2></div></div>
+<div></div>
+</div>
+<div class="variablelist"><dl>
+<dt><span class="term"><tt class="computeroutput">-c --stdout</tt></span></dt>
+<dd><p>Compress or decompress to standard
+  output.</p></dd>
+<dt><span class="term"><tt class="computeroutput">-d --decompress</tt></span></dt>
+<dd><p>Force decompression.
+  <tt class="computeroutput">bzip2</tt>,
+  <tt class="computeroutput">bunzip2</tt> and
+  <tt class="computeroutput">bzcat</tt> are really the same
+  program, and the decision about what actions to take is done on
+  the basis of which name is used.  This flag overrides that
+  mechanism, and forces bzip2 to decompress.</p></dd>
+<dt><span class="term"><tt class="computeroutput">-z --compress</tt></span></dt>
+<dd><p>The complement to
+  <tt class="computeroutput">-d</tt>: forces compression,
+  regardless of the invokation name.</p></dd>
+<dt><span class="term"><tt class="computeroutput">-t --test</tt></span></dt>
+<dd><p>Check integrity of the specified file(s), but
+  don't decompress them.  This really performs a trial
+  decompression and throws away the result.</p></dd>
+<dt><span class="term"><tt class="computeroutput">-f --force</tt></span></dt>
+<dd>
+<p>Force overwrite of output files.  Normally,
+  <tt class="computeroutput">bzip2</tt> will not overwrite
+  existing output files.  Also forces
+  <tt class="computeroutput">bzip2</tt> to break hard links to
+  files, which it otherwise wouldn't do.</p>
+<p><tt class="computeroutput">bzip2</tt> normally declines
+  to decompress files which don't have the correct magic header
+  bytes. If forced (<tt class="computeroutput">-f</tt>),
+  however, it will pass such files through unmodified. This is
+  how GNU <tt class="computeroutput">gzip</tt> behaves.</p>
+</dd>
+<dt><span class="term"><tt class="computeroutput">-k --keep</tt></span></dt>
+<dd><p>Keep (don't delete) input files during
+  compression or decompression.</p></dd>
+<dt><span class="term"><tt class="computeroutput">-s --small</tt></span></dt>
+<dd>
+<p>Reduce memory usage, for compression,
+  decompression and testing.  Files are decompressed and tested
+  using a modified algorithm which only requires 2.5 bytes per
+  block byte.  This means any file can be decompressed in 2300k
+  of memory, albeit at about half the normal speed.</p>
+<p>During compression, <tt class="computeroutput">-s</tt>
+  selects a block size of 200k, which limits memory use to around
+  the same figure, at the expense of your compression ratio.  In
+  short, if your machine is low on memory (8 megabytes or less),
+  use <tt class="computeroutput">-s</tt> for everything.  See
+  <a href="#memory-management">MEMORY MANAGEMENT</a> below.</p>
+</dd>
+<dt><span class="term"><tt class="computeroutput">-q --quiet</tt></span></dt>
+<dd><p>Suppress non-essential warning messages.
+  Messages pertaining to I/O errors and other critical events
+  will not be suppressed.</p></dd>
+<dt><span class="term"><tt class="computeroutput">-v --verbose</tt></span></dt>
+<dd><p>Verbose mode -- show the compression ratio for
+  each file processed.  Further
+  <tt class="computeroutput">-v</tt>'s increase the verbosity
+  level, spewing out lots of information which is primarily of
+  interest for diagnostic purposes.</p></dd>
+<dt><span class="term"><tt class="computeroutput">-L --license -V --version</tt></span></dt>
+<dd><p>Display the software version, license terms and
+  conditions.</p></dd>
+<dt><span class="term"><tt class="computeroutput">-1</tt> (or
+ <tt class="computeroutput">--fast</tt>) to
+ <tt class="computeroutput">-9</tt> (or
+ <tt class="computeroutput">-best</tt>)</span></dt>
+<dd><p>Set the block size to 100 k, 200 k ...  900 k
+  when compressing.  Has no effect when decompressing.  See <a href="#memory-management">MEMORY MANAGEMENT</a> below.  The
+  <tt class="computeroutput">--fast</tt> and
+  <tt class="computeroutput">--best</tt> aliases are primarily
+  for GNU <tt class="computeroutput">gzip</tt> compatibility.
+  In particular, <tt class="computeroutput">--fast</tt> doesn't
+  make things significantly faster.  And
+  <tt class="computeroutput">--best</tt> merely selects the
+  default behaviour.</p></dd>
+<dt><span class="term"><tt class="computeroutput">--</tt></span></dt>
+<dd><p>Treats all subsequent arguments as file names,
+  even if they start with a dash.  This is so you can handle
+  files with names beginning with a dash, for example:
+  <tt class="computeroutput">bzip2 --
+  -myfilename</tt>.</p></dd>
+<dt>
+<span class="term"><tt class="computeroutput">--repetitive-fast</tt>, </span><span class="term"><tt class="computeroutput">--repetitive-best</tt>, </span>
+</dt>
+<dd><p>These flags are redundant in versions 0.9.5 and
+  above.  They provided some coarse control over the behaviour of
+  the sorting algorithm in earlier versions, which was sometimes
+  useful.  0.9.5 and above have an improved algorithm which
+  renders these flags irrelevant.</p></dd>
+</dl></div>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="memory-management"></a>2.5.�MEMORY MANAGEMENT</h2></div></div>
+<div></div>
+</div>
+<p><tt class="computeroutput">bzip2</tt> compresses large
+files in blocks.  The block size affects both the compression
+ratio achieved, and the amount of memory needed for compression
+and decompression.  The flags <tt class="computeroutput">-1</tt>
+through <tt class="computeroutput">-9</tt> specify the block
+size to be 100,000 bytes through 900,000 bytes (the default)
+respectively.  At decompression time, the block size used for
+compression is read from the header of the compressed file, and
+<tt class="computeroutput">bunzip2</tt> then allocates itself
+just enough memory to decompress the file.  Since block sizes are
+stored in compressed files, it follows that the flags
+<tt class="computeroutput">-1</tt> to
+<tt class="computeroutput">-9</tt> are irrelevant to and so
+ignored during decompression.</p>
+<p>Compression and decompression requirements, in bytes, can be
+estimated as:</p>
+<pre class="programlisting">Compression:   400k + ( 8 x block size )
+
+Decompression: 100k + ( 4 x block size ), or
+               100k + ( 2.5 x block size )</pre>
+<p>Larger block sizes give rapidly diminishing marginal
+returns.  Most of the compression comes from the first two or
+three hundred k of block size, a fact worth bearing in mind when
+using <tt class="computeroutput">bzip2</tt> on small machines.
+It is also important to appreciate that the decompression memory
+requirement is set at compression time by the choice of block
+size.</p>
+<p>For files compressed with the default 900k block size,
+<tt class="computeroutput">bunzip2</tt> will require about 3700
+kbytes to decompress.  To support decompression of any file on a
+4 megabyte machine, <tt class="computeroutput">bunzip2</tt> has
+an option to decompress using approximately half this amount of
+memory, about 2300 kbytes.  Decompression speed is also halved,
+so you should use this option only where necessary.  The relevant
+flag is <tt class="computeroutput">-s</tt>.</p>
+<p>In general, try and use the largest block size memory
+constraints allow, since that maximises the compression achieved.
+Compression and decompression speed are virtually unaffected by
+block size.</p>
+<p>Another significant point applies to files which fit in a
+single block -- that means most files you'd encounter using a
+large block size.  The amount of real memory touched is
+proportional to the size of the file, since the file is smaller
+than a block.  For example, compressing a file 20,000 bytes long
+with the flag <tt class="computeroutput">-9</tt> will cause the
+compressor to allocate around 7600k of memory, but only touch
+400k + 20000 * 8 = 560 kbytes of it.  Similarly, the decompressor
+will allocate 3700k but only touch 100k + 20000 * 4 = 180
+kbytes.</p>
+<p>Here is a table which summarises the maximum memory usage
+for different block sizes.  Also recorded is the total compressed
+size for 14 files of the Calgary Text Compression Corpus
+totalling 3,141,622 bytes.  This column gives some feel for how
+compression varies with block size.  These figures tend to
+understate the advantage of larger block sizes for larger files,
+since the Corpus is dominated by smaller files.</p>
+<pre class="programlisting">        Compress   Decompress   Decompress   Corpus
+Flag     usage      usage       -s usage     Size
+
+ -1      1200k       500k         350k      914704
+ -2      2000k       900k         600k      877703
+ -3      2800k      1300k         850k      860338
+ -4      3600k      1700k        1100k      846899
+ -5      4400k      2100k        1350k      845160
+ -6      5200k      2500k        1600k      838626
+ -7      6100k      2900k        1850k      834096
+ -8      6800k      3300k        2100k      828642
+ -9      7600k      3700k        2350k      828642</pre>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="recovering"></a>2.6.�RECOVERING DATA FROM DAMAGED FILES</h2></div></div>
+<div></div>
+</div>
+<p><tt class="computeroutput">bzip2</tt> compresses files in
+blocks, usually 900kbytes long.  Each block is handled
+independently.  If a media or transmission error causes a
+multi-block <tt class="computeroutput">.bz2</tt> file to become
+damaged, it may be possible to recover data from the undamaged
+blocks in the file.</p>
+<p>The compressed representation of each block is delimited by
+a 48-bit pattern, which makes it possible to find the block
+boundaries with reasonable certainty.  Each block also carries
+its own 32-bit CRC, so damaged blocks can be distinguished from
+undamaged ones.</p>
+<p><tt class="computeroutput">bzip2recover</tt> is a simple
+program whose purpose is to search for blocks in
+<tt class="computeroutput">.bz2</tt> files, and write each block
+out into its own <tt class="computeroutput">.bz2</tt> file.  You
+can then use <tt class="computeroutput">bzip2 -t</tt> to test
+the integrity of the resulting files, and decompress those which
+are undamaged.</p>
+<p><tt class="computeroutput">bzip2recover</tt> takes a
+single argument, the name of the damaged file, and writes a
+number of files <tt class="computeroutput">rec0001file.bz2</tt>,
+<tt class="computeroutput">rec0002file.bz2</tt>, etc, containing
+the extracted blocks.  The output filenames are designed so that
+the use of wildcards in subsequent processing -- for example,
+<tt class="computeroutput">bzip2 -dc rec*file.bz2 &gt;
+recovered_data</tt> -- lists the files in the correct
+order.</p>
+<p><tt class="computeroutput">bzip2recover</tt> should be of
+most use dealing with large <tt class="computeroutput">.bz2</tt>
+files, as these will contain many blocks.  It is clearly futile
+to use it on damaged single-block files, since a damaged block
+cannot be recovered.  If you wish to minimise any potential data
+loss through media or transmission errors, you might consider
+compressing with a smaller block size.</p>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="performance"></a>2.7.�PERFORMANCE NOTES</h2></div></div>
+<div></div>
+</div>
+<p>The sorting phase of compression gathers together similar
+strings in the file.  Because of this, files containing very long
+runs of repeated symbols, like "aabaabaabaab ..."  (repeated
+several hundred times) may compress more slowly than normal.
+Versions 0.9.5 and above fare much better than previous versions
+in this respect.  The ratio between worst-case and average-case
+compression time is in the region of 10:1.  For previous
+versions, this figure was more like 100:1.  You can use the
+<tt class="computeroutput">-vvvv</tt> option to monitor progress
+in great detail, if you want.</p>
+<p>Decompression speed is unaffected by these
+phenomena.</p>
+<p><tt class="computeroutput">bzip2</tt> usually allocates
+several megabytes of memory to operate in, and then charges all
+over it in a fairly random fashion.  This means that performance,
+both for compressing and decompressing, is largely determined by
+the speed at which your machine can service cache misses.
+Because of this, small changes to the code to reduce the miss
+rate have been observed to give disproportionately large
+performance improvements.  I imagine
+<tt class="computeroutput">bzip2</tt> will perform best on
+machines with very large caches.</p>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="caveats"></a>2.8.�CAVEATS</h2></div></div>
+<div></div>
+</div>
+<p>I/O error messages are not as helpful as they could be.
+<tt class="computeroutput">bzip2</tt> tries hard to detect I/O
+errors and exit cleanly, but the details of what the problem is
+sometimes seem rather misleading.</p>
+<p>This manual page pertains to version 1.0.3 of
+<tt class="computeroutput">bzip2</tt>.  Compressed data created
+by this version is entirely forwards and backwards compatible
+with the previous public releases, versions 0.1pl2, 0.9.0 and
+0.9.5, 1.0.0, 1.0.1 and 1.0.2, but with the following exception: 0.9.0
+and above can correctly decompress multiple concatenated
+compressed files.  0.1pl2 cannot do this; it will stop after
+decompressing just the first file in the stream.</p>
+<p><tt class="computeroutput">bzip2recover</tt> versions
+prior to 1.0.2 used 32-bit integers to represent bit positions in
+compressed files, so it could not handle compressed files more
+than 512 megabytes long.  Versions 1.0.2 and above use 64-bit ints
+on some platforms which support them (GNU supported targets, and
+Windows). To establish whether or not
+<tt class="computeroutput">bzip2recover</tt> was built with such
+a limitation, run it without arguments. In any event you can
+build yourself an unlimited version if you can recompile it with
+<tt class="computeroutput">MaybeUInt64</tt> set to be an
+unsigned 64-bit integer.</p>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="author"></a>2.9.�AUTHOR</h2></div></div>
+<div></div>
+</div>
+<p>Julian Seward,
+<tt class="computeroutput">jseward@bzip.org</tt></p>
+<p>The ideas embodied in
+<tt class="computeroutput">bzip2</tt> are due to (at least) the
+following people: Michael Burrows and David Wheeler (for the
+block sorting transformation), David Wheeler (again, for the
+Huffman coder), Peter Fenwick (for the structured coding model in
+the original <tt class="computeroutput">bzip</tt>, and many
+refinements), and Alistair Moffat, Radford Neal and Ian Witten
+(for the arithmetic coder in the original
+<tt class="computeroutput">bzip</tt>).  I am much indebted for
+their help, support and advice.  See the manual in the source
+distribution for pointers to sources of documentation.  Christian
+von Roques encouraged me to look for faster sorting algorithms,
+so as to speed up compression.  Bela Lubkin encouraged me to
+improve the worst-case compression performance.  
+Donna Robinson XMLised the documentation.
+Many people sent
+patches, helped with portability problems, lent machines, gave
+advice and were generally helpful.</p>
+</div>
+</div>
+<div class="chapter" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title">
+<a name="libprog"></a>3.�
+Programming with <tt class="computeroutput">libbzip2</tt>
+</h2></div></div>
+<div></div>
+</div>
+<div class="toc">
+<p><b>Table of Contents</b></p>
+<dl>
+<dt><span class="sect1"><a href="#top-level">3.1. Top-level structure</a></span></dt>
+<dd><dl>
+<dt><span class="sect2"><a href="#ll-summary">3.1.1. Low-level summary</a></span></dt>
+<dt><span class="sect2"><a href="#hl-summary">3.1.2. High-level summary</a></span></dt>
+<dt><span class="sect2"><a href="#util-fns-summary">3.1.3. Utility functions summary</a></span></dt>
+</dl></dd>
+<dt><span class="sect1"><a href="#err-handling">3.2. Error handling</a></span></dt>
+<dt><span class="sect1"><a href="#low-level">3.3. Low-level interface</a></span></dt>
+<dd><dl>
+<dt><span class="sect2"><a href="#bzcompress-init">3.3.1. BZ2_bzCompressInit</a></span></dt>
+<dt><span class="sect2"><a href="#bzCompress">3.3.2. BZ2_bzCompress</a></span></dt>
+<dt><span class="sect2"><a href="#bzCompress-end">3.3.3. BZ2_bzCompressEnd</a></span></dt>
+<dt><span class="sect2"><a href="#bzDecompress-init">3.3.4. BZ2_bzDecompressInit</a></span></dt>
+<dt><span class="sect2"><a href="#bzDecompress">3.3.5. BZ2_bzDecompress</a></span></dt>
+<dt><span class="sect2"><a href="#bzDecompress-end">3.3.6. BZ2_bzDecompressEnd</a></span></dt>
+</dl></dd>
+<dt><span class="sect1"><a href="#hl-interface">3.4. High-level interface</a></span></dt>
+<dd><dl>
+<dt><span class="sect2"><a href="#bzreadopen">3.4.1. BZ2_bzReadOpen</a></span></dt>
+<dt><span class="sect2"><a href="#bzread">3.4.2. BZ2_bzRead</a></span></dt>
+<dt><span class="sect2"><a href="#bzreadgetunused">3.4.3. BZ2_bzReadGetUnused</a></span></dt>
+<dt><span class="sect2"><a href="#bzreadclose">3.4.4. BZ2_bzReadClose</a></span></dt>
+<dt><span class="sect2"><a href="#bzwriteopen">3.4.5. BZ2_bzWriteOpen</a></span></dt>
+<dt><span class="sect2"><a href="#bzwrite">3.4.6. BZ2_bzWrite</a></span></dt>
+<dt><span class="sect2"><a href="#bzwriteclose">3.4.7. BZ2_bzWriteClose</a></span></dt>
+<dt><span class="sect2"><a href="#embed">3.4.8. Handling embedded compressed data streams</a></span></dt>
+<dt><span class="sect2"><a href="#std-rdwr">3.4.9. Standard file-reading/writing code</a></span></dt>
+</dl></dd>
+<dt><span class="sect1"><a href="#util-fns">3.5. Utility functions</a></span></dt>
+<dd><dl>
+<dt><span class="sect2"><a href="#bzbufftobuffcompress">3.5.1. BZ2_bzBuffToBuffCompress</a></span></dt>
+<dt><span class="sect2"><a href="#bzbufftobuffdecompress">3.5.2. BZ2_bzBuffToBuffDecompress</a></span></dt>
+</dl></dd>
+<dt><span class="sect1"><a href="#zlib-compat">3.6. zlib compatibility functions</a></span></dt>
+<dt><span class="sect1"><a href="#stdio-free">3.7. Using the library in a stdio-free environment</a></span></dt>
+<dd><dl>
+<dt><span class="sect2"><a href="#stdio-bye">3.7.1. Getting rid of stdio</a></span></dt>
+<dt><span class="sect2"><a href="#critical-error">3.7.2. Critical error handling</a></span></dt>
+</dl></dd>
+<dt><span class="sect1"><a href="#win-dll">3.8. Making a Windows DLL</a></span></dt>
+</dl>
+</div>
+<p>This chapter describes the programming interface to
+<tt class="computeroutput">libbzip2</tt>.</p>
+<p>For general background information, particularly about
+memory use and performance aspects, you'd be well advised to read
+<a href="#using">How to use bzip2</a> as well.</p>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="top-level"></a>3.1.�Top-level structure</h2></div></div>
+<div></div>
+</div>
+<p><tt class="computeroutput">libbzip2</tt> is a flexible
+library for compressing and decompressing data in the
+<tt class="computeroutput">bzip2</tt> data format.  Although
+packaged as a single entity, it helps to regard the library as
+three separate parts: the low level interface, and the high level
+interface, and some utility functions.</p>
+<p>The structure of
+<tt class="computeroutput">libbzip2</tt>'s interfaces is similar
+to that of Jean-loup Gailly's and Mark Adler's excellent
+<tt class="computeroutput">zlib</tt> library.</p>
+<p>All externally visible symbols have names beginning
+<tt class="computeroutput">BZ2_</tt>.  This is new in version
+1.0.  The intention is to minimise pollution of the namespaces of
+library clients.</p>
+<p>To use any part of the library, you need to
+<tt class="computeroutput">#include &lt;bzlib.h&gt;</tt>
+into your sources.</p>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="ll-summary"></a>3.1.1.�Low-level summary</h3></div></div>
+<div></div>
+</div>
+<p>This interface provides services for compressing and
+decompressing data in memory.  There's no provision for dealing
+with files, streams or any other I/O mechanisms, just straight
+memory-to-memory work.  In fact, this part of the library can be
+compiled without inclusion of
+<tt class="computeroutput">stdio.h</tt>, which may be helpful
+for embedded applications.</p>
+<p>The low-level part of the library has no global variables
+and is therefore thread-safe.</p>
+<p>Six routines make up the low level interface:
+<tt class="computeroutput">BZ2_bzCompressInit</tt>,
+<tt class="computeroutput">BZ2_bzCompress</tt>, and
+<tt class="computeroutput">BZ2_bzCompressEnd</tt> for
+compression, and a corresponding trio
+<tt class="computeroutput">BZ2_bzDecompressInit</tt>,
+<tt class="computeroutput">BZ2_bzDecompress</tt> and
+<tt class="computeroutput">BZ2_bzDecompressEnd</tt> for
+decompression.  The <tt class="computeroutput">*Init</tt>
+functions allocate memory for compression/decompression and do
+other initialisations, whilst the
+<tt class="computeroutput">*End</tt> functions close down
+operations and release memory.</p>
+<p>The real work is done by
+<tt class="computeroutput">BZ2_bzCompress</tt> and
+<tt class="computeroutput">BZ2_bzDecompress</tt>.  These
+compress and decompress data from a user-supplied input buffer to
+a user-supplied output buffer.  These buffers can be any size;
+arbitrary quantities of data are handled by making repeated calls
+to these functions.  This is a flexible mechanism allowing a
+consumer-pull style of activity, or producer-push, or a mixture
+of both.</p>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="hl-summary"></a>3.1.2.�High-level summary</h3></div></div>
+<div></div>
+</div>
+<p>This interface provides some handy wrappers around the
+low-level interface to facilitate reading and writing
+<tt class="computeroutput">bzip2</tt> format files
+(<tt class="computeroutput">.bz2</tt> files).  The routines
+provide hooks to facilitate reading files in which the
+<tt class="computeroutput">bzip2</tt> data stream is embedded
+within some larger-scale file structure, or where there are
+multiple <tt class="computeroutput">bzip2</tt> data streams
+concatenated end-to-end.</p>
+<p>For reading files,
+<tt class="computeroutput">BZ2_bzReadOpen</tt>,
+<tt class="computeroutput">BZ2_bzRead</tt>,
+<tt class="computeroutput">BZ2_bzReadClose</tt> and 
+<tt class="computeroutput">BZ2_bzReadGetUnused</tt> are
+supplied.  For writing files,
+<tt class="computeroutput">BZ2_bzWriteOpen</tt>,
+<tt class="computeroutput">BZ2_bzWrite</tt> and
+<tt class="computeroutput">BZ2_bzWriteFinish</tt> are
+available.</p>
+<p>As with the low-level library, no global variables are used
+so the library is per se thread-safe.  However, if I/O errors
+occur whilst reading or writing the underlying compressed files,
+you may have to consult <tt class="computeroutput">errno</tt> to
+determine the cause of the error.  In that case, you'd need a C
+library which correctly supports
+<tt class="computeroutput">errno</tt> in a multithreaded
+environment.</p>
+<p>To make the library a little simpler and more portable,
+<tt class="computeroutput">BZ2_bzReadOpen</tt> and
+<tt class="computeroutput">BZ2_bzWriteOpen</tt> require you to
+pass them file handles (<tt class="computeroutput">FILE*</tt>s)
+which have previously been opened for reading or writing
+respectively.  That avoids portability problems associated with
+file operations and file attributes, whilst not being much of an
+imposition on the programmer.</p>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="util-fns-summary"></a>3.1.3.�Utility functions summary</h3></div></div>
+<div></div>
+</div>
+<p>For very simple needs,
+<tt class="computeroutput">BZ2_bzBuffToBuffCompress</tt> and
+<tt class="computeroutput">BZ2_bzBuffToBuffDecompress</tt> are
+provided.  These compress data in memory from one buffer to
+another buffer in a single function call.  You should assess
+whether these functions fulfill your memory-to-memory
+compression/decompression requirements before investing effort in
+understanding the more general but more complex low-level
+interface.</p>
+<p>Yoshioka Tsuneo
+(<tt class="computeroutput">QWF00133@niftyserve.or.jp</tt> /
+<tt class="computeroutput">tsuneo-y@is.aist-nara.ac.jp</tt>) has
+contributed some functions to give better
+<tt class="computeroutput">zlib</tt> compatibility.  These
+functions are <tt class="computeroutput">BZ2_bzopen</tt>,
+<tt class="computeroutput">BZ2_bzread</tt>,
+<tt class="computeroutput">BZ2_bzwrite</tt>,
+<tt class="computeroutput">BZ2_bzflush</tt>,
+<tt class="computeroutput">BZ2_bzclose</tt>,
+<tt class="computeroutput">BZ2_bzerror</tt> and
+<tt class="computeroutput">BZ2_bzlibVersion</tt>.  You may find
+these functions more convenient for simple file reading and
+writing, than those in the high-level interface.  These functions
+are not (yet) officially part of the library, and are minimally
+documented here.  If they break, you get to keep all the pieces.
+I hope to document them properly when time permits.</p>
+<p>Yoshioka also contributed modifications to allow the
+library to be built as a Windows DLL.</p>
+</div>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="err-handling"></a>3.2.�Error handling</h2></div></div>
+<div></div>
+</div>
+<p>The library is designed to recover cleanly in all
+situations, including the worst-case situation of decompressing
+random data.  I'm not 100% sure that it can always do this, so
+you might want to add a signal handler to catch segmentation
+violations during decompression if you are feeling especially
+paranoid.  I would be interested in hearing more about the
+robustness of the library to corrupted compressed data.</p>
+<p>Version 1.0.3 more robust in this respect than any
+previous version.  Investigations with Valgrind (a tool for detecting
+problems with memory management) indicate
+that, at least for the few files I tested, all single-bit errors
+in the decompressed data are caught properly, with no
+segmentation faults, no uses of uninitialised data, no out of
+range reads or writes, and no infinite looping in the decompressor.
+So it's certainly pretty robust, although
+I wouldn't claim it to be totally bombproof.</p>
+<p>The file <tt class="computeroutput">bzlib.h</tt> contains
+all definitions needed to use the library.  In particular, you
+should definitely not include
+<tt class="computeroutput">bzlib_private.h</tt>.</p>
+<p>In <tt class="computeroutput">bzlib.h</tt>, the various
+return values are defined.  The following list is not intended as
+an exhaustive description of the circumstances in which a given
+value may be returned -- those descriptions are given later.
+Rather, it is intended to convey the rough meaning of each return
+value.  The first five actions are normal and not intended to
+denote an error situation.</p>
+<div class="variablelist"><dl>
+<dt><span class="term"><tt class="computeroutput">BZ_OK</tt></span></dt>
+<dd><p>The requested action was completed
+   successfully.</p></dd>
+<dt><span class="term"><tt class="computeroutput">BZ_RUN_OK, BZ_FLUSH_OK,
+    BZ_FINISH_OK</tt></span></dt>
+<dd><p>In 
+   <tt class="computeroutput">BZ2_bzCompress</tt>, the requested
+   flush/finish/nothing-special action was completed
+   successfully.</p></dd>
+<dt><span class="term"><tt class="computeroutput">BZ_STREAM_END</tt></span></dt>
+<dd><p>Compression of data was completed, or the
+   logical stream end was detected during
+   decompression.</p></dd>
+</dl></div>
+<p>The following return values indicate an error of some
+kind.</p>
+<div class="variablelist"><dl>
+<dt><span class="term"><tt class="computeroutput">BZ_CONFIG_ERROR</tt></span></dt>
+<dd><p>Indicates that the library has been improperly
+   compiled on your platform -- a major configuration error.
+   Specifically, it means that
+   <tt class="computeroutput">sizeof(char)</tt>,
+   <tt class="computeroutput">sizeof(short)</tt> and
+   <tt class="computeroutput">sizeof(int)</tt> are not 1, 2 and
+   4 respectively, as they should be.  Note that the library
+   should still work properly on 64-bit platforms which follow
+   the LP64 programming model -- that is, where
+   <tt class="computeroutput">sizeof(long)</tt> and
+   <tt class="computeroutput">sizeof(void*)</tt> are 8.  Under
+   LP64, <tt class="computeroutput">sizeof(int)</tt> is still 4,
+   so <tt class="computeroutput">libbzip2</tt>, which doesn't
+   use the <tt class="computeroutput">long</tt> type, is
+   OK.</p></dd>
+<dt><span class="term"><tt class="computeroutput">BZ_SEQUENCE_ERROR</tt></span></dt>
+<dd><p>When using the library, it is important to call
+   the functions in the correct sequence and with data structures
+   (buffers etc) in the correct states.
+   <tt class="computeroutput">libbzip2</tt> checks as much as it
+   can to ensure this is happening, and returns
+   <tt class="computeroutput">BZ_SEQUENCE_ERROR</tt> if not.
+   Code which complies precisely with the function semantics, as
+   detailed below, should never receive this value; such an event
+   denotes buggy code which you should
+   investigate.</p></dd>
+<dt><span class="term"><tt class="computeroutput">BZ_PARAM_ERROR</tt></span></dt>
+<dd><p>Returned when a parameter to a function call is
+   out of range or otherwise manifestly incorrect.  As with
+   <tt class="computeroutput">BZ_SEQUENCE_ERROR</tt>, this
+   denotes a bug in the client code.  The distinction between
+   <tt class="computeroutput">BZ_PARAM_ERROR</tt> and
+   <tt class="computeroutput">BZ_SEQUENCE_ERROR</tt> is a bit
+   hazy, but still worth making.</p></dd>
+<dt><span class="term"><tt class="computeroutput">BZ_MEM_ERROR</tt></span></dt>
+<dd><p>Returned when a request to allocate memory
+   failed.  Note that the quantity of memory needed to decompress
+   a stream cannot be determined until the stream's header has
+   been read.  So
+   <tt class="computeroutput">BZ2_bzDecompress</tt> and
+   <tt class="computeroutput">BZ2_bzRead</tt> may return
+   <tt class="computeroutput">BZ_MEM_ERROR</tt> even though some
+   of the compressed data has been read.  The same is not true
+   for compression; once
+   <tt class="computeroutput">BZ2_bzCompressInit</tt> or
+   <tt class="computeroutput">BZ2_bzWriteOpen</tt> have
+   successfully completed,
+   <tt class="computeroutput">BZ_MEM_ERROR</tt> cannot
+   occur.</p></dd>
+<dt><span class="term"><tt class="computeroutput">BZ_DATA_ERROR</tt></span></dt>
+<dd><p>Returned when a data integrity error is
+   detected during decompression.  Most importantly, this means
+   when stored and computed CRCs for the data do not match.  This
+   value is also returned upon detection of any other anomaly in
+   the compressed data.</p></dd>
+<dt><span class="term"><tt class="computeroutput">BZ_DATA_ERROR_MAGIC</tt></span></dt>
+<dd><p>As a special case of
+   <tt class="computeroutput">BZ_DATA_ERROR</tt>, it is
+   sometimes useful to know when the compressed stream does not
+   start with the correct magic bytes (<tt class="computeroutput">'B' 'Z'
+   'h'</tt>).</p></dd>
+<dt><span class="term"><tt class="computeroutput">BZ_IO_ERROR</tt></span></dt>
+<dd><p>Returned by
+   <tt class="computeroutput">BZ2_bzRead</tt> and
+   <tt class="computeroutput">BZ2_bzWrite</tt> when there is an
+   error reading or writing in the compressed file, and by
+   <tt class="computeroutput">BZ2_bzReadOpen</tt> and
+   <tt class="computeroutput">BZ2_bzWriteOpen</tt> for attempts
+   to use a file for which the error indicator (viz,
+   <tt class="computeroutput">ferror(f)</tt>) is set.  On
+   receipt of <tt class="computeroutput">BZ_IO_ERROR</tt>, the
+   caller should consult <tt class="computeroutput">errno</tt>
+   and/or <tt class="computeroutput">perror</tt> to acquire
+   operating-system specific information about the
+   problem.</p></dd>
+<dt><span class="term"><tt class="computeroutput">BZ_UNEXPECTED_EOF</tt></span></dt>
+<dd><p>Returned by
+   <tt class="computeroutput">BZ2_bzRead</tt> when the
+   compressed file finishes before the logical end of stream is
+   detected.</p></dd>
+<dt><span class="term"><tt class="computeroutput">BZ_OUTBUFF_FULL</tt></span></dt>
+<dd><p>Returned by
+   <tt class="computeroutput">BZ2_bzBuffToBuffCompress</tt> and
+   <tt class="computeroutput">BZ2_bzBuffToBuffDecompress</tt> to
+   indicate that the output data will not fit into the output
+   buffer provided.</p></dd>
+</dl></div>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="low-level"></a>3.3.�Low-level interface</h2></div></div>
+<div></div>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzcompress-init"></a>3.3.1.�<tt class="computeroutput">BZ2_bzCompressInit</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">typedef struct {
+  char *next_in;
+  unsigned int avail_in;
+  unsigned int total_in_lo32;
+  unsigned int total_in_hi32;
+
+  char *next_out;
+  unsigned int avail_out;
+  unsigned int total_out_lo32;
+  unsigned int total_out_hi32;
+
+  void *state;
+
+  void *(*bzalloc)(void *,int,int);
+  void (*bzfree)(void *,void *);
+  void *opaque;
+} bz_stream;
+
+int BZ2_bzCompressInit ( bz_stream *strm, 
+                         int blockSize100k, 
+                         int verbosity,
+                         int workFactor );</pre>
+<p>Prepares for compression.  The
+<tt class="computeroutput">bz_stream</tt> structure holds all
+data pertaining to the compression activity.  A
+<tt class="computeroutput">bz_stream</tt> structure should be
+allocated and initialised prior to the call.  The fields of
+<tt class="computeroutput">bz_stream</tt> comprise the entirety
+of the user-visible data.  <tt class="computeroutput">state</tt>
+is a pointer to the private data structures required for
+compression.</p>
+<p>Custom memory allocators are supported, via fields
+<tt class="computeroutput">bzalloc</tt>,
+<tt class="computeroutput">bzfree</tt>, and
+<tt class="computeroutput">opaque</tt>.  The value
+<tt class="computeroutput">opaque</tt> is passed to as the first
+argument to all calls to <tt class="computeroutput">bzalloc</tt>
+and <tt class="computeroutput">bzfree</tt>, but is otherwise
+ignored by the library.  The call <tt class="computeroutput">bzalloc (
+opaque, n, m )</tt> is expected to return a pointer
+<tt class="computeroutput">p</tt> to <tt class="computeroutput">n *
+m</tt> bytes of memory, and <tt class="computeroutput">bzfree (
+opaque, p )</tt> should free that memory.</p>
+<p>If you don't want to use a custom memory allocator, set
+<tt class="computeroutput">bzalloc</tt>,
+<tt class="computeroutput">bzfree</tt> and
+<tt class="computeroutput">opaque</tt> to
+<tt class="computeroutput">NULL</tt>, and the library will then
+use the standard <tt class="computeroutput">malloc</tt> /
+<tt class="computeroutput">free</tt> routines.</p>
+<p>Before calling
+<tt class="computeroutput">BZ2_bzCompressInit</tt>, fields
+<tt class="computeroutput">bzalloc</tt>,
+<tt class="computeroutput">bzfree</tt> and
+<tt class="computeroutput">opaque</tt> should be filled
+appropriately, as just described.  Upon return, the internal
+state will have been allocated and initialised, and
+<tt class="computeroutput">total_in_lo32</tt>,
+<tt class="computeroutput">total_in_hi32</tt>,
+<tt class="computeroutput">total_out_lo32</tt> and
+<tt class="computeroutput">total_out_hi32</tt> will have been
+set to zero.  These four fields are used by the library to inform
+the caller of the total amount of data passed into and out of the
+library, respectively.  You should not try to change them.  As of
+version 1.0, 64-bit counts are maintained, even on 32-bit
+platforms, using the <tt class="computeroutput">_hi32</tt>
+fields to store the upper 32 bits of the count.  So, for example,
+the total amount of data in is <tt class="computeroutput">(total_in_hi32
+&lt;&lt; 32) + total_in_lo32</tt>.</p>
+<p>Parameter <tt class="computeroutput">blockSize100k</tt>
+specifies the block size to be used for compression.  It should
+be a value between 1 and 9 inclusive, and the actual block size
+used is 100000 x this figure.  9 gives the best compression but
+takes most memory.</p>
+<p>Parameter <tt class="computeroutput">verbosity</tt> should
+be set to a number between 0 and 4 inclusive.  0 is silent, and
+greater numbers give increasingly verbose monitoring/debugging
+output.  If the library has been compiled with
+<tt class="computeroutput">-DBZ_NO_STDIO</tt>, no such output
+will appear for any verbosity setting.</p>
+<p>Parameter <tt class="computeroutput">workFactor</tt>
+controls how the compression phase behaves when presented with
+worst case, highly repetitive, input data.  If compression runs
+into difficulties caused by repetitive data, the library switches
+from the standard sorting algorithm to a fallback algorithm.  The
+fallback is slower than the standard algorithm by perhaps a
+factor of three, but always behaves reasonably, no matter how bad
+the input.</p>
+<p>Lower values of <tt class="computeroutput">workFactor</tt>
+reduce the amount of effort the standard algorithm will expend
+before resorting to the fallback.  You should set this parameter
+carefully; too low, and many inputs will be handled by the
+fallback algorithm and so compress rather slowly, too high, and
+your average-to-worst case compression times can become very
+large.  The default value of 30 gives reasonable behaviour over a
+wide range of circumstances.</p>
+<p>Allowable values range from 0 to 250 inclusive.  0 is a
+special case, equivalent to using the default value of 30.</p>
+<p>Note that the compressed output generated is the same
+regardless of whether or not the fallback algorithm is
+used.</p>
+<p>Be aware also that this parameter may disappear entirely in
+future versions of the library.  In principle it should be
+possible to devise a good way to automatically choose which
+algorithm to use.  Such a mechanism would render the parameter
+obsolete.</p>
+<p>Possible return values:</p>
+<pre class="programlisting">BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if strm is NULL 
+  or blockSize &lt; 1 or blockSize &gt; 9
+  or verbosity &lt; 0 or verbosity &gt; 4
+  or workFactor &lt; 0 or workFactor &gt; 250
+BZ_MEM_ERROR 
+  if not enough memory is available
+BZ_OK 
+  otherwise</pre>
+<p>Allowable next actions:</p>
+<pre class="programlisting">BZ2_bzCompress
+  if BZ_OK is returned
+  no specific action needed in case of error</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzCompress"></a>3.3.2.�<tt class="computeroutput">BZ2_bzCompress</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">int BZ2_bzCompress ( bz_stream *strm, int action );</pre>
+<p>Provides more input and/or output buffer space for the
+library.  The caller maintains input and output buffers, and
+calls <tt class="computeroutput">BZ2_bzCompress</tt> to transfer
+data between them.</p>
+<p>Before each call to
+<tt class="computeroutput">BZ2_bzCompress</tt>,
+<tt class="computeroutput">next_in</tt> should point at the data
+to be compressed, and <tt class="computeroutput">avail_in</tt>
+should indicate how many bytes the library may read.
+<tt class="computeroutput">BZ2_bzCompress</tt> updates
+<tt class="computeroutput">next_in</tt>,
+<tt class="computeroutput">avail_in</tt> and
+<tt class="computeroutput">total_in</tt> to reflect the number
+of bytes it has read.</p>
+<p>Similarly, <tt class="computeroutput">next_out</tt> should
+point to a buffer in which the compressed data is to be placed,
+with <tt class="computeroutput">avail_out</tt> indicating how
+much output space is available.
+<tt class="computeroutput">BZ2_bzCompress</tt> updates
+<tt class="computeroutput">next_out</tt>,
+<tt class="computeroutput">avail_out</tt> and
+<tt class="computeroutput">total_out</tt> to reflect the number
+of bytes output.</p>
+<p>You may provide and remove as little or as much data as you
+like on each call of
+<tt class="computeroutput">BZ2_bzCompress</tt>.  In the limit,
+it is acceptable to supply and remove data one byte at a time,
+although this would be terribly inefficient.  You should always
+ensure that at least one byte of output space is available at
+each call.</p>
+<p>A second purpose of
+<tt class="computeroutput">BZ2_bzCompress</tt> is to request a
+change of mode of the compressed stream.</p>
+<p>Conceptually, a compressed stream can be in one of four
+states: IDLE, RUNNING, FLUSHING and FINISHING.  Before
+initialisation
+(<tt class="computeroutput">BZ2_bzCompressInit</tt>) and after
+termination (<tt class="computeroutput">BZ2_bzCompressEnd</tt>),
+a stream is regarded as IDLE.</p>
+<p>Upon initialisation
+(<tt class="computeroutput">BZ2_bzCompressInit</tt>), the stream
+is placed in the RUNNING state.  Subsequent calls to
+<tt class="computeroutput">BZ2_bzCompress</tt> should pass
+<tt class="computeroutput">BZ_RUN</tt> as the requested action;
+other actions are illegal and will result in
+<tt class="computeroutput">BZ_SEQUENCE_ERROR</tt>.</p>
+<p>At some point, the calling program will have provided all
+the input data it wants to.  It will then want to finish up -- in
+effect, asking the library to process any data it might have
+buffered internally.  In this state,
+<tt class="computeroutput">BZ2_bzCompress</tt> will no longer
+attempt to read data from
+<tt class="computeroutput">next_in</tt>, but it will want to
+write data to <tt class="computeroutput">next_out</tt>.  Because
+the output buffer supplied by the user can be arbitrarily small,
+the finishing-up operation cannot necessarily be done with a
+single call of
+<tt class="computeroutput">BZ2_bzCompress</tt>.</p>
+<p>Instead, the calling program passes
+<tt class="computeroutput">BZ_FINISH</tt> as an action to
+<tt class="computeroutput">BZ2_bzCompress</tt>.  This changes
+the stream's state to FINISHING.  Any remaining input (ie,
+<tt class="computeroutput">next_in[0 .. avail_in-1]</tt>) is
+compressed and transferred to the output buffer.  To do this,
+<tt class="computeroutput">BZ2_bzCompress</tt> must be called
+repeatedly until all the output has been consumed.  At that
+point, <tt class="computeroutput">BZ2_bzCompress</tt> returns
+<tt class="computeroutput">BZ_STREAM_END</tt>, and the stream's
+state is set back to IDLE.
+<tt class="computeroutput">BZ2_bzCompressEnd</tt> should then be
+called.</p>
+<p>Just to make sure the calling program does not cheat, the
+library makes a note of <tt class="computeroutput">avail_in</tt>
+at the time of the first call to
+<tt class="computeroutput">BZ2_bzCompress</tt> which has
+<tt class="computeroutput">BZ_FINISH</tt> as an action (ie, at
+the time the program has announced its intention to not supply
+any more input).  By comparing this value with that of
+<tt class="computeroutput">avail_in</tt> over subsequent calls
+to <tt class="computeroutput">BZ2_bzCompress</tt>, the library
+can detect any attempts to slip in more data to compress.  Any
+calls for which this is detected will return
+<tt class="computeroutput">BZ_SEQUENCE_ERROR</tt>.  This
+indicates a programming mistake which should be corrected.</p>
+<p>Instead of asking to finish, the calling program may ask
+<tt class="computeroutput">BZ2_bzCompress</tt> to take all the
+remaining input, compress it and terminate the current
+(Burrows-Wheeler) compression block.  This could be useful for
+error control purposes.  The mechanism is analogous to that for
+finishing: call <tt class="computeroutput">BZ2_bzCompress</tt>
+with an action of <tt class="computeroutput">BZ_FLUSH</tt>,
+remove output data, and persist with the
+<tt class="computeroutput">BZ_FLUSH</tt> action until the value
+<tt class="computeroutput">BZ_RUN</tt> is returned.  As with
+finishing, <tt class="computeroutput">BZ2_bzCompress</tt>
+detects any attempt to provide more input data once the flush has
+begun.</p>
+<p>Once the flush is complete, the stream returns to the
+normal RUNNING state.</p>
+<p>This all sounds pretty complex, but isn't really.  Here's a
+table which shows which actions are allowable in each state, what
+action will be taken, what the next state is, and what the
+non-error return values are.  Note that you can't explicitly ask
+what state the stream is in, but nor do you need to -- it can be
+inferred from the values returned by
+<tt class="computeroutput">BZ2_bzCompress</tt>.</p>
+<pre class="programlisting">IDLE/any
+  Illegal.  IDLE state only exists after BZ2_bzCompressEnd or
+  before BZ2_bzCompressInit.
+  Return value = BZ_SEQUENCE_ERROR
+
+RUNNING/BZ_RUN
+  Compress from next_in to next_out as much as possible.
+  Next state = RUNNING
+  Return value = BZ_RUN_OK
+
+RUNNING/BZ_FLUSH
+  Remember current value of next_in. Compress from next_in
+  to next_out as much as possible, but do not accept any more input.
+  Next state = FLUSHING
+  Return value = BZ_FLUSH_OK
+
+RUNNING/BZ_FINISH
+  Remember current value of next_in. Compress from next_in
+  to next_out as much as possible, but do not accept any more input.
+  Next state = FINISHING
+  Return value = BZ_FINISH_OK
+
+FLUSHING/BZ_FLUSH
+  Compress from next_in to next_out as much as possible, 
+  but do not accept any more input.
+  If all the existing input has been used up and all compressed
+  output has been removed
+    Next state = RUNNING; Return value = BZ_RUN_OK
+  else
+    Next state = FLUSHING; Return value = BZ_FLUSH_OK
+
+FLUSHING/other     
+  Illegal.
+  Return value = BZ_SEQUENCE_ERROR
+
+FINISHING/BZ_FINISH
+  Compress from next_in to next_out as much as possible,
+  but to not accept any more input.  
+  If all the existing input has been used up and all compressed
+  output has been removed
+    Next state = IDLE; Return value = BZ_STREAM_END
+  else
+    Next state = FINISHING; Return value = BZ_FINISHING
+
+FINISHING/other
+  Illegal.
+  Return value = BZ_SEQUENCE_ERROR</pre>
+<p>That still looks complicated?  Well, fair enough.  The
+usual sequence of calls for compressing a load of data is:</p>
+<div class="orderedlist"><ol type="1">
+<li><p>Get started with
+  <tt class="computeroutput">BZ2_bzCompressInit</tt>.</p></li>
+<li><p>Shovel data in and shlurp out its compressed form
+  using zero or more calls of
+  <tt class="computeroutput">BZ2_bzCompress</tt> with action =
+  <tt class="computeroutput">BZ_RUN</tt>.</p></li>
+<li><p>Finish up. Repeatedly call
+  <tt class="computeroutput">BZ2_bzCompress</tt> with action =
+  <tt class="computeroutput">BZ_FINISH</tt>, copying out the
+  compressed output, until
+  <tt class="computeroutput">BZ_STREAM_END</tt> is
+  returned.</p></li>
+<li><p>Close up and go home.  Call
+  <tt class="computeroutput">BZ2_bzCompressEnd</tt>.</p></li>
+</ol></div>
+<p>If the data you want to compress fits into your input
+buffer all at once, you can skip the calls of
+<tt class="computeroutput">BZ2_bzCompress ( ..., BZ_RUN )</tt>
+and just do the <tt class="computeroutput">BZ2_bzCompress ( ..., BZ_FINISH
+)</tt> calls.</p>
+<p>All required memory is allocated by
+<tt class="computeroutput">BZ2_bzCompressInit</tt>.  The
+compression library can accept any data at all (obviously).  So
+you shouldn't get any error return values from the
+<tt class="computeroutput">BZ2_bzCompress</tt> calls.  If you
+do, they will be
+<tt class="computeroutput">BZ_SEQUENCE_ERROR</tt>, and indicate
+a bug in your programming.</p>
+<p>Trivial other possible return values:</p>
+<pre class="programlisting">BZ_PARAM_ERROR
+  if strm is NULL, or strm-&gt;s is NULL</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzCompress-end"></a>3.3.3.�<tt class="computeroutput">BZ2_bzCompressEnd</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">int BZ2_bzCompressEnd ( bz_stream *strm );</pre>
+<p>Releases all memory associated with a compression
+stream.</p>
+<p>Possible return values:</p>
+<pre class="programlisting">BZ_PARAM_ERROR  if strm is NULL or strm-&gt;s is NULL
+BZ_OK           otherwise</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzDecompress-init"></a>3.3.4.�<tt class="computeroutput">BZ2_bzDecompressInit</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">int BZ2_bzDecompressInit ( bz_stream *strm, int verbosity, int small );</pre>
+<p>Prepares for decompression.  As with
+<tt class="computeroutput">BZ2_bzCompressInit</tt>, a
+<tt class="computeroutput">bz_stream</tt> record should be
+allocated and initialised before the call.  Fields
+<tt class="computeroutput">bzalloc</tt>,
+<tt class="computeroutput">bzfree</tt> and
+<tt class="computeroutput">opaque</tt> should be set if a custom
+memory allocator is required, or made
+<tt class="computeroutput">NULL</tt> for the normal
+<tt class="computeroutput">malloc</tt> /
+<tt class="computeroutput">free</tt> routines.  Upon return, the
+internal state will have been initialised, and
+<tt class="computeroutput">total_in</tt> and
+<tt class="computeroutput">total_out</tt> will be zero.</p>
+<p>For the meaning of parameter
+<tt class="computeroutput">verbosity</tt>, see
+<tt class="computeroutput">BZ2_bzCompressInit</tt>.</p>
+<p>If <tt class="computeroutput">small</tt> is nonzero, the
+library will use an alternative decompression algorithm which
+uses less memory but at the cost of decompressing more slowly
+(roughly speaking, half the speed, but the maximum memory
+requirement drops to around 2300k).  See <a href="#using">How to use bzip2</a>
+for more information on memory management.</p>
+<p>Note that the amount of memory needed to decompress a
+stream cannot be determined until the stream's header has been
+read, so even if
+<tt class="computeroutput">BZ2_bzDecompressInit</tt> succeeds, a
+subsequent <tt class="computeroutput">BZ2_bzDecompress</tt>
+could fail with
+<tt class="computeroutput">BZ_MEM_ERROR</tt>.</p>
+<p>Possible return values:</p>
+<pre class="programlisting">BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if ( small != 0 &amp;&amp; small != 1 )
+  or (verbosity &lt;; 0 || verbosity &gt; 4)
+BZ_MEM_ERROR
+  if insufficient memory is available</pre>
+<p>Allowable next actions:</p>
+<pre class="programlisting">BZ2_bzDecompress
+  if BZ_OK was returned
+  no specific action required in case of error</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzDecompress"></a>3.3.5.�<tt class="computeroutput">BZ2_bzDecompress</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">int BZ2_bzDecompress ( bz_stream *strm );</pre>
+<p>Provides more input and/out output buffer space for the
+library.  The caller maintains input and output buffers, and uses
+<tt class="computeroutput">BZ2_bzDecompress</tt> to transfer
+data between them.</p>
+<p>Before each call to
+<tt class="computeroutput">BZ2_bzDecompress</tt>,
+<tt class="computeroutput">next_in</tt> should point at the
+compressed data, and <tt class="computeroutput">avail_in</tt>
+should indicate how many bytes the library may read.
+<tt class="computeroutput">BZ2_bzDecompress</tt> updates
+<tt class="computeroutput">next_in</tt>,
+<tt class="computeroutput">avail_in</tt> and
+<tt class="computeroutput">total_in</tt> to reflect the number
+of bytes it has read.</p>
+<p>Similarly, <tt class="computeroutput">next_out</tt> should
+point to a buffer in which the uncompressed output is to be
+placed, with <tt class="computeroutput">avail_out</tt>
+indicating how much output space is available.
+<tt class="computeroutput">BZ2_bzCompress</tt> updates
+<tt class="computeroutput">next_out</tt>,
+<tt class="computeroutput">avail_out</tt> and
+<tt class="computeroutput">total_out</tt> to reflect the number
+of bytes output.</p>
+<p>You may provide and remove as little or as much data as you
+like on each call of
+<tt class="computeroutput">BZ2_bzDecompress</tt>.  In the limit,
+it is acceptable to supply and remove data one byte at a time,
+although this would be terribly inefficient.  You should always
+ensure that at least one byte of output space is available at
+each call.</p>
+<p>Use of <tt class="computeroutput">BZ2_bzDecompress</tt> is
+simpler than
+<tt class="computeroutput">BZ2_bzCompress</tt>.</p>
+<p>You should provide input and remove output as described
+above, and repeatedly call
+<tt class="computeroutput">BZ2_bzDecompress</tt> until
+<tt class="computeroutput">BZ_STREAM_END</tt> is returned.
+Appearance of <tt class="computeroutput">BZ_STREAM_END</tt>
+denotes that <tt class="computeroutput">BZ2_bzDecompress</tt>
+has detected the logical end of the compressed stream.
+<tt class="computeroutput">BZ2_bzDecompress</tt> will not
+produce <tt class="computeroutput">BZ_STREAM_END</tt> until all
+output data has been placed into the output buffer, so once
+<tt class="computeroutput">BZ_STREAM_END</tt> appears, you are
+guaranteed to have available all the decompressed output, and
+<tt class="computeroutput">BZ2_bzDecompressEnd</tt> can safely
+be called.</p>
+<p>If case of an error return value, you should call
+<tt class="computeroutput">BZ2_bzDecompressEnd</tt> to clean up
+and release memory.</p>
+<p>Possible return values:</p>
+<pre class="programlisting">BZ_PARAM_ERROR
+  if strm is NULL or strm-&gt;s is NULL
+  or strm-&gt;avail_out &lt; 1
+BZ_DATA_ERROR
+  if a data integrity error is detected in the compressed stream
+BZ_DATA_ERROR_MAGIC
+  if the compressed stream doesn't begin with the right magic bytes
+BZ_MEM_ERROR
+  if there wasn't enough memory available
+BZ_STREAM_END
+  if the logical end of the data stream was detected and all
+  output in has been consumed, eg s--&gt;avail_out &gt; 0
+BZ_OK
+  otherwise</pre>
+<p>Allowable next actions:</p>
+<pre class="programlisting">BZ2_bzDecompress
+  if BZ_OK was returned
+BZ2_bzDecompressEnd
+  otherwise</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzDecompress-end"></a>3.3.6.�<tt class="computeroutput">BZ2_bzDecompressEnd</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">int BZ2_bzDecompressEnd ( bz_stream *strm );</pre>
+<p>Releases all memory associated with a decompression
+stream.</p>
+<p>Possible return values:</p>
+<pre class="programlisting">BZ_PARAM_ERROR
+  if strm is NULL or strm-&gt;s is NULL
+BZ_OK
+  otherwise</pre>
+<p>Allowable next actions:</p>
+<pre class="programlisting">  None.</pre>
+</div>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="hl-interface"></a>3.4.�High-level interface</h2></div></div>
+<div></div>
+</div>
+<p>This interface provides functions for reading and writing
+<tt class="computeroutput">bzip2</tt> format files.  First, some
+general points.</p>
+<div class="itemizedlist"><ul type="bullet">
+<li style="list-style-type: disc"><p>All of the functions take an
+  <tt class="computeroutput">int*</tt> first argument,
+  <tt class="computeroutput">bzerror</tt>.  After each call,
+  <tt class="computeroutput">bzerror</tt> should be consulted
+  first to determine the outcome of the call.  If
+  <tt class="computeroutput">bzerror</tt> is
+  <tt class="computeroutput">BZ_OK</tt>, the call completed
+  successfully, and only then should the return value of the
+  function (if any) be consulted.  If
+  <tt class="computeroutput">bzerror</tt> is
+  <tt class="computeroutput">BZ_IO_ERROR</tt>, there was an
+  error reading/writing the underlying compressed file, and you
+  should then consult <tt class="computeroutput">errno</tt> /
+  <tt class="computeroutput">perror</tt> to determine the cause
+  of the difficulty.  <tt class="computeroutput">bzerror</tt>
+  may also be set to various other values; precise details are
+  given on a per-function basis below.</p></li>
+<li style="list-style-type: disc"><p>If <tt class="computeroutput">bzerror</tt> indicates
+  an error (ie, anything except
+  <tt class="computeroutput">BZ_OK</tt> and
+  <tt class="computeroutput">BZ_STREAM_END</tt>), you should
+  immediately call
+  <tt class="computeroutput">BZ2_bzReadClose</tt> (or
+  <tt class="computeroutput">BZ2_bzWriteClose</tt>, depending on
+  whether you are attempting to read or to write) to free up all
+  resources associated with the stream.  Once an error has been
+  indicated, behaviour of all calls except
+  <tt class="computeroutput">BZ2_bzReadClose</tt>
+  (<tt class="computeroutput">BZ2_bzWriteClose</tt>) is
+  undefined.  The implication is that (1)
+  <tt class="computeroutput">bzerror</tt> should be checked
+  after each call, and (2) if
+  <tt class="computeroutput">bzerror</tt> indicates an error,
+  <tt class="computeroutput">BZ2_bzReadClose</tt>
+  (<tt class="computeroutput">BZ2_bzWriteClose</tt>) should then
+  be called to clean up.</p></li>
+<li style="list-style-type: disc"><p>The <tt class="computeroutput">FILE*</tt> arguments
+  passed to <tt class="computeroutput">BZ2_bzReadOpen</tt> /
+  <tt class="computeroutput">BZ2_bzWriteOpen</tt> should be set
+  to binary mode.  Most Unix systems will do this by default, but
+  other platforms, including Windows and Mac, will not.  If you
+  omit this, you may encounter problems when moving code to new
+  platforms.</p></li>
+<li style="list-style-type: disc"><p>Memory allocation requests are handled by
+  <tt class="computeroutput">malloc</tt> /
+  <tt class="computeroutput">free</tt>.  At present there is no
+  facility for user-defined memory allocators in the file I/O
+  functions (could easily be added, though).</p></li>
+</ul></div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzreadopen"></a>3.4.1.�<tt class="computeroutput">BZ2_bzReadOpen</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">typedef void BZFILE;
+
+BZFILE *BZ2_bzReadOpen( int *bzerror, FILE *f, 
+                        int verbosity, int small,
+                        void *unused, int nUnused );</pre>
+<p>Prepare to read compressed data from file handle
+<tt class="computeroutput">f</tt>.
+<tt class="computeroutput">f</tt> should refer to a file which
+has been opened for reading, and for which the error indicator
+(<tt class="computeroutput">ferror(f)</tt>)is not set.  If
+<tt class="computeroutput">small</tt> is 1, the library will try
+to decompress using less memory, at the expense of speed.</p>
+<p>For reasons explained below,
+<tt class="computeroutput">BZ2_bzRead</tt> will decompress the
+<tt class="computeroutput">nUnused</tt> bytes starting at
+<tt class="computeroutput">unused</tt>, before starting to read
+from the file <tt class="computeroutput">f</tt>.  At most
+<tt class="computeroutput">BZ_MAX_UNUSED</tt> bytes may be
+supplied like this.  If this facility is not required, you should
+pass <tt class="computeroutput">NULL</tt> and
+<tt class="computeroutput">0</tt> for
+<tt class="computeroutput">unused</tt> and
+n<tt class="computeroutput">Unused</tt> respectively.</p>
+<p>For the meaning of parameters
+<tt class="computeroutput">small</tt> and
+<tt class="computeroutput">verbosity</tt>, see
+<tt class="computeroutput">BZ2_bzDecompressInit</tt>.</p>
+<p>The amount of memory needed to decompress a file cannot be
+determined until the file's header has been read.  So it is
+possible that <tt class="computeroutput">BZ2_bzReadOpen</tt>
+returns <tt class="computeroutput">BZ_OK</tt> but a subsequent
+call of <tt class="computeroutput">BZ2_bzRead</tt> will return
+<tt class="computeroutput">BZ_MEM_ERROR</tt>.</p>
+<p>Possible assignments to
+<tt class="computeroutput">bzerror</tt>:</p>
+<pre class="programlisting">BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if f is NULL
+  or small is neither 0 nor 1
+  or ( unused == NULL &amp;&amp; nUnused != 0 )
+  or ( unused != NULL &amp;&amp; !(0 &lt;= nUnused &lt;= BZ_MAX_UNUSED) )
+BZ_IO_ERROR
+  if ferror(f) is nonzero
+BZ_MEM_ERROR
+  if insufficient memory is available
+BZ_OK
+  otherwise.</pre>
+<p>Possible return values:</p>
+<pre class="programlisting">Pointer to an abstract BZFILE
+  if bzerror is BZ_OK
+NULL
+  otherwise</pre>
+<p>Allowable next actions:</p>
+<pre class="programlisting">BZ2_bzRead
+  if bzerror is BZ_OK
+BZ2_bzClose
+  otherwise</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzread"></a>3.4.2.�<tt class="computeroutput">BZ2_bzRead</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">int BZ2_bzRead ( int *bzerror, BZFILE *b, void *buf, int len );</pre>
+<p>Reads up to <tt class="computeroutput">len</tt>
+(uncompressed) bytes from the compressed file
+<tt class="computeroutput">b</tt> into the buffer
+<tt class="computeroutput">buf</tt>.  If the read was
+successful, <tt class="computeroutput">bzerror</tt> is set to
+<tt class="computeroutput">BZ_OK</tt> and the number of bytes
+read is returned.  If the logical end-of-stream was detected,
+<tt class="computeroutput">bzerror</tt> will be set to
+<tt class="computeroutput">BZ_STREAM_END</tt>, and the number of
+bytes read is returned.  All other
+<tt class="computeroutput">bzerror</tt> values denote an
+error.</p>
+<p><tt class="computeroutput">BZ2_bzRead</tt> will supply
+<tt class="computeroutput">len</tt> bytes, unless the logical
+stream end is detected or an error occurs.  Because of this, it
+is possible to detect the stream end by observing when the number
+of bytes returned is less than the number requested.
+Nevertheless, this is regarded as inadvisable; you should instead
+check <tt class="computeroutput">bzerror</tt> after every call
+and watch out for
+<tt class="computeroutput">BZ_STREAM_END</tt>.</p>
+<p>Internally, <tt class="computeroutput">BZ2_bzRead</tt>
+copies data from the compressed file in chunks of size
+<tt class="computeroutput">BZ_MAX_UNUSED</tt> bytes before
+decompressing it.  If the file contains more bytes than strictly
+needed to reach the logical end-of-stream,
+<tt class="computeroutput">BZ2_bzRead</tt> will almost certainly
+read some of the trailing data before signalling
+<tt class="computeroutput">BZ_SEQUENCE_END</tt>.  To collect the
+read but unused data once
+<tt class="computeroutput">BZ_SEQUENCE_END</tt> has appeared,
+call <tt class="computeroutput">BZ2_bzReadGetUnused</tt>
+immediately before
+<tt class="computeroutput">BZ2_bzReadClose</tt>.</p>
+<p>Possible assignments to
+<tt class="computeroutput">bzerror</tt>:</p>
+<pre class="programlisting">BZ_PARAM_ERROR
+  if b is NULL or buf is NULL or len &lt; 0
+BZ_SEQUENCE_ERROR
+  if b was opened with BZ2_bzWriteOpen
+BZ_IO_ERROR
+  if there is an error reading from the compressed file
+BZ_UNEXPECTED_EOF
+  if the compressed file ended before 
+  the logical end-of-stream was detected
+BZ_DATA_ERROR
+  if a data integrity error was detected in the compressed stream
+BZ_DATA_ERROR_MAGIC
+  if the stream does not begin with the requisite header bytes 
+  (ie, is not a bzip2 data file).  This is really 
+  a special case of BZ_DATA_ERROR.
+BZ_MEM_ERROR
+  if insufficient memory was available
+BZ_STREAM_END
+  if the logical end of stream was detected.
+BZ_OK
+  otherwise.</pre>
+<p>Possible return values:</p>
+<pre class="programlisting">number of bytes read
+  if bzerror is BZ_OK or BZ_STREAM_END
+undefined
+  otherwise</pre>
+<p>Allowable next actions:</p>
+<pre class="programlisting">collect data from buf, then BZ2_bzRead or BZ2_bzReadClose
+  if bzerror is BZ_OK
+collect data from buf, then BZ2_bzReadClose or BZ2_bzReadGetUnused
+  if bzerror is BZ_SEQUENCE_END
+BZ2_bzReadClose
+  otherwise</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzreadgetunused"></a>3.4.3.�<tt class="computeroutput">BZ2_bzReadGetUnused</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">void BZ2_bzReadGetUnused( int* bzerror, BZFILE *b, 
+                          void** unused, int* nUnused );</pre>
+<p>Returns data which was read from the compressed file but
+was not needed to get to the logical end-of-stream.
+<tt class="computeroutput">*unused</tt> is set to the address of
+the data, and <tt class="computeroutput">*nUnused</tt> to the
+number of bytes.  <tt class="computeroutput">*nUnused</tt> will
+be set to a value between <tt class="computeroutput">0</tt> and
+<tt class="computeroutput">BZ_MAX_UNUSED</tt> inclusive.</p>
+<p>This function may only be called once
+<tt class="computeroutput">BZ2_bzRead</tt> has signalled
+<tt class="computeroutput">BZ_STREAM_END</tt> but before
+<tt class="computeroutput">BZ2_bzReadClose</tt>.</p>
+<p>Possible assignments to
+<tt class="computeroutput">bzerror</tt>:</p>
+<pre class="programlisting">BZ_PARAM_ERROR
+  if b is NULL
+  or unused is NULL or nUnused is NULL
+BZ_SEQUENCE_ERROR
+  if BZ_STREAM_END has not been signalled
+  or if b was opened with BZ2_bzWriteOpen
+BZ_OK
+  otherwise</pre>
+<p>Allowable next actions:</p>
+<pre class="programlisting">BZ2_bzReadClose</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzreadclose"></a>3.4.4.�<tt class="computeroutput">BZ2_bzReadClose</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">void BZ2_bzReadClose ( int *bzerror, BZFILE *b );</pre>
+<p>Releases all memory pertaining to the compressed file
+<tt class="computeroutput">b</tt>.
+<tt class="computeroutput">BZ2_bzReadClose</tt> does not call
+<tt class="computeroutput">fclose</tt> on the underlying file
+handle, so you should do that yourself if appropriate.
+<tt class="computeroutput">BZ2_bzReadClose</tt> should be called
+to clean up after all error situations.</p>
+<p>Possible assignments to
+<tt class="computeroutput">bzerror</tt>:</p>
+<pre class="programlisting">BZ_SEQUENCE_ERROR
+  if b was opened with BZ2_bzOpenWrite
+BZ_OK
+  otherwise</pre>
+<p>Allowable next actions:</p>
+<pre class="programlisting">none</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzwriteopen"></a>3.4.5.�<tt class="computeroutput">BZ2_bzWriteOpen</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">BZFILE *BZ2_bzWriteOpen( int *bzerror, FILE *f, 
+                         int blockSize100k, int verbosity,
+                         int workFactor );</pre>
+<p>Prepare to write compressed data to file handle
+<tt class="computeroutput">f</tt>.
+<tt class="computeroutput">f</tt> should refer to a file which
+has been opened for writing, and for which the error indicator
+(<tt class="computeroutput">ferror(f)</tt>)is not set.</p>
+<p>For the meaning of parameters
+<tt class="computeroutput">blockSize100k</tt>,
+<tt class="computeroutput">verbosity</tt> and
+<tt class="computeroutput">workFactor</tt>, see
+<tt class="computeroutput">BZ2_bzCompressInit</tt>.</p>
+<p>All required memory is allocated at this stage, so if the
+call completes successfully,
+<tt class="computeroutput">BZ_MEM_ERROR</tt> cannot be signalled
+by a subsequent call to
+<tt class="computeroutput">BZ2_bzWrite</tt>.</p>
+<p>Possible assignments to
+<tt class="computeroutput">bzerror</tt>:</p>
+<pre class="programlisting">BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if f is NULL
+  or blockSize100k &lt; 1 or blockSize100k &gt; 9
+BZ_IO_ERROR
+  if ferror(f) is nonzero
+BZ_MEM_ERROR
+  if insufficient memory is available
+BZ_OK
+  otherwise</pre>
+<p>Possible return values:</p>
+<pre class="programlisting">Pointer to an abstract BZFILE
+  if bzerror is BZ_OK
+NULL
+  otherwise</pre>
+<p>Allowable next actions:</p>
+<pre class="programlisting">BZ2_bzWrite
+  if bzerror is BZ_OK
+  (you could go directly to BZ2_bzWriteClose, but this would be pretty pointless)
+BZ2_bzWriteClose
+  otherwise</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzwrite"></a>3.4.6.�<tt class="computeroutput">BZ2_bzWrite</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">void BZ2_bzWrite ( int *bzerror, BZFILE *b, void *buf, int len );</pre>
+<p>Absorbs <tt class="computeroutput">len</tt> bytes from the
+buffer <tt class="computeroutput">buf</tt>, eventually to be
+compressed and written to the file.</p>
+<p>Possible assignments to
+<tt class="computeroutput">bzerror</tt>:</p>
+<pre class="programlisting">BZ_PARAM_ERROR
+  if b is NULL or buf is NULL or len &lt; 0
+BZ_SEQUENCE_ERROR
+  if b was opened with BZ2_bzReadOpen
+BZ_IO_ERROR
+  if there is an error writing the compressed file.
+BZ_OK
+  otherwise</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzwriteclose"></a>3.4.7.�<tt class="computeroutput">BZ2_bzWriteClose</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">void BZ2_bzWriteClose( int *bzerror, BZFILE* f,
+                       int abandon,
+                       unsigned int* nbytes_in,
+                       unsigned int* nbytes_out );
+
+void BZ2_bzWriteClose64( int *bzerror, BZFILE* f,
+                         int abandon,
+                         unsigned int* nbytes_in_lo32,
+                         unsigned int* nbytes_in_hi32,
+                         unsigned int* nbytes_out_lo32,
+                         unsigned int* nbytes_out_hi32 );</pre>
+<p>Compresses and flushes to the compressed file all data so
+far supplied by <tt class="computeroutput">BZ2_bzWrite</tt>.
+The logical end-of-stream markers are also written, so subsequent
+calls to <tt class="computeroutput">BZ2_bzWrite</tt> are
+illegal.  All memory associated with the compressed file
+<tt class="computeroutput">b</tt> is released.
+<tt class="computeroutput">fflush</tt> is called on the
+compressed file, but it is not
+<tt class="computeroutput">fclose</tt>'d.</p>
+<p>If <tt class="computeroutput">BZ2_bzWriteClose</tt> is
+called to clean up after an error, the only action is to release
+the memory.  The library records the error codes issued by
+previous calls, so this situation will be detected automatically.
+There is no attempt to complete the compression operation, nor to
+<tt class="computeroutput">fflush</tt> the compressed file.  You
+can force this behaviour to happen even in the case of no error,
+by passing a nonzero value to
+<tt class="computeroutput">abandon</tt>.</p>
+<p>If <tt class="computeroutput">nbytes_in</tt> is non-null,
+<tt class="computeroutput">*nbytes_in</tt> will be set to be the
+total volume of uncompressed data handled.  Similarly,
+<tt class="computeroutput">nbytes_out</tt> will be set to the
+total volume of compressed data written.  For compatibility with
+older versions of the library,
+<tt class="computeroutput">BZ2_bzWriteClose</tt> only yields the
+lower 32 bits of these counts.  Use
+<tt class="computeroutput">BZ2_bzWriteClose64</tt> if you want
+the full 64 bit counts.  These two functions are otherwise
+absolutely identical.</p>
+<p>Possible assignments to
+<tt class="computeroutput">bzerror</tt>:</p>
+<pre class="programlisting">BZ_SEQUENCE_ERROR
+  if b was opened with BZ2_bzReadOpen
+BZ_IO_ERROR
+  if there is an error writing the compressed file
+BZ_OK
+  otherwise</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="embed"></a>3.4.8.�Handling embedded compressed data streams</h3></div></div>
+<div></div>
+</div>
+<p>The high-level library facilitates use of
+<tt class="computeroutput">bzip2</tt> data streams which form
+some part of a surrounding, larger data stream.</p>
+<div class="itemizedlist"><ul type="bullet">
+<li style="list-style-type: disc"><p>For writing, the library takes an open file handle,
+  writes compressed data to it,
+  <tt class="computeroutput">fflush</tt>es it but does not
+  <tt class="computeroutput">fclose</tt> it.  The calling
+  application can write its own data before and after the
+  compressed data stream, using that same file handle.</p></li>
+<li style="list-style-type: disc"><p>Reading is more complex, and the facilities are not as
+  general as they could be since generality is hard to reconcile
+  with efficiency.  <tt class="computeroutput">BZ2_bzRead</tt>
+  reads from the compressed file in blocks of size
+  <tt class="computeroutput">BZ_MAX_UNUSED</tt> bytes, and in
+  doing so probably will overshoot the logical end of compressed
+  stream.  To recover this data once decompression has ended,
+  call <tt class="computeroutput">BZ2_bzReadGetUnused</tt> after
+  the last call of <tt class="computeroutput">BZ2_bzRead</tt>
+  (the one returning
+  <tt class="computeroutput">BZ_STREAM_END</tt>) but before
+  calling
+  <tt class="computeroutput">BZ2_bzReadClose</tt>.</p></li>
+</ul></div>
+<p>This mechanism makes it easy to decompress multiple
+<tt class="computeroutput">bzip2</tt> streams placed end-to-end.
+As the end of one stream, when
+<tt class="computeroutput">BZ2_bzRead</tt> returns
+<tt class="computeroutput">BZ_STREAM_END</tt>, call
+<tt class="computeroutput">BZ2_bzReadGetUnused</tt> to collect
+the unused data (copy it into your own buffer somewhere).  That
+data forms the start of the next compressed stream.  To start
+uncompressing that next stream, call
+<tt class="computeroutput">BZ2_bzReadOpen</tt> again, feeding in
+the unused data via the <tt class="computeroutput">unused</tt> /
+<tt class="computeroutput">nUnused</tt> parameters.  Keep doing
+this until <tt class="computeroutput">BZ_STREAM_END</tt> return
+coincides with the physical end of file
+(<tt class="computeroutput">feof(f)</tt>).  In this situation
+<tt class="computeroutput">BZ2_bzReadGetUnused</tt> will of
+course return no data.</p>
+<p>This should give some feel for how the high-level interface
+can be used.  If you require extra flexibility, you'll have to
+bite the bullet and get to grips with the low-level
+interface.</p>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="std-rdwr"></a>3.4.9.�Standard file-reading/writing code</h3></div></div>
+<div></div>
+</div>
+<p>Here's how you'd write data to a compressed file:</p>
+<pre class="programlisting">FILE*   f;
+BZFILE* b;
+int     nBuf;
+char    buf[ /* whatever size you like */ ];
+int     bzerror;
+int     nWritten;
+
+f = fopen ( "myfile.bz2", "w" );
+if ( !f ) {
+ /* handle error */
+}
+b = BZ2_bzWriteOpen( &amp;bzerror, f, 9 );
+if (bzerror != BZ_OK) {
+ BZ2_bzWriteClose ( b );
+ /* handle error */
+}
+
+while ( /* condition */ ) {
+ /* get data to write into buf, and set nBuf appropriately */
+ nWritten = BZ2_bzWrite ( &amp;bzerror, b, buf, nBuf );
+ if (bzerror == BZ_IO_ERROR) { 
+   BZ2_bzWriteClose ( &amp;bzerror, b );
+   /* handle error */
+ }
+}
+
+BZ2_bzWriteClose( &amp;bzerror, b );
+if (bzerror == BZ_IO_ERROR) {
+ /* handle error */
+}</pre>
+<p>And to read from a compressed file:</p>
+<pre class="programlisting">FILE*   f;
+BZFILE* b;
+int     nBuf;
+char    buf[ /* whatever size you like */ ];
+int     bzerror;
+int     nWritten;
+
+f = fopen ( "myfile.bz2", "r" );
+if ( !f ) {
+  /* handle error */
+}
+b = BZ2_bzReadOpen ( &amp;bzerror, f, 0, NULL, 0 );
+if ( bzerror != BZ_OK ) {
+  BZ2_bzReadClose ( &amp;bzerror, b );
+  /* handle error */
+}
+
+bzerror = BZ_OK;
+while ( bzerror == BZ_OK &amp;&amp; /* arbitrary other conditions */) {
+  nBuf = BZ2_bzRead ( &amp;bzerror, b, buf, /* size of buf */ );
+  if ( bzerror == BZ_OK ) {
+    /* do something with buf[0 .. nBuf-1] */
+  }
+}
+if ( bzerror != BZ_STREAM_END ) {
+   BZ2_bzReadClose ( &amp;bzerror, b );
+   /* handle error */
+} else {
+   BZ2_bzReadClose ( &amp;bzerror );
+}</pre>
+</div>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="util-fns"></a>3.5.�Utility functions</h2></div></div>
+<div></div>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzbufftobuffcompress"></a>3.5.1.�<tt class="computeroutput">BZ2_bzBuffToBuffCompress</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">int BZ2_bzBuffToBuffCompress( char*         dest,
+                              unsigned int* destLen,
+                              char*         source,
+                              unsigned int  sourceLen,
+                              int           blockSize100k,
+                              int           verbosity,
+                              int           workFactor );</pre>
+<p>Attempts to compress the data in <tt class="computeroutput">source[0
+.. sourceLen-1]</tt> into the destination buffer,
+<tt class="computeroutput">dest[0 .. *destLen-1]</tt>.  If the
+destination buffer is big enough,
+<tt class="computeroutput">*destLen</tt> is set to the size of
+the compressed data, and <tt class="computeroutput">BZ_OK</tt>
+is returned.  If the compressed data won't fit,
+<tt class="computeroutput">*destLen</tt> is unchanged, and
+<tt class="computeroutput">BZ_OUTBUFF_FULL</tt> is
+returned.</p>
+<p>Compression in this manner is a one-shot event, done with a
+single call to this function.  The resulting compressed data is a
+complete <tt class="computeroutput">bzip2</tt> format data
+stream.  There is no mechanism for making additional calls to
+provide extra input data.  If you want that kind of mechanism,
+use the low-level interface.</p>
+<p>For the meaning of parameters
+<tt class="computeroutput">blockSize100k</tt>,
+<tt class="computeroutput">verbosity</tt> and
+<tt class="computeroutput">workFactor</tt>, see
+<tt class="computeroutput">BZ2_bzCompressInit</tt>.</p>
+<p>To guarantee that the compressed data will fit in its
+buffer, allocate an output buffer of size 1% larger than the
+uncompressed data, plus six hundred extra bytes.</p>
+<p><tt class="computeroutput">BZ2_bzBuffToBuffDecompress</tt>
+will not write data at or beyond
+<tt class="computeroutput">dest[*destLen]</tt>, even in case of
+buffer overflow.</p>
+<p>Possible return values:</p>
+<pre class="programlisting">BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if dest is NULL or destLen is NULL
+  or blockSize100k &lt; 1 or blockSize100k &gt; 9
+  or verbosity &lt; 0 or verbosity &gt; 4
+  or workFactor &lt; 0 or workFactor &gt; 250
+BZ_MEM_ERROR
+  if insufficient memory is available 
+BZ_OUTBUFF_FULL
+  if the size of the compressed data exceeds *destLen
+BZ_OK
+  otherwise</pre>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="bzbufftobuffdecompress"></a>3.5.2.�<tt class="computeroutput">BZ2_bzBuffToBuffDecompress</tt></h3></div></div>
+<div></div>
+</div>
+<pre class="programlisting">int BZ2_bzBuffToBuffDecompress( char*         dest,
+                                unsigned int* destLen,
+                                char*         source,
+                                unsigned int  sourceLen,
+                                int           small,
+                                int           verbosity );</pre>
+<p>Attempts to decompress the data in <tt class="computeroutput">source[0
+.. sourceLen-1]</tt> into the destination buffer,
+<tt class="computeroutput">dest[0 .. *destLen-1]</tt>.  If the
+destination buffer is big enough,
+<tt class="computeroutput">*destLen</tt> is set to the size of
+the uncompressed data, and <tt class="computeroutput">BZ_OK</tt>
+is returned.  If the compressed data won't fit,
+<tt class="computeroutput">*destLen</tt> is unchanged, and
+<tt class="computeroutput">BZ_OUTBUFF_FULL</tt> is
+returned.</p>
+<p><tt class="computeroutput">source</tt> is assumed to hold
+a complete <tt class="computeroutput">bzip2</tt> format data
+stream.
+<tt class="computeroutput">BZ2_bzBuffToBuffDecompress</tt> tries
+to decompress the entirety of the stream into the output
+buffer.</p>
+<p>For the meaning of parameters
+<tt class="computeroutput">small</tt> and
+<tt class="computeroutput">verbosity</tt>, see
+<tt class="computeroutput">BZ2_bzDecompressInit</tt>.</p>
+<p>Because the compression ratio of the compressed data cannot
+be known in advance, there is no easy way to guarantee that the
+output buffer will be big enough.  You may of course make
+arrangements in your code to record the size of the uncompressed
+data, but such a mechanism is beyond the scope of this
+library.</p>
+<p><tt class="computeroutput">BZ2_bzBuffToBuffDecompress</tt>
+will not write data at or beyond
+<tt class="computeroutput">dest[*destLen]</tt>, even in case of
+buffer overflow.</p>
+<p>Possible return values:</p>
+<pre class="programlisting">BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if dest is NULL or destLen is NULL
+  or small != 0 &amp;&amp; small != 1
+  or verbosity &lt; 0 or verbosity &gt; 4
+BZ_MEM_ERROR
+  if insufficient memory is available 
+BZ_OUTBUFF_FULL
+  if the size of the compressed data exceeds *destLen
+BZ_DATA_ERROR
+  if a data integrity error was detected in the compressed data
+BZ_DATA_ERROR_MAGIC
+  if the compressed data doesn't begin with the right magic bytes
+BZ_UNEXPECTED_EOF
+  if the compressed data ends unexpectedly
+BZ_OK
+  otherwise</pre>
+</div>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="zlib-compat"></a>3.6.�<tt class="computeroutput">zlib</tt> compatibility functions</h2></div></div>
+<div></div>
+</div>
+<p>Yoshioka Tsuneo has contributed some functions to give
+better <tt class="computeroutput">zlib</tt> compatibility.
+These functions are <tt class="computeroutput">BZ2_bzopen</tt>,
+<tt class="computeroutput">BZ2_bzread</tt>,
+<tt class="computeroutput">BZ2_bzwrite</tt>,
+<tt class="computeroutput">BZ2_bzflush</tt>,
+<tt class="computeroutput">BZ2_bzclose</tt>,
+<tt class="computeroutput">BZ2_bzerror</tt> and
+<tt class="computeroutput">BZ2_bzlibVersion</tt>.  These
+functions are not (yet) officially part of the library.  If they
+break, you get to keep all the pieces.  Nevertheless, I think
+they work ok.</p>
+<pre class="programlisting">typedef void BZFILE;
+
+const char * BZ2_bzlibVersion ( void );</pre>
+<p>Returns a string indicating the library version.</p>
+<pre class="programlisting">BZFILE * BZ2_bzopen  ( const char *path, const char *mode );
+BZFILE * BZ2_bzdopen ( int        fd,    const char *mode );</pre>
+<p>Opens a <tt class="computeroutput">.bz2</tt> file for
+reading or writing, using either its name or a pre-existing file
+descriptor.  Analogous to <tt class="computeroutput">fopen</tt>
+and <tt class="computeroutput">fdopen</tt>.</p>
+<pre class="programlisting">int BZ2_bzread  ( BZFILE* b, void* buf, int len );
+int BZ2_bzwrite ( BZFILE* b, void* buf, int len );</pre>
+<p>Reads/writes data from/to a previously opened
+<tt class="computeroutput">BZFILE</tt>.  Analogous to
+<tt class="computeroutput">fread</tt> and
+<tt class="computeroutput">fwrite</tt>.</p>
+<pre class="programlisting">int  BZ2_bzflush ( BZFILE* b );
+void BZ2_bzclose ( BZFILE* b );</pre>
+<p>Flushes/closes a <tt class="computeroutput">BZFILE</tt>.
+<tt class="computeroutput">BZ2_bzflush</tt> doesn't actually do
+anything.  Analogous to <tt class="computeroutput">fflush</tt>
+and <tt class="computeroutput">fclose</tt>.</p>
+<pre class="programlisting">const char * BZ2_bzerror ( BZFILE *b, int *errnum )</pre>
+<p>Returns a string describing the more recent error status of
+<tt class="computeroutput">b</tt>, and also sets
+<tt class="computeroutput">*errnum</tt> to its numerical
+value.</p>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="stdio-free"></a>3.7.�Using the library in a <tt class="computeroutput">stdio</tt>-free environment</h2></div></div>
+<div></div>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="stdio-bye"></a>3.7.1.�Getting rid of <tt class="computeroutput">stdio</tt></h3></div></div>
+<div></div>
+</div>
+<p>In a deeply embedded application, you might want to use
+just the memory-to-memory functions.  You can do this
+conveniently by compiling the library with preprocessor symbol
+<tt class="computeroutput">BZ_NO_STDIO</tt> defined.  Doing this
+gives you a library containing only the following eight
+functions:</p>
+<p><tt class="computeroutput">BZ2_bzCompressInit</tt>,
+<tt class="computeroutput">BZ2_bzCompress</tt>,
+<tt class="computeroutput">BZ2_bzCompressEnd</tt>
+<tt class="computeroutput">BZ2_bzDecompressInit</tt>,
+<tt class="computeroutput">BZ2_bzDecompress</tt>,
+<tt class="computeroutput">BZ2_bzDecompressEnd</tt>
+<tt class="computeroutput">BZ2_bzBuffToBuffCompress</tt>,
+<tt class="computeroutput">BZ2_bzBuffToBuffDecompress</tt></p>
+<p>When compiled like this, all functions will ignore
+<tt class="computeroutput">verbosity</tt> settings.</p>
+</div>
+<div class="sect2" lang="en">
+<div class="titlepage">
+<div><div><h3 class="title">
+<a name="critical-error"></a>3.7.2.�Critical error handling</h3></div></div>
+<div></div>
+</div>
+<p><tt class="computeroutput">libbzip2</tt> contains a number
+of internal assertion checks which should, needless to say, never
+be activated.  Nevertheless, if an assertion should fail,
+behaviour depends on whether or not the library was compiled with
+<tt class="computeroutput">BZ_NO_STDIO</tt> set.</p>
+<p>For a normal compile, an assertion failure yields the
+message:</p>
+<div class="blockquote"><blockquote class="blockquote">
+<p>bzip2/libbzip2: internal error number N.</p>
+<p>This is a bug in bzip2/libbzip2, 1.0.3 of 15 February 2005.
+Please report it to me at: jseward@bzip.org.  If this happened
+when you were using some program which uses libbzip2 as a
+component, you should also report this bug to the author(s)
+of that program.  Please make an effort to report this bug;
+timely and accurate bug reports eventually lead to higher
+quality software.  Thanks.  Julian Seward, 15 February 2005.
+</p>
+</blockquote></div>
+<p>where <tt class="computeroutput">N</tt> is some error code
+number.  If <tt class="computeroutput">N == 1007</tt>, it also
+prints some extra text advising the reader that unreliable memory
+is often associated with internal error 1007. (This is a
+frequently-observed-phenomenon with versions 1.0.0/1.0.1).</p>
+<p><tt class="computeroutput">exit(3)</tt> is then
+called.</p>
+<p>For a <tt class="computeroutput">stdio</tt>-free library,
+assertion failures result in a call to a function declared
+as:</p>
+<pre class="programlisting">extern void bz_internal_error ( int errcode );</pre>
+<p>The relevant code is passed as a parameter.  You should
+supply such a function.</p>
+<p>In either case, once an assertion failure has occurred, any
+<tt class="computeroutput">bz_stream</tt> records involved can
+be regarded as invalid.  You should not attempt to resume normal
+operation with them.</p>
+<p>You may, of course, change critical error handling to suit
+your needs.  As I said above, critical errors indicate bugs in
+the library and should not occur.  All "normal" error situations
+are indicated via error return codes from functions, and can be
+recovered from.</p>
+</div>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="win-dll"></a>3.8.�Making a Windows DLL</h2></div></div>
+<div></div>
+</div>
+<p>Everything related to Windows has been contributed by
+Yoshioka Tsuneo
+(<tt class="computeroutput">QWF00133@niftyserve.or.jp</tt> /
+<tt class="computeroutput">tsuneo-y@is.aist-nara.ac.jp</tt>), so
+you should send your queries to him (but perhaps Cc: me,
+<tt class="computeroutput">jseward@bzip.org</tt>).</p>
+<p>My vague understanding of what to do is: using Visual C++
+5.0, open the project file
+<tt class="computeroutput">libbz2.dsp</tt>, and build.  That's
+all.</p>
+<p>If you can't open the project file for some reason, make a
+new one, naming these files:
+<tt class="computeroutput">blocksort.c</tt>,
+<tt class="computeroutput">bzlib.c</tt>,
+<tt class="computeroutput">compress.c</tt>,
+<tt class="computeroutput">crctable.c</tt>,
+<tt class="computeroutput">decompress.c</tt>,
+<tt class="computeroutput">huffman.c</tt>,
+<tt class="computeroutput">randtable.c</tt> and
+<tt class="computeroutput">libbz2.def</tt>.  You will also need
+to name the header files <tt class="computeroutput">bzlib.h</tt>
+and <tt class="computeroutput">bzlib_private.h</tt>.</p>
+<p>If you don't use VC++, you may need to define the
+proprocessor symbol
+<tt class="computeroutput">_WIN32</tt>.</p>
+<p>Finally, <tt class="computeroutput">dlltest.c</tt> is a
+sample program using the DLL.  It has a project file,
+<tt class="computeroutput">dlltest.dsp</tt>.</p>
+<p>If you just want a makefile for Visual C, have a look at
+<tt class="computeroutput">makefile.msc</tt>.</p>
+<p>Be aware that if you compile
+<tt class="computeroutput">bzip2</tt> itself on Win32, you must
+set <tt class="computeroutput">BZ_UNIX</tt> to 0 and
+<tt class="computeroutput">BZ_LCCWIN32</tt> to 1, in the file
+<tt class="computeroutput">bzip2.c</tt>, before compiling.
+Otherwise the resulting binary won't work correctly.</p>
+<p>I haven't tried any of this stuff myself, but it all looks
+plausible.</p>
+</div>
+</div>
+<div class="chapter" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title">
+<a name="misc"></a>4.�Miscellanea</h2></div></div>
+<div></div>
+</div>
+<div class="toc">
+<p><b>Table of Contents</b></p>
+<dl>
+<dt><span class="sect1"><a href="#limits">4.1. Limitations of the compressed file format</a></span></dt>
+<dt><span class="sect1"><a href="#port-issues">4.2. Portability issues</a></span></dt>
+<dt><span class="sect1"><a href="#bugs">4.3. Reporting bugs</a></span></dt>
+<dt><span class="sect1"><a href="#package">4.4. Did you get the right package?</a></span></dt>
+<dt><span class="sect1"><a href="#reading">4.5. Further Reading</a></span></dt>
+</dl>
+</div>
+<p>These are just some random thoughts of mine.  Your mileage
+may vary.</p>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="limits"></a>4.1.�Limitations of the compressed file format</h2></div></div>
+<div></div>
+</div>
+<p><tt class="computeroutput">bzip2-1.0.X</tt>,
+<tt class="computeroutput">0.9.5</tt> and
+<tt class="computeroutput">0.9.0</tt> use exactly the same file
+format as the original version,
+<tt class="computeroutput">bzip2-0.1</tt>.  This decision was
+made in the interests of stability.  Creating yet another
+incompatible compressed file format would create further
+confusion and disruption for users.</p>
+<p>Nevertheless, this is not a painless decision.  Development
+work since the release of
+<tt class="computeroutput">bzip2-0.1</tt> in August 1997 has
+shown complexities in the file format which slow down
+decompression and, in retrospect, are unnecessary.  These
+are:</p>
+<div class="itemizedlist"><ul type="bullet">
+<li style="list-style-type: disc"><p>The run-length encoder, which is the first of the
+   compression transformations, is entirely irrelevant.  The
+   original purpose was to protect the sorting algorithm from the
+   very worst case input: a string of repeated symbols.  But
+   algorithm steps Q6a and Q6b in the original Burrows-Wheeler
+   technical report (SRC-124) show how repeats can be handled
+   without difficulty in block sorting.</p></li>
+<li style="list-style-type: disc">
+<p>The randomisation mechanism doesn't really need to be
+   there.  Udi Manber and Gene Myers published a suffix array
+   construction algorithm a few years back, which can be employed
+   to sort any block, no matter how repetitive, in O(N log N)
+   time.  Subsequent work by Kunihiko Sadakane has produced a
+   derivative O(N (log N)^2) algorithm which usually outperforms
+   the Manber-Myers algorithm.</p>
+<p>I could have changed to Sadakane's algorithm, but I find
+   it to be slower than <tt class="computeroutput">bzip2</tt>'s
+   existing algorithm for most inputs, and the randomisation
+   mechanism protects adequately against bad cases.  I didn't
+   think it was a good tradeoff to make.  Partly this is due to
+   the fact that I was not flooded with email complaints about
+   <tt class="computeroutput">bzip2-0.1</tt>'s performance on
+   repetitive data, so perhaps it isn't a problem for real
+   inputs.</p>
+<p>Probably the best long-term solution, and the one I have
+   incorporated into 0.9.5 and above, is to use the existing
+   sorting algorithm initially, and fall back to a O(N (log N)^2)
+   algorithm if the standard algorithm gets into
+   difficulties.</p>
+</li>
+<li style="list-style-type: disc"><p>The compressed file format was never designed to be
+   handled by a library, and I have had to jump though some hoops
+   to produce an efficient implementation of decompression.  It's
+   a bit hairy.  Try passing
+   <tt class="computeroutput">decompress.c</tt> through the C
+   preprocessor and you'll see what I mean.  Much of this
+   complexity could have been avoided if the compressed size of
+   each block of data was recorded in the data stream.</p></li>
+<li style="list-style-type: disc"><p>An Adler-32 checksum, rather than a CRC32 checksum,
+   would be faster to compute.</p></li>
+</ul></div>
+<p>It would be fair to say that the
+<tt class="computeroutput">bzip2</tt> format was frozen before I
+properly and fully understood the performance consequences of
+doing so.</p>
+<p>Improvements which I was able to incorporate into 0.9.0,
+despite using the same file format, are:</p>
+<div class="itemizedlist"><ul type="bullet">
+<li style="list-style-type: disc"><p>Single array implementation of the inverse BWT.  This
+  significantly speeds up decompression, presumably because it
+  reduces the number of cache misses.</p></li>
+<li style="list-style-type: disc"><p>Faster inverse MTF transform for large MTF values.
+  The new implementation is based on the notion of sliding blocks
+  of values.</p></li>
+<li style="list-style-type: disc"><p><tt class="computeroutput">bzip2-0.9.0</tt> now reads
+  and writes files with <tt class="computeroutput">fread</tt>
+  and <tt class="computeroutput">fwrite</tt>; version 0.1 used
+  <tt class="computeroutput">putc</tt> and
+  <tt class="computeroutput">getc</tt>.  Duh!  Well, you live
+  and learn.</p></li>
+</ul></div>
+<p>Further ahead, it would be nice to be able to do random
+access into files.  This will require some careful design of
+compressed file formats.</p>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="port-issues"></a>4.2.�Portability issues</h2></div></div>
+<div></div>
+</div>
+<p>After some consideration, I have decided not to use GNU
+<tt class="computeroutput">autoconf</tt> to configure 0.9.5 or
+1.0.</p>
+<p><tt class="computeroutput">autoconf</tt>, admirable and
+wonderful though it is, mainly assists with portability problems
+between Unix-like platforms.  But
+<tt class="computeroutput">bzip2</tt> doesn't have much in the
+way of portability problems on Unix; most of the difficulties
+appear when porting to the Mac, or to Microsoft's operating
+systems.  <tt class="computeroutput">autoconf</tt> doesn't help
+in those cases, and brings in a whole load of new
+complexity.</p>
+<p>Most people should be able to compile the library and
+program under Unix straight out-of-the-box, so to speak,
+especially if you have a version of GNU C available.</p>
+<p>There are a couple of
+<tt class="computeroutput">__inline__</tt> directives in the
+code.  GNU C (<tt class="computeroutput">gcc</tt>) should be
+able to handle them.  If you're not using GNU C, your C compiler
+shouldn't see them at all.  If your compiler does, for some
+reason, see them and doesn't like them, just
+<tt class="computeroutput">#define</tt>
+<tt class="computeroutput">__inline__</tt> to be
+<tt class="computeroutput">/* */</tt>.  One easy way to do this
+is to compile with the flag
+<tt class="computeroutput">-D__inline__=</tt>, which should be
+understood by most Unix compilers.</p>
+<p>If you still have difficulties, try compiling with the
+macro <tt class="computeroutput">BZ_STRICT_ANSI</tt> defined.
+This should enable you to build the library in a strictly ANSI
+compliant environment.  Building the program itself like this is
+dangerous and not supported, since you remove
+<tt class="computeroutput">bzip2</tt>'s checks against
+compressing directories, symbolic links, devices, and other
+not-really-a-file entities.  This could cause filesystem
+corruption!</p>
+<p>One other thing: if you create a
+<tt class="computeroutput">bzip2</tt> binary for public distribution,
+please consider linking it statically (<tt class="computeroutput">gcc
+-static</tt>).  This avoids all sorts of library-version
+issues that others may encounter later on.</p>
+<p>If you build <tt class="computeroutput">bzip2</tt> on
+Win32, you must set <tt class="computeroutput">BZ_UNIX</tt> to 0
+and <tt class="computeroutput">BZ_LCCWIN32</tt> to 1, in the
+file <tt class="computeroutput">bzip2.c</tt>, before compiling.
+Otherwise the resulting binary won't work correctly.</p>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="bugs"></a>4.3.�Reporting bugs</h2></div></div>
+<div></div>
+</div>
+<p>I tried pretty hard to make sure
+<tt class="computeroutput">bzip2</tt> is bug free, both by
+design and by testing.  Hopefully you'll never need to read this
+section for real.</p>
+<p>Nevertheless, if <tt class="computeroutput">bzip2</tt> dies
+with a segmentation fault, a bus error or an internal assertion
+failure, it will ask you to email me a bug report.  Experience from
+years of feedback of bzip2 users indicates that almost all these
+problems can be traced to either compiler bugs or hardware
+problems.</p>
+<div class="itemizedlist"><ul type="bullet">
+<li style="list-style-type: disc">
+<p>Recompile the program with no optimisation, and
+  see if it works.  And/or try a different compiler.  I heard all
+  sorts of stories about various flavours of GNU C (and other
+  compilers) generating bad code for
+  <tt class="computeroutput">bzip2</tt>, and I've run across two
+  such examples myself.</p>
+<p>2.7.X versions of GNU C are known to generate bad code
+  from time to time, at high optimisation levels.  If you get
+  problems, try using the flags
+  <tt class="computeroutput">-O2</tt>
+  <tt class="computeroutput">-fomit-frame-pointer</tt>
+  <tt class="computeroutput">-fno-strength-reduce</tt>.  You
+  should specifically <span class="emphasis"><em>not</em></span> use
+  <tt class="computeroutput">-funroll-loops</tt>.</p>
+<p>You may notice that the Makefile runs six tests as part
+  of the build process.  If the program passes all of these, it's
+  a pretty good (but not 100%) indication that the compiler has
+  done its job correctly.</p>
+</li>
+<li style="list-style-type: disc">
+<p>If <tt class="computeroutput">bzip2</tt>
+  crashes randomly, and the crashes are not repeatable, you may
+  have a flaky memory subsystem.
+  <tt class="computeroutput">bzip2</tt> really hammers your
+  memory hierarchy, and if it's a bit marginal, you may get these
+  problems.  Ditto if your disk or I/O subsystem is slowly
+  failing.  Yup, this really does happen.</p>
+<p>Try using a different machine of the same type, and see
+  if you can repeat the problem.</p>
+</li>
+<li style="list-style-type: disc"><p>This isn't really a bug, but ... If
+  <tt class="computeroutput">bzip2</tt> tells you your file is
+  corrupted on decompression, and you obtained the file via FTP,
+  there is a possibility that you forgot to tell FTP to do a
+  binary mode transfer.  That absolutely will cause the file to
+  be non-decompressible.  You'll have to transfer it
+  again.</p></li>
+</ul></div>
+<p>If you've incorporated
+<tt class="computeroutput">libbzip2</tt> into your own program
+and are getting problems, please, please, please, check that the
+parameters you are passing in calls to the library, are correct,
+and in accordance with what the documentation says is allowable.
+I have tried to make the library robust against such problems,
+but I'm sure I haven't succeeded.</p>
+<p>Finally, if the above comments don't help, you'll have to
+send me a bug report.  Now, it's just amazing how many people
+will send me a bug report saying something like:</p>
+<pre class="programlisting">bzip2 crashed with segmentation fault on my machine</pre>
+<p>and absolutely nothing else.  Needless to say, a such a
+report is <span class="emphasis"><em>totally, utterly, completely and
+comprehensively 100% useless; a waste of your time, my time, and
+net bandwidth</em></span>.  With no details at all, there's no way
+I can possibly begin to figure out what the problem is.</p>
+<p>The rules of the game are: facts, facts, facts.  Don't omit
+them because "oh, they won't be relevant".  At the bare
+minimum:</p>
+<pre class="programlisting">Machine type.  Operating system version.  
+Exact version of bzip2 (do bzip2 -V).  
+Exact version of the compiler used.  
+Flags passed to the compiler.</pre>
+<p>However, the most important single thing that will help me
+is the file that you were trying to compress or decompress at the
+time the problem happened.  Without that, my ability to do
+anything more than speculate about the cause, is limited.</p>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="package"></a>4.4.�Did you get the right package?</h2></div></div>
+<div></div>
+</div>
+<p><tt class="computeroutput">bzip2</tt> is a resource hog.
+It soaks up large amounts of CPU cycles and memory.  Also, it
+gives very large latencies.  In the worst case, you can feed many
+megabytes of uncompressed data into the library before getting
+any compressed output, so this probably rules out applications
+requiring interactive behaviour.</p>
+<p>These aren't faults of my implementation, I hope, but more
+an intrinsic property of the Burrows-Wheeler transform
+(unfortunately).  Maybe this isn't what you want.</p>
+<p>If you want a compressor and/or library which is faster,
+uses less memory but gets pretty good compression, and has
+minimal latency, consider Jean-loup Gailly's and Mark Adler's
+work, <tt class="computeroutput">zlib-1.2.1</tt> and
+<tt class="computeroutput">gzip-1.2.4</tt>.  Look for them at 
+<a href="http://www.zlib.org" target="_top">http://www.zlib.org</a> and 
+<a href="http://www.gzip.org" target="_top">http://www.gzip.org</a>
+respectively.</p>
+<p>For something faster and lighter still, you might try Markus F
+X J Oberhumer's <tt class="computeroutput">LZO</tt> real-time
+compression/decompression library, at 
+<a href="http://www.oberhumer.com/opensource" target="_top">http://www.oberhumer.com/opensource</a>.</p>
+</div>
+<div class="sect1" lang="en">
+<div class="titlepage">
+<div><div><h2 class="title" style="clear: both">
+<a name="reading"></a>4.5.�Further Reading</h2></div></div>
+<div></div>
+</div>
+<p><tt class="computeroutput">bzip2</tt> is not research
+work, in the sense that it doesn't present any new ideas.
+Rather, it's an engineering exercise based on existing
+ideas.</p>
+<p>Four documents describe essentially all the ideas behind
+<tt class="computeroutput">bzip2</tt>:</p>
+<div class="literallayout"><p>Michael�Burrows�and�D.�J.�Wheeler:<br>
+��"A�block-sorting�lossless�data�compression�algorithm"<br>
+���10th�May�1994.�<br>
+���Digital�SRC�Research�Report�124.<br>
+���ftp://ftp.digital.com/pub/DEC/SRC/research-reports/SRC-124.ps.gz<br>
+���If�you�have�trouble�finding�it,�try�searching�at�the<br>
+���New�Zealand�Digital�Library,�http://www.nzdl.org.<br>
+<br>
+Daniel�S.�Hirschberg�and�Debra�A.�LeLewer<br>
+��"Efficient�Decoding�of�Prefix�Codes"<br>
+���Communications�of�the�ACM,�April�1990,�Vol�33,�Number�4.<br>
+���You�might�be�able�to�get�an�electronic�copy�of�this<br>
+���from�the�ACM�Digital�Library.<br>
+<br>
+David�J.�Wheeler<br>
+���Program�bred3.c�and�accompanying�document�bred3.ps.<br>
+���This�contains�the�idea�behind�the�multi-table�Huffman�coding�scheme.<br>
+���ftp://ftp.cl.cam.ac.uk/users/djw3/<br>
+<br>
+Jon�L.�Bentley�and�Robert�Sedgewick<br>
+��"Fast�Algorithms�for�Sorting�and�Searching�Strings"<br>
+���Available�from�Sedgewick's�web�page,<br>
+���www.cs.princeton.edu/~rs<br>
+</p></div>
+<p>The following paper gives valuable additional insights into
+the algorithm, but is not immediately the basis of any code used
+in bzip2.</p>
+<div class="literallayout"><p>Peter�Fenwick:<br>
+���Block�Sorting�Text�Compression<br>
+���Proceedings�of�the�19th�Australasian�Computer�Science�Conference,<br>
+�����Melbourne,�Australia.��Jan�31�-�Feb�2,�1996.<br>
+���ftp://ftp.cs.auckland.ac.nz/pub/peter-f/ACSC96paper.ps</p></div>
+<p>Kunihiko Sadakane's sorting algorithm, mentioned above, is
+available from:</p>
+<div class="literallayout"><p>http://naomi.is.s.u-tokyo.ac.jp/~sada/papers/Sada98b.ps.gz<br>
+</p></div>
+<p>The Manber-Myers suffix array construction algorithm is
+described in a paper available from:</p>
+<div class="literallayout"><p>http://www.cs.arizona.edu/people/gene/PAPERS/suffix.ps<br>
+</p></div>
+<p>Finally, the following papers document some
+investigations I made into the performance of sorting
+and decompression algorithms:</p>
+<div class="literallayout"><p>Julian�Seward<br>
+���On�the�Performance�of�BWT�Sorting�Algorithms<br>
+���Proceedings�of�the�IEEE�Data�Compression�Conference�2000<br>
+�����Snowbird,�Utah.��28-30�March�2000.<br>
+<br>
+Julian�Seward<br>
+���Space-time�Tradeoffs�in�the�Inverse�B-W�Transform<br>
+���Proceedings�of�the�IEEE�Data�Compression�Conference�2001<br>
+�����Snowbird,�Utah.��27-29�March�2001.<br>
+</p></div>
+</div>
+</div>
+</div></body>
+</html>
diff --git a/updater/bzip2-1.0.3/manual.pdf b/updater/bzip2-1.0.3/manual.pdf
new file mode 100644
index 0000000..394b809
--- /dev/null
+++ b/updater/bzip2-1.0.3/manual.pdf
diff --git a/updater/bzip2-1.0.3/manual.ps b/updater/bzip2-1.0.3/manual.ps
new file mode 100644
index 0000000..03831d1
--- /dev/null
+++ b/updater/bzip2-1.0.3/manual.ps
@@ -0,0 +1,68244 @@
+%!PS-Adobe-3.0
+%%Creator: xpdf/pdftops 3.00
+%%LanguageLevel: 2
+%%DocumentSuppliedResources: (atend)
+%%DocumentMedia: plain 612 792 0 () ()
+%%BoundingBox: 0 0 612 792
+%%Pages: 38
+%%EndComments
+%%BeginDefaults
+%%PageMedia: plain
+%%EndDefaults
+%%BeginProlog
+%%BeginResource: procset xpdf 3.00 0
+/xpdf 75 dict def xpdf begin
+% PDF special state
+/pdfDictSize 15 def
+/pdfSetup {
+  3 1 roll 2 array astore
+  /setpagedevice where {
+    pop 3 dict begin
+      /PageSize exch def
+      /ImagingBBox null def
+      /Policies 1 dict dup begin /PageSize 3 def end def
+      { /Duplex true def } if
+    currentdict end setpagedevice
+  } {
+    pop pop
+  } ifelse
+} def
+/pdfStartPage {
+  pdfDictSize dict begin
+  /pdfFill [0] def
+  /pdfStroke [0] def
+  /pdfLastFill false def
+  /pdfLastStroke false def
+  /pdfTextMat [1 0 0 1 0 0] def
+  /pdfFontSize 0 def
+  /pdfCharSpacing 0 def
+  /pdfTextRender 0 def
+  /pdfTextRise 0 def
+  /pdfWordSpacing 0 def
+  /pdfHorizScaling 1 def
+  /pdfTextClipPath [] def
+} def
+/pdfEndPage { end } def
+% separation convention operators
+/findcmykcustomcolor where {
+  pop
+}{
+  /findcmykcustomcolor { 5 array astore } def
+} ifelse
+/setcustomcolor where {
+  pop
+}{
+  /setcustomcolor {
+    exch
+    [ exch /Separation exch dup 4 get exch /DeviceCMYK exch
+      0 4 getinterval cvx
+      [ exch /dup load exch { mul exch dup } /forall load
+        /pop load dup ] cvx
+    ] setcolorspace setcolor
+  } def
+} ifelse
+/customcolorimage where {
+  pop
+}{
+  /customcolorimage {
+    gsave
+    [ exch /Separation exch dup 4 get exch /DeviceCMYK exch
+      0 4 getinterval
+      [ exch /dup load exch { mul exch dup } /forall load
+        /pop load dup ] cvx
+    ] setcolorspace
+    10 dict begin
+      /ImageType 1 def
+      /DataSource exch def
+      /ImageMatrix exch def
+      /BitsPerComponent exch def
+      /Height exch def
+      /Width exch def
+      /Decode [1 0] def
+    currentdict end
+    image
+    grestore
+  } def
+} ifelse
+% PDF color state
+/sCol {
+  pdfLastStroke not {
+    pdfStroke aload length
+    dup 1 eq {
+      pop setgray
+    }{
+      dup 3 eq {
+        pop setrgbcolor
+      }{
+        4 eq {
+          setcmykcolor
+        }{
+          findcmykcustomcolor exch setcustomcolor
+        } ifelse
+      } ifelse
+    } ifelse
+    /pdfLastStroke true def /pdfLastFill false def
+  } if
+} def
+/fCol {
+  pdfLastFill not {
+    pdfFill aload length
+    dup 1 eq {
+      pop setgray
+    }{
+      dup 3 eq {
+        pop setrgbcolor
+      }{
+        4 eq {
+          setcmykcolor
+        }{
+          findcmykcustomcolor exch setcustomcolor
+        } ifelse
+      } ifelse
+    } ifelse
+    /pdfLastFill true def /pdfLastStroke false def
+  } if
+} def
+% build a font
+/pdfMakeFont {
+  4 3 roll findfont
+  4 2 roll matrix scale makefont
+  dup length dict begin
+    { 1 index /FID ne { def } { pop pop } ifelse } forall
+    /Encoding exch def
+    currentdict
+  end
+  definefont pop
+} def
+/pdfMakeFont16 {
+  exch findfont
+  dup length dict begin
+    { 1 index /FID ne { def } { pop pop } ifelse } forall
+    /WMode exch def
+    currentdict
+  end
+  definefont pop
+} def
+/pdfMakeFont16L3 {
+  1 index /CIDFont resourcestatus {
+    pop pop 1 index /CIDFont findresource /CIDFontType known
+  } {
+    false
+  } ifelse
+  {
+    0 eq { /Identity-H } { /Identity-V } ifelse
+    exch 1 array astore composefont pop
+  } {
+    pdfMakeFont16
+  } ifelse
+} def
+% graphics state operators
+/q { gsave pdfDictSize dict begin } def
+/Q { end grestore } def
+/cm { concat } def
+/d { setdash } def
+/i { setflat } def
+/j { setlinejoin } def
+/J { setlinecap } def
+/M { setmiterlimit } def
+/w { setlinewidth } def
+% color operators
+/g { dup 1 array astore /pdfFill exch def setgray
+     /pdfLastFill true def /pdfLastStroke false def } def
+/G { dup 1 array astore /pdfStroke exch def setgray
+     /pdfLastStroke true def /pdfLastFill false def } def
+/rg { 3 copy 3 array astore /pdfFill exch def setrgbcolor
+      /pdfLastFill true def /pdfLastStroke false def } def
+/RG { 3 copy 3 array astore /pdfStroke exch def setrgbcolor
+      /pdfLastStroke true def /pdfLastFill false def } def
+/k { 4 copy 4 array astore /pdfFill exch def setcmykcolor
+     /pdfLastFill true def /pdfLastStroke false def } def
+/K { 4 copy 4 array astore /pdfStroke exch def setcmykcolor
+     /pdfLastStroke true def /pdfLastFill false def } def
+/ck { 6 copy 6 array astore /pdfFill exch def
+      findcmykcustomcolor exch setcustomcolor
+      /pdfLastFill true def /pdfLastStroke false def } def
+/CK { 6 copy 6 array astore /pdfStroke exch def
+      findcmykcustomcolor exch setcustomcolor
+      /pdfLastStroke true def /pdfLastFill false def } def
+% path segment operators
+/m { moveto } def
+/l { lineto } def
+/c { curveto } def
+/re { 4 2 roll moveto 1 index 0 rlineto 0 exch rlineto
+      neg 0 rlineto closepath } def
+/h { closepath } def
+% path painting operators
+/S { sCol stroke } def
+/Sf { fCol stroke } def
+/f { fCol fill } def
+/f* { fCol eofill } def
+% clipping operators
+/W { clip newpath } def
+/W* { eoclip newpath } def
+% text state operators
+/Tc { /pdfCharSpacing exch def } def
+/Tf { dup /pdfFontSize exch def
+      dup pdfHorizScaling mul exch matrix scale
+      pdfTextMat matrix concatmatrix dup 4 0 put dup 5 0 put
+      exch findfont exch makefont setfont } def
+/Tr { /pdfTextRender exch def } def
+/Ts { /pdfTextRise exch def } def
+/Tw { /pdfWordSpacing exch def } def
+/Tz { /pdfHorizScaling exch def } def
+% text positioning operators
+/Td { pdfTextMat transform moveto } def
+/Tm { /pdfTextMat exch def } def
+% text string operators
+/cshow where {
+  pop
+  /cshow2 {
+    dup {
+      pop pop
+      1 string dup 0 3 index put 3 index exec
+    } exch cshow
+    pop pop
+  } def
+}{
+  /cshow2 {
+    currentfont /FontType get 0 eq {
+      0 2 2 index length 1 sub {
+        2 copy get exch 1 add 2 index exch get
+        2 copy exch 256 mul add
+        2 string dup 0 6 5 roll put dup 1 5 4 roll put
+        3 index exec
+      } for
+    } {
+      dup {
+        1 string dup 0 3 index put 3 index exec
+      } forall
+    } ifelse
+    pop pop
+  } def
+} ifelse
+/awcp {
+  exch {
+    false charpath
+    5 index 5 index rmoveto
+    6 index eq { 7 index 7 index rmoveto } if
+  } exch cshow2
+  6 {pop} repeat
+} def
+/Tj {
+  fCol
+  1 index stringwidth pdfTextMat idtransform pop
+  sub 1 index length dup 0 ne { div } { pop pop 0 } ifelse
+  pdfWordSpacing pdfHorizScaling mul 0 pdfTextMat dtransform 32
+  4 3 roll pdfCharSpacing pdfHorizScaling mul add 0
+  pdfTextMat dtransform
+  6 5 roll Tj1
+} def
+/Tj16 {
+  fCol
+  2 index stringwidth pdfTextMat idtransform pop
+  sub exch div
+  pdfWordSpacing pdfHorizScaling mul 0 pdfTextMat dtransform 32
+  4 3 roll pdfCharSpacing pdfHorizScaling mul add 0
+  pdfTextMat dtransform
+  6 5 roll Tj1
+} def
+/Tj16V {
+  fCol
+  2 index stringwidth pdfTextMat idtransform exch pop
+  sub exch div
+  0 pdfWordSpacing pdfTextMat dtransform 32
+  4 3 roll pdfCharSpacing add 0 exch
+  pdfTextMat dtransform
+  6 5 roll Tj1
+} def
+/Tj1 {
+  0 pdfTextRise pdfTextMat dtransform rmoveto
+  currentpoint 8 2 roll
+  pdfTextRender 1 and 0 eq {
+    6 copy awidthshow
+  } if
+  pdfTextRender 3 and dup 1 eq exch 2 eq or {
+    7 index 7 index moveto
+    6 copy
+    currentfont /FontType get 3 eq { fCol } { sCol } ifelse
+    false awcp currentpoint stroke moveto
+  } if
+  pdfTextRender 4 and 0 ne {
+    8 6 roll moveto
+    false awcp
+    /pdfTextClipPath [ pdfTextClipPath aload pop
+      {/moveto cvx}
+      {/lineto cvx}
+      {/curveto cvx}
+      {/closepath cvx}
+    pathforall ] def
+    currentpoint newpath moveto
+  } {
+    8 {pop} repeat
+  } ifelse
+  0 pdfTextRise neg pdfTextMat dtransform rmoveto
+} def
+/TJm { pdfFontSize 0.001 mul mul neg 0
+       pdfTextMat dtransform rmoveto } def
+/TJmV { pdfFontSize 0.001 mul mul neg 0 exch
+        pdfTextMat dtransform rmoveto } def
+/Tclip { pdfTextClipPath cvx exec clip newpath
+         /pdfTextClipPath [] def } def
+% Level 2 image operators
+/pdfImBuf 100 string def
+/pdfIm {
+  image
+  { currentfile pdfImBuf readline
+    not { pop exit } if
+    (%-EOD-) eq { exit } if } loop
+} def
+/pdfImSep {
+  findcmykcustomcolor exch
+  dup /Width get /pdfImBuf1 exch string def
+  dup /Decode get aload pop 1 index sub /pdfImDecodeRange exch def
+  /pdfImDecodeLow exch def
+  begin Width Height BitsPerComponent ImageMatrix DataSource end
+  /pdfImData exch def
+  { pdfImData pdfImBuf1 readstring pop
+    0 1 2 index length 1 sub {
+      1 index exch 2 copy get
+      pdfImDecodeRange mul 255 div pdfImDecodeLow add round cvi
+      255 exch sub put
+    } for }
+  6 5 roll customcolorimage
+  { currentfile pdfImBuf readline
+    not { pop exit } if
+    (%-EOD-) eq { exit } if } loop
+} def
+/pdfImM {
+  fCol imagemask
+  { currentfile pdfImBuf readline
+    not { pop exit } if
+    (%-EOD-) eq { exit } if } loop
+} def
+end
+%%EndResource
+%%EndProlog
+%%BeginSetup
+xpdf begin
+/F121_0 /Helvetica-Bold 1 1
+[ /.notdef/dotaccent/fi/fl/fraction/hungarumlaut/Lslash/lslash
+  /ogonek/ring/.notdef/breve/minus/.notdef/Zcaron/zcaron
+  /caron/dotlessi/dotlessj/ff/ffi/ffl/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/grave/quotesingle
+  /space/exclam/quotedbl/numbersign/dollar/percent/ampersand/quoteright
+  /parenleft/parenright/asterisk/plus/comma/hyphen/period/slash
+  /zero/one/two/three/four/five/six/seven
+  /eight/nine/colon/semicolon/less/equal/greater/question
+  /at/A/B/C/D/E/F/G
+  /H/I/J/K/L/M/N/O
+  /P/Q/R/S/T/U/V/W
+  /X/Y/Z/bracketleft/backslash/bracketright/asciicircum/underscore
+  /quoteleft/a/b/c/d/e/f/g
+  /h/i/j/k/l/m/n/o
+  /p/q/r/s/t/u/v/w
+  /x/y/z/braceleft/bar/braceright/asciitilde/.notdef
+  /Euro/.notdef/quotesinglbase/florin/quotedblbase/ellipsis/dagger/daggerdbl
+  /circumflex/perthousand/Scaron/guilsinglleft/OE/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/quotedblleft/quotedblright/bullet/endash/emdash
+  /tilde/trademark/scaron/guilsinglright/oe/.notdef/.notdef/Ydieresis
+  /.notdef/exclamdown/cent/sterling/currency/yen/brokenbar/section
+  /dieresis/copyright/ordfeminine/guillemotleft/logicalnot/hyphen/registered/macron
+  /degree/plusminus/twosuperior/threesuperior/acute/mu/paragraph/periodcentered
+  /cedilla/onesuperior/ordmasculine/guillemotright/onequarter/onehalf/threequarters/questiondown
+  /Agrave/Aacute/Acircumflex/Atilde/Adieresis/Aring/AE/Ccedilla
+  /Egrave/Eacute/Ecircumflex/Edieresis/Igrave/Iacute/Icircumflex/Idieresis
+  /Eth/Ntilde/Ograve/Oacute/Ocircumflex/Otilde/Odieresis/multiply
+  /Oslash/Ugrave/Uacute/Ucircumflex/Udieresis/Yacute/Thorn/germandbls
+  /agrave/aacute/acircumflex/atilde/adieresis/aring/ae/ccedilla
+  /egrave/eacute/ecircumflex/edieresis/igrave/iacute/icircumflex/idieresis
+  /eth/ntilde/ograve/oacute/ocircumflex/otilde/odieresis/divide
+  /oslash/ugrave/uacute/ucircumflex/udieresis/yacute/thorn/ydieresis]
+pdfMakeFont
+/F128_0 /Times-Roman 1 1
+[ /.notdef/dotaccent/fi/fl/fraction/hungarumlaut/Lslash/lslash
+  /ogonek/ring/.notdef/breve/minus/.notdef/Zcaron/zcaron
+  /caron/dotlessi/dotlessj/ff/ffi/ffl/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/grave/quotesingle
+  /space/exclam/quotedbl/numbersign/dollar/percent/ampersand/quoteright
+  /parenleft/parenright/asterisk/plus/comma/hyphen/period/slash
+  /zero/one/two/three/four/five/six/seven
+  /eight/nine/colon/semicolon/less/equal/greater/question
+  /at/A/B/C/D/E/F/G
+  /H/I/J/K/L/M/N/O
+  /P/Q/R/S/T/U/V/W
+  /X/Y/Z/bracketleft/backslash/bracketright/asciicircum/underscore
+  /quoteleft/a/b/c/d/e/f/g
+  /h/i/j/k/l/m/n/o
+  /p/q/r/s/t/u/v/w
+  /x/y/z/braceleft/bar/braceright/asciitilde/.notdef
+  /Euro/.notdef/quotesinglbase/florin/quotedblbase/ellipsis/dagger/daggerdbl
+  /circumflex/perthousand/Scaron/guilsinglleft/OE/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/quotedblleft/quotedblright/bullet/endash/emdash
+  /tilde/trademark/scaron/guilsinglright/oe/.notdef/.notdef/Ydieresis
+  /.notdef/exclamdown/cent/sterling/currency/yen/brokenbar/section
+  /dieresis/copyright/ordfeminine/guillemotleft/logicalnot/hyphen/registered/macron
+  /degree/plusminus/twosuperior/threesuperior/acute/mu/paragraph/periodcentered
+  /cedilla/onesuperior/ordmasculine/guillemotright/onequarter/onehalf/threequarters/questiondown
+  /Agrave/Aacute/Acircumflex/Atilde/Adieresis/Aring/AE/Ccedilla
+  /Egrave/Eacute/Ecircumflex/Edieresis/Igrave/Iacute/Icircumflex/Idieresis
+  /Eth/Ntilde/Ograve/Oacute/Ocircumflex/Otilde/Odieresis/multiply
+  /Oslash/Ugrave/Uacute/Ucircumflex/Udieresis/Yacute/Thorn/germandbls
+  /agrave/aacute/acircumflex/atilde/adieresis/aring/ae/ccedilla
+  /egrave/eacute/ecircumflex/edieresis/igrave/iacute/icircumflex/idieresis
+  /eth/ntilde/ograve/oacute/ocircumflex/otilde/odieresis/divide
+  /oslash/ugrave/uacute/ucircumflex/udieresis/yacute/thorn/ydieresis]
+pdfMakeFont
+/F130_0 /Courier 1 1
+[ /.notdef/dotaccent/fi/fl/fraction/hungarumlaut/Lslash/lslash
+  /ogonek/ring/.notdef/breve/minus/.notdef/Zcaron/zcaron
+  /caron/dotlessi/dotlessj/ff/ffi/ffl/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/grave/quotesingle
+  /space/exclam/quotedbl/numbersign/dollar/percent/ampersand/quoteright
+  /parenleft/parenright/asterisk/plus/comma/hyphen/period/slash
+  /zero/one/two/three/four/five/six/seven
+  /eight/nine/colon/semicolon/less/equal/greater/question
+  /at/A/B/C/D/E/F/G
+  /H/I/J/K/L/M/N/O
+  /P/Q/R/S/T/U/V/W
+  /X/Y/Z/bracketleft/backslash/bracketright/asciicircum/underscore
+  /quoteleft/a/b/c/d/e/f/g
+  /h/i/j/k/l/m/n/o
+  /p/q/r/s/t/u/v/w
+  /x/y/z/braceleft/bar/braceright/asciitilde/.notdef
+  /Euro/.notdef/quotesinglbase/florin/quotedblbase/ellipsis/dagger/daggerdbl
+  /circumflex/perthousand/Scaron/guilsinglleft/OE/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/quotedblleft/quotedblright/bullet/endash/emdash
+  /tilde/trademark/scaron/guilsinglright/oe/.notdef/.notdef/Ydieresis
+  /.notdef/exclamdown/cent/sterling/currency/yen/brokenbar/section
+  /dieresis/copyright/ordfeminine/guillemotleft/logicalnot/hyphen/registered/macron
+  /degree/plusminus/twosuperior/threesuperior/acute/mu/paragraph/periodcentered
+  /cedilla/onesuperior/ordmasculine/guillemotright/onequarter/onehalf/threequarters/questiondown
+  /Agrave/Aacute/Acircumflex/Atilde/Adieresis/Aring/AE/Ccedilla
+  /Egrave/Eacute/Ecircumflex/Edieresis/Igrave/Iacute/Icircumflex/Idieresis
+  /Eth/Ntilde/Ograve/Oacute/Ocircumflex/Otilde/Odieresis/multiply
+  /Oslash/Ugrave/Uacute/Ucircumflex/Udieresis/Yacute/Thorn/germandbls
+  /agrave/aacute/acircumflex/atilde/adieresis/aring/ae/ccedilla
+  /egrave/eacute/ecircumflex/edieresis/igrave/iacute/icircumflex/idieresis
+  /eth/ntilde/ograve/oacute/ocircumflex/otilde/odieresis/divide
+  /oslash/ugrave/uacute/ucircumflex/udieresis/yacute/thorn/ydieresis]
+pdfMakeFont
+%%BeginResource: font CJBHNS+CMMI10
+%!PS-AdobeFont-1.1: CMMI10 1.100
+%%CreationDate: 1996 Jul 23 07:53:57
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.100) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMMI10) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Medium) readonly def
+/ItalicAngle -14.04 def
+/isFixedPitch false def
+end readonly def
+/FontName /CJBHNS+CMMI10 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 45 /arrowhookright put
+dup 58 /period put
+readonly def
+/FontBBox{-32 -250 1048 750}readonly def
+/UniqueID 5087385 def
+currentdict end
+currentfile eexec
+d9d66f633b846a97b686a97e45a3d0aa0529731c99a784ccbe85b4993b2eebde
+3b12d472b7cf54651ef21185116a69ab1096ed4bad2f646635e019b6417cc77b
+532f85d811c70d1429a19a5307ef63eb5c5e02c89fc6c20f6d9d89e7d91fe470
+b72befda23f5df76be05af4ce93137a219ed8a04a9d7d6fdf37e6b7fcde0d90b
+986423e5960a5d9fbb4c956556e8df90cbfaec476fa36fd9a5c8175c9af513fe
+d919c2ddd26bdc0d99398b9f4d03d5993dfc0930297866e1cd0a319b6b1fd958
+9e394a533a081c36d456a09920001a3d2199583eb9b84b4dee08e3d12939e321
+990cd249827d9648574955f61baaa11263a91b6c3d47a5190165b0c25abf6d3e
+6ec187e4b05182126bb0d0323d943170b795255260f9fd25f2248d04f45dfbfb
+def7ff8b19bfef637b210018ae02572b389b3f76282beb29cc301905d388c721
+59616893e774413f48de0b408bc66dce3fe17cb9f84d205839d58014d6a88823
+d9320ae93af96d97a02c4d5a2bb2b8c7925c4578003959c46e3ce1a2f0eac4bf
+8b9b325e46435bde60bc54d72bc8acb5c0a34413ac87045dc7b84646a324b808
+6fd8e34217213e131c3b1510415ce45420688ed9c1d27890ec68bd7c1235faf9
+1dab3a369dd2fc3be5cf9655c7b7eda7361d7e05e5831b6b8e2eec542a7b38ee
+03be4bac6079d038acb3c7c916279764547c2d51976baba94ba9866d79f13909
+95aa39b0f03103a07cbdf441b8c5669f729020af284b7ff52a29c6255fcaacf1
+74109050fba2602e72593fbcbfc26e726ee4aef97b7632bc4f5f353b5c67fed2
+3ea752a4a57b8f7feff1d7341d895f0a3a0be1d8e3391970457a967eff84f6d8
+47750b1145b8cc5bd96ee7aa99ddc9e06939e383bda41175233d58ad263ebf19
+afc0e2f840512d321166547b306c592b8a01e1fa2564b9a26dac14256414e4c8
+42616728d918c74d13c349f4186ec7b9708b86467425a6fdb3a396562f7ee4d8
+40b43621744cf8a23a6e532649b66c2a0002dd04f8f39618e4f572819dd34837
+b5a08e643fdca1505af6a1fa3ddfd1fa758013caed8acddbbb334d664dff5b53
+95601766777978d01677b8d19e1b10a078432d2884bb42d1f224976325883657
+05acb022d1e9cb556e37af91917c78e98229e3a4dbf03ae741998542977ad6df
+1760fc1f1a479464922afda2cba7961e9da696b71205e19c542c97f25419c43c
+fa1a042ba0cf5622ffbd3e775d0d564135d99b9ffba011eebc4066b003ce2f88
+825936d7393d05d3804601cee9d123120fdf73624a9d4e361a28e998acec53f8
+7a62a0aee33be2e96542534a8af24497d1c377cd7f723767b44857d94c6cda7a
+c3d6f0087fa36655dd2b81eaecb31fe4f4a2fb1ea9fbe8b83d35826ac93fbb4f
+2bee014f41f8f276510cf5ce35c3954e8cafc521d0c3ab80ea8c7fc29427a1d4
+42d6f6c1800919e58de9ae12304d718ad80febbb412da54153469cd51a288628
+ad109baa77981525b3d9b0efe593537fcbb8520d38cccbd5db171a0385a432c1
+3030303030303030
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndResource
+/F143_0 /CJBHNS+CMMI10 1 1
+[ /Gamma/Delta/Theta/Lambda/Xi/Pi/Sigma/Upsilon
+  /Phi/Psi/Omega/alpha/beta/gamma/delta/epsilon1
+  /zeta/eta/theta/iota/kappa/lambda/mu/nu
+  /xi/pi/rho/sigma/tau/upsilon/phi/chi
+  /psi/omega/epsilon/theta1/pi1/rho1/sigma1/phi1
+  /arrowlefttophalf/arrowleftbothalf/arrowrighttophalf/arrowrightbothalf/arrowhookleft/arrowhookright/triangleright/triangleleft
+  /zerooldstyle/oneoldstyle/twooldstyle/threeoldstyle/fouroldstyle/fiveoldstyle/sixoldstyle/sevenoldstyle
+  /eightoldstyle/nineoldstyle/period/comma/less/slash/greater/star
+  /partialdiff/A/B/C/D/E/F/G
+  /H/I/J/K/L/M/N/O
+  /P/Q/R/S/T/U/V/W
+  /X/Y/Z/flat/natural/sharp/slurbelow/slurabove
+  /lscript/a/b/c/d/e/f/g
+  /h/i/j/k/l/m/n/o
+  /p/q/r/s/t/u/v/w
+  /x/y/z/dotlessi/dotlessj/weierstrass/vector/tie
+  /psi/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /space/Gamma/Delta/Theta/Lambda/Xi/Pi/Sigma
+  /Upsilon/Phi/Psi/.notdef/.notdef/Omega/alpha/beta
+  /gamma/delta/epsilon1/zeta/eta/theta/iota/kappa
+  /lambda/mu/nu/xi/pi/rho/sigma/tau
+  /upsilon/phi/chi/psi/tie/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef]
+pdfMakeFont
+/F387_0 /Courier-Bold 1 1
+[ /.notdef/dotaccent/fi/fl/fraction/hungarumlaut/Lslash/lslash
+  /ogonek/ring/.notdef/breve/minus/.notdef/Zcaron/zcaron
+  /caron/dotlessi/dotlessj/ff/ffi/ffl/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/grave/quotesingle
+  /space/exclam/quotedbl/numbersign/dollar/percent/ampersand/quoteright
+  /parenleft/parenright/asterisk/plus/comma/hyphen/period/slash
+  /zero/one/two/three/four/five/six/seven
+  /eight/nine/colon/semicolon/less/equal/greater/question
+  /at/A/B/C/D/E/F/G
+  /H/I/J/K/L/M/N/O
+  /P/Q/R/S/T/U/V/W
+  /X/Y/Z/bracketleft/backslash/bracketright/asciicircum/underscore
+  /quoteleft/a/b/c/d/e/f/g
+  /h/i/j/k/l/m/n/o
+  /p/q/r/s/t/u/v/w
+  /x/y/z/braceleft/bar/braceright/asciitilde/.notdef
+  /Euro/.notdef/quotesinglbase/florin/quotedblbase/ellipsis/dagger/daggerdbl
+  /circumflex/perthousand/Scaron/guilsinglleft/OE/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/quotedblleft/quotedblright/bullet/endash/emdash
+  /tilde/trademark/scaron/guilsinglright/oe/.notdef/.notdef/Ydieresis
+  /.notdef/exclamdown/cent/sterling/currency/yen/brokenbar/section
+  /dieresis/copyright/ordfeminine/guillemotleft/logicalnot/hyphen/registered/macron
+  /degree/plusminus/twosuperior/threesuperior/acute/mu/paragraph/periodcentered
+  /cedilla/onesuperior/ordmasculine/guillemotright/onequarter/onehalf/threequarters/questiondown
+  /Agrave/Aacute/Acircumflex/Atilde/Adieresis/Aring/AE/Ccedilla
+  /Egrave/Eacute/Ecircumflex/Edieresis/Igrave/Iacute/Icircumflex/Idieresis
+  /Eth/Ntilde/Ograve/Oacute/Ocircumflex/Otilde/Odieresis/multiply
+  /Oslash/Ugrave/Uacute/Ucircumflex/Udieresis/Yacute/Thorn/germandbls
+  /agrave/aacute/acircumflex/atilde/adieresis/aring/ae/ccedilla
+  /egrave/eacute/ecircumflex/edieresis/igrave/iacute/icircumflex/idieresis
+  /eth/ntilde/ograve/oacute/ocircumflex/otilde/odieresis/divide
+  /oslash/ugrave/uacute/ucircumflex/udieresis/yacute/thorn/ydieresis]
+pdfMakeFont
+%%BeginResource: font RBGKEI+CMSY10
+%!PS-AdobeFont-1.1: CMSY10 1.0
+%%CreationDate: 1991 Aug 15 07:20:57
+% Copyright (C) 1997 American Mathematical Society. All Rights Reserved.
+11 dict begin
+/FontInfo 7 dict dup begin
+/version (1.0) readonly def
+/Notice (Copyright (C) 1997 American Mathematical Society. All Rights Reserved) readonly def
+/FullName (CMSY10) readonly def
+/FamilyName (Computer Modern) readonly def
+/Weight (Medium) readonly def
+/ItalicAngle -14.035 def
+/isFixedPitch false def
+end readonly def
+/FontName /RBGKEI+CMSY10 def
+/PaintType 0 def
+/FontType 1 def
+/FontMatrix [0.001 0 0 0.001 0 0] readonly def
+/Encoding 256 array
+0 1 255 {1 index exch /.notdef put} for
+dup 32 /arrowleft put
+readonly def
+/FontBBox{-29 -960 1116 775}readonly def
+/UniqueID 5000820 def
+currentdict end
+currentfile eexec
+d9d66f633b846a97b686a97e45a3d0aa052f09f9c8ade9d907c058b87e9b6964
+7d53359e51216774a4eaa1e2b58ec3176bd1184a633b951372b4198d4e8c5ef4
+a213acb58aa0a658908035bf2ed8531779838a960dfe2b27ea49c37156989c85
+e21b3abf72e39a89232cd9f4237fc80c9e64e8425aa3bef7ded60b122a52922a
+221a37d9a807dd01161779dde7d31ff2b87f97c73d63eecdda4c49501773468a
+27d1663e0b62f461f6e40a5d6676d1d12b51e641c1d4e8e2771864fc104f8cbf
+5b78ec1d88228725f1c453a678f58a7e1b7bd7ca700717d288eb8da1f57c4f09
+0abf1d42c5ddd0c384c7e22f8f8047be1d4c1cc8e33368fb1ac82b4e96146730
+de3302b2e6b819cb6ae455b1af3187ffe8071aa57ef8a6616b9cb7941d44ec7a
+71a7bb3df755178d7d2e4bb69859efa4bbc30bd6bb1531133fd4d9438ff99f09
+4ecc068a324d75b5f696b8688eeb2f17e5ed34ccd6d047a4e3806d000c199d7c
+515db70a8d4f6146fe068dc1e5de8bc5703711da090312ba3fc00a08c453c609
+c627a8bd98d9e826f964721e92bbdc978e88eea0a9c14802ebcc41f810428fa8
+b9972032a01769a7c72d1a65276f414deedaf1d22be23f4705bf5ef31b6a3b69
+0c896320f09e9875b50220a5bdbbd57c041b5ea97f421685a7256b0d9755edbe
+d05190dabf1c3dbf558258163c8231d89167a816bba55fb1f14ad04320ae381d
+f783a9eacee8ae5c1838775fe2380bdd1f3afcccc96d2a2dfc999b52a6689c51
+af82b8d63205b339103134dac7e3c45e6693940276041bb07ebdb9b729e8ef0d
+ee8bf450fa42551be65217fea902e28decc09580b504f0f52f1e8fc5ce7ac28d
+c4e47f908fdaeba23827a97a0aa741aa7708f7bbfec6fa69cc4f7c3bd4303030
+3030303030
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+0000000000000000000000000000000000000000000000000000000000000000
+cleartomark
+%%EndResource
+/F559_0 /RBGKEI+CMSY10 1 1
+[ /minus/periodcentered/multiply/asteriskmath/divide/diamondmath/plusminus/minusplus
+  /circleplus/circleminus/circlemultiply/circledivide/circledot/circlecopyrt/openbullet/bullet
+  /equivasymptotic/equivalence/reflexsubset/reflexsuperset/lessequal/greaterequal/precedesequal/followsequal
+  /similar/approxequal/propersubset/propersuperset/lessmuch/greatermuch/precedes/follows
+  /arrowleft/arrowright/arrowup/arrowdown/arrowboth/arrownortheast/arrowsoutheast/similarequal
+  /arrowdblleft/arrowdblright/arrowdblup/arrowdbldown/arrowdblboth/arrownorthwest/arrowsouthwest/proportional
+  /prime/infinity/element/owner/triangle/triangleinv/negationslash/mapsto
+  /universal/existential/logicalnot/emptyset/Rfractur/Ifractur/latticetop/perpendicular
+  /aleph/A/B/C/D/E/F/G
+  /H/I/J/K/L/M/N/O
+  /P/Q/R/S/T/U/V/W
+  /X/Y/Z/union/intersection/unionmulti/logicaland/logicalor
+  /turnstileleft/turnstileright/floorleft/floorright/ceilingleft/ceilingright/braceleft/braceright
+  /angbracketleft/angbracketright/bar/bardbl/arrowbothv/arrowdblbothv/backslash/wreathproduct
+  /radical/coproduct/nabla/integral/unionsq/intersectionsq/subsetsqequal/supersetsqequal
+  /section/dagger/daggerdbl/paragraph/club/diamond/heart/spade
+  /arrowleft/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/minus/periodcentered/multiply/asteriskmath/divide/diamondmath/plusminus
+  /minusplus/circleplus/circleminus/.notdef/.notdef/circlemultiply/circledivide/circledot
+  /circlecopyrt/openbullet/bullet/equivasymptotic/equivalence/reflexsubset/reflexsuperset/lessequal
+  /greaterequal/precedesequal/followsequal/similar/approxequal/propersubset/propersuperset/lessmuch
+  /greatermuch/precedes/follows/arrowleft/spade/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/.notdef]
+pdfMakeFont
+/F631_0 /Times-Italic 1 1
+[ /.notdef/dotaccent/fi/fl/fraction/hungarumlaut/Lslash/lslash
+  /ogonek/ring/.notdef/breve/minus/.notdef/Zcaron/zcaron
+  /caron/dotlessi/dotlessj/ff/ffi/ffl/.notdef/.notdef
+  /.notdef/.notdef/.notdef/.notdef/.notdef/.notdef/grave/quotesingle
+  /space/exclam/quotedbl/numbersign/dollar/percent/ampersand/quoteright
+  /parenleft/parenright/asterisk/plus/comma/hyphen/period/slash
+  /zero/one/two/three/four/five/six/seven
+  /eight/nine/colon/semicolon/less/equal/greater/question
+  /at/A/B/C/D/E/F/G
+  /H/I/J/K/L/M/N/O
+  /P/Q/R/S/T/U/V/W
+  /X/Y/Z/bracketleft/backslash/bracketright/asciicircum/underscore
+  /quoteleft/a/b/c/d/e/f/g
+  /h/i/j/k/l/m/n/o
+  /p/q/r/s/t/u/v/w
+  /x/y/z/braceleft/bar/braceright/asciitilde/.notdef
+  /Euro/.notdef/quotesinglbase/florin/quotedblbase/ellipsis/dagger/daggerdbl
+  /circumflex/perthousand/Scaron/guilsinglleft/OE/.notdef/.notdef/.notdef
+  /.notdef/.notdef/.notdef/quotedblleft/quotedblright/bullet/endash/emdash
+  /tilde/trademark/scaron/guilsinglright/oe/.notdef/.notdef/Ydieresis
+  /.notdef/exclamdown/cent/sterling/currency/yen/brokenbar/section
+  /dieresis/copyright/ordfeminine/guillemotleft/logicalnot/hyphen/registered/macron
+  /degree/plusminus/twosuperior/threesuperior/acute/mu/paragraph/periodcentered
+  /cedilla/onesuperior/ordmasculine/guillemotright/onequarter/onehalf/threequarters/questiondown
+  /Agrave/Aacute/Acircumflex/Atilde/Adieresis/Aring/AE/Ccedilla
+  /Egrave/Eacute/Ecircumflex/Edieresis/Igrave/Iacute/Icircumflex/Idieresis
+  /Eth/Ntilde/Ograve/Oacute/Ocircumflex/Otilde/Odieresis/multiply
+  /Oslash/Ugrave/Uacute/Ucircumflex/Udieresis/Yacute/Thorn/germandbls
+  /agrave/aacute/acircumflex/atilde/adieresis/aring/ae/ccedilla
+  /egrave/eacute/ecircumflex/edieresis/igrave/iacute/icircumflex/idieresis
+  /eth/ntilde/ograve/oacute/ocircumflex/otilde/odieresis/divide
+  /oslash/ugrave/uacute/ucircumflex/udieresis/yacute/thorn/ydieresis]
+pdfMakeFont
+612 792 false pdfSetup
+%%EndSetup
+%%Page: 1 1
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 756] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 463.018 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -36] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+117.435 701.916 Td
+/F121_0 24.79 Tf
+(bzip2) 63.3632 Tj
+-278 TJm
+(and) 44.0766 Tj
+-278 TJm
+(libbzip2,) 99.1848 Tj
+-278 TJm
+(ver) 37.2098 Tj
+15 TJm
+(sion) 50.9682 Tj
+-278 TJm
+(1.0.3) 55.133 Tj
+[1 0 0 1 72 696.784] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -15.494] cm
+0 g
+0 G
+[1 0 0 1 -72 -681.29] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90.493 661.631 Td
+/F121_0 20.659 Tf
+(A) 14.9158 Tj
+-278 TJm
+(pr) 20.659 Tj
+20 TJm
+(ogram) 63.1339 Tj
+-278 TJm
+(and) 36.7317 Tj
+-278 TJm
+(librar) 51.6682 Tj
+-10 TJm
+(y) 11.4864 Tj
+-278 TJm
+(f) 6.87945 Tj
+20 TJm
+(or) 20.659 Tj
+-278 TJm
+(data) 42.4749 Tj
+-277 TJm
+(compression) 128.582 Tj
+[1 0 0 1 72 657.035] cm
+0 g
+0 G
+[1 0 0 1 0 -144] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -513.035] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+207.676 503.285 Td
+/F121_0 11.955 Tf
+(J) 6.64698 Tj
+20 TJm
+(ulian) 27.903 Tj
+-278 TJm
+(Se) 14.621 Tj
+15 TJm
+(war) 20.5985 Tj
+20 TJm
+(d,) 10.628 Tj
+-278 TJm
+(http://www) 61.102 Tj
+40 TJm
+(.bzip.or) 42.512 Tj
+15 TJm
+(g) 7.30451 Tj
+[1 0 0 1 72 500.625] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -435.825] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 463.018 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 2 2
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 140.398 0] cm
+0 g
+0 G
+[1 0 0 1 -140.398 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -13.948] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 709.534 Td
+/F121_0 14.346 Tf
+(bzip2) 36.6684 Tj
+-489 TJm
+(and) 25.5072 Tj
+-488 TJm
+(libbzip2,) 57.3983 Tj
+-542 TJm
+(ver) 21.5333 Tj
+15 TJm
+(sion) 29.4954 Tj
+-489 TJm
+(1.0.3:) 36.6827 Tj
+-765 TJm
+(A) 10.3578 Tj
+-488 TJm
+(pr) 14.346 Tj
+20 TJm
+(ogram) 43.8414 Tj
+-489 TJm
+(and) 25.5072 Tj
+-489 TJm
+(librar) 35.8793 Tj
+-10 TJm
+(y) 7.97638 Tj
+-489 TJm
+(f) 4.77722 Tj
+20 TJm
+(or) 14.346 Tj
+-488 TJm
+(data) 29.4954 Tj
+72 692.319 Td
+(compression) 89.2895 Tj
+[1 0 0 1 72 689.349] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -689.349] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 680.364 Td
+/F128_0 9.963 Tf
+(by) 9.963 Tj
+-250 TJm
+(Julian) 23.8016 Tj
+-250 TJm
+(Se) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(ard) 12.7228 Tj
+[1 0 0 1 72 678.207] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -678.207] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 668.409 Td
+/F128_0 9.963 Tf
+(Cop) 16.6083 Tj
+10 TJm
+(yright) 23.8016 Tj
+[1 0 0 1 114.799 668.409] cm
+0 g
+0 G
+[1 0 0 1 -114.799 -668.409] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+114.799 668.409 Td
+/F128_0 9.963 Tf
+(\251) 7.57188 Tj
+[1 0 0 1 122.371 668.409] cm
+0 g
+0 G
+[1 0 0 1 -122.371 -668.409] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+124.861 668.409 Td
+/F128_0 9.963 Tf
+(1996-2005) 43.1697 Tj
+-250 TJm
+(Julian) 23.8016 Tj
+-250 TJm
+(Se) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(ard) 12.7228 Tj
+[1 0 0 1 72 666.252] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -7.97] cm
+0 g
+0 G
+[1 0 0 1 -72 -658.282] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 650.874 Td
+/F128_0 7.97 Tf
+(This) 14.1707 Tj
+-250 TJm
+(program,) 28.9949 Tj
+[1 0 0 1 119.151 650.874] cm
+0 g
+0 G
+[1 0 0 1 -119.151 -650.874] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.151 650.874 Td
+/F130_0 7.97 Tf
+(bzip2) 23.91 Tj
+[1 0 0 1 143.061 650.874] cm
+0 g
+0 G
+[1 0 0 1 -143.061 -650.874] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+143.061 650.874 Td
+/F128_0 7.97 Tf
+(,) 1.9925 Tj
+-250 TJm
+(the) 9.73934 Tj
+-250 TJm
+(associated) 32.7567 Tj
+-250 TJm
+(library) 21.248 Tj
+[1 0 0 1 216.768 650.874] cm
+0 g
+0 G
+[1 0 0 1 -216.768 -650.874] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+216.768 650.874 Td
+/F130_0 7.97 Tf
+(libbzip2) 38.256 Tj
+[1 0 0 1 255.024 650.874] cm
+0 g
+0 G
+[1 0 0 1 -255.024 -650.874] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+255.024 650.874 Td
+/F128_0 7.97 Tf
+(,) 1.9925 Tj
+-250 TJm
+(and) 11.5087 Tj
+-250 TJm
+(all) 7.97 Tj
+-250 TJm
+(documentation,) 49.3662 Tj
+-250 TJm
+(are) 9.73137 Tj
+-250 TJm
+(cop) 11.5087 Tj
+10 TJm
+(yright) 19.0403 Tj
+-250 TJm
+(\251) 6.0572 Tj
+-250 TJm
+(1996-2005) 34.534 Tj
+-250 TJm
+(Julian) 19.0403 Tj
+-250 TJm
+(Se) 7.97 Tj
+25 TJm
+(w) 5.75434 Tj
+10 TJm
+(ard.) 12.1702 Tj
+-310 TJm
+(All) 10.1857 Tj
+-250 TJm
+(rights) 18.1557 Tj
+-250 TJm
+(reserv) 19.4707 Tj
+15 TJm
+(ed.) 9.51618 Tj
+[1 0 0 1 72 649.149] cm
+0 g
+0 G
+[1 0 0 1 0 -7.97] cm
+0 g
+0 G
+[1 0 0 1 -72 -641.179] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 633.34 Td
+/F128_0 7.97 Tf
+(Redistrib) 29.226 Tj
+20 TJm
+(ution) 16.3863 Tj
+-250 TJm
+(and) 11.5087 Tj
+-250 TJm
+(use) 10.624 Tj
+-250 TJm
+(in) 6.20066 Tj
+-250 TJm
+(source) 20.8017 Tj
+-250 TJm
+(and) 11.5087 Tj
+-250 TJm
+(binary) 20.3634 Tj
+-250 TJm
+(forms,) 20.5865 Tj
+-250 TJm
+(with) 14.1707 Tj
+-250 TJm
+(or) 6.63901 Tj
+-250 TJm
+(without) 24.3563 Tj
+-250 TJm
+(modi\002cation,) 42.2888 Tj
+-250 TJm
+(are) 9.73137 Tj
+-250 TJm
+(permitted) 30.549 Tj
+-250 TJm
+(pro) 10.624 Tj
+15 TJm
+(vided) 17.7093 Tj
+-250 TJm
+(that) 11.955 Tj
+-250 TJm
+(the) 9.73934 Tj
+-250 TJm
+(follo) 15.0553 Tj
+25 TJm
+(wing) 15.94 Tj
+-250 TJm
+(conditions) 33.211 Tj
+-250 TJm
+(are) 9.73137 Tj
+-250 TJm
+(met:) 14.1707 Tj
+[1 0 0 1 72 631.615] cm
+0 g
+0 G
+[1 0 0 1 0 -23.779] cm
+0 g
+0 G
+[1 0 0 1 5.579 0] cm
+0 g
+0 G
+[1 0 0 1 -77.579 -607.836] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+77.579 607.836 Td
+/F128_0 7.97 Tf
+(\225) 2.7895 Tj
+[1 0 0 1 80.369 607.836] cm
+0 g
+0 G
+[1 0 0 1 1.992 0] cm
+0 g
+0 G
+[1 0 0 1 1.594 0] cm
+0 g
+0 G
+[1 0 0 1 -83.955 -607.836] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+83.955 607.836 Td
+/F128_0 7.97 Tf
+(Redistrib) 29.226 Tj
+20 TJm
+(utions) 19.4867 Tj
+-250 TJm
+(of) 6.63901 Tj
+-250 TJm
+(source) 20.8017 Tj
+-250 TJm
+(code) 15.0474 Tj
+-250 TJm
+(must) 15.5017 Tj
+-250 TJm
+(retain) 18.1477 Tj
+-250 TJm
+(the) 9.73934 Tj
+-250 TJm
+(abo) 11.5087 Tj
+15 TJm
+(v) 3.985 Tj
+15 TJm
+(e) 3.53868 Tj
+-250 TJm
+(cop) 11.5087 Tj
+10 TJm
+(yright) 19.0403 Tj
+-250 TJm
+(notice,) 21.4712 Tj
+-250 TJm
+(this) 11.5167 Tj
+-250 TJm
+(list) 9.74731 Tj
+-250 TJm
+(of) 6.63901 Tj
+-250 TJm
+(conditions) 33.211 Tj
+-250 TJm
+(and) 11.5087 Tj
+-250 TJm
+(the) 9.73934 Tj
+-250 TJm
+(follo) 15.0553 Tj
+25 TJm
+(wing) 15.94 Tj
+-250 TJm
+(disclaimer) 33.203 Tj
+55 TJm
+(.) 1.9925 Tj
+[1 0 0 1 470.908 607.836] cm
+0 g
+0 G
+[1 0 0 1 -398.908 -17.534] cm
+0 g
+0 G
+[1 0 0 1 5.579 0] cm
+0 g
+0 G
+[1 0 0 1 -77.579 -590.302] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+77.579 590.302 Td
+/F128_0 7.97 Tf
+(\225) 2.7895 Tj
+[1 0 0 1 80.369 590.302] cm
+0 g
+0 G
+[1 0 0 1 1.992 0] cm
+0 g
+0 G
+[1 0 0 1 1.594 0] cm
+0 g
+0 G
+[1 0 0 1 -83.955 -590.302] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+83.955 590.302 Td
+/F128_0 7.97 Tf
+(The) 12.3933 Tj
+-270 TJm
+(origin) 19.0403 Tj
+-270 TJm
+(of) 6.63901 Tj
+-270 TJm
+(this) 11.5167 Tj
+-270 TJm
+(softw) 17.7093 Tj
+10 TJm
+(are) 9.73137 Tj
+-270 TJm
+(must) 15.5017 Tj
+-270 TJm
+(not) 10.1857 Tj
+-270 TJm
+(be) 7.52368 Tj
+-270 TJm
+(misrepresented;) 50.466 Tj
+-280 TJm
+(you) 11.955 Tj
+-270 TJm
+(must) 15.5017 Tj
+-270 TJm
+(not) 10.1857 Tj
+-270 TJm
+(claim) 17.7093 Tj
+-270 TJm
+(that) 11.955 Tj
+-270 TJm
+(you) 11.955 Tj
+-270 TJm
+(wrote) 18.1477 Tj
+-270 TJm
+(the) 9.73934 Tj
+-270 TJm
+(original) 24.7947 Tj
+-270 TJm
+(softw) 17.7093 Tj
+10 TJm
+(are.) 11.7239 Tj
+-739 TJm
+(If) 5.30802 Tj
+-270 TJm
+(you) 11.955 Tj
+-270 TJm
+(use) 10.624 Tj
+-270 TJm
+(this) 11.5167 Tj
+-270 TJm
+(softw) 17.7093 Tj
+10 TJm
+(are) 9.73137 Tj
+-270 TJm
+(in) 6.20066 Tj
+-270 TJm
+(a) 3.53868 Tj
+83.955 580.738 Td
+(product,) 26.3409 Tj
+-250 TJm
+(an) 7.52368 Tj
+-250 TJm
+(ackno) 19.0324 Tj
+25 TJm
+(wledgment) 35.4187 Tj
+-250 TJm
+(in) 6.20066 Tj
+-250 TJm
+(the) 9.73934 Tj
+-250 TJm
+(product) 24.3484 Tj
+-250 TJm
+(documentation) 47.3737 Tj
+-250 TJm
+(w) 5.75434 Tj
+10 TJm
+(ould) 14.1707 Tj
+-250 TJm
+(be) 7.52368 Tj
+-250 TJm
+(appreciated) 36.7337 Tj
+-250 TJm
+(b) 3.985 Tj
+20 TJm
+(ut) 6.20066 Tj
+-250 TJm
+(is) 5.31599 Tj
+-250 TJm
+(not) 10.1857 Tj
+-250 TJm
+(required.) 28.5485 Tj
+[1 0 0 1 403.817 580.738] cm
+0 g
+0 G
+[1 0 0 1 -331.817 -17.535] cm
+0 g
+0 G
+[1 0 0 1 5.579 0] cm
+0 g
+0 G
+[1 0 0 1 -77.579 -563.203] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+77.579 563.203 Td
+/F128_0 7.97 Tf
+(\225) 2.7895 Tj
+[1 0 0 1 80.369 563.203] cm
+0 g
+0 G
+[1 0 0 1 1.992 0] cm
+0 g
+0 G
+[1 0 0 1 1.594 0] cm
+0 g
+0 G
+[1 0 0 1 -83.955 -563.203] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+83.955 563.203 Td
+/F128_0 7.97 Tf
+(Altered) 23.902 Tj
+-250 TJm
+(source) 20.8017 Tj
+-250 TJm
+(v) 3.985 Tj
+15 TJm
+(ersions) 22.579 Tj
+-250 TJm
+(must) 15.5017 Tj
+-250 TJm
+(be) 7.52368 Tj
+-250 TJm
+(plainly) 22.1407 Tj
+-250 TJm
+(mark) 16.3783 Tj
+10 TJm
+(ed) 7.52368 Tj
+-250 TJm
+(as) 6.63901 Tj
+-250 TJm
+(such,) 16.6015 Tj
+-250 TJm
+(and) 11.5087 Tj
+-250 TJm
+(must) 15.5017 Tj
+-250 TJm
+(not) 10.1857 Tj
+-250 TJm
+(be) 7.52368 Tj
+-250 TJm
+(misrepresented) 48.2504 Tj
+-250 TJm
+(as) 6.63901 Tj
+-250 TJm
+(being) 17.7093 Tj
+-250 TJm
+(the) 9.73934 Tj
+-250 TJm
+(original) 24.7947 Tj
+-250 TJm
+(softw) 17.7093 Tj
+10 TJm
+(are.) 11.7239 Tj
+[1 0 0 1 464.405 563.203] cm
+0 g
+0 G
+[1 0 0 1 -392.405 -17.534] cm
+0 g
+0 G
+[1 0 0 1 5.579 0] cm
+0 g
+0 G
+[1 0 0 1 -77.579 -545.669] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+77.579 545.669 Td
+/F128_0 7.97 Tf
+(\225) 2.7895 Tj
+[1 0 0 1 80.369 545.669] cm
+0 g
+0 G
+[1 0 0 1 1.992 0] cm
+0 g
+0 G
+[1 0 0 1 1.594 0] cm
+0 g
+0 G
+[1 0 0 1 -83.955 -545.669] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+83.955 545.669 Td
+/F128_0 7.97 Tf
+(The) 12.3933 Tj
+-250 TJm
+(name) 17.263 Tj
+-250 TJm
+(of) 6.63901 Tj
+-250 TJm
+(the) 9.73934 Tj
+-250 TJm
+(author) 20.3634 Tj
+-250 TJm
+(may) 13.7243 Tj
+-250 TJm
+(not) 10.1857 Tj
+-250 TJm
+(be) 7.52368 Tj
+-250 TJm
+(used) 14.609 Tj
+-250 TJm
+(to) 6.20066 Tj
+-250 TJm
+(endorse) 24.7867 Tj
+-250 TJm
+(or) 6.63901 Tj
+-250 TJm
+(promote) 26.564 Tj
+-250 TJm
+(products) 27.4487 Tj
+-250 TJm
+(deri) 12.3933 Tj
+25 TJm
+(v) 3.985 Tj
+15 TJm
+(ed) 7.52368 Tj
+-250 TJm
+(from) 15.4937 Tj
+-250 TJm
+(this) 11.5167 Tj
+-250 TJm
+(softw) 17.7093 Tj
+10 TJm
+(are) 9.73137 Tj
+-250 TJm
+(without) 24.3563 Tj
+-250 TJm
+(speci\002c) 24.3483 Tj
+-250 TJm
+(prior) 15.4937 Tj
+-250 TJm
+(written) 22.579 Tj
+-250 TJm
+(permission.) 36.9728 Tj
+[1 0 0 1 533.577 545.669] cm
+0 g
+0 G
+[1 0 0 1 -461.577 -9.696] cm
+0 g
+0 G
+[1 0 0 1 -72 -535.973] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 528.135 Td
+/F128_0 7.97 Tf
+(THIS) 17.7093 Tj
+-259 TJm
+(SOFTW) 27.0103 Tj
+120 TJm
+(ARE) 15.94 Tj
+-259 TJm
+(IS) 7.08533 Tj
+-258 TJm
+(PR) 9.74731 Tj
+40 TJm
+(O) 5.75434 Tj
+50 TJm
+(VIDED) 24.7867 Tj
+-259 TJm
+(BY) 11.0703 Tj
+-259 TJm
+(THE) 15.4937 Tj
+-259 TJm
+(A) 5.75434 Tj
+55 TJm
+(UTHOR) 27.4487 Tj
+-258 TJm
+("AS) 13.4374 Tj
+-259 TJm
+(IS") 10.3371 Tj
+-259 TJm
+(AND) 17.263 Tj
+-259 TJm
+(ANY) 17.263 Tj
+-258 TJm
+(EXPRESS) 34.1036 Tj
+-259 TJm
+(OR) 11.0703 Tj
+-259 TJm
+(IMPLIED) 32.3184 Tj
+-259 TJm
+(W) 7.52368 Tj
+120 TJm
+(ARRANTIES,) 46.7122 Tj
+-259 TJm
+(INCLUDING,) 46.2579 Tj
+-258 TJm
+(B) 5.31599 Tj
+10 TJm
+(UT) 10.624 Tj
+-259 TJm
+(NO) 11.5087 Tj
+40 TJm
+(T) 4.86967 Tj
+72 518.571 Td
+(LIMITED) 32.7567 Tj
+-303 TJm
+(T) 4.86967 Tj
+18 TJm
+(O,) 7.74684 Tj
+-303 TJm
+(THE) 15.4937 Tj
+-304 TJm
+(IMPLIED) 32.3184 Tj
+-303 TJm
+(W) 7.52368 Tj
+120 TJm
+(ARRANTIES) 44.7197 Tj
+-303 TJm
+(OF) 10.1857 Tj
+-303 TJm
+(MERCHANT) 44.7197 Tj
+93 TJm
+(ABILITY) 31.872 Tj
+-304 TJm
+(AND) 17.263 Tj
+-303 TJm
+(FITNESS) 31.4417 Tj
+-303 TJm
+(FOR) 15.5017 Tj
+-303 TJm
+(A) 5.75434 Tj
+-303 TJm
+(P) 4.43132 Tj
+92 TJm
+(AR) 11.0703 Tj
+60 TJm
+(TICULAR) 34.534 Tj
+-304 TJm
+(PURPOSE) 34.9883 Tj
+-303 TJm
+(ARE) 15.94 Tj
+-303 TJm
+(DISCLAI-) 34.0877 Tj
+72 509.007 Td
+(MED.) 19.7018 Tj
+-653 TJm
+(IN) 8.40835 Tj
+-326 TJm
+(NO) 11.5087 Tj
+-327 TJm
+(EVENT) 26.1177 Tj
+-326 TJm
+(SHALL) 25.6793 Tj
+-326 TJm
+(THE) 15.4937 Tj
+-327 TJm
+(A) 5.75434 Tj
+55 TJm
+(UTHOR) 27.4487 Tj
+-326 TJm
+(BE) 10.1857 Tj
+-327 TJm
+(LIABLE) 28.3333 Tj
+-326 TJm
+(FOR) 15.5017 Tj
+-326 TJm
+(ANY) 17.263 Tj
+-327 TJm
+(DIRECT) 28.7797 Tj
+74 TJm
+(,) 1.9925 Tj
+-326 TJm
+(INDIRECT) 37.188 Tj
+74 TJm
+(,) 1.9925 Tj
+-327 TJm
+(INCIDENT) 37.6264 Tj
+93 TJm
+(AL,) 12.6165 Tj
+-326 TJm
+(SPECIAL,) 34.3188 Tj
+-327 TJm
+(EXEMPLAR) 42.9503 Tj
+65 TJm
+(Y) 5.75434 Tj
+129 TJm
+(,) 1.9925 Tj
+-326 TJm
+(OR) 11.0703 Tj
+72 499.442 Td
+(CONSEQ) 31.88 Tj
+10 TJm
+(UENTIAL) 34.526 Tj
+-218 TJm
+(D) 5.75434 Tj
+40 TJm
+(AMA) 18.594 Tj
+40 TJm
+(GES) 15.0553 Tj
+-218 TJm
+(\(INCLUDING,) 48.9119 Tj
+-218 TJm
+(B) 5.31599 Tj
+10 TJm
+(UT) 10.624 Tj
+-218 TJm
+(NO) 11.5087 Tj
+40 TJm
+(T) 4.86967 Tj
+-218 TJm
+(LIMITED) 32.7567 Tj
+-219 TJm
+(T) 4.86967 Tj
+18 TJm
+(O,) 7.74684 Tj
+-218 TJm
+(PR) 9.74731 Tj
+40 TJm
+(OCUREMENT) 49.5893 Tj
+-218 TJm
+(OF) 10.1857 Tj
+-218 TJm
+(SUBSTITUTE) 47.82 Tj
+-218 TJm
+(GOODS) 27.4487 Tj
+-218 TJm
+(OR) 11.0703 Tj
+-218 TJm
+(SER) 14.617 Tj
+80 TJm
+(VICES;) 25.241 Tj
+-218 TJm
+(LOSS) 19.4867 Tj
+72 489.878 Td
+(OF) 10.1857 Tj
+-207 TJm
+(USE,) 17.0478 Tj
+-207 TJm
+(D) 5.75434 Tj
+40 TJm
+(A) 5.75434 Tj
+111 TJm
+(T) 4.86967 Tj
+93 TJm
+(A,) 7.74684 Tj
+-208 TJm
+(OR) 11.0703 Tj
+-207 TJm
+(PR) 9.74731 Tj
+40 TJm
+(OFITS;) 24.3563 Tj
+-207 TJm
+(OR) 11.0703 Tj
+-207 TJm
+(B) 5.31599 Tj
+10 TJm
+(USINESS) 32.3263 Tj
+-207 TJm
+(INTERR) 28.7797 Tj
+40 TJm
+(UPTION\)) 31.872 Tj
+-208 TJm
+(HO) 11.5087 Tj
+35 TJm
+(WEVER) 28.3333 Tj
+-207 TJm
+(CA) 11.0703 Tj
+55 TJm
+(USED) 20.8097 Tj
+-207 TJm
+(AND) 17.263 Tj
+-207 TJm
+(ON) 11.5087 Tj
+-207 TJm
+(ANY) 17.263 Tj
+-207 TJm
+(THEOR) 26.564 Tj
+65 TJm
+(Y) 5.75434 Tj
+-208 TJm
+(OF) 10.1857 Tj
+-207 TJm
+(LIABILITY) 39.3957 Tj
+129 TJm
+(,) 1.9925 Tj
+-207 TJm
+(WHETHER) 38.9574 Tj
+72 480.314 Td
+(IN) 8.40835 Tj
+-205 TJm
+(CONTRA) 32.7647 Tj
+40 TJm
+(CT) 10.1857 Tj
+74 TJm
+(,) 1.9925 Tj
+-205 TJm
+(STRICT) 27.4567 Tj
+-204 TJm
+(LIABILITY) 39.3957 Tj
+129 TJm
+(,) 1.9925 Tj
+-205 TJm
+(OR) 11.0703 Tj
+-205 TJm
+(T) 4.86967 Tj
+18 TJm
+(OR) 11.0703 Tj
+60 TJm
+(T) 4.86967 Tj
+-205 TJm
+(\(INCLUDING) 46.9194 Tj
+-204 TJm
+(NEGLIGENCE) 50.466 Tj
+-205 TJm
+(OR) 11.0703 Tj
+-205 TJm
+(O) 5.75434 Tj
+40 TJm
+(THER) 20.8097 Tj
+55 TJm
+(WISE\)) 22.1327 Tj
+-205 TJm
+(ARISING) 32.3184 Tj
+-205 TJm
+(IN) 8.40835 Tj
+-204 TJm
+(ANY) 17.263 Tj
+-205 TJm
+(W) 7.52368 Tj
+120 TJm
+(A) 5.75434 Tj
+105 TJm
+(Y) 5.75434 Tj
+-205 TJm
+(OUT) 16.3783 Tj
+-205 TJm
+(OF) 10.1857 Tj
+-204 TJm
+(THE) 15.4937 Tj
+-205 TJm
+(USE) 15.0553 Tj
+72 470.75 Td
+(OF) 10.1857 Tj
+-250 TJm
+(THIS) 17.7093 Tj
+-250 TJm
+(SOFTW) 27.0103 Tj
+120 TJm
+(ARE,) 17.9325 Tj
+-250 TJm
+(EVEN) 21.248 Tj
+-250 TJm
+(IF) 7.08533 Tj
+-250 TJm
+(AD) 11.5087 Tj
+40 TJm
+(VISED) 23.4637 Tj
+-250 TJm
+(OF) 10.1857 Tj
+-250 TJm
+(THE) 15.4937 Tj
+-250 TJm
+(POSSIBILITY) 47.82 Tj
+-250 TJm
+(OF) 10.1857 Tj
+-250 TJm
+(SUCH) 21.256 Tj
+-250 TJm
+(D) 5.75434 Tj
+40 TJm
+(AMA) 18.594 Tj
+40 TJm
+(GE.) 12.6165 Tj
+[1 0 0 1 72 469.598] cm
+0 g
+0 G
+[1 0 0 1 0 -7.97] cm
+0 g
+0 G
+[1 0 0 1 -72 -461.628] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 453.216 Td
+/F128_0 7.97 Tf
+(P) 4.43132 Tj
+92 TJm
+(A) 5.75434 Tj
+111 TJm
+(TENTS:) 27.0103 Tj
+-296 TJm
+(T) 4.86967 Tj
+80 TJm
+(o) 3.985 Tj
+-295 TJm
+(the) 9.73934 Tj
+-296 TJm
+(best) 12.8397 Tj
+-295 TJm
+(of) 6.63901 Tj
+-296 TJm
+(my) 10.1857 Tj
+-295 TJm
+(kno) 11.955 Tj
+25 TJm
+(wledge,) 25.0099 Tj
+[1 0 0 1 208.544 453.216] cm
+0 g
+0 G
+[1 0 0 1 -208.544 -453.216] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+208.544 453.216 Td
+/F130_0 7.97 Tf
+(bzip2) 23.91 Tj
+[1 0 0 1 232.454 453.216] cm
+0 g
+0 G
+[1 0 0 1 -232.454 -453.216] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+234.81 453.216 Td
+/F128_0 7.97 Tf
+(and) 11.5087 Tj
+[1 0 0 1 248.674 453.216] cm
+0 g
+0 G
+[1 0 0 1 -248.674 -453.216] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+248.674 453.216 Td
+/F130_0 7.97 Tf
+(libbzip2) 38.256 Tj
+[1 0 0 1 286.931 453.216] cm
+0 g
+0 G
+[1 0 0 1 -286.931 -453.216] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+289.286 453.216 Td
+/F128_0 7.97 Tf
+(do) 7.97 Tj
+-296 TJm
+(not) 10.1857 Tj
+-295 TJm
+(use) 10.624 Tj
+-296 TJm
+(an) 7.52368 Tj
+15 TJm
+(y) 3.985 Tj
+-295 TJm
+(patented) 27.0024 Tj
+-296 TJm
+(algorithms.) 36.0882 Tj
+-893 TJm
+(Ho) 9.73934 Tj
+25 TJm
+(we) 9.29302 Tj
+25 TJm
+(v) 3.985 Tj
+15 TJm
+(er) 6.19269 Tj
+40 TJm
+(,) 1.9925 Tj
+-307 TJm
+(I) 2.65401 Tj
+-295 TJm
+(do) 7.97 Tj
+-296 TJm
+(not) 10.1857 Tj
+-296 TJm
+(ha) 7.52368 Tj
+20 TJm
+(v) 3.985 Tj
+15 TJm
+(e) 3.53868 Tj
+-295 TJm
+(the) 9.73934 Tj
+-296 TJm
+(resources) 30.0947 Tj
+-295 TJm
+(to) 6.20066 Tj
+72 443.652 Td
+(carry) 16.3704 Tj
+-250 TJm
+(out) 10.1857 Tj
+-250 TJm
+(a) 3.53868 Tj
+-250 TJm
+(patent) 19.4787 Tj
+-250 TJm
+(search.) 22.3479 Tj
+-620 TJm
+(Therefore) 31.4177 Tj
+-250 TJm
+(I) 2.65401 Tj
+-250 TJm
+(cannot) 21.248 Tj
+-250 TJm
+(gi) 6.20066 Tj
+25 TJm
+(v) 3.985 Tj
+15 TJm
+(e) 3.53868 Tj
+-250 TJm
+(an) 7.52368 Tj
+15 TJm
+(y) 3.985 Tj
+-250 TJm
+(guarantee) 30.9794 Tj
+-250 TJm
+(of) 6.63901 Tj
+-250 TJm
+(the) 9.73934 Tj
+-250 TJm
+(abo) 11.5087 Tj
+15 TJm
+(v) 3.985 Tj
+15 TJm
+(e) 3.53868 Tj
+-250 TJm
+(statement.) 32.5415 Tj
+[1 0 0 1 72 441.926] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -391.074] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 46.799 0] cm
+0 g
+0 G
+[1 0 0 1 -46.799 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 3 3
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 140.398 0] cm
+0 g
+0 G
+[1 0 0 1 -140.398 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -13.948] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 707.441 Td
+/F121_0 17.215 Tf
+(T) 10.5184 Tj
+80 TJm
+(ab) 20.0899 Tj
+10 TJm
+(le) 14.3573 Tj
+-278 TJm
+(of) 16.251 Tj
+-278 TJm
+(Contents) 74.5926 Tj
+[1 0 0 1 72 698.619] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.741] cm
+0 g
+0 G
+[1 0 0 1 -72 -686.878] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 686.878 Td
+/F128_0 9.963 Tf
+(1.) 7.47225 Tj
+-310 TJm
+(Introduction) 49.2571 Tj
+[1 0 0 1 131.815 686.878] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -136.797 -686.878] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+145.733 686.878 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 686.878] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -686.878] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 686.878 Td
+/F128_0 9.963 Tf
+(1) 4.9815 Tj
+[1 0 0 1 516.09 686.878] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.099] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -72 -674.923] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 674.923 Td
+/F128_0 9.963 Tf
+(2.) 7.47225 Tj
+-310 TJm
+(Ho) 12.1748 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(bzip2) 22.1378 Tj
+[1 0 0 1 152.318 674.923] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -157.3 -674.923] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+167.054 674.923 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 674.923] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -674.923] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 674.923 Td
+/F128_0 9.963 Tf
+(2) 4.9815 Tj
+[1 0 0 1 516.09 674.923] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -662.968] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 662.968 Td
+/F128_0 9.963 Tf
+(2.1.) 14.9445 Tj
+-310 TJm
+(N) 7.19329 Tj
+35 TJm
+(AME) 22.1378 Tj
+[1 0 0 1 142.924 662.968] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -147.905 -662.968] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+157.929 662.968 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 662.968] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -662.968] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 662.968 Td
+/F128_0 9.963 Tf
+(2) 4.9815 Tj
+[1 0 0 1 516.09 662.968] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.099] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -651.013] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 651.013 Td
+/F128_0 9.963 Tf
+(2.2.) 14.9445 Tj
+-310 TJm
+(SYNOPSIS) 47.0552 Tj
+[1 0 0 1 160.996 651.013] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -165.977 -651.013] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+175.821 651.013 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 651.013] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -651.013] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 651.013 Td
+/F128_0 9.963 Tf
+(2) 4.9815 Tj
+[1 0 0 1 516.09 651.013] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -11.855] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -639.058] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 639.058 Td
+/F128_0 9.963 Tf
+(2.3.) 14.9445 Tj
+-310 TJm
+(DESCRIPTION) 64.7595 Tj
+[1 0 0 1 178.699 639.058] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -183.681 -639.058] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+193.528 639.058 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 639.058] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -639.058] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 639.058 Td
+/F128_0 9.963 Tf
+(3) 4.9815 Tj
+[1 0 0 1 516.09 639.058] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -11.855] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -627.103] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 627.103 Td
+/F128_0 9.963 Tf
+(2.4.) 14.9445 Tj
+-310 TJm
+(OPTIONS) 42.0638 Tj
+[1 0 0 1 156.005 627.103] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -160.986 -627.103] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+171.111 627.103 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 627.103] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -627.103] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 627.103 Td
+/F128_0 9.963 Tf
+(4) 4.9815 Tj
+[1 0 0 1 516.09 627.103] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -615.147] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 615.147 Td
+/F128_0 9.963 Tf
+(2.5.) 14.9445 Tj
+-310 TJm
+(MEMOR) 37.6402 Tj
+65 TJm
+(Y) 7.19329 Tj
+-250 TJm
+(MAN) 23.2437 Tj
+35 TJm
+(A) 7.19329 Tj
+40 TJm
+(GEMENT) 41.5059 Tj
+[1 0 0 1 231.81 615.147] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -236.791 -615.147] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+246.65 615.147 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 615.147] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -615.147] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 615.147 Td
+/F128_0 9.963 Tf
+(5) 4.9815 Tj
+[1 0 0 1 516.09 615.147] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.099] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -603.192] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 603.192 Td
+/F128_0 9.963 Tf
+(2.6.) 14.9445 Tj
+-310 TJm
+(RECO) 26.5713 Tj
+50 TJm
+(VERING) 37.6303 Tj
+-250 TJm
+(D) 7.19329 Tj
+40 TJm
+(A) 7.19329 Tj
+111 TJm
+(T) 6.08739 Tj
+93 TJm
+(A) 7.19329 Tj
+-250 TJm
+(FR) 12.1847 Tj
+40 TJm
+(OM) 16.0504 Tj
+-249 TJm
+(D) 7.19329 Tj
+40 TJm
+(AMA) 23.2437 Tj
+40 TJm
+(GED) 20.474 Tj
+-250 TJm
+(FILES) 26.5713 Tj
+[1 0 0 1 317.359 603.192] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -322.34 -603.192] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+331.489 603.192 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 603.192] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -603.192] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 603.192 Td
+/F128_0 9.963 Tf
+(6) 4.9815 Tj
+[1 0 0 1 516.09 603.192] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.099] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -591.237] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 591.237 Td
+/F128_0 9.963 Tf
+(2.7.) 14.9445 Tj
+-310 TJm
+(PERFORMANCE) 73.6266 Tj
+-250 TJm
+(NO) 14.3866 Tj
+40 TJm
+(TES) 17.7142 Tj
+[1 0 0 1 221.758 591.237] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -226.739 -591.237] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+237.196 591.237 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 591.237] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -591.237] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 591.237 Td
+/F128_0 9.963 Tf
+(6) 4.9815 Tj
+[1 0 0 1 516.09 591.237] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.099] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -579.282] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 579.282 Td
+/F128_0 9.963 Tf
+(2.8.) 14.9445 Tj
+-310 TJm
+(CA) 13.8386 Tj
+135 TJm
+(VEA) 20.474 Tj
+111 TJm
+(TS) 11.6268 Tj
+[1 0 0 1 157.429 579.282] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -162.411 -579.282] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+171.824 579.282 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 579.282] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -579.282] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 579.282 Td
+/F128_0 9.963 Tf
+(7) 4.9815 Tj
+[1 0 0 1 516.09 579.282] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -11.855] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -567.327] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 567.327 Td
+/F128_0 9.963 Tf
+(2.9.) 14.9445 Tj
+-310 TJm
+(A) 7.19329 Tj
+55 TJm
+(UTHOR) 34.3126 Tj
+[1 0 0 1 154.899 567.327] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -159.88 -567.327] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+168.345 567.327 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 567.327] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -567.327] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 567.327 Td
+/F128_0 9.963 Tf
+(7) 4.9815 Tj
+[1 0 0 1 516.09 567.327] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.219] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.736] cm
+0 g
+0 G
+[1 0 0 1 -72 -555.372] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 555.372 Td
+/F128_0 9.963 Tf
+(3.) 7.47225 Tj
+-310 TJm
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip) 27.6772 Tj
+1 TJm
+(2) 4.9815 Tj
+[1 0 0 1 195.197 555.372] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -200.178 -555.372] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.633 555.372 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 555.372] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -555.372] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 555.372 Td
+/F128_0 9.963 Tf
+(8) 4.9815 Tj
+[1 0 0 1 516.09 555.372] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -543.416] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 543.416 Td
+/F128_0 9.963 Tf
+(3.1.) 14.9445 Tj
+-310 TJm
+(T) 6.08739 Tj
+80 TJm
+(op-le) 20.474 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(structure) 34.8605 Tj
+[1 0 0 1 188.831 543.416] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -193.812 -543.416] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+203.022 543.416 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 543.416] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -543.416] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 543.416 Td
+/F128_0 9.963 Tf
+(8) 4.9815 Tj
+[1 0 0 1 516.09 543.416] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.156] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -531.461] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 531.461 Td
+/F128_0 9.963 Tf
+(3.1.1.) 22.4168 Tj
+-310 TJm
+(Lo) 11.0689 Tj
+25 TJm
+(w-le) 17.7043 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(summary) 37.0823 Tj
+[1 0 0 1 225.195 531.461] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -230.176 -531.461] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+238.915 531.461 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 531.461] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -531.461] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 531.461 Td
+/F128_0 9.963 Tf
+(9) 4.9815 Tj
+[1 0 0 1 516.09 531.461] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -519.506] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 519.506 Td
+/F128_0 9.963 Tf
+(3.1.2.) 22.4168 Tj
+-310 TJm
+(High-le) 30.437 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(summary) 37.0823 Tj
+[1 0 0 1 227.107 519.506] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -232.089 -519.506] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+242.085 519.506 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 519.506] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -519.506] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 519.506 Td
+/F128_0 9.963 Tf
+(9) 4.9815 Tj
+[1 0 0 1 516.09 519.506] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -507.551] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 507.551 Td
+/F128_0 9.963 Tf
+(3.1.3.) 22.4168 Tj
+-310 TJm
+(Utility) 26.0234 Tj
+-250 TJm
+(functions) 37.0823 Tj
+-250 TJm
+(sum) 16.6083 Tj
+1 TJm
+(mary) 20.474 Tj
+[1 0 0 1 250.489 507.551] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -255.471 -507.551] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+264.846 507.551 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 507.551] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -507.551] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 507.551 Td
+/F128_0 9.963 Tf
+(9) 4.9815 Tj
+[1 0 0 1 516.09 507.551] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -495.596] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 495.596 Td
+/F128_0 9.963 Tf
+(3.2.) 14.9445 Tj
+-310 TJm
+(Error) 21.0219 Tj
+-250 TJm
+(handling) 34.8705 Tj
+[1 0 0 1 172.323 495.596] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -177.305 -495.596] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+185.636 495.596 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 495.596] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -495.596] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 495.596 Td
+/F128_0 9.963 Tf
+(10) 9.963 Tj
+[1 0 0 1 516.09 495.596] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -483.641] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 483.641 Td
+/F128_0 9.963 Tf
+(3.3.) 14.9445 Tj
+-310 TJm
+(Lo) 11.0689 Tj
+25 TJm
+(w-le) 17.7043 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace) 13.2707 Tj
+[1 0 0 1 191.481 483.641] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -196.462 -483.641] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+206.284 483.641 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 483.641] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -483.641] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 483.641 Td
+/F128_0 9.963 Tf
+(11) 9.963 Tj
+[1 0 0 1 516.09 483.641] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -471.685] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 471.685 Td
+/F128_0 9.963 Tf
+(3.3.1.) 22.4168 Tj
+-310 TJm
+(BZ2_bzCompressInit) 85.7914 Tj
+[1 0 0 1 231.112 471.685] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -236.094 -471.685] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+246.025 471.685 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 471.685] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -471.685] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 471.685 Td
+/F128_0 9.963 Tf
+(11) 9.963 Tj
+[1 0 0 1 516.09 471.685] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.156] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -459.73] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 459.73 Td
+/F128_0 9.963 Tf
+(3.3.2.) 22.4168 Tj
+-310 TJm
+(BZ2_bzCompress) 71.9528 Tj
+[1 0 0 1 217.275 459.73] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -222.256 -459.73] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+232.464 459.73 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 459.73] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -459.73] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 459.73 Td
+/F128_0 9.963 Tf
+(13) 9.963 Tj
+[1 0 0 1 516.09 459.73] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -447.775] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 447.775 Td
+/F128_0 9.963 Tf
+(3.3.3.) 22.4168 Tj
+-310 TJm
+(BZ2_bzCompressEnd) 88.0032 Tj
+[1 0 0 1 233.324 447.775] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -238.306 -447.775] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+247.131 447.775 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 447.775] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -447.775] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 447.775 Td
+/F128_0 9.963 Tf
+(16) 9.963 Tj
+[1 0 0 1 516.09 447.775] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -435.82] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 435.82 Td
+/F128_0 9.963 Tf
+(3.3.4.) 22.4168 Tj
+-310 TJm
+(BZ2_bzDecompressIni) 92.4168 Tj
+1 TJm
+(t) 2.76971 Tj
+[1 0 0 1 240.507 435.82] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -245.488 -435.82] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+255.15 435.82 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 435.82] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -435.82] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 435.82 Td
+/F128_0 9.963 Tf
+(16) 9.963 Tj
+[1 0 0 1 516.09 435.82] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -423.865] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 423.865 Td
+/F128_0 9.963 Tf
+(3.3.5.) 22.4168 Tj
+-310 TJm
+(BZ2_bzDecompress) 81.3479 Tj
+[1 0 0 1 226.669 423.865] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -231.651 -423.865] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+241.589 423.865 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 423.865] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -423.865] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 423.865 Td
+/F128_0 9.963 Tf
+(17) 9.963 Tj
+[1 0 0 1 516.09 423.865] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -411.91] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 411.91 Td
+/F128_0 9.963 Tf
+(3.3.6.) 22.4168 Tj
+-310 TJm
+(BZ2_bzDecompressEn) 92.4168 Tj
+1 TJm
+(d) 4.9815 Tj
+[1 0 0 1 242.719 411.91] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -247.7 -411.91] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+256.256 411.91 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 411.91] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -411.91] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 411.91 Td
+/F128_0 9.963 Tf
+(18) 9.963 Tj
+[1 0 0 1 516.09 411.91] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -399.954] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 399.954 Td
+/F128_0 9.963 Tf
+(3.4.) 14.9445 Tj
+-310 TJm
+(High-le) 30.437 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace) 13.2707 Tj
+[1 0 0 1 193.394 399.954] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -198.375 -399.954] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+207.24 399.954 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 399.954] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -399.954] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 399.954 Td
+/F128_0 9.963 Tf
+(18) 9.963 Tj
+[1 0 0 1 516.09 399.954] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.156] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -387.999] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 387.999 Td
+/F128_0 9.963 Tf
+(3.4.1.) 22.4168 Tj
+-310 TJm
+(BZ2_bzReadOpen) 74.1546 Tj
+[1 0 0 1 219.477 387.999] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -224.458 -387.999] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+233.565 387.999 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 387.999] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -387.999] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 387.999 Td
+/F128_0 9.963 Tf
+(19) 9.963 Tj
+[1 0 0 1 516.09 387.999] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -376.044] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 376.044 Td
+/F128_0 9.963 Tf
+(3.4.2.) 22.4168 Tj
+-310 TJm
+(BZ2_bzRead) 52.5748 Tj
+[1 0 0 1 197.898 376.044] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -202.879 -376.044] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+211.706 376.044 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 376.044] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -376.044] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 376.044 Td
+/F128_0 9.963 Tf
+(20) 9.963 Tj
+[1 0 0 1 516.09 376.044] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -1.18] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -10.775] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -364.089] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 364.089 Td
+/F128_0 9.963 Tf
+(3.4.3.) 22.4168 Tj
+-310 TJm
+(BZ2_bzReadGetUnuse) 92.4168 Tj
+1 TJm
+(d) 4.9815 Tj
+[1 0 0 1 242.719 364.089] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -247.7 -364.089] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+256.256 364.089 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 364.089] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -364.089] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 364.089 Td
+/F128_0 9.963 Tf
+(21) 9.963 Tj
+[1 0 0 1 516.09 364.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -1.181] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -10.774] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -352.134] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 352.134 Td
+/F128_0 9.963 Tf
+(3.4.4.) 22.4168 Tj
+-310 TJm
+(BZ2_bzReadClose) 75.2705 Tj
+[1 0 0 1 220.592 352.134] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -225.573 -352.134] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+234.123 352.134 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 352.134] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -352.134] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 352.134 Td
+/F128_0 9.963 Tf
+(22) 9.963 Tj
+[1 0 0 1 516.09 352.134] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -1.181] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -10.774] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -340.179] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 340.179 Td
+/F128_0 9.963 Tf
+(3.4.5.) 22.4168 Tj
+-310 TJm
+(BZ2_bzWriteOpen) 76.3664 Tj
+[1 0 0 1 221.688 340.179] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -226.669 -340.179] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+236.885 340.179 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 340.179] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -340.179] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 340.179 Td
+/F128_0 9.963 Tf
+(22) 9.963 Tj
+[1 0 0 1 516.09 340.179] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -328.223] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 328.223 Td
+/F128_0 9.963 Tf
+(3.4.6.) 22.4168 Tj
+-310 TJm
+(BZ2_bzWrite) 54.7865 Tj
+[1 0 0 1 200.109 328.223] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -205.09 -328.223] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+215.026 328.223 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 328.223] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -328.223] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 328.223 Td
+/F128_0 9.963 Tf
+(23) 9.963 Tj
+[1 0 0 1 516.09 328.223] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -1.18] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -10.775] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -316.268] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 316.268 Td
+/F128_0 9.963 Tf
+(3.4.7.) 22.4168 Tj
+-310 TJm
+(BZ2_bzWriteClose) 77.4823 Tj
+[1 0 0 1 222.804 316.268] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -227.785 -316.268] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+237.443 316.268 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 316.268] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -316.268] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 316.268 Td
+/F128_0 9.963 Tf
+(23) 9.963 Tj
+[1 0 0 1 516.09 316.268] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -1.18] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -10.775] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -304.313] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 304.313 Td
+/F128_0 9.963 Tf
+(3.4.8.) 22.4168 Tj
+-310 TJm
+(Handling) 37.0823 Tj
+-250 TJm
+(embedded) 40.9479 Tj
+-250 TJm
+(com) 17.1563 Tj
+1 TJm
+(pressed) 29.879 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(streams) 30.437 Tj
+[1 0 0 1 327.38 304.313] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -332.362 -304.313] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+342.865 304.313 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 304.313] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -304.313] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 304.313 Td
+/F128_0 9.963 Tf
+(24) 9.963 Tj
+[1 0 0 1 516.09 304.313] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -292.358] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 292.358 Td
+/F128_0 9.963 Tf
+(3.4.9.) 22.4168 Tj
+-310 TJm
+(Standard) 35.4185 Tj
+-250 TJm
+(\002le-reading/) 48.6991 Tj
+1 TJm
+(writing) 28.7831 Tj
+-250 TJm
+(code) 18.8101 Tj
+[1 0 0 1 282.011 292.358] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -286.992 -292.358] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+295.827 292.358 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 292.358] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -292.358] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 292.358 Td
+/F128_0 9.963 Tf
+(25) 9.963 Tj
+[1 0 0 1 516.09 292.358] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -280.403] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 280.403 Td
+/F128_0 9.963 Tf
+(3.5.) 14.9445 Tj
+-310 TJm
+(Utility) 26.0234 Tj
+-250 TJm
+(functions) 37.0823 Tj
+[1 0 0 1 179.536 280.403] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -184.517 -280.403] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+193.67 280.403 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 280.403] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -280.403] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 280.403 Td
+/F128_0 9.963 Tf
+(26) 9.963 Tj
+[1 0 0 1 516.09 280.403] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -268.448] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 268.448 Td
+/F128_0 9.963 Tf
+(3.5.1.) 22.4168 Tj
+-310 TJm
+(BZ2_bzBuf) 47.0453 Tj
+25 TJm
+(fT) 9.40507 Tj
+80 TJm
+(oBuf) 19.926 Tj
+25 TJm
+(fCom) 22.6957 Tj
+1 TJm
+(press) 20.474 Tj
+[1 0 0 1 263.571 268.448] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -268.552 -268.448] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+277.751 268.448 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 268.448] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -268.448] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 268.448 Td
+/F128_0 9.963 Tf
+(26) 9.963 Tj
+[1 0 0 1 516.09 268.448] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -256.492] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 256.492 Td
+/F128_0 9.963 Tf
+(3.5.2.) 22.4168 Tj
+-310 TJm
+(BZ2_bzBuf) 47.0453 Tj
+25 TJm
+(fT) 9.40507 Tj
+80 TJm
+(oBuf) 19.926 Tj
+25 TJm
+(fDeco) 24.3396 Tj
+1 TJm
+(mpress) 28.2252 Tj
+[1 0 0 1 272.965 256.492] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -277.947 -256.492] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+286.876 256.492 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 256.492] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -256.492] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 256.492 Td
+/F128_0 9.963 Tf
+(27) 9.963 Tj
+[1 0 0 1 516.09 256.492] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.156] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -244.537] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 244.537 Td
+/F128_0 9.963 Tf
+(3.6.) 14.9445 Tj
+-310 TJm
+(zlib) 14.9445 Tj
+-250 TJm
+(compatibility) 53.1426 Tj
+-250 TJm
+(functio) 28.2252 Tj
+1 TJm
+(ns) 8.85711 Tj
+[1 0 0 1 224.088 244.537] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -229.069 -244.537] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+238.085 244.537 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 244.537] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -244.537] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 244.537 Td
+/F128_0 9.963 Tf
+(28) 9.963 Tj
+[1 0 0 1 516.09 244.537] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -232.582] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 232.582 Td
+/F128_0 9.963 Tf
+(3.7.) 14.9445 Tj
+-310 TJm
+(Using) 23.8016 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(library) 26.5614 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(stdio) 19.378 Tj
+1 TJm
+(-free) 18.8002 Tj
+-250 TJm
+(en) 9.40507 Tj
+40 TJm
+(vironment) 40.9579 Tj
+[1 0 0 1 291.734 232.582] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -296.715 -232.582] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+305.116 232.582 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 232.582] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -232.582] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 232.582 Td
+/F128_0 9.963 Tf
+(28) 9.963 Tj
+[1 0 0 1 516.09 232.582] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -220.627] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 220.627 Td
+/F128_0 9.963 Tf
+(3.7.1.) 22.4168 Tj
+-310 TJm
+(Getting) 29.889 Tj
+-250 TJm
+(rid) 11.0689 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(stdio) 19.378 Tj
+[1 0 0 1 221.429 220.627] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -226.41 -220.627] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+236.755 220.627 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 220.627] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -220.627] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 220.627 Td
+/F128_0 9.963 Tf
+(29) 9.963 Tj
+[1 0 0 1 516.09 220.627] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -208.672] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 208.672 Td
+/F128_0 9.963 Tf
+(3.7.2.) 22.4168 Tj
+-310 TJm
+(Critical) 29.889 Tj
+-250 TJm
+(error) 19.3581 Tj
+-250 TJm
+(handlin) 29.889 Tj
+1 TJm
+(g) 4.9815 Tj
+[1 0 0 1 234.42 208.672] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -239.401 -208.672] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+249.892 208.672 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 208.672] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -208.672] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 208.672 Td
+/F128_0 9.963 Tf
+(29) 9.963 Tj
+[1 0 0 1 516.09 208.672] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -196.717] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 196.717 Td
+/F128_0 9.963 Tf
+(3.8.) 14.9445 Tj
+-310 TJm
+(Making) 30.9949 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(W) 9.40507 Tj
+40 TJm
+(indo) 17.7142 Tj
+25 TJm
+(ws) 11.0689 Tj
+-250 TJm
+(DLL) 19.3681 Tj
+[1 0 0 1 213.738 196.717] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -218.719 -196.717] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+228.482 196.717 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 196.717] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -196.717] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 196.717 Td
+/F128_0 9.963 Tf
+(29) 9.963 Tj
+[1 0 0 1 516.09 196.717] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -72 -184.761] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 184.761 Td
+/F128_0 9.963 Tf
+(4.) 7.47225 Tj
+-310 TJm
+(Miscellanea) 48.1412 Tj
+[1 0 0 1 130.699 184.761] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -135.68 -184.761] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+144.898 184.761 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 184.761] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -184.761] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 184.761 Td
+/F128_0 9.963 Tf
+(31) 9.963 Tj
+[1 0 0 1 516.09 184.761] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.099] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -172.806] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 172.806 Td
+/F128_0 9.963 Tf
+(4.1.) 14.9445 Tj
+-310 TJm
+(Limitations) 45.9494 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(compre) 29.879 Tj
+1 TJm
+(ssed) 17.1563 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+-250 TJm
+(format) 26.5614 Tj
+[1 0 0 1 279.141 172.806] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -284.122 -172.806] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+294.392 172.806 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 172.806] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -172.806] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 172.806 Td
+/F128_0 9.963 Tf
+(31) 9.963 Tj
+[1 0 0 1 516.09 172.806] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -160.851] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 160.851 Td
+/F128_0 9.963 Tf
+(4.2.) 14.9445 Tj
+-310 TJm
+(Portability) 42.0737 Tj
+-250 TJm
+(issues) 23.8016 Tj
+[1 0 0 1 182.305 160.851] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -187.286 -160.851] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+197.268 160.851 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 160.851] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -160.851] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 160.851 Td
+/F128_0 9.963 Tf
+(32) 9.963 Tj
+[1 0 0 1 516.09 160.851] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -148.896] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 148.896 Td
+/F128_0 9.963 Tf
+(4.3.) 14.9445 Tj
+-310 TJm
+(Reporting) 39.852 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ugs) 13.8386 Tj
+[1 0 0 1 174.904 148.896] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -179.885 -148.896] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+189.14 148.896 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 148.896] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -148.896] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 148.896 Td
+/F128_0 9.963 Tf
+(32) 9.963 Tj
+[1 0 0 1 516.09 148.896] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -136.941] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 136.941 Td
+/F128_0 9.963 Tf
+(4.4.) 14.9445 Tj
+-310 TJm
+(Did) 14.9445 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(get) 12.1748 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(right) 18.8201 Tj
+-250 TJm
+(packag) 28.2152 Tj
+1 TJm
+(e?) 8.84714 Tj
+[1 0 0 1 236.512 136.941] cm
+0 g
+0 G
+[1 0 0 1 3.088 0] cm
+0 g
+0 G
+[1 0 0 1 3.089 0] cm
+0 g
+0 G
+[1 0 0 1 -242.689 -136.941] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+254.348 136.941 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 136.941] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -136.941] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 136.941 Td
+/F128_0 9.963 Tf
+(33) 9.963 Tj
+[1 0 0 1 516.09 136.941] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 23.91 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -95.91 -124.986] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.91 124.986 Td
+/F128_0 9.963 Tf
+(4.5.) 14.9445 Tj
+-310 TJm
+(Further) 29.3311 Tj
+-250 TJm
+(Reading) 33.2067 Tj
+[1 0 0 1 178.968 124.986] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -183.95 -124.986] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+193.386 124.986 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 124.986] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -124.986] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 124.986 Td
+/F128_0 9.963 Tf
+(34) 9.963 Tj
+[1 0 0 1 516.09 124.986] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 0 -62.014] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.754] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 41.399 -6.754] cm
+0 g
+0 G
+[1 0 0 1 -494.668 -50.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+536.068 50.852 Td
+/F128_0 9.963 Tf
+(iii) 8.30914 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 4 4
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 140.398 0] cm
+0 g
+0 G
+[1 0 0 1 -140.398 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -13.948] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 701.916 Td
+/F121_0 24.79 Tf
+(1.) 20.6749 Tj
+-278 TJm
+(Intr) 39.9367 Tj
+20 TJm
+(oduction) 104.663 Tj
+[1 0 0 1 72 701.606] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -691.643] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 679.998 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 679.998] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -679.998] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+104.507 679.998 Td
+/F128_0 9.963 Tf
+(compresses) 45.9294 Tj
+-263 TJm
+(\002les) 16.6083 Tj
+-262 TJm
+(using) 21.5898 Tj
+-263 TJm
+(the) 12.1748 Tj
+-263 TJm
+(Burro) 23.2437 Tj
+25 TJm
+(ws-Wheeler) 48.1313 Tj
+-263 TJm
+(block-sor) 37.6303 Tj
+1 TJm
+(ting) 15.5024 Tj
+-263 TJm
+(te) 7.19329 Tj
+15 TJm
+(xt) 7.75121 Tj
+-263 TJm
+(compression) 50.363 Tj
+-263 TJm
+(algorithm,) 41.2369 Tj
+-266 TJm
+(and) 14.3866 Tj
+-263 TJm
+(H) 7.19329 Tj
+1 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fman) 20.474 Tj
+-263 TJm
+(coding.) 29.61 Tj
+72 668.043 Td
+(Compression) 52.5847 Tj
+-203 TJm
+(is) 6.64532 Tj
+-203 TJm
+(generally) 37.0723 Tj
+-204 TJm
+(c) 4.42357 Tj
+1 TJm
+(onsiderably) 46.4874 Tj
+-204 TJm
+(better) 22.6858 Tj
+-203 TJm
+(than) 17.1563 Tj
+-203 TJm
+(that) 14.9445 Tj
+-203 TJm
+(achie) 21.0219 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ed) 9.40507 Tj
+-203 TJm
+(by) 9.963 Tj
+-204 TJm
+(more) 20.474 Tj
+-203 TJm
+(con) 14.3866 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(entional) 32.1008 Tj
+-203 TJm
+(LZ77/LZ78-based) 73.0487 Tj
+-203 TJm
+(compressors,) 52.2958 Tj
+72 656.087 Td
+(and) 14.3866 Tj
+-250 TJm
+(approaches) 44.8136 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(performan) 41.4959 Tj
+1 TJm
+(ce) 8.84714 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(PPM) 19.936 Tj
+-250 TJm
+(f) 3.31768 Tj
+10 TJm
+(amily) 22.6957 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(statistical) 37.6402 Tj
+-250 TJm
+(compressors.) 52.2958 Tj
+[1 0 0 1 72 653.931] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -643.968] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 634.17 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 634.17] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -634.17] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+105.074 634.17 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-320 TJm
+(b) 4.9815 Tj
+20 TJm
+(uilt) 13.2906 Tj
+-319 TJm
+(on) 9.963 Tj
+-320 TJm
+(top) 12.7327 Tj
+-320 TJm
+(of) 8.29918 Tj
+[1 0 0 1 176.712 634.17] cm
+0 g
+0 G
+[1 0 0 1 -176.712 -634.17] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+176.712 634.17 Td
+/F130_0 9.963 Tf
+(libbzip2) 47.8224 Tj
+[1 0 0 1 224.533 634.17] cm
+0 g
+0 G
+[1 0 0 1 -224.533 -634.17] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+224.533 634.17 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-337 TJm
+(a) 4.42357 Tj
+-320 TJm
+(\003e) 9.963 Tj
+15 TJm
+(xible) 19.926 Tj
+-319 TJm
+(library) 26.5614 Tj
+-320 TJm
+(for) 11.6169 Tj
+-320 TJm
+(handling) 34.8705 Tj
+-319 TJm
+(compressed) 47.0353 Tj
+-320 TJm
+(data) 16.5984 Tj
+-320 TJm
+(in) 7.75121 Tj
+-319 TJm
+(the) 12.1748 Tj
+[1 0 0 1 449.816 634.17] cm
+0 g
+0 G
+[1 0 0 1 -449.816 -634.17] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+449.816 634.17 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 479.704 634.17] cm
+0 g
+0 G
+[1 0 0 1 -479.704 -634.17] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+482.889 634.17 Td
+/F128_0 9.963 Tf
+(format.) 29.0521 Tj
+-1038 TJm
+(This) 17.7142 Tj
+72 622.214 Td
+(manual) 29.3311 Tj
+-316 TJm
+(describes) 37.0723 Tj
+-316 TJm
+(both) 17.7142 Tj
+-316 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-316 TJm
+(to) 7.75121 Tj
+-316 TJm
+(use) 13.2807 Tj
+-317 TJm
+(the) 12.1748 Tj
+-316 TJm
+(program) 33.7546 Tj
+-316 TJm
+(and) 14.3866 Tj
+-316 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-316 TJm
+(to) 7.75121 Tj
+-316 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork) 13.2807 Tj
+-316 TJm
+(with) 17.7142 Tj
+-316 TJm
+(the) 12.1748 Tj
+-316 TJm
+(library) 26.5614 Tj
+-317 TJm
+(int) 10.5209 Tj
+1 TJm
+(erf) 11.0589 Tj
+10 TJm
+(ace.) 15.7615 Tj
+-1018 TJm
+(M) 8.85711 Tj
+1 TJm
+(ost) 11.6268 Tj
+-317 TJm
+(of) 8.29918 Tj
+-316 TJm
+(the) 12.1748 Tj
+-316 TJm
+(manual) 29.3311 Tj
+-316 TJm
+(is) 6.64532 Tj
+72 610.259 Td
+(de) 9.40507 Tj
+25 TJm
+(v) 4.9815 Tj
+20 TJm
+(oted) 17.1563 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(this) 14.3965 Tj
+-250 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+-250 TJm
+(not) 12.7327 Tj
+-250 TJm
+(the) 12.1748 Tj
+-249 TJm
+(program,) 36.2454 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(good) 19.926 Tj
+-250 TJm
+(ne) 9.40507 Tj
+25 TJm
+(ws) 11.0689 Tj
+-250 TJm
+(if) 6.08739 Tj
+-250 TJm
+(your) 18.2622 Tj
+-250 TJm
+(interest) 29.3311 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(only) 17.7142 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(th) 7.75121 Tj
+1 TJm
+(e) 4.42357 Tj
+-250 TJm
+(program.) 36.2454 Tj
+[1 0 0 1 72 608.102] cm
+0 g
+0 G
+[1 0 0 1 0 -29.723] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -578.379] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 578.379 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 578.379] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -86.944 -578.379] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 578.379 Td
+/F128_0 9.963 Tf
+(Ho) 12.1748 Tj
+25 TJm
+(w) 7.19329 Tj
+-259 TJm
+(to) 7.75121 Tj
+-260 TJm
+(use) 13.2807 Tj
+-259 TJm
+(bzip2) 22.1378 Tj
+[1 0 0 1 156.985 578.379] cm
+0 g
+0 G
+0 0 1 rg
+0 0 1 RG
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -156.985 -578.379] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+159.57 578.379 Td
+/F128_0 9.963 Tf
+([2]) 11.6169 Tj
+[1 0 0 1 171.186 578.379] cm
+0 0 1 rg
+0 0 1 RG
+0 g
+0 G
+[1 0 0 1 -171.186 -578.379] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+173.771 578.379 Td
+/F128_0 9.963 Tf
+(describes) 37.0723 Tj
+-259 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-260 TJm
+(to) 7.75121 Tj
+-259 TJm
+(use) 13.2807 Tj
+[1 0 0 1 259.119 578.379] cm
+0 g
+0 G
+[1 0 0 1 -259.119 -578.379] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+259.119 578.379 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 289.007 578.379] cm
+0 g
+0 G
+[1 0 0 1 -289.007 -578.379] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+289.007 578.379 Td
+/F128_0 9.963 Tf
+(;) 2.76971 Tj
+-264 TJm
+(this) 14.3965 Tj
+-260 TJm
+(i) 2.76971 Tj
+1 TJm
+(s) 3.87561 Tj
+-260 TJm
+(the) 12.1748 Tj
+-259 TJm
+(only) 17.7142 Tj
+-260 TJm
+(part) 15.4925 Tj
+-259 TJm
+(you) 14.9445 Tj
+-259 TJm
+(need) 18.8101 Tj
+-260 TJm
+(to) 7.75121 Tj
+-259 TJm
+(read) 17.1463 Tj
+-260 TJm
+(if) 6.08739 Tj
+-259 TJm
+(you) 14.9445 Tj
+-259 TJm
+(just) 14.3965 Tj
+-260 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-259 TJm
+(to) 7.75121 Tj
+-260 TJm
+(kno) 14.9445 Tj
+25 TJm
+(w) 7.19329 Tj
+86.944 566.424 Td
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(operate) 29.3211 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(program.) 36.2454 Tj
+[1 0 0 1 199.302 566.424] cm
+0 g
+0 G
+[1 0 0 1 -127.302 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -544.506] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 544.506 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 544.506] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -86.944 -544.506] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 544.506 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 197.09 544.506] cm
+0 g
+0 G
+0 0 1 rg
+0 0 1 RG
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -197.09 -544.506] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+199.58 544.506 Td
+/F128_0 9.963 Tf
+([8]) 11.6169 Tj
+[1 0 0 1 211.197 544.506] cm
+0 0 1 rg
+0 0 1 RG
+0 g
+0 G
+[1 0 0 1 -211.197 -544.506] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+213.687 544.506 Td
+/F128_0 9.963 Tf
+(describes) 37.0723 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(programming) 54.2386 Tj
+-250 TJm
+(int) 10.5209 Tj
+1 TJm
+(erf) 11.0589 Tj
+10 TJm
+(aces) 17.1463 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(detail,) 24.6285 Tj
+-250 TJm
+(and) 14.3866 Tj
+[1 0 0 1 417.501 544.506] cm
+0 g
+0 G
+[1 0 0 1 -345.501 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -522.588] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 522.588 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 522.588] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -86.944 -522.588] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 522.588 Td
+/F128_0 9.963 Tf
+(Miscellanea) 48.1412 Tj
+[1 0 0 1 135.083 522.588] cm
+0 g
+0 G
+0 0 1 rg
+0 0 1 RG
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -135.083 -522.588] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+137.573 522.588 Td
+/F128_0 9.963 Tf
+([31]) 16.5984 Tj
+[1 0 0 1 154.171 522.588] cm
+0 0 1 rg
+0 0 1 RG
+0 g
+0 G
+[1 0 0 1 -154.171 -522.588] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+156.662 522.588 Td
+/F128_0 9.963 Tf
+(records) 29.3211 Tj
+-250 TJm
+(some) 21.0319 Tj
+-250 TJm
+(miscellane) 42.6118 Tj
+1 TJm
+(ous) 13.8386 Tj
+-250 TJm
+(notes) 21.0319 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(I) 3.31768 Tj
+-250 TJm
+(thought) 30.4469 Tj
+-250 TJm
+(ought) 22.6957 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(recorded) 34.8506 Tj
+-250 TJm
+(some) 21.0319 Tj
+25 TJm
+(where.) 26.8304 Tj
+[1 0 0 1 492.31 522.588] cm
+0 g
+0 G
+[1 0 0 1 -420.31 -471.736] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.754] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 43.063 -6.754] cm
+0 g
+0 G
+[1 0 0 1 -496.332 -50.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+539.395 50.852 Td
+/F128_0 9.963 Tf
+(1) 4.9815 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 5 5
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 140.398 0] cm
+0 g
+0 G
+[1 0 0 1 -140.398 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -13.948] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 701.916 Td
+/F121_0 24.79 Tf
+(2.) 20.6749 Tj
+-278 TJm
+(Ho) 33.0451 Tj
+15 TJm
+(w) 19.2866 Tj
+-278 TJm
+(to) 23.4018 Tj
+-278 TJm
+(use) 42.7132 Tj
+-278 TJm
+(bzip2) 63.3632 Tj
+[1 0 0 1 72 696.784] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -14.944] cm
+0 g
+0 G
+[1 0 0 1 -72 -671.877] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 656.35 Td
+/F121_0 17.215 Tf
+(T) 10.5184 Tj
+80 TJm
+(ab) 20.0899 Tj
+10 TJm
+(le) 14.3573 Tj
+-278 TJm
+(of) 16.251 Tj
+-278 TJm
+(Contents) 74.5926 Tj
+[1 0 0 1 72 647.528] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.74] cm
+0 g
+0 G
+[1 0 0 1 -72 -635.788] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 635.788 Td
+/F128_0 9.963 Tf
+(2.1.) 14.9445 Tj
+-310 TJm
+(N) 7.19329 Tj
+35 TJm
+(AME) 22.1378 Tj
+[1 0 0 1 119.013 635.788] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -123.995 -635.788] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+132.691 635.788 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 635.788] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -635.788] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 635.788 Td
+/F128_0 9.963 Tf
+(2) 4.9815 Tj
+[1 0 0 1 516.09 635.788] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -72 -623.832] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 623.832 Td
+/F128_0 9.963 Tf
+(2.2.) 14.9445 Tj
+-310 TJm
+(SYNOPSIS) 47.0552 Tj
+[1 0 0 1 137.086 623.832] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -142.067 -623.832] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+150.582 623.832 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 623.832] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -623.832] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 623.832 Td
+/F128_0 9.963 Tf
+(2) 4.9815 Tj
+[1 0 0 1 516.09 623.832] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.099] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -72 -611.877] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 611.877 Td
+/F128_0 9.963 Tf
+(2.3.) 14.9445 Tj
+-310 TJm
+(DESCRIPTION) 64.7595 Tj
+[1 0 0 1 154.789 611.877] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -159.77 -611.877] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+168.29 611.877 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 611.877] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -611.877] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 611.877 Td
+/F128_0 9.963 Tf
+(3) 4.9815 Tj
+[1 0 0 1 516.09 611.877] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.099] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -72 -599.922] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 599.922 Td
+/F128_0 9.963 Tf
+(2.4.) 14.9445 Tj
+-310 TJm
+(OPTIONS) 42.0638 Tj
+[1 0 0 1 132.094 599.922] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -137.076 -599.922] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+145.873 599.922 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 599.922] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -599.922] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 599.922 Td
+/F128_0 9.963 Tf
+(4) 4.9815 Tj
+[1 0 0 1 516.09 599.922] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.855] cm
+0 g
+0 G
+[1 0 0 1 -72 -587.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 587.967 Td
+/F128_0 9.963 Tf
+(2.5.) 14.9445 Tj
+-310 TJm
+(MEMOR) 37.6402 Tj
+65 TJm
+(Y) 7.19329 Tj
+-250 TJm
+(MAN) 23.2437 Tj
+35 TJm
+(A) 7.19329 Tj
+40 TJm
+(GEMENT) 41.5059 Tj
+[1 0 0 1 207.9 587.967] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -212.881 -587.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+221.412 587.967 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 587.967] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -587.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 587.967 Td
+/F128_0 9.963 Tf
+(5) 4.9815 Tj
+[1 0 0 1 516.09 587.967] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.855] cm
+0 g
+0 G
+[1 0 0 1 -72 -576.012] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 576.012 Td
+/F128_0 9.963 Tf
+(2.6.) 14.9445 Tj
+-310 TJm
+(RECO) 26.5713 Tj
+50 TJm
+(VERING) 37.6303 Tj
+-250 TJm
+(D) 7.19329 Tj
+40 TJm
+(A) 7.19329 Tj
+111 TJm
+(T) 6.08739 Tj
+93 TJm
+(A) 7.19329 Tj
+-250 TJm
+(FR) 12.1847 Tj
+40 TJm
+(OM) 16.0504 Tj
+-249 TJm
+(D) 7.19329 Tj
+40 TJm
+(AMA) 23.2437 Tj
+40 TJm
+(GED) 20.474 Tj
+-250 TJm
+(FILES) 26.5713 Tj
+[1 0 0 1 293.449 576.012] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -298.43 -576.012] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+308.464 576.012 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 576.012] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -576.012] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 576.012 Td
+/F128_0 9.963 Tf
+(6) 4.9815 Tj
+[1 0 0 1 516.09 576.012] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.855] cm
+0 g
+0 G
+[1 0 0 1 -72 -564.057] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 564.057 Td
+/F128_0 9.963 Tf
+(2.7.) 14.9445 Tj
+-310 TJm
+(PERFORMANCE) 73.6266 Tj
+-250 TJm
+(NO) 14.3866 Tj
+40 TJm
+(TES) 17.7142 Tj
+[1 0 0 1 197.847 564.057] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -202.829 -564.057] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+211.958 564.057 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 564.057] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -564.057] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 564.057 Td
+/F128_0 9.963 Tf
+(6) 4.9815 Tj
+[1 0 0 1 516.09 564.057] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -72 -552.101] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 552.101 Td
+/F128_0 9.963 Tf
+(2.8.) 14.9445 Tj
+-310 TJm
+(CA) 13.8386 Tj
+135 TJm
+(VEA) 20.474 Tj
+111 TJm
+(TS) 11.6268 Tj
+[1 0 0 1 133.519 552.101] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -138.5 -552.101] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+148.799 552.101 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 552.101] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -552.101] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 552.101 Td
+/F128_0 9.963 Tf
+(7) 4.9815 Tj
+[1 0 0 1 516.09 552.101] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.099] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.856] cm
+0 g
+0 G
+[1 0 0 1 -72 -540.146] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 540.146 Td
+/F128_0 9.963 Tf
+(2.9.) 14.9445 Tj
+-310 TJm
+(A) 7.19329 Tj
+55 TJm
+(UTHOR) 34.3126 Tj
+[1 0 0 1 130.989 540.146] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -135.97 -540.146] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+145.32 540.146 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 540.146] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -540.146] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 540.146 Td
+/F128_0 9.963 Tf
+(7) 4.9815 Tj
+[1 0 0 1 516.09 540.146] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.219] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -520.002] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 508.266 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-250 TJm
+(chapter) 29.3211 Tj
+-250 TJm
+(contains) 33.2067 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(cop) 14.3866 Tj
+10 TJm
+(y) 4.9815 Tj
+-249 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+[1 0 0 1 213.837 508.266] cm
+0 g
+0 G
+[1 0 0 1 -213.837 -508.266] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+213.837 508.266 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 243.725 508.266] cm
+0 g
+0 G
+[1 0 0 1 -243.725 -508.266] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+246.215 508.266 Td
+/F128_0 9.963 Tf
+(man) 17.1563 Tj
+-250 TJm
+(page,) 21.3009 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(nothing) 30.4469 Tj
+-250 TJm
+(else.) 17.9832 Tj
+[1 0 0 1 72 506.109] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -496.146] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 473.513 Td
+/F121_0 20.659 Tf
+(2.1.) 34.4592 Tj
+-278 TJm
+(NAME) 60.8201 Tj
+[1 0 0 1 72 473.513] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -31.881] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -441.632] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 441.632 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 441.632] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -441.632] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 441.632 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 116.832 441.632] cm
+0 g
+0 G
+[1 0 0 1 -116.832 -441.632] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+116.832 441.632 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 121.813 441.632] cm
+0 g
+0 G
+[1 0 0 1 -121.813 -441.632] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+121.813 441.632 Td
+/F130_0 9.963 Tf
+(bunzip2) 41.8446 Tj
+[1 0 0 1 163.656 441.632] cm
+0 g
+0 G
+[1 0 0 1 -163.656 -441.632] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+166.147 441.632 Td
+/F128_0 9.963 Tf
+(-) 3.31768 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(block-sorting) 53.1327 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+-250 TJm
+(compre) 29.879 Tj
+1 TJm
+(ssor) 16.0504 Tj
+40 TJm
+(,) 2.49075 Tj
+-250 TJm
+(v1.0.3) 24.9075 Tj
+[1 0 0 1 325.129 441.632] cm
+0 g
+0 G
+[1 0 0 1 -253.129 -21.917] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -419.715] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 419.715 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 419.715] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -419.715] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 419.715 Td
+/F130_0 9.963 Tf
+(bzcat) 29.889 Tj
+[1 0 0 1 116.832 419.715] cm
+0 g
+0 G
+[1 0 0 1 -116.832 -419.715] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.323 419.715 Td
+/F128_0 9.963 Tf
+(-) 3.31768 Tj
+-250 TJm
+(decompresses) 55.3345 Tj
+-250 TJm
+(\002les) 16.6083 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(st) 6.64532 Tj
+1 TJm
+(dout) 17.7142 Tj
+[1 0 0 1 236.651 419.715] cm
+0 g
+0 G
+[1 0 0 1 -164.651 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -397.797] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 397.797 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 397.797] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -397.797] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 397.797 Td
+/F130_0 9.963 Tf
+(bzip2recover) 71.7336 Tj
+[1 0 0 1 158.675 397.797] cm
+0 g
+0 G
+[1 0 0 1 -158.675 -397.797] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+161.166 397.797 Td
+/F128_0 9.963 Tf
+(-) 3.31768 Tj
+-250 TJm
+(reco) 17.1463 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(ers) 11.6169 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(from) 19.3681 Tj
+-250 TJm
+(damage) 30.9849 Tj
+1 TJm
+(d) 4.9815 Tj
+-250 TJm
+(bzip2) 22.1378 Tj
+-250 TJm
+(\002les) 16.6083 Tj
+[1 0 0 1 323.545 397.797] cm
+0 g
+0 G
+[1 0 0 1 -251.545 -12.12] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -375.715] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 353.081 Td
+/F121_0 20.659 Tf
+(2.2.) 34.4592 Tj
+-278 TJm
+(SYNOPSIS) 105.629 Tj
+[1 0 0 1 72 352.823] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -31.622] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -321.201] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 321.201 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 321.201] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -321.201] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 321.201 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 116.832 321.201] cm
+0 g
+0 G
+[1 0 0 1 -116.832 -321.201] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.323 321.201 Td
+/F128_0 9.963 Tf
+([) 3.31768 Tj
+-250 TJm
+(-cdfkqstvzVL123456789) 100.168 Tj
+-250 TJm
+(]) 3.31768 Tj
+-250 TJm
+([) 3.31768 Tj
+-249 TJm
+(\002lenames) 38.1882 Tj
+-250 TJm
+(...) 7.47225 Tj
+-620 TJm
+(]) 3.31768 Tj
+[1 0 0 1 297.045 321.201] cm
+0 g
+0 G
+[1 0 0 1 -225.045 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -299.283] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 299.283 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 299.283] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -299.283] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 299.283 Td
+/F130_0 9.963 Tf
+(bunzip2) 41.8446 Tj
+[1 0 0 1 128.787 299.283] cm
+0 g
+0 G
+[1 0 0 1 -128.787 -299.283] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+131.278 299.283 Td
+/F128_0 9.963 Tf
+([) 3.31768 Tj
+-250 TJm
+(-fkvsVL) 33.7546 Tj
+-250 TJm
+(]) 3.31768 Tj
+-250 TJm
+([) 3.31768 Tj
+-250 TJm
+(\002lenames) 38.1882 Tj
+-250 TJm
+(...) 7.47225 Tj
+-620 TJm
+(]) 3.31768 Tj
+[1 0 0 1 242.589 299.283] cm
+0 g
+0 G
+[1 0 0 1 -170.589 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -277.365] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 277.365 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 277.365] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -277.365] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 277.365 Td
+/F130_0 9.963 Tf
+(bzcat) 29.889 Tj
+[1 0 0 1 116.832 277.365] cm
+0 g
+0 G
+[1 0 0 1 -116.832 -277.365] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.323 277.365 Td
+/F128_0 9.963 Tf
+([) 3.31768 Tj
+-250 TJm
+(-s) 7.19329 Tj
+-250 TJm
+(]) 3.31768 Tj
+-250 TJm
+([) 3.31768 Tj
+-250 TJm
+(\002lenames) 38.1882 Tj
+-250 TJm
+(...) 7.47225 Tj
+-620 TJm
+(]) 3.31768 Tj
+[1 0 0 1 204.074 277.365] cm
+0 g
+0 G
+[1 0 0 1 -132.074 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -255.447] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 255.447 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 255.447] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -255.447] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 255.447 Td
+/F130_0 9.963 Tf
+(bzip2recover) 71.7336 Tj
+[1 0 0 1 158.675 255.447] cm
+0 g
+0 G
+[1 0 0 1 -158.675 -255.447] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+161.166 255.447 Td
+/F128_0 9.963 Tf
+(\002lename) 34.3126 Tj
+[1 0 0 1 195.477 255.447] cm
+0 g
+0 G
+[1 0 0 1 -123.477 -204.595] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.754] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 43.063 -6.754] cm
+0 g
+0 G
+[1 0 0 1 -496.332 -50.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+539.395 50.852 Td
+/F128_0 9.963 Tf
+(2) 4.9815 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 6 6
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 105.519 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -371.59 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+477.109 749.245 Td
+/F128_0 9.963 Tf
+(Ho) 12.1748 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(bzip2) 22.1378 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 704.93 Td
+/F121_0 20.659 Tf
+(2.3.) 34.4592 Tj
+-278 TJm
+(DESCRIPTION) 141.184 Tj
+[1 0 0 1 72 704.672] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -694.709] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 683.012 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 683.012] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -683.012] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+104.56 683.012 Td
+/F128_0 9.963 Tf
+(compresses) 45.9294 Tj
+-268 TJm
+(\002les) 16.6083 Tj
+-268 TJm
+(using) 21.5898 Tj
+-268 TJm
+(the) 12.1748 Tj
+-268 TJm
+(Burro) 23.2437 Tj
+25 TJm
+(ws-Wheeler) 48.1313 Tj
+-268 TJm
+(block) 22.1378 Tj
+-268 TJm
+(sorting) 27.6772 Tj
+-268 TJm
+(te) 7.19329 Tj
+15 TJm
+(xt) 7.75121 Tj
+-268 TJm
+(compression) 50.363 Tj
+-268 TJm
+(algorithm,) 41.2369 Tj
+-273 TJm
+(and) 14.3866 Tj
+-268 TJm
+(Huf) 15.4925 Tj
+25 TJm
+(fman) 20.474 Tj
+-268 TJm
+(coding.) 29.61 Tj
+72 671.057 Td
+(Compression) 52.5847 Tj
+-203 TJm
+(is) 6.64532 Tj
+-203 TJm
+(generally) 37.0723 Tj
+-204 TJm
+(c) 4.42357 Tj
+1 TJm
+(onsiderably) 46.4874 Tj
+-204 TJm
+(better) 22.6858 Tj
+-203 TJm
+(than) 17.1563 Tj
+-203 TJm
+(that) 14.9445 Tj
+-203 TJm
+(achie) 21.0219 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ed) 9.40507 Tj
+-203 TJm
+(by) 9.963 Tj
+-204 TJm
+(more) 20.474 Tj
+-203 TJm
+(con) 14.3866 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(entional) 32.1008 Tj
+-203 TJm
+(LZ77/LZ78-based) 73.0487 Tj
+-203 TJm
+(compressors,) 52.2958 Tj
+72 659.101 Td
+(and) 14.3866 Tj
+-250 TJm
+(approaches) 44.8136 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(performan) 41.4959 Tj
+1 TJm
+(ce) 8.84714 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(PPM) 19.936 Tj
+-250 TJm
+(f) 3.31768 Tj
+10 TJm
+(amily) 22.6957 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(statistical) 37.6402 Tj
+-250 TJm
+(compressors.) 52.2958 Tj
+[1 0 0 1 72 656.945] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -646.982] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 637.184 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-250 TJm
+(command-line) 57.5563 Tj
+-250 TJm
+(options) 29.341 Tj
+-250 TJm
+(ar) 7.74125 Tj
+1 TJm
+(e) 4.42357 Tj
+-250 TJm
+(deliberately) 47.0353 Tj
+-250 TJm
+(v) 4.9815 Tj
+15 TJm
+(ery) 12.7228 Tj
+-250 TJm
+(similar) 27.6772 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(those) 21.0319 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(GNU) 21.5799 Tj
+[1 0 0 1 364.869 637.184] cm
+0 g
+0 G
+[1 0 0 1 -364.869 -637.184] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+364.869 637.184 Td
+/F130_0 9.963 Tf
+(gzip) 23.9112 Tj
+[1 0 0 1 388.779 637.184] cm
+0 g
+0 G
+[1 0 0 1 -388.779 -637.184] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+388.779 637.184 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-250 TJm
+(are) 12.1648 Tj
+-250 TJm
+(not) 12.7327 Tj
+-250 TJm
+(identical.) 36.8033 Tj
+[1 0 0 1 72 635.027] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -625.064] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 615.266 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 615.266] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -615.266] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+105.175 615.266 Td
+/F128_0 9.963 Tf
+(e) 4.42357 Tj
+15 TJm
+(xpects) 25.4555 Tj
+-330 TJm
+(a) 4.42357 Tj
+-330 TJm
+(list) 12.1847 Tj
+-329 TJm
+(of) 8.29918 Tj
+-330 TJm
+(\002le) 12.7327 Tj
+-330 TJm
+(names) 25.4555 Tj
+-330 TJm
+(to) 7.75121 Tj
+-330 TJm
+(accompan) 40.39 Tj
+15 TJm
+(y) 4.9815 Tj
+-329 TJm
+(the) 12.1748 Tj
+-330 TJm
+(command-line) 57.5563 Tj
+-330 TJm
+(\003ags.) 21.3109 Tj
+-1099 TJm
+(Each) 19.916 Tj
+-330 TJm
+(\002le) 12.7327 Tj
+-330 TJm
+(is) 6.64532 Tj
+-330 TJm
+(replaced) 33.7447 Tj
+-330 TJm
+(by) 9.963 Tj
+-329 TJm
+(a) 4.42357 Tj
+-330 TJm
+(compressed) 47.0353 Tj
+72 603.311 Td
+(v) 4.9815 Tj
+15 TJm
+(ersion) 24.3496 Tj
+-348 TJm
+(of) 8.29918 Tj
+-349 TJm
+(itself,) 22.4168 Tj
+-373 TJm
+(with) 17.7142 Tj
+-349 TJm
+(the) 12.1748 Tj
+-348 TJm
+(name) 21.5799 Tj
+[1 0 0 1 204.444 603.311] cm
+0 g
+0 G
+[1 0 0 1 -204.444 -603.311] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+204.444 603.311 Td
+/F130_0 9.963 Tf
+(original_name.bz2) 101.623 Tj
+[1 0 0 1 306.063 603.311] cm
+0 g
+0 G
+[1 0 0 1 -306.063 -603.311] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+306.063 603.311 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1211 TJm
+(Each) 19.916 Tj
+-349 TJm
+(compressed) 47.0353 Tj
+-348 TJm
+(\002le) 12.7327 Tj
+-349 TJm
+(has) 13.2807 Tj
+-348 TJm
+(the) 12.1748 Tj
+-349 TJm
+(same) 20.474 Tj
+-348 TJm
+(modi\002cation) 50.3729 Tj
+-349 TJm
+(date,) 19.0891 Tj
+72 591.356 Td
+(permissions,) 50.094 Tj
+-344 TJm
+(and,) 16.8773 Tj
+-344 TJm
+(when) 21.5799 Tj
+-325 TJm
+(possible,) 35.1495 Tj
+-344 TJm
+(o) 4.9815 Tj
+25 TJm
+(w) 7.19329 Tj
+1 TJm
+(nership) 29.3311 Tj
+-326 TJm
+(as) 8.29918 Tj
+-325 TJm
+(the) 12.1748 Tj
+-325 TJm
+(corresponding) 56.9983 Tj
+-325 TJm
+(original,) 33.4856 Tj
+-344 TJm
+(so) 8.85711 Tj
+-325 TJm
+(that) 14.9445 Tj
+-325 TJm
+(these) 20.474 Tj
+-325 TJm
+(properties) 39.842 Tj
+-325 TJm
+(can) 13.8286 Tj
+-325 TJm
+(be) 9.40507 Tj
+-325 TJm
+(correctly) 35.4085 Tj
+72 579.4 Td
+(restored) 32.0908 Tj
+-308 TJm
+(at) 7.19329 Tj
+-307 TJm
+(decompression) 59.768 Tj
+-308 TJm
+(time.) 20.205 Tj
+-483 TJm
+(File) 15.5024 Tj
+-308 TJm
+(name) 21.5799 Tj
+-308 TJm
+(handling) 34.8705 Tj
+-308 TJm
+(is) 6.64532 Tj
+-307 TJm
+(nai) 12.1748 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-308 TJm
+(in) 7.75121 Tj
+-308 TJm
+(the) 12.1748 Tj
+-308 TJm
+(sense) 21.5799 Tj
+-308 TJm
+(that) 14.9445 Tj
+-307 TJm
+(there) 19.916 Tj
+-308 TJm
+(is) 6.64532 Tj
+-308 TJm
+(no) 9.963 Tj
+-308 TJm
+(mechanism) 45.3815 Tj
+-307 TJm
+(for) 11.6169 Tj
+-308 TJm
+(preserving) 42.0538 Tj
+72 567.445 Td
+(original) 30.9949 Tj
+-334 TJm
+(\002le) 12.7327 Tj
+-333 TJm
+(names,) 27.9462 Tj
+-355 TJm
+(permissi) 33.7646 Tj
+1 TJm
+(ons,) 16.3294 Tj
+-355 TJm
+(o) 4.9815 Tj
+25 TJm
+(wnerships) 40.4 Tj
+-334 TJm
+(or) 8.29918 Tj
+-333 TJm
+(dates) 20.474 Tj
+-334 TJm
+(in) 7.75121 Tj
+-333 TJm
+(\002lesystems) 44.2855 Tj
+-334 TJm
+(which) 24.3496 Tj
+-333 TJm
+(lack) 16.5984 Tj
+-334 TJm
+(these) 20.474 Tj
+-334 TJm
+(concepts,) 37.3513 Tj
+-354 TJm
+(or) 8.29918 Tj
+-334 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-333 TJm
+(serious) 28.2252 Tj
+-334 TJm
+(\002le) 12.7327 Tj
+72 555.49 Td
+(name) 21.5799 Tj
+-250 TJm
+(length) 24.9075 Tj
+-250 TJm
+(restrictions,) 46.7663 Tj
+-250 TJm
+(su) 8.85711 Tj
+1 TJm
+(ch) 9.40507 Tj
+-250 TJm
+(as) 8.29918 Tj
+-250 TJm
+(MS-DOS.) 40.131 Tj
+[1 0 0 1 72 553.333] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -543.371] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 533.572 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 533.572] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -533.572] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+104.379 533.572 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 121.255 533.572] cm
+0 g
+0 G
+[1 0 0 1 -121.255 -533.572] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+121.255 533.572 Td
+/F130_0 9.963 Tf
+(bunzip2) 41.8446 Tj
+[1 0 0 1 163.098 533.572] cm
+0 g
+0 G
+[1 0 0 1 -163.098 -533.572] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+165.589 533.572 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-250 TJm
+(by) 9.963 Tj
+-250 TJm
+(def) 12.7228 Tj
+10 TJm
+(ault) 14.9445 Tj
+-250 TJm
+(not) 12.7327 Tj
+-250 TJm
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(erwrite) 28.2152 Tj
+-250 TJm
+(e) 4.42357 Tj
+16 TJm
+(xisting) 27.1292 Tj
+-250 TJm
+(\002les.) 19.0991 Tj
+-620 TJm
+(If) 6.63536 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-250 TJm
+(this) 14.3965 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(happen,) 31.2639 Tj
+-250 TJm
+(specify) 28.7731 Tj
+-250 TJm
+(the) 12.1748 Tj
+[1 0 0 1 495.977 533.572] cm
+0 g
+0 G
+[1 0 0 1 -495.977 -533.572] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+495.977 533.572 Td
+/F130_0 9.963 Tf
+(-f) 11.9556 Tj
+[1 0 0 1 507.932 533.572] cm
+0 g
+0 G
+[1 0 0 1 -507.932 -533.572] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+510.423 533.572 Td
+/F128_0 9.963 Tf
+(\003ag.) 17.4353 Tj
+[1 0 0 1 72 531.415] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -521.453] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 511.654 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-284 TJm
+(no) 9.963 Tj
+-285 TJm
+(\002) 5.53943 Tj
+1 TJm
+(le) 7.19329 Tj
+-285 TJm
+(names) 25.4555 Tj
+-284 TJm
+(are) 12.1648 Tj
+-284 TJm
+(speci\002ed,) 37.9092 Tj
+[1 0 0 1 193.935 511.654] cm
+0 g
+0 G
+[1 0 0 1 -193.935 -511.654] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+193.935 511.654 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 223.823 511.654] cm
+0 g
+0 G
+[1 0 0 1 -223.823 -511.654] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+226.655 511.654 Td
+/F128_0 9.963 Tf
+(compresses) 45.9294 Tj
+-284 TJm
+(from) 19.3681 Tj
+-284 TJm
+(standard) 33.7546 Tj
+-284 TJm
+(input) 20.4839 Tj
+-285 TJm
+(to) 7.75121 Tj
+-284 TJm
+(standard) 33.7546 Tj
+-284 TJm
+(output.) 27.9562 Tj
+-826 TJm
+(In) 8.29918 Tj
+-284 TJm
+(this) 14.3965 Tj
+-284 TJm
+(case,) 19.6371 Tj
+[1 0 0 1 491.778 511.654] cm
+0 g
+0 G
+[1 0 0 1 -491.778 -511.654] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+491.778 511.654 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 521.666 511.654] cm
+0 g
+0 G
+[1 0 0 1 -521.666 -511.654] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+524.498 511.654 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+72 499.699 Td
+(decline) 28.7731 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(write) 20.474 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-249 TJm
+(output) 25.4654 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(terminal,) 35.6974 Tj
+-250 TJm
+(as) 8.29918 Tj
+-250 TJm
+(this) 14.3965 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ould) 17.7142 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(entirely) 30.437 Tj
+-250 TJm
+(incompre) 37.6303 Tj
+1 TJm
+(hensible) 33.2067 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(therefore) 35.9565 Tj
+-250 TJm
+(pointless.) 37.9192 Tj
+[1 0 0 1 72 497.542] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -487.58] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 477.781 Td
+/F130_0 9.963 Tf
+(bunzip2) 41.8446 Tj
+[1 0 0 1 113.843 477.781] cm
+0 g
+0 G
+[1 0 0 1 -113.843 -477.781] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+116.176 477.781 Td
+/F128_0 9.963 Tf
+(\(or) 11.6169 Tj
+[1 0 0 1 130.125 477.781] cm
+0 g
+0 G
+[1 0 0 1 -130.125 -477.781] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+130.125 477.781 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+-600 TJm
+(-d) 11.9556 Tj
+[1 0 0 1 177.946 477.781] cm
+0 g
+0 G
+[1 0 0 1 -177.946 -477.781] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+177.946 477.781 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-234 TJm
+(decompresses) 55.3345 Tj
+-234 TJm
+(all) 9.963 Tj
+-234 TJm
+(speci\002ed) 35.4185 Tj
+-234 TJm
+(\002les.) 19.0991 Tj
+-609 TJm
+(Files) 19.378 Tj
+-234 TJm
+(which) 24.3496 Tj
+-235 TJm
+(we) 11.6169 Tj
+1 TJm
+(re) 7.74125 Tj
+-235 TJm
+(not) 12.7327 Tj
+-234 TJm
+(created) 28.7632 Tj
+-234 TJm
+(by) 9.963 Tj
+[1 0 0 1 445.012 477.781] cm
+0 g
+0 G
+[1 0 0 1 -445.012 -477.781] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+445.012 477.781 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 474.9 477.781] cm
+0 g
+0 G
+[1 0 0 1 -474.9 -477.781] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+477.233 477.781 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-234 TJm
+(be) 9.40507 Tj
+-234 TJm
+(detected) 33.1967 Tj
+72 465.826 Td
+(and) 14.3866 Tj
+-279 TJm
+(ignored,) 32.9277 Tj
+-287 TJm
+(and) 14.3866 Tj
+-280 TJm
+(a) 4.42357 Tj
+-279 TJm
+(w) 7.19329 Tj
+10 TJm
+(arning) 25.4555 Tj
+-279 TJm
+(issued.) 27.3983 Tj
+[1 0 0 1 216.033 465.826] cm
+0 g
+0 G
+[1 0 0 1 -216.033 -465.826] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+216.033 465.826 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 245.921 465.826] cm
+0 g
+0 G
+[1 0 0 1 -245.921 -465.826] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+248.705 465.826 Td
+/F128_0 9.963 Tf
+(attempts) 33.7646 Tj
+-279 TJm
+(to) 7.75121 Tj
+-280 TJm
+(guess) 22.1378 Tj
+-279 TJm
+(the) 12.1748 Tj
+-280 TJm
+(\002lenam) 29.889 Tj
+1 TJm
+(e) 4.42357 Tj
+-280 TJm
+(for) 11.6169 Tj
+-279 TJm
+(the) 12.1748 Tj
+-280 TJm
+(decompressed) 56.4404 Tj
+-279 TJm
+(\002le) 12.7327 Tj
+-280 TJm
+(fr) 6.63536 Tj
+1 TJm
+(om) 12.7327 Tj
+-280 TJm
+(that) 14.9445 Tj
+-279 TJm
+(of) 8.29918 Tj
+-280 TJm
+(the) 12.1748 Tj
+72 453.871 Td
+(compressed) 47.0353 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+-250 TJm
+(as) 8.29918 Tj
+-250 TJm
+(follo) 18.8201 Tj
+25 TJm
+(ws:) 13.8386 Tj
+[1 0 0 1 72 451.714] cm
+0 g
+0 G
+[1 0 0 1 0 -29.723] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -421.991] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 421.991 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 421.991] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -421.991] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 421.991 Td
+/F130_0 9.963 Tf
+(filename.bz2) 71.7336 Tj
+[1 0 0 1 164.653 421.991] cm
+0 g
+0 G
+[1 0 0 1 -164.653 -421.991] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+167.143 421.991 Td
+/F128_0 9.963 Tf
+(becomes) 34.8605 Tj
+[1 0 0 1 204.493 421.991] cm
+0 g
+0 G
+[1 0 0 1 -204.493 -421.991] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+204.493 421.991 Td
+/F130_0 9.963 Tf
+(filename) 47.8224 Tj
+[1 0 0 1 252.313 421.991] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -180.313 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -400.073] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 400.073 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 400.073] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -400.073] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 400.073 Td
+/F130_0 9.963 Tf
+(filename.bz) 65.7558 Tj
+[1 0 0 1 158.675 400.073] cm
+0 g
+0 G
+[1 0 0 1 -158.675 -400.073] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+161.166 400.073 Td
+/F128_0 9.963 Tf
+(becomes) 34.8605 Tj
+[1 0 0 1 198.515 400.073] cm
+0 g
+0 G
+[1 0 0 1 -198.515 -400.073] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+198.515 400.073 Td
+/F130_0 9.963 Tf
+(filename) 47.8224 Tj
+[1 0 0 1 246.336 400.073] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -174.336 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -378.155] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 378.155 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 378.155] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -378.155] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 378.155 Td
+/F130_0 9.963 Tf
+(filename.tbz2) 77.7114 Tj
+[1 0 0 1 164.653 378.155] cm
+0 g
+0 G
+[1 0 0 1 -164.653 -378.155] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+167.143 378.155 Td
+/F128_0 9.963 Tf
+(becomes) 34.8605 Tj
+[1 0 0 1 204.493 378.155] cm
+0 g
+0 G
+[1 0 0 1 -204.493 -378.155] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+204.493 378.155 Td
+/F130_0 9.963 Tf
+(filename.tar) 71.7336 Tj
+[1 0 0 1 276.224 378.155] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -204.224 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -356.237] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 356.237 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 356.237] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -356.237] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 356.237 Td
+/F130_0 9.963 Tf
+(filename.tbz) 71.7336 Tj
+[1 0 0 1 164.653 356.237] cm
+0 g
+0 G
+[1 0 0 1 -164.653 -356.237] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+167.143 356.237 Td
+/F128_0 9.963 Tf
+(becomes) 34.8605 Tj
+[1 0 0 1 204.493 356.237] cm
+0 g
+0 G
+[1 0 0 1 -204.493 -356.237] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+204.493 356.237 Td
+/F130_0 9.963 Tf
+(filename.tar) 71.7336 Tj
+[1 0 0 1 276.224 356.237] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -204.224 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -334.319] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 334.319 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 334.319] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 1.992 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -334.319] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 334.319 Td
+/F130_0 9.963 Tf
+(anyothername) 71.7336 Tj
+[1 0 0 1 164.653 334.319] cm
+0 g
+0 G
+[1 0 0 1 -164.653 -334.319] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+167.143 334.319 Td
+/F128_0 9.963 Tf
+(becomes) 34.8605 Tj
+[1 0 0 1 204.493 334.319] cm
+0 g
+0 G
+[1 0 0 1 -204.493 -334.319] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+204.493 334.319 Td
+/F130_0 9.963 Tf
+(anyothername.out) 95.6448 Tj
+[1 0 0 1 300.134 334.319] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -228.134 -11.526] cm
+0 g
+0 G
+[1 0 0 1 -72 -322.793] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 312.402 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-342 TJm
+(the) 12.1748 Tj
+-342 TJm
+(\002le) 12.7327 Tj
+-342 TJm
+(does) 18.2622 Tj
+-342 TJm
+(not) 12.7327 Tj
+-342 TJm
+(end) 14.3866 Tj
+-342 TJm
+(in) 7.75121 Tj
+-342 TJm
+(one) 14.3866 Tj
+-343 TJm
+(of) 8.29918 Tj
+-342 TJm
+(the) 12.1748 Tj
+-342 TJm
+(recognised) 43.1597 Tj
+-342 TJm
+(endings,) 33.4856 Tj
+[1 0 0 1 309.305 312.402] cm
+0 g
+0 G
+[1 0 0 1 -309.305 -312.402] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+309.305 312.402 Td
+/F130_0 9.963 Tf
+(.bz2) 23.9112 Tj
+[1 0 0 1 333.215 312.402] cm
+0 g
+0 G
+[1 0 0 1 -333.215 -312.402] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+333.215 312.402 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 339.344 312.402] cm
+0 g
+0 G
+[1 0 0 1 -339.344 -312.402] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+339.344 312.402 Td
+/F130_0 9.963 Tf
+(.bz) 17.9334 Tj
+[1 0 0 1 357.276 312.402] cm
+0 g
+0 G
+[1 0 0 1 -357.276 -312.402] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+357.276 312.402 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 363.405 312.402] cm
+0 g
+0 G
+[1 0 0 1 -363.405 -312.402] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+363.405 312.402 Td
+/F130_0 9.963 Tf
+(.tbz2) 29.889 Tj
+[1 0 0 1 393.293 312.402] cm
+0 g
+0 G
+[1 0 0 1 -393.293 -312.402] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+396.702 312.402 Td
+/F128_0 9.963 Tf
+(or) 8.29918 Tj
+[1 0 0 1 408.409 312.402] cm
+0 g
+0 G
+[1 0 0 1 -408.409 -312.402] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+408.409 312.402 Td
+/F130_0 9.963 Tf
+(.tbz) 23.9112 Tj
+[1 0 0 1 432.319 312.402] cm
+0 g
+0 G
+[1 0 0 1 -432.319 -312.402] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+432.319 312.402 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 438.448 312.402] cm
+0 g
+0 G
+[1 0 0 1 -438.448 -312.402] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+438.448 312.402 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 468.336 312.402] cm
+0 g
+0 G
+[1 0 0 1 -468.336 -312.402] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+471.744 312.402 Td
+/F128_0 9.963 Tf
+(complains) 40.9579 Tj
+-342 TJm
+(that) 14.9445 Tj
+-342 TJm
+(it) 5.53943 Tj
+72 300.446 Td
+(cannot) 26.5614 Tj
+-250 TJm
+(guess) 22.1378 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(name) 21.5799 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-249 TJm
+(original) 30.9949 Tj
+-250 TJm
+(\002le,) 15.2235 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(uses) 17.1563 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(original) 30.9949 Tj
+-250 TJm
+(name) 21.5799 Tj
+-250 TJm
+(with) 17.7142 Tj
+[1 0 0 1 370.009 300.446] cm
+0 g
+0 G
+[1 0 0 1 -370.009 -300.446] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+370.009 300.446 Td
+/F130_0 9.963 Tf
+(.out) 23.9112 Tj
+[1 0 0 1 393.92 300.446] cm
+0 g
+0 G
+[1 0 0 1 -393.92 -300.446] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+396.41 300.446 Td
+/F128_0 9.963 Tf
+(appended.) 40.669 Tj
+[1 0 0 1 72 298.29] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -288.327] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 278.529 Td
+/F128_0 9.963 Tf
+(As) 11.0689 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(compression,) 52.8537 Tj
+-250 TJm
+(supply) 26.5713 Tj
+1 TJm
+(ing) 12.7327 Tj
+-250 TJm
+(no) 9.963 Tj
+-250 TJm
+(\002lenames) 38.1882 Tj
+-250 TJm
+(causes) 26.0034 Tj
+-250 TJm
+(decompression) 59.768 Tj
+-250 TJm
+(from) 19.3681 Tj
+-250 TJm
+(standard) 33.7546 Tj
+-250 TJm
+(inp) 12.7327 Tj
+1 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(standard) 33.7546 Tj
+-250 TJm
+(output.) 27.9562 Tj
+[1 0 0 1 72 276.372] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -266.409] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 256.611 Td
+/F130_0 9.963 Tf
+(bunzip2) 41.8446 Tj
+[1 0 0 1 113.843 256.611] cm
+0 g
+0 G
+[1 0 0 1 -113.843 -256.611] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+116.409 256.611 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-257 TJm
+(correctly) 35.4085 Tj
+-258 TJm
+(decompress) 47.0353 Tj
+-257 TJm
+(a) 4.42357 Tj
+-258 TJm
+(\002l) 8.30914 Tj
+1 TJm
+(e) 4.42357 Tj
+-258 TJm
+(which) 24.3496 Tj
+-257 TJm
+(is) 6.64532 Tj
+-258 TJm
+(the) 12.1748 Tj
+-257 TJm
+(concatenation) 55.3345 Tj
+-258 TJm
+(of) 8.29918 Tj
+-257 TJm
+(tw) 9.963 Tj
+10 TJm
+(o) 4.9815 Tj
+-257 TJm
+(or) 8.29918 Tj
+-258 TJm
+(more) 20.474 Tj
+-257 TJm
+(compressed) 47.0353 Tj
+-258 TJm
+(\002les.) 19.0991 Tj
+-665 TJm
+(The) 15.4925 Tj
+-257 TJm
+(result) 22.1378 Tj
+-258 TJm
+(is) 6.64532 Tj
+72 244.656 Td
+(the) 12.1748 Tj
+-239 TJm
+(concatena) 39.8321 Tj
+1 TJm
+(tion) 15.5024 Tj
+-239 TJm
+(of) 8.29918 Tj
+-239 TJm
+(the) 12.1748 Tj
+-238 TJm
+(corresponding) 56.9983 Tj
+-239 TJm
+(uncompressed) 56.9983 Tj
+-238 TJm
+(\002les.) 19.0991 Tj
+-613 TJm
+(Inte) 15.4925 Tj
+15 TJm
+(grity) 18.8201 Tj
+-238 TJm
+(testing) 26.5713 Tj
+-239 TJm
+(\() 3.31768 Tj
+[1 0 0 1 382.247 244.656] cm
+0 g
+0 G
+[1 0 0 1 -382.247 -244.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+382.247 244.656 Td
+/F130_0 9.963 Tf
+(-t) 11.9556 Tj
+[1 0 0 1 394.202 244.656] cm
+0 g
+0 G
+[1 0 0 1 -394.202 -244.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+394.202 244.656 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-239 TJm
+(of) 8.29918 Tj
+-238 TJm
+(concatenated) 52.0069 Tj
+-239 TJm
+(compressed) 47.0353 Tj
+-238 TJm
+(\002les) 16.6083 Tj
+-239 TJm
+(is) 6.64532 Tj
+72 232.7 Td
+(also) 16.0504 Tj
+-250 TJm
+(supported.) 41.7848 Tj
+[1 0 0 1 72 230.544] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -220.581] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 210.783 Td
+/F128_0 9.963 Tf
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-399 TJm
+(can) 13.8286 Tj
+-399 TJm
+(also) 16.0504 Tj
+-399 TJm
+(compress) 37.6303 Tj
+-399 TJm
+(or) 8.29918 Tj
+-399 TJm
+(decompress) 47.0353 Tj
+-399 TJm
+(\002les) 16.6083 Tj
+-399 TJm
+(to) 7.75121 Tj
+-399 TJm
+(the) 12.1748 Tj
+-399 TJm
+(standard) 33.7546 Tj
+-399 TJm
+(output) 25.4654 Tj
+-399 TJm
+(by) 9.963 Tj
+-399 TJm
+(gi) 7.75121 Tj
+25 TJm
+(ving) 17.7142 Tj
+-399 TJm
+(the) 12.1748 Tj
+[1 0 0 1 409.67 210.783] cm
+0 g
+0 G
+[1 0 0 1 -409.67 -210.783] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+409.67 210.783 Td
+/F130_0 9.963 Tf
+(-c) 11.9556 Tj
+[1 0 0 1 421.625 210.783] cm
+0 g
+0 G
+[1 0 0 1 -421.625 -210.783] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+425.602 210.783 Td
+/F128_0 9.963 Tf
+(\003ag.) 17.4353 Tj
+-757 TJm
+(Multiple) 34.3225 Tj
+-399 TJm
+(\002les) 16.6083 Tj
+-399 TJm
+(may) 17.1563 Tj
+-399 TJm
+(be) 9.40507 Tj
+72 198.828 Td
+(compressed) 47.0353 Tj
+-367 TJm
+(and) 14.3866 Tj
+-367 TJm
+(dec) 13.8286 Tj
+1 TJm
+(ompressed) 42.6118 Tj
+-367 TJm
+(lik) 10.5209 Tj
+10 TJm
+(e) 4.42357 Tj
+-367 TJm
+(this.) 16.8873 Tj
+-1321 TJm
+(The) 15.4925 Tj
+-367 TJm
+(resulting) 34.8705 Tj
+-367 TJm
+(outputs) 29.341 Tj
+-367 TJm
+(are) 12.1648 Tj
+-367 TJm
+(fed) 12.7228 Tj
+-366 TJm
+(sequentially) 48.1512 Tj
+-367 TJm
+(to) 7.75121 Tj
+-367 TJm
+(stdout.) 26.8503 Tj
+-1321 TJm
+(Compression) 52.5847 Tj
+-367 TJm
+(of) 8.29918 Tj
+72 186.872 Td
+(multiple) 33.2166 Tj
+-289 TJm
+(\002les) 16.6083 Tj
+-289 TJm
+(in) 7.75121 Tj
+-288 TJm
+(this) 14.3965 Tj
+-289 TJm
+(manner) 29.879 Tj
+-289 TJm
+(generates) 37.6203 Tj
+-289 TJm
+(a) 4.42357 Tj
+-289 TJm
+(stre) 14.3866 Tj
+1 TJm
+(am) 12.1748 Tj
+-289 TJm
+(containing) 42.0638 Tj
+-289 TJm
+(multiple) 33.2166 Tj
+-289 TJm
+(compressed) 47.0353 Tj
+-288 TJm
+(\002le) 12.7327 Tj
+-289 TJm
+(representations.) 62.8068 Tj
+-853 TJm
+(Such) 19.926 Tj
+-289 TJm
+(a) 4.42357 Tj
+-289 TJm
+(stream) 26.5614 Tj
+72 174.917 Td
+(can) 13.8286 Tj
+-391 TJm
+(be) 9.40507 Tj
+-391 TJm
+(dec) 13.8286 Tj
+1 TJm
+(ompressed) 42.6118 Tj
+-391 TJm
+(correctly) 35.4085 Tj
+-391 TJm
+(only) 17.7142 Tj
+-391 TJm
+(by) 9.963 Tj
+[1 0 0 1 238.116 174.917] cm
+0 g
+0 G
+[1 0 0 1 -238.116 -174.917] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+238.116 174.917 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 268.004 174.917] cm
+0 g
+0 G
+[1 0 0 1 -268.004 -174.917] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+271.897 174.917 Td
+/F128_0 9.963 Tf
+(v) 4.9815 Tj
+15 TJm
+(ersion) 24.3496 Tj
+-391 TJm
+(0.9.0) 19.926 Tj
+-391 TJm
+(o) 4.9815 Tj
+1 TJm
+(r) 3.31768 Tj
+-391 TJm
+(later) 17.7043 Tj
+55 TJm
+(.) 2.49075 Tj
+-733 TJm
+(Earlier) 27.1093 Tj
+-390 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersions) 28.2252 Tj
+-391 TJm
+(of) 8.29918 Tj
+[1 0 0 1 448.071 174.917] cm
+0 g
+0 G
+[1 0 0 1 -448.071 -174.917] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+448.071 174.917 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 477.959 174.917] cm
+0 g
+0 G
+[1 0 0 1 -477.959 -174.917] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+481.852 174.917 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-391 TJm
+(stop) 16.6083 Tj
+-391 TJm
+(a) 4.42357 Tj
+1 TJm
+(fter) 13.8286 Tj
+72 162.962 Td
+(decompressing) 59.768 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(\002rst) 15.5024 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+-249 TJm
+(in) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(stream.) 29.0521 Tj
+[1 0 0 1 72 160.805] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -150.843] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 141.044 Td
+/F130_0 9.963 Tf
+(bzcat) 29.889 Tj
+[1 0 0 1 101.888 141.044] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -141.044] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+104.379 141.044 Td
+/F128_0 9.963 Tf
+(\(or) 11.6169 Tj
+[1 0 0 1 118.486 141.044] cm
+0 g
+0 G
+[1 0 0 1 -118.486 -141.044] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+118.486 141.044 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+-600 TJm
+(-dc) 17.9334 Tj
+[1 0 0 1 172.284 141.044] cm
+0 g
+0 G
+[1 0 0 1 -172.284 -141.044] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+172.284 141.044 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-250 TJm
+(decompresses) 55.3345 Tj
+-250 TJm
+(all) 9.963 Tj
+-250 TJm
+(speci\002e) 30.437 Tj
+1 TJm
+(d) 4.9815 Tj
+-250 TJm
+(\002les) 16.6083 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(standard) 33.7546 Tj
+-250 TJm
+(output.) 27.9562 Tj
+[1 0 0 1 72 138.887] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -128.925] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 119.126 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 119.126] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -119.126] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+104.866 119.126 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-299 TJm
+(read) 17.1463 Tj
+-299 TJm
+(ar) 7.74125 Tj
+18 TJm
+(gument) 29.889 Tj
+1 TJm
+(s) 3.87561 Tj
+-299 TJm
+(from) 19.3681 Tj
+-299 TJm
+(the) 12.1748 Tj
+-299 TJm
+(en) 9.40507 Tj
+40 TJm
+(vironment) 40.9579 Tj
+-299 TJm
+(v) 4.9815 Tj
+25 TJm
+(ariables) 30.9849 Tj
+[1 0 0 1 316.903 119.126] cm
+0 g
+0 G
+[1 0 0 1 -316.903 -119.126] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+316.903 119.126 Td
+/F130_0 9.963 Tf
+(BZIP2) 29.889 Tj
+[1 0 0 1 346.791 119.126] cm
+0 g
+0 G
+[1 0 0 1 -346.791 -119.126] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+349.769 119.126 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 367.133 119.126] cm
+0 g
+0 G
+[1 0 0 1 -367.133 -119.126] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+367.133 119.126 Td
+/F130_0 9.963 Tf
+(BZIP) 23.9112 Tj
+[1 0 0 1 391.043 119.126] cm
+0 g
+0 G
+[1 0 0 1 -391.043 -119.126] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+391.043 119.126 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-299 TJm
+(in) 7.75121 Tj
+-299 TJm
+(that) 14.9445 Tj
+-299 TJm
+(order) 21.0219 Tj
+40 TJm
+(,) 2.49075 Tj
+-311 TJm
+(and) 14.3866 Tj
+-299 TJm
+(wil) 12.7327 Tj
+1 TJm
+(l) 2.76971 Tj
+-299 TJm
+(process) 29.879 Tj
+-299 TJm
+(them) 19.926 Tj
+72 107.171 Td
+(before) 25.4455 Tj
+-250 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-250 TJm
+(ar) 7.74125 Tj
+18 TJm
+(guments) 33.7646 Tj
+-250 TJm
+(read) 17.1463 Tj
+-250 TJm
+(from) 19.3681 Tj
+-249 TJm
+(the) 12.1748 Tj
+-250 TJm
+(command) 39.2941 Tj
+-250 TJm
+(line.) 17.4353 Tj
+-310 TJm
+(This) 17.7142 Tj
+-250 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(es) 8.29918 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(con) 14.3866 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(enient) 24.3496 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ay) 9.40507 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(supply) 26.5713 Tj
+-250 TJm
+(d) 4.9815 Tj
+1 TJm
+(ef) 7.74125 Tj
+10 TJm
+(ault) 14.9445 Tj
+-250 TJm
+(ar) 7.74125 Tj
+18 TJm
+(guments.) 36.2554 Tj
+[1 0 0 1 72 105.014] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -95.052] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 85.253 Td
+/F128_0 9.963 Tf
+(Compression) 52.5847 Tj
+-294 TJm
+(is) 6.64532 Tj
+-294 TJm
+(al) 7.19329 Tj
+10 TJm
+(w) 7.19329 Tj
+10 TJm
+(ays) 13.2807 Tj
+-293 TJm
+(performed,) 43.9866 Tj
+-305 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-294 TJm
+(if) 6.08739 Tj
+-294 TJm
+(the) 12.1748 Tj
+-294 TJm
+(compressed) 47.0353 Tj
+-294 TJm
+(\002le) 12.7327 Tj
+-294 TJm
+(i) 2.76971 Tj
+1 TJm
+(s) 3.87561 Tj
+-294 TJm
+(slightly) 29.899 Tj
+-294 TJm
+(lar) 10.511 Tj
+18 TJm
+(ger) 12.7228 Tj
+-294 TJm
+(than) 17.1563 Tj
+-294 TJm
+(the) 12.1748 Tj
+-294 TJm
+(original.) 33.4856 Tj
+-883 TJm
+(Files) 19.378 Tj
+-294 TJm
+(of) 8.29918 Tj
+-294 TJm
+(less) 14.9445 Tj
+-294 TJm
+(than) 17.1563 Tj
+72 73.298 Td
+(about) 22.1378 Tj
+-246 TJm
+(one) 14.3866 Tj
+-245 TJm
+(hundred) 32.6488 Tj
+-246 TJm
+(bytes) 21.0319 Tj
+-246 TJm
+(tend) 17.1563 Tj
+-245 TJm
+(to) 7.75121 Tj
+-246 TJm
+(get) 12.1748 Tj
+-246 TJm
+(lar) 10.511 Tj
+18 TJm
+(ger) 12.7228 Tj
+40 TJm
+(,) 2.49075 Tj
+-246 TJm
+(since) 20.474 Tj
+-246 TJm
+(the) 12.1748 Tj
+-246 TJm
+(compression) 50.363 Tj
+-245 TJm
+(mechanism) 45.3815 Tj
+-246 TJm
+(has) 13.2807 Tj
+-246 TJm
+(a) 4.42357 Tj
+-246 TJm
+(c) 4.42357 Tj
+1 TJm
+(onstant) 28.7831 Tj
+-246 TJm
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(erhead) 26.5514 Tj
+-246 TJm
+(in) 7.75121 Tj
+-246 TJm
+(th) 7.75121 Tj
+1 TJm
+(e) 4.42357 Tj
+-246 TJm
+(re) 7.74125 Tj
+15 TJm
+(gion) 17.7142 Tj
+-246 TJm
+(of) 8.29918 Tj
+[1 0 0 1 72 50.852] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 43.063 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -496.332 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+539.395 50.951 Td
+/F128_0 9.963 Tf
+(3) 4.9815 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 7 7
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 105.519 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -371.59 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+477.109 749.245 Td
+/F128_0 9.963 Tf
+(Ho) 12.1748 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(bzip2) 22.1378 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -540 -741.554] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(50) 9.963 Tj
+-264 TJm
+(bytes.) 23.5226 Tj
+-351 TJm
+(Random) 33.7646 Tj
+-263 TJm
+(data) 16.5984 Tj
+-264 TJm
+(\(including) 40.9579 Tj
+-263 TJm
+(the) 12.1748 Tj
+-264 TJm
+(output) 25.4654 Tj
+-264 TJm
+(of) 8.29918 Tj
+-263 TJm
+(most) 19.378 Tj
+-264 TJm
+(\002le) 12.7327 Tj
+-263 TJm
+(compressors\)) 53.1227 Tj
+-264 TJm
+(is) 6.64532 Tj
+-264 TJm
+(coded) 23.7916 Tj
+-263 TJm
+(at) 7.19329 Tj
+-264 TJm
+(about) 22.1378 Tj
+-263 TJm
+(8.05) 17.4353 Tj
+-264 TJm
+(bits) 14.3965 Tj
+-264 TJm
+(per) 12.7228 Tj
+-263 TJm
+(byte,) 19.647 Tj
+-267 TJm
+(gi) 7.75121 Tj
+25 TJm
+(ving) 17.7142 Tj
+-264 TJm
+(an) 9.40507 Tj
+72 698.082 Td
+(e) 4.42357 Tj
+15 TJm
+(xpansion) 35.9764 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(around) 27.6673 Tj
+-250 TJm
+(0.5%.) 23.2437 Tj
+[1 0 0 1 72 695.925] cm
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+[1 0 0 1 -72 -686.081] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 676.283 Td
+/F128_0 9.963 Tf
+(As) 11.0689 Tj
+-268 TJm
+(a) 4.42357 Tj
+-268 TJm
+(self-check) 40.938 Tj
+-268 TJm
+(for) 11.6169 Tj
+-269 TJm
+(yo) 9.963 Tj
+1 TJm
+(ur) 8.29918 Tj
+-269 TJm
+(protection) 40.4 Tj
+1 TJm
+(,) 2.49075 Tj
+[1 0 0 1 217.273 676.283] cm
+0 g
+0 G
+[1 0 0 1 -217.273 -676.283] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+217.273 676.283 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 247.161 676.283] cm
+0 g
+0 G
+[1 0 0 1 -247.161 -676.283] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+249.833 676.283 Td
+/F128_0 9.963 Tf
+(uses) 17.1563 Tj
+-268 TJm
+(32-bit) 23.8016 Tj
+-268 TJm
+(CRCs) 23.8116 Tj
+-268 TJm
+(to) 7.75121 Tj
+-268 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e) 4.42357 Tj
+-269 TJm
+(sure) 16.5984 Tj
+-268 TJm
+(that) 14.9445 Tj
+-268 TJm
+(the) 12.1748 Tj
+-268 TJm
+(decompressed) 56.4404 Tj
+-268 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersion) 24.3496 Tj
+-268 TJm
+(of) 8.29918 Tj
+-268 TJm
+(a) 4.42357 Tj
+-268 TJm
+(\002le) 12.7327 Tj
+-269 TJm
+(is) 6.64532 Tj
+72 664.328 Td
+(identical) 34.3126 Tj
+-199 TJm
+(to) 7.75121 Tj
+-200 TJm
+(the) 12.1748 Tj
+-199 TJm
+(original.) 33.4856 Tj
+-587 TJm
+(This) 17.7142 Tj
+-199 TJm
+(guards) 26.5614 Tj
+-200 TJm
+(ag) 9.40507 Tj
+5 TJm
+(ainst) 18.8201 Tj
+-199 TJm
+(corruption) 41.5059 Tj
+-200 TJm
+(of) 8.29918 Tj
+-199 TJm
+(the) 12.1748 Tj
+-200 TJm
+(compre) 29.879 Tj
+1 TJm
+(ssed) 17.1563 Tj
+-200 TJm
+(data,) 19.0891 Tj
+-210 TJm
+(and) 14.3866 Tj
+-199 TJm
+(ag) 9.40507 Tj
+5 TJm
+(ainst) 18.8201 Tj
+-200 TJm
+(unde) 19.3681 Tj
+1 TJm
+(tected) 23.7916 Tj
+-200 TJm
+(b) 4.9815 Tj
+20 TJm
+(ugs) 13.8386 Tj
+-199 TJm
+(in) 7.75121 Tj
+[1 0 0 1 510.112 664.328] cm
+0 g
+0 G
+[1 0 0 1 -510.112 -664.328] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+510.112 664.328 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 540 664.328] cm
+0 g
+0 G
+[1 0 0 1 -540 -664.328] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 652.373 Td
+/F128_0 9.963 Tf
+(\(hopefully) 41.5059 Tj
+-275 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+1 TJm
+(ry) 8.29918 Tj
+-275 TJm
+(unlik) 20.4839 Tj
+10 TJm
+(ely\).) 17.9832 Tj
+-384 TJm
+(The) 15.4925 Tj
+-275 TJm
+(chances) 31.5329 Tj
+-274 TJm
+(of) 8.29918 Tj
+-275 TJm
+(data) 16.5984 Tj
+-275 TJm
+(corr) 16.0404 Tj
+1 TJm
+(uption) 25.4654 Tj
+-275 TJm
+(going) 22.6957 Tj
+-275 TJm
+(undetected) 43.1597 Tj
+-274 TJm
+(is) 6.64532 Tj
+-275 TJm
+(microscopic,) 51.1899 Tj
+-280 TJm
+(about) 22.1378 Tj
+-275 TJm
+(one) 14.3866 Tj
+-275 TJm
+(chance) 27.6573 Tj
+-274 TJm
+(in) 7.75121 Tj
+-275 TJm
+(four) 16.5984 Tj
+72 640.417 Td
+(billion) 26.0234 Tj
+-279 TJm
+(for) 11.6169 Tj
+-279 TJm
+(each) 18.2522 Tj
+-279 TJm
+(\002le) 12.7327 Tj
+-279 TJm
+(processed.) 41.7749 Tj
+-795 TJm
+(Be) 11.0689 Tj
+-279 TJm
+(a) 4.42357 Tj
+15 TJm
+(w) 7.19329 Tj
+10 TJm
+(are,) 14.6556 Tj
+-287 TJm
+(thou) 17.7142 Tj
+1 TJm
+(gh,) 12.4538 Tj
+-287 TJm
+(that) 14.9445 Tj
+-279 TJm
+(the) 12.1748 Tj
+-279 TJm
+(check) 23.2337 Tj
+-279 TJm
+(occurs) 26.0034 Tj
+-279 TJm
+(upon) 19.926 Tj
+-279 TJm
+(decompression,) 62.2588 Tj
+-286 TJm
+(so) 8.85711 Tj
+-280 TJm
+(it) 5.53943 Tj
+-279 TJm
+(can) 13.8286 Tj
+-279 TJm
+(only) 17.7142 Tj
+-279 TJm
+(tell) 12.7327 Tj
+-279 TJm
+(you) 14.9445 Tj
+72 628.462 Td
+(that) 14.9445 Tj
+-237 TJm
+(something) 41.5158 Tj
+-236 TJm
+(is) 6.64532 Tj
+-237 TJm
+(wrong.) 27.9462 Tj
+-611 TJm
+(It) 6.08739 Tj
+-237 TJm
+(can') 17.1463 Tj
+18 TJm
+(t) 2.76971 Tj
+-236 TJm
+(help) 17.1563 Tj
+-237 TJm
+(you) 14.9445 Tj
+-237 TJm
+(reco) 17.1463 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-236 TJm
+(the) 12.1748 Tj
+-237 TJm
+(original) 30.9949 Tj
+-237 TJm
+(uncompressed) 56.9983 Tj
+-236 TJm
+(data.) 19.0891 Tj
+-611 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-237 TJm
+(can) 13.8286 Tj
+-237 TJm
+(use) 13.2807 Tj
+[1 0 0 1 458.159 628.462] cm
+0 g
+0 G
+[1 0 0 1 -458.159 -628.462] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+458.159 628.462 Td
+/F130_0 9.963 Tf
+(bzip2recover) 71.7336 Tj
+[1 0 0 1 529.89 628.462] cm
+0 g
+0 G
+[1 0 0 1 -529.89 -628.462] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+532.249 628.462 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+72 616.507 Td
+(try) 11.0689 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(reco) 17.1463 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(from) 19.3681 Tj
+-250 TJm
+(damag) 26.5614 Tj
+1 TJm
+(ed) 9.40507 Tj
+-250 TJm
+(\002les.) 19.0991 Tj
+[1 0 0 1 72 614.35] cm
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+[1 0 0 1 -72 -604.506] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 594.708 Td
+/F128_0 9.963 Tf
+(Return) 27.1193 Tj
+-298 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+-406 TJm
+(0) 4.9815 Tj
+-298 TJm
+(f) 3.31768 Tj
+1 TJm
+(or) 8.29918 Tj
+-298 TJm
+(a) 4.42357 Tj
+-298 TJm
+(normal) 28.2252 Tj
+-298 TJm
+(e) 4.42357 Tj
+15 TJm
+(xit,) 13.0117 Tj
+-310 TJm
+(1) 4.9815 Tj
+-298 TJm
+(for) 11.6169 Tj
+-298 TJm
+(en) 9.40507 Tj
+40 TJm
+(vironmental) 48.1512 Tj
+-298 TJm
+(p) 4.9815 Tj
+1 TJm
+(roblems) 32.1008 Tj
+-298 TJm
+(\(\002le) 16.0504 Tj
+-298 TJm
+(not) 12.7327 Tj
+-298 TJm
+(found,) 25.7344 Tj
+-310 TJm
+(in) 7.75121 Tj
+40 TJm
+(v) 4.9815 Tj
+25 TJm
+(alid) 14.9445 Tj
+-298 TJm
+(\003ags,) 21.3109 Tj
+-310 TJm
+(I/O) 13.2807 Tj
+-297 TJm
+(errors,) 25.7245 Tj
+-310 TJm
+(etc.\),) 19.916 Tj
+-310 TJm
+(2) 4.9815 Tj
+-298 TJm
+(to) 7.75121 Tj
+72 582.753 Td
+(indicate) 31.5429 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(corrupt) 28.7731 Tj
+-250 TJm
+(compresse) 42.0538 Tj
+1 TJm
+(d) 4.9815 Tj
+-250 TJm
+(\002le,) 15.2235 Tj
+-250 TJm
+(3) 4.9815 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(an) 9.40507 Tj
+-250 TJm
+(internal) 30.437 Tj
+-250 TJm
+(consistenc) 41.5059 Tj
+15 TJm
+(y) 4.9815 Tj
+-250 TJm
+(error) 19.3581 Tj
+-250 TJm
+(\(e) 7.74125 Tj
+15 TJm
+(g,) 7.47225 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug\)) 13.2807 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(ca) 8.84714 Tj
+1 TJm
+(used) 18.2622 Tj
+[1 0 0 1 443.065 582.753] cm
+0 g
+0 G
+[1 0 0 1 -443.065 -582.753] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+443.065 582.753 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 472.953 582.753] cm
+0 g
+0 G
+[1 0 0 1 -472.953 -582.753] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+475.444 582.753 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(panic.) 24.0706 Tj
+[1 0 0 1 72 580.596] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -570.752] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 548.118 Td
+/F121_0 20.659 Tf
+(2.4.) 34.4592 Tj
+-278 TJm
+(OPTIONS) 92.9862 Tj
+[1 0 0 1 72 547.86] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -528.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 516.475 Td
+/F130_0 9.963 Tf
+(-c) 11.9556 Tj
+-600 TJm
+(--stdout) 47.8224 Tj
+[1 0 0 1 137.753 516.475] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -68.244 -0.209] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -516.266] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 504.52 Td
+/F128_0 9.963 Tf
+(Compress) 39.852 Tj
+-250 TJm
+(or) 8.29918 Tj
+-250 TJm
+(decompress) 47.0353 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(s) 3.87561 Tj
+1 TJm
+(tandard) 29.879 Tj
+-250 TJm
+(output.) 27.9562 Tj
+[1 0 0 1 72 502.363] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.866] cm
+0 g
+0 G
+[1 0 0 1 0 -9.845] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -488.652] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 478.854 Td
+/F130_0 9.963 Tf
+(-d) 11.9556 Tj
+-600 TJm
+(--decompress) 71.7336 Tj
+[1 0 0 1 161.664 478.854] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -92.154 -1.564] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -477.29] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 466.899 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(orce) 17.1463 Tj
+-296 TJm
+(decompression.) 62.2588 Tj
+[1 0 0 1 200.214 466.899] cm
+0 g
+0 G
+[1 0 0 1 -200.214 -466.899] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+200.214 466.899 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 230.102 466.899] cm
+0 g
+0 G
+[1 0 0 1 -230.102 -466.899] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+230.102 466.899 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 235.659 466.899] cm
+0 g
+0 G
+[1 0 0 1 -235.659 -466.899] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+235.659 466.899 Td
+/F130_0 9.963 Tf
+(bunzip2) 41.8446 Tj
+[1 0 0 1 277.502 466.899] cm
+0 g
+0 G
+[1 0 0 1 -277.502 -466.899] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+280.454 466.899 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 297.791 466.899] cm
+0 g
+0 G
+[1 0 0 1 -297.791 -466.899] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+297.791 466.899 Td
+/F130_0 9.963 Tf
+(bzcat) 29.889 Tj
+[1 0 0 1 327.679 466.899] cm
+0 g
+0 G
+[1 0 0 1 -327.679 -466.899] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+330.631 466.899 Td
+/F128_0 9.963 Tf
+(are) 12.1648 Tj
+-296 TJm
+(really) 22.6858 Tj
+-296 TJm
+(the) 12.1748 Tj
+-296 TJm
+(same) 20.474 Tj
+-297 TJm
+(program) 33.7546 Tj
+1 TJm
+(,) 2.49075 Tj
+-308 TJm
+(and) 14.3866 Tj
+-297 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-297 TJm
+(decision) 33.2067 Tj
+-296 TJm
+(about) 22.1378 Tj
+108 454.944 Td
+(what) 19.3681 Tj
+-303 TJm
+(actions) 28.2252 Tj
+-303 TJm
+(to) 7.75121 Tj
+-303 TJm
+(tak) 12.1748 Tj
+10 TJm
+(e) 4.42357 Tj
+-303 TJm
+(is) 6.64532 Tj
+-303 TJm
+(done) 19.3681 Tj
+-303 TJm
+(on) 9.963 Tj
+-303 TJm
+(the) 12.1748 Tj
+-303 TJm
+(basis) 19.926 Tj
+-303 TJm
+(of) 8.29918 Tj
+-303 TJm
+(which) 24.3496 Tj
+-303 TJm
+(name) 21.5799 Tj
+-303 TJm
+(is) 6.64532 Tj
+-303 TJm
+(used.) 20.7529 Tj
+-939 TJm
+(T) 6.08739 Tj
+1 TJm
+(his) 11.6268 Tj
+-304 TJm
+(\003) 5.53943 Tj
+1 TJm
+(ag) 9.40507 Tj
+-304 TJm
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+1 TJm
+(rrides) 22.6858 Tj
+-303 TJm
+(that) 14.9445 Tj
+-303 TJm
+(mechanism,) 47.8722 Tj
+-317 TJm
+(and) 14.3866 Tj
+108 442.989 Td
+(forces) 24.3396 Tj
+-250 TJm
+(bzip2) 22.1378 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(decompress.) 49.5261 Tj
+[1 0 0 1 72 440.832] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.867] cm
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -427.121] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 417.323 Td
+/F130_0 9.963 Tf
+(-z) 11.9556 Tj
+-600 TJm
+(--compress) 59.778 Tj
+[1 0 0 1 149.709 417.323] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -80.199 -1.564] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -415.759] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 405.368 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-250 TJm
+(complement) 49.2571 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 187.969 405.368] cm
+0 g
+0 G
+[1 0 0 1 -187.969 -405.368] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+187.969 405.368 Td
+/F130_0 9.963 Tf
+(-d) 11.9556 Tj
+[1 0 0 1 199.924 405.368] cm
+0 g
+0 G
+[1 0 0 1 -199.924 -405.368] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+199.924 405.368 Td
+/F128_0 9.963 Tf
+(:) 2.76971 Tj
+-310 TJm
+(forces) 24.3396 Tj
+-250 TJm
+(compression,) 52.8537 Tj
+-250 TJm
+(re) 7.74125 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(ardles) 23.7916 Tj
+1 TJm
+(s) 3.87561 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(in) 7.75121 Tj
+40 TJm
+(v) 4.9815 Tj
+20 TJm
+(okation) 29.889 Tj
+-250 TJm
+(name.) 24.0706 Tj
+[1 0 0 1 72 403.211] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.867] cm
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -389.5] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 379.702 Td
+/F130_0 9.963 Tf
+(-t) 11.9556 Tj
+-600 TJm
+(--test) 35.8668 Tj
+[1 0 0 1 125.798 379.702] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -56.289 -0.209] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -379.493] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 367.747 Td
+/F128_0 9.963 Tf
+(Check) 25.4555 Tj
+-270 TJm
+(inte) 14.9445 Tj
+15 TJm
+(grity) 18.8201 Tj
+-271 TJm
+(of) 8.29918 Tj
+-270 TJm
+(the) 12.1748 Tj
+-270 TJm
+(speci\002ed) 35.4185 Tj
+-271 TJm
+(\002) 5.53943 Tj
+1 TJm
+(le\(s\),) 20.195 Tj
+-276 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-270 TJm
+(don') 18.2622 Tj
+18 TJm
+(t) 2.76971 Tj
+-271 TJm
+(decom) 26.5614 Tj
+1 TJm
+(press) 20.474 Tj
+-271 TJm
+(them.) 22.4168 Tj
+-742 TJm
+(This) 17.7142 Tj
+-270 TJm
+(really) 22.6858 Tj
+-271 TJm
+(performs) 35.9664 Tj
+-270 TJm
+(a) 4.42357 Tj
+-270 TJm
+(trial) 16.0504 Tj
+-271 TJm
+(decompres-) 46.4774 Tj
+108 355.792 Td
+(sion) 16.6083 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(thro) 16.0504 Tj
+25 TJm
+(ws) 11.0689 Tj
+-250 TJm
+(a) 4.42357 Tj
+15 TJm
+(w) 7.19329 Tj
+10 TJm
+(ay) 9.40507 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(resul) 19.3681 Tj
+1 TJm
+(t.) 5.26046 Tj
+[1 0 0 1 72 353.635] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.867] cm
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -339.924] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 330.126 Td
+/F130_0 9.963 Tf
+(-f) 11.9556 Tj
+-600 TJm
+(--force) 41.8446 Tj
+[1 0 0 1 131.776 330.126] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -62.266 -0.209] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -329.917] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 318.171 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(orce) 17.1463 Tj
+-338 TJm
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(erwrite) 28.2152 Tj
+-338 TJm
+(of) 8.29918 Tj
+-339 TJm
+(output) 25.4654 Tj
+-338 TJm
+(\002les.) 19.0991 Tj
+-1149 TJm
+(Normally) 38.1882 Tj
+65 TJm
+(,) 2.49075 Tj
+[1 0 0 1 289.831 318.171] cm
+0 g
+0 G
+[1 0 0 1 -289.831 -318.171] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+289.831 318.171 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 319.719 318.171] cm
+0 g
+0 G
+[1 0 0 1 -319.719 -318.171] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+323.089 318.171 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-338 TJm
+(not) 12.7327 Tj
+-338 TJm
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(erwrite) 28.2152 Tj
+-339 TJm
+(e) 4.42357 Tj
+15 TJm
+(xisti) 17.1662 Tj
+1 TJm
+(ng) 9.963 Tj
+-339 TJm
+(output) 25.4654 Tj
+-338 TJm
+(\002les.) 19.0991 Tj
+-1150 TJm
+(Also) 18.8201 Tj
+-338 TJm
+(forces) 24.3396 Tj
+[1 0 0 1 108 306.216] cm
+0 g
+0 G
+[1 0 0 1 -108 -306.216] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 306.216 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 137.888 306.216] cm
+0 g
+0 G
+[1 0 0 1 -137.888 -306.216] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+140.379 306.216 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(break) 22.1278 Tj
+-250 TJm
+(hard) 17.7043 Tj
+-250 TJm
+(links) 19.378 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(\002les) 16.6083 Tj
+1 TJm
+(,) 2.49075 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(it) 5.53943 Tj
+-250 TJm
+(otherwise) 38.7361 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ouldn') 26.0134 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(do.) 12.4538 Tj
+[1 0 0 1 72 304.652] cm
+0 g
+0 G
+[1 0 0 1 0 -9.845] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -294.807] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 284.416 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 137.888 284.416] cm
+0 g
+0 G
+[1 0 0 1 -137.888 -284.416] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+141.211 284.416 Td
+/F128_0 9.963 Tf
+(normally) 35.9764 Tj
+-333 TJm
+(declines) 32.6488 Tj
+-334 TJm
+(to) 7.75121 Tj
+-333 TJm
+(decompress) 47.0353 Tj
+-334 TJm
+(\002les) 16.6083 Tj
+-333 TJm
+(which) 24.3496 Tj
+-333 TJm
+(don') 18.2622 Tj
+18 TJm
+(t) 2.76971 Tj
+-334 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-333 TJm
+(the) 12.1748 Tj
+-334 TJm
+(correct) 27.6573 Tj
+-333 TJm
+(magic) 24.3496 Tj
+-334 TJm
+(header) 26.5514 Tj
+-333 TJm
+(bytes.) 23.5226 Tj
+-561 TJm
+(If) 6.63536 Tj
+-333 TJm
+(forced) 25.4455 Tj
+108 272.461 Td
+(\() 3.31768 Tj
+[1 0 0 1 111.317 272.461] cm
+0 g
+0 G
+[1 0 0 1 -111.317 -272.461] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+111.317 272.461 Td
+/F130_0 9.963 Tf
+(-f) 11.9556 Tj
+[1 0 0 1 123.273 272.461] cm
+0 g
+0 G
+[1 0 0 1 -123.273 -272.461] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+123.273 272.461 Td
+/F128_0 9.963 Tf
+(\),) 5.80843 Tj
+-250 TJm
+(ho) 9.963 Tj
+25 TJm
+(we) 11.6169 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+40 TJm
+(,) 2.49075 Tj
+-250 TJm
+(it) 5.53943 Tj
+-250 TJm
+(will) 15.5024 Tj
+-250 TJm
+(pass) 17.1563 Tj
+-250 TJm
+(such) 18.2622 Tj
+-249 TJm
+(\002les) 16.6083 Tj
+-250 TJm
+(through) 30.9949 Tj
+-250 TJm
+(unmodi\002ed.) 47.8822 Tj
+-310 TJm
+(This) 17.7142 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(GNU) 21.5799 Tj
+[1 0 0 1 412.585 272.461] cm
+0 g
+0 G
+[1 0 0 1 -412.585 -272.461] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+412.585 272.461 Td
+/F130_0 9.963 Tf
+(gzip) 23.9112 Tj
+[1 0 0 1 436.496 272.461] cm
+0 g
+0 G
+[1 0 0 1 -436.496 -272.461] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+438.986 272.461 Td
+/F128_0 9.963 Tf
+(beha) 18.8101 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(es.) 10.7899 Tj
+[1 0 0 1 72 270.304] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.866] cm
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -256.594] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 246.795 Td
+/F130_0 9.963 Tf
+(-k) 11.9556 Tj
+-600 TJm
+(--keep) 35.8668 Tj
+[1 0 0 1 125.798 246.795] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -56.289 -1.564] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -245.231] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 234.84 Td
+/F128_0 9.963 Tf
+(K) 7.19329 Tj
+25 TJm
+(eep) 13.8286 Tj
+-250 TJm
+(\(don') 21.5799 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(delete\)) 27.1093 Tj
+-250 TJm
+(input) 20.4839 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+1 TJm
+(s) 3.87561 Tj
+-250 TJm
+(during) 26.0134 Tj
+-250 TJm
+(compression) 50.363 Tj
+-250 TJm
+(or) 8.29918 Tj
+-250 TJm
+(decompression.) 62.2588 Tj
+[1 0 0 1 72 232.683] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.866] cm
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -218.973] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 209.175 Td
+/F130_0 9.963 Tf
+(-s) 11.9556 Tj
+-600 TJm
+(--small) 41.8446 Tj
+[1 0 0 1 131.776 209.175] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -62.266 -0.21] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -208.965] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 197.219 Td
+/F128_0 9.963 Tf
+(Reduce) 29.879 Tj
+-347 TJm
+(memory) 33.2067 Tj
+-346 TJm
+(usage,) 25.1765 Tj
+-371 TJm
+(for) 11.6169 Tj
+-347 TJm
+(compression,) 52.8537 Tj
+-371 TJm
+(decompression) 59.768 Tj
+-346 TJm
+(and) 14.3866 Tj
+-347 TJm
+(testing.) 29.0621 Tj
+-1201 TJm
+(Files) 19.378 Tj
+-347 TJm
+(are) 12.1648 Tj
+-346 TJm
+(decompressed) 56.4404 Tj
+-347 TJm
+(and) 14.3866 Tj
+-347 TJm
+(tested) 23.2437 Tj
+108 185.264 Td
+(using) 21.5898 Tj
+-388 TJm
+(a) 4.42357 Tj
+-388 TJm
+(modi\002ed) 35.4284 Tj
+-388 TJm
+(algorithm) 38.7461 Tj
+-388 TJm
+(which) 24.3496 Tj
+-388 TJm
+(only) 17.7142 Tj
+-388 TJm
+(requires) 32.0908 Tj
+-388 TJm
+(2.5) 12.4538 Tj
+-388 TJm
+(bytes) 21.0319 Tj
+-388 TJm
+(per) 12.7228 Tj
+-388 TJm
+(block) 22.1378 Tj
+-388 TJm
+(byte.) 19.647 Tj
+-1449 TJm
+(This) 17.7142 Tj
+-388 TJm
+(means) 25.4555 Tj
+-388 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-388 TJm
+(\002le) 12.7327 Tj
+-388 TJm
+(can) 13.8286 Tj
+-389 TJm
+(be) 9.40507 Tj
+108 173.309 Td
+(decompressed) 56.4404 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(2300k) 24.9075 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(mem) 19.926 Tj
+1 TJm
+(ory) 13.2807 Tj
+65 TJm
+(,) 2.49075 Tj
+-250 TJm
+(albeit) 22.1378 Tj
+-250 TJm
+(at) 7.19329 Tj
+-250 TJm
+(about) 22.1378 Tj
+-250 TJm
+(half) 15.4925 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(normal) 28.2252 Tj
+-250 TJm
+(speed.) 25.1765 Tj
+[1 0 0 1 72 171.152] cm
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+[1 0 0 1 -72 -161.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 151.51 Td
+/F128_0 9.963 Tf
+(During) 28.2252 Tj
+-251 TJm
+(compression,) 52.8537 Tj
+[1 0 0 1 194.09 151.51] cm
+0 g
+0 G
+[1 0 0 1 -194.09 -151.51] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+194.09 151.51 Td
+/F130_0 9.963 Tf
+(-s) 11.9556 Tj
+[1 0 0 1 206.046 151.51] cm
+0 g
+0 G
+[1 0 0 1 -206.046 -151.51] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+208.551 151.51 Td
+/F128_0 9.963 Tf
+(selects) 26.5614 Tj
+-251 TJm
+(a) 4.42357 Tj
+-252 TJm
+(block) 22.1378 Tj
+-251 TJm
+(size) 15.4925 Tj
+-252 TJm
+(of) 8.29918 Tj
+-251 TJm
+(200k,) 22.4168 Tj
+-252 TJm
+(which) 24.3496 Tj
+-251 TJm
+(limits) 22.7057 Tj
+-252 TJm
+(memory) 33.2067 Tj
+-251 TJm
+(use) 13.2807 Tj
+-252 TJm
+(to) 7.75121 Tj
+-251 TJm
+(around) 27.6673 Tj
+-251 TJm
+(the) 12.1748 Tj
+-252 TJm
+(same) 20.474 Tj
+-251 TJm
+(\002gure,) 25.7344 Tj
+-252 TJm
+(at) 7.19329 Tj
+108 139.555 Td
+(the) 12.1748 Tj
+-287 TJm
+(e) 4.42357 Tj
+15 TJm
+(xpense) 27.6673 Tj
+-287 TJm
+(of) 8.29918 Tj
+-287 TJm
+(your) 18.2622 Tj
+-287 TJm
+(compression) 50.363 Tj
+-287 TJm
+(ratio.) 20.7529 Tj
+-843 TJm
+(In) 8.29918 Tj
+-287 TJm
+(short,) 22.4168 Tj
+-297 TJm
+(if) 6.08739 Tj
+-287 TJm
+(your) 18.2622 Tj
+-287 TJm
+(machine) 33.7546 Tj
+-287 TJm
+(is) 6.64532 Tj
+-287 TJm
+(lo) 7.75121 Tj
+25 TJm
+(w) 7.19329 Tj
+-287 TJm
+(on) 9.963 Tj
+-287 TJm
+(memory) 33.2067 Tj
+-287 TJm
+(\(8) 8.29918 Tj
+-288 TJm
+(m) 7.75121 Tj
+1 TJm
+(e) 4.42357 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(abytes) 25.4555 Tj
+-288 TJm
+(or) 8.29918 Tj
+-287 TJm
+(less\),) 20.7529 Tj
+108 127.599 Td
+(use) 13.2807 Tj
+[1 0 0 1 123.771 127.599] cm
+0 g
+0 G
+[1 0 0 1 -123.771 -127.599] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+123.771 127.599 Td
+/F130_0 9.963 Tf
+(-s) 11.9556 Tj
+[1 0 0 1 135.726 127.599] cm
+0 g
+0 G
+[1 0 0 1 -135.726 -127.599] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+138.217 127.599 Td
+/F128_0 9.963 Tf
+(for) 11.6169 Tj
+-250 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(erything.) 35.6974 Tj
+-620 TJm
+(See) 14.3866 Tj
+[1 0 0 1 220.079 127.599] cm
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -220.079 -127.599] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+220.079 127.599 Td
+/F128_0 9.963 Tf
+(MEMOR) 37.6402 Tj
+65 TJm
+(Y) 7.19329 Tj
+-250 TJm
+(MAN) 23.2437 Tj
+35 TJm
+(A) 7.19329 Tj
+40 TJm
+(GEMENT) 41.5059 Tj
+[1 0 0 1 337.946 127.599] cm
+0 g
+0 G
+0 0 1 rg
+0 0 1 RG
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -337.946 -127.599] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+340.437 127.599 Td
+/F128_0 9.963 Tf
+([5]) 11.6169 Tj
+[1 0 0 1 352.053 127.599] cm
+0 0 1 rg
+0 0 1 RG
+0 g
+0 G
+[1 0 0 1 -352.053 -127.599] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+354.544 127.599 Td
+/F128_0 9.963 Tf
+(belo) 17.1563 Tj
+25 TJm
+(w) 7.19329 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 125.443] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.867] cm
+0 g
+0 G
+[1 0 0 1 0 -9.844] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -111.732] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 101.934 Td
+/F130_0 9.963 Tf
+(-q) 11.9556 Tj
+-600 TJm
+(--quiet) 41.8446 Tj
+[1 0 0 1 131.776 101.934] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -62.266 -1.564] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -100.37] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 89.979 Td
+/F128_0 9.963 Tf
+(Suppress) 35.9764 Tj
+-221 TJm
+(non-) 18.2622 Tj
+1 TJm
+(essential) 34.3126 Tj
+-221 TJm
+(w) 7.19329 Tj
+10 TJm
+(arning) 25.4555 Tj
+-221 TJm
+(mess) 19.926 Tj
+1 TJm
+(ages.) 20.195 Tj
+-301 TJm
+(Messa) 25.4555 Tj
+1 TJm
+(ges) 13.2807 Tj
+-221 TJm
+(pertaining) 40.4 Tj
+-221 TJm
+(to) 7.75121 Tj
+-220 TJm
+(I/O) 13.2807 Tj
+-221 TJm
+(errors) 23.2337 Tj
+-221 TJm
+(and) 14.3866 Tj
+-220 TJm
+(other) 20.474 Tj
+-221 TJm
+(critical) 27.6673 Tj
+-220 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ents) 16.0504 Tj
+-221 TJm
+(will) 15.5024 Tj
+-221 TJm
+(not) 12.7327 Tj
+108 78.023 Td
+(be) 9.40507 Tj
+-250 TJm
+(suppressed.) 46.2084 Tj
+[1 0 0 1 72 75.867] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.867] cm
+0 g
+0 G
+[1 0 0 1 0 -21.148] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.754] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 43.063 -6.754] cm
+0 g
+0 G
+[1 0 0 1 -496.332 -50.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+539.395 50.852 Td
+/F128_0 9.963 Tf
+(4) 4.9815 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 8 8
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 105.519 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -371.59 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+477.109 749.245 Td
+/F128_0 9.963 Tf
+(Ho) 12.1748 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(bzip2) 22.1378 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F130_0 9.963 Tf
+(-v) 11.9556 Tj
+-600 TJm
+(--verbose) 53.8002 Tj
+[1 0 0 1 143.731 710.037] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -74.222 -0.209] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -709.828] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 698.082 Td
+/F128_0 9.963 Tf
+(V) 7.19329 Tj
+111 TJm
+(erbose) 26.0034 Tj
+-322 TJm
+(mode) 22.1378 Tj
+-323 TJm
+(--) 6.63536 Tj
+-323 TJm
+(sho) 13.8386 Tj
+25 TJm
+(w) 7.19329 Tj
+-322 TJm
+(the) 12.1748 Tj
+-323 TJm
+(compres) 33.7546 Tj
+1 TJm
+(sion) 16.6083 Tj
+-323 TJm
+(ratio) 18.2622 Tj
+-323 TJm
+(for) 11.6169 Tj
+-322 TJm
+(each) 18.2522 Tj
+-323 TJm
+(\002le) 12.7327 Tj
+-322 TJm
+(processed.) 41.7749 Tj
+-1056 TJm
+(Further) 29.3311 Tj
+[1 0 0 1 430.015 698.082] cm
+0 g
+0 G
+[1 0 0 1 -430.015 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+430.015 698.082 Td
+/F130_0 9.963 Tf
+(-v) 11.9556 Tj
+[1 0 0 1 441.97 698.082] cm
+0 g
+0 G
+[1 0 0 1 -441.97 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+441.97 698.082 Td
+/F128_0 9.963 Tf
+(') 3.31768 Tj
+55 TJm
+(s) 3.87561 Tj
+-323 TJm
+(incre) 19.916 Tj
+1 TJm
+(ase) 12.7228 Tj
+-323 TJm
+(the) 12.1748 Tj
+-323 TJm
+(v) 4.9815 Tj
+15 TJm
+(erbos) 21.5799 Tj
+1 TJm
+(ity) 10.5209 Tj
+108 686.127 Td
+(le) 7.19329 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el,) 9.68404 Tj
+-250 TJm
+(spe) 13.2807 Tj
+25 TJm
+(wing) 19.926 Tj
+-250 TJm
+(out) 12.7327 Tj
+-250 TJm
+(lots) 14.3965 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(info) 16.0504 Tj
+1 TJm
+(rmation) 30.9949 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(primarily) 37.0823 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(interest) 29.3311 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(diagnostic) 40.9579 Tj
+-250 TJm
+(pu) 9.963 Tj
+1 TJm
+(rposes.) 27.9462 Tj
+[1 0 0 1 72 683.97] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -670.023] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 660.224 Td
+/F130_0 9.963 Tf
+(-L) 11.9556 Tj
+-600 TJm
+(--license) 53.8002 Tj
+-600 TJm
+(-V) 11.9556 Tj
+-600 TJm
+(--version) 53.8002 Tj
+[1 0 0 1 221.44 660.224] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -151.93 -0.209] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -660.015] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 648.269 Td
+/F128_0 9.963 Tf
+(Display) 30.9949 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(softw) 22.1378 Tj
+10 TJm
+(are) 12.1648 Tj
+-250 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersion) 24.3496 Tj
+1 TJm
+(,) 2.49075 Tj
+-250 TJm
+(license) 27.6673 Tj
+-250 TJm
+(terms) 22.1378 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(conditions.) 44.0066 Tj
+[1 0 0 1 72 646.112] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -632.165] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 622.366 Td
+/F130_0 9.963 Tf
+(-1) 11.9556 Tj
+[1 0 0 1 83.955 622.366] cm
+0 g
+0 G
+[1 0 0 1 -83.955 -622.366] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.446 622.366 Td
+/F128_0 9.963 Tf
+(\(or) 11.6169 Tj
+[1 0 0 1 100.553 622.366] cm
+0 g
+0 G
+[1 0 0 1 -100.553 -622.366] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+100.553 622.366 Td
+/F130_0 9.963 Tf
+(--fast) 35.8668 Tj
+[1 0 0 1 136.418 622.366] cm
+0 g
+0 G
+[1 0 0 1 -136.418 -622.366] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+136.418 622.366 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 152.468 622.366] cm
+0 g
+0 G
+[1 0 0 1 -152.468 -622.366] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+152.468 622.366 Td
+/F130_0 9.963 Tf
+(-9) 11.9556 Tj
+[1 0 0 1 164.423 622.366] cm
+0 g
+0 G
+[1 0 0 1 -164.423 -622.366] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+166.914 622.366 Td
+/F128_0 9.963 Tf
+(\(or) 11.6169 Tj
+[1 0 0 1 181.021 622.366] cm
+0 g
+0 G
+[1 0 0 1 -181.021 -622.366] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+181.021 622.366 Td
+/F130_0 9.963 Tf
+(-best) 29.889 Tj
+[1 0 0 1 210.909 622.366] cm
+0 g
+0 G
+[1 0 0 1 -210.909 -622.366] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.909 622.366 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+[1 0 0 1 214.226 622.366] cm
+0 g
+0 G
+[1 0 0 1 -142.226 -1.783] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -620.583] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 610.411 Td
+/F128_0 9.963 Tf
+(Set) 12.7327 Tj
+-288 TJm
+(the) 12.1748 Tj
+-288 TJm
+(block) 22.1378 Tj
+-289 TJm
+(size) 15.4925 Tj
+-288 TJm
+(to) 7.75121 Tj
+-288 TJm
+(100) 14.9445 Tj
+-288 TJm
+(k,) 7.47225 Tj
+-298 TJm
+(200) 14.9445 Tj
+-288 TJm
+(k) 4.9815 Tj
+-289 TJm
+(...) 7.47225 Tj
+-849 TJm
+(900) 14.9445 Tj
+-288 TJm
+(k) 4.9815 Tj
+-289 TJm
+(when) 21.5799 Tj
+-288 TJm
+(compressing.) 52.8537 Tj
+-849 TJm
+(Has) 15.4925 Tj
+-289 TJm
+(no) 9.963 Tj
+-288 TJm
+(ef) 7.74125 Tj
+25 TJm
+(fect) 14.9345 Tj
+-288 TJm
+(when) 21.5799 Tj
+-288 TJm
+(decompressing.) 62.2588 Tj
+-850 TJm
+(See) 14.3866 Tj
+[1 0 0 1 108 598.456] cm
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -108 -598.456] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 598.456 Td
+/F128_0 9.963 Tf
+(MEMOR) 37.6402 Tj
+65 TJm
+(Y) 7.19329 Tj
+-297 TJm
+(MAN) 23.2437 Tj
+35 TJm
+(A) 7.19329 Tj
+40 TJm
+(GEMENT) 41.5059 Tj
+[1 0 0 1 226.338 598.456] cm
+0 g
+0 G
+0 0 1 rg
+0 0 1 RG
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -226.338 -598.456] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+229.3 598.456 Td
+/F128_0 9.963 Tf
+([5]) 11.6169 Tj
+[1 0 0 1 240.916 598.456] cm
+0 0 1 rg
+0 0 1 RG
+0 g
+0 G
+[1 0 0 1 -240.916 -598.456] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+243.878 598.456 Td
+/F128_0 9.963 Tf
+(belo) 17.1563 Tj
+25 TJm
+(w) 7.19329 Tj
+65 TJm
+(.) 2.49075 Tj
+-904 TJm
+(The) 15.4925 Tj
+[1 0 0 1 297.278 598.456] cm
+0 g
+0 G
+[1 0 0 1 -297.278 -598.456] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+297.278 598.456 Td
+/F130_0 9.963 Tf
+(--fast) 35.8668 Tj
+[1 0 0 1 333.144 598.456] cm
+0 g
+0 G
+[1 0 0 1 -333.144 -598.456] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+336.106 598.456 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 353.454 598.456] cm
+0 g
+0 G
+[1 0 0 1 -353.454 -598.456] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+353.454 598.456 Td
+/F130_0 9.963 Tf
+(--best) 35.8668 Tj
+[1 0 0 1 389.319 598.456] cm
+0 g
+0 G
+[1 0 0 1 -389.319 -598.456] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+392.281 598.456 Td
+/F128_0 9.963 Tf
+(aliases) 26.5614 Tj
+-297 TJm
+(are) 12.1648 Tj
+-297 TJm
+(primarily) 37.0823 Tj
+-297 TJm
+(for) 11.6169 Tj
+-298 TJm
+(GNU) 21.5799 Tj
+[1 0 0 1 516.09 598.456] cm
+0 g
+0 G
+[1 0 0 1 -516.09 -598.456] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+516.09 598.456 Td
+/F130_0 9.963 Tf
+(gzip) 23.9112 Tj
+[1 0 0 1 540 598.456] cm
+0 g
+0 G
+[1 0 0 1 -540 -598.456] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 586.501 Td
+/F128_0 9.963 Tf
+(compatibility) 53.1426 Tj
+65 TJm
+(.) 2.49075 Tj
+-356 TJm
+(In) 8.29918 Tj
+-265 TJm
+(particular) 38.1782 Tj
+40 TJm
+(,) 2.49075 Tj
+[1 0 0 1 220.423 586.501] cm
+0 g
+0 G
+[1 0 0 1 -220.423 -586.501] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+220.423 586.501 Td
+/F130_0 9.963 Tf
+(--fast) 35.8668 Tj
+[1 0 0 1 256.288 586.501] cm
+0 g
+0 G
+[1 0 0 1 -256.288 -586.501] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+258.932 586.501 Td
+/F128_0 9.963 Tf
+(doesn') 26.5614 Tj
+18 TJm
+(t) 2.76971 Tj
+-265 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e) 4.42357 Tj
+-265 TJm
+(things) 24.3595 Tj
+-266 TJm
+(signi\002can) 38.7461 Tj
+1 TJm
+(tly) 10.5209 Tj
+-266 TJm
+(f) 3.31768 Tj
+10 TJm
+(aster) 18.8101 Tj
+55 TJm
+(.) 2.49075 Tj
+-712 TJm
+(And) 17.1563 Tj
+[1 0 0 1 444.622 586.501] cm
+0 g
+0 G
+[1 0 0 1 -444.622 -586.501] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+444.622 586.501 Td
+/F130_0 9.963 Tf
+(--best) 35.8668 Tj
+[1 0 0 1 480.487 586.501] cm
+0 g
+0 G
+[1 0 0 1 -480.487 -586.501] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+483.131 586.501 Td
+/F128_0 9.963 Tf
+(merely) 27.6673 Tj
+-265 TJm
+(selects) 26.5614 Tj
+108 574.546 Td
+(the) 12.1748 Tj
+-250 TJm
+(def) 12.7228 Tj
+10 TJm
+(ault) 14.9445 Tj
+-250 TJm
+(beha) 18.8101 Tj
+20 TJm
+(viour) 21.0319 Tj
+55 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 574.446] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -560.498] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 548.643 Td
+/F130_0 9.963 Tf
+(--) 11.9556 Tj
+[1 0 0 1 83.955 548.643] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -14.446 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -548.643] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 536.688 Td
+/F128_0 9.963 Tf
+(T) 6.08739 Tj
+35 TJm
+(reats) 18.8101 Tj
+-261 TJm
+(all) 9.963 Tj
+-260 TJm
+(subsequent) 44.2756 Tj
+-261 TJm
+(ar) 7.74125 Tj
+18 TJm
+(guments) 33.7646 Tj
+-261 TJm
+(as) 8.29918 Tj
+-260 TJm
+(\002le) 12.7327 Tj
+-261 TJm
+(names,) 27.9462 Tj
+-263 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-261 TJm
+(if) 6.08739 Tj
+-261 TJm
+(the) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-261 TJm
+(sta) 11.0689 Tj
+1 TJm
+(rt) 6.08739 Tj
+-261 TJm
+(with) 17.7142 Tj
+-261 TJm
+(a) 4.42357 Tj
+-261 TJm
+(dash.) 20.7529 Tj
+-684 TJm
+(This) 17.7142 Tj
+-261 TJm
+(is) 6.64532 Tj
+-261 TJm
+(so) 8.85711 Tj
+-261 TJm
+(yo) 9.963 Tj
+1 TJm
+(u) 4.9815 Tj
+-261 TJm
+(can) 13.8286 Tj
+-261 TJm
+(handle) 26.5614 Tj
+-261 TJm
+(\002les) 16.6083 Tj
+108 524.732 Td
+(with) 17.7142 Tj
+-250 TJm
+(names) 25.4555 Tj
+-250 TJm
+(be) 9.40507 Tj
+15 TJm
+(ginning) 30.4469 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(a) 4.42357 Tj
+-249 TJm
+(dash,) 20.7529 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(e) 4.42357 Tj
+15 TJm
+(xample:) 32.1008 Tj
+[1 0 0 1 302.27 524.732] cm
+0 g
+0 G
+[1 0 0 1 -302.27 -524.732] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+302.27 524.732 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+-600 TJm
+(--) 11.9556 Tj
+-600 TJm
+(-myfilename) 65.7558 Tj
+[1 0 0 1 421.821 524.732] cm
+0 g
+0 G
+[1 0 0 1 -421.821 -524.732] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+421.821 524.732 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 522.576] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -508.628] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 498.83 Td
+/F130_0 9.963 Tf
+(--repetitive-fast) 101.623 Tj
+[1 0 0 1 173.619 498.83] cm
+0 g
+0 G
+[1 0 0 1 -173.619 -498.83] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+173.619 498.83 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 178.6 498.83] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -181.091 -498.83] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+181.091 498.83 Td
+/F130_0 9.963 Tf
+(--repetitive-best) 101.623 Tj
+[1 0 0 1 282.71 498.83] cm
+0 g
+0 G
+[1 0 0 1 -282.71 -498.83] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+282.71 498.83 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 287.691 498.83] cm
+0 g
+0 G
+[1 0 0 1 -215.691 -1.564] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -497.266] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 486.874 Td
+/F128_0 9.963 Tf
+(These) 23.7916 Tj
+-207 TJm
+(\003ags) 18.8201 Tj
+-206 TJm
+(are) 12.1648 Tj
+-207 TJm
+(redundant) 39.842 Tj
+-206 TJm
+(in) 7.75121 Tj
+-207 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersions) 28.2252 Tj
+-206 TJm
+(0.9.5) 19.926 Tj
+-207 TJm
+(and) 14.3866 Tj
+-207 TJm
+(abo) 14.3866 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e.) 6.91432 Tj
+-591 TJm
+(The) 15.4925 Tj
+15 TJm
+(y) 4.9815 Tj
+-206 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vided) 22.1378 Tj
+-207 TJm
+(some) 21.0319 Tj
+-206 TJm
+(coarse) 25.4455 Tj
+-207 TJm
+(control) 28.2252 Tj
+-206 TJm
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-207 TJm
+(the) 12.1748 Tj
+-207 TJm
+(beha) 18.8101 Tj
+20 TJm
+(viour) 21.0319 Tj
+108 474.919 Td
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-251 TJm
+(sorti) 17.7142 Tj
+1 TJm
+(ng) 9.963 Tj
+-251 TJm
+(algorithm) 38.7461 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(earlier) 25.4455 Tj
+-250 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersions,) 30.7159 Tj
+-251 TJm
+(which) 24.3496 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-250 TJm
+(sometimes) 42.6217 Tj
+-250 TJm
+(useful.) 26.8403 Tj
+-622 TJm
+(0.9.5) 19.926 Tj
+-251 TJm
+(and) 14.3866 Tj
+-250 TJm
+(abo) 14.3866 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(an) 9.40507 Tj
+-251 TJm
+(impro) 23.8016 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(ed) 9.40507 Tj
+108 462.964 Td
+(algorithm) 38.7461 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(renders) 29.3211 Tj
+-250 TJm
+(thes) 16.0504 Tj
+1 TJm
+(e) 4.42357 Tj
+-250 TJm
+(\003ags) 18.8201 Tj
+-250 TJm
+(irrele) 21.0219 Tj
+25 TJm
+(v) 4.9815 Tj
+25 TJm
+(ant.) 14.6655 Tj
+[1 0 0 1 72 460.807] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -436.897] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 414.264 Td
+/F121_0 20.659 Tf
+(2.5.) 34.4592 Tj
+-278 TJm
+(MEMOR) 79.1859 Tj
+50 TJm
+(Y) 13.7796 Tj
+-278 TJm
+(MANA) 61.9563 Tj
+50 TJm
+(GEMENT) 88.3792 Tj
+[1 0 0 1 72 414.006] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -404.043] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 392.346 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 392.346] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -392.346] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+104.454 392.346 Td
+/F128_0 9.963 Tf
+(compresses) 45.9294 Tj
+-257 TJm
+(lar) 10.511 Tj
+18 TJm
+(ge) 9.40507 Tj
+-258 TJm
+(\002les) 16.6083 Tj
+-257 TJm
+(in) 7.75121 Tj
+-258 TJm
+(blocks.) 28.5041 Tj
+-665 TJm
+(The) 15.4925 Tj
+-258 TJm
+(block) 22.1378 Tj
+-257 TJm
+(size) 15.4925 Tj
+-258 TJm
+(af) 7.74125 Tj
+25 TJm
+(fects) 18.8101 Tj
+-257 TJm
+(both) 17.7142 Tj
+-258 TJm
+(the) 12.1748 Tj
+-257 TJm
+(compression) 50.363 Tj
+-258 TJm
+(ratio) 18.2622 Tj
+-257 TJm
+(achie) 21.0219 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ed,) 11.8958 Tj
+-260 TJm
+(an) 9.40507 Tj
+1 TJm
+(d) 4.9815 Tj
+-258 TJm
+(the) 12.1748 Tj
+-258 TJm
+(amoun) 27.1193 Tj
+1 TJm
+(t) 2.76971 Tj
+72 380.391 Td
+(of) 8.29918 Tj
+-215 TJm
+(memory) 33.2067 Tj
+-215 TJm
+(needed) 28.2152 Tj
+-214 TJm
+(for) 11.6169 Tj
+-215 TJm
+(compression) 50.363 Tj
+-215 TJm
+(and) 14.3866 Tj
+-215 TJm
+(decompressi) 49.805 Tj
+1 TJm
+(on.) 12.4538 Tj
+-597 TJm
+(The) 15.4925 Tj
+-215 TJm
+(\003ags) 18.8201 Tj
+[1 0 0 1 337.719 380.391] cm
+0 g
+0 G
+[1 0 0 1 -337.719 -380.391] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+337.719 380.391 Td
+/F130_0 9.963 Tf
+(-1) 11.9556 Tj
+[1 0 0 1 349.674 380.391] cm
+0 g
+0 G
+[1 0 0 1 -349.674 -380.391] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+351.815 380.391 Td
+/F128_0 9.963 Tf
+(through) 30.9949 Tj
+[1 0 0 1 384.95 380.391] cm
+0 g
+0 G
+[1 0 0 1 -384.95 -380.391] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+384.95 380.391 Td
+/F130_0 9.963 Tf
+(-9) 11.9556 Tj
+[1 0 0 1 396.905 380.391] cm
+0 g
+0 G
+[1 0 0 1 -396.905 -380.391] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+399.046 380.391 Td
+/F128_0 9.963 Tf
+(specify) 28.7731 Tj
+-215 TJm
+(the) 12.1748 Tj
+-215 TJm
+(block) 22.1378 Tj
+-214 TJm
+(size) 15.4925 Tj
+-215 TJm
+(to) 7.75121 Tj
+-215 TJm
+(be) 9.40507 Tj
+-215 TJm
+(100,000) 32.3798 Tj
+72 368.435 Td
+(bytes) 21.0319 Tj
+-278 TJm
+(throug) 26.0134 Tj
+1 TJm
+(h) 4.9815 Tj
+-278 TJm
+(900,000) 32.3798 Tj
+-278 TJm
+(bytes) 21.0319 Tj
+-277 TJm
+(\(the) 15.4925 Tj
+-278 TJm
+(def) 12.7228 Tj
+10 TJm
+(ault\)) 18.2622 Tj
+-278 TJm
+(r) 3.31768 Tj
+1 TJm
+(especti) 27.6673 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ely) 12.1748 Tj
+65 TJm
+(.) 2.49075 Tj
+-786 TJm
+(At) 9.963 Tj
+-278 TJm
+(decompression) 59.768 Tj
+-278 TJm
+(tim) 13.2906 Tj
+1 TJm
+(e,) 6.91432 Tj
+-285 TJm
+(the) 12.1748 Tj
+-278 TJm
+(block) 22.1378 Tj
+-277 TJm
+(size) 15.4925 Tj
+-278 TJm
+(used) 18.2622 Tj
+-278 TJm
+(f) 3.31768 Tj
+1 TJm
+(or) 8.29918 Tj
+-278 TJm
+(compression) 50.363 Tj
+72 356.48 Td
+(is) 6.64532 Tj
+-242 TJm
+(read) 17.1463 Tj
+-243 TJm
+(from) 19.3681 Tj
+-242 TJm
+(the) 12.1748 Tj
+-243 TJm
+(header) 26.5514 Tj
+-242 TJm
+(of) 8.29918 Tj
+-243 TJm
+(the) 12.1748 Tj
+-242 TJm
+(compressed) 47.0353 Tj
+-242 TJm
+(\002le,) 15.2235 Tj
+-244 TJm
+(and) 14.3866 Tj
+[1 0 0 1 275.174 356.48] cm
+0 g
+0 G
+[1 0 0 1 -275.174 -356.48] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+275.174 356.48 Td
+/F130_0 9.963 Tf
+(bunzip2) 41.8446 Tj
+[1 0 0 1 317.017 356.48] cm
+0 g
+0 G
+[1 0 0 1 -317.017 -356.48] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+319.433 356.48 Td
+/F128_0 9.963 Tf
+(then) 17.1563 Tj
+-242 TJm
+(allocates) 34.8605 Tj
+-243 TJm
+(itself) 19.926 Tj
+-242 TJm
+(just) 14.3965 Tj
+-243 TJm
+(enough) 29.3311 Tj
+-242 TJm
+(memory) 33.2067 Tj
+-242 TJm
+(to) 7.75121 Tj
+-243 TJm
+(decompress) 47.0353 Tj
+72 344.525 Td
+(the) 12.1748 Tj
+-303 TJm
+(\002le.) 15.2235 Tj
+-940 TJm
+(Since) 22.1378 Tj
+-303 TJm
+(block) 22.1378 Tj
+-303 TJm
+(sizes) 19.3681 Tj
+-304 TJm
+(are) 12.1648 Tj
+-303 TJm
+(stored) 24.3496 Tj
+-303 TJm
+(in) 7.75121 Tj
+-303 TJm
+(compressed) 47.0353 Tj
+-304 TJm
+(\002) 5.53943 Tj
+1 TJm
+(les,) 13.5596 Tj
+-317 TJm
+(it) 5.53943 Tj
+-303 TJm
+(follo) 18.8201 Tj
+25 TJm
+(ws) 11.0689 Tj
+-304 TJm
+(t) 2.76971 Tj
+1 TJm
+(hat) 12.1748 Tj
+-304 TJm
+(the) 12.1748 Tj
+-303 TJm
+(\003ags) 18.8201 Tj
+[1 0 0 1 406.35 344.525] cm
+0 g
+0 G
+[1 0 0 1 -406.35 -344.525] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+406.35 344.525 Td
+/F130_0 9.963 Tf
+(-1) 11.9556 Tj
+[1 0 0 1 418.305 344.525] cm
+0 g
+0 G
+[1 0 0 1 -418.305 -344.525] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+421.327 344.525 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+[1 0 0 1 432.1 344.525] cm
+0 g
+0 G
+[1 0 0 1 -432.1 -344.525] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+432.1 344.525 Td
+/F130_0 9.963 Tf
+(-9) 11.9556 Tj
+[1 0 0 1 444.055 344.525] cm
+0 g
+0 G
+[1 0 0 1 -444.055 -344.525] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+447.077 344.525 Td
+/F128_0 9.963 Tf
+(are) 12.1648 Tj
+-303 TJm
+(irrele) 21.0219 Tj
+25 TJm
+(v) 4.9815 Tj
+25 TJm
+(ant) 12.1748 Tj
+-303 TJm
+(to) 7.75121 Tj
+-304 TJm
+(and) 14.3866 Tj
+-303 TJm
+(so) 8.85711 Tj
+72 332.57 Td
+(ignored) 30.437 Tj
+-250 TJm
+(during) 26.0134 Tj
+-250 TJm
+(decompression) 59.768 Tj
+1 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 330.413] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -320.451] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 310.652 Td
+/F128_0 9.963 Tf
+(Compression) 52.5847 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(decompress) 47.0353 Tj
+1 TJm
+(ion) 12.7327 Tj
+-250 TJm
+(requirements,) 54.5076 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(bytes,) 23.5226 Tj
+-250 TJm
+(can) 13.8286 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(estimated) 38.1882 Tj
+-250 TJm
+(as:) 11.0689 Tj
+[1 0 0 1 72 308.495] cm
+0 g
+0 G
+[1 0 0 1 0 -60.772] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 59.776 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 56.189] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -299.13] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 299.13 Td
+/F130_0 9.963 Tf
+(Compression:) 71.7336 Tj
+-1278 TJm
+(400k) 23.9112 Tj
+-426 TJm
+(+) 5.9778 Tj
+-426 TJm
+(\() 5.9778 Tj
+-425 TJm
+(8) 5.9778 Tj
+-426 TJm
+(x) 5.9778 Tj
+-426 TJm
+(block) 29.889 Tj
+-426 TJm
+(size) 23.9112 Tj
+-426 TJm
+(\)) 5.9778 Tj
+90 275.22 Td
+(Decompression:) 83.6892 Tj
+-426 TJm
+(100k) 23.9112 Tj
+-426 TJm
+(+) 5.9778 Tj
+-426 TJm
+(\() 5.9778 Tj
+-425 TJm
+(4) 5.9778 Tj
+-426 TJm
+(x) 5.9778 Tj
+-426 TJm
+(block) 29.889 Tj
+-426 TJm
+(size) 23.9112 Tj
+-426 TJm
+(\),) 11.9556 Tj
+-426 TJm
+(or) 11.9556 Tj
+153.66 263.265 Td
+(100k) 23.9112 Tj
+-426 TJm
+(+) 5.9778 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(2.5) 17.9334 Tj
+-426 TJm
+(x) 5.9778 Tj
+-426 TJm
+(block) 29.889 Tj
+-426 TJm
+(s) 5.9778 Tj
+1 TJm
+(ize) 17.9334 Tj
+-426 TJm
+(\)) 5.9778 Tj
+[1 0 0 1 72 247.723] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -237.761] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 225.805 Td
+/F128_0 9.963 Tf
+(Lar) 13.8286 Tj
+18 TJm
+(ger) 12.7228 Tj
+-292 TJm
+(block) 22.1378 Tj
+-291 TJm
+(sizes) 19.3681 Tj
+-292 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-292 TJm
+(rapidly) 28.2252 Tj
+-291 TJm
+(diminishing) 47.6132 Tj
+-292 TJm
+(mar) 15.4925 Tj
+18 TJm
+(ginal) 19.926 Tj
+-291 TJm
+(returns.) 30.158 Tj
+-871 TJm
+(Most) 20.4839 Tj
+-292 TJm
+(of) 8.29918 Tj
+-291 TJm
+(the) 12.1748 Tj
+-292 TJm
+(compression) 50.363 Tj
+-292 TJm
+(com) 17.1563 Tj
+1 TJm
+(es) 8.29918 Tj
+-292 TJm
+(from) 19.3681 Tj
+-292 TJm
+(the) 12.1748 Tj
+-292 TJm
+(\002rst) 15.5024 Tj
+-291 TJm
+(tw) 9.963 Tj
+10 TJm
+(o) 4.9815 Tj
+-292 TJm
+(or) 8.29918 Tj
+72 213.85 Td
+(three) 19.916 Tj
+-232 TJm
+(hundred) 32.6488 Tj
+-232 TJm
+(k) 4.9815 Tj
+-232 TJm
+(o) 4.9815 Tj
+1 TJm
+(f) 3.31768 Tj
+-232 TJm
+(block) 22.1378 Tj
+-232 TJm
+(size,) 17.9832 Tj
+-236 TJm
+(a) 4.42357 Tj
+-232 TJm
+(f) 3.31768 Tj
+10 TJm
+(a) 4.42357 Tj
+1 TJm
+(ct) 7.19329 Tj
+-232 TJm
+(w) 7.19329 Tj
+10 TJm
+(orth) 16.0504 Tj
+-232 TJm
+(bearing) 29.879 Tj
+-232 TJm
+(in) 7.75121 Tj
+-232 TJm
+(mind) 20.4839 Tj
+-232 TJm
+(when) 21.5799 Tj
+-231 TJm
+(using) 21.5898 Tj
+[1 0 0 1 354.025 213.85] cm
+0 g
+0 G
+[1 0 0 1 -354.025 -213.85] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+354.025 213.85 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 383.913 213.85] cm
+0 g
+0 G
+[1 0 0 1 -383.913 -213.85] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+386.223 213.85 Td
+/F128_0 9.963 Tf
+(on) 9.963 Tj
+-232 TJm
+(small) 21.5898 Tj
+-232 TJm
+(machines.) 40.121 Tj
+-303 TJm
+(It) 6.08739 Tj
+-232 TJm
+(is) 6.64532 Tj
+-232 TJm
+(also) 16.0504 Tj
+-232 TJm
+(important) 38.7461 Tj
+72 201.895 Td
+(to) 7.75121 Tj
+-250 TJm
+(appreciate) 40.938 Tj
+-250 TJm
+(that) 14.9445 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(decom) 26.5614 Tj
+1 TJm
+(pression) 33.2067 Tj
+-250 TJm
+(memory) 33.2067 Tj
+-250 TJm
+(requirement) 48.1412 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(set) 11.0689 Tj
+-250 TJm
+(at) 7.19329 Tj
+-250 TJm
+(compression) 50.363 Tj
+-250 TJm
+(ti) 5.53943 Tj
+1 TJm
+(me) 12.1748 Tj
+-250 TJm
+(by) 9.963 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(choice) 26.0034 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(block) 22.1378 Tj
+-250 TJm
+(size.) 17.9832 Tj
+[1 0 0 1 72 199.738] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -189.776] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 179.977 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-388 TJm
+(\002les) 16.6083 Tj
+-389 TJm
+(compressed) 47.0353 Tj
+-388 TJm
+(with) 17.7142 Tj
+-388 TJm
+(the) 12.1748 Tj
+-389 TJm
+(def) 12.7228 Tj
+10 TJm
+(ault) 14.9445 Tj
+-388 TJm
+(900k) 19.926 Tj
+-388 TJm
+(block) 22.1378 Tj
+-389 TJm
+(size,) 17.9832 Tj
+[1 0 0 1 302.002 179.977] cm
+0 g
+0 G
+[1 0 0 1 -302.002 -179.977] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+302.002 179.977 Td
+/F130_0 9.963 Tf
+(bunzip2) 41.8446 Tj
+[1 0 0 1 343.845 179.977] cm
+0 g
+0 G
+[1 0 0 1 -343.845 -179.977] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+347.716 179.977 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-388 TJm
+(require) 28.2152 Tj
+-389 TJm
+(about) 22.1378 Tj
+-388 TJm
+(3700) 19.926 Tj
+-388 TJm
+(kbytes) 26.0134 Tj
+-389 TJm
+(to) 7.75121 Tj
+-388 TJm
+(decompress.) 49.5261 Tj
+72 168.022 Td
+(T) 6.08739 Tj
+80 TJm
+(o) 4.9815 Tj
+-424 TJm
+(support) 29.889 Tj
+-424 TJm
+(decompression) 59.768 Tj
+-424 TJm
+(of) 8.29918 Tj
+-425 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-424 TJm
+(\002le) 12.7327 Tj
+-424 TJm
+(on) 9.963 Tj
+-424 TJm
+(a) 4.42357 Tj
+-425 TJm
+(4) 4.9815 Tj
+-424 TJm
+(me) 12.1748 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(abyte) 21.5799 Tj
+-424 TJm
+(machine,) 36.2454 Tj
+[1 0 0 1 348.272 168.022] cm
+0 g
+0 G
+[1 0 0 1 -348.272 -168.022] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+348.272 168.022 Td
+/F130_0 9.963 Tf
+(bunzip2) 41.8446 Tj
+[1 0 0 1 390.115 168.022] cm
+0 g
+0 G
+[1 0 0 1 -390.115 -168.022] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+394.342 168.022 Td
+/F128_0 9.963 Tf
+(has) 13.2807 Tj
+-424 TJm
+(an) 9.40507 Tj
+-424 TJm
+(option) 25.4654 Tj
+-425 TJm
+(to) 7.75121 Tj
+-424 TJm
+(decompress) 47.0353 Tj
+-424 TJm
+(using) 21.5898 Tj
+72 156.067 Td
+(approximately) 57.5563 Tj
+-281 TJm
+(ha) 9.40507 Tj
+1 TJm
+(lf) 6.08739 Tj
+-281 TJm
+(this) 14.3965 Tj
+-281 TJm
+(amount) 29.889 Tj
+-281 TJm
+(of) 8.29918 Tj
+-280 TJm
+(memory) 33.2067 Tj
+65 TJm
+(,) 2.49075 Tj
+-289 TJm
+(about) 22.1378 Tj
+-280 TJm
+(2300) 19.926 Tj
+-281 TJm
+(kbytes.) 28.5041 Tj
+-805 TJm
+(Decom) 28.7731 Tj
+1 TJm
+(pression) 33.2067 Tj
+-281 TJm
+(speed) 22.6858 Tj
+-281 TJm
+(is) 6.64532 Tj
+-281 TJm
+(a) 4.42357 Tj
+1 TJm
+(lso) 11.6268 Tj
+-281 TJm
+(halv) 17.1563 Tj
+15 TJm
+(ed,) 11.8958 Tj
+-289 TJm
+(so) 8.85711 Tj
+-280 TJm
+(you) 14.9445 Tj
+-281 TJm
+(should) 26.5713 Tj
+72 144.112 Td
+(use) 13.2807 Tj
+-250 TJm
+(this) 14.3965 Tj
+-250 TJm
+(option) 25.4654 Tj
+-250 TJm
+(only) 17.7142 Tj
+-250 TJm
+(where) 24.3396 Tj
+-250 TJm
+(nec) 13.8286 Tj
+1 TJm
+(essary) 24.8975 Tj
+65 TJm
+(.) 2.49075 Tj
+-620 TJm
+(The) 15.4925 Tj
+-250 TJm
+(rele) 14.9345 Tj
+25 TJm
+(v) 4.9815 Tj
+25 TJm
+(ant) 12.1748 Tj
+-250 TJm
+(\003ag) 14.9445 Tj
+-250 TJm
+(is) 6.64532 Tj
+[1 0 0 1 305.024 144.112] cm
+0 g
+0 G
+[1 0 0 1 -305.024 -144.112] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+305.024 144.112 Td
+/F130_0 9.963 Tf
+(-s) 11.9556 Tj
+[1 0 0 1 316.979 144.112] cm
+0 g
+0 G
+[1 0 0 1 -316.979 -144.112] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+316.979 144.112 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 141.955] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -131.992] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 122.194 Td
+/F128_0 9.963 Tf
+(In) 8.29918 Tj
+-204 TJm
+(general,) 31.8119 Tj
+-214 TJm
+(try) 11.0689 Tj
+-204 TJm
+(and) 14.3866 Tj
+-204 TJm
+(use) 13.2807 Tj
+-205 TJm
+(the) 12.1748 Tj
+-204 TJm
+(lar) 10.511 Tj
+18 TJm
+(gest) 16.0504 Tj
+-204 TJm
+(block) 22.1378 Tj
+-205 TJm
+(size) 15.4925 Tj
+-204 TJm
+(memory) 33.2067 Tj
+-204 TJm
+(constraints) 43.1697 Tj
+-204 TJm
+(allo) 14.9445 Tj
+25 TJm
+(w) 7.19329 Tj
+65 TJm
+(,) 2.49075 Tj
+-214 TJm
+(since) 20.474 Tj
+-204 TJm
+(that) 14.9445 Tj
+-204 TJm
+(maximises) 42.6217 Tj
+-205 TJm
+(the) 12.1748 Tj
+-204 TJm
+(compression) 50.363 Tj
+-204 TJm
+(achie) 21.0219 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ed.) 11.8958 Tj
+72 110.239 Td
+(Compression) 52.5847 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(decompress) 47.0353 Tj
+1 TJm
+(ion) 12.7327 Tj
+-250 TJm
+(speed) 22.6858 Tj
+-250 TJm
+(are) 12.1648 Tj
+-250 TJm
+(virtually) 33.7646 Tj
+-250 TJm
+(unaf) 17.7043 Tj
+25 TJm
+(fected) 24.3396 Tj
+-250 TJm
+(by) 9.963 Tj
+-250 TJm
+(block) 22.1378 Tj
+-250 TJm
+(size.) 17.9832 Tj
+[1 0 0 1 72 108.082] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -98.119] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 88.321 Td
+/F128_0 9.963 Tf
+(Another) 32.6488 Tj
+-296 TJm
+(signi\002cant) 41.5158 Tj
+-295 TJm
+(point) 20.4839 Tj
+-296 TJm
+(applies) 28.2252 Tj
+-296 TJm
+(to) 7.75121 Tj
+-296 TJm
+(\002les) 16.6083 Tj
+-295 TJm
+(which) 24.3496 Tj
+-296 TJm
+(\002t) 8.30914 Tj
+-296 TJm
+(in) 7.75121 Tj
+-296 TJm
+(a) 4.42357 Tj
+-296 TJm
+(s) 3.87561 Tj
+1 TJm
+(ingle) 19.926 Tj
+-296 TJm
+(block) 22.1378 Tj
+-296 TJm
+(--) 6.63536 Tj
+-296 TJm
+(that) 14.9445 Tj
+-296 TJm
+(mea) 16.5984 Tj
+1 TJm
+(ns) 8.85711 Tj
+-296 TJm
+(most) 19.378 Tj
+-296 TJm
+(\002les) 16.6083 Tj
+-296 TJm
+(you') 18.2622 Tj
+50 TJm
+(d) 4.9815 Tj
+-296 TJm
+(enc) 13.8286 Tj
+1 TJm
+(ounter) 25.4555 Tj
+-296 TJm
+(using) 21.5898 Tj
+-296 TJm
+(a) 4.42357 Tj
+72 76.366 Td
+(lar) 10.511 Tj
+18 TJm
+(ge) 9.40507 Tj
+-290 TJm
+(block) 22.1378 Tj
+-290 TJm
+(size) 15.4925 Tj
+1 TJm
+(.) 2.49075 Tj
+-860 TJm
+(The) 15.4925 Tj
+-290 TJm
+(amou) 22.1378 Tj
+1 TJm
+(nt) 7.75121 Tj
+-290 TJm
+(of) 8.29918 Tj
+-290 TJm
+(real) 14.9345 Tj
+-290 TJm
+(memory) 33.2067 Tj
+-290 TJm
+(touched) 31.5429 Tj
+-289 TJm
+(is) 6.64532 Tj
+-290 TJm
+(proportional) 49.2571 Tj
+-290 TJm
+(to) 7.75121 Tj
+-290 TJm
+(the) 12.1748 Tj
+-290 TJm
+(size) 15.4925 Tj
+-289 TJm
+(of) 8.29918 Tj
+-290 TJm
+(the) 12.1748 Tj
+-290 TJm
+(\002le,) 15.2235 Tj
+-300 TJm
+(since) 20.474 Tj
+-290 TJm
+(the) 12.1748 Tj
+-289 TJm
+(\002le) 12.7327 Tj
+-290 TJm
+(is) 6.64532 Tj
+-290 TJm
+(smaller) 29.3311 Tj
+[1 0 0 1 72 50.852] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 43.063 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -496.332 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+539.395 50.951 Td
+/F128_0 9.963 Tf
+(5) 4.9815 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 9 9
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 105.519 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -371.59 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+477.109 749.245 Td
+/F128_0 9.963 Tf
+(Ho) 12.1748 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(bzip2) 22.1378 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -540 -741.554] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(than) 17.1563 Tj
+-362 TJm
+(a) 4.42357 Tj
+-362 TJm
+(block.) 24.6285 Tj
+-1292 TJm
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-362 TJm
+(e) 4.42357 Tj
+15 TJm
+(xample,) 31.8218 Tj
+-390 TJm
+(compressing) 50.363 Tj
+-362 TJm
+(a) 4.42357 Tj
+-362 TJm
+(\002le) 12.7327 Tj
+-362 TJm
+(20,000) 27.3983 Tj
+-362 TJm
+(bytes) 21.0319 Tj
+-362 TJm
+(long) 17.7142 Tj
+-362 TJm
+(with) 17.7142 Tj
+-362 TJm
+(the) 12.1748 Tj
+-362 TJm
+(\003ag) 14.9445 Tj
+[1 0 0 1 406.528 710.037] cm
+0 g
+0 G
+[1 0 0 1 -406.528 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+406.528 710.037 Td
+/F130_0 9.963 Tf
+(-9) 11.9556 Tj
+[1 0 0 1 418.483 710.037] cm
+0 g
+0 G
+[1 0 0 1 -418.483 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+422.091 710.037 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-362 TJm
+(cause) 22.1278 Tj
+-362 TJm
+(the) 12.1748 Tj
+-362 TJm
+(compressor) 45.9294 Tj
+-362 TJm
+(to) 7.75121 Tj
+72 698.082 Td
+(allocate) 30.9849 Tj
+-271 TJm
+(around) 27.6673 Tj
+-272 TJm
+(7600k) 24.9075 Tj
+-271 TJm
+(of) 8.29918 Tj
+-272 TJm
+(m) 7.75121 Tj
+1 TJm
+(emory) 25.4555 Tj
+65 TJm
+(,) 2.49075 Tj
+-277 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-272 TJm
+(only) 17.7142 Tj
+-271 TJm
+(touch) 22.1378 Tj
+-271 TJm
+(400k) 19.926 Tj
+-272 TJm
+(+) 5.61913 Tj
+-271 TJm
+(20000) 24.9075 Tj
+-272 TJm
+(*) 4.9815 Tj
+-271 TJm
+(8) 4.9815 Tj
+-272 TJm
+(=) 5.61913 Tj
+-271 TJm
+(560) 14.9445 Tj
+-271 TJm
+(kbytes) 26.0134 Tj
+-272 TJm
+(of) 8.29918 Tj
+-271 TJm
+(it.) 8.03018 Tj
+-749 TJm
+(Similarly) 37.0922 Tj
+65 TJm
+(,) 2.49075 Tj
+-277 TJm
+(the) 12.1748 Tj
+-271 TJm
+(decompressor) 55.3345 Tj
+72 686.127 Td
+(will) 15.5024 Tj
+-250 TJm
+(allocate) 30.9849 Tj
+-250 TJm
+(3700k) 24.9075 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(only) 17.7142 Tj
+-250 TJm
+(t) 2.76971 Tj
+1 TJm
+(ouch) 19.3681 Tj
+-250 TJm
+(100k) 19.926 Tj
+-250 TJm
+(+) 5.61913 Tj
+-250 TJm
+(20000) 24.9075 Tj
+-250 TJm
+(*) 4.9815 Tj
+-250 TJm
+(4) 4.9815 Tj
+-250 TJm
+(=) 5.61913 Tj
+-250 TJm
+(180) 14.9445 Tj
+-250 TJm
+(kbytes.) 28.5041 Tj
+[1 0 0 1 72 683.97] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -674.008] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 664.209 Td
+/F128_0 9.963 Tf
+(Here) 19.3581 Tj
+-293 TJm
+(is) 6.64532 Tj
+-294 TJm
+(a) 4.42357 Tj
+-293 TJm
+(table) 19.3681 Tj
+-294 TJm
+(which) 24.3496 Tj
+-293 TJm
+(summarises) 47.0453 Tj
+-293 TJm
+(the) 12.1748 Tj
+-294 TJm
+(maximu) 32.6587 Tj
+1 TJm
+(m) 7.75121 Tj
+-294 TJm
+(memory) 33.2067 Tj
+-293 TJm
+(usage) 22.6858 Tj
+-294 TJm
+(for) 11.6169 Tj
+-293 TJm
+(dif) 11.0689 Tj
+25 TJm
+(ferent) 23.2337 Tj
+-293 TJm
+(block) 22.1378 Tj
+-294 TJm
+(sizes.) 21.8588 Tj
+-880 TJm
+(Also) 18.8201 Tj
+-294 TJm
+(recorded) 34.8506 Tj
+-293 TJm
+(is) 6.64532 Tj
+-294 TJm
+(the) 12.1748 Tj
+-293 TJm
+(total) 17.7142 Tj
+72 652.254 Td
+(compressed) 47.0353 Tj
+-289 TJm
+(size) 15.4925 Tj
+-289 TJm
+(for) 11.6169 Tj
+-289 TJm
+(14) 9.963 Tj
+-289 TJm
+(\002les) 16.6083 Tj
+-289 TJm
+(of) 8.29918 Tj
+-289 TJm
+(the) 12.1748 Tj
+-289 TJm
+(Calg) 18.8201 Tj
+5 TJm
+(ary) 12.7228 Tj
+-289 TJm
+(T) 6.08739 Tj
+70 TJm
+(e) 4.42357 Tj
+15 TJm
+(xt) 7.75121 Tj
+-289 TJm
+(Compression) 52.5847 Tj
+-289 TJm
+(Corpus) 28.7831 Tj
+-289 TJm
+(totalling) 33.2166 Tj
+-289 TJm
+(3,141,622) 39.852 Tj
+-289 TJm
+(bytes.) 23.5226 Tj
+-855 TJm
+(This) 17.7142 Tj
+-289 TJm
+(column) 29.889 Tj
+-289 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(es) 8.29918 Tj
+72 640.299 Td
+(some) 21.0319 Tj
+-253 TJm
+(feel) 14.9345 Tj
+-253 TJm
+(for) 11.6169 Tj
+-253 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-253 TJm
+(compression) 50.363 Tj
+-253 TJm
+(v) 4.9815 Tj
+25 TJm
+(aries) 18.8101 Tj
+-253 TJm
+(with) 17.7142 Tj
+-253 TJm
+(bl) 7.75121 Tj
+1 TJm
+(ock) 14.3866 Tj
+-253 TJm
+(size.) 17.9832 Tj
+-639 TJm
+(These) 23.7916 Tj
+-253 TJm
+(\002g) 10.5209 Tj
+1 TJm
+(ures) 16.5984 Tj
+-253 TJm
+(tend) 17.1563 Tj
+-253 TJm
+(to) 7.75121 Tj
+-253 TJm
+(understate) 40.9479 Tj
+-253 TJm
+(the) 12.1748 Tj
+-253 TJm
+(adv) 14.3866 Tj
+25 TJm
+(antage) 26.0034 Tj
+-253 TJm
+(of) 8.29918 Tj
+-253 TJm
+(lar) 10.511 Tj
+18 TJm
+(ger) 12.7228 Tj
+-253 TJm
+(block) 22.1378 Tj
+72 628.344 Td
+(sizes) 19.3681 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(lar) 10.511 Tj
+18 TJm
+(ger) 12.7228 Tj
+-250 TJm
+(\002les,) 19.0991 Tj
+-250 TJm
+(since) 20.474 Tj
+-250 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-250 TJm
+(Corpus) 28.7831 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(dominated) 42.0638 Tj
+-250 TJm
+(by) 9.963 Tj
+-250 TJm
+(smaller) 29.3311 Tj
+-250 TJm
+(\002les.) 19.0991 Tj
+[1 0 0 1 72 626.187] cm
+0 g
+0 G
+[1 0 0 1 0 -156.414] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 155.417 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 151.831] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -616.822] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+123.952 616.822 Td
+/F130_0 9.963 Tf
+(Compress) 47.8224 Tj
+-1278 TJm
+(Decompress) 59.778 Tj
+-1277 TJm
+(Decompress) 59.778 Tj
+-1278 TJm
+(Corpus) 35.8668 Tj
+90 604.867 Td
+(Flag) 23.9112 Tj
+-2130 TJm
+(usage) 29.889 Tj
+-2556 TJm
+(us) 11.9556 Tj
+1 TJm
+(age) 17.9334 Tj
+-2982 TJm
+(-s) 11.9556 Tj
+-426 TJm
+(usage) 29.889 Tj
+-2130 TJm
+(Size) 23.9112 Tj
+94.244 580.957 Td
+(-1) 11.9556 Tj
+-2556 TJm
+(1200k) 29.889 Tj
+-2982 TJm
+(50) 11.9556 Tj
+1 TJm
+(0k) 11.9556 Tj
+-3834 TJm
+(350k) 23.9112 Tj
+-2556 TJm
+(914704) 35.8668 Tj
+94.244 569.001 Td
+(-2) 11.9556 Tj
+-2556 TJm
+(2000k) 29.889 Tj
+-2982 TJm
+(90) 11.9556 Tj
+1 TJm
+(0k) 11.9556 Tj
+-3834 TJm
+(600k) 23.9112 Tj
+-2556 TJm
+(877703) 35.8668 Tj
+94.244 557.046 Td
+(-3) 11.9556 Tj
+-2556 TJm
+(2800k) 29.889 Tj
+-2556 TJm
+(130) 17.9334 Tj
+1 TJm
+(0k) 11.9556 Tj
+-3834 TJm
+(850k) 23.9112 Tj
+-2556 TJm
+(860338) 35.8668 Tj
+94.244 545.091 Td
+(-4) 11.9556 Tj
+-2556 TJm
+(3600k) 29.889 Tj
+-2556 TJm
+(170) 17.9334 Tj
+1 TJm
+(0k) 11.9556 Tj
+-3408 TJm
+(1100k) 29.889 Tj
+-2556 TJm
+(846899) 35.8668 Tj
+94.244 533.136 Td
+(-5) 11.9556 Tj
+-2556 TJm
+(4400k) 29.889 Tj
+-2556 TJm
+(210) 17.9334 Tj
+1 TJm
+(0k) 11.9556 Tj
+-3408 TJm
+(1350k) 29.889 Tj
+-2556 TJm
+(845160) 35.8668 Tj
+94.244 521.181 Td
+(-6) 11.9556 Tj
+-2556 TJm
+(5200k) 29.889 Tj
+-2556 TJm
+(250) 17.9334 Tj
+1 TJm
+(0k) 11.9556 Tj
+-3408 TJm
+(1600k) 29.889 Tj
+-2556 TJm
+(838626) 35.8668 Tj
+94.244 509.225 Td
+(-7) 11.9556 Tj
+-2556 TJm
+(6100k) 29.889 Tj
+-2556 TJm
+(290) 17.9334 Tj
+1 TJm
+(0k) 11.9556 Tj
+-3408 TJm
+(1850k) 29.889 Tj
+-2556 TJm
+(834096) 35.8668 Tj
+94.244 497.27 Td
+(-8) 11.9556 Tj
+-2556 TJm
+(6800k) 29.889 Tj
+-2556 TJm
+(330) 17.9334 Tj
+1 TJm
+(0k) 11.9556 Tj
+-3408 TJm
+(2100k) 29.889 Tj
+-2556 TJm
+(828642) 35.8668 Tj
+94.244 485.315 Td
+(-9) 11.9556 Tj
+-2556 TJm
+(7600k) 29.889 Tj
+-2556 TJm
+(370) 17.9334 Tj
+1 TJm
+(0k) 11.9556 Tj
+-3408 TJm
+(2350k) 29.889 Tj
+-2556 TJm
+(828642) 35.8668 Tj
+[1 0 0 1 72 469.773] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -459.811] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 435.021 Td
+/F121_0 20.659 Tf
+(2.6.) 34.4592 Tj
+-939 TJm
+(RECO) 59.6839 Tj
+50 TJm
+(VERING) 79.2066 Tj
+-939 TJm
+(D) 14.9158 Tj
+40 TJm
+(A) 14.9158 Tj
+90 TJm
+(T) 12.6226 Tj
+90 TJm
+(A) 14.9158 Tj
+-939 TJm
+(FR) 27.5384 Tj
+20 TJm
+(OM) 33.2816 Tj
+-939 TJm
+(D) 14.9158 Tj
+40 TJm
+(AMA) 47.0405 Tj
+50 TJm
+(GED) 44.7681 Tj
+72 410.23 Td
+(FILES) 58.5476 Tj
+[1 0 0 1 72 409.972] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -400.01] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 388.313 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 388.313] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -388.313] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+105.138 388.313 Td
+/F128_0 9.963 Tf
+(compresses) 45.9294 Tj
+-326 TJm
+(\002les) 16.6083 Tj
+-326 TJm
+(in) 7.75121 Tj
+-326 TJm
+(blocks,) 28.5041 Tj
+-345 TJm
+(usually) 28.7831 Tj
+-326 TJm
+(900kbytes) 40.9579 Tj
+-326 TJm
+(long.) 20.205 Tj
+-1077 TJm
+(Each) 19.916 Tj
+-326 TJm
+(block) 22.1378 Tj
+-326 TJm
+(is) 6.64532 Tj
+-327 TJm
+(handle) 26.5614 Tj
+1 TJm
+(d) 4.9815 Tj
+-327 TJm
+(independe) 40.9479 Tj
+1 TJm
+(ntly) 15.5024 Tj
+65 TJm
+(.) 2.49075 Tj
+-1077 TJm
+(If) 6.63536 Tj
+-327 TJm
+(a) 4.42357 Tj
+-326 TJm
+(media) 24.3496 Tj
+-326 TJm
+(or) 8.29918 Tj
+72 376.357 Td
+(transmission) 50.3729 Tj
+-318 TJm
+(error) 19.3581 Tj
+-319 TJm
+(causes) 26.0034 Tj
+-318 TJm
+(a) 4.42357 Tj
+-319 TJm
+(multi-block) 46.4973 Tj
+[1 0 0 1 234.519 376.357] cm
+0 g
+0 G
+[1 0 0 1 -234.519 -376.357] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+234.519 376.357 Td
+/F130_0 9.963 Tf
+(.bz2) 23.9112 Tj
+[1 0 0 1 258.429 376.357] cm
+0 g
+0 G
+[1 0 0 1 -258.429 -376.357] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+261.603 376.357 Td
+/F128_0 9.963 Tf
+(\002le) 12.7327 Tj
+-319 TJm
+(to) 7.75121 Tj
+-318 TJm
+(become) 30.9849 Tj
+-319 TJm
+(da) 9.40507 Tj
+1 TJm
+(maged,) 29.0521 Tj
+-336 TJm
+(it) 5.53943 Tj
+-319 TJm
+(may) 17.1563 Tj
+-318 TJm
+(be) 9.40507 Tj
+-319 TJm
+(possible) 32.6587 Tj
+-318 TJm
+(to) 7.75121 Tj
+-319 TJm
+(reco) 17.1463 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-318 TJm
+(data) 16.5984 Tj
+-319 TJm
+(from) 19.3681 Tj
+-318 TJm
+(the) 12.1748 Tj
+72 364.402 Td
+(undamaged) 45.9294 Tj
+-250 TJm
+(blocks) 26.0134 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(\002le.) 15.2235 Tj
+[1 0 0 1 72 362.245] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -352.283] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 342.484 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-358 TJm
+(com) 17.1563 Tj
+1 TJm
+(pressed) 29.879 Tj
+-358 TJm
+(representation) 56.4404 Tj
+-357 TJm
+(of) 8.29918 Tj
+-358 TJm
+(each) 18.2522 Tj
+-357 TJm
+(block) 22.1378 Tj
+-358 TJm
+(is) 6.64532 Tj
+-357 TJm
+(delimited) 37.6402 Tj
+-358 TJm
+(by) 9.963 Tj
+-357 TJm
+(a) 4.42357 Tj
+-358 TJm
+(48-bit) 23.8016 Tj
+-357 TJm
+(pattern,) 30.158 Tj
+-385 TJm
+(which) 24.3496 Tj
+-357 TJm
+(mak) 17.1563 Tj
+10 TJm
+(es) 8.29918 Tj
+-358 TJm
+(it) 5.53943 Tj
+-357 TJm
+(possible) 32.6587 Tj
+-358 TJm
+(to) 7.75121 Tj
+-357 TJm
+(\002nd) 15.5024 Tj
+-358 TJm
+(the) 12.1748 Tj
+72 330.529 Td
+(block) 22.1378 Tj
+-286 TJm
+(boundaries) 43.7176 Tj
+-285 TJm
+(with) 17.7142 Tj
+-286 TJm
+(reasonable) 42.6018 Tj
+-285 TJm
+(certainty) 34.8605 Tj
+65 TJm
+(.) 2.49075 Tj
+-835 TJm
+(Each) 19.916 Tj
+-286 TJm
+(block) 22.1378 Tj
+-285 TJm
+(also) 16.0504 Tj
+-286 TJm
+(carries) 26.5514 Tj
+-286 TJm
+(its) 9.41504 Tj
+-285 TJm
+(o) 4.9815 Tj
+25 TJm
+(wn) 12.1748 Tj
+-286 TJm
+(32-bit) 23.8016 Tj
+-286 TJm
+(CRC,) 22.4267 Tj
+-285 TJm
+(so) 8.85711 Tj
+-286 TJm
+(damaged) 35.9664 Tj
+-286 TJm
+(blocks) 26.0134 Tj
+-285 TJm
+(can) 13.8286 Tj
+-286 TJm
+(be) 9.40507 Tj
+72 318.574 Td
+(distinguished) 53.1426 Tj
+-250 TJm
+(from) 19.3681 Tj
+-250 TJm
+(undamage) 40.9479 Tj
+1 TJm
+(d) 4.9815 Tj
+-250 TJm
+(ones.) 20.7529 Tj
+[1 0 0 1 72 316.417] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -306.455] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 296.656 Td
+/F130_0 9.963 Tf
+(bzip2recover) 71.7336 Tj
+[1 0 0 1 143.731 296.656] cm
+0 g
+0 G
+[1 0 0 1 -143.731 -296.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+146.448 296.656 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-273 TJm
+(a) 4.42357 Tj
+-272 TJm
+(simple) 26.5713 Tj
+-273 TJm
+(program) 33.7546 Tj
+-272 TJm
+(whose) 25.4555 Tj
+-273 TJm
+(purpose) 31.5429 Tj
+-273 TJm
+(i) 2.76971 Tj
+1 TJm
+(s) 3.87561 Tj
+-273 TJm
+(to) 7.75121 Tj
+-273 TJm
+(search) 25.4455 Tj
+-272 TJm
+(for) 11.6169 Tj
+-273 TJm
+(blocks) 26.0134 Tj
+-273 TJm
+(in) 7.75121 Tj
+[1 0 0 1 392.655 296.656] cm
+0 g
+0 G
+[1 0 0 1 -392.655 -296.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+392.655 296.656 Td
+/F130_0 9.963 Tf
+(.bz2) 23.9112 Tj
+[1 0 0 1 416.566 296.656] cm
+0 g
+0 G
+[1 0 0 1 -416.566 -296.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+419.282 296.656 Td
+/F128_0 9.963 Tf
+(\002les,) 19.0991 Tj
+-278 TJm
+(and) 14.3866 Tj
+-273 TJm
+(write) 20.474 Tj
+-273 TJm
+(e) 4.42357 Tj
+1 TJm
+(ach) 13.8286 Tj
+-273 TJm
+(block) 22.1378 Tj
+-273 TJm
+(out) 12.7327 Tj
+72 284.701 Td
+(into) 15.5024 Tj
+-254 TJm
+(its) 9.41504 Tj
+-255 TJm
+(o) 4.9815 Tj
+25 TJm
+(wn) 12.1748 Tj
+[1 0 0 1 121.429 284.701] cm
+0 g
+0 G
+[1 0 0 1 -121.429 -284.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+121.429 284.701 Td
+/F130_0 9.963 Tf
+(.bz2) 23.9112 Tj
+[1 0 0 1 145.34 284.701] cm
+0 g
+0 G
+[1 0 0 1 -145.34 -284.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+147.875 284.701 Td
+/F128_0 9.963 Tf
+(\002le.) 15.2235 Tj
+-647 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-254 TJm
+(can) 13.8286 Tj
+-255 TJm
+(then) 17.1563 Tj
+-254 TJm
+(use) 13.2807 Tj
+[1 0 0 1 240.01 284.701] cm
+0 g
+0 G
+[1 0 0 1 -240.01 -284.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+240.01 284.701 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+-600 TJm
+(-t) 11.9556 Tj
+[1 0 0 1 287.831 284.701] cm
+0 g
+0 G
+[1 0 0 1 -287.831 -284.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+290.367 284.701 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-254 TJm
+(test) 13.8386 Tj
+-255 TJm
+(the) 12.1748 Tj
+-254 TJm
+(inte) 14.9445 Tj
+15 TJm
+(grity) 18.8201 Tj
+-255 TJm
+(of) 8.29918 Tj
+-254 TJm
+(the) 12.1748 Tj
+-255 TJm
+(res) 11.6169 Tj
+1 TJm
+(ulting) 23.2536 Tj
+-255 TJm
+(\002les,) 19.0991 Tj
+-255 TJm
+(and) 14.3866 Tj
+-255 TJm
+(decompress) 47.0353 Tj
+-254 TJm
+(those) 21.0319 Tj
+72 272.746 Td
+(which) 24.3496 Tj
+-250 TJm
+(are) 12.1648 Tj
+-250 TJm
+(undamaged.) 48.4202 Tj
+[1 0 0 1 72 270.589] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -260.626] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 250.828 Td
+/F130_0 9.963 Tf
+(bzip2recover) 71.7336 Tj
+[1 0 0 1 143.731 250.828] cm
+0 g
+0 G
+[1 0 0 1 -143.731 -250.828] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+150.099 250.828 Td
+/F128_0 9.963 Tf
+(tak) 12.1748 Tj
+10 TJm
+(es) 8.29918 Tj
+-639 TJm
+(a) 4.42357 Tj
+-639 TJm
+(single) 23.8016 Tj
+-639 TJm
+(ar) 7.74125 Tj
+18 TJm
+(gument,) 32.3798 Tj
+-736 TJm
+(the) 12.1748 Tj
+-639 TJm
+(name) 21.5799 Tj
+-639 TJm
+(of) 8.29918 Tj
+-639 TJm
+(the) 12.1748 Tj
+-640 TJm
+(da) 9.40507 Tj
+1 TJm
+(maged) 26.5614 Tj
+-640 TJm
+(\002) 5.53943 Tj
+1 TJm
+(le,) 9.68404 Tj
+-737 TJm
+(and) 14.3866 Tj
+-639 TJm
+(writes) 24.3496 Tj
+-639 TJm
+(a) 4.42357 Tj
+-639 TJm
+(number) 30.437 Tj
+-639 TJm
+(of) 8.29918 Tj
+-639 TJm
+(\002les) 16.6083 Tj
+[1 0 0 1 72 238.873] cm
+0 g
+0 G
+[1 0 0 1 -72 -238.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 238.873 Td
+/F130_0 9.963 Tf
+(rec0001file.bz2) 89.667 Tj
+[1 0 0 1 161.664 238.873] cm
+0 g
+0 G
+[1 0 0 1 -161.664 -238.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+161.664 238.873 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 169.072 238.873] cm
+0 g
+0 G
+[1 0 0 1 -169.072 -238.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+169.072 238.873 Td
+/F130_0 9.963 Tf
+(rec0002file.bz2) 89.667 Tj
+[1 0 0 1 258.736 238.873] cm
+0 g
+0 G
+[1 0 0 1 -258.736 -238.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+258.736 238.873 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-494 TJm
+(etc,) 14.1076 Tj
+-493 TJm
+(containing) 42.0638 Tj
+-445 TJm
+(the) 12.1748 Tj
+-445 TJm
+(e) 4.42357 Tj
+15 TJm
+(xtracted) 32.0908 Tj
+-444 TJm
+(blocks.) 28.5041 Tj
+-1790 TJm
+(The) 15.4925 Tj
+-444 TJm
+(output) 25.4654 Tj
+-445 TJm
+(\002lenames) 38.1882 Tj
+-445 TJm
+(are) 12.1648 Tj
+72 226.918 Td
+(designed) 35.4185 Tj
+-337 TJm
+(so) 8.85711 Tj
+-337 TJm
+(that) 14.9445 Tj
+-336 TJm
+(the) 12.1748 Tj
+-337 TJm
+(use) 13.2807 Tj
+-337 TJm
+(of) 8.29918 Tj
+-337 TJm
+(wildcards) 38.7361 Tj
+-337 TJm
+(in) 7.75121 Tj
+-337 TJm
+(subsequent) 44.2756 Tj
+-336 TJm
+(processing) 42.6118 Tj
+-337 TJm
+(--) 6.63536 Tj
+-337 TJm
+(for) 11.6169 Tj
+-337 TJm
+(e) 4.42357 Tj
+15 TJm
+(xample,) 31.8218 Tj
+[1 0 0 1 396.538 226.918] cm
+0 g
+0 G
+[1 0 0 1 -396.538 -226.918] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+396.538 226.918 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+-600 TJm
+(-dc) 17.9334 Tj
+-600 TJm
+(rec*file.bz2) 71.7336 Tj
+-600 TJm
+(>) 5.9778 Tj
+72 214.963 Td
+(recovered_data) 83.6892 Tj
+[1 0 0 1 155.686 214.963] cm
+0 g
+0 G
+[1 0 0 1 -155.686 -214.963] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+158.177 214.963 Td
+/F128_0 9.963 Tf
+(--) 6.63536 Tj
+-250 TJm
+(lists) 16.0604 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(\002les) 16.6083 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(corr) 16.0404 Tj
+1 TJm
+(ect) 11.6169 Tj
+-250 TJm
+(order) 21.0219 Tj
+55 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 213.797] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -203.834] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 193.045 Td
+/F130_0 9.963 Tf
+(bzip2recover) 71.7336 Tj
+[1 0 0 1 143.731 193.045] cm
+0 g
+0 G
+[1 0 0 1 -143.731 -193.045] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+145.93 193.045 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-221 TJm
+(be) 9.40507 Tj
+-220 TJm
+(of) 8.29918 Tj
+-221 TJm
+(most) 19.378 Tj
+-220 TJm
+(use) 13.2807 Tj
+-221 TJm
+(dealing) 29.3311 Tj
+-221 TJm
+(with) 17.7142 Tj
+-220 TJm
+(lar) 10.511 Tj
+18 TJm
+(ge) 9.40507 Tj
+[1 0 0 1 307.229 193.045] cm
+0 g
+0 G
+[1 0 0 1 -307.229 -193.045] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+307.229 193.045 Td
+/F130_0 9.963 Tf
+(.bz2) 23.9112 Tj
+[1 0 0 1 331.14 193.045] cm
+0 g
+0 G
+[1 0 0 1 -331.14 -193.045] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+333.338 193.045 Td
+/F128_0 9.963 Tf
+(\002les,) 19.0991 Tj
+-226 TJm
+(as) 8.29918 Tj
+-221 TJm
+(these) 20.474 Tj
+-221 TJm
+(will) 15.5024 Tj
+-220 TJm
+(contain) 29.3311 Tj
+-221 TJm
+(man) 17.1563 Tj
+15 TJm
+(y) 4.9815 Tj
+-221 TJm
+(b) 4.9815 Tj
+1 TJm
+(locks.) 23.5226 Tj
+-601 TJm
+(It) 6.08739 Tj
+-220 TJm
+(is) 6.64532 Tj
+-221 TJm
+(clearly) 27.1093 Tj
+72 181.09 Td
+(futile) 21.0319 Tj
+-289 TJm
+(to) 7.75121 Tj
+-289 TJm
+(use) 13.2807 Tj
+-289 TJm
+(it) 5.53943 Tj
+-289 TJm
+(on) 9.963 Tj
+-289 TJm
+(damaged) 35.9664 Tj
+-289 TJm
+(single-block) 49.2571 Tj
+-289 TJm
+(\002les,) 19.0991 Tj
+-299 TJm
+(since) 20.474 Tj
+-289 TJm
+(a) 4.42357 Tj
+-289 TJm
+(damaged) 35.9664 Tj
+-289 TJm
+(block) 22.1378 Tj
+-289 TJm
+(cannot) 26.5614 Tj
+-289 TJm
+(be) 9.40507 Tj
+-289 TJm
+(reco) 17.1463 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(ered) 17.1463 Tj
+1 TJm
+(.) 2.49075 Tj
+-855 TJm
+(If) 6.63536 Tj
+-289 TJm
+(you) 14.9445 Tj
+-289 TJm
+(wish) 18.8201 Tj
+-289 TJm
+(to) 7.75121 Tj
+-289 TJm
+(minimise) 37.0922 Tj
+72 169.134 Td
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-320 TJm
+(potential) 34.8705 Tj
+-319 TJm
+(data) 16.5984 Tj
+-320 TJm
+(loss) 15.5024 Tj
+-320 TJm
+(through) 30.9949 Tj
+-319 TJm
+(media) 24.3496 Tj
+-320 TJm
+(or) 8.29918 Tj
+-320 TJm
+(transmission) 50.3729 Tj
+-319 TJm
+(errors,) 25.7245 Tj
+-337 TJm
+(you) 14.9445 Tj
+-320 TJm
+(might) 23.2536 Tj
+-320 TJm
+(consider) 33.7546 Tj
+-319 TJm
+(compressing) 50.363 Tj
+-320 TJm
+(with) 17.7142 Tj
+-320 TJm
+(a) 4.42357 Tj
+-319 TJm
+(smaller) 29.3311 Tj
+-320 TJm
+(block) 22.1378 Tj
+72 157.179 Td
+(size.) 17.9832 Tj
+[1 0 0 1 72 157.08] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -147.117] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 122.426 Td
+/F121_0 20.659 Tf
+(2.7.) 34.4592 Tj
+-278 TJm
+(PERFORMANCE) 161.822 Tj
+-278 TJm
+(NO) 30.9885 Tj
+40 TJm
+(TES) 40.1818 Tj
+[1 0 0 1 72 122.168] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -112.206] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 100.509 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-304 TJm
+(sorting) 27.6772 Tj
+-305 TJm
+(phase) 22.6858 Tj
+-304 TJm
+(of) 8.29918 Tj
+-305 TJm
+(compression) 50.363 Tj
+-304 TJm
+(g) 4.9815 Tj
+5 TJm
+(athers) 23.7916 Tj
+-305 TJm
+(together) 32.6488 Tj
+-304 TJm
+(similar) 27.6772 Tj
+-304 TJm
+(strings) 26.5713 Tj
+-305 TJm
+(in) 7.75121 Tj
+-304 TJm
+(the) 12.1748 Tj
+-305 TJm
+(\002le.) 15.2235 Tj
+-947 TJm
+(Because) 33.1967 Tj
+-305 TJm
+(of) 8.29918 Tj
+-304 TJm
+(this,) 16.8873 Tj
+-318 TJm
+(\002les) 16.6083 Tj
+-305 TJm
+(contai) 24.3496 Tj
+1 TJm
+(ning) 17.7142 Tj
+-305 TJm
+(v) 4.9815 Tj
+15 TJm
+(ery) 12.7228 Tj
+72 88.553 Td
+(long) 17.7142 Tj
+-286 TJm
+(run) 13.2807 Tj
+1 TJm
+(s) 3.87561 Tj
+-286 TJm
+(of) 8.29918 Tj
+-286 TJm
+(repeated) 33.7447 Tj
+-285 TJm
+(symbols,) 35.7074 Tj
+-295 TJm
+(l) 2.76971 Tj
+1 TJm
+(ik) 7.75121 Tj
+10 TJm
+(e) 4.42357 Tj
+-286 TJm
+("aabaabaabaab) 59.3795 Tj
+-285 TJm
+(...") 11.5372 Tj
+-572 TJm
+(\(repea) 24.8876 Tj
+1 TJm
+(ted) 12.1748 Tj
+-286 TJm
+(se) 8.29918 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(eral) 14.9345 Tj
+-286 TJm
+(hun) 14.9445 Tj
+1 TJm
+(dred) 17.7043 Tj
+-286 TJm
+(times\)) 24.9075 Tj
+-286 TJm
+(m) 7.75121 Tj
+1 TJm
+(ay) 9.40507 Tj
+-286 TJm
+(compress) 37.6303 Tj
+-286 TJm
+(m) 7.75121 Tj
+1 TJm
+(ore) 12.7228 Tj
+-286 TJm
+(slo) 11.6268 Tj
+25 TJm
+(wly) 14.9445 Tj
+72 76.598 Td
+(than) 17.1563 Tj
+-321 TJm
+(normal.) 30.7159 Tj
+-525 TJm
+(V) 7.19329 Tj
+111 TJm
+(ersions) 28.2252 Tj
+-321 TJm
+(0.9.5) 19.926 Tj
+-322 TJm
+(and) 14.3866 Tj
+-322 TJm
+(a) 4.42357 Tj
+1 TJm
+(bo) 9.963 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-322 TJm
+(f) 3.31768 Tj
+10 TJm
+(are) 12.1648 Tj
+-321 TJm
+(much) 22.1378 Tj
+-322 TJm
+(better) 22.6858 Tj
+-321 TJm
+(than) 17.1563 Tj
+-322 TJm
+(pre) 12.7228 Tj
+25 TJm
+(vious) 21.5898 Tj
+-321 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersions) 28.2252 Tj
+-322 TJm
+(in) 7.75121 Tj
+-321 TJm
+(this) 14.3965 Tj
+-322 TJm
+(respect.) 30.706 Tj
+-1049 TJm
+(The) 15.4925 Tj
+-322 TJm
+(ratio) 18.2622 Tj
+-321 TJm
+(between) 33.1967 Tj
+[1 0 0 1 72 50.852] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 43.063 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -496.332 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+539.395 50.951 Td
+/F128_0 9.963 Tf
+(6) 4.9815 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 10 10
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 105.519 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -371.59 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+477.109 749.245 Td
+/F128_0 9.963 Tf
+(Ho) 12.1748 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(bzip2) 22.1378 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -540 -741.554] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(w) 7.19329 Tj
+10 TJm
+(orst-case) 35.4085 Tj
+-289 TJm
+(and) 14.3866 Tj
+-290 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(erage-c) 29.3111 Tj
+1 TJm
+(ase) 12.7228 Tj
+-290 TJm
+(compression) 50.363 Tj
+-289 TJm
+(time) 17.7142 Tj
+-289 TJm
+(is) 6.64532 Tj
+-290 TJm
+(in) 7.75121 Tj
+-289 TJm
+(the) 12.1748 Tj
+-290 TJm
+(re) 7.74125 Tj
+15 TJm
+(gion) 17.7142 Tj
+-289 TJm
+(of) 8.29918 Tj
+-289 TJm
+(10:1.) 20.205 Tj
+-857 TJm
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-289 TJm
+(pre) 12.7228 Tj
+25 TJm
+(vious) 21.5898 Tj
+-290 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersions,) 30.7159 Tj
+-299 TJm
+(this) 14.3965 Tj
+-289 TJm
+(\002gure) 23.2437 Tj
+-290 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-289 TJm
+(more) 20.474 Tj
+72 698.082 Td
+(lik) 10.5209 Tj
+10 TJm
+(e) 4.42357 Tj
+-250 TJm
+(100:1.) 25.1865 Tj
+-620 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-250 TJm
+(can) 13.8286 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(the) 12.1748 Tj
+[1 0 0 1 186.002 698.082] cm
+0 g
+0 G
+[1 0 0 1 -186.002 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+186.002 698.082 Td
+/F130_0 9.963 Tf
+(-vvvv) 29.889 Tj
+[1 0 0 1 215.89 698.082] cm
+0 g
+0 G
+[1 0 0 1 -215.89 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+218.38 698.082 Td
+/F128_0 9.963 Tf
+(option) 25.4654 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(monitor) 31.5528 Tj
+-250 TJm
+(progress) 33.7546 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(g) 4.9815 Tj
+1 TJm
+(reat) 14.9345 Tj
+-250 TJm
+(detail,) 24.6285 Tj
+-250 TJm
+(if) 6.08739 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant.) 14.6655 Tj
+[1 0 0 1 72 695.925] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -685.963] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 676.164 Td
+/F128_0 9.963 Tf
+(Decompression) 61.9798 Tj
+-250 TJm
+(speed) 22.6858 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(unaf) 17.7043 Tj
+26 TJm
+(fected) 24.3396 Tj
+-250 TJm
+(by) 9.963 Tj
+-250 TJm
+(these) 20.474 Tj
+-250 TJm
+(phenomena.) 48.4202 Tj
+[1 0 0 1 72 674.008] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -664.045] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 654.247 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 654.247] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -654.247] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+104.863 654.247 Td
+/F128_0 9.963 Tf
+(usually) 28.7831 Tj
+-298 TJm
+(allocates) 34.8605 Tj
+-299 TJm
+(se) 8.29918 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(eral) 14.9345 Tj
+-298 TJm
+(me) 12.1748 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(abytes) 25.4555 Tj
+-299 TJm
+(of) 8.29918 Tj
+-298 TJm
+(memory) 33.2067 Tj
+-299 TJm
+(to) 7.75121 Tj
+-298 TJm
+(operate) 29.3211 Tj
+-299 TJm
+(in,) 10.242 Tj
+-311 TJm
+(and) 14.3866 Tj
+-298 TJm
+(then) 17.1563 Tj
+-299 TJm
+(char) 17.1463 Tj
+18 TJm
+(ges) 13.2807 Tj
+-298 TJm
+(all) 9.963 Tj
+-299 TJm
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-298 TJm
+(it) 5.53943 Tj
+-299 TJm
+(in) 7.75121 Tj
+-298 TJm
+(a) 4.42357 Tj
+-299 TJm
+(f) 3.31768 Tj
+10 TJm
+(airly) 18.2622 Tj
+-299 TJm
+(r) 3.31768 Tj
+1 TJm
+(andom) 27.1193 Tj
+72 642.291 Td
+(f) 3.31768 Tj
+10 TJm
+(ashion.) 28.5041 Tj
+-743 TJm
+(This) 17.7142 Tj
+-270 TJm
+(means) 25.4555 Tj
+-271 TJm
+(t) 2.76971 Tj
+1 TJm
+(hat) 12.1748 Tj
+-271 TJm
+(performance,) 52.8338 Tj
+-275 TJm
+(both) 17.7142 Tj
+-271 TJm
+(for) 11.6169 Tj
+-270 TJm
+(compressing) 50.363 Tj
+-270 TJm
+(and) 14.3866 Tj
+-271 TJm
+(decompressing,) 62.2588 Tj
+-275 TJm
+(is) 6.64532 Tj
+-271 TJm
+(la) 7.19329 Tj
+1 TJm
+(r) 3.31768 Tj
+18 TJm
+(gely) 17.1563 Tj
+-271 TJm
+(determined) 44.8235 Tj
+-270 TJm
+(by) 9.963 Tj
+-271 TJm
+(the) 12.1748 Tj
+-270 TJm
+(speed) 22.6858 Tj
+72 630.336 Td
+(at) 7.19329 Tj
+-294 TJm
+(which) 24.3496 Tj
+-294 TJm
+(your) 18.2622 Tj
+-294 TJm
+(machine) 33.7546 Tj
+-294 TJm
+(can) 13.8286 Tj
+-294 TJm
+(service) 28.2152 Tj
+-294 TJm
+(cache) 22.6758 Tj
+-294 TJm
+(misses.) 29.0621 Tj
+-442 TJm
+(Because) 33.1967 Tj
+-294 TJm
+(of) 8.29918 Tj
+-295 TJm
+(t) 2.76971 Tj
+1 TJm
+(his,) 14.1176 Tj
+-306 TJm
+(smal) 18.8201 Tj
+1 TJm
+(l) 2.76971 Tj
+-295 TJm
+(chang) 23.7916 Tj
+1 TJm
+(es) 8.29918 Tj
+-295 TJm
+(to) 7.75121 Tj
+-294 TJm
+(the) 12.1748 Tj
+-294 TJm
+(code) 18.8101 Tj
+-294 TJm
+(to) 7.75121 Tj
+-294 TJm
+(reduce) 26.5514 Tj
+-294 TJm
+(the) 12.1748 Tj
+-294 TJm
+(miss) 18.2721 Tj
+-294 TJm
+(rate) 14.9345 Tj
+72 618.381 Td
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-253 TJm
+(been) 18.8101 Tj
+-253 TJm
+(observ) 26.5614 Tj
+15 TJm
+(ed) 9.40507 Tj
+-253 TJm
+(to) 7.75121 Tj
+-253 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-253 TJm
+(disproportionately) 73.0587 Tj
+-253 TJm
+(la) 7.19329 Tj
+1 TJm
+(r) 3.31768 Tj
+18 TJm
+(ge) 9.40507 Tj
+-253 TJm
+(performance) 50.343 Tj
+-253 TJm
+(impro) 23.8016 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(ements.) 30.7159 Tj
+-638 TJm
+(I) 3.31768 Tj
+-253 TJm
+(imagine) 32.1008 Tj
+[1 0 0 1 438.909 618.381] cm
+0 g
+0 G
+[1 0 0 1 -438.909 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+438.909 618.381 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 468.797 618.381] cm
+0 g
+0 G
+[1 0 0 1 -468.797 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+471.318 618.381 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-253 TJm
+(perform) 32.0908 Tj
+-253 TJm
+(best) 16.0504 Tj
+72 606.426 Td
+(on) 9.963 Tj
+-250 TJm
+(machines) 37.6303 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(v) 4.9815 Tj
+15 TJm
+(ery) 12.7228 Tj
+-250 TJm
+(lar) 10.511 Tj
+18 TJm
+(ge) 9.40507 Tj
+-250 TJm
+(c) 4.42357 Tj
+1 TJm
+(aches.) 24.6186 Tj
+[1 0 0 1 72 604.269] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -594.306] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 571.673 Td
+/F121_0 20.659 Tf
+(2.8.) 34.4592 Tj
+-278 TJm
+(CA) 29.8316 Tj
+80 TJm
+(VEA) 42.4749 Tj
+90 TJm
+(TS) 26.4022 Tj
+[1 0 0 1 72 571.415] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -561.452] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 549.755 Td
+/F128_0 9.963 Tf
+(I/O) 13.2807 Tj
+-268 TJm
+(error) 19.3581 Tj
+-267 TJm
+(messages) 37.6303 Tj
+-268 TJm
+(are) 12.1648 Tj
+-267 TJm
+(not) 12.7327 Tj
+-268 TJm
+(as) 8.29918 Tj
+-268 TJm
+(helpful) 28.2252 Tj
+-267 TJm
+(as) 8.29918 Tj
+-268 TJm
+(the) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-268 TJm
+(could) 22.1378 Tj
+-267 TJm
+(be.) 11.8958 Tj
+[1 0 0 1 293.313 549.755] cm
+0 g
+0 G
+[1 0 0 1 -293.313 -549.755] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+293.313 549.755 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 323.201 549.755] cm
+0 g
+0 G
+[1 0 0 1 -323.201 -549.755] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+325.868 549.755 Td
+/F128_0 9.963 Tf
+(tries) 17.1563 Tj
+-268 TJm
+(hard) 17.7043 Tj
+-267 TJm
+(to) 7.75121 Tj
+-268 TJm
+(detect) 23.7916 Tj
+-268 TJm
+(I/O) 13.2807 Tj
+-267 TJm
+(errors) 23.2337 Tj
+-268 TJm
+(and) 14.3866 Tj
+-267 TJm
+(e) 4.42357 Tj
+15 TJm
+(xit) 10.5209 Tj
+-268 TJm
+(cleanly) 28.7731 Tj
+65 TJm
+(,) 2.49075 Tj
+-272 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-268 TJm
+(the) 12.1748 Tj
+72 537.8 Td
+(details) 26.0134 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(what) 19.3681 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(problem) 33.2067 Tj
+-249 TJm
+(is) 6.64532 Tj
+-250 TJm
+(sometimes) 42.6217 Tj
+-250 TJm
+(seem) 20.474 Tj
+-250 TJm
+(rather) 23.2337 Tj
+-250 TJm
+(misleading.) 46.2184 Tj
+[1 0 0 1 72 535.643] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -525.681] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 515.882 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-280 TJm
+(manu) 22.1378 Tj
+1 TJm
+(al) 7.19329 Tj
+-280 TJm
+(page) 18.8101 Tj
+-280 TJm
+(pertains) 31.5429 Tj
+-279 TJm
+(to) 7.75121 Tj
+-280 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersion) 24.3496 Tj
+-279 TJm
+(1.0.3) 19.926 Tj
+-280 TJm
+(of) 8.29918 Tj
+[1 0 0 1 256.84 515.882] cm
+0 g
+0 G
+[1 0 0 1 -256.84 -515.882] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+256.84 515.882 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 286.727 515.882] cm
+0 g
+0 G
+[1 0 0 1 -286.727 -515.882] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+286.727 515.882 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-798 TJm
+(Compressed) 49.2571 Tj
+-280 TJm
+(da) 9.40507 Tj
+1 TJm
+(ta) 7.19329 Tj
+-280 TJm
+(created) 28.7632 Tj
+-280 TJm
+(by) 9.963 Tj
+-279 TJm
+(this) 14.3965 Tj
+-280 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersion) 24.3496 Tj
+-279 TJm
+(is) 6.64532 Tj
+-280 TJm
+(entirely) 30.437 Tj
+-280 TJm
+(forw) 18.8101 Tj
+11 TJm
+(ards) 16.5984 Tj
+72 503.927 Td
+(and) 14.3866 Tj
+-294 TJm
+(backw) 26.0034 Tj
+10 TJm
+(ards) 16.5984 Tj
+-294 TJm
+(compatible) 44.2756 Tj
+-295 TJm
+(wit) 12.7327 Tj
+1 TJm
+(h) 4.9815 Tj
+-295 TJm
+(the) 12.1748 Tj
+-294 TJm
+(pre) 12.7228 Tj
+25 TJm
+(vious) 21.5898 Tj
+-294 TJm
+(public) 24.9075 Tj
+-294 TJm
+(releases,) 34.0236 Tj
+-306 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersions) 28.2252 Tj
+-294 TJm
+(0.1pl2,) 27.6772 Tj
+-305 TJm
+(0.9.0) 19.926 Tj
+-294 TJm
+(and) 14.3866 Tj
+-295 TJm
+(0.9.5,) 22.4168 Tj
+-305 TJm
+(1.0.0,) 22.4168 Tj
+-305 TJm
+(1.0.1) 19.926 Tj
+-295 TJm
+(and) 14.3866 Tj
+-294 TJm
+(1.0.2,) 22.4168 Tj
+72 491.972 Td
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-282 TJm
+(with) 17.7142 Tj
+-283 TJm
+(the) 12.1748 Tj
+-282 TJm
+(follo) 18.8201 Tj
+25 TJm
+(wing) 19.926 Tj
+-282 TJm
+(e) 4.42357 Tj
+15 TJm
+(xception:) 37.0823 Tj
+-375 TJm
+(0.9.0) 19.926 Tj
+-282 TJm
+(and) 14.3866 Tj
+-282 TJm
+(abo) 14.3866 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-283 TJm
+(can) 13.8286 Tj
+-282 TJm
+(correctly) 35.4085 Tj
+-282 TJm
+(decompress) 47.0353 Tj
+-282 TJm
+(multiple) 33.2166 Tj
+-283 TJm
+(concatena) 39.8321 Tj
+1 TJm
+(ted) 12.1748 Tj
+-283 TJm
+(compressed) 47.0353 Tj
+-282 TJm
+(\002les.) 19.0991 Tj
+72 480.017 Td
+(0.1pl2) 25.1865 Tj
+-250 TJm
+(cannot) 26.5614 Tj
+-250 TJm
+(do) 9.963 Tj
+-250 TJm
+(this;) 17.1662 Tj
+-250 TJm
+(it) 5.53943 Tj
+-250 TJm
+(will) 15.5024 Tj
+-249 TJm
+(stop) 16.6083 Tj
+-250 TJm
+(after) 18.2522 Tj
+-250 TJm
+(decompressing) 59.768 Tj
+-250 TJm
+(just) 14.3965 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(\002rst) 15.5024 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(strea) 18.8101 Tj
+1 TJm
+(m.) 10.242 Tj
+[1 0 0 1 72 477.86] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -467.897] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 458.099 Td
+/F130_0 9.963 Tf
+(bzip2recover) 71.7336 Tj
+[1 0 0 1 143.731 458.099] cm
+0 g
+0 G
+[1 0 0 1 -143.731 -458.099] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+146.174 458.099 Td
+/F128_0 9.963 Tf
+(v) 4.9815 Tj
+15 TJm
+(ersions) 28.2252 Tj
+-245 TJm
+(prior) 19.3681 Tj
+-245 TJm
+(to) 7.75121 Tj
+-245 TJm
+(1.0.2) 19.926 Tj
+-245 TJm
+(used) 18.2622 Tj
+-245 TJm
+(32-bit) 23.8016 Tj
+-245 TJm
+(inte) 14.9445 Tj
+15 TJm
+(gers) 16.5984 Tj
+-245 TJm
+(to) 7.75121 Tj
+-246 TJm
+(repre) 20.464 Tj
+1 TJm
+(sent) 16.0504 Tj
+-246 TJm
+(bit) 10.5209 Tj
+-245 TJm
+(positions) 35.9864 Tj
+-245 TJm
+(in) 7.75121 Tj
+-245 TJm
+(compressed) 47.0353 Tj
+-245 TJm
+(\002les,) 19.0991 Tj
+-246 TJm
+(so) 8.85711 Tj
+-245 TJm
+(it) 5.53943 Tj
+-245 TJm
+(could) 22.1378 Tj
+72 446.144 Td
+(not) 12.7327 Tj
+-383 TJm
+(handle) 26.5614 Tj
+-384 TJm
+(compressed) 47.0353 Tj
+-383 TJm
+(\002les) 16.6083 Tj
+-384 TJm
+(more) 20.474 Tj
+-383 TJm
+(than) 17.1563 Tj
+-384 TJm
+(51) 9.963 Tj
+1 TJm
+(2) 4.9815 Tj
+-384 TJm
+(me) 12.1748 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(abytes) 25.4555 Tj
+-383 TJm
+(long.) 20.205 Tj
+-1421 TJm
+(V) 7.19329 Tj
+111 TJm
+(ersions) 28.2252 Tj
+-384 TJm
+(1.0.2) 19.926 Tj
+-383 TJm
+(and) 14.3866 Tj
+-384 TJm
+(abo) 14.3866 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-383 TJm
+(use) 13.2807 Tj
+-384 TJm
+(64-bit) 23.8016 Tj
+-383 TJm
+(ints) 14.3965 Tj
+-384 TJm
+(on) 9.963 Tj
+-383 TJm
+(some) 21.0319 Tj
+72 434.189 Td
+(platforms) 38.1882 Tj
+-245 TJm
+(which) 24.3496 Tj
+-246 TJm
+(su) 8.85711 Tj
+1 TJm
+(pport) 21.0319 Tj
+-246 TJm
+(them) 19.926 Tj
+-245 TJm
+(\(GNU) 24.8975 Tj
+-245 TJm
+(supported) 39.2941 Tj
+-246 TJm
+(tar) 10.511 Tj
+18 TJm
+(gets,) 18.5411 Tj
+-246 TJm
+(and) 14.3866 Tj
+-245 TJm
+(W) 9.40507 Tj
+40 TJm
+(indo) 17.7142 Tj
+25 TJm
+(ws\).) 16.8773 Tj
+-309 TJm
+(T) 6.08739 Tj
+80 TJm
+(o) 4.9815 Tj
+-245 TJm
+(establish) 34.8705 Tj
+-245 TJm
+(whether) 32.0908 Tj
+-245 TJm
+(or) 8.29918 Tj
+-246 TJm
+(not) 12.7327 Tj
+[1 0 0 1 468.269 434.189] cm
+0 g
+0 G
+[1 0 0 1 -468.269 -434.189] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+468.269 434.189 Td
+/F130_0 9.963 Tf
+(bzip2recover) 71.7336 Tj
+[1 0 0 1 540 434.189] cm
+0 g
+0 G
+[1 0 0 1 -540 -434.189] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 422.233 Td
+/F128_0 9.963 Tf
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-255 TJm
+(b) 4.9815 Tj
+20 TJm
+(uilt) 13.2906 Tj
+-255 TJm
+(with) 17.7142 Tj
+-255 TJm
+(such) 18.2622 Tj
+-255 TJm
+(a) 4.42357 Tj
+-255 TJm
+(limitation,) 41.2468 Tj
+-256 TJm
+(run) 13.2807 Tj
+-255 TJm
+(it) 5.53943 Tj
+-255 TJm
+(without) 30.4469 Tj
+-255 TJm
+(ar) 7.74125 Tj
+18 TJm
+(guments.) 36.2554 Tj
+-325 TJm
+(In) 8.29918 Tj
+-255 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-255 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+1 TJm
+(t) 2.76971 Tj
+-255 TJm
+(you) 14.9445 Tj
+-255 TJm
+(can) 13.8286 Tj
+-255 TJm
+(b) 4.9815 Tj
+20 TJm
+(uild) 15.5024 Tj
+-255 TJm
+(yourself) 32.6488 Tj
+-255 TJm
+(an) 9.40507 Tj
+-255 TJm
+(unlimited) 38.1981 Tj
+-255 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersion) 24.3496 Tj
+-255 TJm
+(if) 6.08739 Tj
+72 410.278 Td
+(you) 14.9445 Tj
+-250 TJm
+(can) 13.8286 Tj
+-250 TJm
+(recompile) 39.842 Tj
+-250 TJm
+(it) 5.53943 Tj
+-250 TJm
+(with) 17.7142 Tj
+[1 0 0 1 176.318 410.278] cm
+0 g
+0 G
+[1 0 0 1 -176.318 -410.278] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+176.318 410.278 Td
+/F130_0 9.963 Tf
+(MaybeUInt64) 65.7558 Tj
+[1 0 0 1 242.071 410.278] cm
+0 g
+0 G
+[1 0 0 1 -242.071 -410.278] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+244.562 410.278 Td
+/F128_0 9.963 Tf
+(set) 11.0689 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(an) 9.40507 Tj
+-250 TJm
+(unsigned) 35.9764 Tj
+-250 TJm
+(64-bit) 23.8016 Tj
+-249 TJm
+(inte) 14.9445 Tj
+15 TJm
+(ger) 12.7228 Tj
+55 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 408.121] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -398.159] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 375.525 Td
+/F121_0 20.659 Tf
+(2.9.) 34.4592 Tj
+-278 TJm
+(A) 14.9158 Tj
+50 TJm
+(UTHOR) 73.4427 Tj
+[1 0 0 1 72 375.267] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -365.305] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 353.608 Td
+/F128_0 9.963 Tf
+(Julian) 23.8016 Tj
+-250 TJm
+(Se) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(ard,) 15.2135 Tj
+[1 0 0 1 132.801 353.608] cm
+0 g
+0 G
+[1 0 0 1 -132.801 -353.608] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+132.801 353.608 Td
+/F130_0 9.963 Tf
+(jseward@bzip.org) 95.6448 Tj
+[1 0 0 1 228.443 353.608] cm
+0 g
+0 G
+[1 0 0 1 -156.443 -1.564] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -342.081] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 331.69 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-299 TJm
+(ideas) 20.474 Tj
+-300 TJm
+(embodied) 39.2941 Tj
+-299 TJm
+(in) 7.75121 Tj
+[1 0 0 1 166.942 331.69] cm
+0 g
+0 G
+[1 0 0 1 -166.942 -331.69] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+166.942 331.69 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 196.83 331.69] cm
+0 g
+0 G
+[1 0 0 1 -196.83 -331.69] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+199.813 331.69 Td
+/F128_0 9.963 Tf
+(are) 12.1648 Tj
+-299 TJm
+(due) 14.3866 Tj
+-300 TJm
+(to) 7.75121 Tj
+-299 TJm
+(\(at) 10.511 Tj
+-300 TJm
+(least\)) 21.5799 Tj
+-299 TJm
+(the) 12.1748 Tj
+-299 TJm
+(follo) 18.8201 Tj
+25 TJm
+(wing) 19.926 Tj
+-300 TJm
+(people:) 29.3311 Tj
+-408 TJm
+(Michael) 32.6488 Tj
+-300 TJm
+(Burro) 23.2437 Tj
+25 TJm
+(ws) 11.0689 Tj
+-299 TJm
+(and) 14.3866 Tj
+-300 TJm
+(D) 7.19329 Tj
+1 TJm
+(a) 4.42357 Tj
+20 TJm
+(vid) 12.7327 Tj
+-300 TJm
+(Wheeler) 33.7447 Tj
+-299 TJm
+(\(for) 14.9345 Tj
+72 319.735 Td
+(the) 12.1748 Tj
+-312 TJm
+(block) 22.1378 Tj
+-313 TJm
+(s) 3.87561 Tj
+1 TJm
+(orting) 23.8016 Tj
+-313 TJm
+(transformati) 48.6991 Tj
+1 TJm
+(on\),) 15.7714 Tj
+-328 TJm
+(Da) 11.6169 Tj
+20 TJm
+(vid) 12.7327 Tj
+-313 TJm
+(Whee) 23.2337 Tj
+1 TJm
+(ler) 10.511 Tj
+-313 TJm
+(\(ag) 12.7228 Tj
+5 TJm
+(ain,) 14.6655 Tj
+-328 TJm
+(for) 11.6169 Tj
+-312 TJm
+(the) 12.1748 Tj
+-312 TJm
+(Huf) 15.4925 Tj
+25 TJm
+(fman) 20.474 Tj
+-312 TJm
+(coder\),) 27.9363 Tj
+-328 TJm
+(Peter) 20.474 Tj
+-312 TJm
+(Fenwick) 34.3126 Tj
+-313 TJm
+(\(for) 14.9345 Tj
+-312 TJm
+(the) 12.1748 Tj
+-312 TJm
+(structured) 39.842 Tj
+72 307.779 Td
+(coding) 27.1193 Tj
+-325 TJm
+(model) 24.9075 Tj
+-326 TJm
+(in) 7.75121 Tj
+-325 TJm
+(the) 12.1748 Tj
+-326 TJm
+(origin) 23.8016 Tj
+1 TJm
+(al) 7.19329 Tj
+[1 0 0 1 191.156 307.779] cm
+0 g
+0 G
+[1 0 0 1 -191.156 -307.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+191.156 307.779 Td
+/F130_0 9.963 Tf
+(bzip) 23.9112 Tj
+[1 0 0 1 215.067 307.779] cm
+0 g
+0 G
+[1 0 0 1 -215.067 -307.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+215.067 307.779 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-344 TJm
+(and) 14.3866 Tj
+-326 TJm
+(man) 17.1563 Tj
+15 TJm
+(y) 4.9815 Tj
+-325 TJm
+(re\002nements\),) 52.2958 Tj
+-344 TJm
+(and) 14.3866 Tj
+-326 TJm
+(Alistair) 29.889 Tj
+-325 TJm
+(Mof) 17.1563 Tj
+25 TJm
+(f) 3.31768 Tj
+10 TJm
+(at,) 9.68404 Tj
+-344 TJm
+(Radford) 32.6488 Tj
+-326 TJm
+(Ne) 11.6169 Tj
+1 TJm
+(al) 7.19329 Tj
+-326 TJm
+(and) 14.3866 Tj
+-325 TJm
+(Ian) 12.7228 Tj
+-326 TJm
+(W) 9.40507 Tj
+40 TJm
+(itten) 17.7142 Tj
+-325 TJm
+(\(for) 14.9345 Tj
+72 295.824 Td
+(the) 12.1748 Tj
+-277 TJm
+(arithmetic) 40.4 Tj
+-277 TJm
+(coder) 22.1278 Tj
+-276 TJm
+(in) 7.75121 Tj
+-277 TJm
+(the) 12.1748 Tj
+-277 TJm
+(original) 30.9949 Tj
+[1 0 0 1 214.171 295.824] cm
+0 g
+0 G
+[1 0 0 1 -214.171 -295.824] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+214.171 295.824 Td
+/F130_0 9.963 Tf
+(bzip) 23.9112 Tj
+[1 0 0 1 238.082 295.824] cm
+0 g
+0 G
+[1 0 0 1 -238.082 -295.824] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+238.082 295.824 Td
+/F128_0 9.963 Tf
+(\).) 5.80843 Tj
+-782 TJm
+(I) 3.31768 Tj
+-276 TJm
+(am) 12.1748 Tj
+-277 TJm
+(much) 22.1378 Tj
+-277 TJm
+(indebted) 34.3126 Tj
+-277 TJm
+(for) 11.6169 Tj
+-277 TJm
+(their) 18.2622 Tj
+-277 TJm
+(help,) 19.647 Tj
+-283 TJm
+(support) 29.889 Tj
+-277 TJm
+(and) 14.3866 Tj
+-277 TJm
+(advice.) 28.4942 Tj
+-781 TJm
+(See) 14.3866 Tj
+-277 TJm
+(the) 12.1748 Tj
+-277 TJm
+(manual) 29.3311 Tj
+72 283.869 Td
+(in) 7.75121 Tj
+-330 TJm
+(the) 12.1748 Tj
+-330 TJm
+(source) 26.0034 Tj
+-329 TJm
+(distrib) 25.4654 Tj
+20 TJm
+(ution) 20.4839 Tj
+-330 TJm
+(for) 11.6169 Tj
+-330 TJm
+(pointers) 32.1008 Tj
+-330 TJm
+(to) 7.75121 Tj
+-330 TJm
+(sour) 17.1563 Tj
+1 TJm
+(ces) 12.7228 Tj
+-330 TJm
+(of) 8.29918 Tj
+-330 TJm
+(documentation.) 61.7108 Tj
+-1099 TJm
+(Christian) 36.5343 Tj
+-330 TJm
+(v) 4.9815 Tj
+20 TJm
+(on) 9.963 Tj
+-330 TJm
+(Roques) 29.889 Tj
+-330 TJm
+(encou) 23.7916 Tj
+1 TJm
+(raged) 22.1278 Tj
+-330 TJm
+(me) 12.1748 Tj
+-330 TJm
+(to) 7.75121 Tj
+-330 TJm
+(look) 17.7142 Tj
+72 271.914 Td
+(for) 11.6169 Tj
+-271 TJm
+(f) 3.31768 Tj
+10 TJm
+(aster) 18.8101 Tj
+-271 TJm
+(sorting) 27.6772 Tj
+-271 TJm
+(algorithms,) 45.1125 Tj
+-276 TJm
+(so) 8.85711 Tj
+-271 TJm
+(as) 8.29918 Tj
+-271 TJm
+(to) 7.75121 Tj
+-271 TJm
+(speed) 22.6858 Tj
+-271 TJm
+(up) 9.963 Tj
+-271 TJm
+(compression.) 52.8537 Tj
+-746 TJm
+(Bela) 18.2622 Tj
+-271 TJm
+(Lubkin) 28.7831 Tj
+-271 TJm
+(encouraged) 45.9195 Tj
+-271 TJm
+(me) 12.1748 Tj
+-271 TJm
+(to) 7.75121 Tj
+-271 TJm
+(impro) 23.8016 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-271 TJm
+(the) 12.1748 Tj
+-271 TJm
+(w) 7.19329 Tj
+10 TJm
+(orst-case) 35.4085 Tj
+72 259.959 Td
+(compression) 50.363 Tj
+-340 TJm
+(performan) 41.4959 Tj
+1 TJm
+(ce.) 11.3379 Tj
+-580 TJm
+(Donna) 26.5614 Tj
+-340 TJm
+(Robinson) 38.1981 Tj
+-340 TJm
+(XMLise) 33.2067 Tj
+1 TJm
+(d) 4.9815 Tj
+-340 TJm
+(the) 12.1748 Tj
+-340 TJm
+(documentation.) 61.7108 Tj
+-580 TJm
+(Man) 18.2622 Tj
+15 TJm
+(y) 4.9815 Tj
+-339 TJm
+(people) 26.5614 Tj
+-340 TJm
+(sent) 16.0504 Tj
+-340 TJm
+(patches,) 32.3698 Tj
+-362 TJm
+(helped) 26.5614 Tj
+-340 TJm
+(with) 17.7142 Tj
+72 248.004 Td
+(portability) 41.5158 Tj
+-250 TJm
+(problems,) 39.573 Tj
+-250 TJm
+(lent) 14.9445 Tj
+-250 TJm
+(m) 7.75121 Tj
+1 TJm
+(achines,) 32.3698 Tj
+-250 TJm
+(g) 4.9815 Tj
+5 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(advice) 26.0034 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(were) 19.3581 Tj
+-250 TJm
+(generally) 37.0723 Tj
+-250 TJm
+(helpful.) 30.7159 Tj
+[1 0 0 1 72 245.847] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -194.995] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.585] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 43.063 -6.486] cm
+0 g
+0 G
+[1 0 0 1 -496.332 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+539.395 50.951 Td
+/F128_0 9.963 Tf
+(7) 4.9815 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 11 11
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 4.384 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 141.644 0] cm
+0 g
+0 G
+[1 0 0 1 -141.644 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -13.948] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -15.037 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 701.916 Td
+/F121_0 24.79 Tf
+(3.) 20.6749 Tj
+-556 TJm
+(Pr) 26.1782 Tj
+20 TJm
+(ogramming) 134.982 Tj
+-278 TJm
+(with) 49.58 Tj
+[1 0 0 1 330.484 701.916] cm
+0 g
+0 G
+[1 0 0 1 -330.484 -701.916] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+330.484 701.916 Td
+/F387_0 24.79 Tf
+(libbzip2) 118.992 Tj
+[1 0 0 1 449.477 701.916] cm
+0 g
+0 G
+[1 0 0 1 -377.477 -5.516] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -14.944] cm
+0 g
+0 G
+[1 0 0 1 -72 -671.493] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 656.35 Td
+/F121_0 17.215 Tf
+(T) 10.5184 Tj
+80 TJm
+(ab) 20.0899 Tj
+10 TJm
+(le) 14.3573 Tj
+-278 TJm
+(of) 16.251 Tj
+-278 TJm
+(Contents) 74.5926 Tj
+[1 0 0 1 72 647.528] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.74] cm
+0 g
+0 G
+[1 0 0 1 -72 -635.788] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 635.788 Td
+/F128_0 9.963 Tf
+(3.1.) 14.9445 Tj
+-310 TJm
+(T) 6.08739 Tj
+80 TJm
+(op-le) 20.474 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(structure) 34.8605 Tj
+[1 0 0 1 164.921 635.788] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -169.902 -635.788] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+179.997 635.788 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 635.788] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -635.788] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 635.788 Td
+/F128_0 9.963 Tf
+(8) 4.9815 Tj
+[1 0 0 1 516.09 635.788] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -623.832] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 623.832 Td
+/F128_0 9.963 Tf
+(3.1.1.) 22.4168 Tj
+-310 TJm
+(Lo) 11.0689 Tj
+25 TJm
+(w-le) 17.7043 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(summary) 37.0823 Tj
+[1 0 0 1 225.195 623.832] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -230.176 -623.832] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+238.915 623.832 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 623.832] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -623.832] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 623.832 Td
+/F128_0 9.963 Tf
+(9) 4.9815 Tj
+[1 0 0 1 516.09 623.832] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.156] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -611.877] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 611.877 Td
+/F128_0 9.963 Tf
+(3.1.2.) 22.4168 Tj
+-310 TJm
+(High-le) 30.437 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(summary) 37.0823 Tj
+[1 0 0 1 227.107 611.877] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -232.089 -611.877] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+242.085 611.877 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 611.877] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -611.877] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 611.877 Td
+/F128_0 9.963 Tf
+(9) 4.9815 Tj
+[1 0 0 1 516.09 611.877] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -599.922] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 599.922 Td
+/F128_0 9.963 Tf
+(3.1.3.) 22.4168 Tj
+-310 TJm
+(Utility) 26.0234 Tj
+-250 TJm
+(functions) 37.0823 Tj
+-250 TJm
+(sum) 16.6083 Tj
+1 TJm
+(mary) 20.474 Tj
+[1 0 0 1 250.489 599.922] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -255.471 -599.922] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+264.846 599.922 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 511.108 599.922] cm
+0 g
+0 G
+[1 0 0 1 -511.108 -599.922] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.108 599.922 Td
+/F128_0 9.963 Tf
+(9) 4.9815 Tj
+[1 0 0 1 516.09 599.922] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -72 -587.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 587.967 Td
+/F128_0 9.963 Tf
+(3.2.) 14.9445 Tj
+-310 TJm
+(Error) 21.0219 Tj
+-250 TJm
+(handling) 34.8705 Tj
+[1 0 0 1 148.413 587.967] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -153.394 -587.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+162.611 587.967 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 587.967] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -587.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 587.967 Td
+/F128_0 9.963 Tf
+(10) 9.963 Tj
+[1 0 0 1 516.09 587.967] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -72 -576.012] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 576.012 Td
+/F128_0 9.963 Tf
+(3.3.) 14.9445 Tj
+-310 TJm
+(Lo) 11.0689 Tj
+25 TJm
+(w-le) 17.7043 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace) 13.2707 Tj
+[1 0 0 1 167.571 576.012] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -172.552 -576.012] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+181.045 576.012 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 576.012] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -576.012] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 576.012 Td
+/F128_0 9.963 Tf
+(11) 9.963 Tj
+[1 0 0 1 516.09 576.012] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -0.1] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -11.855] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -564.057] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 564.057 Td
+/F128_0 9.963 Tf
+(3.3.1.) 22.4168 Tj
+-310 TJm
+(BZ2_bzCompressInit) 85.7914 Tj
+[1 0 0 1 231.112 564.057] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -236.094 -564.057] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+246.025 564.057 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 564.057] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -564.057] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 564.057 Td
+/F128_0 9.963 Tf
+(11) 9.963 Tj
+[1 0 0 1 516.09 564.057] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -552.101] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 552.101 Td
+/F128_0 9.963 Tf
+(3.3.2.) 22.4168 Tj
+-310 TJm
+(BZ2_bzCompress) 71.9528 Tj
+[1 0 0 1 217.275 552.101] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -222.256 -552.101] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+232.464 552.101 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 552.101] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -552.101] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 552.101 Td
+/F128_0 9.963 Tf
+(13) 9.963 Tj
+[1 0 0 1 516.09 552.101] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.156] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -540.146] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 540.146 Td
+/F128_0 9.963 Tf
+(3.3.3.) 22.4168 Tj
+-310 TJm
+(BZ2_bzCompressEnd) 88.0032 Tj
+[1 0 0 1 233.324 540.146] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -238.306 -540.146] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+247.131 540.146 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 540.146] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -540.146] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 540.146 Td
+/F128_0 9.963 Tf
+(16) 9.963 Tj
+[1 0 0 1 516.09 540.146] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -528.191] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 528.191 Td
+/F128_0 9.963 Tf
+(3.3.4.) 22.4168 Tj
+-310 TJm
+(BZ2_bzDecompressIni) 92.4168 Tj
+1 TJm
+(t) 2.76971 Tj
+[1 0 0 1 240.507 528.191] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -245.488 -528.191] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+255.15 528.191 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 528.191] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -528.191] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 528.191 Td
+/F128_0 9.963 Tf
+(16) 9.963 Tj
+[1 0 0 1 516.09 528.191] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -516.236] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 516.236 Td
+/F128_0 9.963 Tf
+(3.3.5.) 22.4168 Tj
+-310 TJm
+(BZ2_bzDecompress) 81.3479 Tj
+[1 0 0 1 226.669 516.236] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -231.651 -516.236] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+241.589 516.236 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 516.236] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -516.236] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 516.236 Td
+/F128_0 9.963 Tf
+(17) 9.963 Tj
+[1 0 0 1 516.09 516.236] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -504.281] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 504.281 Td
+/F128_0 9.963 Tf
+(3.3.6.) 22.4168 Tj
+-310 TJm
+(BZ2_bzDecompressEn) 92.4168 Tj
+1 TJm
+(d) 4.9815 Tj
+[1 0 0 1 242.719 504.281] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -247.7 -504.281] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+256.256 504.281 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 504.281] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -504.281] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 504.281 Td
+/F128_0 9.963 Tf
+(18) 9.963 Tj
+[1 0 0 1 516.09 504.281] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -72 -492.326] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 492.326 Td
+/F128_0 9.963 Tf
+(3.4.) 14.9445 Tj
+-310 TJm
+(High-le) 30.437 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace) 13.2707 Tj
+[1 0 0 1 169.483 492.326] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -174.465 -492.326] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+184.216 492.326 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 492.326] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -492.326] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 492.326 Td
+/F128_0 9.963 Tf
+(18) 9.963 Tj
+[1 0 0 1 516.09 492.326] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -480.37] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 480.37 Td
+/F128_0 9.963 Tf
+(3.4.1.) 22.4168 Tj
+-310 TJm
+(BZ2_bzReadOpen) 74.1546 Tj
+[1 0 0 1 219.476 480.37] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -224.458 -480.37] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+233.565 480.37 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 480.37] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -480.37] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 480.37 Td
+/F128_0 9.963 Tf
+(19) 9.963 Tj
+[1 0 0 1 516.09 480.37] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.156] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -468.415] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 468.415 Td
+/F128_0 9.963 Tf
+(3.4.2.) 22.4168 Tj
+-310 TJm
+(BZ2_bzRead) 52.5748 Tj
+[1 0 0 1 197.898 468.415] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -202.879 -468.415] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+211.706 468.415 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 468.415] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -468.415] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 468.415 Td
+/F128_0 9.963 Tf
+(20) 9.963 Tj
+[1 0 0 1 516.09 468.415] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -1.18] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -10.775] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -456.46] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 456.46 Td
+/F128_0 9.963 Tf
+(3.4.3.) 22.4168 Tj
+-310 TJm
+(BZ2_bzReadGetUnuse) 92.4168 Tj
+1 TJm
+(d) 4.9815 Tj
+[1 0 0 1 242.719 456.46] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -247.7 -456.46] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+256.256 456.46 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 456.46] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -456.46] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 456.46 Td
+/F128_0 9.963 Tf
+(21) 9.963 Tj
+[1 0 0 1 516.09 456.46] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -1.181] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -10.774] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -444.505] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 444.505 Td
+/F128_0 9.963 Tf
+(3.4.4.) 22.4168 Tj
+-310 TJm
+(BZ2_bzReadClose) 75.2705 Tj
+[1 0 0 1 220.592 444.505] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -225.573 -444.505] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+234.123 444.505 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 444.505] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -444.505] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 444.505 Td
+/F128_0 9.963 Tf
+(22) 9.963 Tj
+[1 0 0 1 516.09 444.505] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -1.181] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -10.774] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -432.55] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 432.55 Td
+/F128_0 9.963 Tf
+(3.4.5.) 22.4168 Tj
+-310 TJm
+(BZ2_bzWriteOpen) 76.3664 Tj
+[1 0 0 1 221.688 432.55] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -226.669 -432.55] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+236.885 432.55 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 432.55] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -432.55] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 432.55 Td
+/F128_0 9.963 Tf
+(22) 9.963 Tj
+[1 0 0 1 516.09 432.55] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -420.595] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 420.595 Td
+/F128_0 9.963 Tf
+(3.4.6.) 22.4168 Tj
+-310 TJm
+(BZ2_bzWrite) 54.7865 Tj
+[1 0 0 1 200.109 420.595] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -205.09 -420.595] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+215.026 420.595 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 420.595] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -420.595] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 420.595 Td
+/F128_0 9.963 Tf
+(23) 9.963 Tj
+[1 0 0 1 516.09 420.595] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -1.181] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -10.775] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -408.639] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 408.639 Td
+/F128_0 9.963 Tf
+(3.4.7.) 22.4168 Tj
+-310 TJm
+(BZ2_bzWriteClose) 77.4823 Tj
+[1 0 0 1 222.804 408.639] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -227.785 -408.639] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+237.443 408.639 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 408.639] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -408.639] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 408.639 Td
+/F128_0 9.963 Tf
+(23) 9.963 Tj
+[1 0 0 1 516.09 408.639] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -1.18] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -10.775] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -396.684] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 396.684 Td
+/F128_0 9.963 Tf
+(3.4.8.) 22.4168 Tj
+-310 TJm
+(Handling) 37.0823 Tj
+-250 TJm
+(embedded) 40.9479 Tj
+-250 TJm
+(com) 17.1563 Tj
+1 TJm
+(pressed) 29.879 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(streams) 30.437 Tj
+[1 0 0 1 327.38 396.684] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -332.362 -396.684] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+342.865 396.684 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 396.684] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -396.684] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 396.684 Td
+/F128_0 9.963 Tf
+(24) 9.963 Tj
+[1 0 0 1 516.09 396.684] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -384.729] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 384.729 Td
+/F128_0 9.963 Tf
+(3.4.9.) 22.4168 Tj
+-310 TJm
+(Standard) 35.4185 Tj
+-250 TJm
+(\002le-reading/) 48.6991 Tj
+1 TJm
+(writing) 28.7831 Tj
+-250 TJm
+(code) 18.8101 Tj
+[1 0 0 1 282.011 384.729] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -286.992 -384.729] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+295.827 384.729 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 384.729] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -384.729] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 384.729 Td
+/F128_0 9.963 Tf
+(25) 9.963 Tj
+[1 0 0 1 516.09 384.729] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -72 -372.774] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 372.774 Td
+/F128_0 9.963 Tf
+(3.5.) 14.9445 Tj
+-310 TJm
+(Utility) 26.0234 Tj
+-250 TJm
+(functions) 37.0823 Tj
+[1 0 0 1 155.625 372.774] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -160.607 -372.774] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+170.645 372.774 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 372.774] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -372.774] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 372.774 Td
+/F128_0 9.963 Tf
+(26) 9.963 Tj
+[1 0 0 1 516.09 372.774] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -360.819] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 360.819 Td
+/F128_0 9.963 Tf
+(3.5.1.) 22.4168 Tj
+-310 TJm
+(BZ2_bzBuf) 47.0453 Tj
+25 TJm
+(fT) 9.40507 Tj
+80 TJm
+(oBuf) 19.926 Tj
+25 TJm
+(fCom) 22.6957 Tj
+1 TJm
+(press) 20.474 Tj
+[1 0 0 1 263.571 360.819] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -268.552 -360.819] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+277.751 360.819 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 360.819] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -360.819] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 360.819 Td
+/F128_0 9.963 Tf
+(26) 9.963 Tj
+[1 0 0 1 516.09 360.819] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -348.864] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 348.864 Td
+/F128_0 9.963 Tf
+(3.5.2.) 22.4168 Tj
+-310 TJm
+(BZ2_bzBuf) 47.0453 Tj
+25 TJm
+(fT) 9.40507 Tj
+80 TJm
+(oBuf) 19.926 Tj
+25 TJm
+(fDeco) 24.3396 Tj
+1 TJm
+(mpress) 28.2252 Tj
+[1 0 0 1 272.965 348.864] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -277.947 -348.864] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+286.876 348.864 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 348.864] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -348.864] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 348.864 Td
+/F128_0 9.963 Tf
+(27) 9.963 Tj
+[1 0 0 1 516.09 348.864] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -72 -336.908] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 336.908 Td
+/F128_0 9.963 Tf
+(3.6.) 14.9445 Tj
+-310 TJm
+(zlib) 14.9445 Tj
+-250 TJm
+(compatibility) 53.1426 Tj
+-250 TJm
+(funct) 20.474 Tj
+1 TJm
+(ions) 16.6083 Tj
+[1 0 0 1 200.178 336.908] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -205.159 -336.908] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+215.06 336.908 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 336.908] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -336.908] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 336.908 Td
+/F128_0 9.963 Tf
+(28) 9.963 Tj
+[1 0 0 1 516.09 336.908] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.156] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.799] cm
+0 g
+0 G
+[1 0 0 1 -72 -324.953] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 324.953 Td
+/F128_0 9.963 Tf
+(3.7.) 14.9445 Tj
+-310 TJm
+(Using) 23.8016 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(library) 26.5614 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(std) 11.6268 Tj
+1 TJm
+(io-free) 26.5514 Tj
+-250 TJm
+(en) 9.40507 Tj
+40 TJm
+(vironment) 40.9579 Tj
+[1 0 0 1 267.824 324.953] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -272.805 -324.953] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+282.092 324.953 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 324.953] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -324.953] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 324.953 Td
+/F128_0 9.963 Tf
+(28) 9.963 Tj
+[1 0 0 1 516.09 324.953] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -312.998] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 312.998 Td
+/F128_0 9.963 Tf
+(3.7.1.) 22.4168 Tj
+-310 TJm
+(Getting) 29.889 Tj
+-250 TJm
+(rid) 11.0689 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(stdio) 19.378 Tj
+[1 0 0 1 221.429 312.998] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -226.41 -312.998] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+236.755 312.998 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 312.998] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -312.998] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 312.998 Td
+/F128_0 9.963 Tf
+(29) 9.963 Tj
+[1 0 0 1 516.09 312.998] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 47.821 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -301.043] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 301.043 Td
+/F128_0 9.963 Tf
+(3.7.2.) 22.4168 Tj
+-310 TJm
+(Critical) 29.889 Tj
+-250 TJm
+(error) 19.3581 Tj
+-250 TJm
+(handlin) 29.889 Tj
+1 TJm
+(g) 4.9815 Tj
+[1 0 0 1 234.42 301.043] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -239.401 -301.043] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+249.892 301.043 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 301.043] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -301.043] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 301.043 Td
+/F128_0 9.963 Tf
+(29) 9.963 Tj
+[1 0 0 1 516.09 301.043] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -72 -289.088] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 289.088 Td
+/F128_0 9.963 Tf
+(3.8.) 14.9445 Tj
+-310 TJm
+(Making) 30.9949 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(W) 9.40507 Tj
+40 TJm
+(indo) 17.7142 Tj
+25 TJm
+(ws) 11.0689 Tj
+-250 TJm
+(DLL) 19.3681 Tj
+[1 0 0 1 189.827 289.088] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -194.809 -289.088] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+203.243 289.088 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 289.088] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -289.088] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 289.088 Td
+/F128_0 9.963 Tf
+(29) 9.963 Tj
+[1 0 0 1 516.09 289.088] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -267.006] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 257.207 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-250 TJm
+(chapter) 29.3211 Tj
+-250 TJm
+(describes) 37.0723 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(pr) 8.29918 Tj
+1 TJm
+(ogramming) 45.9394 Tj
+-250 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace) 13.2707 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 282.448 257.207] cm
+0 g
+0 G
+[1 0 0 1 -282.448 -257.207] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+282.448 257.207 Td
+/F130_0 9.963 Tf
+(libbzip2) 47.8224 Tj
+[1 0 0 1 330.269 257.207] cm
+0 g
+0 G
+[1 0 0 1 -330.269 -257.207] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+330.269 257.207 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 255.05] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -245.088] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 235.289 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-273 TJm
+(general) 29.3211 Tj
+-272 TJm
+(background) 47.0353 Tj
+-273 TJm
+(informati) 37.0823 Tj
+1 TJm
+(on,) 12.4538 Tj
+-279 TJm
+(particularly) 45.9294 Tj
+-272 TJm
+(about) 22.1378 Tj
+-273 TJm
+(memory) 33.2067 Tj
+-272 TJm
+(use) 13.2807 Tj
+-273 TJm
+(and) 14.3866 Tj
+-273 TJm
+(perfor) 24.3396 Tj
+1 TJm
+(mance) 26.0034 Tj
+-273 TJm
+(aspects,) 31.2639 Tj
+-278 TJm
+(you') 18.2622 Tj
+50 TJm
+(d) 4.9815 Tj
+-273 TJm
+(be) 9.40507 Tj
+-272 TJm
+(well) 17.1563 Tj
+-273 TJm
+(advised) 30.437 Tj
+72 223.334 Td
+(to) 7.75121 Tj
+-250 TJm
+(read) 17.1463 Tj
+[1 0 0 1 101.878 223.334] cm
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -101.878 -223.334] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+101.878 223.334 Td
+/F128_0 9.963 Tf
+(Ho) 12.1748 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(bzip2) 22.1378 Tj
+[1 0 0 1 171.636 223.334] cm
+0 g
+0 G
+0 0 1 rg
+0 0 1 RG
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -171.636 -223.334] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+174.126 223.334 Td
+/F128_0 9.963 Tf
+([2]) 11.6169 Tj
+[1 0 0 1 185.743 223.334] cm
+0 0 1 rg
+0 0 1 RG
+0 g
+0 G
+[1 0 0 1 -185.743 -223.334] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+188.233 223.334 Td
+/F128_0 9.963 Tf
+(as) 8.29918 Tj
+-250 TJm
+(well.) 19.647 Tj
+[1 0 0 1 72 221.177] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -211.215] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 188.581 Td
+/F121_0 20.659 Tf
+(3.1.) 34.4592 Tj
+-278 TJm
+(T) 12.6226 Tj
+80 TJm
+(op-le) 49.3544 Tj
+15 TJm
+(vel) 28.716 Tj
+-278 TJm
+(structure) 89.5361 Tj
+[1 0 0 1 72 184.305] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -174.343] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 166.664 Td
+/F130_0 9.963 Tf
+(libbzip2) 47.8224 Tj
+[1 0 0 1 119.821 166.664] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -166.664] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+123.608 166.664 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-380 TJm
+(a) 4.42357 Tj
+-380 TJm
+(\003e) 9.963 Tj
+15 TJm
+(xible) 19.926 Tj
+-380 TJm
+(library) 26.5614 Tj
+-380 TJm
+(for) 11.6169 Tj
+-381 TJm
+(com) 17.1563 Tj
+1 TJm
+(pressing) 33.2067 Tj
+-381 TJm
+(an) 9.40507 Tj
+1 TJm
+(d) 4.9815 Tj
+-381 TJm
+(decompre) 39.2841 Tj
+1 TJm
+(ssing) 20.4839 Tj
+-381 TJm
+(data) 16.5984 Tj
+-380 TJm
+(in) 7.75121 Tj
+-380 TJm
+(the) 12.1748 Tj
+[1 0 0 1 405.291 166.664] cm
+0 g
+0 G
+[1 0 0 1 -405.291 -166.664] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+405.291 166.664 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 435.179 166.664] cm
+0 g
+0 G
+[1 0 0 1 -435.179 -166.664] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+438.966 166.664 Td
+/F128_0 9.963 Tf
+(data) 16.5984 Tj
+-380 TJm
+(format.) 29.0521 Tj
+-1401 TJm
+(Although) 37.6402 Tj
+72 154.708 Td
+(packaged) 37.6203 Tj
+-285 TJm
+(as) 8.29918 Tj
+-284 TJm
+(a) 4.42357 Tj
+-285 TJm
+(single) 23.8016 Tj
+-284 TJm
+(entity) 22.6957 Tj
+65 TJm
+(,) 2.49075 Tj
+-294 TJm
+(it) 5.53943 Tj
+-284 TJm
+(helps) 21.0319 Tj
+-285 TJm
+(to) 7.75121 Tj
+-285 TJm
+(re) 7.74125 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(ard) 12.7228 Tj
+-284 TJm
+(the) 12.1748 Tj
+-285 TJm
+(library) 26.5614 Tj
+-285 TJm
+(a) 4.42357 Tj
+1 TJm
+(s) 3.87561 Tj
+-285 TJm
+(three) 19.916 Tj
+-285 TJm
+(separate) 32.6388 Tj
+-284 TJm
+(parts:) 22.1378 Tj
+-380 TJm
+(the) 12.1748 Tj
+-284 TJm
+(lo) 7.75121 Tj
+25 TJm
+(w) 7.19329 Tj
+-285 TJm
+(le) 7.19329 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-285 TJm
+(i) 2.76971 Tj
+1 TJm
+(nterf) 18.8101 Tj
+10 TJm
+(ace,) 15.7615 Tj
+-294 TJm
+(and) 14.3866 Tj
+-284 TJm
+(the) 12.1748 Tj
+-285 TJm
+(high) 17.7142 Tj
+72 142.753 Td
+(le) 7.19329 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace,) 15.7615 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(some) 21.0319 Tj
+-250 TJm
+(uti) 10.5209 Tj
+1 TJm
+(lity) 13.2906 Tj
+-250 TJm
+(functions.) 39.573 Tj
+[1 0 0 1 72 140.596] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -130.634] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 120.835 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-349 TJm
+(structure) 34.8605 Tj
+-349 TJm
+(of) 8.29918 Tj
+[1 0 0 1 141.082 120.835] cm
+0 g
+0 G
+[1 0 0 1 -141.082 -120.835] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+141.082 120.835 Td
+/F130_0 9.963 Tf
+(libbzip2) 47.8224 Tj
+[1 0 0 1 188.903 120.835] cm
+0 g
+0 G
+[1 0 0 1 -188.903 -120.835] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+188.903 120.835 Td
+/F128_0 9.963 Tf
+(') 3.31768 Tj
+55 TJm
+(s) 3.87561 Tj
+-349 TJm
+(interf) 21.5799 Tj
+10 TJm
+(aces) 17.1463 Tj
+-349 TJm
+(is) 6.64532 Tj
+-349 TJm
+(similar) 27.6772 Tj
+-349 TJm
+(to) 7.75121 Tj
+-349 TJm
+(that) 14.9445 Tj
+-349 TJm
+(of) 8.29918 Tj
+-349 TJm
+(Jean-loup) 38.7361 Tj
+-349 TJm
+(Gailly') 28.2252 Tj
+55 TJm
+(s) 3.87561 Tj
+-349 TJm
+(an) 9.40507 Tj
+1 TJm
+(d) 4.9815 Tj
+-350 TJm
+(M) 8.85711 Tj
+1 TJm
+(ark) 12.7228 Tj
+-349 TJm
+(Adler') 26.0034 Tj
+55 TJm
+(s) 3.87561 Tj
+-349 TJm
+(e) 4.42357 Tj
+15 TJm
+(xcellent) 31.5429 Tj
+[1 0 0 1 516.09 120.835] cm
+0 g
+0 G
+[1 0 0 1 -516.09 -120.835] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+516.09 120.835 Td
+/F130_0 9.963 Tf
+(zlib) 23.9112 Tj
+[1 0 0 1 540 120.835] cm
+0 g
+0 G
+[1 0 0 1 -540 -120.835] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 108.88 Td
+/F128_0 9.963 Tf
+(library) 26.5614 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 106.723] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -96.761] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 86.962 Td
+/F128_0 9.963 Tf
+(All) 12.7327 Tj
+-242 TJm
+(e) 4.42357 Tj
+15 TJm
+(xternally) 35.4185 Tj
+-241 TJm
+(visible) 26.5713 Tj
+-242 TJm
+(symbols) 33.2166 Tj
+-242 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-241 TJm
+(names) 25.4555 Tj
+-242 TJm
+(be) 9.40507 Tj
+15 TJm
+(ginning) 30.4469 Tj
+[1 0 0 1 284.687 86.962] cm
+0 g
+0 G
+[1 0 0 1 -284.687 -86.962] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+284.687 86.962 Td
+/F130_0 9.963 Tf
+(BZ2_) 23.9112 Tj
+[1 0 0 1 308.597 86.962] cm
+0 g
+0 G
+[1 0 0 1 -308.597 -86.962] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+308.597 86.962 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-615 TJm
+(T) 6.08739 Tj
+1 TJm
+(his) 11.6268 Tj
+-242 TJm
+(is) 6.64532 Tj
+-242 TJm
+(ne) 9.40507 Tj
+25 TJm
+(w) 7.19329 Tj
+-242 TJm
+(in) 7.75121 Tj
+-241 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersion) 24.3496 Tj
+-242 TJm
+(1.0.) 14.9445 Tj
+-615 TJm
+(The) 15.4925 Tj
+-241 TJm
+(intention) 35.4284 Tj
+-242 TJm
+(is) 6.64532 Tj
+-242 TJm
+(to) 7.75121 Tj
+-241 TJm
+(minimise) 37.0922 Tj
+72 75.007 Td
+(pollution) 35.9864 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(namespaces) 47.5833 Tj
+-249 TJm
+(of) 8.29918 Tj
+-250 TJm
+(library) 26.5614 Tj
+-250 TJm
+(clients.) 28.5041 Tj
+[1 0 0 1 72 72.85] cm
+0 g
+0 G
+[1 0 0 1 0 -21.998] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 4.384 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 43.064 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -498.225 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+541.288 50.951 Td
+/F128_0 9.963 Tf
+(8) 4.9815 Tj
+[1 0 0 1 455.161 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.599 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -15.037 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 12 12
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 4.384 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -352.044 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+436.124 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip) 27.6772 Tj
+1 TJm
+(2) 4.9815 Tj
+[1 0 0 1 267.964 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -15.037 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(T) 6.08739 Tj
+80 TJm
+(o) 4.9815 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-250 TJm
+(part) 15.4925 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+-250 TJm
+(yo) 9.963 Tj
+1 TJm
+(u) 4.9815 Tj
+-250 TJm
+(need) 18.8101 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 240.567 710.037] cm
+0 g
+0 G
+[1 0 0 1 -240.567 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+240.567 710.037 Td
+/F130_0 9.963 Tf
+(#include) 47.8224 Tj
+-600 TJm
+(<bzlib.h>) 53.8002 Tj
+[1 0 0 1 348.163 710.037] cm
+0 g
+0 G
+[1 0 0 1 -348.163 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+350.654 710.037 Td
+/F128_0 9.963 Tf
+(into) 15.5024 Tj
+-250 TJm
+(your) 18.2622 Tj
+-250 TJm
+(sources.) 32.3698 Tj
+[1 0 0 1 72 707.881] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -697.918] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 679.416 Td
+/F121_0 17.215 Tf
+(3.1.1.) 43.0719 Tj
+-278 TJm
+(Lo) 21.0367 Tj
+15 TJm
+(w-le) 33.4832 Tj
+15 TJm
+(vel) 23.9289 Tj
+-278 TJm
+(summar) 66.9664 Tj
+-10 TJm
+(y) 9.57154 Tj
+[1 0 0 1 72 675.853] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -665.89] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 657.498 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-212 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace) 13.2707 Tj
+-212 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vides) 21.0319 Tj
+-211 TJm
+(services) 32.0908 Tj
+-212 TJm
+(for) 11.6169 Tj
+-212 TJm
+(compressing) 50.363 Tj
+-212 TJm
+(and) 14.3866 Tj
+-212 TJm
+(decompressi) 49.805 Tj
+1 TJm
+(ng) 9.963 Tj
+-212 TJm
+(data) 16.5984 Tj
+-212 TJm
+(in) 7.75121 Tj
+-212 TJm
+(memory) 33.2067 Tj
+65 TJm
+(.) 2.49075 Tj
+-595 TJm
+(There') 26.5514 Tj
+55 TJm
+(s) 3.87561 Tj
+-211 TJm
+(no) 9.963 Tj
+-212 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vision) 24.3595 Tj
+-212 TJm
+(for) 11.6169 Tj
+-212 TJm
+(dealing) 29.3311 Tj
+72 645.543 Td
+(with) 17.7142 Tj
+-213 TJm
+(\002les,) 19.0991 Tj
+-220 TJm
+(streams) 30.437 Tj
+-213 TJm
+(or) 8.29918 Tj
+-213 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-213 TJm
+(other) 20.474 Tj
+-213 TJm
+(I/O) 13.2807 Tj
+-213 TJm
+(mechanisms,) 51.7478 Tj
+-220 TJm
+(just) 14.3965 Tj
+-213 TJm
+(straight) 29.889 Tj
+-213 TJm
+(memory-to-memory) 80.7999 Tj
+-213 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork.) 15.7714 Tj
+-595 TJm
+(In) 8.29918 Tj
+-213 TJm
+(f) 3.31768 Tj
+10 TJm
+(act,) 14.1076 Tj
+-220 TJm
+(this) 14.3965 Tj
+-213 TJm
+(part) 15.4925 Tj
+-213 TJm
+(of) 8.29918 Tj
+-213 TJm
+(the) 12.1748 Tj
+-213 TJm
+(library) 26.5614 Tj
+72 633.588 Td
+(can) 13.8286 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(compiled) 37.0823 Tj
+-250 TJm
+(without) 30.4469 Tj
+-250 TJm
+(incl) 14.9445 Tj
+1 TJm
+(usion) 21.5898 Tj
+-250 TJm
+(of) 8.29918 Tj
+[1 0 0 1 222.534 633.588] cm
+0 g
+0 G
+[1 0 0 1 -222.534 -633.588] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+222.534 633.588 Td
+/F130_0 9.963 Tf
+(stdio.h) 41.8446 Tj
+[1 0 0 1 264.377 633.588] cm
+0 g
+0 G
+[1 0 0 1 -264.377 -633.588] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+264.377 633.588 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(may) 17.1563 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(helpful) 28.2252 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(emb) 17.1563 Tj
+1 TJm
+(edded) 23.7916 Tj
+-250 TJm
+(applications.) 50.6419 Tj
+[1 0 0 1 72 631.431] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -621.469] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 611.67 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-250 TJm
+(lo) 7.75121 Tj
+25 TJm
+(w-le) 17.7043 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(part) 15.4925 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(libra) 18.2622 Tj
+1 TJm
+(ry) 8.29918 Tj
+-250 TJm
+(has) 13.2807 Tj
+-250 TJm
+(no) 9.963 Tj
+-250 TJm
+(global) 24.9075 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(ariables) 30.9849 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(therefore) 35.9565 Tj
+-250 TJm
+(thread-safe.) 46.7464 Tj
+[1 0 0 1 72 609.513] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -599.551] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 589.752 Td
+/F128_0 9.963 Tf
+(Six) 13.2906 Tj
+-875 TJm
+(routines) 32.1008 Tj
+-876 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e) 4.42357 Tj
+-875 TJm
+(up) 9.963 Tj
+-875 TJm
+(the) 12.1748 Tj
+-876 TJm
+(lo) 7.75121 Tj
+25 TJm
+(w) 7.19329 Tj
+-875 TJm
+(le) 7.19329 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-875 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace:) 16.0404 Tj
+[1 0 0 1 308.791 589.752] cm
+0 g
+0 G
+[1 0 0 1 -308.791 -589.752] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+308.791 589.752 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 416.387 589.752] cm
+0 g
+0 G
+[1 0 0 1 -416.387 -589.752] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+416.387 589.752 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 429.158 589.752] cm
+0 g
+0 G
+[1 0 0 1 -429.158 -589.752] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+429.158 589.752 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 512.844 589.752] cm
+0 g
+0 G
+[1 0 0 1 -512.844 -589.752] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+512.844 589.752 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-1032 TJm
+(and) 14.3866 Tj
+[1 0 0 1 72 577.797] cm
+0 g
+0 G
+[1 0 0 1 -72 -577.797] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 577.797 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressEnd) 101.623 Tj
+[1 0 0 1 173.619 577.797] cm
+0 g
+0 G
+[1 0 0 1 -173.619 -577.797] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+186.15 577.797 Td
+/F128_0 9.963 Tf
+(for) 11.6169 Tj
+-1258 TJm
+(compression,) 52.8537 Tj
+-1509 TJm
+(and) 14.3866 Tj
+-1258 TJm
+(a) 4.42357 Tj
+-1258 TJm
+(correspond) 44.2656 Tj
+1 TJm
+(ing) 12.7327 Tj
+-1258 TJm
+(trio) 13.8386 Tj
+[1 0 0 1 417.958 577.797] cm
+0 g
+0 G
+[1 0 0 1 -417.958 -577.797] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+417.958 577.797 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompressInit) 119.556 Tj
+[1 0 0 1 537.509 577.797] cm
+0 g
+0 G
+[1 0 0 1 -537.509 -577.797] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+537.509 577.797 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 72 565.842] cm
+0 g
+0 G
+[1 0 0 1 -72 -565.842] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 565.842 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 167.641 565.842] cm
+0 g
+0 G
+[1 0 0 1 -167.641 -565.842] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+172.707 565.842 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 192.158 565.842] cm
+0 g
+0 G
+[1 0 0 1 -192.158 -565.842] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+192.158 565.842 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompressEnd) 113.578 Tj
+[1 0 0 1 305.732 565.842] cm
+0 g
+0 G
+[1 0 0 1 -305.732 -565.842] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+310.798 565.842 Td
+/F128_0 9.963 Tf
+(for) 11.6169 Tj
+-508 TJm
+(decompression.) 62.2588 Tj
+-2171 TJm
+(The) 15.4925 Tj
+[1 0 0 1 431.918 565.842] cm
+0 g
+0 G
+[1 0 0 1 -431.918 -565.842] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+431.918 565.842 Td
+/F130_0 9.963 Tf
+(*Init) 29.889 Tj
+[1 0 0 1 461.805 565.842] cm
+0 g
+0 G
+[1 0 0 1 -461.805 -565.842] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+466.871 565.842 Td
+/F128_0 9.963 Tf
+(functions) 37.0823 Tj
+-508 TJm
+(allocate) 30.9849 Tj
+72 553.887 Td
+(memory) 33.2067 Tj
+-574 TJm
+(f) 3.31768 Tj
+1 TJm
+(or) 8.29918 Tj
+-574 TJm
+(compression/decompression) 112.901 Tj
+-573 TJm
+(and) 14.3866 Tj
+-574 TJm
+(do) 9.963 Tj
+-573 TJm
+(other) 20.474 Tj
+-574 TJm
+(initialisations,) 56.1913 Tj
+-654 TJm
+(whilst) 24.3595 Tj
+-574 TJm
+(the) 12.1748 Tj
+[1 0 0 1 419.503 553.887] cm
+0 g
+0 G
+[1 0 0 1 -419.503 -553.887] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+419.503 553.887 Td
+/F130_0 9.963 Tf
+(*End) 23.9112 Tj
+[1 0 0 1 443.413 553.887] cm
+0 g
+0 G
+[1 0 0 1 -443.413 -553.887] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+449.128 553.887 Td
+/F128_0 9.963 Tf
+(functions) 37.0823 Tj
+-573 TJm
+(close) 20.474 Tj
+-574 TJm
+(do) 9.963 Tj
+25 TJm
+(wn) 12.1748 Tj
+72 541.932 Td
+(operations) 41.5059 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(release) 27.6573 Tj
+-250 TJm
+(mem) 19.926 Tj
+1 TJm
+(ory) 13.2807 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 539.775] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -529.812] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 520.014 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-303 TJm
+(real) 14.9345 Tj
+-303 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork) 13.2807 Tj
+-303 TJm
+(is) 6.64532 Tj
+-303 TJm
+(done) 19.3681 Tj
+-303 TJm
+(by) 9.963 Tj
+[1 0 0 1 176.892 520.014] cm
+0 g
+0 G
+[1 0 0 1 -176.892 -520.014] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+176.892 520.014 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 260.578 520.014] cm
+0 g
+0 G
+[1 0 0 1 -260.578 -520.014] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+263.598 520.014 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 281.003 520.014] cm
+0 g
+0 G
+[1 0 0 1 -281.003 -520.014] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+281.003 520.014 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 376.645 520.014] cm
+0 g
+0 G
+[1 0 0 1 -376.645 -520.014] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+376.645 520.014 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-938 TJm
+(These) 23.7916 Tj
+-303 TJm
+(compress) 37.6303 Tj
+-303 TJm
+(and) 14.3866 Tj
+-303 TJm
+(decompress) 47.0353 Tj
+-303 TJm
+(data) 16.5984 Tj
+72 508.059 Td
+(from) 19.3681 Tj
+-205 TJm
+(a) 4.42357 Tj
+-205 TJm
+(user) 16.5984 Tj
+20 TJm
+(-supplied) 37.0823 Tj
+-205 TJm
+(input) 20.4839 Tj
+-205 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-205 TJm
+(to) 7.75121 Tj
+-205 TJm
+(a) 4.42357 Tj
+-206 TJm
+(use) 13.2807 Tj
+1 TJm
+(r) 3.31768 Tj
+20 TJm
+(-supplied) 37.0823 Tj
+-205 TJm
+(output) 25.4654 Tj
+-206 TJm
+(b) 4.9815 Tj
+20 TJm
+(u) 4.9815 Tj
+1 TJm
+(f) 3.31768 Tj
+25 TJm
+(fer) 11.0589 Tj
+55 TJm
+(.) 2.49075 Tj
+-591 TJm
+(T) 6.08739 Tj
+1 TJm
+(hese) 17.7043 Tj
+-206 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+1 TJm
+(s) 3.87561 Tj
+-206 TJm
+(can) 13.8286 Tj
+-205 TJm
+(be) 9.40507 Tj
+-205 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-205 TJm
+(size;) 18.2622 Tj
+-220 TJm
+(arbitrary) 34.3026 Tj
+-205 TJm
+(quantities) 38.7461 Tj
+-205 TJm
+(of) 8.29918 Tj
+72 496.104 Td
+(data) 16.5984 Tj
+-258 TJm
+(are) 12.1648 Tj
+-258 TJm
+(handl) 22.1378 Tj
+1 TJm
+(ed) 9.40507 Tj
+-258 TJm
+(by) 9.963 Tj
+-258 TJm
+(making) 29.889 Tj
+-258 TJm
+(repeated) 33.7447 Tj
+-258 TJm
+(cal) 11.6169 Tj
+1 TJm
+(ls) 6.64532 Tj
+-258 TJm
+(to) 7.75121 Tj
+-258 TJm
+(these) 20.474 Tj
+-258 TJm
+(functions.) 39.573 Tj
+-667 TJm
+(This) 17.7142 Tj
+-258 TJm
+(is) 6.64532 Tj
+-257 TJm
+(a) 4.42357 Tj
+-258 TJm
+(\003e) 9.963 Tj
+15 TJm
+(xible) 19.926 Tj
+-258 TJm
+(mechanism) 45.3815 Tj
+-258 TJm
+(allo) 14.9445 Tj
+25 TJm
+(wing) 19.926 Tj
+-257 TJm
+(a) 4.42357 Tj
+-258 TJm
+(consumer) 38.7361 Tj
+20 TJm
+(-pull) 18.8201 Tj
+72 484.148 Td
+(style) 18.8201 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(acti) 14.3866 Tj
+25 TJm
+(vity) 15.5024 Tj
+65 TJm
+(,) 2.49075 Tj
+-250 TJm
+(or) 8.29918 Tj
+-250 TJm
+(producer) 35.4085 Tj
+20 TJm
+(-p) 8.29918 Tj
+1 TJm
+(ush,) 16.3294 Tj
+-250 TJm
+(or) 8.29918 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(mixture) 30.9949 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(both.) 20.205 Tj
+[1 0 0 1 72 481.992] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -472.029] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 453.527 Td
+/F121_0 17.215 Tf
+(3.1.2.) 43.0719 Tj
+-278 TJm
+(High-le) 58.3416 Tj
+15 TJm
+(vel) 23.9289 Tj
+-278 TJm
+(summar) 66.9664 Tj
+-10 TJm
+(y) 9.57154 Tj
+[1 0 0 1 72 449.697] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -439.734] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 431.609 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-284 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace) 13.2707 Tj
+-284 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vides) 21.0319 Tj
+-284 TJm
+(some) 21.0319 Tj
+-284 TJm
+(handy) 24.3496 Tj
+-284 TJm
+(wrappers) 36.5144 Tj
+-284 TJm
+(around) 27.6673 Tj
+-284 TJm
+(the) 12.1748 Tj
+-285 TJm
+(lo) 7.75121 Tj
+25 TJm
+(w-l) 13.2807 Tj
+1 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-285 TJm
+(interf) 21.5799 Tj
+10 TJm
+(a) 4.42357 Tj
+1 TJm
+(ce) 8.84714 Tj
+-285 TJm
+(to) 7.75121 Tj
+-284 TJm
+(f) 3.31768 Tj
+10 TJm
+(acilitate) 31.5429 Tj
+-284 TJm
+(reading) 29.879 Tj
+-284 TJm
+(and) 14.3866 Tj
+-284 TJm
+(writing) 28.7831 Tj
+[1 0 0 1 510.112 431.609] cm
+0 g
+0 G
+[1 0 0 1 -510.112 -431.609] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+510.112 431.609 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 540 431.609] cm
+0 g
+0 G
+[1 0 0 1 -540 -431.609] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 419.654 Td
+/F128_0 9.963 Tf
+(format) 26.5614 Tj
+-346 TJm
+(\002les) 16.6083 Tj
+-347 TJm
+(\() 3.31768 Tj
+[1 0 0 1 125.391 419.654] cm
+0 g
+0 G
+[1 0 0 1 -125.391 -419.654] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+125.391 419.654 Td
+/F130_0 9.963 Tf
+(.bz2) 23.9112 Tj
+[1 0 0 1 149.301 419.654] cm
+0 g
+0 G
+[1 0 0 1 -149.301 -419.654] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+152.754 419.654 Td
+/F128_0 9.963 Tf
+(\002les\).) 22.4168 Tj
+-1199 TJm
+(The) 15.4925 Tj
+-347 TJm
+(routines) 32.1008 Tj
+-346 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vide) 17.1563 Tj
+-347 TJm
+(hooks) 23.8016 Tj
+-346 TJm
+(to) 7.75121 Tj
+-347 TJm
+(f) 3.31768 Tj
+10 TJm
+(acilitate) 31.5429 Tj
+-346 TJm
+(reading) 29.879 Tj
+-347 TJm
+(\002les) 16.6083 Tj
+-346 TJm
+(in) 7.75121 Tj
+-347 TJm
+(which) 24.3496 Tj
+-346 TJm
+(the) 12.1748 Tj
+[1 0 0 1 460.049 419.654] cm
+0 g
+0 G
+[1 0 0 1 -460.049 -419.654] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+460.049 419.654 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 489.937 419.654] cm
+0 g
+0 G
+[1 0 0 1 -489.937 -419.654] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+493.39 419.654 Td
+/F128_0 9.963 Tf
+(data) 16.5984 Tj
+-346 TJm
+(stream) 26.5614 Tj
+72 407.699 Td
+(is) 6.64532 Tj
+-339 TJm
+(embedded) 40.9479 Tj
+-339 TJm
+(within) 25.4654 Tj
+-339 TJm
+(some) 21.0319 Tj
+-339 TJm
+(lar) 10.511 Tj
+18 TJm
+(ger) 12.7228 Tj
+20 TJm
+(-scale) 23.2337 Tj
+-339 TJm
+(\002le) 12.7327 Tj
+-339 TJm
+(st) 6.64532 Tj
+1 TJm
+(ructure,) 30.706 Tj
+-362 TJm
+(or) 8.29918 Tj
+-339 TJm
+(where) 24.3396 Tj
+-339 TJm
+(there) 19.916 Tj
+-339 TJm
+(are) 12.1648 Tj
+-339 TJm
+(m) 7.75121 Tj
+1 TJm
+(ultiple) 25.4654 Tj
+[1 0 0 1 400.941 407.699] cm
+0 g
+0 G
+[1 0 0 1 -400.941 -407.699] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+400.941 407.699 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 430.829 407.699] cm
+0 g
+0 G
+[1 0 0 1 -430.829 -407.699] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.207 407.699 Td
+/F128_0 9.963 Tf
+(data) 16.5984 Tj
+-339 TJm
+(streams) 30.437 Tj
+-339 TJm
+(concatenated) 52.0069 Tj
+72 395.744 Td
+(end-to-end.) 45.6505 Tj
+[1 0 0 1 72 395.644] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -385.682] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 373.826 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-332 TJm
+(reading) 29.879 Tj
+-333 TJm
+(\002) 5.53943 Tj
+1 TJm
+(les,) 13.5596 Tj
+[1 0 0 1 144.803 373.826] cm
+0 g
+0 G
+[1 0 0 1 -144.803 -373.826] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+144.803 373.826 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadOpen) 83.6892 Tj
+[1 0 0 1 228.489 373.826] cm
+0 g
+0 G
+[1 0 0 1 -228.489 -373.826] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+228.489 373.826 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 234.496 373.826] cm
+0 g
+0 G
+[1 0 0 1 -234.496 -373.826] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+234.496 373.826 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 294.272 373.826] cm
+0 g
+0 G
+[1 0 0 1 -294.272 -373.826] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+294.272 373.826 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 300.279 373.826] cm
+0 g
+0 G
+[1 0 0 1 -300.279 -373.826] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+300.279 373.826 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadClose) 89.667 Tj
+[1 0 0 1 389.942 373.826] cm
+0 g
+0 G
+[1 0 0 1 -389.942 -373.826] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+393.253 373.826 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 410.951 373.826] cm
+0 g
+0 G
+[1 0 0 1 -410.951 -373.826] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+410.951 373.826 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadGetUnused) 113.578 Tj
+[1 0 0 1 524.525 373.826] cm
+0 g
+0 G
+[1 0 0 1 -524.525 -373.826] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+527.836 373.826 Td
+/F128_0 9.963 Tf
+(are) 12.1648 Tj
+72 361.871 Td
+(supplied.) 36.2554 Tj
+-620 TJm
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-250 TJm
+(writing) 28.7831 Tj
+-250 TJm
+(\002les,) 19.0991 Tj
+[1 0 0 1 183.471 361.871] cm
+0 g
+0 G
+[1 0 0 1 -183.471 -361.871] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+183.471 361.871 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteOpen) 89.667 Tj
+[1 0 0 1 273.135 361.871] cm
+0 g
+0 G
+[1 0 0 1 -273.135 -361.871] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+273.135 361.871 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 278.116 361.871] cm
+0 g
+0 G
+[1 0 0 1 -278.116 -361.871] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+278.116 361.871 Td
+/F130_0 9.963 Tf
+(BZ2_bzWrite) 65.7558 Tj
+[1 0 0 1 343.869 361.871] cm
+0 g
+0 G
+[1 0 0 1 -343.869 -361.871] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+346.36 361.871 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 363.237 361.871] cm
+0 g
+0 G
+[1 0 0 1 -363.237 -361.871] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+363.237 361.871 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteFinish) 101.623 Tj
+[1 0 0 1 464.856 361.871] cm
+0 g
+0 G
+[1 0 0 1 -464.856 -361.871] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+467.346 361.871 Td
+/F128_0 9.963 Tf
+(are) 12.1648 Tj
+-250 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+25 TJm
+(ailable.) 29.0521 Tj
+[1 0 0 1 72 359.714] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -349.752] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 339.953 Td
+/F128_0 9.963 Tf
+(As) 11.0689 Tj
+-374 TJm
+(with) 17.7142 Tj
+-374 TJm
+(the) 12.1748 Tj
+-374 TJm
+(lo) 7.75121 Tj
+25 TJm
+(w-le) 17.7043 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-374 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+-406 TJm
+(n) 4.9815 Tj
+1 TJm
+(o) 4.9815 Tj
+-375 TJm
+(global) 24.9075 Tj
+-374 TJm
+(v) 4.9815 Tj
+25 TJm
+(ariables) 30.9849 Tj
+-374 TJm
+(are) 12.1648 Tj
+-374 TJm
+(used) 18.2622 Tj
+-374 TJm
+(so) 8.85711 Tj
+-374 TJm
+(the) 12.1748 Tj
+-374 TJm
+(library) 26.5614 Tj
+-374 TJm
+(is) 6.64532 Tj
+-374 TJm
+(per) 12.7228 Tj
+-375 TJm
+(se) 8.29918 Tj
+-374 TJm
+(thread-safe.) 46.7464 Tj
+-1365 TJm
+(Ho) 12.1748 Tj
+25 TJm
+(we) 11.6169 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+40 TJm
+(,) 2.49075 Tj
+-405 TJm
+(if) 6.08739 Tj
+-374 TJm
+(I/O) 13.2807 Tj
+72 327.998 Td
+(errors) 23.2337 Tj
+-267 TJm
+(occur) 22.1278 Tj
+-267 TJm
+(whilst) 24.3595 Tj
+-267 TJm
+(reading) 29.879 Tj
+-267 TJm
+(or) 8.29918 Tj
+-267 TJm
+(writing) 28.7831 Tj
+-267 TJm
+(the) 12.1748 Tj
+-267 TJm
+(underlying) 43.1697 Tj
+-267 TJm
+(compressed) 47.0353 Tj
+-267 TJm
+(\002les,) 19.0991 Tj
+-271 TJm
+(you) 14.9445 Tj
+-267 TJm
+(may) 17.1563 Tj
+-267 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-267 TJm
+(to) 7.75121 Tj
+-267 TJm
+(consult) 28.7831 Tj
+[1 0 0 1 457.199 327.998] cm
+0 g
+0 G
+[1 0 0 1 -457.199 -327.998] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+457.199 327.998 Td
+/F130_0 9.963 Tf
+(errno) 29.889 Tj
+[1 0 0 1 487.087 327.998] cm
+0 g
+0 G
+[1 0 0 1 -487.087 -327.998] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+489.748 327.998 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-267 TJm
+(determine) 39.842 Tj
+72 316.043 Td
+(the) 12.1748 Tj
+-366 TJm
+(cau) 13.8286 Tj
+1 TJm
+(se) 8.29918 Tj
+-366 TJm
+(of) 8.29918 Tj
+-366 TJm
+(the) 12.1748 Tj
+-365 TJm
+(error) 19.3581 Tj
+55 TJm
+(.) 2.49075 Tj
+-1314 TJm
+(In) 8.29918 Tj
+-365 TJm
+(that) 14.9445 Tj
+-366 TJm
+(case,) 19.6371 Tj
+-394 TJm
+(you') 18.2622 Tj
+50 TJm
+(d) 4.9815 Tj
+-366 TJm
+(need) 18.8101 Tj
+-365 TJm
+(a) 4.42357 Tj
+-366 TJm
+(C) 6.64532 Tj
+-366 TJm
+(lib) 10.5209 Tj
+1 TJm
+(rary) 16.0404 Tj
+-366 TJm
+(which) 24.3496 Tj
+-366 TJm
+(corr) 16.0404 Tj
+1 TJm
+(ectly) 19.3681 Tj
+-366 TJm
+(supports) 33.7646 Tj
+[1 0 0 1 431.668 316.043] cm
+0 g
+0 G
+[1 0 0 1 -431.668 -316.043] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+431.668 316.043 Td
+/F130_0 9.963 Tf
+(errno) 29.889 Tj
+[1 0 0 1 461.556 316.043] cm
+0 g
+0 G
+[1 0 0 1 -461.556 -316.043] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+465.199 316.043 Td
+/F128_0 9.963 Tf
+(in) 7.75121 Tj
+-366 TJm
+(a) 4.42357 Tj
+-365 TJm
+(multithreaded) 55.3445 Tj
+72 304.088 Td
+(en) 9.40507 Tj
+40 TJm
+(vironment.) 43.4486 Tj
+[1 0 0 1 72 303.988] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -294.025] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 282.17 Td
+/F128_0 9.963 Tf
+(T) 6.08739 Tj
+80 TJm
+(o) 4.9815 Tj
+-243 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e) 4.42357 Tj
+-242 TJm
+(the) 12.1748 Tj
+-243 TJm
+(library) 26.5614 Tj
+-243 TJm
+(a) 4.42357 Tj
+-242 TJm
+(little) 18.2721 Tj
+-243 TJm
+(simpler) 29.889 Tj
+-243 TJm
+(and) 14.3866 Tj
+-242 TJm
+(more) 20.474 Tj
+-243 TJm
+(portable,) 35.1395 Tj
+[1 0 0 1 289.263 282.17] cm
+0 g
+0 G
+[1 0 0 1 -289.263 -282.17] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+289.263 282.17 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadOpen) 83.6892 Tj
+[1 0 0 1 372.949 282.17] cm
+0 g
+0 G
+[1 0 0 1 -372.949 -282.17] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+375.368 282.17 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 392.172 282.17] cm
+0 g
+0 G
+[1 0 0 1 -392.172 -282.17] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+392.172 282.17 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteOpen) 89.667 Tj
+[1 0 0 1 481.836 282.17] cm
+0 g
+0 G
+[1 0 0 1 -481.836 -282.17] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+484.254 282.17 Td
+/F128_0 9.963 Tf
+(require) 28.2152 Tj
+-243 TJm
+(you) 14.9445 Tj
+-242 TJm
+(to) 7.75121 Tj
+72 270.215 Td
+(pass) 17.1563 Tj
+-247 TJm
+(them) 19.926 Tj
+-247 TJm
+(\002le) 12.7327 Tj
+-248 TJm
+(handles) 30.437 Tj
+-247 TJm
+(\() 3.31768 Tj
+[1 0 0 1 165.421 270.215] cm
+0 g
+0 G
+[1 0 0 1 -165.421 -270.215] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+165.421 270.215 Td
+/F130_0 9.963 Tf
+(FILE*) 29.889 Tj
+[1 0 0 1 195.309 270.215] cm
+0 g
+0 G
+[1 0 0 1 -195.309 -270.215] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+195.309 270.215 Td
+/F128_0 9.963 Tf
+(s\)) 7.19329 Tj
+-247 TJm
+(which) 24.3496 Tj
+-247 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-248 TJm
+(pre) 12.7228 Tj
+25 TJm
+(viously) 29.341 Tj
+-247 TJm
+(been) 18.8101 Tj
+-247 TJm
+(opened) 28.7731 Tj
+-247 TJm
+(for) 11.6169 Tj
+-247 TJm
+(reading) 29.879 Tj
+-248 TJm
+(or) 8.29918 Tj
+-247 TJm
+(writing) 28.7831 Tj
+-247 TJm
+(respecti) 30.9849 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ely) 12.1748 Tj
+65 TJm
+(.) 2.49075 Tj
+-618 TJm
+(That) 18.2622 Tj
+-247 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+20 TJm
+(oids) 16.6083 Tj
+72 258.26 Td
+(portability) 41.5158 Tj
+-272 TJm
+(problems) 37.0823 Tj
+-272 TJm
+(associated) 40.9479 Tj
+-273 TJm
+(wi) 9.963 Tj
+1 TJm
+(th) 7.75121 Tj
+-273 TJm
+(\002le) 12.7327 Tj
+-272 TJm
+(operations) 41.5059 Tj
+-272 TJm
+(and) 14.3866 Tj
+-273 TJm
+(\002le) 12.7327 Tj
+-272 TJm
+(attrib) 21.0319 Tj
+20 TJm
+(utes,) 18.5411 Tj
+-278 TJm
+(whilst) 24.3595 Tj
+-272 TJm
+(not) 12.7327 Tj
+-272 TJm
+(being) 22.1378 Tj
+-273 TJm
+(mu) 12.7327 Tj
+1 TJm
+(ch) 9.40507 Tj
+-273 TJm
+(of) 8.29918 Tj
+-272 TJm
+(an) 9.40507 Tj
+-272 TJm
+(imposition) 42.6317 Tj
+-273 TJm
+(on) 9.963 Tj
+-272 TJm
+(the) 12.1748 Tj
+72 246.304 Td
+(programmer) 49.2471 Tj
+55 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 244.148] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -234.185] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 215.683 Td
+/F121_0 17.215 Tf
+(3.1.3.) 43.0719 Tj
+-278 TJm
+(Utility) 47.8233 Tj
+-278 TJm
+(functions) 77.4675 Tj
+-278 TJm
+(summar) 66.9664 Tj
+-10 TJm
+(y) 9.57154 Tj
+[1 0 0 1 72 212.12] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -202.157] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 193.765 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-273 TJm
+(v) 4.9815 Tj
+15 TJm
+(ery) 12.7228 Tj
+-273 TJm
+(simple) 26.5713 Tj
+-273 TJm
+(needs,) 25.1765 Tj
+[1 0 0 1 165.929 193.765] cm
+0 g
+0 G
+[1 0 0 1 -165.929 -193.765] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+165.929 193.765 Td
+/F130_0 9.963 Tf
+(BZ2_bzBuffToBuffCompress) 143.467 Tj
+[1 0 0 1 309.391 193.765] cm
+0 g
+0 G
+[1 0 0 1 -309.391 -193.765] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+312.112 193.765 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 329.219 193.765] cm
+0 g
+0 G
+[1 0 0 1 -329.219 -193.765] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+329.219 193.765 Td
+/F130_0 9.963 Tf
+(BZ2_bzBuffToBuffDecompre) 143.467 Tj
+1 TJm
+(ss) 11.9556 Tj
+[1 0 0 1 484.636 193.765] cm
+0 g
+0 G
+[1 0 0 1 -484.636 -193.765] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+487.357 193.765 Td
+/F128_0 9.963 Tf
+(are) 12.1648 Tj
+-273 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vided.) 24.6285 Tj
+72 181.81 Td
+(These) 23.7916 Tj
+-373 TJm
+(compress) 37.6303 Tj
+-374 TJm
+(data) 16.5984 Tj
+-373 TJm
+(in) 7.75121 Tj
+-374 TJm
+(memory) 33.2067 Tj
+-373 TJm
+(from) 19.3681 Tj
+-374 TJm
+(one) 14.3866 Tj
+-373 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-374 TJm
+(to) 7.75121 Tj
+-373 TJm
+(another) 29.879 Tj
+-374 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fe) 7.74125 Tj
+1 TJm
+(r) 3.31768 Tj
+-374 TJm
+(in) 7.75121 Tj
+-374 TJm
+(a) 4.42357 Tj
+-373 TJm
+(single) 23.8016 Tj
+-373 TJm
+(function) 33.2067 Tj
+-374 TJm
+(call.) 16.8773 Tj
+-1361 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-374 TJm
+(should) 26.5713 Tj
+-373 TJm
+(assess) 24.3496 Tj
+72 169.855 Td
+(whether) 32.0908 Tj
+-344 TJm
+(t) 2.76971 Tj
+1 TJm
+(hese) 17.7043 Tj
+-344 TJm
+(functions) 37.0823 Tj
+-344 TJm
+(ful\002) 16.6083 Tj
+1 TJm
+(ll) 5.53943 Tj
+-344 TJm
+(your) 18.2622 Tj
+-344 TJm
+(memory-to) 44.2756 Tj
+1 TJm
+(-memory) 36.5244 Tj
+-344 TJm
+(compression/decompressio) 107.919 Tj
+1 TJm
+(n) 4.9815 Tj
+-344 TJm
+(requirements) 52.0168 Tj
+-344 TJm
+(be) 9.40507 Tj
+1 TJm
+(fore) 16.0404 Tj
+-344 TJm
+(in) 7.75121 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(esting) 23.8016 Tj
+72 157.9 Td
+(ef) 7.74125 Tj
+25 TJm
+(fort) 14.3866 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(understanding) 56.4504 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(m) 7.75121 Tj
+1 TJm
+(ore) 12.7228 Tj
+-250 TJm
+(general) 29.3211 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(more) 20.474 Tj
+-250 TJm
+(comple) 29.3311 Tj
+15 TJm
+(x) 4.9815 Tj
+-250 TJm
+(lo) 7.75121 Tj
+25 TJm
+(w-le) 17.7043 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace.) 15.7615 Tj
+[1 0 0 1 72 155.743] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -145.78] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 135.982 Td
+/F128_0 9.963 Tf
+(Y) 7.19329 Tj
+110 TJm
+(oshioka) 30.9949 Tj
+-531 TJm
+(Tsuneo) 29.3311 Tj
+-531 TJm
+(\() 3.31768 Tj
+[1 0 0 1 152.317 135.982] cm
+0 g
+0 G
+[1 0 0 1 -152.317 -135.982] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+152.317 135.982 Td
+/F130_0 9.963 Tf
+(QWF00133@niftyserve.or.jp) 149.445 Tj
+[1 0 0 1 301.757 135.982] cm
+0 g
+0 G
+[1 0 0 1 -301.757 -135.982] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+307.046 135.982 Td
+/F128_0 9.963 Tf
+(/) 2.76971 Tj
+[1 0 0 1 315.105 135.982] cm
+0 g
+0 G
+[1 0 0 1 -315.105 -135.982] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+315.105 135.982 Td
+/F130_0 9.963 Tf
+(tsuneo-y@is.aist-nara.ac.j) 155.423 Tj
+1 TJm
+(p) 5.9778 Tj
+[1 0 0 1 476.5 135.982] cm
+0 g
+0 G
+[1 0 0 1 -476.5 -135.982] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+476.5 135.982 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-531 TJm
+(has) 13.2807 Tj
+-531 TJm
+(contrib) 28.2252 Tj
+20 TJm
+(u-) 8.29918 Tj
+72 124.027 Td
+(ted) 12.1748 Tj
+-486 TJm
+(s) 3.87561 Tj
+1 TJm
+(ome) 17.1563 Tj
+-486 TJm
+(functions) 37.0823 Tj
+-485 TJm
+(to) 7.75121 Tj
+-486 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-485 TJm
+(better) 22.6858 Tj
+[1 0 0 1 218.504 124.027] cm
+0 g
+0 G
+[1 0 0 1 -218.504 -124.027] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+218.504 124.027 Td
+/F130_0 9.963 Tf
+(zlib) 23.9112 Tj
+[1 0 0 1 242.415 124.027] cm
+0 g
+0 G
+[1 0 0 1 -242.415 -124.027] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+247.252 124.027 Td
+/F128_0 9.963 Tf
+(compatibility) 53.1426 Tj
+65 TJm
+(.) 2.49075 Tj
+-2033 TJm
+(These) 23.7916 Tj
+-486 TJm
+(functions) 37.0823 Tj
+-485 TJm
+(are) 12.1648 Tj
+[1 0 0 1 410.043 124.027] cm
+0 g
+0 G
+[1 0 0 1 -410.043 -124.027] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+410.043 124.027 Td
+/F130_0 9.963 Tf
+(BZ2_bzopen) 59.778 Tj
+[1 0 0 1 469.818 124.027] cm
+0 g
+0 G
+[1 0 0 1 -469.818 -124.027] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+469.818 124.027 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 477.734 124.027] cm
+0 g
+0 G
+[1 0 0 1 -477.734 -124.027] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+477.734 124.027 Td
+/F130_0 9.963 Tf
+(BZ2_bzread) 59.778 Tj
+[1 0 0 1 537.509 124.027] cm
+0 g
+0 G
+[1 0 0 1 -537.509 -124.027] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+537.509 124.027 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 72 112.072] cm
+0 g
+0 G
+[1 0 0 1 -72 -112.072] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 112.072 Td
+/F130_0 9.963 Tf
+(BZ2_bzwrite) 65.7558 Tj
+[1 0 0 1 137.753 112.072] cm
+0 g
+0 G
+[1 0 0 1 -137.753 -112.072] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+137.753 112.072 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 143.886 112.072] cm
+0 g
+0 G
+[1 0 0 1 -143.886 -112.072] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+143.886 112.072 Td
+/F130_0 9.963 Tf
+(BZ2_bzflush) 65.7558 Tj
+[1 0 0 1 209.64 112.072] cm
+0 g
+0 G
+[1 0 0 1 -209.64 -112.072] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+209.64 112.072 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 215.773 112.072] cm
+0 g
+0 G
+[1 0 0 1 -215.773 -112.072] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+215.773 112.072 Td
+/F130_0 9.963 Tf
+(BZ2_bzclose) 65.7558 Tj
+[1 0 0 1 281.526 112.072] cm
+0 g
+0 G
+[1 0 0 1 -281.526 -112.072] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+281.526 112.072 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 287.659 112.072] cm
+0 g
+0 G
+[1 0 0 1 -287.659 -112.072] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+287.659 112.072 Td
+/F130_0 9.963 Tf
+(BZ2_bzerror) 65.7558 Tj
+[1 0 0 1 353.413 112.072] cm
+0 g
+0 G
+[1 0 0 1 -353.413 -112.072] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+356.824 112.072 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 374.622 112.072] cm
+0 g
+0 G
+[1 0 0 1 -374.622 -112.072] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+374.622 112.072 Td
+/F130_0 9.963 Tf
+(BZ2_bzlibVersion) 95.6448 Tj
+[1 0 0 1 470.264 112.072] cm
+0 g
+0 G
+[1 0 0 1 -470.264 -112.072] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+470.264 112.072 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1175 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-342 TJm
+(may) 17.1563 Tj
+-343 TJm
+(\002nd) 15.5024 Tj
+72 100.117 Td
+(these) 20.474 Tj
+-333 TJm
+(functions) 37.0823 Tj
+-334 TJm
+(more) 20.474 Tj
+-333 TJm
+(con) 14.3866 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(enient) 24.3496 Tj
+-333 TJm
+(for) 11.6169 Tj
+-334 TJm
+(simple) 26.5713 Tj
+-333 TJm
+(\002le) 12.7327 Tj
+-334 TJm
+(r) 3.31768 Tj
+1 TJm
+(eading) 26.5614 Tj
+-334 TJm
+(and) 14.3866 Tj
+-333 TJm
+(writing,) 31.2739 Tj
+-354 TJm
+(than) 17.1563 Tj
+-334 TJm
+(those) 21.0319 Tj
+-333 TJm
+(in) 7.75121 Tj
+-334 TJm
+(the) 12.1748 Tj
+-333 TJm
+(high-le) 28.2252 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-333 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace.) 15.7615 Tj
+-1121 TJm
+(These) 23.7916 Tj
+72 88.161 Td
+(functions) 37.0823 Tj
+-229 TJm
+(are) 12.1648 Tj
+-228 TJm
+(not) 12.7327 Tj
+-229 TJm
+(\(yet\)) 18.8101 Tj
+-229 TJm
+(of) 8.29918 Tj
+25 TJm
+(\002cially) 27.6772 Tj
+-229 TJm
+(pa) 9.40507 Tj
+1 TJm
+(rt) 6.08739 Tj
+-229 TJm
+(of) 8.29918 Tj
+-229 TJm
+(the) 12.1748 Tj
+-229 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+-233 TJm
+(and) 14.3866 Tj
+-228 TJm
+(are) 12.1648 Tj
+-229 TJm
+(minimally) 40.9679 Tj
+-229 TJm
+(documented) 48.6991 Tj
+-228 TJm
+(here.) 19.6371 Tj
+-606 TJm
+(If) 6.63536 Tj
+-229 TJm
+(the) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-229 TJm
+(break,) 24.6186 Tj
+-233 TJm
+(you) 14.9445 Tj
+-228 TJm
+(get) 12.1748 Tj
+-229 TJm
+(to) 7.75121 Tj
+-229 TJm
+(k) 4.9815 Tj
+10 TJm
+(eep) 13.8286 Tj
+72 76.206 Td
+(all) 9.963 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(pieces.) 27.3883 Tj
+-310 TJm
+(I) 3.31768 Tj
+-250 TJm
+(hope) 19.3681 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(docum) 27.1193 Tj
+1 TJm
+(ent) 12.1748 Tj
+-250 TJm
+(them) 19.926 Tj
+-250 TJm
+(properly) 33.7546 Tj
+-250 TJm
+(when) 21.5799 Tj
+-250 TJm
+(time) 17.7142 Tj
+-250 TJm
+(permits.) 32.3798 Tj
+[1 0 0 1 72 74.049] cm
+0 g
+0 G
+[1 0 0 1 0 -23.197] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 4.384 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.974] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 43.064 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -498.225 -51.071] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+541.288 51.071 Td
+/F128_0 9.963 Tf
+(9) 4.9815 Tj
+[1 0 0 1 455.161 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.599 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -15.037 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 13 13
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(Y) 7.19329 Tj
+110 TJm
+(oshioka) 30.9949 Tj
+-250 TJm
+(also) 16.0504 Tj
+-250 TJm
+(contrib) 28.2252 Tj
+20 TJm
+(uted) 17.1563 Tj
+-250 TJm
+(mo) 12.7327 Tj
+1 TJm
+(di\002cations) 41.5158 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(allo) 14.9445 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(library) 26.5614 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(uilt) 13.2906 Tj
+-250 TJm
+(as) 8.29918 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(W) 9.40507 Tj
+40 TJm
+(indo) 17.7142 Tj
+25 TJm
+(ws) 11.0689 Tj
+-250 TJm
+(D) 7.19329 Tj
+1 TJm
+(LL.) 14.6655 Tj
+[1 0 0 1 72 707.881] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.744] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -698.137] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 675.504 Td
+/F121_0 20.659 Tf
+(3.2.) 34.4592 Tj
+-278 TJm
+(Err) 29.8523 Tj
+20 TJm
+(or) 20.659 Tj
+-278 TJm
+(handling) 86.0861 Tj
+[1 0 0 1 72 670.907] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.743] cm
+0 g
+0 G
+[1 0 0 1 -72 -661.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 653.805 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-214 TJm
+(library) 26.5614 Tj
+-215 TJm
+(is) 6.64532 Tj
+-214 TJm
+(designed) 35.4185 Tj
+-215 TJm
+(to) 7.75121 Tj
+-214 TJm
+(reco) 17.1463 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-214 TJm
+(cleanly) 28.7731 Tj
+-215 TJm
+(in) 7.75121 Tj
+-214 TJm
+(all) 9.963 Tj
+-215 TJm
+(situati) 24.3595 Tj
+1 TJm
+(ons,) 16.3294 Tj
+-222 TJm
+(including) 37.6402 Tj
+-214 TJm
+(the) 12.1748 Tj
+-215 TJm
+(w) 7.19329 Tj
+10 TJm
+(orst-case) 35.4085 Tj
+-214 TJm
+(situation) 34.3225 Tj
+-214 TJm
+(of) 8.29918 Tj
+-215 TJm
+(decompressing) 59.768 Tj
+-214 TJm
+(random) 30.437 Tj
+72 641.85 Td
+(data.) 19.0891 Tj
+-764 TJm
+(I'm) 14.3866 Tj
+-274 TJm
+(not) 12.7327 Tj
+-274 TJm
+(100%) 23.2437 Tj
+-274 TJm
+(sure) 16.5984 Tj
+-274 TJm
+(that) 14.9445 Tj
+-274 TJm
+(it) 5.53943 Tj
+-274 TJm
+(can) 13.8286 Tj
+-274 TJm
+(al) 7.19329 Tj
+10 TJm
+(w) 7.19329 Tj
+10 TJm
+(ays) 13.2807 Tj
+-274 TJm
+(do) 9.963 Tj
+-274 TJm
+(this,) 16.8873 Tj
+-280 TJm
+(so) 8.85711 Tj
+-274 TJm
+(you) 14.9445 Tj
+-274 TJm
+(might) 23.2536 Tj
+-274 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-274 TJm
+(to) 7.75121 Tj
+-274 TJm
+(add) 14.3866 Tj
+-274 TJm
+(a) 4.42357 Tj
+-274 TJm
+(signal) 23.8016 Tj
+-274 TJm
+(handler) 29.879 Tj
+-274 TJm
+(to) 7.75121 Tj
+-274 TJm
+(catch) 21.0219 Tj
+-274 TJm
+(se) 8.29918 Tj
+15 TJm
+(gmentation) 44.8335 Tj
+72 629.895 Td
+(violations) 39.304 Tj
+-273 TJm
+(during) 26.0134 Tj
+-273 TJm
+(decompression) 59.768 Tj
+-273 TJm
+(if) 6.08739 Tj
+-273 TJm
+(you) 14.9445 Tj
+-273 TJm
+(are) 12.1648 Tj
+-273 TJm
+(feeling) 27.6673 Tj
+-273 TJm
+(especially) 39.842 Tj
+-273 TJm
+(paranoid.) 37.3513 Tj
+-758 TJm
+(I) 3.31768 Tj
+-273 TJm
+(w) 7.19329 Tj
+10 TJm
+(ould) 17.7142 Tj
+-273 TJm
+(be) 9.40507 Tj
+-273 TJm
+(interested) 38.7361 Tj
+-273 TJm
+(in) 7.75121 Tj
+-273 TJm
+(hearing) 29.879 Tj
+-273 TJm
+(more) 20.474 Tj
+-273 TJm
+(about) 22.1378 Tj
+72 617.939 Td
+(the) 12.1748 Tj
+-250 TJm
+(rob) 13.2807 Tj
+20 TJm
+(ustness) 28.7831 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(library) 26.5614 Tj
+-250 TJm
+(t) 2.76971 Tj
+1 TJm
+(o) 4.9815 Tj
+-250 TJm
+(corrupted) 38.1782 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-250 TJm
+(data.) 19.0891 Tj
+[1 0 0 1 72 615.783] cm
+0 g
+0 G
+[1 0 0 1 0 -9.744] cm
+0 g
+0 G
+[1 0 0 1 -72 -606.039] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 596.241 Td
+/F128_0 9.963 Tf
+(V) 7.19329 Tj
+111 TJm
+(ersion) 24.3496 Tj
+-251 TJm
+(1.0.3) 19.926 Tj
+-251 TJm
+(more) 20.474 Tj
+-251 TJm
+(rob) 13.2807 Tj
+20 TJm
+(ust) 11.6268 Tj
+-251 TJm
+(in) 7.75121 Tj
+-251 TJm
+(this) 14.3965 Tj
+-251 TJm
+(respect) 28.2152 Tj
+-251 TJm
+(than) 17.1563 Tj
+-251 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-251 TJm
+(pre) 12.7228 Tj
+25 TJm
+(vious) 21.5898 Tj
+-251 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersion.) 26.8403 Tj
+-626 TJm
+(In) 8.29918 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(estig) 18.8201 Tj
+5 TJm
+(ations) 23.8016 Tj
+-251 TJm
+(with) 17.7142 Tj
+-251 TJm
+(V) 7.19329 Tj
+111 TJm
+(algrind) 28.2252 Tj
+-251 TJm
+(\(a) 7.74125 Tj
+-251 TJm
+(tool) 15.5024 Tj
+-251 TJm
+(for) 11.6169 Tj
+-251 TJm
+(detecting) 36.5244 Tj
+72 584.285 Td
+(problems) 37.0823 Tj
+-421 TJm
+(with) 17.7142 Tj
+-422 TJm
+(memory) 33.2067 Tj
+-421 TJm
+(management\)) 54.2286 Tj
+-422 TJm
+(indicat) 27.1193 Tj
+1 TJm
+(e) 4.42357 Tj
+-422 TJm
+(that,) 17.4353 Tj
+-464 TJm
+(at) 7.19329 Tj
+-422 TJm
+(least) 18.2622 Tj
+-421 TJm
+(for) 11.6169 Tj
+-422 TJm
+(the) 12.1748 Tj
+-421 TJm
+(fe) 7.74125 Tj
+25 TJm
+(w) 7.19329 Tj
+-422 TJm
+(\002les) 16.6083 Tj
+-421 TJm
+(I) 3.31768 Tj
+-422 TJm
+(tested,) 25.7344 Tj
+-464 TJm
+(all) 9.963 Tj
+-422 TJm
+(single) 23.8016 Tj
+1 TJm
+(-bit) 13.8386 Tj
+-422 TJm
+(errors) 23.2337 Tj
+-421 TJm
+(in) 7.75121 Tj
+-422 TJm
+(the) 12.1748 Tj
+72 572.33 Td
+(decompressed) 56.4404 Tj
+-342 TJm
+(d) 4.9815 Tj
+1 TJm
+(ata) 11.6169 Tj
+-342 TJm
+(are) 12.1648 Tj
+-342 TJm
+(caught) 26.5614 Tj
+-342 TJm
+(pro) 13.2807 Tj
+1 TJm
+(perly) 20.474 Tj
+65 TJm
+(,) 2.49075 Tj
+-365 TJm
+(with) 17.7142 Tj
+-342 TJm
+(no) 9.963 Tj
+-342 TJm
+(s) 3.87561 Tj
+1 TJm
+(e) 4.42357 Tj
+15 TJm
+(gmentation) 44.8335 Tj
+-342 TJm
+(f) 3.31768 Tj
+10 TJm
+(aults,) 21.3109 Tj
+-365 TJm
+(no) 9.963 Tj
+-341 TJm
+(uses) 17.1563 Tj
+-342 TJm
+(of) 8.29918 Tj
+-342 TJm
+(uninitialise) 44.2855 Tj
+1 TJm
+(d) 4.9815 Tj
+-342 TJm
+(data,) 19.0891 Tj
+-365 TJm
+(no) 9.963 Tj
+-342 TJm
+(out) 12.7327 Tj
+-341 TJm
+(of) 8.29918 Tj
+-342 TJm
+(range) 22.1278 Tj
+72 560.375 Td
+(reads) 21.0219 Tj
+-260 TJm
+(or) 8.29918 Tj
+-261 TJm
+(writes,) 26.8403 Tj
+-263 TJm
+(and) 14.3866 Tj
+-261 TJm
+(no) 9.963 Tj
+-260 TJm
+(in\002nite) 28.2351 Tj
+-261 TJm
+(looping) 30.4469 Tj
+-260 TJm
+(in) 7.75121 Tj
+-261 TJm
+(the) 12.1748 Tj
+-260 TJm
+(decompressor) 55.3345 Tj
+55 TJm
+(.) 2.49075 Tj
+-342 TJm
+(So) 10.5209 Tj
+-260 TJm
+(it') 8.85711 Tj
+55 TJm
+(s) 3.87561 Tj
+-261 TJm
+(certainly) 34.8605 Tj
+-260 TJm
+(pretty) 23.2437 Tj
+-261 TJm
+(rob) 13.2807 Tj
+21 TJm
+(ust,) 14.1176 Tj
+-264 TJm
+(although) 34.8705 Tj
+-260 TJm
+(I) 3.31768 Tj
+-261 TJm
+(w) 7.19329 Tj
+10 TJm
+(ouldn') 26.0134 Tj
+18 TJm
+(t) 2.76971 Tj
+-260 TJm
+(claim) 22.1378 Tj
+72 548.42 Td
+(it) 5.53943 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(totally) 25.4654 Tj
+-250 TJm
+(bombproof.) 46.7663 Tj
+[1 0 0 1 72 546.263] cm
+0 g
+0 G
+[1 0 0 1 0 -9.743] cm
+0 g
+0 G
+[1 0 0 1 -72 -536.52] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 526.721 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-282 TJm
+(\002le) 12.7327 Tj
+[1 0 0 1 105.84 526.721] cm
+0 g
+0 G
+[1 0 0 1 -105.84 -526.721] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+105.84 526.721 Td
+/F130_0 9.963 Tf
+(bzlib.h) 41.8446 Tj
+[1 0 0 1 147.683 526.721] cm
+0 g
+0 G
+[1 0 0 1 -147.683 -526.721] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+150.491 526.721 Td
+/F128_0 9.963 Tf
+(contains) 33.2067 Tj
+-282 TJm
+(all) 9.963 Tj
+-282 TJm
+(d) 4.9815 Tj
+1 TJm
+(e\002nitions) 37.0922 Tj
+-282 TJm
+(needed) 28.2152 Tj
+-282 TJm
+(to) 7.75121 Tj
+-282 TJm
+(use) 13.2807 Tj
+-282 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-282 TJm
+(library) 26.5614 Tj
+65 TJm
+(.) 2.49075 Tj
+-811 TJm
+(In) 8.29918 Tj
+-282 TJm
+(particular) 38.1782 Tj
+40 TJm
+(,) 2.49075 Tj
+-290 TJm
+(you) 14.9445 Tj
+-282 TJm
+(shou) 18.8201 Tj
+1 TJm
+(ld) 7.75121 Tj
+-282 TJm
+(de\002nitely) 37.6402 Tj
+-282 TJm
+(not) 12.7327 Tj
+-282 TJm
+(include) 29.3311 Tj
+[1 0 0 1 72 514.766] cm
+0 g
+0 G
+[1 0 0 1 -72 -514.766] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 514.766 Td
+/F130_0 9.963 Tf
+(bzlib_private.h) 89.667 Tj
+[1 0 0 1 161.664 514.766] cm
+0 g
+0 G
+[1 0 0 1 -161.664 -514.766] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+161.664 514.766 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 513.202] cm
+0 g
+0 G
+[1 0 0 1 0 -9.744] cm
+0 g
+0 G
+[1 0 0 1 -72 -503.458] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 493.067 Td
+/F128_0 9.963 Tf
+(In) 8.29918 Tj
+[1 0 0 1 82.807 493.067] cm
+0 g
+0 G
+[1 0 0 1 -82.807 -493.067] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+82.807 493.067 Td
+/F130_0 9.963 Tf
+(bzlib.h) 41.8446 Tj
+[1 0 0 1 124.651 493.067] cm
+0 g
+0 G
+[1 0 0 1 -124.651 -493.067] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+124.651 493.067 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-252 TJm
+(the) 12.1748 Tj
+-252 TJm
+(v) 4.9815 Tj
+25 TJm
+(arious) 24.3496 Tj
+-252 TJm
+(return) 23.7916 Tj
+-251 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues) 20.474 Tj
+-252 TJm
+(are) 12.1648 Tj
+-252 TJm
+(de\002ned.) 31.8218 Tj
+-630 TJm
+(The) 15.4925 Tj
+-252 TJm
+(follo) 18.8201 Tj
+25 TJm
+(wing) 19.926 Tj
+-252 TJm
+(list) 12.1847 Tj
+-251 TJm
+(is) 6.64532 Tj
+-252 TJm
+(not) 12.7327 Tj
+-252 TJm
+(intended) 34.3126 Tj
+-252 TJm
+(as) 8.29918 Tj
+-251 TJm
+(an) 9.40507 Tj
+-252 TJm
+(e) 4.42357 Tj
+15 TJm
+(xhausti) 28.7831 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-252 TJm
+(description) 44.2756 Tj
+-251 TJm
+(of) 8.29918 Tj
+72 481.112 Td
+(the) 12.1748 Tj
+-236 TJm
+(circumstances) 56.4404 Tj
+-236 TJm
+(in) 7.75121 Tj
+-236 TJm
+(which) 24.3496 Tj
+-236 TJm
+(a) 4.42357 Tj
+-236 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-237 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+-236 TJm
+(may) 17.1563 Tj
+-236 TJm
+(be) 9.40507 Tj
+-236 TJm
+(returned) 33.1967 Tj
+-236 TJm
+(--) 6.63536 Tj
+-236 TJm
+(those) 21.0319 Tj
+-236 TJm
+(descriptions) 48.1512 Tj
+-236 TJm
+(are) 12.1648 Tj
+-236 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-236 TJm
+(later) 17.7043 Tj
+55 TJm
+(.) 2.49075 Tj
+-306 TJm
+(Rather) 26.5614 Tj
+40 TJm
+(,) 2.49075 Tj
+-239 TJm
+(it) 5.53943 Tj
+-236 TJm
+(is) 6.64532 Tj
+-236 TJm
+(intended) 34.3126 Tj
+-236 TJm
+(to) 7.75121 Tj
+72 469.157 Td
+(con) 14.3866 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+15 TJm
+(y) 4.9815 Tj
+-266 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-266 TJm
+(rough) 23.2437 Tj
+-266 TJm
+(me) 12.1748 Tj
+1 TJm
+(aning) 22.1378 Tj
+-266 TJm
+(of) 8.29918 Tj
+-266 TJm
+(ea) 8.84714 Tj
+1 TJm
+(ch) 9.40507 Tj
+-266 TJm
+(return) 23.7916 Tj
+-266 TJm
+(v) 4.9815 Tj
+26 TJm
+(alue.) 19.0891 Tj
+-714 TJm
+(The) 15.4925 Tj
+-265 TJm
+(\002rst) 15.5024 Tj
+-266 TJm
+(\002) 5.53943 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-266 TJm
+(a) 4.42357 Tj
+1 TJm
+(ctions) 23.8016 Tj
+-266 TJm
+(are) 12.1648 Tj
+-265 TJm
+(normal) 28.2252 Tj
+-266 TJm
+(and) 14.3866 Tj
+-265 TJm
+(not) 12.7327 Tj
+-266 TJm
+(intended) 34.3126 Tj
+-265 TJm
+(to) 7.75121 Tj
+-266 TJm
+(denote) 26.5614 Tj
+-265 TJm
+(an) 9.40507 Tj
+-266 TJm
+(error) 19.3581 Tj
+72 457.202 Td
+(situation.) 36.8133 Tj
+[1 0 0 1 72 457.102] cm
+0 g
+0 G
+[1 0 0 1 0 -9.743] cm
+0 g
+0 G
+[1 0 0 1 0 -9.744] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -437.615] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 425.759 Td
+/F130_0 9.963 Tf
+(BZ_OK) 29.889 Tj
+[1 0 0 1 101.888 425.759] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -32.379 -1.165] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -424.594] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 413.804 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-250 TJm
+(requested) 38.1782 Tj
+-250 TJm
+(action) 24.3496 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-250 TJm
+(com) 17.1563 Tj
+1 TJm
+(pleted) 24.3496 Tj
+-250 TJm
+(successfully) 48.6991 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 411.647] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.765] cm
+0 g
+0 G
+[1 0 0 1 0 -9.744] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -398.138] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 388.34 Td
+/F130_0 9.963 Tf
+(BZ_RUN_OK,) 59.778 Tj
+-600 TJm
+(BZ_FLUSH_OK,) 71.7336 Tj
+-600 TJm
+(BZ) 11.9556 Tj
+1 TJm
+(_FINISH_OK) 59.778 Tj
+[1 0 0 1 287.193 388.34] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -217.684 -1.166] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -387.174] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 376.384 Td
+/F128_0 9.963 Tf
+(In) 8.29918 Tj
+[1 0 0 1 118.789 376.384] cm
+0 g
+0 G
+[1 0 0 1 -118.789 -376.384] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+118.789 376.384 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 202.476 376.384] cm
+0 g
+0 G
+[1 0 0 1 -202.476 -376.384] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+202.476 376.384 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(requested) 38.1782 Tj
+-250 TJm
+(\003ush/\002nish/) 47.0652 Tj
+1 TJm
+(nothing-special) 61.4319 Tj
+-250 TJm
+(action) 24.3496 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-250 TJm
+(completed) 41.5059 Tj
+-250 TJm
+(successfully) 48.6991 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 374.228] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.766] cm
+0 g
+0 G
+[1 0 0 1 0 -9.744] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -360.718] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 350.92 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 149.709 350.92] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -80.199 -1.166] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -349.754] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 338.965 Td
+/F128_0 9.963 Tf
+(Compression) 52.5847 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-250 TJm
+(com) 17.1563 Tj
+1 TJm
+(pleted,) 26.8403 Tj
+-250 TJm
+(or) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(logical) 27.1193 Tj
+-250 TJm
+(stream) 26.5614 Tj
+-250 TJm
+(end) 14.3866 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-250 TJm
+(detected) 33.1967 Tj
+-250 TJm
+(during) 26.0134 Tj
+-250 TJm
+(de) 9.40507 Tj
+1 TJm
+(compression.) 52.8537 Tj
+[1 0 0 1 72 336.808] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.766] cm
+0 g
+0 G
+[1 0 0 1 0 -9.744] cm
+0 g
+0 G
+[1 0 0 1 0 -9.743] cm
+0 g
+0 G
+[1 0 0 1 -72 -313.555] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 303.756 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-250 TJm
+(follo) 18.8201 Tj
+25 TJm
+(wing) 19.926 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues) 20.474 Tj
+-250 TJm
+(i) 2.76971 Tj
+1 TJm
+(ndicate) 28.7731 Tj
+-250 TJm
+(an) 9.40507 Tj
+-250 TJm
+(error) 19.3581 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(some) 21.0319 Tj
+-250 TJm
+(kind.) 20.205 Tj
+[1 0 0 1 72 301.6] cm
+0 g
+0 G
+[1 0 0 1 0 -9.744] cm
+0 g
+0 G
+[1 0 0 1 0 -9.744] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -282.112] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 272.314 Td
+/F130_0 9.963 Tf
+(BZ_CONFIG_ERROR) 89.667 Tj
+[1 0 0 1 161.664 272.314] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -92.154 -1.165] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -271.149] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 260.359 Td
+/F128_0 9.963 Tf
+(Indicates) 35.9664 Tj
+-386 TJm
+(that) 14.9445 Tj
+-385 TJm
+(the) 12.1748 Tj
+-386 TJm
+(library) 26.5614 Tj
+-386 TJm
+(has) 13.2807 Tj
+-385 TJm
+(been) 18.8101 Tj
+-386 TJm
+(improperly) 44.2756 Tj
+-385 TJm
+(compiled) 37.0823 Tj
+-386 TJm
+(on) 9.963 Tj
+-386 TJm
+(your) 18.2622 Tj
+-385 TJm
+(platform) 34.3126 Tj
+-386 TJm
+(--) 6.63536 Tj
+-386 TJm
+(a) 4.42357 Tj
+-385 TJm
+(major) 23.2437 Tj
+-386 TJm
+(con\002guration) 53.1327 Tj
+-386 TJm
+(error) 19.3581 Tj
+55 TJm
+(.) 2.49075 Tj
+108 248.404 Td
+(Speci\002cally) 47.0453 Tj
+65 TJm
+(,) 2.49075 Tj
+-481 TJm
+(it) 5.53943 Tj
+-435 TJm
+(means) 25.4555 Tj
+-434 TJm
+(that) 14.9445 Tj
+[1 0 0 1 220.614 248.404] cm
+0 g
+0 G
+[1 0 0 1 -220.614 -248.404] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+220.614 248.404 Td
+/F130_0 9.963 Tf
+(sizeof\(char\)) 71.7336 Tj
+[1 0 0 1 292.345 248.404] cm
+0 g
+0 G
+[1 0 0 1 -292.345 -248.404] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+292.345 248.404 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 299.628 248.404] cm
+0 g
+0 G
+[1 0 0 1 -299.628 -248.404] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+299.628 248.404 Td
+/F130_0 9.963 Tf
+(sizeof\(short\)) 77.7114 Tj
+[1 0 0 1 377.337 248.404] cm
+0 g
+0 G
+[1 0 0 1 -377.337 -248.404] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+381.669 248.404 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 400.388 248.404] cm
+0 g
+0 G
+[1 0 0 1 -400.388 -248.404] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+400.388 248.404 Td
+/F130_0 9.963 Tf
+(sizeof\(int\)) 65.7558 Tj
+[1 0 0 1 466.141 248.404] cm
+0 g
+0 G
+[1 0 0 1 -466.141 -248.404] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+470.474 248.404 Td
+/F128_0 9.963 Tf
+(are) 12.1648 Tj
+-435 TJm
+(not) 12.7327 Tj
+-435 TJm
+(1,) 7.47225 Tj
+-481 TJm
+(2) 4.9815 Tj
+-434 TJm
+(and) 14.3866 Tj
+108 236.449 Td
+(4) 4.9815 Tj
+-389 TJm
+(respecti) 30.9849 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ely) 12.1748 Tj
+65 TJm
+(,) 2.49075 Tj
+-424 TJm
+(as) 8.29918 Tj
+-389 TJm
+(the) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-389 TJm
+(should) 26.5713 Tj
+-390 TJm
+(be.) 11.8958 Tj
+-1455 TJm
+(Note) 19.3681 Tj
+-389 TJm
+(that) 14.9445 Tj
+-389 TJm
+(the) 12.1748 Tj
+-390 TJm
+(library) 26.5614 Tj
+-389 TJm
+(should) 26.5713 Tj
+-389 TJm
+(still) 14.9545 Tj
+-389 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork) 13.2807 Tj
+-389 TJm
+(properly) 33.7546 Tj
+-389 TJm
+(on) 9.963 Tj
+-390 TJm
+(64-bi) 21.0319 Tj
+1 TJm
+(t) 2.76971 Tj
+-390 TJm
+(platforms) 38.1882 Tj
+108 224.493 Td
+(which) 24.3496 Tj
+-292 TJm
+(follo) 18.8201 Tj
+25 TJm
+(w) 7.19329 Tj
+-292 TJm
+(the) 12.1748 Tj
+-292 TJm
+(LP64) 21.5898 Tj
+-292 TJm
+(programming) 54.2386 Tj
+-292 TJm
+(model) 24.9075 Tj
+-292 TJm
+(--) 6.63536 Tj
+-292 TJm
+(that) 14.9445 Tj
+-292 TJm
+(is,) 9.13607 Tj
+-303 TJm
+(where) 24.3396 Tj
+[1 0 0 1 355.279 224.493] cm
+0 g
+0 G
+[1 0 0 1 -355.279 -224.493] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+355.279 224.493 Td
+/F130_0 9.963 Tf
+(sizeof\(long\)) 71.7336 Tj
+[1 0 0 1 427.01 224.493] cm
+0 g
+0 G
+[1 0 0 1 -427.01 -224.493] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+429.92 224.493 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 447.217 224.493] cm
+0 g
+0 G
+[1 0 0 1 -447.217 -224.493] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+447.217 224.493 Td
+/F130_0 9.963 Tf
+(sizeof\(void*\)) 77.7114 Tj
+[1 0 0 1 524.925 224.493] cm
+0 g
+0 G
+[1 0 0 1 -524.925 -224.493] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+527.836 224.493 Td
+/F128_0 9.963 Tf
+(are) 12.1648 Tj
+108 212.538 Td
+(8.) 7.47225 Tj
+-620 TJm
+(Under) 24.8975 Tj
+-250 TJm
+(LP64,) 24.0806 Tj
+[1 0 0 1 175.606 212.538] cm
+0 g
+0 G
+[1 0 0 1 -175.606 -212.538] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+175.606 212.538 Td
+/F130_0 9.963 Tf
+(sizeof\(int\)) 65.7558 Tj
+[1 0 0 1 241.36 212.538] cm
+0 g
+0 G
+[1 0 0 1 -241.36 -212.538] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+243.85 212.538 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(still) 14.9545 Tj
+-250 TJm
+(4,) 7.47225 Tj
+-250 TJm
+(so) 8.85711 Tj
+[1 0 0 1 291.74 212.538] cm
+0 g
+0 G
+[1 0 0 1 -291.74 -212.538] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+291.74 212.538 Td
+/F130_0 9.963 Tf
+(libbzip2) 47.8224 Tj
+[1 0 0 1 339.561 212.538] cm
+0 g
+0 G
+[1 0 0 1 -339.561 -212.538] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+339.561 212.538 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(doesn') 26.5614 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(the) 12.1748 Tj
+[1 0 0 1 433.458 212.538] cm
+0 g
+0 G
+[1 0 0 1 -433.458 -212.538] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+433.458 212.538 Td
+/F130_0 9.963 Tf
+(long) 23.9112 Tj
+[1 0 0 1 457.368 212.538] cm
+0 g
+0 G
+[1 0 0 1 -457.368 -212.538] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+459.859 212.538 Td
+/F128_0 9.963 Tf
+(type,) 19.647 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(OK.) 16.8773 Tj
+[1 0 0 1 72 210.381] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.765] cm
+0 g
+0 G
+[1 0 0 1 0 -9.744] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -196.872] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 187.074 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+[1 0 0 1 173.619 187.074] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -104.11 -1.42] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -185.654] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 175.118 Td
+/F128_0 9.963 Tf
+(When) 23.7916 Tj
+-290 TJm
+(using) 21.5898 Tj
+-291 TJm
+(the) 12.1748 Tj
+-290 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+-301 TJm
+(it) 5.53943 Tj
+-290 TJm
+(is) 6.64532 Tj
+-291 TJm
+(important) 38.7461 Tj
+-290 TJm
+(to) 7.75121 Tj
+-291 TJm
+(ca) 8.84714 Tj
+1 TJm
+(ll) 5.53943 Tj
+-291 TJm
+(the) 12.1748 Tj
+-290 TJm
+(functions) 37.0823 Tj
+-291 TJm
+(in) 7.75121 Tj
+-290 TJm
+(the) 12.1748 Tj
+-291 TJm
+(correct) 27.6573 Tj
+-290 TJm
+(sequence) 36.5144 Tj
+-290 TJm
+(and) 14.3866 Tj
+-291 TJm
+(with) 17.7142 Tj
+-290 TJm
+(data) 16.5984 Tj
+-291 TJm
+(structures) 38.7361 Tj
+108 163.163 Td
+(\(b) 8.29918 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fers) 14.9345 Tj
+-205 TJm
+(etc\)) 14.9345 Tj
+-206 TJm
+(in) 7.75121 Tj
+-206 TJm
+(the) 12.1748 Tj
+-205 TJm
+(correct) 27.6573 Tj
+-206 TJm
+(states.) 24.6285 Tj
+[1 0 0 1 239.409 163.163] cm
+0 g
+0 G
+[1 0 0 1 -239.409 -163.163] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+239.409 163.163 Td
+/F130_0 9.963 Tf
+(libbzip2) 47.8224 Tj
+[1 0 0 1 287.23 163.163] cm
+0 g
+0 G
+[1 0 0 1 -287.23 -163.163] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+289.278 163.163 Td
+/F128_0 9.963 Tf
+(checks) 27.1093 Tj
+-206 TJm
+(as) 8.29918 Tj
+-205 TJm
+(much) 22.1378 Tj
+-206 TJm
+(as) 8.29918 Tj
+-205 TJm
+(it) 5.53943 Tj
+-206 TJm
+(can) 13.8286 Tj
+-205 TJm
+(to) 7.75121 Tj
+-206 TJm
+(ensure) 26.0034 Tj
+-205 TJm
+(this) 14.3965 Tj
+-206 TJm
+(is) 6.64532 Tj
+-206 TJm
+(happeni) 31.5429 Tj
+1 TJm
+(ng,) 12.4538 Tj
+-215 TJm
+(and) 14.3866 Tj
+-206 TJm
+(re) 7.74125 Tj
+1 TJm
+(turns) 19.926 Tj
+[1 0 0 1 108 151.208] cm
+0 g
+0 G
+[1 0 0 1 -108 -151.208] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 151.208 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+[1 0 0 1 209.619 151.208] cm
+0 g
+0 G
+[1 0 0 1 -209.619 -151.208] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+213.27 151.208 Td
+/F128_0 9.963 Tf
+(if) 6.08739 Tj
+-367 TJm
+(not) 12.7327 Tj
+1 TJm
+(.) 2.49075 Tj
+-660 TJm
+(Code) 21.0319 Tj
+-367 TJm
+(which) 24.3496 Tj
+-366 TJm
+(complies) 35.9764 Tj
+-367 TJm
+(precisel) 30.9849 Tj
+1 TJm
+(y) 4.9815 Tj
+-367 TJm
+(with) 17.7142 Tj
+-367 TJm
+(the) 12.1748 Tj
+-366 TJm
+(function) 33.2067 Tj
+-367 TJm
+(s) 3.87561 Tj
+1 TJm
+(emantics,) 37.9092 Tj
+-396 TJm
+(as) 8.29918 Tj
+-367 TJm
+(deta) 16.5984 Tj
+1 TJm
+(iled) 14.9445 Tj
+108 139.253 Td
+(belo) 17.1563 Tj
+25 TJm
+(w) 7.19329 Tj
+65 TJm
+(,) 2.49075 Tj
+-250 TJm
+(should) 26.5713 Tj
+-250 TJm
+(ne) 9.40507 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-250 TJm
+(recei) 19.3581 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(this) 14.3965 Tj
+-249 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue;) 19.3681 Tj
+-250 TJm
+(such) 18.2622 Tj
+-250 TJm
+(an) 9.40507 Tj
+-250 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ent) 12.1748 Tj
+-250 TJm
+(denotes) 30.437 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(uggy) 19.926 Tj
+-250 TJm
+(code) 18.8101 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(should) 26.5713 Tj
+-250 TJm
+(i) 2.76971 Tj
+1 TJm
+(n) 4.9815 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(estig) 18.8201 Tj
+5 TJm
+(ate.) 14.1076 Tj
+[1 0 0 1 72 137.096] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.766] cm
+0 g
+0 G
+[1 0 0 1 0 -9.743] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -123.587] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 113.788 Td
+/F130_0 9.963 Tf
+(BZ_PARAM_ERROR) 83.6892 Tj
+[1 0 0 1 155.686 113.788] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -86.177 -1.165] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -112.623] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 101.833 Td
+/F128_0 9.963 Tf
+(Returned) 36.5244 Tj
+-434 TJm
+(when) 21.5799 Tj
+-434 TJm
+(a) 4.42357 Tj
+-433 TJm
+(parameter) 39.8321 Tj
+-434 TJm
+(to) 7.75121 Tj
+-434 TJm
+(a) 4.42357 Tj
+-434 TJm
+(function) 33.2067 Tj
+-434 TJm
+(call) 14.3866 Tj
+-434 TJm
+(is) 6.64532 Tj
+-433 TJm
+(out) 12.7327 Tj
+-434 TJm
+(of) 8.29918 Tj
+-434 TJm
+(range) 22.1278 Tj
+-434 TJm
+(or) 8.29918 Tj
+-434 TJm
+(otherwise) 38.7361 Tj
+-434 TJm
+(man) 17.1563 Tj
+1 TJm
+(ifestly) 24.9075 Tj
+-434 TJm
+(incorrect.) 37.8993 Tj
+-1724 TJm
+(As) 11.0689 Tj
+108 89.878 Td
+(with) 17.7142 Tj
+[1 0 0 1 131.644 89.878] cm
+0 g
+0 G
+[1 0 0 1 -131.644 -89.878] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+131.644 89.878 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+[1 0 0 1 233.263 89.878] cm
+0 g
+0 G
+[1 0 0 1 -233.263 -89.878] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+233.263 89.878 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-595 TJm
+(this) 14.3965 Tj
+-596 TJm
+(d) 4.9815 Tj
+1 TJm
+(enotes) 25.4555 Tj
+-596 TJm
+(a) 4.42357 Tj
+-595 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug) 9.963 Tj
+-595 TJm
+(in) 7.75121 Tj
+-595 TJm
+(the) 12.1748 Tj
+-596 TJm
+(client) 22.1378 Tj
+-595 TJm
+(code.) 21.3009 Tj
+-2692 TJm
+(T) 6.08739 Tj
+1 TJm
+(he) 9.40507 Tj
+-596 TJm
+(distinction) 42.0737 Tj
+-595 TJm
+(between) 33.1967 Tj
+[1 0 0 1 108 77.923] cm
+0 g
+0 G
+[1 0 0 1 -108 -77.923] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 77.923 Td
+/F130_0 9.963 Tf
+(BZ_PARAM_ERROR) 83.6892 Tj
+[1 0 0 1 191.686 77.923] cm
+0 g
+0 G
+[1 0 0 1 -191.686 -77.923] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+194.177 77.923 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 211.053 77.923] cm
+0 g
+0 G
+[1 0 0 1 -211.053 -77.923] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+211.053 77.923 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+[1 0 0 1 312.672 77.923] cm
+0 g
+0 G
+[1 0 0 1 -312.672 -77.923] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+315.163 77.923 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(bit) 10.5209 Tj
+-250 TJm
+(hazy) 18.8101 Tj
+65 TJm
+(,) 2.49075 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(still) 14.9545 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(orth) 16.0504 Tj
+-250 TJm
+(m) 7.75121 Tj
+1 TJm
+(aking.) 24.6285 Tj
+[1 0 0 1 72 75.766] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.766] cm
+0 g
+0 G
+[1 0 0 1 0 -21.148] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(10) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 14 14
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F130_0 9.963 Tf
+(BZ_MEM_ERROR) 71.7336 Tj
+[1 0 0 1 143.731 710.037] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -74.222 -1.165] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -708.872] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 698.082 Td
+/F128_0 9.963 Tf
+(Returned) 36.5244 Tj
+-227 TJm
+(when) 21.5799 Tj
+-228 TJm
+(a) 4.42357 Tj
+-228 TJm
+(reque) 22.1278 Tj
+1 TJm
+(st) 6.64532 Tj
+-228 TJm
+(to) 7.75121 Tj
+-228 TJm
+(allocate) 30.9849 Tj
+-227 TJm
+(memory) 33.2067 Tj
+-228 TJm
+(f) 3.31768 Tj
+10 TJm
+(aile) 14.3866 Tj
+1 TJm
+(d.) 7.47225 Tj
+-606 TJm
+(N) 7.19329 Tj
+1 TJm
+(ote) 12.1748 Tj
+-228 TJm
+(that) 14.9445 Tj
+-228 TJm
+(the) 12.1748 Tj
+-227 TJm
+(quantity) 32.6587 Tj
+-228 TJm
+(of) 8.29918 Tj
+-227 TJm
+(memory) 33.2067 Tj
+-228 TJm
+(needed) 28.2152 Tj
+-227 TJm
+(to) 7.75121 Tj
+-228 TJm
+(decompress) 47.0353 Tj
+108 686.127 Td
+(a) 4.42357 Tj
+-351 TJm
+(stream) 26.5614 Tj
+-352 TJm
+(cannot) 26.5614 Tj
+-351 TJm
+(be) 9.40507 Tj
+-351 TJm
+(determined) 44.8235 Tj
+-352 TJm
+(until) 18.2721 Tj
+-351 TJm
+(the) 12.1748 Tj
+-351 TJm
+(stream') 29.879 Tj
+55 TJm
+(s) 3.87561 Tj
+-352 TJm
+(heade) 23.2337 Tj
+1 TJm
+(r) 3.31768 Tj
+-352 TJm
+(has) 13.2807 Tj
+-351 TJm
+(been) 18.8101 Tj
+-352 TJm
+(read.) 19.6371 Tj
+-1228 TJm
+(So) 10.5209 Tj
+[1 0 0 1 426.471 686.127] cm
+0 g
+0 G
+[1 0 0 1 -426.471 -686.127] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+426.471 686.127 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 522.113 686.127] cm
+0 g
+0 G
+[1 0 0 1 -522.113 -686.127] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+525.614 686.127 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 108 674.172] cm
+0 g
+0 G
+[1 0 0 1 -108 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 674.172 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 167.776 674.172] cm
+0 g
+0 G
+[1 0 0 1 -167.776 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+172.13 674.172 Td
+/F128_0 9.963 Tf
+(may) 17.1563 Tj
+-437 TJm
+(return) 23.7916 Tj
+[1 0 0 1 221.784 674.172] cm
+0 g
+0 G
+[1 0 0 1 -221.784 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+221.784 674.172 Td
+/F130_0 9.963 Tf
+(BZ_MEM_ERROR) 71.7336 Tj
+[1 0 0 1 293.515 674.172] cm
+0 g
+0 G
+[1 0 0 1 -293.515 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+297.867 674.172 Td
+/F128_0 9.963 Tf
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-437 TJm
+(though) 27.6772 Tj
+-437 TJm
+(some) 21.0319 Tj
+-437 TJm
+(of) 8.29918 Tj
+-437 TJm
+(the) 12.1748 Tj
+-437 TJm
+(compressed) 47.0353 Tj
+-437 TJm
+(da) 9.40507 Tj
+1 TJm
+(ta) 7.19329 Tj
+-437 TJm
+(has) 13.2807 Tj
+-437 TJm
+(been) 18.8101 Tj
+-437 TJm
+(read.) 19.6371 Tj
+108 662.217 Td
+(The) 15.4925 Tj
+-479 TJm
+(sam) 16.0504 Tj
+1 TJm
+(e) 4.42357 Tj
+-479 TJm
+(is) 6.64532 Tj
+-479 TJm
+(not) 12.7327 Tj
+-478 TJm
+(true) 15.4925 Tj
+-479 TJm
+(for) 11.6169 Tj
+-478 TJm
+(compression;) 53.1327 Tj
+-593 TJm
+(once) 18.8101 Tj
+[1 0 0 1 301.675 662.217] cm
+0 g
+0 G
+[1 0 0 1 -301.675 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+301.675 662.217 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 409.272 662.217] cm
+0 g
+0 G
+[1 0 0 1 -409.272 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+414.04 662.217 Td
+/F128_0 9.963 Tf
+(or) 8.29918 Tj
+[1 0 0 1 427.107 662.217] cm
+0 g
+0 G
+[1 0 0 1 -427.107 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+427.107 662.217 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteOpen) 89.667 Tj
+[1 0 0 1 516.771 662.217] cm
+0 g
+0 G
+[1 0 0 1 -516.771 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+521.539 662.217 Td
+/F128_0 9.963 Tf
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+108 650.262 Td
+(successfully) 48.6991 Tj
+-250 TJm
+(completed,) 43.9966 Tj
+[1 0 0 1 205.672 650.262] cm
+0 g
+0 G
+[1 0 0 1 -205.672 -650.262] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+205.672 650.262 Td
+/F130_0 9.963 Tf
+(BZ_MEM_ERROR) 71.7336 Tj
+[1 0 0 1 277.403 650.262] cm
+0 g
+0 G
+[1 0 0 1 -277.403 -650.262] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+279.894 650.262 Td
+/F128_0 9.963 Tf
+(cannot) 26.5614 Tj
+-250 TJm
+(occur) 22.1278 Tj
+55 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 648.105] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -634.157] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 624.359 Td
+/F130_0 9.963 Tf
+(BZ_DATA_ERROR) 77.7114 Tj
+[1 0 0 1 149.709 624.359] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -80.199 -1.166] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -623.193] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 612.404 Td
+/F128_0 9.963 Tf
+(Returned) 36.5244 Tj
+-265 TJm
+(when) 21.5799 Tj
+-266 TJm
+(a) 4.42357 Tj
+-266 TJm
+(da) 9.40507 Tj
+1 TJm
+(ta) 7.19329 Tj
+-266 TJm
+(inte) 14.9445 Tj
+15 TJm
+(grity) 18.8201 Tj
+-265 TJm
+(error) 19.3581 Tj
+-266 TJm
+(is) 6.64532 Tj
+-266 TJm
+(dete) 16.5984 Tj
+1 TJm
+(cted) 16.5984 Tj
+-266 TJm
+(during) 26.0134 Tj
+-266 TJm
+(d) 4.9815 Tj
+1 TJm
+(ecompression.) 57.2773 Tj
+-714 TJm
+(Most) 20.4839 Tj
+-265 TJm
+(importantly) 46.4973 Tj
+65 TJm
+(,) 2.49075 Tj
+-270 TJm
+(this) 14.3965 Tj
+-265 TJm
+(means) 25.4555 Tj
+-266 TJm
+(when) 21.5799 Tj
+108 600.448 Td
+(stored) 24.3496 Tj
+-222 TJm
+(and) 14.3866 Tj
+-222 TJm
+(computed) 39.2941 Tj
+-222 TJm
+(CRCs) 23.8116 Tj
+-223 TJm
+(for) 11.6169 Tj
+-222 TJm
+(the) 12.1748 Tj
+-222 TJm
+(data) 16.5984 Tj
+-222 TJm
+(do) 9.963 Tj
+-222 TJm
+(not) 12.7327 Tj
+-223 TJm
+(match.) 26.8403 Tj
+-601 TJm
+(This) 17.7142 Tj
+-222 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+-222 TJm
+(is) 6.64532 Tj
+-223 TJm
+(also) 16.0504 Tj
+-222 TJm
+(returned) 33.1967 Tj
+-222 TJm
+(upon) 19.926 Tj
+-222 TJm
+(detection) 36.5244 Tj
+-222 TJm
+(of) 8.29918 Tj
+-222 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-223 TJm
+(other) 20.474 Tj
+108 588.493 Td
+(anomaly) 34.3126 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-250 TJm
+(d) 4.9815 Tj
+1 TJm
+(ata.) 14.1076 Tj
+[1 0 0 1 72 586.336] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -572.389] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 562.59 Td
+/F130_0 9.963 Tf
+(BZ_DATA_ERROR_MAGIC) 113.578 Tj
+[1 0 0 1 185.574 562.59] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -116.065 -1.165] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -561.425] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 550.635 Td
+/F128_0 9.963 Tf
+(As) 11.0689 Tj
+-306 TJm
+(a) 4.42357 Tj
+-306 TJm
+(special) 27.6673 Tj
+-306 TJm
+(case) 17.1463 Tj
+-306 TJm
+(of) 8.29918 Tj
+[1 0 0 1 191.852 550.635] cm
+0 g
+0 G
+[1 0 0 1 -191.852 -550.635] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+191.852 550.635 Td
+/F130_0 9.963 Tf
+(BZ_DATA_ERROR) 77.7114 Tj
+[1 0 0 1 269.561 550.635] cm
+0 g
+0 G
+[1 0 0 1 -269.561 -550.635] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+269.561 550.635 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-306 TJm
+(it) 5.53943 Tj
+-306 TJm
+(is) 6.64532 Tj
+-306 TJm
+(sometimes) 42.6217 Tj
+-306 TJm
+(useful) 24.3496 Tj
+-306 TJm
+(to) 7.75121 Tj
+-306 TJm
+(kno) 14.9445 Tj
+25 TJm
+(w) 7.19329 Tj
+-306 TJm
+(when) 21.5799 Tj
+-306 TJm
+(the) 12.1748 Tj
+-307 TJm
+(com) 17.1563 Tj
+1 TJm
+(pressed) 29.879 Tj
+-306 TJm
+(stream) 26.5614 Tj
+-306 TJm
+(does) 18.2622 Tj
+108 538.68 Td
+(not) 12.7327 Tj
+-250 TJm
+(start) 17.1563 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(correct) 27.6573 Tj
+-250 TJm
+(m) 7.75121 Tj
+1 TJm
+(agic) 16.5984 Tj
+-250 TJm
+(bytes) 21.0319 Tj
+-250 TJm
+(\() 3.31768 Tj
+[1 0 0 1 261.562 538.68] cm
+0 g
+0 G
+[1 0 0 1 -261.562 -538.68] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+261.562 538.68 Td
+/F130_0 9.963 Tf
+('B') 17.9334 Tj
+-600 TJm
+('Z') 17.9334 Tj
+-600 TJm
+('h') 17.9334 Tj
+[1 0 0 1 327.316 538.68] cm
+0 g
+0 G
+[1 0 0 1 -327.316 -538.68] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+327.316 538.68 Td
+/F128_0 9.963 Tf
+(\).) 5.80843 Tj
+[1 0 0 1 72 536.523] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -522.576] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 512.777 Td
+/F130_0 9.963 Tf
+(BZ_IO_ERROR) 65.7558 Tj
+[1 0 0 1 137.753 512.777] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -68.244 -1.165] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -511.612] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 500.822 Td
+/F128_0 9.963 Tf
+(Returned) 36.5244 Tj
+-233 TJm
+(by) 9.963 Tj
+[1 0 0 1 159.123 500.822] cm
+0 g
+0 G
+[1 0 0 1 -159.123 -500.822] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+159.123 500.822 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 218.899 500.822] cm
+0 g
+0 G
+[1 0 0 1 -218.899 -500.822] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+221.218 500.822 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 237.922 500.822] cm
+0 g
+0 G
+[1 0 0 1 -237.922 -500.822] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+237.922 500.822 Td
+/F130_0 9.963 Tf
+(BZ2_bzWrite) 65.7558 Tj
+[1 0 0 1 303.676 500.822] cm
+0 g
+0 G
+[1 0 0 1 -303.676 -500.822] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+305.995 500.822 Td
+/F128_0 9.963 Tf
+(when) 21.5799 Tj
+-233 TJm
+(there) 19.916 Tj
+-232 TJm
+(is) 6.64532 Tj
+-233 TJm
+(an) 9.40507 Tj
+-233 TJm
+(error) 19.3581 Tj
+-232 TJm
+(reading) 29.879 Tj
+-233 TJm
+(or) 8.29918 Tj
+-233 TJm
+(writing) 28.7831 Tj
+-232 TJm
+(in) 7.75121 Tj
+-233 TJm
+(the) 12.1748 Tj
+-233 TJm
+(compress) 37.6303 Tj
+1 TJm
+(ed) 9.40507 Tj
+108 488.867 Td
+(\002le,) 15.2235 Tj
+-384 TJm
+(and) 14.3866 Tj
+-357 TJm
+(by) 9.963 Tj
+[1 0 0 1 158.511 488.867] cm
+0 g
+0 G
+[1 0 0 1 -158.511 -488.867] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+158.511 488.867 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadOpen) 83.6892 Tj
+[1 0 0 1 242.197 488.867] cm
+0 g
+0 G
+[1 0 0 1 -242.197 -488.867] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+245.755 488.867 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 263.698 488.867] cm
+0 g
+0 G
+[1 0 0 1 -263.698 -488.867] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+263.698 488.867 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteOpen) 89.667 Tj
+[1 0 0 1 353.362 488.867] cm
+0 g
+0 G
+[1 0 0 1 -353.362 -488.867] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+356.92 488.867 Td
+/F128_0 9.963 Tf
+(for) 11.6169 Tj
+-357 TJm
+(attempts) 33.7646 Tj
+-357 TJm
+(to) 7.75121 Tj
+-357 TJm
+(use) 13.2807 Tj
+-357 TJm
+(a) 4.42357 Tj
+-357 TJm
+(\002le) 12.7327 Tj
+-357 TJm
+(for) 11.6169 Tj
+-357 TJm
+(which) 24.3496 Tj
+-357 TJm
+(the) 12.1748 Tj
+-357 TJm
+(error) 19.3581 Tj
+108 476.912 Td
+(indicator) 35.4185 Tj
+-260 TJm
+(\(viz,) 17.9832 Tj
+[1 0 0 1 166.603 476.912] cm
+0 g
+0 G
+[1 0 0 1 -166.603 -476.912] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+166.603 476.912 Td
+/F130_0 9.963 Tf
+(ferror\(f\)) 53.8002 Tj
+[1 0 0 1 220.401 476.912] cm
+0 g
+0 G
+[1 0 0 1 -220.401 -476.912] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+220.401 476.912 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-260 TJm
+(is) 6.64532 Tj
+-260 TJm
+(set.) 13.5596 Tj
+-679 TJm
+(On) 12.1748 Tj
+-260 TJm
+(receipt) 27.1093 Tj
+-260 TJm
+(of) 8.29918 Tj
+[1 0 0 1 311.223 476.912] cm
+0 g
+0 G
+[1 0 0 1 -311.223 -476.912] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+311.223 476.912 Td
+/F130_0 9.963 Tf
+(BZ_IO_ERROR) 65.7558 Tj
+[1 0 0 1 376.976 476.912] cm
+0 g
+0 G
+[1 0 0 1 -376.976 -476.912] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+376.976 476.912 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-260 TJm
+(the) 12.1748 Tj
+-260 TJm
+(caller) 22.1278 Tj
+-260 TJm
+(should) 26.5713 Tj
+-259 TJm
+(consult) 28.7831 Tj
+[1 0 0 1 482.068 476.912] cm
+0 g
+0 G
+[1 0 0 1 -482.068 -476.912] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+482.068 476.912 Td
+/F130_0 9.963 Tf
+(errno) 29.889 Tj
+[1 0 0 1 511.956 476.912] cm
+0 g
+0 G
+[1 0 0 1 -511.956 -476.912] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+514.546 476.912 Td
+/F128_0 9.963 Tf
+(and/or) 25.4555 Tj
+[1 0 0 1 108 464.957] cm
+0 g
+0 G
+[1 0 0 1 -108 -464.957] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 464.957 Td
+/F130_0 9.963 Tf
+(perror) 35.8668 Tj
+[1 0 0 1 143.865 464.957] cm
+0 g
+0 G
+[1 0 0 1 -143.865 -464.957] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+146.356 464.957 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(acquire) 29.3211 Tj
+-250 TJm
+(operating-system) 68.6251 Tj
+-249 TJm
+(speci\002c) 30.437 Tj
+-250 TJm
+(information) 47.0453 Tj
+-250 TJm
+(about) 22.1378 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(problem.) 35.6974 Tj
+[1 0 0 1 72 462.8] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -448.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 439.054 Td
+/F130_0 9.963 Tf
+(BZ_UNEXPECTED_EOF) 101.623 Tj
+[1 0 0 1 173.619 439.054] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -104.11 -1.166] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -437.888] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 427.099 Td
+/F128_0 9.963 Tf
+(Returned) 36.5244 Tj
+-250 TJm
+(by) 9.963 Tj
+[1 0 0 1 159.467 427.099] cm
+0 g
+0 G
+[1 0 0 1 -159.467 -427.099] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+159.467 427.099 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 219.242 427.099] cm
+0 g
+0 G
+[1 0 0 1 -219.242 -427.099] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+221.733 427.099 Td
+/F128_0 9.963 Tf
+(when) 21.5799 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+-250 TJm
+(\002nis) 17.1662 Tj
+1 TJm
+(hes) 13.2807 Tj
+-250 TJm
+(before) 25.4455 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(logical) 27.1193 Tj
+-250 TJm
+(end) 14.3866 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(stream) 26.5614 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(detected.) 35.6875 Tj
+[1 0 0 1 72 424.942] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -410.994] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 401.196 Td
+/F130_0 9.963 Tf
+(BZ_OUTBUFF_FULL) 89.667 Tj
+[1 0 0 1 161.664 401.196] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -92.154 -1.166] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -400.03] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 389.241 Td
+/F128_0 9.963 Tf
+(Returned) 36.5244 Tj
+-258 TJm
+(by) 9.963 Tj
+[1 0 0 1 159.632 389.241] cm
+0 g
+0 G
+[1 0 0 1 -159.632 -389.241] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+159.632 389.241 Td
+/F130_0 9.963 Tf
+(BZ2_bzBuffToBuffCompress) 143.467 Tj
+[1 0 0 1 303.094 389.241] cm
+0 g
+0 G
+[1 0 0 1 -303.094 -389.241] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+305.667 389.241 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 322.627 389.241] cm
+0 g
+0 G
+[1 0 0 1 -322.627 -389.241] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+322.627 389.241 Td
+/F130_0 9.963 Tf
+(BZ2_bzBuffToBuffDecompres) 149.445 Tj
+1 TJm
+(s) 5.9778 Tj
+[1 0 0 1 478.044 389.241] cm
+0 g
+0 G
+[1 0 0 1 -478.044 -389.241] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+480.617 389.241 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-258 TJm
+(indicate) 31.5429 Tj
+-258 TJm
+(that) 14.9445 Tj
+108 377.285 Td
+(the) 12.1748 Tj
+-250 TJm
+(output) 25.4654 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(will) 15.5024 Tj
+-250 TJm
+(not) 12.7327 Tj
+-250 TJm
+(\002t) 8.30914 Tj
+-250 TJm
+(in) 7.75121 Tj
+1 TJm
+(to) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(output) 25.4654 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-250 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vided.) 24.6285 Tj
+[1 0 0 1 72 375.129] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -3.985] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -351.218] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 328.585 Td
+/F121_0 20.659 Tf
+(3.3.) 34.4592 Tj
+-278 TJm
+(Lo) 25.2453 Tj
+15 TJm
+(w-le) 40.1818 Tj
+15 TJm
+(vel) 28.716 Tj
+-278 TJm
+(interface) 86.1067 Tj
+[1 0 0 1 72 328.327] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -318.364] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 297.964 Td
+/F121_0 17.215 Tf
+(3.3.1.) 43.0719 Tj
+[1 0 0 1 119.858 297.964] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -297.964] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 297.964 Td
+/F387_0 17.215 Tf
+(BZ2_bzCompressInit) 185.922 Tj
+[1 0 0 1 305.785 297.964] cm
+0 g
+0 G
+[1 0 0 1 -233.785 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -244.779] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.754] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.754] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.852 Td
+/F128_0 9.963 Tf
+(11) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 15 15
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -296.523] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 274.969 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 271.382] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(typedef) 41.8446 Tj
+-426 TJm
+(struct) 35.8668 Tj
+-426 TJm
+({) 5.9778 Tj
+98.488 699.676 Td
+(char) 23.9112 Tj
+-426 TJm
+(*next_in;) 53.8002 Tj
+98.488 687.721 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(avail_in;) 53.8002 Tj
+98.488 675.766 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(total_in_lo3) 71.7336 Tj
+1 TJm
+(2;) 11.9556 Tj
+98.488 663.811 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(total_in_hi3) 71.7336 Tj
+1 TJm
+(2;) 11.9556 Tj
+98.488 639.9 Td
+(char) 23.9112 Tj
+-426 TJm
+(*next_out;) 59.778 Tj
+98.488 627.945 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(avail_out;) 59.778 Tj
+98.488 615.99 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(total_out_lo) 71.7336 Tj
+1 TJm
+(32;) 17.9334 Tj
+98.488 604.035 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(total_out_hi) 71.7336 Tj
+1 TJm
+(32;) 17.9334 Tj
+98.488 580.124 Td
+(void) 23.9112 Tj
+-426 TJm
+(*state;) 41.8446 Tj
+98.488 556.214 Td
+(void) 23.9112 Tj
+-426 TJm
+(*\(*bzalloc\)\(void) 95.6448 Tj
+-426 TJm
+(*,i) 17.9334 Tj
+1 TJm
+(nt,int\);) 47.8224 Tj
+98.488 544.259 Td
+(void) 23.9112 Tj
+-426 TJm
+(\(*bzfree\)\(void) 83.6892 Tj
+-426 TJm
+(*,voi) 29.889 Tj
+1 TJm
+(d) 5.9778 Tj
+-426 TJm
+(*\);) 17.9334 Tj
+98.488 532.304 Td
+(void) 23.9112 Tj
+-426 TJm
+(*opaque;) 47.8224 Tj
+90 520.349 Td
+(}) 5.9778 Tj
+-426 TJm
+(bz_stream;) 59.778 Tj
+90 496.438 Td
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzCompressInit) 107.6 Tj
+-426 TJm
+(\() 5.9778 Tj
+-425 TJm
+(bz_stream) 53.8002 Tj
+-426 TJm
+(*strm,) 35.8668 Tj
+196.099 484.483 Td
+(int) 17.9334 Tj
+-426 TJm
+(blockSize100k,) 83.6892 Tj
+196.099 472.528 Td
+(int) 17.9334 Tj
+-426 TJm
+(verbosity,) 59.778 Tj
+196.099 460.573 Td
+(int) 17.9334 Tj
+-426 TJm
+(workFactor) 59.778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 445.031] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -435.068] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 423.113 Td
+/F128_0 9.963 Tf
+(Prepares) 34.3026 Tj
+-356 TJm
+(for) 11.6169 Tj
+-356 TJm
+(compressi) 40.4 Tj
+1 TJm
+(on.) 12.4538 Tj
+-1256 TJm
+(The) 15.4925 Tj
+[1 0 0 1 209.409 423.113] cm
+0 g
+0 G
+[1 0 0 1 -209.409 -423.113] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+209.409 423.113 Td
+/F130_0 9.963 Tf
+(bz_stream) 53.8002 Tj
+[1 0 0 1 263.208 423.113] cm
+0 g
+0 G
+[1 0 0 1 -263.208 -423.113] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+266.754 423.113 Td
+/F128_0 9.963 Tf
+(structure) 34.8605 Tj
+-356 TJm
+(holds) 21.5898 Tj
+-356 TJm
+(all) 9.963 Tj
+-356 TJm
+(d) 4.9815 Tj
+1 TJm
+(ata) 11.6169 Tj
+-356 TJm
+(pertaining) 40.4 Tj
+-356 TJm
+(to) 7.75121 Tj
+-356 TJm
+(the) 12.1748 Tj
+-356 TJm
+(compression) 50.363 Tj
+-356 TJm
+(acti) 14.3866 Tj
+25 TJm
+(vit) 10.5209 Tj
+1 TJm
+(y) 4.9815 Tj
+65 TJm
+(.) 2.49075 Tj
+-1256 TJm
+(A) 7.19329 Tj
+[1 0 0 1 72 411.158] cm
+0 g
+0 G
+[1 0 0 1 -72 -411.158] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 411.158 Td
+/F130_0 9.963 Tf
+(bz_stream) 53.8002 Tj
+[1 0 0 1 125.798 411.158] cm
+0 g
+0 G
+[1 0 0 1 -125.798 -411.158] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+128.581 411.158 Td
+/F128_0 9.963 Tf
+(structure) 34.8605 Tj
+-279 TJm
+(should) 26.5713 Tj
+-279 TJm
+(be) 9.40507 Tj
+-280 TJm
+(allocate) 30.9849 Tj
+1 TJm
+(d) 4.9815 Tj
+-280 TJm
+(and) 14.3866 Tj
+-279 TJm
+(initialised) 39.304 Tj
+-279 TJm
+(prior) 19.3681 Tj
+-279 TJm
+(to) 7.75121 Tj
+-280 TJm
+(the) 12.1748 Tj
+-279 TJm
+(call.) 16.8773 Tj
+-796 TJm
+(The) 15.4925 Tj
+-279 TJm
+(\002elds) 21.5898 Tj
+-279 TJm
+(of) 8.29918 Tj
+[1 0 0 1 431.939 411.158] cm
+0 g
+0 G
+[1 0 0 1 -431.939 -411.158] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+431.939 411.158 Td
+/F130_0 9.963 Tf
+(bz_stream) 53.8002 Tj
+[1 0 0 1 485.738 411.158] cm
+0 g
+0 G
+[1 0 0 1 -485.738 -411.158] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+488.52 411.158 Td
+/F128_0 9.963 Tf
+(comprise) 36.5244 Tj
+-279 TJm
+(the) 12.1748 Tj
+72 399.203 Td
+(entirety) 30.437 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(user) 16.5984 Tj
+20 TJm
+(-visible) 29.889 Tj
+-250 TJm
+(d) 4.9815 Tj
+1 TJm
+(ata.) 14.1076 Tj
+[1 0 0 1 204.422 399.203] cm
+0 g
+0 G
+[1 0 0 1 -204.422 -399.203] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+204.422 399.203 Td
+/F130_0 9.963 Tf
+(state) 29.889 Tj
+[1 0 0 1 234.31 399.203] cm
+0 g
+0 G
+[1 0 0 1 -234.31 -399.203] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+236.8 399.203 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(pointer) 28.2252 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(pri) 11.0689 Tj
+25 TJm
+(v) 4.9815 Tj
+25 TJm
+(ate) 11.6169 Tj
+-250 TJm
+(data) 16.5984 Tj
+-249 TJm
+(structures) 38.7361 Tj
+-250 TJm
+(required) 33.1967 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(compression.) 52.8537 Tj
+[1 0 0 1 72 397.046] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -387.084] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 377.285 Td
+/F128_0 9.963 Tf
+(Custom) 31.0049 Tj
+-372 TJm
+(memory) 33.2067 Tj
+-372 TJm
+(allocators) 38.7361 Tj
+-372 TJm
+(are) 12.1648 Tj
+-372 TJm
+(supported,) 41.7848 Tj
+-402 TJm
+(via) 12.1748 Tj
+-372 TJm
+(\002elds) 21.5898 Tj
+[1 0 0 1 288.908 377.285] cm
+0 g
+0 G
+[1 0 0 1 -288.908 -377.285] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+288.908 377.285 Td
+/F130_0 9.963 Tf
+(bzalloc) 41.8446 Tj
+[1 0 0 1 330.751 377.285] cm
+0 g
+0 G
+[1 0 0 1 -330.751 -377.285] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+330.751 377.285 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 337.253 377.285] cm
+0 g
+0 G
+[1 0 0 1 -337.253 -377.285] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+337.253 377.285 Td
+/F130_0 9.963 Tf
+(bzfree) 35.8668 Tj
+[1 0 0 1 373.118 377.285] cm
+0 g
+0 G
+[1 0 0 1 -373.118 -377.285] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+373.118 377.285 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-403 TJm
+(and) 14.3866 Tj
+[1 0 0 1 397.714 377.285] cm
+0 g
+0 G
+[1 0 0 1 -397.714 -377.285] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+397.714 377.285 Td
+/F130_0 9.963 Tf
+(opaque) 35.8668 Tj
+[1 0 0 1 433.579 377.285] cm
+0 g
+0 G
+[1 0 0 1 -433.579 -377.285] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+433.579 377.285 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1353 TJm
+(The) 15.4925 Tj
+-372 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+[1 0 0 1 493.782 377.285] cm
+0 g
+0 G
+[1 0 0 1 -493.782 -377.285] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+493.782 377.285 Td
+/F130_0 9.963 Tf
+(opaque) 35.8668 Tj
+[1 0 0 1 529.648 377.285] cm
+0 g
+0 G
+[1 0 0 1 -529.648 -377.285] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+533.355 377.285 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+72 365.33 Td
+(passed) 26.5614 Tj
+-306 TJm
+(to) 7.75121 Tj
+-306 TJm
+(as) 8.29918 Tj
+-306 TJm
+(the) 12.1748 Tj
+-306 TJm
+(\002) 5.53943 Tj
+1 TJm
+(rst) 9.963 Tj
+-306 TJm
+(ar) 7.74125 Tj
+18 TJm
+(gument) 29.889 Tj
+-306 TJm
+(to) 7.75121 Tj
+-306 TJm
+(all) 9.963 Tj
+-306 TJm
+(calls) 18.2622 Tj
+-306 TJm
+(to) 7.75121 Tj
+[1 0 0 1 253.941 365.33] cm
+0 g
+0 G
+[1 0 0 1 -253.941 -365.33] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+253.941 365.33 Td
+/F130_0 9.963 Tf
+(bzalloc) 41.8446 Tj
+[1 0 0 1 295.784 365.33] cm
+0 g
+0 G
+[1 0 0 1 -295.784 -365.33] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+298.832 365.33 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 316.266 365.33] cm
+0 g
+0 G
+[1 0 0 1 -316.266 -365.33] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+316.266 365.33 Td
+/F130_0 9.963 Tf
+(bzfree) 35.8668 Tj
+[1 0 0 1 352.132 365.33] cm
+0 g
+0 G
+[1 0 0 1 -352.132 -365.33] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+352.132 365.33 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-320 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-306 TJm
+(is) 6.64532 Tj
+-306 TJm
+(otherwise) 38.7361 Tj
+-305 TJm
+(ignored) 30.437 Tj
+-306 TJm
+(by) 9.963 Tj
+-306 TJm
+(the) 12.1748 Tj
+-306 TJm
+(library) 26.5614 Tj
+65 TJm
+(.) 2.49075 Tj
+-956 TJm
+(The) 15.4925 Tj
+72 353.375 Td
+(call) 14.3866 Tj
+[1 0 0 1 89.431 353.375] cm
+0 g
+0 G
+[1 0 0 1 -89.431 -353.375] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+89.431 353.375 Td
+/F130_0 9.963 Tf
+(bzalloc) 41.8446 Tj
+-600 TJm
+(\() 5.9778 Tj
+-600 TJm
+(opaque,) 41.8446 Tj
+-600 TJm
+(n,) 11.9556 Tj
+-600 TJm
+(m) 5.9778 Tj
+-600 TJm
+(\)) 5.9778 Tj
+[1 0 0 1 232.893 353.375] cm
+0 g
+0 G
+[1 0 0 1 -232.893 -353.375] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+235.938 353.375 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-306 TJm
+(e) 4.42357 Tj
+15 TJm
+(xpect) 21.5799 Tj
+1 TJm
+(ed) 9.40507 Tj
+-306 TJm
+(to) 7.75121 Tj
+-306 TJm
+(return) 23.7916 Tj
+-305 TJm
+(a) 4.42357 Tj
+-306 TJm
+(pointer) 28.2252 Tj
+[1 0 0 1 360.3 353.375] cm
+0 g
+0 G
+[1 0 0 1 -360.3 -353.375] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+360.3 353.375 Td
+/F130_0 9.963 Tf
+(p) 5.9778 Tj
+[1 0 0 1 366.277 353.375] cm
+0 g
+0 G
+[1 0 0 1 -366.277 -353.375] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+369.322 353.375 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+[1 0 0 1 380.118 353.375] cm
+0 g
+0 G
+[1 0 0 1 -380.118 -353.375] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+380.118 353.375 Td
+/F130_0 9.963 Tf
+(n) 5.9778 Tj
+-600 TJm
+(*) 5.9778 Tj
+-600 TJm
+(m) 5.9778 Tj
+[1 0 0 1 410.006 353.375] cm
+0 g
+0 G
+[1 0 0 1 -410.006 -353.375] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+413.051 353.375 Td
+/F128_0 9.963 Tf
+(bytes) 21.0319 Tj
+-306 TJm
+(of) 8.29918 Tj
+-305 TJm
+(memory) 33.2067 Tj
+65 TJm
+(,) 2.49075 Tj
+-320 TJm
+(and) 14.3866 Tj
+[1 0 0 1 504.135 353.375] cm
+0 g
+0 G
+[1 0 0 1 -504.135 -353.375] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+504.135 353.375 Td
+/F130_0 9.963 Tf
+(bzfree) 35.8668 Tj
+72 341.42 Td
+(\() 5.9778 Tj
+-600 TJm
+(opaque,) 41.8446 Tj
+-600 TJm
+(p) 5.9778 Tj
+-600 TJm
+(\)) 5.9778 Tj
+[1 0 0 1 149.709 341.42] cm
+0 g
+0 G
+[1 0 0 1 -149.709 -341.42] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+152.199 341.42 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-250 TJm
+(free) 15.4825 Tj
+-250 TJm
+(that) 14.9445 Tj
+-250 TJm
+(memory) 33.2067 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 339.263] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -329.3] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 319.502 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-280 TJm
+(you) 14.9445 Tj
+-280 TJm
+(don') 18.2622 Tj
+18 TJm
+(t) 2.76971 Tj
+-279 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-280 TJm
+(to) 7.75121 Tj
+-280 TJm
+(use) 13.2807 Tj
+-280 TJm
+(a) 4.42357 Tj
+-279 TJm
+(custom) 28.7831 Tj
+-280 TJm
+(memory) 33.2067 Tj
+-280 TJm
+(allocator) 34.8605 Tj
+40 TJm
+(,) 2.49075 Tj
+-287 TJm
+(set) 11.0689 Tj
+[1 0 0 1 299.9 319.502] cm
+0 g
+0 G
+[1 0 0 1 -299.9 -319.502] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+299.9 319.502 Td
+/F130_0 9.963 Tf
+(bzalloc) 41.8446 Tj
+[1 0 0 1 341.743 319.502] cm
+0 g
+0 G
+[1 0 0 1 -341.743 -319.502] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+341.743 319.502 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 347.096 319.502] cm
+0 g
+0 G
+[1 0 0 1 -347.096 -319.502] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+347.096 319.502 Td
+/F130_0 9.963 Tf
+(bzfree) 35.8668 Tj
+[1 0 0 1 382.961 319.502] cm
+0 g
+0 G
+[1 0 0 1 -382.961 -319.502] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+385.749 319.502 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 402.923 319.502] cm
+0 g
+0 G
+[1 0 0 1 -402.923 -319.502] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+402.923 319.502 Td
+/F130_0 9.963 Tf
+(opaque) 35.8668 Tj
+[1 0 0 1 438.788 319.502] cm
+0 g
+0 G
+[1 0 0 1 -438.788 -319.502] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+441.576 319.502 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+[1 0 0 1 452.115 319.502] cm
+0 g
+0 G
+[1 0 0 1 -452.115 -319.502] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+452.115 319.502 Td
+/F130_0 9.963 Tf
+(NULL) 23.9112 Tj
+[1 0 0 1 476.025 319.502] cm
+0 g
+0 G
+[1 0 0 1 -476.025 -319.502] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+476.025 319.502 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-280 TJm
+(and) 14.3866 Tj
+-280 TJm
+(the) 12.1748 Tj
+-279 TJm
+(library) 26.5614 Tj
+72 307.547 Td
+(will) 15.5024 Tj
+-250 TJm
+(then) 17.1563 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(standard) 33.7546 Tj
+[1 0 0 1 176.318 307.547] cm
+0 g
+0 G
+[1 0 0 1 -176.318 -307.547] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+176.318 307.547 Td
+/F130_0 9.963 Tf
+(malloc) 35.8668 Tj
+[1 0 0 1 212.183 307.547] cm
+0 g
+0 G
+[1 0 0 1 -212.183 -307.547] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+214.674 307.547 Td
+/F128_0 9.963 Tf
+(/) 2.76971 Tj
+[1 0 0 1 219.934 307.547] cm
+0 g
+0 G
+[1 0 0 1 -219.934 -307.547] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+219.934 307.547 Td
+/F130_0 9.963 Tf
+(free) 23.9112 Tj
+[1 0 0 1 243.844 307.547] cm
+0 g
+0 G
+[1 0 0 1 -243.844 -307.547] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+246.335 307.547 Td
+/F128_0 9.963 Tf
+(routines.) 34.5915 Tj
+[1 0 0 1 72 307.338] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -297.375] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 285.629 Td
+/F128_0 9.963 Tf
+(Before) 27.1093 Tj
+-362 TJm
+(calling) 27.1193 Tj
+[1 0 0 1 133.438 285.629] cm
+0 g
+0 G
+[1 0 0 1 -133.438 -285.629] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+133.438 285.629 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 241.035 285.629] cm
+0 g
+0 G
+[1 0 0 1 -241.035 -285.629] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+241.035 285.629 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-390 TJm
+(\002elds) 21.5898 Tj
+[1 0 0 1 272.606 285.629] cm
+0 g
+0 G
+[1 0 0 1 -272.606 -285.629] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+272.606 285.629 Td
+/F130_0 9.963 Tf
+(bzalloc) 41.8446 Tj
+[1 0 0 1 314.449 285.629] cm
+0 g
+0 G
+[1 0 0 1 -314.449 -285.629] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+314.449 285.629 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 320.825 285.629] cm
+0 g
+0 G
+[1 0 0 1 -320.825 -285.629] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+320.825 285.629 Td
+/F130_0 9.963 Tf
+(bzfree) 35.8668 Tj
+[1 0 0 1 356.69 285.629] cm
+0 g
+0 G
+[1 0 0 1 -356.69 -285.629] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+360.296 285.629 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 378.288 285.629] cm
+0 g
+0 G
+[1 0 0 1 -378.288 -285.629] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+378.288 285.629 Td
+/F130_0 9.963 Tf
+(opaque) 35.8668 Tj
+[1 0 0 1 414.154 285.629] cm
+0 g
+0 G
+[1 0 0 1 -414.154 -285.629] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+417.76 285.629 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-362 TJm
+(be) 9.40507 Tj
+-362 TJm
+(\002lled) 20.4839 Tj
+-362 TJm
+(appropriat) 40.9479 Tj
+1 TJm
+(ely) 12.1748 Tj
+65 TJm
+(,) 2.49075 Tj
+72 273.674 Td
+(as) 8.29918 Tj
+-322 TJm
+(just) 14.3965 Tj
+-323 TJm
+(described.) 40.669 Tj
+-1055 TJm
+(U) 7.19329 Tj
+1 TJm
+(pon) 14.9445 Tj
+-323 TJm
+(return,) 26.2824 Tj
+-340 TJm
+(the) 12.1748 Tj
+-323 TJm
+(internal) 30.437 Tj
+-322 TJm
+(state) 18.2622 Tj
+-322 TJm
+(will) 15.5024 Tj
+-323 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-322 TJm
+(been) 18.8101 Tj
+-323 TJm
+(allocated) 35.9664 Tj
+-322 TJm
+(and) 14.3866 Tj
+-322 TJm
+(initialised,) 41.7948 Tj
+-341 TJm
+(and) 14.3866 Tj
+[1 0 0 1 459.801 273.674] cm
+0 g
+0 G
+[1 0 0 1 -459.801 -273.674] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+459.801 273.674 Td
+/F130_0 9.963 Tf
+(total_in_lo32) 77.7114 Tj
+[1 0 0 1 537.509 273.674] cm
+0 g
+0 G
+[1 0 0 1 -537.509 -273.674] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+537.509 273.674 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 72 261.719] cm
+0 g
+0 G
+[1 0 0 1 -72 -261.719] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 261.719 Td
+/F130_0 9.963 Tf
+(total_in_hi32) 77.7114 Tj
+[1 0 0 1 149.709 261.719] cm
+0 g
+0 G
+[1 0 0 1 -149.709 -261.719] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+149.709 261.719 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 155.006 261.719] cm
+0 g
+0 G
+[1 0 0 1 -155.006 -261.719] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+155.006 261.719 Td
+/F130_0 9.963 Tf
+(total_out_lo32) 83.6892 Tj
+[1 0 0 1 238.692 261.719] cm
+0 g
+0 G
+[1 0 0 1 -238.692 -261.719] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+241.435 261.719 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 258.564 261.719] cm
+0 g
+0 G
+[1 0 0 1 -258.564 -261.719] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+258.564 261.719 Td
+/F130_0 9.963 Tf
+(total_out_hi32) 83.6892 Tj
+[1 0 0 1 342.25 261.719] cm
+0 g
+0 G
+[1 0 0 1 -342.25 -261.719] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+344.994 261.719 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-275 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-276 TJm
+(b) 4.9815 Tj
+1 TJm
+(een) 13.8286 Tj
+-276 TJm
+(set) 11.0689 Tj
+-275 TJm
+(to) 7.75121 Tj
+-275 TJm
+(zero.) 19.6371 Tj
+-772 TJm
+(These) 23.7916 Tj
+-276 TJm
+(four) 16.5984 Tj
+-275 TJm
+(\002elds) 21.5898 Tj
+-275 TJm
+(are) 12.1648 Tj
+72 249.763 Td
+(used) 18.2622 Tj
+-339 TJm
+(by) 9.963 Tj
+-340 TJm
+(the) 12.1748 Tj
+-339 TJm
+(library) 26.5614 Tj
+-340 TJm
+(to) 7.75121 Tj
+-339 TJm
+(inform) 27.1193 Tj
+-340 TJm
+(the) 12.1748 Tj
+-339 TJm
+(caller) 22.1278 Tj
+-340 TJm
+(of) 8.29918 Tj
+-339 TJm
+(the) 12.1748 Tj
+-340 TJm
+(total) 17.7142 Tj
+-339 TJm
+(amount) 29.889 Tj
+-340 TJm
+(of) 8.29918 Tj
+-339 TJm
+(data) 16.5984 Tj
+-339 TJm
+(passed) 26.5614 Tj
+-340 TJm
+(into) 15.5024 Tj
+-339 TJm
+(and) 14.3866 Tj
+-340 TJm
+(out) 12.7327 Tj
+-339 TJm
+(of) 8.29918 Tj
+-340 TJm
+(the) 12.1748 Tj
+-339 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+-362 TJm
+(respecti) 30.9849 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ely) 12.1748 Tj
+65 TJm
+(.) 2.49075 Tj
+72 237.808 Td
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-376 TJm
+(should) 26.5713 Tj
+-377 TJm
+(not) 12.7327 Tj
+-376 TJm
+(try) 11.0689 Tj
+-376 TJm
+(to) 7.75121 Tj
+-377 TJm
+(c) 4.42357 Tj
+1 TJm
+(hange) 23.7916 Tj
+-377 TJm
+(them.) 22.4168 Tj
+-1378 TJm
+(As) 11.0689 Tj
+-376 TJm
+(of) 8.29918 Tj
+-377 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+1 TJm
+(rsion) 19.926 Tj
+-377 TJm
+(1.0,) 14.9445 Tj
+-408 TJm
+(64-bit) 23.8016 Tj
+-376 TJm
+(counts) 26.0134 Tj
+-376 TJm
+(are) 12.1648 Tj
+-376 TJm
+(maintained,) 46.7663 Tj
+-408 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-377 TJm
+(on) 9.963 Tj
+-376 TJm
+(32-bit) 23.8016 Tj
+-376 TJm
+(platforms,) 40.6789 Tj
+72 225.853 Td
+(using) 21.5898 Tj
+-371 TJm
+(the) 12.1748 Tj
+[1 0 0 1 113.148 225.853] cm
+0 g
+0 G
+[1 0 0 1 -113.148 -225.853] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+113.148 225.853 Td
+/F130_0 9.963 Tf
+(_hi32) 29.889 Tj
+[1 0 0 1 143.036 225.853] cm
+0 g
+0 G
+[1 0 0 1 -143.036 -225.853] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+146.729 225.853 Td
+/F128_0 9.963 Tf
+(\002elds) 21.5898 Tj
+-371 TJm
+(to) 7.75121 Tj
+-370 TJm
+(store) 19.3681 Tj
+-371 TJm
+(the) 12.1748 Tj
+-370 TJm
+(upper) 22.6858 Tj
+-371 TJm
+(32) 9.963 Tj
+-370 TJm
+(bits) 14.3965 Tj
+-371 TJm
+(of) 8.29918 Tj
+-371 TJm
+(the) 12.1748 Tj
+-370 TJm
+(count.) 24.6285 Tj
+-1344 TJm
+(So,) 13.0117 Tj
+-401 TJm
+(for) 11.6169 Tj
+-370 TJm
+(e) 4.42357 Tj
+15 TJm
+(xample,) 31.8218 Tj
+-401 TJm
+(the) 12.1748 Tj
+-370 TJm
+(total) 17.7142 Tj
+-371 TJm
+(amount) 29.889 Tj
+-371 TJm
+(of) 8.29918 Tj
+-370 TJm
+(data) 16.5984 Tj
+-371 TJm
+(in) 7.75121 Tj
+-370 TJm
+(is) 6.64532 Tj
+[1 0 0 1 72 213.898] cm
+0 g
+0 G
+[1 0 0 1 -72 -213.898] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 213.898 Td
+/F130_0 9.963 Tf
+(\(total_in_hi32) 83.6892 Tj
+-600 TJm
+(<<) 11.9556 Tj
+-600 TJm
+(32\)) 17.9334 Tj
+-600 TJm
+(+) 5.9778 Tj
+-600 TJm
+(to) 11.9556 Tj
+1 TJm
+(tal_in_lo32) 65.7558 Tj
+[1 0 0 1 293.171 213.898] cm
+0 g
+0 G
+[1 0 0 1 -293.171 -213.898] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+293.171 213.898 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 212.732] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -202.77] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 191.98 Td
+/F128_0 9.963 Tf
+(P) 5.53943 Tj
+15 TJm
+(arameter) 34.8506 Tj
+[1 0 0 1 115.367 191.98] cm
+0 g
+0 G
+[1 0 0 1 -115.367 -191.98] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+115.367 191.98 Td
+/F130_0 9.963 Tf
+(blockSize100k) 77.7114 Tj
+[1 0 0 1 193.076 191.98] cm
+0 g
+0 G
+[1 0 0 1 -193.076 -191.98] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+196.205 191.98 Td
+/F128_0 9.963 Tf
+(speci\002es) 34.3126 Tj
+-314 TJm
+(the) 12.1748 Tj
+-314 TJm
+(block) 22.1378 Tj
+-314 TJm
+(size) 15.4925 Tj
+-314 TJm
+(to) 7.75121 Tj
+-314 TJm
+(be) 9.40507 Tj
+-314 TJm
+(used) 18.2622 Tj
+-314 TJm
+(for) 11.6169 Tj
+-314 TJm
+(comp) 22.1378 Tj
+1 TJm
+(ression.) 30.7159 Tj
+-1005 TJm
+(It) 6.08739 Tj
+-314 TJm
+(sh) 8.85711 Tj
+1 TJm
+(ould) 17.7142 Tj
+-314 TJm
+(be) 9.40507 Tj
+-314 TJm
+(a) 4.42357 Tj
+-314 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+-314 TJm
+(between) 33.1967 Tj
+-314 TJm
+(1) 4.9815 Tj
+72 180.025 Td
+(and) 14.3866 Tj
+-289 TJm
+(9) 4.9815 Tj
+-289 TJm
+(inclusi) 26.5713 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e,) 6.91432 Tj
+-299 TJm
+(and) 14.3866 Tj
+-289 TJm
+(the) 12.1748 Tj
+-289 TJm
+(actua) 21.0219 Tj
+1 TJm
+(l) 2.76971 Tj
+-290 TJm
+(b) 4.9815 Tj
+1 TJm
+(lock) 17.1563 Tj
+-289 TJm
+(size) 15.4925 Tj
+-289 TJm
+(used) 18.2622 Tj
+-289 TJm
+(is) 6.64532 Tj
+-289 TJm
+(100000) 29.889 Tj
+-289 TJm
+(x) 4.9815 Tj
+-289 TJm
+(this) 14.3965 Tj
+-289 TJm
+(\002gure.) 25.7344 Tj
+-854 TJm
+(9) 4.9815 Tj
+-289 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(es) 8.29918 Tj
+-289 TJm
+(the) 12.1748 Tj
+-289 TJm
+(best) 16.0504 Tj
+-289 TJm
+(compression) 50.363 Tj
+-289 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-289 TJm
+(tak) 12.1748 Tj
+10 TJm
+(es) 8.29918 Tj
+-289 TJm
+(most) 19.378 Tj
+72 168.07 Td
+(memory) 33.2067 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 165.913] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -155.95] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 146.152 Td
+/F128_0 9.963 Tf
+(P) 5.53943 Tj
+15 TJm
+(arameter) 34.8506 Tj
+[1 0 0 1 115.095 146.152] cm
+0 g
+0 G
+[1 0 0 1 -115.095 -146.152] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+115.095 146.152 Td
+/F130_0 9.963 Tf
+(verbosity) 53.8002 Tj
+[1 0 0 1 168.894 146.152] cm
+0 g
+0 G
+[1 0 0 1 -168.894 -146.152] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+171.75 146.152 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-287 TJm
+(be) 9.40507 Tj
+-286 TJm
+(set) 11.0689 Tj
+-287 TJm
+(to) 7.75121 Tj
+-287 TJm
+(a) 4.42357 Tj
+-286 TJm
+(number) 30.437 Tj
+-287 TJm
+(between) 33.1967 Tj
+-287 TJm
+(0) 4.9815 Tj
+-286 TJm
+(and) 14.3866 Tj
+-287 TJm
+(4) 4.9815 Tj
+-287 TJm
+(inclusi) 26.5713 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e.) 6.91432 Tj
+-840 TJm
+(0) 4.9815 Tj
+-287 TJm
+(is) 6.64532 Tj
+-286 TJm
+(silent,) 24.0806 Tj
+-296 TJm
+(and) 14.3866 Tj
+-287 TJm
+(greater) 27.6573 Tj
+-286 TJm
+(numbers) 34.3126 Tj
+-287 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+72 134.197 Td
+(increasingly) 48.6991 Tj
+-342 TJm
+(v) 4.9815 Tj
+15 TJm
+(erbose) 26.0034 Tj
+-342 TJm
+(monitoring/deb) 61.4418 Tj
+20 TJm
+(ugging) 27.6772 Tj
+-342 TJm
+(output.) 27.9562 Tj
+-1173 TJm
+(If) 6.63536 Tj
+-342 TJm
+(the) 12.1748 Tj
+-342 TJm
+(library) 26.5614 Tj
+-342 TJm
+(has) 13.2807 Tj
+-342 TJm
+(been) 18.8101 Tj
+-342 TJm
+(compiled) 37.0823 Tj
+-342 TJm
+(with) 17.7142 Tj
+[1 0 0 1 446.429 134.197] cm
+0 g
+0 G
+[1 0 0 1 -446.429 -134.197] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+446.429 134.197 Td
+/F130_0 9.963 Tf
+(-DBZ_NO_STDIO) 77.7114 Tj
+[1 0 0 1 524.138 134.197] cm
+0 g
+0 G
+[1 0 0 1 -524.138 -134.197] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+524.138 134.197 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-342 TJm
+(no) 9.963 Tj
+72 122.242 Td
+(such) 18.2622 Tj
+-250 TJm
+(output) 25.4654 Tj
+-250 TJm
+(will) 15.5024 Tj
+-250 TJm
+(appear) 26.5514 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-249 TJm
+(v) 4.9815 Tj
+15 TJm
+(erbosity) 32.1008 Tj
+-250 TJm
+(setting.) 29.0621 Tj
+[1 0 0 1 72 120.085] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -110.122] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 100.324 Td
+/F128_0 9.963 Tf
+(P) 5.53943 Tj
+15 TJm
+(arameter) 34.8506 Tj
+[1 0 0 1 116.619 100.324] cm
+0 g
+0 G
+[1 0 0 1 -116.619 -100.324] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+116.619 100.324 Td
+/F130_0 9.963 Tf
+(workFactor) 59.778 Tj
+[1 0 0 1 176.395 100.324] cm
+0 g
+0 G
+[1 0 0 1 -176.395 -100.324] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+180.775 100.324 Td
+/F128_0 9.963 Tf
+(controls) 32.1008 Tj
+-439 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-440 TJm
+(the) 12.1748 Tj
+-440 TJm
+(compr) 25.4555 Tj
+1 TJm
+(ession) 24.9075 Tj
+-440 TJm
+(phase) 22.6858 Tj
+-440 TJm
+(be) 9.40507 Tj
+1 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(es) 8.29918 Tj
+-440 TJm
+(when) 21.5799 Tj
+-440 TJm
+(presen) 26.0034 Tj
+1 TJm
+(ted) 12.1748 Tj
+-440 TJm
+(with) 17.7142 Tj
+-440 TJm
+(w) 7.19329 Tj
+10 TJm
+(orst) 14.9445 Tj
+-439 TJm
+(case,) 19.6371 Tj
+-487 TJm
+(highly) 25.4654 Tj
+72 88.369 Td
+(repetiti) 28.2252 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e,) 6.91432 Tj
+-432 TJm
+(input) 20.4839 Tj
+-396 TJm
+(data.) 19.0891 Tj
+-1497 TJm
+(If) 6.63536 Tj
+-396 TJm
+(compression) 50.363 Tj
+-396 TJm
+(runs) 17.1563 Tj
+-396 TJm
+(into) 15.5024 Tj
+-396 TJm
+(dif) 11.0689 Tj
+25 TJm
+(\002culties) 31.5528 Tj
+-396 TJm
+(caused) 27.1093 Tj
+-396 TJm
+(by) 9.963 Tj
+-396 TJm
+(repetiti) 28.2252 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-396 TJm
+(data,) 19.0891 Tj
+-432 TJm
+(the) 12.1748 Tj
+-396 TJm
+(library) 26.5614 Tj
+-396 TJm
+(switches) 34.3126 Tj
+-396 TJm
+(from) 19.3681 Tj
+[1 0 0 1 72 50.852] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.754] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.754] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.852 Td
+/F128_0 9.963 Tf
+(12) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 16 16
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -540 -741.554] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(the) 12.1748 Tj
+-255 TJm
+(stan) 16.0504 Tj
+1 TJm
+(dard) 17.7043 Tj
+-255 TJm
+(sorting) 27.6772 Tj
+-255 TJm
+(alg) 12.1748 Tj
+1 TJm
+(orithm) 26.5713 Tj
+-255 TJm
+(to) 7.75121 Tj
+-255 TJm
+(a) 4.42357 Tj
+-254 TJm
+(f) 3.31768 Tj
+10 TJm
+(allback) 28.7731 Tj
+-255 TJm
+(algorithm) 38.7461 Tj
+1 TJm
+(.) 2.49075 Tj
+-648 TJm
+(The) 15.4925 Tj
+-255 TJm
+(f) 3.31768 Tj
+10 TJm
+(allback) 28.7731 Tj
+-254 TJm
+(is) 6.64532 Tj
+-255 TJm
+(slo) 11.6268 Tj
+25 TJm
+(wer) 14.9345 Tj
+-254 TJm
+(than) 17.1563 Tj
+-255 TJm
+(the) 12.1748 Tj
+-255 TJm
+(st) 6.64532 Tj
+1 TJm
+(andard) 27.1093 Tj
+-255 TJm
+(algorithm) 38.7461 Tj
+-254 TJm
+(by) 9.963 Tj
+-255 TJm
+(perhaps) 30.9849 Tj
+72 698.082 Td
+(a) 4.42357 Tj
+-250 TJm
+(f) 3.31768 Tj
+10 TJm
+(actor) 19.916 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(three,) 22.4068 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(al) 7.19329 Tj
+10 TJm
+(w) 7.19329 Tj
+10 TJm
+(ays) 13.2807 Tj
+-250 TJm
+(b) 4.9815 Tj
+1 TJm
+(eha) 13.8286 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(es) 8.29918 Tj
+-250 TJm
+(reasonably) 43.1597 Tj
+65 TJm
+(,) 2.49075 Tj
+-250 TJm
+(no) 9.963 Tj
+-250 TJm
+(matter) 25.4555 Tj
+-250 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(bad) 14.3866 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(input.) 22.9747 Tj
+[1 0 0 1 72 695.925] cm
+0 g
+0 G
+[1 0 0 1 0 -9.961] cm
+0 g
+0 G
+[1 0 0 1 -72 -685.964] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 676.165 Td
+/F128_0 9.963 Tf
+(Lo) 11.0689 Tj
+25 TJm
+(wer) 14.9345 Tj
+-240 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+1 TJm
+(s) 3.87561 Tj
+-240 TJm
+(of) 8.29918 Tj
+[1 0 0 1 138.421 676.165] cm
+0 g
+0 G
+[1 0 0 1 -138.421 -676.165] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+138.421 676.165 Td
+/F130_0 9.963 Tf
+(workFactor) 59.778 Tj
+[1 0 0 1 198.197 676.165] cm
+0 g
+0 G
+[1 0 0 1 -198.197 -676.165] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+200.585 676.165 Td
+/F128_0 9.963 Tf
+(reduce) 26.5514 Tj
+-240 TJm
+(the) 12.1748 Tj
+-239 TJm
+(amount) 29.889 Tj
+-240 TJm
+(of) 8.29918 Tj
+-239 TJm
+(ef) 7.74125 Tj
+25 TJm
+(fort) 14.3866 Tj
+-240 TJm
+(the) 12.1748 Tj
+-240 TJm
+(standard) 33.7546 Tj
+-239 TJm
+(algorithm) 38.7461 Tj
+-240 TJm
+(will) 15.5024 Tj
+-239 TJm
+(e) 4.42357 Tj
+15 TJm
+(xpend) 24.3496 Tj
+-240 TJm
+(before) 25.4455 Tj
+-240 TJm
+(re) 7.74125 Tj
+1 TJm
+(sorting) 27.6772 Tj
+-240 TJm
+(to) 7.75121 Tj
+-240 TJm
+(the) 12.1748 Tj
+72 664.21 Td
+(f) 3.31768 Tj
+10 TJm
+(allback.) 31.2639 Tj
+-618 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-248 TJm
+(should) 26.5713 Tj
+-247 TJm
+(set) 11.0689 Tj
+-248 TJm
+(this) 14.3965 Tj
+-247 TJm
+(parameter) 39.8321 Tj
+-247 TJm
+(carefully;) 38.1782 Tj
+-249 TJm
+(too) 12.7327 Tj
+-247 TJm
+(lo) 7.75121 Tj
+25 TJm
+(w) 7.19329 Tj
+65 TJm
+(,) 2.49075 Tj
+-248 TJm
+(and) 14.3866 Tj
+-247 TJm
+(man) 17.1563 Tj
+15 TJm
+(y) 4.9815 Tj
+-248 TJm
+(inputs) 24.3595 Tj
+-247 TJm
+(will) 15.5024 Tj
+-248 TJm
+(be) 9.40507 Tj
+-247 TJm
+(handled) 31.5429 Tj
+-248 TJm
+(by) 9.963 Tj
+-247 TJm
+(the) 12.1748 Tj
+-248 TJm
+(f) 3.31768 Tj
+10 TJm
+(allback) 28.7731 Tj
+-247 TJm
+(algorithm) 38.7461 Tj
+72 652.255 Td
+(and) 14.3866 Tj
+-308 TJm
+(so) 8.85711 Tj
+-308 TJm
+(compress) 37.6303 Tj
+-308 TJm
+(rather) 23.2337 Tj
+-308 TJm
+(slo) 11.6268 Tj
+25 TJm
+(wly) 14.9445 Tj
+65 TJm
+(,) 2.49075 Tj
+-323 TJm
+(too) 12.7327 Tj
+-308 TJm
+(high,) 20.205 Tj
+-323 TJm
+(and) 14.3866 Tj
+-308 TJm
+(your) 18.2622 Tj
+-308 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(erage-to-w) 43.1498 Tj
+10 TJm
+(orst) 14.9445 Tj
+-308 TJm
+(case) 17.1463 Tj
+-308 TJm
+(compression) 50.363 Tj
+-308 TJm
+(times) 21.5898 Tj
+-308 TJm
+(can) 13.8286 Tj
+-308 TJm
+(become) 30.9849 Tj
+-308 TJm
+(v) 4.9815 Tj
+15 TJm
+(ery) 12.7228 Tj
+-308 TJm
+(lar) 10.511 Tj
+18 TJm
+(ge.) 11.8958 Tj
+72 640.3 Td
+(The) 15.4925 Tj
+-250 TJm
+(def) 12.7228 Tj
+10 TJm
+(ault) 14.9445 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(30) 9.963 Tj
+-250 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(es) 8.29918 Tj
+-250 TJm
+(re) 7.74125 Tj
+1 TJm
+(asonable) 34.8605 Tj
+-250 TJm
+(beha) 18.8101 Tj
+20 TJm
+(viour) 21.0319 Tj
+-250 TJm
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(wide) 19.3681 Tj
+-250 TJm
+(range) 22.1278 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(circumstances.) 58.9311 Tj
+[1 0 0 1 72 638.143] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -628.181] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 618.383 Td
+/F128_0 9.963 Tf
+(Allo) 17.7142 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues) 20.474 Tj
+-250 TJm
+(range) 22.1278 Tj
+-250 TJm
+(from) 19.3681 Tj
+-249 TJm
+(0) 4.9815 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(250) 14.9445 Tj
+-250 TJm
+(inclusi) 26.5713 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e.) 6.91432 Tj
+-620 TJm
+(0) 4.9815 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(special) 27.6673 Tj
+-250 TJm
+(case,) 19.6371 Tj
+-250 TJm
+(equi) 17.1563 Tj
+25 TJm
+(v) 4.9815 Tj
+25 TJm
+(alent) 19.3681 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(usi) 11.6268 Tj
+1 TJm
+(ng) 9.963 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(def) 12.7228 Tj
+10 TJm
+(ault) 14.9445 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(30.) 12.4538 Tj
+[1 0 0 1 72 616.226] cm
+0 g
+0 G
+[1 0 0 1 0 -9.961] cm
+0 g
+0 G
+[1 0 0 1 -72 -606.265] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 596.466 Td
+/F128_0 9.963 Tf
+(Note) 19.3681 Tj
+-250 TJm
+(that) 14.9445 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-250 TJm
+(out) 12.7327 Tj
+1 TJm
+(put) 12.7327 Tj
+-250 TJm
+(generated) 38.7262 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(same) 20.474 Tj
+-250 TJm
+(re) 7.74125 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(ardless) 27.6673 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(whether) 32.0908 Tj
+-250 TJm
+(or) 8.29918 Tj
+-250 TJm
+(not) 12.7327 Tj
+-250 TJm
+(the) 12.1748 Tj
+-249 TJm
+(f) 3.31768 Tj
+10 TJm
+(allback) 28.7731 Tj
+-250 TJm
+(algorithm) 38.7461 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(used.) 20.7529 Tj
+[1 0 0 1 72 594.309] cm
+0 g
+0 G
+[1 0 0 1 0 -9.961] cm
+0 g
+0 G
+[1 0 0 1 -72 -584.348] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 574.549 Td
+/F128_0 9.963 Tf
+(Be) 11.0689 Tj
+-303 TJm
+(a) 4.42357 Tj
+15 TJm
+(w) 7.19329 Tj
+10 TJm
+(are) 12.1648 Tj
+-303 TJm
+(also) 16.0504 Tj
+-303 TJm
+(that) 14.9445 Tj
+-303 TJm
+(this) 14.3965 Tj
+-303 TJm
+(parameter) 39.8321 Tj
+-303 TJm
+(may) 17.1563 Tj
+-303 TJm
+(disappear) 38.1782 Tj
+-303 TJm
+(entirely) 30.437 Tj
+-303 TJm
+(in) 7.75121 Tj
+-303 TJm
+(future) 23.7916 Tj
+-303 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersions) 28.2252 Tj
+-303 TJm
+(of) 8.29918 Tj
+-303 TJm
+(the) 12.1748 Tj
+-303 TJm
+(library) 26.5614 Tj
+65 TJm
+(.) 2.49075 Tj
+-939 TJm
+(In) 8.29918 Tj
+-303 TJm
+(principle) 35.4185 Tj
+-303 TJm
+(it) 5.53943 Tj
+-303 TJm
+(should) 26.5713 Tj
+-303 TJm
+(be) 9.40507 Tj
+72 562.594 Td
+(possible) 32.6587 Tj
+-270 TJm
+(to) 7.75121 Tj
+-270 TJm
+(de) 9.40507 Tj
+25 TJm
+(vise) 16.0504 Tj
+-270 TJm
+(a) 4.42357 Tj
+-270 TJm
+(good) 19.926 Tj
+-270 TJm
+(w) 7.19329 Tj
+10 TJm
+(ay) 9.40507 Tj
+-270 TJm
+(to) 7.75121 Tj
+-270 TJm
+(automatically) 54.2386 Tj
+-270 TJm
+(choose) 27.6673 Tj
+-270 TJm
+(which) 24.3496 Tj
+-270 TJm
+(algorithm) 38.7461 Tj
+-270 TJm
+(to) 7.75121 Tj
+-270 TJm
+(use.) 15.7714 Tj
+-740 TJm
+(Such) 19.926 Tj
+-270 TJm
+(a) 4.42357 Tj
+-270 TJm
+(mechanism) 45.3815 Tj
+-270 TJm
+(w) 7.19329 Tj
+10 TJm
+(ould) 17.7142 Tj
+-270 TJm
+(render) 25.4455 Tj
+-270 TJm
+(the) 12.1748 Tj
+72 550.639 Td
+(parameter) 39.8321 Tj
+-250 TJm
+(obsolete.) 35.6974 Tj
+[1 0 0 1 72 548.482] cm
+0 g
+0 G
+[1 0 0 1 0 -9.961] cm
+0 g
+0 G
+[1 0 0 1 -72 -538.521] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 528.722 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 528.623] cm
+0 g
+0 G
+[1 0 0 1 0 -144.458] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 143.462 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 139.876] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -519.258] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 519.258 Td
+/F130_0 9.963 Tf
+(BZ_CONFIG_ERROR) 89.667 Tj
+98.488 507.303 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(library) 41.8446 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-425 TJm
+(mis-compiled) 71.7336 Tj
+90 495.348 Td
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 483.392 Td
+(if) 11.9556 Tj
+-426 TJm
+(strm) 23.9112 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+98.488 471.437 Td
+(or) 11.9556 Tj
+-426 TJm
+(blockSize) 53.8002 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(1) 5.9778 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(bloc) 23.9112 Tj
+1 TJm
+(kSize) 29.889 Tj
+-426 TJm
+(>) 5.9778 Tj
+-426 TJm
+(9) 5.9778 Tj
+98.488 459.482 Td
+(or) 11.9556 Tj
+-426 TJm
+(verbosity) 53.8002 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(verb) 23.9112 Tj
+1 TJm
+(osity) 29.889 Tj
+-426 TJm
+(>) 5.9778 Tj
+-426 TJm
+(4) 5.9778 Tj
+98.488 447.527 Td
+(or) 11.9556 Tj
+-426 TJm
+(workFactor) 59.778 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(wor) 17.9334 Tj
+1 TJm
+(kFactor) 41.8446 Tj
+-426 TJm
+(>) 5.9778 Tj
+-426 TJm
+(250) 17.9334 Tj
+90 435.572 Td
+(BZ_MEM_ERROR) 71.7336 Tj
+98.488 423.617 Td
+(if) 11.9556 Tj
+-426 TJm
+(not) 17.9334 Tj
+-426 TJm
+(enough) 35.8668 Tj
+-426 TJm
+(memory) 35.8668 Tj
+-426 TJm
+(is) 11.9556 Tj
+-425 TJm
+(available) 53.8002 Tj
+90 411.661 Td
+(BZ_OK) 29.889 Tj
+98.488 399.706 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 384.165] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.548] cm
+0 g
+0 G
+[1 0 0 1 -72 -374.203] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 362.248 Td
+/F128_0 9.963 Tf
+(Allo) 17.7142 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-250 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-250 TJm
+(actions:) 30.9949 Tj
+[1 0 0 1 72 362.148] cm
+0 g
+0 G
+[1 0 0 1 0 -48.817] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 47.821 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 44.234] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -352.783] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 352.783 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+98.488 340.828 Td
+(if) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(returned) 47.8224 Tj
+98.488 328.873 Td
+(no) 11.9556 Tj
+-426 TJm
+(specific) 47.8224 Tj
+-426 TJm
+(action) 35.8668 Tj
+-426 TJm
+(needed) 35.8668 Tj
+-425 TJm
+(in) 11.9556 Tj
+-426 TJm
+(case) 23.9112 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(error) 29.889 Tj
+[1 0 0 1 72 313.331] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.961] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -303.37] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 282.711 Td
+/F121_0 17.215 Tf
+(3.3.2.) 43.0719 Tj
+[1 0 0 1 119.858 282.711] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -282.711] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 282.711 Td
+/F387_0 17.215 Tf
+(BZ2_bzCompress) 144.606 Tj
+[1 0 0 1 264.468 282.711] cm
+0 g
+0 G
+[1 0 0 1 -192.468 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -24.906] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 20.324] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -271.014] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 271.014 Td
+/F130_0 9.963 Tf
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzCompress) 83.6892 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(bz_s) 23.9112 Tj
+1 TJm
+(tream) 29.889 Tj
+-426 TJm
+(*strm,) 35.8668 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(action) 35.8668 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 255.472] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.548] cm
+0 g
+0 G
+[1 0 0 1 -72 -245.51] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 233.555 Td
+/F128_0 9.963 Tf
+(Pro) 13.8386 Tj
+15 TJm
+(vides) 21.0319 Tj
+-222 TJm
+(mor) 16.0504 Tj
+1 TJm
+(e) 4.42357 Tj
+-222 TJm
+(input) 20.4839 Tj
+-222 TJm
+(and/or) 25.4555 Tj
+-221 TJm
+(output) 25.4654 Tj
+-222 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-222 TJm
+(space) 22.1278 Tj
+-221 TJm
+(for) 11.6169 Tj
+-222 TJm
+(the) 12.1748 Tj
+-222 TJm
+(li) 5.53943 Tj
+1 TJm
+(brary) 21.0219 Tj
+65 TJm
+(.) 2.49075 Tj
+-602 TJm
+(T) 6.08739 Tj
+1 TJm
+(he) 9.40507 Tj
+-222 TJm
+(caller) 22.1278 Tj
+-222 TJm
+(maintains) 38.7461 Tj
+-221 TJm
+(input) 20.4839 Tj
+-222 TJm
+(and) 14.3866 Tj
+-222 TJm
+(ou) 9.963 Tj
+1 TJm
+(tput) 15.5024 Tj
+-222 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fers,) 17.4253 Tj
+-227 TJm
+(and) 14.3866 Tj
+-222 TJm
+(calls) 18.2622 Tj
+[1 0 0 1 72 221.6] cm
+0 g
+0 G
+[1 0 0 1 -72 -221.6] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 221.6 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 155.686 221.6] cm
+0 g
+0 G
+[1 0 0 1 -155.686 -221.6] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+158.177 221.6 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(transfer) 30.427 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(between) 33.1967 Tj
+-250 TJm
+(the) 12.1748 Tj
+1 TJm
+(m.) 10.242 Tj
+[1 0 0 1 72 220.036] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -210.074] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 199.683 Td
+/F128_0 9.963 Tf
+(Before) 27.1093 Tj
+-212 TJm
+(each) 18.2522 Tj
+-213 TJm
+(call) 14.3866 Tj
+-212 TJm
+(to) 7.75121 Tj
+[1 0 0 1 147.961 199.683] cm
+0 g
+0 G
+[1 0 0 1 -147.961 -199.683] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+147.961 199.683 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 231.647 199.683] cm
+0 g
+0 G
+[1 0 0 1 -231.647 -199.683] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+231.647 199.683 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 236.329 199.683] cm
+0 g
+0 G
+[1 0 0 1 -236.329 -199.683] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+236.329 199.683 Td
+/F130_0 9.963 Tf
+(next_in) 41.8446 Tj
+[1 0 0 1 278.172 199.683] cm
+0 g
+0 G
+[1 0 0 1 -278.172 -199.683] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+280.289 199.683 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-212 TJm
+(point) 20.4839 Tj
+-213 TJm
+(at) 7.19329 Tj
+-212 TJm
+(the) 12.1748 Tj
+-212 TJm
+(data) 16.5984 Tj
+-213 TJm
+(to) 7.75121 Tj
+-212 TJm
+(be) 9.40507 Tj
+-212 TJm
+(compressed,) 49.5261 Tj
+-220 TJm
+(and) 14.3866 Tj
+[1 0 0 1 463.493 199.683] cm
+0 g
+0 G
+[1 0 0 1 -463.493 -199.683] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+463.493 199.683 Td
+/F130_0 9.963 Tf
+(avail_in) 47.8224 Tj
+[1 0 0 1 511.314 199.683] cm
+0 g
+0 G
+[1 0 0 1 -511.314 -199.683] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+513.43 199.683 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+72 187.728 Td
+(indicate) 31.5429 Tj
+-246 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-246 TJm
+(man) 17.1563 Tj
+15 TJm
+(y) 4.9815 Tj
+-246 TJm
+(bytes) 21.0319 Tj
+-247 TJm
+(the) 12.1748 Tj
+-246 TJm
+(library) 26.5614 Tj
+-246 TJm
+(may) 17.1563 Tj
+-246 TJm
+(read.) 19.6371 Tj
+[1 0 0 1 259.242 187.728] cm
+0 g
+0 G
+[1 0 0 1 -259.242 -187.728] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+259.242 187.728 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 342.929 187.728] cm
+0 g
+0 G
+[1 0 0 1 -342.929 -187.728] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+345.382 187.728 Td
+/F128_0 9.963 Tf
+(updates) 30.437 Tj
+[1 0 0 1 378.271 187.728] cm
+0 g
+0 G
+[1 0 0 1 -378.271 -187.728] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+378.271 187.728 Td
+/F130_0 9.963 Tf
+(next_in) 41.8446 Tj
+[1 0 0 1 420.114 187.728] cm
+0 g
+0 G
+[1 0 0 1 -420.114 -187.728] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+420.114 187.728 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 425.066 187.728] cm
+0 g
+0 G
+[1 0 0 1 -425.066 -187.728] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+425.066 187.728 Td
+/F130_0 9.963 Tf
+(avail_in) 47.8224 Tj
+[1 0 0 1 472.886 187.728] cm
+0 g
+0 G
+[1 0 0 1 -472.886 -187.728] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+475.34 187.728 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 492.179 187.728] cm
+0 g
+0 G
+[1 0 0 1 -492.179 -187.728] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+492.179 187.728 Td
+/F130_0 9.963 Tf
+(total_in) 47.8224 Tj
+[1 0 0 1 540 187.728] cm
+0 g
+0 G
+[1 0 0 1 -540 -187.728] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 175.773 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(re\003ect) 24.8975 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(number) 30.437 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(bytes) 21.0319 Tj
+-249 TJm
+(it) 5.53943 Tj
+-250 TJm
+(has) 13.2807 Tj
+-250 TJm
+(read.) 19.6371 Tj
+[1 0 0 1 72 173.616] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -163.654] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 153.856 Td
+/F128_0 9.963 Tf
+(Similarly) 37.0922 Tj
+65 TJm
+(,) 2.49075 Tj
+[1 0 0 1 113.148 153.856] cm
+0 g
+0 G
+[1 0 0 1 -113.148 -153.856] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+113.148 153.856 Td
+/F130_0 9.963 Tf
+(next_out) 47.8224 Tj
+[1 0 0 1 160.968 153.856] cm
+0 g
+0 G
+[1 0 0 1 -160.968 -153.856] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+163.114 153.856 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-215 TJm
+(point) 20.4839 Tj
+-215 TJm
+(to) 7.75121 Tj
+-216 TJm
+(a) 4.42357 Tj
+-215 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-215 TJm
+(in) 7.75121 Tj
+-216 TJm
+(whi) 14.9445 Tj
+1 TJm
+(ch) 9.40507 Tj
+-216 TJm
+(the) 12.1748 Tj
+-215 TJm
+(compressed) 47.0353 Tj
+-215 TJm
+(data) 16.5984 Tj
+-215 TJm
+(is) 6.64532 Tj
+-216 TJm
+(to) 7.75121 Tj
+-215 TJm
+(be) 9.40507 Tj
+-215 TJm
+(placed,) 28.4942 Tj
+-222 TJm
+(with) 17.7142 Tj
+[1 0 0 1 456.391 153.856] cm
+0 g
+0 G
+[1 0 0 1 -456.391 -153.856] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+456.391 153.856 Td
+/F130_0 9.963 Tf
+(avail_out) 53.8002 Tj
+[1 0 0 1 510.189 153.856] cm
+0 g
+0 G
+[1 0 0 1 -510.189 -153.856] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+512.334 153.856 Td
+/F128_0 9.963 Tf
+(indica-) 27.6673 Tj
+72 141.901 Td
+(ting) 15.5024 Tj
+-280 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-281 TJm
+(muc) 17.1563 Tj
+1 TJm
+(h) 4.9815 Tj
+-281 TJm
+(output) 25.4654 Tj
+-280 TJm
+(space) 22.1278 Tj
+-280 TJm
+(is) 6.64532 Tj
+-281 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+25 TJm
+(ailabl) 22.1378 Tj
+1 TJm
+(e.) 6.91432 Tj
+[1 0 0 1 239.543 141.901] cm
+0 g
+0 G
+[1 0 0 1 -239.543 -141.901] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+239.543 141.901 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 323.229 141.901] cm
+0 g
+0 G
+[1 0 0 1 -323.229 -141.901] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+326.022 141.901 Td
+/F128_0 9.963 Tf
+(updates) 30.437 Tj
+[1 0 0 1 359.251 141.901] cm
+0 g
+0 G
+[1 0 0 1 -359.251 -141.901] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+359.251 141.901 Td
+/F130_0 9.963 Tf
+(next_out) 47.8224 Tj
+[1 0 0 1 407.072 141.901] cm
+0 g
+0 G
+[1 0 0 1 -407.072 -141.901] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+407.072 141.901 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 412.431 141.901] cm
+0 g
+0 G
+[1 0 0 1 -412.431 -141.901] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+412.431 141.901 Td
+/F130_0 9.963 Tf
+(avail_out) 53.8002 Tj
+[1 0 0 1 466.229 141.901] cm
+0 g
+0 G
+[1 0 0 1 -466.229 -141.901] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+469.023 141.901 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 486.202 141.901] cm
+0 g
+0 G
+[1 0 0 1 -486.202 -141.901] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+486.202 141.901 Td
+/F130_0 9.963 Tf
+(total_out) 53.8002 Tj
+[1 0 0 1 540 141.901] cm
+0 g
+0 G
+[1 0 0 1 -540 -141.901] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 129.946 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(re\003ect) 24.8975 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(number) 30.437 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(bytes) 21.0319 Tj
+-249 TJm
+(output.) 27.9562 Tj
+[1 0 0 1 72 127.789] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -117.827] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 108.029 Td
+/F128_0 9.963 Tf
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-272 TJm
+(may) 17.1563 Tj
+-272 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vide) 17.1563 Tj
+-272 TJm
+(and) 14.3866 Tj
+-271 TJm
+(remo) 20.474 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-272 TJm
+(as) 8.29918 Tj
+-272 TJm
+(little) 18.2721 Tj
+-272 TJm
+(or) 8.29918 Tj
+-272 TJm
+(as) 8.29918 Tj
+-272 TJm
+(much) 22.1378 Tj
+-272 TJm
+(data) 16.5984 Tj
+-272 TJm
+(as) 8.29918 Tj
+-271 TJm
+(you) 14.9445 Tj
+-272 TJm
+(lik) 10.5209 Tj
+10 TJm
+(e) 4.42357 Tj
+-272 TJm
+(on) 9.963 Tj
+-272 TJm
+(each) 18.2522 Tj
+-272 TJm
+(call) 14.3866 Tj
+-272 TJm
+(of) 8.29918 Tj
+[1 0 0 1 399.123 108.029] cm
+0 g
+0 G
+[1 0 0 1 -399.123 -108.029] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+399.123 108.029 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 482.809 108.029] cm
+0 g
+0 G
+[1 0 0 1 -482.809 -108.029] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+482.809 108.029 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-752 TJm
+(In) 8.29918 Tj
+-272 TJm
+(the) 12.1748 Tj
+-271 TJm
+(limit,) 21.3208 Tj
+72 96.074 Td
+(it) 5.53943 Tj
+-266 TJm
+(is) 6.64532 Tj
+-265 TJm
+(acceptable) 42.0439 Tj
+-266 TJm
+(to) 7.75121 Tj
+-266 TJm
+(su) 8.85711 Tj
+1 TJm
+(pply) 17.7142 Tj
+-266 TJm
+(and) 14.3866 Tj
+-266 TJm
+(remo) 20.474 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-265 TJm
+(data) 16.5984 Tj
+-266 TJm
+(one) 14.3866 Tj
+-266 TJm
+(byte) 17.1563 Tj
+-265 TJm
+(at) 7.19329 Tj
+-266 TJm
+(a) 4.42357 Tj
+-266 TJm
+(time,) 20.205 Tj
+-269 TJm
+(although) 34.8705 Tj
+-266 TJm
+(this) 14.3965 Tj
+-265 TJm
+(w) 7.19329 Tj
+10 TJm
+(ould) 17.7142 Tj
+-266 TJm
+(be) 9.40507 Tj
+-266 TJm
+(terribly) 29.3311 Tj
+-265 TJm
+(inef) 15.4925 Tj
+25 TJm
+(\002cient.) 27.3983 Tj
+-714 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-266 TJm
+(should) 26.5713 Tj
+72 84.118 Td
+(al) 7.19329 Tj
+10 TJm
+(w) 7.19329 Tj
+10 TJm
+(ays) 13.2807 Tj
+-250 TJm
+(ensure) 26.0034 Tj
+-250 TJm
+(that) 14.9445 Tj
+-250 TJm
+(at) 7.19329 Tj
+-250 TJm
+(least) 18.2622 Tj
+-249 TJm
+(one) 14.3866 Tj
+-250 TJm
+(byte) 17.1563 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(output) 25.4654 Tj
+-250 TJm
+(space) 22.1278 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+25 TJm
+(ailable) 26.5614 Tj
+-250 TJm
+(at) 7.19329 Tj
+-250 TJm
+(each) 18.2522 Tj
+-250 TJm
+(call.) 16.8773 Tj
+[1 0 0 1 72 81.962] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 0 -21.148] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(13) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 17 17
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -540 -741.554] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(A) 7.19329 Tj
+-250 TJm
+(second) 27.6673 Tj
+-250 TJm
+(purpose) 31.5429 Tj
+-250 TJm
+(of) 8.29918 Tj
+[1 0 0 1 156.662 710.037] cm
+0 g
+0 G
+[1 0 0 1 -156.662 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+156.662 710.037 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 240.348 710.037] cm
+0 g
+0 G
+[1 0 0 1 -240.348 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+242.839 710.037 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(request) 28.7731 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(change) 28.2152 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(mod) 17.7142 Tj
+1 TJm
+(e) 4.42357 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-250 TJm
+(stream.) 29.0521 Tj
+[1 0 0 1 72 707.881] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -697.918] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 688.12 Td
+/F128_0 9.963 Tf
+(Conceptually) 53.1327 Tj
+65 TJm
+(,) 2.49075 Tj
+-217 TJm
+(a) 4.42357 Tj
+-209 TJm
+(compressed) 47.0353 Tj
+-209 TJm
+(stream) 26.5614 Tj
+-210 TJm
+(can) 13.8286 Tj
+-209 TJm
+(be) 9.40507 Tj
+-209 TJm
+(in) 7.75121 Tj
+-209 TJm
+(one) 14.3866 Tj
+-209 TJm
+(of) 8.29918 Tj
+-210 TJm
+(four) 16.5984 Tj
+-209 TJm
+(states:) 24.9075 Tj
+-289 TJm
+(IDLE,) 25.1765 Tj
+-209 TJm
+(R) 6.64532 Tj
+40 TJm
+(UNNING,) 41.7749 Tj
+-209 TJm
+(FLUSHING) 49.2571 Tj
+-209 TJm
+(and) 14.3866 Tj
+-210 TJm
+(FINISHING) 49.805 Tj
+1 TJm
+(.) 2.49075 Tj
+-419 TJm
+(Be-) 14.3866 Tj
+72 676.164 Td
+(fore) 16.0404 Tj
+-264 TJm
+(initialis) 29.899 Tj
+1 TJm
+(ation) 19.926 Tj
+-264 TJm
+(\() 3.31768 Tj
+[1 0 0 1 146.434 676.164] cm
+0 g
+0 G
+[1 0 0 1 -146.434 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+146.434 676.164 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 254.031 676.164] cm
+0 g
+0 G
+[1 0 0 1 -254.031 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+254.031 676.164 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-264 TJm
+(and) 14.3866 Tj
+-263 TJm
+(after) 18.2522 Tj
+-264 TJm
+(termination) 45.9394 Tj
+-264 TJm
+(\() 3.31768 Tj
+[1 0 0 1 349.75 676.164] cm
+0 g
+0 G
+[1 0 0 1 -349.75 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+349.75 676.164 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressEnd) 101.623 Tj
+[1 0 0 1 451.369 676.164] cm
+0 g
+0 G
+[1 0 0 1 -451.369 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+451.369 676.164 Td
+/F128_0 9.963 Tf
+(\),) 5.80843 Tj
+-267 TJm
+(a) 4.42357 Tj
+-264 TJm
+(stream) 26.5614 Tj
+-263 TJm
+(is) 6.64532 Tj
+-264 TJm
+(re) 7.74125 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(arded) 22.1278 Tj
+72 664.209 Td
+(as) 8.29918 Tj
+-250 TJm
+(IDLE.) 25.1765 Tj
+[1 0 0 1 72 664.11] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -654.147] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 642.291 Td
+/F128_0 9.963 Tf
+(Upon) 22.1378 Tj
+-389 TJm
+(initialisation) 49.825 Tj
+-389 TJm
+(\() 3.31768 Tj
+[1 0 0 1 155.036 642.291] cm
+0 g
+0 G
+[1 0 0 1 -155.036 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+155.036 642.291 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 262.632 642.291] cm
+0 g
+0 G
+[1 0 0 1 -262.632 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+262.632 642.291 Td
+/F128_0 9.963 Tf
+(\),) 5.80843 Tj
+-424 TJm
+(the) 12.1748 Tj
+-390 TJm
+(stream) 26.5614 Tj
+-389 TJm
+(is) 6.64532 Tj
+-389 TJm
+(placed) 26.0034 Tj
+-390 TJm
+(in) 7.75121 Tj
+-389 TJm
+(the) 12.1748 Tj
+-389 TJm
+(R) 6.64532 Tj
+40 TJm
+(UNNING) 39.2841 Tj
+-389 TJm
+(state.) 20.7529 Tj
+-1457 TJm
+(Subsequent) 45.9394 Tj
+-389 TJm
+(calls) 18.2622 Tj
+72 630.336 Td
+(to) 7.75121 Tj
+[1 0 0 1 83.818 630.336] cm
+0 g
+0 G
+[1 0 0 1 -83.818 -630.336] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+83.818 630.336 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 167.504 630.336] cm
+0 g
+0 G
+[1 0 0 1 -167.504 -630.336] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+171.571 630.336 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-408 TJm
+(pass) 17.1563 Tj
+[1 0 0 1 223.431 630.336] cm
+0 g
+0 G
+[1 0 0 1 -223.431 -630.336] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+223.431 630.336 Td
+/F130_0 9.963 Tf
+(BZ_RUN) 35.8668 Tj
+[1 0 0 1 259.297 630.336] cm
+0 g
+0 G
+[1 0 0 1 -259.297 -630.336] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+263.362 630.336 Td
+/F128_0 9.963 Tf
+(as) 8.29918 Tj
+-408 TJm
+(the) 12.1748 Tj
+-408 TJm
+(requested) 38.1782 Tj
+-408 TJm
+(action;) 27.1193 Tj
+-488 TJm
+(other) 20.474 Tj
+-408 TJm
+(actions) 28.2252 Tj
+-408 TJm
+(are) 12.1648 Tj
+-408 TJm
+(ille) 12.7327 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(al) 7.19329 Tj
+-408 TJm
+(and) 14.3866 Tj
+-408 TJm
+(will) 15.5024 Tj
+-409 TJm
+(re) 7.74125 Tj
+1 TJm
+(sult) 14.3965 Tj
+-409 TJm
+(in) 7.75121 Tj
+[1 0 0 1 72 618.381] cm
+0 g
+0 G
+[1 0 0 1 -72 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 618.381 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+[1 0 0 1 173.619 618.381] cm
+0 g
+0 G
+[1 0 0 1 -173.619 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+173.619 618.381 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 616.961] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -606.999] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 596.463 Td
+/F128_0 9.963 Tf
+(At) 9.963 Tj
+-279 TJm
+(some) 21.0319 Tj
+-279 TJm
+(point,) 22.9747 Tj
+-286 TJm
+(the) 12.1748 Tj
+-279 TJm
+(call) 14.3866 Tj
+1 TJm
+(ing) 12.7327 Tj
+-279 TJm
+(program) 33.7546 Tj
+-279 TJm
+(will) 15.5024 Tj
+-279 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-279 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vided) 22.1378 Tj
+-279 TJm
+(all) 9.963 Tj
+-278 TJm
+(the) 12.1748 Tj
+-279 TJm
+(input) 20.4839 Tj
+-279 TJm
+(data) 16.5984 Tj
+-279 TJm
+(it) 5.53943 Tj
+-279 TJm
+(w) 7.19329 Tj
+10 TJm
+(ants) 16.0504 Tj
+-279 TJm
+(to.) 10.242 Tj
+-793 TJm
+(It) 6.08739 Tj
+-279 TJm
+(will) 15.5024 Tj
+-279 TJm
+(then) 17.1563 Tj
+-279 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-278 TJm
+(to) 7.75121 Tj
+-279 TJm
+(\002nish) 22.1477 Tj
+-279 TJm
+(up) 9.963 Tj
+-279 TJm
+(--) 6.63536 Tj
+72 584.508 Td
+(in) 7.75121 Tj
+-287 TJm
+(ef) 7.74125 Tj
+25 TJm
+(fect,) 17.4253 Tj
+-297 TJm
+(asking) 26.0134 Tj
+-287 TJm
+(the) 12.1748 Tj
+-288 TJm
+(library) 26.5614 Tj
+-287 TJm
+(to) 7.75121 Tj
+-287 TJm
+(process) 29.879 Tj
+-288 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-287 TJm
+(data) 16.5984 Tj
+-287 TJm
+(it) 5.53943 Tj
+-288 TJm
+(might) 23.2536 Tj
+-287 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-287 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fered) 20.464 Tj
+-288 TJm
+(inte) 14.9445 Tj
+1 TJm
+(rnally) 23.2437 Tj
+65 TJm
+(.) 2.49075 Tj
+-845 TJm
+(In) 8.29918 Tj
+-287 TJm
+(this) 14.3965 Tj
+-288 TJm
+(sta) 11.0689 Tj
+1 TJm
+(te,) 9.68404 Tj
+[1 0 0 1 456.314 584.508] cm
+0 g
+0 G
+[1 0 0 1 -456.314 -584.508] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+456.314 584.508 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 540 584.508] cm
+0 g
+0 G
+[1 0 0 1 -540 -584.508] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 572.553 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-258 TJm
+(no) 9.963 Tj
+-257 TJm
+(longer) 25.4555 Tj
+-258 TJm
+(attempt) 29.889 Tj
+-257 TJm
+(to) 7.75121 Tj
+-258 TJm
+(read) 17.1463 Tj
+-258 TJm
+(data) 16.5984 Tj
+-257 TJm
+(from) 19.3681 Tj
+[1 0 0 1 234.207 572.553] cm
+0 g
+0 G
+[1 0 0 1 -234.207 -572.553] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+234.207 572.553 Td
+/F130_0 9.963 Tf
+(next_in) 41.8446 Tj
+[1 0 0 1 276.051 572.553] cm
+0 g
+0 G
+[1 0 0 1 -276.051 -572.553] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+276.051 572.553 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-260 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-257 TJm
+(it) 5.53943 Tj
+-258 TJm
+(will) 15.5024 Tj
+-258 TJm
+(w) 7.19329 Tj
+10 TJm
+(an) 9.40507 Tj
+1 TJm
+(t) 2.76971 Tj
+-258 TJm
+(to) 7.75121 Tj
+-258 TJm
+(write) 20.474 Tj
+-257 TJm
+(data) 16.5984 Tj
+-258 TJm
+(to) 7.75121 Tj
+[1 0 0 1 407.082 572.553] cm
+0 g
+0 G
+[1 0 0 1 -407.082 -572.553] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+407.082 572.553 Td
+/F130_0 9.963 Tf
+(next_out) 47.8224 Tj
+[1 0 0 1 454.902 572.553] cm
+0 g
+0 G
+[1 0 0 1 -454.902 -572.553] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+454.902 572.553 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-666 TJm
+(Because) 33.1967 Tj
+-258 TJm
+(the) 12.1748 Tj
+-258 TJm
+(ou) 9.963 Tj
+1 TJm
+(tput) 15.5024 Tj
+72 560.598 Td
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-228 TJm
+(supplied) 33.7646 Tj
+-228 TJm
+(by) 9.963 Tj
+-228 TJm
+(the) 12.1748 Tj
+-228 TJm
+(user) 16.5984 Tj
+-229 TJm
+(can) 13.8286 Tj
+-228 TJm
+(be) 9.40507 Tj
+-228 TJm
+(arbitrarily) 39.842 Tj
+-228 TJm
+(small,) 24.0806 Tj
+-232 TJm
+(the) 12.1748 Tj
+-228 TJm
+(\002nishing-up) 48.1611 Tj
+-228 TJm
+(operation) 37.6303 Tj
+-228 TJm
+(cannot) 26.5614 Tj
+-229 TJm
+(n) 4.9815 Tj
+1 TJm
+(ecessarily) 39.2841 Tj
+-228 TJm
+(be) 9.40507 Tj
+-229 TJm
+(done) 19.3681 Tj
+-228 TJm
+(with) 17.7142 Tj
+-228 TJm
+(a) 4.42357 Tj
+-228 TJm
+(single) 23.8016 Tj
+72 548.643 Td
+(call) 14.3866 Tj
+-250 TJm
+(of) 8.29918 Tj
+[1 0 0 1 99.666 548.643] cm
+0 g
+0 G
+[1 0 0 1 -99.666 -548.643] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+99.666 548.643 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 183.352 548.643] cm
+0 g
+0 G
+[1 0 0 1 -183.352 -548.643] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+183.352 548.643 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 547.079] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -537.116] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 526.725 Td
+/F128_0 9.963 Tf
+(Instead,) 31.2639 Tj
+-346 TJm
+(the) 12.1748 Tj
+-327 TJm
+(ca) 8.84714 Tj
+1 TJm
+(lling) 18.2721 Tj
+-327 TJm
+(program) 33.7546 Tj
+-327 TJm
+(passes) 25.4555 Tj
+[1 0 0 1 218.231 526.725] cm
+0 g
+0 G
+[1 0 0 1 -218.231 -526.725] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+218.231 526.725 Td
+/F130_0 9.963 Tf
+(BZ_FINISH) 53.8002 Tj
+[1 0 0 1 272.029 526.725] cm
+0 g
+0 G
+[1 0 0 1 -272.029 -526.725] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+275.284 526.725 Td
+/F128_0 9.963 Tf
+(as) 8.29918 Tj
+-327 TJm
+(an) 9.40507 Tj
+-326 TJm
+(action) 24.3496 Tj
+-327 TJm
+(to) 7.75121 Tj
+[1 0 0 1 338.109 526.725] cm
+0 g
+0 G
+[1 0 0 1 -338.109 -526.725] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+338.109 526.725 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 421.795 526.725] cm
+0 g
+0 G
+[1 0 0 1 -421.795 -526.725] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+421.795 526.725 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1081 TJm
+(This) 17.7142 Tj
+-326 TJm
+(changes) 32.0908 Tj
+-327 TJm
+(the) 12.1748 Tj
+-327 TJm
+(strea) 18.8101 Tj
+1 TJm
+(m') 11.0689 Tj
+55 TJm
+(s) 3.87561 Tj
+72 514.77 Td
+(state) 18.2622 Tj
+-290 TJm
+(to) 7.75121 Tj
+-291 TJm
+(FINISHING.) 52.2958 Tj
+-581 TJm
+(An) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-290 TJm
+(remaining) 40.4 Tj
+-291 TJm
+(input) 20.4839 Tj
+-290 TJm
+(\(ie,) 13.0017 Tj
+[1 0 0 1 264.452 514.77] cm
+0 g
+0 G
+[1 0 0 1 -264.452 -514.77] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+264.452 514.77 Td
+/F130_0 9.963 Tf
+(next_in[0) 53.8002 Tj
+-600 TJm
+(..) 11.9556 Tj
+-1200 TJm
+(avail_in-1]) 65.7558 Tj
+[1 0 0 1 413.892 514.77] cm
+0 g
+0 G
+[1 0 0 1 -413.892 -514.77] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+413.892 514.77 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-291 TJm
+(is) 6.64532 Tj
+-290 TJm
+(compressed) 47.0353 Tj
+-290 TJm
+(and) 14.3866 Tj
+-291 TJm
+(transferred) 43.1498 Tj
+72 502.814 Td
+(to) 7.75121 Tj
+-421 TJm
+(the) 12.1748 Tj
+-421 TJm
+(output) 25.4654 Tj
+-421 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+55 TJm
+(.) 2.49075 Tj
+-1646 TJm
+(T) 6.08739 Tj
+80 TJm
+(o) 4.9815 Tj
+-421 TJm
+(do) 9.963 Tj
+-421 TJm
+(this,) 16.8873 Tj
+[1 0 0 1 222.339 502.814] cm
+0 g
+0 G
+[1 0 0 1 -222.339 -502.814] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+222.339 502.814 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 306.025 502.814] cm
+0 g
+0 G
+[1 0 0 1 -306.025 -502.814] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+310.22 502.814 Td
+/F128_0 9.963 Tf
+(must) 19.378 Tj
+-421 TJm
+(be) 9.40507 Tj
+-421 TJm
+(called) 23.7916 Tj
+-421 TJm
+(repeatedly) 41.4959 Tj
+-421 TJm
+(until) 18.2721 Tj
+-421 TJm
+(all) 9.963 Tj
+-421 TJm
+(the) 12.1748 Tj
+-421 TJm
+(outp) 17.7142 Tj
+1 TJm
+(ut) 7.75121 Tj
+-421 TJm
+(has) 13.2807 Tj
+-421 TJm
+(been) 18.8101 Tj
+72 490.859 Td
+(consumed.) 42.8907 Tj
+-1396 TJm
+(At) 9.963 Tj
+-380 TJm
+(that) 14.9445 Tj
+-379 TJm
+(point,) 22.9747 Tj
+[1 0 0 1 188.346 490.859] cm
+0 g
+0 G
+[1 0 0 1 -188.346 -490.859] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+188.346 490.859 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 272.033 490.859] cm
+0 g
+0 G
+[1 0 0 1 -272.033 -490.859] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+275.813 490.859 Td
+/F128_0 9.963 Tf
+(returns) 27.6673 Tj
+[1 0 0 1 307.259 490.859] cm
+0 g
+0 G
+[1 0 0 1 -307.259 -490.859] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+307.259 490.859 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 384.968 490.859] cm
+0 g
+0 G
+[1 0 0 1 -384.968 -490.859] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+384.968 490.859 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-379 TJm
+(and) 14.3866 Tj
+-380 TJm
+(the) 12.1748 Tj
+-379 TJm
+(stream') 29.879 Tj
+55 TJm
+(s) 3.87561 Tj
+-379 TJm
+(state) 18.2622 Tj
+-380 TJm
+(is) 6.64532 Tj
+-379 TJm
+(set) 11.0689 Tj
+-379 TJm
+(back) 18.8101 Tj
+-380 TJm
+(to) 7.75121 Tj
+72 478.904 Td
+(IDLE.) 25.1765 Tj
+[1 0 0 1 99.666 478.904] cm
+0 g
+0 G
+[1 0 0 1 -99.666 -478.904] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+99.666 478.904 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressEnd) 101.623 Tj
+[1 0 0 1 201.285 478.904] cm
+0 g
+0 G
+[1 0 0 1 -201.285 -478.904] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+203.776 478.904 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-250 TJm
+(then) 17.1563 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(called.) 26.2824 Tj
+[1 0 0 1 72 477.34] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -467.377] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 456.986 Td
+/F128_0 9.963 Tf
+(Just) 15.5024 Tj
+-380 TJm
+(to) 7.75121 Tj
+-379 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e) 4.42357 Tj
+-380 TJm
+(sure) 16.5984 Tj
+-380 TJm
+(the) 12.1748 Tj
+-380 TJm
+(c) 4.42357 Tj
+1 TJm
+(alling) 22.6957 Tj
+-380 TJm
+(program) 33.7546 Tj
+-380 TJm
+(does) 18.2622 Tj
+-379 TJm
+(not) 12.7327 Tj
+-380 TJm
+(cheat,) 23.5127 Tj
+-412 TJm
+(the) 12.1748 Tj
+-380 TJm
+(library) 26.5614 Tj
+-380 TJm
+(mak) 17.1563 Tj
+10 TJm
+(es) 8.29918 Tj
+-379 TJm
+(a) 4.42357 Tj
+-380 TJm
+(note) 17.1563 Tj
+-380 TJm
+(of) 8.29918 Tj
+[1 0 0 1 415.708 456.986] cm
+0 g
+0 G
+[1 0 0 1 -415.708 -456.986] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+415.708 456.986 Td
+/F130_0 9.963 Tf
+(avail_in) 47.8224 Tj
+[1 0 0 1 463.528 456.986] cm
+0 g
+0 G
+[1 0 0 1 -463.528 -456.986] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+467.312 456.986 Td
+/F128_0 9.963 Tf
+(at) 7.19329 Tj
+-380 TJm
+(the) 12.1748 Tj
+-379 TJm
+(time) 17.7142 Tj
+-380 TJm
+(of) 8.29918 Tj
+-380 TJm
+(the) 12.1748 Tj
+72 445.031 Td
+(\002rst) 15.5024 Tj
+-286 TJm
+(call) 14.3866 Tj
+-285 TJm
+(to) 7.75121 Tj
+[1 0 0 1 118.179 445.031] cm
+0 g
+0 G
+[1 0 0 1 -118.179 -445.031] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+118.179 445.031 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 201.866 445.031] cm
+0 g
+0 G
+[1 0 0 1 -201.866 -445.031] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+204.713 445.031 Td
+/F128_0 9.963 Tf
+(which) 24.3496 Tj
+-286 TJm
+(has) 13.2807 Tj
+[1 0 0 1 248.035 445.031] cm
+0 g
+0 G
+[1 0 0 1 -248.035 -445.031] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+248.035 445.031 Td
+/F130_0 9.963 Tf
+(BZ_FINISH) 53.8002 Tj
+[1 0 0 1 301.834 445.031] cm
+0 g
+0 G
+[1 0 0 1 -301.834 -445.031] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+304.68 445.031 Td
+/F128_0 9.963 Tf
+(as) 8.29918 Tj
+-286 TJm
+(an) 9.40507 Tj
+-285 TJm
+(action) 24.3496 Tj
+-286 TJm
+(\(ie,) 13.0017 Tj
+-295 TJm
+(at) 7.19329 Tj
+-285 TJm
+(the) 12.1748 Tj
+-286 TJm
+(time) 17.7142 Tj
+-286 TJm
+(the) 12.1748 Tj
+-286 TJm
+(progr) 21.5799 Tj
+1 TJm
+(am) 12.1748 Tj
+-286 TJm
+(has) 13.2807 Tj
+-286 TJm
+(announced) 43.1597 Tj
+-286 TJm
+(i) 2.76971 Tj
+1 TJm
+(ts) 6.64532 Tj
+72 433.076 Td
+(intention) 35.4284 Tj
+-292 TJm
+(to) 7.75121 Tj
+-291 TJm
+(not) 12.7327 Tj
+-292 TJm
+(supply) 26.5713 Tj
+-292 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-291 TJm
+(more) 20.474 Tj
+-292 TJm
+(input\).) 26.2924 Tj
+-871 TJm
+(By) 11.6268 Tj
+-291 TJm
+(comparing) 42.6118 Tj
+-292 TJm
+(this) 14.3965 Tj
+-292 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+-291 TJm
+(with) 17.7142 Tj
+-292 TJm
+(that) 14.9445 Tj
+-292 TJm
+(of) 8.29918 Tj
+[1 0 0 1 392.861 433.076] cm
+0 g
+0 G
+[1 0 0 1 -392.861 -433.076] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+392.861 433.076 Td
+/F130_0 9.963 Tf
+(avail_in) 47.8224 Tj
+[1 0 0 1 440.682 433.076] cm
+0 g
+0 G
+[1 0 0 1 -440.682 -433.076] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+443.589 433.076 Td
+/F128_0 9.963 Tf
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-292 TJm
+(subsequent) 44.2756 Tj
+-291 TJm
+(calls) 18.2622 Tj
+-292 TJm
+(to) 7.75121 Tj
+[1 0 0 1 72 421.121] cm
+0 g
+0 G
+[1 0 0 1 -72 -421.121] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 421.121 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 155.686 421.121] cm
+0 g
+0 G
+[1 0 0 1 -155.686 -421.121] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+155.686 421.121 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-247 TJm
+(the) 12.1748 Tj
+-247 TJm
+(libra) 18.2622 Tj
+1 TJm
+(ry) 8.29918 Tj
+-247 TJm
+(can) 13.8286 Tj
+-246 TJm
+(detect) 23.7916 Tj
+-247 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-246 TJm
+(attempts) 33.7646 Tj
+-246 TJm
+(to) 7.75121 Tj
+-247 TJm
+(slip) 14.3965 Tj
+-246 TJm
+(in) 7.75121 Tj
+-247 TJm
+(more) 20.474 Tj
+-246 TJm
+(data) 16.5984 Tj
+-246 TJm
+(to) 7.75121 Tj
+-247 TJm
+(compress.) 40.121 Tj
+-617 TJm
+(An) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-247 TJm
+(calls) 18.2622 Tj
+-246 TJm
+(for) 11.6169 Tj
+-246 TJm
+(which) 24.3496 Tj
+-247 TJm
+(this) 14.3965 Tj
+-246 TJm
+(is) 6.64532 Tj
+72 409.166 Td
+(detected) 33.1967 Tj
+-250 TJm
+(will) 15.5024 Tj
+-250 TJm
+(return) 23.7916 Tj
+[1 0 0 1 151.959 409.166] cm
+0 g
+0 G
+[1 0 0 1 -151.959 -409.166] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+151.959 409.166 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+[1 0 0 1 253.578 409.166] cm
+0 g
+0 G
+[1 0 0 1 -253.578 -409.166] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+253.578 409.166 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-500 TJm
+(This) 17.7142 Tj
+-250 TJm
+(indicates) 35.4185 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(programm) 41.5059 Tj
+1 TJm
+(ing) 12.7327 Tj
+-250 TJm
+(mistak) 26.5713 Tj
+10 TJm
+(e) 4.42357 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(should) 26.5713 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(corrected.) 39.5531 Tj
+[1 0 0 1 72 407.009] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -397.046] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 387.248 Td
+/F128_0 9.963 Tf
+(Instead) 28.7731 Tj
+-223 TJm
+(of) 8.29918 Tj
+-224 TJm
+(asking) 26.0134 Tj
+-224 TJm
+(to) 7.75121 Tj
+-223 TJm
+(\002nish,) 24.6385 Tj
+-229 TJm
+(the) 12.1748 Tj
+-223 TJm
+(calling) 27.1193 Tj
+-224 TJm
+(program) 33.7546 Tj
+-223 TJm
+(may) 17.1563 Tj
+-224 TJm
+(ask) 13.2807 Tj
+[1 0 0 1 293.282 387.248] cm
+0 g
+0 G
+[1 0 0 1 -293.282 -387.248] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+293.282 387.248 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 376.968 387.248] cm
+0 g
+0 G
+[1 0 0 1 -376.968 -387.248] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+379.196 387.248 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-224 TJm
+(ta) 7.19329 Tj
+1 TJm
+(k) 4.9815 Tj
+10 TJm
+(e) 4.42357 Tj
+-224 TJm
+(all) 9.963 Tj
+-224 TJm
+(the) 12.1748 Tj
+-223 TJm
+(remaining) 40.4 Tj
+-224 TJm
+(inp) 12.7327 Tj
+1 TJm
+(ut,) 10.242 Tj
+-229 TJm
+(compress) 37.6303 Tj
+72 375.293 Td
+(it) 5.53943 Tj
+-278 TJm
+(and) 14.3866 Tj
+-278 TJm
+(terminate) 37.6303 Tj
+-277 TJm
+(the) 12.1748 Tj
+-278 TJm
+(current) 28.2152 Tj
+-278 TJm
+(\(Burro) 26.5614 Tj
+25 TJm
+(ws-Wheeler\)) 51.4489 Tj
+-278 TJm
+(co) 9.40507 Tj
+1 TJm
+(mpression) 40.9579 Tj
+-278 TJm
+(block.) 24.6285 Tj
+-787 TJm
+(This) 17.7142 Tj
+-278 TJm
+(could) 22.1378 Tj
+-278 TJm
+(be) 9.40507 Tj
+-278 TJm
+(useful) 24.3496 Tj
+-278 TJm
+(for) 11.6169 Tj
+-278 TJm
+(e) 4.42357 Tj
+1 TJm
+(rror) 14.9345 Tj
+-278 TJm
+(control) 28.2252 Tj
+-278 TJm
+(purposes.) 37.9092 Tj
+72 363.337 Td
+(The) 15.4925 Tj
+-328 TJm
+(mechanism) 45.3815 Tj
+-328 TJm
+(is) 6.64532 Tj
+-328 TJm
+(analogous) 40.4 Tj
+-328 TJm
+(to) 7.75121 Tj
+-328 TJm
+(that) 14.9445 Tj
+-328 TJm
+(for) 11.6169 Tj
+-328 TJm
+(\002nishing) 34.8805 Tj
+1 TJm
+(:) 2.76971 Tj
+-467 TJm
+(cal) 11.6169 Tj
+1 TJm
+(l) 2.76971 Tj
+[1 0 0 1 297.049 363.337] cm
+0 g
+0 G
+[1 0 0 1 -297.049 -363.337] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+297.049 363.337 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 380.735 363.337] cm
+0 g
+0 G
+[1 0 0 1 -380.735 -363.337] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+384.003 363.337 Td
+/F128_0 9.963 Tf
+(with) 17.7142 Tj
+-328 TJm
+(an) 9.40507 Tj
+-328 TJm
+(action) 24.3496 Tj
+-328 TJm
+(of) 8.29918 Tj
+[1 0 0 1 456.841 363.337] cm
+0 g
+0 G
+[1 0 0 1 -456.841 -363.337] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+456.841 363.337 Td
+/F130_0 9.963 Tf
+(BZ_FLUSH) 47.8224 Tj
+[1 0 0 1 504.662 363.337] cm
+0 g
+0 G
+[1 0 0 1 -504.662 -363.337] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+504.662 363.337 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-328 TJm
+(remo) 20.474 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+72 351.382 Td
+(output) 25.4654 Tj
+-445 TJm
+(data,) 19.0891 Tj
+-494 TJm
+(and) 14.3866 Tj
+-445 TJm
+(persist) 26.0134 Tj
+-445 TJm
+(with) 17.7142 Tj
+-446 TJm
+(the) 12.1748 Tj
+[1 0 0 1 213.94 351.382] cm
+0 g
+0 G
+[1 0 0 1 -213.94 -351.382] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+213.94 351.382 Td
+/F130_0 9.963 Tf
+(BZ_FLUSH) 47.8224 Tj
+[1 0 0 1 261.761 351.382] cm
+0 g
+0 G
+[1 0 0 1 -261.761 -351.382] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+266.195 351.382 Td
+/F128_0 9.963 Tf
+(action) 24.3496 Tj
+-445 TJm
+(until) 18.2721 Tj
+-445 TJm
+(the) 12.1748 Tj
+-445 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+[1 0 0 1 360.062 351.382] cm
+0 g
+0 G
+[1 0 0 1 -360.062 -351.382] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+360.062 351.382 Td
+/F130_0 9.963 Tf
+(BZ_RUN) 35.8668 Tj
+[1 0 0 1 395.928 351.382] cm
+0 g
+0 G
+[1 0 0 1 -395.928 -351.382] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+400.362 351.382 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-445 TJm
+(returned.) 35.6875 Tj
+-1792 TJm
+(A) 7.19329 Tj
+1 TJm
+(s) 3.87561 Tj
+-446 TJm
+(with) 17.7142 Tj
+-445 TJm
+(\002nishing,) 37.3712 Tj
+[1 0 0 1 72 339.427] cm
+0 g
+0 G
+[1 0 0 1 -72 -339.427] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 339.427 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 155.686 339.427] cm
+0 g
+0 G
+[1 0 0 1 -155.686 -339.427] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+158.177 339.427 Td
+/F128_0 9.963 Tf
+(detects) 27.6673 Tj
+-250 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-250 TJm
+(attempt) 29.889 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vi) 7.75121 Tj
+1 TJm
+(de) 9.40507 Tj
+-250 TJm
+(more) 20.474 Tj
+-250 TJm
+(input) 20.4839 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(once) 18.8101 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(\003ush) 19.378 Tj
+-250 TJm
+(has) 13.2807 Tj
+-250 TJm
+(be) 9.40507 Tj
+15 TJm
+(gun.) 17.4353 Tj
+[1 0 0 1 72 337.27] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -327.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 317.509 Td
+/F128_0 9.963 Tf
+(Once) 21.0219 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(\003ush) 19.378 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(complete,) 39.0151 Tj
+-250 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-250 TJm
+(stream) 26.5614 Tj
+-250 TJm
+(returns) 27.6673 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(normal) 28.2252 Tj
+-250 TJm
+(R) 6.64532 Tj
+40 TJm
+(UNNING) 39.2841 Tj
+-250 TJm
+(state.) 20.7529 Tj
+[1 0 0 1 72 315.353] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -305.39] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 295.592 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-344 TJm
+(all) 9.963 Tj
+-343 TJm
+(sounds) 27.6772 Tj
+-344 TJm
+(pretty) 23.2437 Tj
+-344 TJm
+(comple) 29.3311 Tj
+15 TJm
+(x) 4.9815 Tj
+1 TJm
+(,) 2.49075 Tj
+-368 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-343 TJm
+(isn') 14.9445 Tj
+18 TJm
+(t) 2.76971 Tj
+-344 TJm
+(really) 22.6858 Tj
+65 TJm
+(.) 2.49075 Tj
+-1182 TJm
+(Here') 22.6758 Tj
+55 TJm
+(s) 3.87561 Tj
+-344 TJm
+(a) 4.42357 Tj
+-344 TJm
+(table) 19.3681 Tj
+-343 TJm
+(which) 24.3496 Tj
+-344 TJm
+(sho) 13.8386 Tj
+25 TJm
+(ws) 11.0689 Tj
+-344 TJm
+(which) 24.3496 Tj
+-343 TJm
+(actions) 28.2252 Tj
+-344 TJm
+(are) 12.1648 Tj
+-344 TJm
+(allo) 14.9445 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-343 TJm
+(in) 7.75121 Tj
+-344 TJm
+(each) 18.2522 Tj
+72 283.636 Td
+(state,) 20.7529 Tj
+-281 TJm
+(wh) 12.1748 Tj
+1 TJm
+(at) 7.19329 Tj
+-275 TJm
+(action) 24.3496 Tj
+-274 TJm
+(will) 15.5024 Tj
+-275 TJm
+(be) 9.40507 Tj
+-274 TJm
+(tak) 12.1748 Tj
+10 TJm
+(en,) 11.8958 Tj
+-281 TJm
+(what) 19.3681 Tj
+-274 TJm
+(the) 12.1748 Tj
+-275 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-274 TJm
+(state) 18.2622 Tj
+-275 TJm
+(is) 6.64532 Tj
+1 TJm
+(,) 2.49075 Tj
+-281 TJm
+(and) 14.3866 Tj
+-275 TJm
+(what) 19.3681 Tj
+-274 TJm
+(the) 12.1748 Tj
+-274 TJm
+(non-error) 37.6203 Tj
+-275 TJm
+(return) 23.7916 Tj
+-274 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues) 20.474 Tj
+-275 TJm
+(are.) 14.6556 Tj
+-767 TJm
+(Note) 19.3681 Tj
+-274 TJm
+(that) 14.9445 Tj
+-275 TJm
+(you) 14.9445 Tj
+-274 TJm
+(can') 17.1463 Tj
+18 TJm
+(t) 2.76971 Tj
+72 271.681 Td
+(e) 4.42357 Tj
+15 TJm
+(xplicitly) 33.2166 Tj
+-347 TJm
+(ask) 13.2807 Tj
+-348 TJm
+(what) 19.3681 Tj
+-347 TJm
+(state) 18.2622 Tj
+-347 TJm
+(the) 12.1748 Tj
+-348 TJm
+(stream) 26.5614 Tj
+-347 TJm
+(is) 6.64532 Tj
+-347 TJm
+(in,) 10.242 Tj
+-372 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-348 TJm
+(nor) 13.2807 Tj
+-347 TJm
+(do) 9.963 Tj
+-347 TJm
+(you) 14.9445 Tj
+-348 TJm
+(need) 18.8101 Tj
+-347 TJm
+(to) 7.75121 Tj
+-348 TJm
+(--) 6.63536 Tj
+-347 TJm
+(it) 5.53943 Tj
+-347 TJm
+(can) 13.8286 Tj
+-348 TJm
+(be) 9.40507 Tj
+-347 TJm
+(inferred) 31.5329 Tj
+-348 TJm
+(from) 19.3681 Tj
+-347 TJm
+(the) 12.1748 Tj
+-347 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues) 20.474 Tj
+-348 TJm
+(returned) 33.1967 Tj
+-347 TJm
+(by) 9.963 Tj
+[1 0 0 1 72 259.726] cm
+0 g
+0 G
+[1 0 0 1 -72 -259.726] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 259.726 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 155.686 259.726] cm
+0 g
+0 G
+[1 0 0 1 -155.686 -259.726] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+155.686 259.726 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 258.162] cm
+0 g
+0 G
+[1 0 0 1 0 -207.31] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.754] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.754] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.852 Td
+/F128_0 9.963 Tf
+(14) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 18 18
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -595.402] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 573.848 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 570.261] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(IDLE/any) 47.8224 Tj
+98.488 699.676 Td
+(Illegal.) 47.8224 Tj
+-852 TJm
+(IDLE) 23.9112 Tj
+-426 TJm
+(state) 29.889 Tj
+-426 TJm
+(onl) 17.9334 Tj
+1 TJm
+(y) 5.9778 Tj
+-426 TJm
+(exists) 35.8668 Tj
+-426 TJm
+(after) 29.889 Tj
+-426 TJm
+(BZ2_bzCompressEnd) 101.623 Tj
+-426 TJm
+(or) 11.9556 Tj
+98.488 687.721 Td
+(before) 35.8668 Tj
+-426 TJm
+(BZ2_bzCompressInit) 107.6 Tj
+1 TJm
+(.) 5.9778 Tj
+98.488 675.766 Td
+(Return) 35.8668 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_SEQUENC) 59.778 Tj
+1 TJm
+(E_ERROR) 41.8446 Tj
+90 651.856 Td
+(RUNNING/BZ_RUN) 83.6892 Tj
+98.488 639.9 Td
+(Compress) 47.8224 Tj
+-426 TJm
+(from) 23.9112 Tj
+-426 TJm
+(next_in) 41.8446 Tj
+-426 TJm
+(to) 11.9556 Tj
+-425 TJm
+(next_out) 47.8224 Tj
+-426 TJm
+(as) 11.9556 Tj
+-426 TJm
+(much) 23.9112 Tj
+-426 TJm
+(as) 11.9556 Tj
+-426 TJm
+(possible.) 53.8002 Tj
+98.488 627.945 Td
+(Next) 23.9112 Tj
+-426 TJm
+(state) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(RUNNING) 41.8446 Tj
+98.488 615.99 Td
+(Return) 35.8668 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_RUN_OK) 53.8002 Tj
+90 592.08 Td
+(RUNNING/BZ_FLUSH) 95.6448 Tj
+98.488 580.124 Td
+(Remember) 47.8224 Tj
+-426 TJm
+(current) 41.8446 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(of) 11.9556 Tj
+-425 TJm
+(next_in.) 47.8224 Tj
+-426 TJm
+(Compress) 47.8224 Tj
+-426 TJm
+(from) 23.9112 Tj
+-426 TJm
+(next_in) 41.8446 Tj
+98.488 568.169 Td
+(to) 11.9556 Tj
+-426 TJm
+(next_out) 47.8224 Tj
+-426 TJm
+(as) 11.9556 Tj
+-426 TJm
+(much) 23.9112 Tj
+-426 TJm
+(as) 11.9556 Tj
+-426 TJm
+(p) 5.9778 Tj
+1 TJm
+(ossible,) 47.8224 Tj
+-426 TJm
+(but) 17.9334 Tj
+-426 TJm
+(do) 11.9556 Tj
+-426 TJm
+(not) 17.9334 Tj
+-426 TJm
+(accept) 35.8668 Tj
+-426 TJm
+(any) 17.9334 Tj
+-426 TJm
+(more) 23.9112 Tj
+-426 TJm
+(input.) 35.8668 Tj
+98.488 556.214 Td
+(Next) 23.9112 Tj
+-426 TJm
+(state) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(FLUSHING) 47.8224 Tj
+98.488 544.259 Td
+(Return) 35.8668 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_FLUSH_O) 59.778 Tj
+1 TJm
+(K) 5.9778 Tj
+90 520.349 Td
+(RUNNING/BZ_FINISH) 101.623 Tj
+98.488 508.393 Td
+(Remember) 47.8224 Tj
+-426 TJm
+(current) 41.8446 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(of) 11.9556 Tj
+-425 TJm
+(next_in.) 47.8224 Tj
+-426 TJm
+(Compress) 47.8224 Tj
+-426 TJm
+(from) 23.9112 Tj
+-426 TJm
+(next_in) 41.8446 Tj
+98.488 496.438 Td
+(to) 11.9556 Tj
+-426 TJm
+(next_out) 47.8224 Tj
+-426 TJm
+(as) 11.9556 Tj
+-426 TJm
+(much) 23.9112 Tj
+-426 TJm
+(as) 11.9556 Tj
+-426 TJm
+(p) 5.9778 Tj
+1 TJm
+(ossible,) 47.8224 Tj
+-426 TJm
+(but) 17.9334 Tj
+-426 TJm
+(do) 11.9556 Tj
+-426 TJm
+(not) 17.9334 Tj
+-426 TJm
+(accept) 35.8668 Tj
+-426 TJm
+(any) 17.9334 Tj
+-426 TJm
+(more) 23.9112 Tj
+-426 TJm
+(input.) 35.8668 Tj
+98.488 484.483 Td
+(Next) 23.9112 Tj
+-426 TJm
+(state) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(FINISHING) 53.8002 Tj
+98.488 472.528 Td
+(Return) 35.8668 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_FINISH_) 59.778 Tj
+1 TJm
+(OK) 11.9556 Tj
+90 448.618 Td
+(FLUSHING/BZ_FLUSH) 101.623 Tj
+98.488 436.662 Td
+(Compress) 47.8224 Tj
+-426 TJm
+(from) 23.9112 Tj
+-426 TJm
+(next_in) 41.8446 Tj
+-426 TJm
+(to) 11.9556 Tj
+-425 TJm
+(next_out) 47.8224 Tj
+-426 TJm
+(as) 11.9556 Tj
+-426 TJm
+(much) 23.9112 Tj
+-426 TJm
+(as) 11.9556 Tj
+-426 TJm
+(possible,) 53.8002 Tj
+98.488 424.707 Td
+(but) 17.9334 Tj
+-426 TJm
+(do) 11.9556 Tj
+-426 TJm
+(not) 17.9334 Tj
+-426 TJm
+(accept) 35.8668 Tj
+-426 TJm
+(any) 17.9334 Tj
+-426 TJm
+(mo) 11.9556 Tj
+1 TJm
+(re) 11.9556 Tj
+-426 TJm
+(input.) 35.8668 Tj
+98.488 412.752 Td
+(If) 11.9556 Tj
+-426 TJm
+(all) 17.9334 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(existing) 47.8224 Tj
+-426 TJm
+(inpu) 23.9112 Tj
+1 TJm
+(t) 5.9778 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-426 TJm
+(used) 23.9112 Tj
+-426 TJm
+(up) 11.9556 Tj
+-426 TJm
+(and) 17.9334 Tj
+-426 TJm
+(all) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+98.488 400.797 Td
+(output) 35.8668 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-426 TJm
+(removed) 41.8446 Tj
+106.976 388.842 Td
+(Next) 23.9112 Tj
+-426 TJm
+(state) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(RUNNING;) 47.8224 Tj
+-426 TJm
+(Re) 11.9556 Tj
+1 TJm
+(turn) 23.9112 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_RUN_OK) 53.8002 Tj
+98.488 376.887 Td
+(else) 23.9112 Tj
+106.976 364.931 Td
+(Next) 23.9112 Tj
+-426 TJm
+(state) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(FLUSHING;) 53.8002 Tj
+-426 TJm
+(R) 5.9778 Tj
+1 TJm
+(eturn) 29.889 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_FLUSH_OK) 65.7558 Tj
+90 341.021 Td
+(FLUSHING/other) 83.6892 Tj
+98.488 329.066 Td
+(Illegal.) 47.8224 Tj
+98.488 317.111 Td
+(Return) 35.8668 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_SEQUENC) 59.778 Tj
+1 TJm
+(E_ERROR) 41.8446 Tj
+90 293.2 Td
+(FINISHING/BZ_FINISH) 113.578 Tj
+98.488 281.245 Td
+(Compress) 47.8224 Tj
+-426 TJm
+(from) 23.9112 Tj
+-426 TJm
+(next_in) 41.8446 Tj
+-426 TJm
+(to) 11.9556 Tj
+-425 TJm
+(next_out) 47.8224 Tj
+-426 TJm
+(as) 11.9556 Tj
+-426 TJm
+(much) 23.9112 Tj
+-426 TJm
+(as) 11.9556 Tj
+-426 TJm
+(possible,) 53.8002 Tj
+98.488 269.29 Td
+(but) 17.9334 Tj
+-426 TJm
+(to) 11.9556 Tj
+-426 TJm
+(not) 17.9334 Tj
+-426 TJm
+(accept) 35.8668 Tj
+-426 TJm
+(any) 17.9334 Tj
+-426 TJm
+(mo) 11.9556 Tj
+1 TJm
+(re) 11.9556 Tj
+-426 TJm
+(input.) 35.8668 Tj
+98.488 257.335 Td
+(If) 11.9556 Tj
+-426 TJm
+(all) 17.9334 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(existing) 47.8224 Tj
+-426 TJm
+(inpu) 23.9112 Tj
+1 TJm
+(t) 5.9778 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-426 TJm
+(used) 23.9112 Tj
+-426 TJm
+(up) 11.9556 Tj
+-426 TJm
+(and) 17.9334 Tj
+-426 TJm
+(all) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+98.488 245.38 Td
+(output) 35.8668 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-426 TJm
+(removed) 41.8446 Tj
+106.976 233.424 Td
+(Next) 23.9112 Tj
+-426 TJm
+(state) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(IDLE;) 29.889 Tj
+-426 TJm
+(Retur) 29.889 Tj
+1 TJm
+(n) 5.9778 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_STREAM_END) 77.7114 Tj
+98.488 221.469 Td
+(else) 23.9112 Tj
+106.976 209.514 Td
+(Next) 23.9112 Tj
+-426 TJm
+(state) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(FINISHING;) 59.778 Tj
+-425 TJm
+(Return) 35.8668 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_FINISHING) 71.7336 Tj
+90 185.604 Td
+(FINISHING/other) 89.667 Tj
+98.488 173.649 Td
+(Illegal.) 47.8224 Tj
+98.488 161.693 Td
+(Return) 35.8668 Tj
+-426 TJm
+(value) 29.889 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_SEQUENC) 59.778 Tj
+1 TJm
+(E_ERROR) 41.8446 Tj
+[1 0 0 1 72 146.152] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -136.189] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 124.234 Td
+/F128_0 9.963 Tf
+(That) 18.2622 Tj
+-250 TJm
+(still) 14.9545 Tj
+-250 TJm
+(looks) 21.5898 Tj
+-250 TJm
+(complicate) 43.7176 Tj
+1 TJm
+(d?) 9.40507 Tj
+-620 TJm
+(W) 9.40507 Tj
+80 TJm
+(ell,) 12.4538 Tj
+-250 TJm
+(f) 3.31768 Tj
+10 TJm
+(air) 10.511 Tj
+-250 TJm
+(enough.) 31.8218 Tj
+-620 TJm
+(The) 15.4925 Tj
+-250 TJm
+(usual) 21.0319 Tj
+-250 TJm
+(sequence) 36.5144 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(calls) 18.2622 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(com) 17.1563 Tj
+1 TJm
+(pressing) 33.2067 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(load) 17.1563 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(is:) 9.41504 Tj
+[1 0 0 1 72 122.077] cm
+0 g
+0 G
+[1 0 0 1 0 -29.723] cm
+0 g
+0 G
+[1 0 0 1 7.372 0] cm
+0 g
+0 G
+[1 0 0 1 -79.372 -92.354] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+79.372 92.354 Td
+/F128_0 9.963 Tf
+(1.) 7.47225 Tj
+[1 0 0 1 86.844 92.354] cm
+0 g
+0 G
+[1 0 0 1 3.089 0] cm
+0 g
+0 G
+[1 0 0 1 1.992 0] cm
+0 g
+0 G
+[1 0 0 1 -91.925 -92.354] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+91.925 92.354 Td
+/F128_0 9.963 Tf
+(Get) 14.3866 Tj
+-250 TJm
+(started) 26.5614 Tj
+-250 TJm
+(with) 17.7142 Tj
+[1 0 0 1 158.056 92.354] cm
+0 g
+0 G
+[1 0 0 1 -158.056 -92.354] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+158.056 92.354 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 265.653 92.354] cm
+0 g
+0 G
+[1 0 0 1 -265.653 -92.354] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+265.653 92.354 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 268.144 92.354] cm
+0 g
+0 G
+[1 0 0 1 -196.144 -41.502] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(15) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 19 19
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -31.517] cm
+0 g
+0 G
+[1 0 0 1 7.372 0] cm
+0 g
+0 G
+[1 0 0 1 -79.372 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+79.372 710.037 Td
+/F128_0 9.963 Tf
+(2.) 7.47225 Tj
+[1 0 0 1 86.844 710.037] cm
+0 g
+0 G
+[1 0 0 1 3.089 0] cm
+0 g
+0 G
+[1 0 0 1 1.992 0] cm
+0 g
+0 G
+[1 0 0 1 -91.925 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+91.925 710.037 Td
+/F128_0 9.963 Tf
+(Sho) 15.5024 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-240 TJm
+(data) 16.5984 Tj
+-240 TJm
+(in) 7.75121 Tj
+-240 TJm
+(and) 14.3866 Tj
+-241 TJm
+(shlur) 19.926 Tj
+1 TJm
+(p) 4.9815 Tj
+-241 TJm
+(out) 12.7327 Tj
+-240 TJm
+(its) 9.41504 Tj
+-240 TJm
+(compressed) 47.0353 Tj
+-240 TJm
+(form) 19.3681 Tj
+-240 TJm
+(using) 21.5898 Tj
+-240 TJm
+(zero) 17.1463 Tj
+-240 TJm
+(or) 8.29918 Tj
+-241 TJm
+(m) 7.75121 Tj
+1 TJm
+(ore) 12.7228 Tj
+-241 TJm
+(calls) 18.2622 Tj
+-240 TJm
+(of) 8.29918 Tj
+[1 0 0 1 401.454 710.037] cm
+0 g
+0 G
+[1 0 0 1 -401.454 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+401.454 710.037 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 485.14 710.037] cm
+0 g
+0 G
+[1 0 0 1 -485.14 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+487.533 710.037 Td
+/F128_0 9.963 Tf
+(with) 17.7142 Tj
+-240 TJm
+(action) 24.3496 Tj
+-240 TJm
+(=) 5.61913 Tj
+[1 0 0 1 91.925 698.082] cm
+0 g
+0 G
+[1 0 0 1 -91.925 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+91.925 698.082 Td
+/F130_0 9.963 Tf
+(BZ_RUN) 35.8668 Tj
+[1 0 0 1 127.791 698.082] cm
+0 g
+0 G
+[1 0 0 1 -127.791 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+127.791 698.082 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 130.281 698.082] cm
+0 g
+0 G
+[1 0 0 1 -58.281 -21.918] cm
+0 g
+0 G
+[1 0 0 1 7.372 0] cm
+0 g
+0 G
+[1 0 0 1 -79.372 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+79.372 676.164 Td
+/F128_0 9.963 Tf
+(3.) 7.47225 Tj
+[1 0 0 1 86.844 676.164] cm
+0 g
+0 G
+[1 0 0 1 3.089 0] cm
+0 g
+0 G
+[1 0 0 1 1.992 0] cm
+0 g
+0 G
+[1 0 0 1 -91.925 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+91.925 676.164 Td
+/F128_0 9.963 Tf
+(Finish) 24.9175 Tj
+-242 TJm
+(up) 9.963 Tj
+1 TJm
+(.) 2.49075 Tj
+-308 TJm
+(Repeatedl) 39.842 Tj
+1 TJm
+(y) 4.9815 Tj
+-242 TJm
+(call) 14.3866 Tj
+[1 0 0 1 198.784 676.164] cm
+0 g
+0 G
+[1 0 0 1 -198.784 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+198.784 676.164 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 282.471 676.164] cm
+0 g
+0 G
+[1 0 0 1 -282.471 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+284.878 676.164 Td
+/F128_0 9.963 Tf
+(with) 17.7142 Tj
+-242 TJm
+(ac) 8.84714 Tj
+1 TJm
+(tion) 15.5024 Tj
+-242 TJm
+(=) 5.61913 Tj
+[1 0 0 1 339.78 676.164] cm
+0 g
+0 G
+[1 0 0 1 -339.78 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+339.78 676.164 Td
+/F130_0 9.963 Tf
+(BZ_FINISH) 53.8002 Tj
+[1 0 0 1 393.579 676.164] cm
+0 g
+0 G
+[1 0 0 1 -393.579 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+393.579 676.164 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-242 TJm
+(cop) 14.3866 Tj
+10 TJm
+(yi) 7.75121 Tj
+1 TJm
+(ng) 9.963 Tj
+-242 TJm
+(out) 12.7327 Tj
+-242 TJm
+(the) 12.1748 Tj
+-241 TJm
+(compressed) 47.0353 Tj
+-242 TJm
+(output,) 27.9562 Tj
+91.925 664.209 Td
+(until) 18.2721 Tj
+[1 0 0 1 112.687 664.209] cm
+0 g
+0 G
+[1 0 0 1 -112.687 -664.209] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+112.687 664.209 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 190.396 664.209] cm
+0 g
+0 G
+[1 0 0 1 -190.396 -664.209] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+192.886 664.209 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(returned.) 35.6875 Tj
+[1 0 0 1 237.708 664.209] cm
+0 g
+0 G
+[1 0 0 1 -165.708 -21.918] cm
+0 g
+0 G
+[1 0 0 1 7.372 0] cm
+0 g
+0 G
+[1 0 0 1 -79.372 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+79.372 642.291 Td
+/F128_0 9.963 Tf
+(4.) 7.47225 Tj
+[1 0 0 1 86.844 642.291] cm
+0 g
+0 G
+[1 0 0 1 3.089 0] cm
+0 g
+0 G
+[1 0 0 1 1.992 0] cm
+0 g
+0 G
+[1 0 0 1 -91.925 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+91.925 642.291 Td
+/F128_0 9.963 Tf
+(Close) 22.6957 Tj
+-250 TJm
+(up) 9.963 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(go) 9.963 Tj
+-250 TJm
+(home.) 24.6285 Tj
+-620 TJm
+(Call) 16.6083 Tj
+[1 0 0 1 208.796 642.291] cm
+0 g
+0 G
+[1 0 0 1 -208.796 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+208.796 642.291 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressEnd) 101.623 Tj
+[1 0 0 1 310.415 642.291] cm
+0 g
+0 G
+[1 0 0 1 -310.415 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+310.415 642.291 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 312.906 642.291] cm
+0 g
+0 G
+[1 0 0 1 -240.906 -12.119] cm
+0 g
+0 G
+[1 0 0 1 -72 -630.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 620.374 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-269 TJm
+(the) 12.1748 Tj
+-270 TJm
+(data) 16.5984 Tj
+-269 TJm
+(you) 14.9445 Tj
+-270 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-269 TJm
+(to) 7.75121 Tj
+-269 TJm
+(compress) 37.6303 Tj
+-270 TJm
+(\002ts) 12.1847 Tj
+-269 TJm
+(into) 15.5024 Tj
+-270 TJm
+(you) 14.9445 Tj
+1 TJm
+(r) 3.31768 Tj
+-270 TJm
+(input) 20.4839 Tj
+-269 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-270 TJm
+(all) 9.963 Tj
+-269 TJm
+(at) 7.19329 Tj
+-270 TJm
+(on) 9.963 Tj
+1 TJm
+(ce,) 11.3379 Tj
+-275 TJm
+(you) 14.9445 Tj
+-269 TJm
+(can) 13.8286 Tj
+-270 TJm
+(skip) 16.6083 Tj
+-269 TJm
+(the) 12.1748 Tj
+-269 TJm
+(calls) 18.2622 Tj
+-270 TJm
+(of) 8.29918 Tj
+[1 0 0 1 456.314 620.374] cm
+0 g
+0 G
+[1 0 0 1 -456.314 -620.374] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+456.314 620.374 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+72 608.418 Td
+(\() 5.9778 Tj
+-600 TJm
+(...,) 23.9112 Tj
+-600 TJm
+(BZ_RUN) 35.8668 Tj
+-600 TJm
+(\)) 5.9778 Tj
+[1 0 0 1 161.664 608.418] cm
+0 g
+0 G
+[1 0 0 1 -161.664 -608.418] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+164.154 608.418 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+-250 TJm
+(just) 14.3965 Tj
+-250 TJm
+(do) 9.963 Tj
+-250 TJm
+(the) 12.1748 Tj
+[1 0 0 1 225.036 608.418] cm
+0 g
+0 G
+[1 0 0 1 -225.036 -608.418] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+225.036 608.418 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+-600 TJm
+(\() 5.9778 Tj
+-600 TJm
+(...,) 23.9112 Tj
+-600 TJm
+(B) 5.9778 Tj
+1 TJm
+(Z_FINISH) 47.8224 Tj
+-600 TJm
+(\)) 5.9778 Tj
+[1 0 0 1 422.296 608.418] cm
+0 g
+0 G
+[1 0 0 1 -422.296 -608.418] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+424.786 608.418 Td
+/F128_0 9.963 Tf
+(calls.) 20.7529 Tj
+[1 0 0 1 72 606.262] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -596.299] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 586.501 Td
+/F128_0 9.963 Tf
+(All) 12.7327 Tj
+-277 TJm
+(required) 33.1967 Tj
+-278 TJm
+(memory) 33.2067 Tj
+-277 TJm
+(is) 6.64532 Tj
+-278 TJm
+(allocated) 35.9664 Tj
+-277 TJm
+(by) 9.963 Tj
+[1 0 0 1 220.295 586.501] cm
+0 g
+0 G
+[1 0 0 1 -220.295 -586.501] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+220.295 586.501 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 327.891 586.501] cm
+0 g
+0 G
+[1 0 0 1 -327.891 -586.501] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+327.891 586.501 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-785 TJm
+(The) 15.4925 Tj
+-278 TJm
+(compression) 50.363 Tj
+-277 TJm
+(library) 26.5614 Tj
+-277 TJm
+(can) 13.8286 Tj
+-278 TJm
+(accept) 25.4455 Tj
+-277 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-278 TJm
+(data) 16.5984 Tj
+-277 TJm
+(at) 7.19329 Tj
+-278 TJm
+(all) 9.963 Tj
+72 574.545 Td
+(\(ob) 13.2807 Tj
+15 TJm
+(viously\).) 35.1495 Tj
+-612 TJm
+(So) 10.5209 Tj
+-237 TJm
+(you) 14.9445 Tj
+-238 TJm
+(shouldn') 34.8705 Tj
+18 TJm
+(t) 2.76971 Tj
+-238 TJm
+(ge) 9.40507 Tj
+1 TJm
+(t) 2.76971 Tj
+-238 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-238 TJm
+(error) 19.3581 Tj
+-238 TJm
+(r) 3.31768 Tj
+1 TJm
+(eturn) 20.474 Tj
+-238 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues) 20.474 Tj
+-238 TJm
+(from) 19.3681 Tj
+-237 TJm
+(the) 12.1748 Tj
+[1 0 0 1 339.287 574.545] cm
+0 g
+0 G
+[1 0 0 1 -339.287 -574.545] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+339.287 574.545 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 422.973 574.545] cm
+0 g
+0 G
+[1 0 0 1 -422.973 -574.545] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+425.342 574.545 Td
+/F128_0 9.963 Tf
+(calls.) 20.7529 Tj
+-612 TJm
+(If) 6.63536 Tj
+-237 TJm
+(you) 14.9445 Tj
+-238 TJm
+(do,) 12.4538 Tj
+-240 TJm
+(the) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-238 TJm
+(will) 15.5024 Tj
+-237 TJm
+(be) 9.40507 Tj
+[1 0 0 1 72 562.59] cm
+0 g
+0 G
+[1 0 0 1 -72 -562.59] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 562.59 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+[1 0 0 1 173.619 562.59] cm
+0 g
+0 G
+[1 0 0 1 -173.619 -562.59] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+173.619 562.59 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(indicate) 31.5429 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug) 9.963 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(your) 18.2622 Tj
+-250 TJm
+(prog) 18.2622 Tj
+1 TJm
+(ramming.) 38.4671 Tj
+[1 0 0 1 72 560.433] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -550.471] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 540.672 Td
+/F128_0 9.963 Tf
+(T) 6.08739 Tj
+35 TJm
+(ri) 6.08739 Tj
+25 TJm
+(vial) 14.9445 Tj
+-250 TJm
+(other) 20.474 Tj
+-250 TJm
+(possible) 32.6587 Tj
+-250 TJm
+(return) 23.7916 Tj
+-249 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 538.516] cm
+0 g
+0 G
+[1 0 0 1 0 -36.862] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 35.866 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 32.279] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -529.151] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 529.151 Td
+/F130_0 9.963 Tf
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 517.196 Td
+(if) 11.9556 Tj
+-426 TJm
+(strm) 23.9112 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL,) 29.889 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(strm) 23.9112 Tj
+1 TJm
+(->s) 17.9334 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+[1 0 0 1 72 501.654] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.586] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -491.691] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 471.033 Td
+/F121_0 17.215 Tf
+(3.3.3.) 43.0719 Tj
+[1 0 0 1 119.858 471.033] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -471.033] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 471.033 Td
+/F387_0 17.215 Tf
+(BZ2_bzCompressEnd) 175.593 Tj
+[1 0 0 1 295.455 471.033] cm
+0 g
+0 G
+[1 0 0 1 -223.455 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.324] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -459.335] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 459.335 Td
+/F130_0 9.963 Tf
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzCompressEnd) 101.623 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(b) 5.9778 Tj
+1 TJm
+(z_stream) 47.8224 Tj
+-426 TJm
+(*strm) 29.889 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 443.793] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -433.831] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 421.876 Td
+/F128_0 9.963 Tf
+(Releases) 34.8605 Tj
+-250 TJm
+(all) 9.963 Tj
+-250 TJm
+(memory) 33.2067 Tj
+-250 TJm
+(assoc) 21.5799 Tj
+1 TJm
+(iated) 19.3681 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(compression) 50.363 Tj
+-250 TJm
+(stream.) 29.0521 Tj
+[1 0 0 1 72 419.719] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -409.756] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 399.958 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 399.858] cm
+0 g
+0 G
+[1 0 0 1 0 -36.861] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 35.866 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 32.279] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -390.493] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 390.493 Td
+/F130_0 9.963 Tf
+(BZ_PARAM_ERROR) 83.6892 Tj
+-852 TJm
+(if) 11.9556 Tj
+-426 TJm
+(strm) 23.9112 Tj
+-425 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(strm->s) 41.8446 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+90 378.538 Td
+(BZ_OK) 29.889 Tj
+-4686 TJm
+(otherw) 35.8668 Tj
+1 TJm
+(ise) 17.9334 Tj
+[1 0 0 1 72 362.997] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.586] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -353.034] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 332.375 Td
+/F121_0 17.215 Tf
+(3.3.4.) 43.0719 Tj
+[1 0 0 1 119.858 332.375] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -332.375] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 332.375 Td
+/F387_0 17.215 Tf
+(BZ2_bzDecompressInit) 206.58 Tj
+[1 0 0 1 326.443 332.375] cm
+0 g
+0 G
+[1 0 0 1 -254.443 -2.332] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.323] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -320.678] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 320.678 Td
+/F130_0 9.963 Tf
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzDecompressInit) 119.556 Tj
+-425 TJm
+(\() 5.9778 Tj
+-426 TJm
+(bz_stream) 53.8002 Tj
+-426 TJm
+(*strm,) 35.8668 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(verbosity,) 59.778 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(small) 29.889 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 305.136] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -295.173] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 283.218 Td
+/F128_0 9.963 Tf
+(Prepares) 34.3026 Tj
+-351 TJm
+(for) 11.6169 Tj
+-351 TJm
+(decompression.) 62.2588 Tj
+-1227 TJm
+(As) 11.0689 Tj
+-351 TJm
+(with) 17.7142 Tj
+[1 0 0 1 235.177 283.218] cm
+0 g
+0 G
+[1 0 0 1 -235.177 -283.218] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+235.177 283.218 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 342.773 283.218] cm
+0 g
+0 G
+[1 0 0 1 -342.773 -283.218] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+342.773 283.218 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-377 TJm
+(a) 4.42357 Tj
+[1 0 0 1 356.937 283.218] cm
+0 g
+0 G
+[1 0 0 1 -356.937 -283.218] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+356.937 283.218 Td
+/F130_0 9.963 Tf
+(bz_stream) 53.8002 Tj
+[1 0 0 1 410.736 283.218] cm
+0 g
+0 G
+[1 0 0 1 -410.736 -283.218] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+414.234 283.218 Td
+/F128_0 9.963 Tf
+(record) 25.4455 Tj
+-351 TJm
+(should) 26.5713 Tj
+-351 TJm
+(be) 9.40507 Tj
+-351 TJm
+(allocated) 35.9664 Tj
+-351 TJm
+(and) 14.3866 Tj
+72 271.263 Td
+(initialised) 39.304 Tj
+-305 TJm
+(before) 25.4455 Tj
+-306 TJm
+(the) 12.1748 Tj
+-305 TJm
+(call.) 16.8773 Tj
+-954 TJm
+(Fields) 24.3595 Tj
+[1 0 0 1 211.833 271.263] cm
+0 g
+0 G
+[1 0 0 1 -211.833 -271.263] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+211.833 271.263 Td
+/F130_0 9.963 Tf
+(bzalloc) 41.8446 Tj
+[1 0 0 1 253.676 271.263] cm
+0 g
+0 G
+[1 0 0 1 -253.676 -271.263] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+253.676 271.263 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 259.35 271.263] cm
+0 g
+0 G
+[1 0 0 1 -259.35 -271.263] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+259.35 271.263 Td
+/F130_0 9.963 Tf
+(bzfree) 35.8668 Tj
+[1 0 0 1 295.215 271.263] cm
+0 g
+0 G
+[1 0 0 1 -295.215 -271.263] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+298.26 271.263 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 315.69 271.263] cm
+0 g
+0 G
+[1 0 0 1 -315.69 -271.263] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+315.69 271.263 Td
+/F130_0 9.963 Tf
+(opaque) 35.8668 Tj
+[1 0 0 1 351.556 271.263] cm
+0 g
+0 G
+[1 0 0 1 -351.556 -271.263] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+354.6 271.263 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-305 TJm
+(be) 9.40507 Tj
+-306 TJm
+(set) 11.0689 Tj
+-306 TJm
+(if) 6.08739 Tj
+-305 TJm
+(a) 4.42357 Tj
+-306 TJm
+(custom) 28.7831 Tj
+-305 TJm
+(memory) 33.2067 Tj
+-306 TJm
+(al) 7.19329 Tj
+1 TJm
+(locator) 27.6673 Tj
+-306 TJm
+(is) 6.64532 Tj
+72 259.308 Td
+(required,) 35.6875 Tj
+-350 TJm
+(or) 8.29918 Tj
+-330 TJm
+(made) 21.5799 Tj
+[1 0 0 1 147.635 259.308] cm
+0 g
+0 G
+[1 0 0 1 -147.635 -259.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+147.635 259.308 Td
+/F130_0 9.963 Tf
+(NULL) 23.9112 Tj
+[1 0 0 1 171.546 259.308] cm
+0 g
+0 G
+[1 0 0 1 -171.546 -259.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+174.836 259.308 Td
+/F128_0 9.963 Tf
+(for) 11.6169 Tj
+-330 TJm
+(the) 12.1748 Tj
+-330 TJm
+(normal) 28.2252 Tj
+[1 0 0 1 236.722 259.308] cm
+0 g
+0 G
+[1 0 0 1 -236.722 -259.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+236.722 259.308 Td
+/F130_0 9.963 Tf
+(malloc) 35.8668 Tj
+[1 0 0 1 272.587 259.308] cm
+0 g
+0 G
+[1 0 0 1 -272.587 -259.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+275.878 259.308 Td
+/F128_0 9.963 Tf
+(/) 2.76971 Tj
+[1 0 0 1 281.938 259.308] cm
+0 g
+0 G
+[1 0 0 1 -281.938 -259.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+281.938 259.308 Td
+/F130_0 9.963 Tf
+(free) 23.9112 Tj
+[1 0 0 1 305.848 259.308] cm
+0 g
+0 G
+[1 0 0 1 -305.848 -259.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+309.139 259.308 Td
+/F128_0 9.963 Tf
+(routines.) 34.5915 Tj
+-1102 TJm
+(Upo) 17.1563 Tj
+1 TJm
+(n) 4.9815 Tj
+-331 TJm
+(return,) 26.2824 Tj
+-350 TJm
+(the) 12.1748 Tj
+-330 TJm
+(internal) 30.437 Tj
+-330 TJm
+(state) 18.2622 Tj
+-331 TJm
+(wi) 9.963 Tj
+1 TJm
+(ll) 5.53943 Tj
+-331 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-330 TJm
+(been) 18.8101 Tj
+72 247.353 Td
+(initialised,) 41.7948 Tj
+-250 TJm
+(and) 14.3866 Tj
+[1 0 0 1 133.16 247.353] cm
+0 g
+0 G
+[1 0 0 1 -133.16 -247.353] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+133.16 247.353 Td
+/F130_0 9.963 Tf
+(total_in) 47.8224 Tj
+[1 0 0 1 180.98 247.353] cm
+0 g
+0 G
+[1 0 0 1 -180.98 -247.353] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+183.471 247.353 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 200.348 247.353] cm
+0 g
+0 G
+[1 0 0 1 -200.348 -247.353] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+200.348 247.353 Td
+/F130_0 9.963 Tf
+(total_out) 53.8002 Tj
+[1 0 0 1 254.146 247.353] cm
+0 g
+0 G
+[1 0 0 1 -254.146 -247.353] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+256.637 247.353 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(zero.) 19.6371 Tj
+[1 0 0 1 72 245.913] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -235.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 225.435 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(meaning) 34.3126 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(parameter) 39.8321 Tj
+[1 0 0 1 192.756 225.435] cm
+0 g
+0 G
+[1 0 0 1 -192.756 -225.435] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+192.756 225.435 Td
+/F130_0 9.963 Tf
+(verbosity) 53.8002 Tj
+[1 0 0 1 246.554 225.435] cm
+0 g
+0 G
+[1 0 0 1 -246.554 -225.435] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+246.554 225.435 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(see) 12.7228 Tj
+[1 0 0 1 266.748 225.435] cm
+0 g
+0 G
+[1 0 0 1 -266.748 -225.435] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+266.748 225.435 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 374.345 225.435] cm
+0 g
+0 G
+[1 0 0 1 -374.345 -225.435] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+374.345 225.435 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 223.278] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -213.316] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 203.517 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+[1 0 0 1 81.497 203.517] cm
+0 g
+0 G
+[1 0 0 1 -81.497 -203.517] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+81.497 203.517 Td
+/F130_0 9.963 Tf
+(small) 29.889 Tj
+[1 0 0 1 111.385 203.517] cm
+0 g
+0 G
+[1 0 0 1 -111.385 -203.517] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+114.248 203.517 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-287 TJm
+(nonzero,) 34.5816 Tj
+-297 TJm
+(the) 12.1748 Tj
+-287 TJm
+(library) 26.5614 Tj
+-287 TJm
+(will) 15.5024 Tj
+-287 TJm
+(use) 13.2807 Tj
+-288 TJm
+(an) 9.40507 Tj
+-287 TJm
+(alternati) 32.6488 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-287 TJm
+(decompression) 59.768 Tj
+-287 TJm
+(algorithm) 38.7461 Tj
+-287 TJm
+(which) 24.3496 Tj
+-287 TJm
+(uses) 17.1563 Tj
+-288 TJm
+(less) 14.9445 Tj
+-287 TJm
+(memory) 33.2067 Tj
+-287 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-287 TJm
+(at) 7.19329 Tj
+-287 TJm
+(the) 12.1748 Tj
+72 191.562 Td
+(cost) 16.0504 Tj
+-289 TJm
+(of) 8.29918 Tj
+-290 TJm
+(deco) 18.8101 Tj
+1 TJm
+(mpressing) 40.9579 Tj
+-290 TJm
+(more) 20.474 Tj
+-289 TJm
+(slo) 11.6268 Tj
+25 TJm
+(wly) 14.9445 Tj
+-289 TJm
+(\(roughly) 34.3126 Tj
+-289 TJm
+(speaking,) 37.9092 Tj
+-299 TJm
+(half) 15.4925 Tj
+-290 TJm
+(the) 12.1748 Tj
+-289 TJm
+(speed,) 25.1765 Tj
+-299 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-289 TJm
+(the) 12.1748 Tj
+-290 TJm
+(m) 7.75121 Tj
+1 TJm
+(aximum) 32.6587 Tj
+-290 TJm
+(memory) 33.2067 Tj
+-289 TJm
+(requirement) 48.1412 Tj
+-289 TJm
+(drops) 22.1378 Tj
+72 179.607 Td
+(to) 7.75121 Tj
+-250 TJm
+(around) 27.6673 Tj
+-250 TJm
+(2300k\).) 30.7159 Tj
+-620 TJm
+(See) 14.3866 Tj
+[1 0 0 1 166.166 179.607] cm
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -166.166 -179.607] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+166.166 179.607 Td
+/F128_0 9.963 Tf
+(Ho) 12.1748 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(bzip2) 22.1378 Tj
+[1 0 0 1 235.924 179.607] cm
+0 g
+0 G
+0 0 1 rg
+0 0 1 RG
+0 0 1 rg
+0 0 1 RG
+[1 0 0 1 -235.924 -179.607] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+238.415 179.607 Td
+/F128_0 9.963 Tf
+([2]) 11.6169 Tj
+[1 0 0 1 250.031 179.607] cm
+0 0 1 rg
+0 0 1 RG
+0 g
+0 G
+[1 0 0 1 -250.031 -179.607] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+252.522 179.607 Td
+/F128_0 9.963 Tf
+(for) 11.6169 Tj
+-250 TJm
+(more) 20.474 Tj
+-250 TJm
+(information) 47.0453 Tj
+-250 TJm
+(on) 9.963 Tj
+-250 TJm
+(mem) 19.926 Tj
+1 TJm
+(ory) 13.2807 Tj
+-250 TJm
+(management.) 53.4017 Tj
+[1 0 0 1 72 177.45] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -167.487] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 157.689 Td
+/F128_0 9.963 Tf
+(Note) 19.3681 Tj
+-289 TJm
+(that) 14.9445 Tj
+-289 TJm
+(the) 12.1748 Tj
+-290 TJm
+(amou) 22.1378 Tj
+1 TJm
+(nt) 7.75121 Tj
+-290 TJm
+(of) 8.29918 Tj
+-289 TJm
+(memory) 33.2067 Tj
+-289 TJm
+(needed) 28.2152 Tj
+-289 TJm
+(to) 7.75121 Tj
+-289 TJm
+(decompress) 47.0353 Tj
+-290 TJm
+(a) 4.42357 Tj
+-289 TJm
+(stream) 26.5614 Tj
+-289 TJm
+(cannot) 26.5614 Tj
+-289 TJm
+(be) 9.40507 Tj
+-289 TJm
+(determined) 44.8235 Tj
+-289 TJm
+(until) 18.2721 Tj
+-290 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-290 TJm
+(stream') 29.879 Tj
+55 TJm
+(s) 3.87561 Tj
+-289 TJm
+(header) 26.5514 Tj
+-289 TJm
+(has) 13.2807 Tj
+72 145.734 Td
+(been) 18.8101 Tj
+-342 TJm
+(read,) 19.6371 Tj
+-365 TJm
+(so) 8.85711 Tj
+-343 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-342 TJm
+(if) 6.08739 Tj
+[1 0 0 1 161.081 145.734] cm
+0 g
+0 G
+[1 0 0 1 -161.081 -145.734] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+161.081 145.734 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompressInit) 119.556 Tj
+[1 0 0 1 280.633 145.734] cm
+0 g
+0 G
+[1 0 0 1 -280.633 -145.734] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+284.043 145.734 Td
+/F128_0 9.963 Tf
+(succeeds,) 37.8993 Tj
+-365 TJm
+(a) 4.42357 Tj
+-342 TJm
+(subsequent) 44.2756 Tj
+[1 0 0 1 381.098 145.734] cm
+0 g
+0 G
+[1 0 0 1 -381.098 -145.734] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+381.098 145.734 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 476.739 145.734] cm
+0 g
+0 G
+[1 0 0 1 -476.739 -145.734] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+480.149 145.734 Td
+/F128_0 9.963 Tf
+(could) 22.1378 Tj
+-342 TJm
+(f) 3.31768 Tj
+10 TJm
+(ail) 9.963 Tj
+-342 TJm
+(with) 17.7142 Tj
+[1 0 0 1 72 133.779] cm
+0 g
+0 G
+[1 0 0 1 -72 -133.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 133.779 Td
+/F130_0 9.963 Tf
+(BZ_MEM_ERROR) 71.7336 Tj
+[1 0 0 1 143.731 133.779] cm
+0 g
+0 G
+[1 0 0 1 -143.731 -133.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+143.731 133.779 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 132.613] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -122.651] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 111.861 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 111.761] cm
+0 g
+0 G
+[1 0 0 1 0 -60.909] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(16) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 20 20
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -117.195] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 95.641 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 92.055] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(BZ_CONFIG_ERROR) 89.667 Tj
+98.488 699.676 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(library) 41.8446 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-425 TJm
+(mis-compiled) 71.7336 Tj
+90 687.721 Td
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 675.766 Td
+(if) 11.9556 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(small) 29.889 Tj
+-426 TJm
+(!=) 11.9556 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(&&) 11.9556 Tj
+-426 TJm
+(small) 29.889 Tj
+-425 TJm
+(!=) 11.9556 Tj
+-426 TJm
+(1) 5.9778 Tj
+-426 TJm
+(\)) 5.9778 Tj
+98.488 663.811 Td
+(or) 11.9556 Tj
+-426 TJm
+(\(verbosity) 59.778 Tj
+-426 TJm
+(<;) 11.9556 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(||) 11.9556 Tj
+-426 TJm
+(ve) 11.9556 Tj
+1 TJm
+(rbosity) 41.8446 Tj
+-426 TJm
+(>) 5.9778 Tj
+-426 TJm
+(4\)) 11.9556 Tj
+90 651.856 Td
+(BZ_MEM_ERROR) 71.7336 Tj
+98.488 639.9 Td
+(if) 11.9556 Tj
+-426 TJm
+(insufficient) 71.7336 Tj
+-426 TJm
+(memory) 35.8668 Tj
+-426 TJm
+(is) 11.9556 Tj
+-425 TJm
+(available) 53.8002 Tj
+[1 0 0 1 72 624.359] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -614.396] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 602.441 Td
+/F128_0 9.963 Tf
+(Allo) 17.7142 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-250 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-250 TJm
+(actions:) 30.9949 Tj
+[1 0 0 1 72 602.341] cm
+0 g
+0 G
+[1 0 0 1 0 -48.817] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 47.821 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 44.234] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -592.976] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 592.976 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+98.488 581.021 Td
+(if) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(returned) 47.8224 Tj
+98.488 569.066 Td
+(no) 11.9556 Tj
+-426 TJm
+(specific) 47.8224 Tj
+-426 TJm
+(action) 35.8668 Tj
+-426 TJm
+(requir) 35.8668 Tj
+1 TJm
+(ed) 11.9556 Tj
+-426 TJm
+(in) 11.9556 Tj
+-426 TJm
+(case) 23.9112 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(error) 29.889 Tj
+[1 0 0 1 72 553.524] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -543.562] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 522.903 Td
+/F121_0 17.215 Tf
+(3.3.5.) 43.0719 Tj
+[1 0 0 1 119.858 522.903] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -522.903] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 522.903 Td
+/F387_0 17.215 Tf
+(BZ2_bzDecompress) 165.264 Tj
+[1 0 0 1 285.126 522.903] cm
+0 g
+0 G
+[1 0 0 1 -213.126 -2.332] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.323] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -511.206] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 511.206 Td
+/F130_0 9.963 Tf
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzDecompress) 95.6448 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(bz) 11.9556 Tj
+1 TJm
+(_stream) 41.8446 Tj
+-426 TJm
+(*strm) 29.889 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 495.664] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 473.746 Td
+/F128_0 9.963 Tf
+(Pro) 13.8386 Tj
+15 TJm
+(vides) 21.0319 Tj
+-301 TJm
+(more) 20.474 Tj
+-302 TJm
+(inpu) 17.7142 Tj
+1 TJm
+(t) 2.76971 Tj
+-302 TJm
+(and/out) 29.889 Tj
+-301 TJm
+(output) 25.4654 Tj
+-301 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-302 TJm
+(space) 22.1278 Tj
+-301 TJm
+(for) 11.6169 Tj
+-301 TJm
+(the) 12.1748 Tj
+-302 TJm
+(library) 26.5614 Tj
+65 TJm
+(.) 2.49075 Tj
+-928 TJm
+(The) 15.4925 Tj
+-301 TJm
+(caller) 22.1278 Tj
+-302 TJm
+(maintains) 38.7461 Tj
+-301 TJm
+(input) 20.4839 Tj
+-301 TJm
+(and) 14.3866 Tj
+-302 TJm
+(out) 12.7327 Tj
+1 TJm
+(put) 12.7327 Tj
+-302 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fers,) 17.4253 Tj
+-314 TJm
+(and) 14.3866 Tj
+72 461.791 Td
+(uses) 17.1563 Tj
+[1 0 0 1 91.646 461.791] cm
+0 g
+0 G
+[1 0 0 1 -91.646 -461.791] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+91.646 461.791 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 187.287 461.791] cm
+0 g
+0 G
+[1 0 0 1 -187.287 -461.791] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+189.778 461.791 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(transfer) 30.427 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(between) 33.1967 Tj
+-250 TJm
+(them) 19.926 Tj
+1 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 460.227] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -450.264] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 439.873 Td
+/F128_0 9.963 Tf
+(Before) 27.1093 Tj
+-498 TJm
+(each) 18.2522 Tj
+-498 TJm
+(call) 14.3866 Tj
+-499 TJm
+(to) 7.75121 Tj
+[1 0 0 1 159.356 439.873] cm
+0 g
+0 G
+[1 0 0 1 -159.356 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+159.356 439.873 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 254.997 439.873] cm
+0 g
+0 G
+[1 0 0 1 -254.997 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+254.997 439.873 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 263.071 439.873] cm
+0 g
+0 G
+[1 0 0 1 -263.071 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+263.071 439.873 Td
+/F130_0 9.963 Tf
+(next_in) 41.8446 Tj
+[1 0 0 1 304.914 439.873] cm
+0 g
+0 G
+[1 0 0 1 -304.914 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+309.879 439.873 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-498 TJm
+(point) 20.4839 Tj
+-498 TJm
+(at) 7.19329 Tj
+-499 TJm
+(the) 12.1748 Tj
+-498 TJm
+(compressed) 47.0353 Tj
+-498 TJm
+(data,) 19.0891 Tj
+-560 TJm
+(and) 14.3866 Tj
+[1 0 0 1 492.179 439.873] cm
+0 g
+0 G
+[1 0 0 1 -492.179 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+492.179 439.873 Td
+/F130_0 9.963 Tf
+(avail_in) 47.8224 Tj
+[1 0 0 1 540 439.873] cm
+0 g
+0 G
+[1 0 0 1 -540 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 427.918 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-308 TJm
+(indicate) 31.5429 Tj
+-308 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-308 TJm
+(man) 17.1563 Tj
+15 TJm
+(y) 4.9815 Tj
+-308 TJm
+(bytes) 21.0319 Tj
+-308 TJm
+(the) 12.1748 Tj
+-309 TJm
+(library) 26.5614 Tj
+-308 TJm
+(may) 17.1563 Tj
+-308 TJm
+(read.) 19.6371 Tj
+[1 0 0 1 294.955 427.918] cm
+0 g
+0 G
+[1 0 0 1 -294.955 -427.918] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+294.955 427.918 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 390.597 427.918] cm
+0 g
+0 G
+[1 0 0 1 -390.597 -427.918] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+393.667 427.918 Td
+/F128_0 9.963 Tf
+(updates) 30.437 Tj
+[1 0 0 1 427.173 427.918] cm
+0 g
+0 G
+[1 0 0 1 -427.173 -427.918] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+427.173 427.918 Td
+/F130_0 9.963 Tf
+(next_in) 41.8446 Tj
+[1 0 0 1 469.016 427.918] cm
+0 g
+0 G
+[1 0 0 1 -469.016 -427.918] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+469.016 427.918 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 474.723 427.918] cm
+0 g
+0 G
+[1 0 0 1 -474.723 -427.918] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+474.723 427.918 Td
+/F130_0 9.963 Tf
+(avail_in) 47.8224 Tj
+[1 0 0 1 522.543 427.918] cm
+0 g
+0 G
+[1 0 0 1 -522.543 -427.918] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+525.614 427.918 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 72 415.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -415.963] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 415.963 Td
+/F130_0 9.963 Tf
+(total_in) 47.8224 Tj
+[1 0 0 1 119.821 415.963] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -415.963] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+122.311 415.963 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(re\003ect) 24.8975 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(number) 30.437 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(bytes) 21.0319 Tj
+-250 TJm
+(i) 2.76971 Tj
+1 TJm
+(t) 2.76971 Tj
+-250 TJm
+(has) 13.2807 Tj
+-250 TJm
+(read.) 19.6371 Tj
+[1 0 0 1 72 413.806] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -403.843] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 394.045 Td
+/F128_0 9.963 Tf
+(Similarly) 37.0922 Tj
+65 TJm
+(,) 2.49075 Tj
+[1 0 0 1 113.799 394.045] cm
+0 g
+0 G
+[1 0 0 1 -113.799 -394.045] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+113.799 394.045 Td
+/F130_0 9.963 Tf
+(next_out) 47.8224 Tj
+[1 0 0 1 161.62 394.045] cm
+0 g
+0 G
+[1 0 0 1 -161.62 -394.045] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+164.41 394.045 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-280 TJm
+(point) 20.4839 Tj
+-280 TJm
+(to) 7.75121 Tj
+-280 TJm
+(a) 4.42357 Tj
+-280 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-280 TJm
+(in) 7.75121 Tj
+-280 TJm
+(which) 24.3496 Tj
+-280 TJm
+(the) 12.1748 Tj
+-280 TJm
+(uncompressed) 56.9983 Tj
+-280 TJm
+(output) 25.4654 Tj
+-280 TJm
+(is) 6.64532 Tj
+-280 TJm
+(to) 7.75121 Tj
+-280 TJm
+(be) 9.40507 Tj
+-280 TJm
+(placed,) 28.4942 Tj
+-288 TJm
+(with) 17.7142 Tj
+[1 0 0 1 486.202 394.045] cm
+0 g
+0 G
+[1 0 0 1 -486.202 -394.045] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+486.202 394.045 Td
+/F130_0 9.963 Tf
+(avail_out) 53.8002 Tj
+[1 0 0 1 540 394.045] cm
+0 g
+0 G
+[1 0 0 1 -540 -394.045] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 382.09 Td
+/F128_0 9.963 Tf
+(indicating) 39.852 Tj
+-524 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-525 TJm
+(much) 22.1378 Tj
+-524 TJm
+(output) 25.4654 Tj
+-525 TJm
+(space) 22.1278 Tj
+-524 TJm
+(is) 6.64532 Tj
+-525 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+25 TJm
+(ailable.) 29.0521 Tj
+[1 0 0 1 285.792 382.09] cm
+0 g
+0 G
+[1 0 0 1 -285.792 -382.09] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+285.792 382.09 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 369.478 382.09] cm
+0 g
+0 G
+[1 0 0 1 -369.478 -382.09] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+374.705 382.09 Td
+/F128_0 9.963 Tf
+(updates) 30.437 Tj
+[1 0 0 1 410.367 382.09] cm
+0 g
+0 G
+[1 0 0 1 -410.367 -382.09] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+410.367 382.09 Td
+/F130_0 9.963 Tf
+(next_out) 47.8224 Tj
+[1 0 0 1 458.188 382.09] cm
+0 g
+0 G
+[1 0 0 1 -458.188 -382.09] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+458.188 382.09 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 466.589 382.09] cm
+0 g
+0 G
+[1 0 0 1 -466.589 -382.09] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+466.589 382.09 Td
+/F130_0 9.963 Tf
+(avail_out) 53.8002 Tj
+[1 0 0 1 520.387 382.09] cm
+0 g
+0 G
+[1 0 0 1 -520.387 -382.09] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+525.614 382.09 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 72 370.135] cm
+0 g
+0 G
+[1 0 0 1 -72 -370.135] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 370.135 Td
+/F130_0 9.963 Tf
+(total_out) 53.8002 Tj
+[1 0 0 1 125.798 370.135] cm
+0 g
+0 G
+[1 0 0 1 -125.798 -370.135] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+128.289 370.135 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(re\003ect) 24.8975 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(number) 30.437 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(bytes) 21.0319 Tj
+-249 TJm
+(output.) 27.9562 Tj
+[1 0 0 1 72 367.978] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -358.015] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 348.217 Td
+/F128_0 9.963 Tf
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-320 TJm
+(may) 17.1563 Tj
+-321 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vide) 17.1563 Tj
+-320 TJm
+(and) 14.3866 Tj
+-320 TJm
+(remo) 20.474 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-321 TJm
+(as) 8.29918 Tj
+-320 TJm
+(little) 18.2721 Tj
+-320 TJm
+(or) 8.29918 Tj
+-321 TJm
+(as) 8.29918 Tj
+-320 TJm
+(much) 22.1378 Tj
+-320 TJm
+(data) 16.5984 Tj
+-321 TJm
+(as) 8.29918 Tj
+-320 TJm
+(you) 14.9445 Tj
+-321 TJm
+(lik) 10.5209 Tj
+11 TJm
+(e) 4.42357 Tj
+-321 TJm
+(on) 9.963 Tj
+-320 TJm
+(each) 18.2522 Tj
+-321 TJm
+(call) 14.3866 Tj
+-320 TJm
+(of) 8.29918 Tj
+[1 0 0 1 407.816 348.217] cm
+0 g
+0 G
+[1 0 0 1 -407.816 -348.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+407.816 348.217 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 503.457 348.217] cm
+0 g
+0 G
+[1 0 0 1 -503.457 -348.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+503.457 348.217 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1043 TJm
+(In) 8.29918 Tj
+-320 TJm
+(the) 12.1748 Tj
+72 336.262 Td
+(limit,) 21.3208 Tj
+-295 TJm
+(it) 5.53943 Tj
+-286 TJm
+(is) 6.64532 Tj
+-287 TJm
+(ac) 8.84714 Tj
+1 TJm
+(ceptable) 33.1967 Tj
+-287 TJm
+(to) 7.75121 Tj
+-286 TJm
+(supply) 26.5713 Tj
+-286 TJm
+(and) 14.3866 Tj
+-286 TJm
+(remo) 20.474 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-286 TJm
+(data) 16.5984 Tj
+-286 TJm
+(one) 14.3866 Tj
+-286 TJm
+(byte) 17.1563 Tj
+-287 TJm
+(at) 7.19329 Tj
+-286 TJm
+(a) 4.42357 Tj
+-286 TJm
+(time,) 20.205 Tj
+-295 TJm
+(although) 34.8705 Tj
+-286 TJm
+(this) 14.3965 Tj
+-286 TJm
+(w) 7.19329 Tj
+10 TJm
+(ould) 17.7142 Tj
+-287 TJm
+(be) 9.40507 Tj
+-286 TJm
+(terribly) 29.3311 Tj
+-286 TJm
+(inef) 15.4925 Tj
+25 TJm
+(\002cient.) 27.3983 Tj
+-837 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+72 324.307 Td
+(should) 26.5713 Tj
+-250 TJm
+(al) 7.19329 Tj
+10 TJm
+(w) 7.19329 Tj
+10 TJm
+(ays) 13.2807 Tj
+-250 TJm
+(ensure) 26.0034 Tj
+-250 TJm
+(that) 14.9445 Tj
+-250 TJm
+(at) 7.19329 Tj
+-249 TJm
+(least) 18.2622 Tj
+-250 TJm
+(one) 14.3866 Tj
+-250 TJm
+(byte) 17.1563 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(output) 25.4654 Tj
+-250 TJm
+(space) 22.1278 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+25 TJm
+(ailable) 26.5614 Tj
+-250 TJm
+(at) 7.19329 Tj
+-250 TJm
+(each) 18.2522 Tj
+-250 TJm
+(call.) 16.8773 Tj
+[1 0 0 1 72 322.15] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -312.187] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 302.389 Td
+/F128_0 9.963 Tf
+(Use) 15.4925 Tj
+-250 TJm
+(of) 8.29918 Tj
+[1 0 0 1 100.772 302.389] cm
+0 g
+0 G
+[1 0 0 1 -100.772 -302.389] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+100.772 302.389 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 196.413 302.389] cm
+0 g
+0 G
+[1 0 0 1 -196.413 -302.389] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+198.904 302.389 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(simpler) 29.889 Tj
+-250 TJm
+(than) 17.1563 Tj
+[1 0 0 1 260.064 302.389] cm
+0 g
+0 G
+[1 0 0 1 -260.064 -302.389] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+260.064 302.389 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 343.75 302.389] cm
+0 g
+0 G
+[1 0 0 1 -343.75 -302.389] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+343.75 302.389 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 300.232] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -290.269] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 280.471 Td
+/F128_0 9.963 Tf
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-346 TJm
+(should) 26.5713 Tj
+-346 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vide) 17.1563 Tj
+-346 TJm
+(input) 20.4839 Tj
+-347 TJm
+(and) 14.3866 Tj
+-346 TJm
+(remo) 20.474 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-346 TJm
+(output) 25.4654 Tj
+-346 TJm
+(as) 8.29918 Tj
+-346 TJm
+(described) 38.1782 Tj
+-346 TJm
+(abo) 14.3866 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e,) 6.91432 Tj
+-371 TJm
+(and) 14.3866 Tj
+-346 TJm
+(repeatedly) 41.4959 Tj
+-346 TJm
+(call) 14.3866 Tj
+[1 0 0 1 422.638 280.471] cm
+0 g
+0 G
+[1 0 0 1 -422.638 -280.471] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+422.638 280.471 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 518.279 280.471] cm
+0 g
+0 G
+[1 0 0 1 -518.279 -280.471] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+521.729 280.471 Td
+/F128_0 9.963 Tf
+(until) 18.2721 Tj
+[1 0 0 1 72 268.516] cm
+0 g
+0 G
+[1 0 0 1 -72 -268.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 268.516 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 149.709 268.516] cm
+0 g
+0 G
+[1 0 0 1 -149.709 -268.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+152.314 268.516 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-262 TJm
+(ret) 10.511 Tj
+1 TJm
+(urned.) 25.1765 Tj
+-345 TJm
+(Appearance) 47.5733 Tj
+-261 TJm
+(of) 8.29918 Tj
+[1 0 0 1 261.767 268.516] cm
+0 g
+0 G
+[1 0 0 1 -261.767 -268.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+261.767 268.516 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 339.475 268.516] cm
+0 g
+0 G
+[1 0 0 1 -339.475 -268.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+342.081 268.516 Td
+/F128_0 9.963 Tf
+(denotes) 30.437 Tj
+-261 TJm
+(that) 14.9445 Tj
+[1 0 0 1 392.672 268.516] cm
+0 g
+0 G
+[1 0 0 1 -392.672 -268.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+392.672 268.516 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 488.313 268.516] cm
+0 g
+0 G
+[1 0 0 1 -488.313 -268.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+490.919 268.516 Td
+/F128_0 9.963 Tf
+(has) 13.2807 Tj
+-261 TJm
+(detected) 33.1967 Tj
+72 256.561 Td
+(the) 12.1748 Tj
+-212 TJm
+(logical) 27.1193 Tj
+-211 TJm
+(end) 14.3866 Tj
+-212 TJm
+(of) 8.29918 Tj
+-212 TJm
+(the) 12.1748 Tj
+-212 TJm
+(compressed) 47.0353 Tj
+-211 TJm
+(stream.) 29.0521 Tj
+[1 0 0 1 237.858 256.561] cm
+0 g
+0 G
+[1 0 0 1 -237.858 -256.561] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+237.858 256.561 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 333.499 256.561] cm
+0 g
+0 G
+[1 0 0 1 -333.499 -256.561] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+335.609 256.561 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-212 TJm
+(not) 12.7327 Tj
+-212 TJm
+(pr) 8.29918 Tj
+1 TJm
+(oduce) 23.7916 Tj
+[1 0 0 1 402.263 256.561] cm
+0 g
+0 G
+[1 0 0 1 -402.263 -256.561] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+402.263 256.561 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 479.972 256.561] cm
+0 g
+0 G
+[1 0 0 1 -479.972 -256.561] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+482.082 256.561 Td
+/F128_0 9.963 Tf
+(until) 18.2721 Tj
+-212 TJm
+(all) 9.963 Tj
+-211 TJm
+(output) 25.4654 Tj
+72 244.605 Td
+(data) 16.5984 Tj
+-256 TJm
+(has) 13.2807 Tj
+-255 TJm
+(been) 18.8101 Tj
+-256 TJm
+(placed) 26.0034 Tj
+-256 TJm
+(into) 15.5024 Tj
+-256 TJm
+(the) 12.1748 Tj
+-255 TJm
+(output) 25.4654 Tj
+-256 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+40 TJm
+(,) 2.49075 Tj
+-257 TJm
+(so) 8.85711 Tj
+-256 TJm
+(once) 18.8101 Tj
+[1 0 0 1 278.979 244.605] cm
+0 g
+0 G
+[1 0 0 1 -278.979 -244.605] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+278.979 244.605 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 356.687 244.605] cm
+0 g
+0 G
+[1 0 0 1 -356.687 -244.605] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+359.236 244.605 Td
+/F128_0 9.963 Tf
+(appears,) 32.9178 Tj
+-257 TJm
+(you) 14.9445 Tj
+-256 TJm
+(are) 12.1648 Tj
+-256 TJm
+(guaran) 27.1093 Tj
+1 TJm
+(teed) 16.5984 Tj
+-256 TJm
+(to) 7.75121 Tj
+-256 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-256 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+25 TJm
+(ailable) 26.5614 Tj
+72 232.65 Td
+(all) 9.963 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(decompressed) 56.4404 Tj
+-250 TJm
+(output,) 27.9562 Tj
+-249 TJm
+(and) 14.3866 Tj
+[1 0 0 1 205.369 232.65] cm
+0 g
+0 G
+[1 0 0 1 -205.369 -232.65] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+205.369 232.65 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompressEnd) 113.578 Tj
+[1 0 0 1 318.943 232.65] cm
+0 g
+0 G
+[1 0 0 1 -318.943 -232.65] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+321.433 232.65 Td
+/F128_0 9.963 Tf
+(can) 13.8286 Tj
+-250 TJm
+(safely) 23.7916 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(called.) 26.2824 Tj
+[1 0 0 1 72 230.493] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -220.531] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 210.732 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-250 TJm
+(case) 17.1463 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(an) 9.40507 Tj
+-250 TJm
+(error) 19.3581 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+1 TJm
+(,) 2.49075 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(should) 26.5713 Tj
+-250 TJm
+(call) 14.3866 Tj
+[1 0 0 1 261.259 210.732] cm
+0 g
+0 G
+[1 0 0 1 -261.259 -210.732] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+261.259 210.732 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompressEnd) 113.578 Tj
+[1 0 0 1 374.833 210.732] cm
+0 g
+0 G
+[1 0 0 1 -374.833 -210.732] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+377.323 210.732 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(clean) 21.0219 Tj
+-250 TJm
+(up) 9.963 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(release) 27.6573 Tj
+-250 TJm
+(memor) 28.2252 Tj
+1 TJm
+(y) 4.9815 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 208.576] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -198.613] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 188.815 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 188.715] cm
+0 g
+0 G
+[1 0 0 1 0 -137.863] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(17) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 21 21
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -200.882] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 179.328 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 175.741] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 699.676 Td
+(if) 11.9556 Tj
+-426 TJm
+(strm) 23.9112 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(strm-) 29.889 Tj
+1 TJm
+(>s) 11.9556 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+98.488 687.721 Td
+(or) 11.9556 Tj
+-426 TJm
+(strm->avail_out) 89.667 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(1) 5.9778 Tj
+90 675.766 Td
+(BZ_DATA_ERROR) 77.7114 Tj
+98.488 663.811 Td
+(if) 11.9556 Tj
+-426 TJm
+(a) 5.9778 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(integrity) 53.8002 Tj
+-426 TJm
+(erro) 23.9112 Tj
+1 TJm
+(r) 5.9778 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(detected) 47.8224 Tj
+-426 TJm
+(in) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+-426 TJm
+(stream) 35.8668 Tj
+90 651.856 Td
+(BZ_DATA_ERROR_MAGIC) 113.578 Tj
+98.488 639.9 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+-426 TJm
+(stream) 35.8668 Tj
+-425 TJm
+(doesn't) 41.8446 Tj
+-426 TJm
+(begin) 29.889 Tj
+-426 TJm
+(with) 23.9112 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(right) 29.889 Tj
+-426 TJm
+(magic) 29.889 Tj
+-426 TJm
+(bytes) 29.889 Tj
+90 627.945 Td
+(BZ_MEM_ERROR) 71.7336 Tj
+98.488 615.99 Td
+(if) 11.9556 Tj
+-426 TJm
+(there) 29.889 Tj
+-426 TJm
+(wasn't) 35.8668 Tj
+-426 TJm
+(enough) 35.8668 Tj
+-426 TJm
+(m) 5.9778 Tj
+1 TJm
+(emory) 29.889 Tj
+-426 TJm
+(available) 53.8002 Tj
+90 604.035 Td
+(BZ_STREAM_END) 77.7114 Tj
+98.488 592.08 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(logical) 41.8446 Tj
+-426 TJm
+(end) 17.9334 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(th) 11.9556 Tj
+1 TJm
+(e) 5.9778 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(stream) 35.8668 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(detected) 47.8224 Tj
+-426 TJm
+(and) 17.9334 Tj
+-426 TJm
+(all) 17.9334 Tj
+98.488 580.124 Td
+(output) 35.8668 Tj
+-426 TJm
+(in) 11.9556 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-426 TJm
+(consu) 29.889 Tj
+1 TJm
+(med,) 23.9112 Tj
+-426 TJm
+(eg) 11.9556 Tj
+-426 TJm
+(s-->avail_out) 77.7114 Tj
+-426 TJm
+(>) 5.9778 Tj
+-426 TJm
+(0) 5.9778 Tj
+90 568.169 Td
+(BZ_OK) 29.889 Tj
+98.488 556.214 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 540.672] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -530.71] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 518.755 Td
+/F128_0 9.963 Tf
+(Allo) 17.7142 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-250 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-250 TJm
+(actions:) 30.9949 Tj
+[1 0 0 1 72 518.655] cm
+0 g
+0 G
+[1 0 0 1 0 -60.772] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 59.776 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 56.189] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -509.29] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 509.29 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+98.488 497.335 Td
+(if) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(returned) 47.8224 Tj
+90 485.38 Td
+(BZ2_bzDecompressEnd) 113.578 Tj
+98.488 473.425 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 457.883] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -447.92] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 427.262 Td
+/F121_0 17.215 Tf
+(3.3.6.) 43.0719 Tj
+[1 0 0 1 119.858 427.262] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -427.262] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 427.262 Td
+/F387_0 17.215 Tf
+(BZ2_bzDecompressEnd) 196.251 Tj
+[1 0 0 1 316.114 427.262] cm
+0 g
+0 G
+[1 0 0 1 -244.114 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -24.906] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 20.324] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -415.564] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 415.564 Td
+/F130_0 9.963 Tf
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzDecompressEnd) 113.578 Tj
+-426 TJm
+(\() 5.9778 Tj
+-425 TJm
+(bz_stream) 53.8002 Tj
+-426 TJm
+(*strm) 29.889 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 400.023] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -390.06] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 378.105 Td
+/F128_0 9.963 Tf
+(Releases) 34.8605 Tj
+-250 TJm
+(all) 9.963 Tj
+-250 TJm
+(memory) 33.2067 Tj
+-250 TJm
+(assoc) 21.5799 Tj
+1 TJm
+(iated) 19.3681 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(decompression) 59.768 Tj
+-250 TJm
+(stream.) 29.0521 Tj
+[1 0 0 1 72 375.948] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -365.985] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 356.187 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 356.087] cm
+0 g
+0 G
+[1 0 0 1 0 -60.772] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 59.776 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 56.189] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -346.723] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 346.723 Td
+/F130_0 9.963 Tf
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 334.767 Td
+(if) 11.9556 Tj
+-426 TJm
+(strm) 23.9112 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(strm-) 29.889 Tj
+1 TJm
+(>s) 11.9556 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+90 322.812 Td
+(BZ_OK) 29.889 Tj
+98.488 310.857 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 295.315] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -285.353] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 273.398 Td
+/F128_0 9.963 Tf
+(Allo) 17.7142 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-250 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-250 TJm
+(actions:) 30.9949 Tj
+[1 0 0 1 72 273.298] cm
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.324] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -263.933] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+98.488 263.933 Td
+/F130_0 9.963 Tf
+(None.) 29.889 Tj
+[1 0 0 1 72 248.391] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -238.429] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 213.639 Td
+/F121_0 20.659 Tf
+(3.4.) 34.4592 Tj
+-278 TJm
+(High-le) 70.0134 Tj
+15 TJm
+(vel) 28.716 Tj
+-278 TJm
+(interface) 86.1067 Tj
+[1 0 0 1 72 209.042] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -199.08] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 191.721 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-250 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace) 13.2707 Tj
+-250 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vides) 21.0319 Tj
+-250 TJm
+(funct) 20.474 Tj
+1 TJm
+(ions) 16.6083 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(reading) 29.879 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(writing) 28.7831 Tj
+[1 0 0 1 300.292 191.721] cm
+0 g
+0 G
+[1 0 0 1 -300.292 -191.721] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+300.292 191.721 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 330.18 191.721] cm
+0 g
+0 G
+[1 0 0 1 -330.18 -191.721] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+332.67 191.721 Td
+/F128_0 9.963 Tf
+(format) 26.5614 Tj
+-250 TJm
+(\002les.) 19.0991 Tj
+-620 TJm
+(First,) 20.7629 Tj
+-250 TJm
+(some) 21.0319 Tj
+-250 TJm
+(gen) 14.3866 Tj
+1 TJm
+(eral) 14.9345 Tj
+-250 TJm
+(points.) 26.8503 Tj
+[1 0 0 1 72 189.564] cm
+0 g
+0 G
+[1 0 0 1 0 -29.724] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -159.84] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 159.84 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 159.84] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -159.84] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 159.84 Td
+/F128_0 9.963 Tf
+(All) 12.7327 Tj
+-332 TJm
+(of) 8.29918 Tj
+-331 TJm
+(the) 12.1748 Tj
+-332 TJm
+(functions) 37.0823 Tj
+-331 TJm
+(tak) 12.1748 Tj
+10 TJm
+(e) 4.42357 Tj
+-332 TJm
+(an) 9.40507 Tj
+[1 0 0 1 202.958 159.84] cm
+0 g
+0 G
+[1 0 0 1 -202.958 -159.84] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+202.958 159.84 Td
+/F130_0 9.963 Tf
+(int*) 23.9112 Tj
+[1 0 0 1 226.868 159.84] cm
+0 g
+0 G
+[1 0 0 1 -226.868 -159.84] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+230.172 159.84 Td
+/F128_0 9.963 Tf
+(\002rst) 15.5024 Tj
+-332 TJm
+(ar) 7.74125 Tj
+18 TJm
+(gume) 22.1378 Tj
+1 TJm
+(nt,) 10.242 Tj
+[1 0 0 1 292.426 159.84] cm
+0 g
+0 G
+[1 0 0 1 -292.426 -159.84] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+292.426 159.84 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 334.269 159.84] cm
+0 g
+0 G
+[1 0 0 1 -334.269 -159.84] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+334.269 159.84 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1110 TJm
+(After) 21.0219 Tj
+-331 TJm
+(each) 18.2522 Tj
+-332 TJm
+(call,) 16.8773 Tj
+[1 0 0 1 414.083 159.84] cm
+0 g
+0 G
+[1 0 0 1 -414.083 -159.84] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+414.083 159.84 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 455.926 159.84] cm
+0 g
+0 G
+[1 0 0 1 -455.926 -159.84] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+459.23 159.84 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-332 TJm
+(be) 9.40507 Tj
+-331 TJm
+(consulted) 38.1882 Tj
+86.944 147.885 Td
+(\002rst) 15.5024 Tj
+-349 TJm
+(to) 7.75121 Tj
+-348 TJm
+(determine) 39.842 Tj
+-349 TJm
+(the) 12.1748 Tj
+-349 TJm
+(outcome) 34.3126 Tj
+-348 TJm
+(of) 8.29918 Tj
+-349 TJm
+(the) 12.1748 Tj
+-349 TJm
+(call.) 16.8773 Tj
+-1212 TJm
+(If) 6.63536 Tj
+[1 0 0 1 280.386 147.885] cm
+0 g
+0 G
+[1 0 0 1 -280.386 -147.885] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+280.386 147.885 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 322.229 147.885] cm
+0 g
+0 G
+[1 0 0 1 -322.229 -147.885] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+325.704 147.885 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+[1 0 0 1 335.823 147.885] cm
+0 g
+0 G
+[1 0 0 1 -335.823 -147.885] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+335.823 147.885 Td
+/F130_0 9.963 Tf
+(BZ_OK) 29.889 Tj
+[1 0 0 1 365.711 147.885] cm
+0 g
+0 G
+[1 0 0 1 -365.711 -147.885] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+365.711 147.885 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-349 TJm
+(the) 12.1748 Tj
+-349 TJm
+(c) 4.42357 Tj
+1 TJm
+(all) 9.963 Tj
+-349 TJm
+(completed) 41.5059 Tj
+-349 TJm
+(successfully) 48.6991 Tj
+65 TJm
+(,) 2.49075 Tj
+-373 TJm
+(and) 14.3866 Tj
+-349 TJm
+(only) 17.7142 Tj
+86.944 135.93 Td
+(then) 17.1563 Tj
+-271 TJm
+(s) 3.87561 Tj
+1 TJm
+(hould) 22.6957 Tj
+-271 TJm
+(the) 12.1748 Tj
+-271 TJm
+(re) 7.74125 Tj
+1 TJm
+(turn) 16.0504 Tj
+-271 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+-271 TJm
+(o) 4.9815 Tj
+1 TJm
+(f) 3.31768 Tj
+-271 TJm
+(the) 12.1748 Tj
+-271 TJm
+(functi) 23.2437 Tj
+1 TJm
+(on) 9.963 Tj
+-271 TJm
+(\(if) 9.40507 Tj
+-271 TJm
+(an) 9.40507 Tj
+15 TJm
+(y\)) 8.29918 Tj
+-270 TJm
+(be) 9.40507 Tj
+-271 TJm
+(consulted.) 40.6789 Tj
+-743 TJm
+(If) 6.63536 Tj
+[1 0 0 1 365.077 135.93] cm
+0 g
+0 G
+[1 0 0 1 -365.077 -135.93] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+365.077 135.93 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 406.92 135.93] cm
+0 g
+0 G
+[1 0 0 1 -406.92 -135.93] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+409.616 135.93 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+[1 0 0 1 418.956 135.93] cm
+0 g
+0 G
+[1 0 0 1 -418.956 -135.93] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+418.956 135.93 Td
+/F130_0 9.963 Tf
+(BZ_IO_ERROR) 65.7558 Tj
+[1 0 0 1 484.71 135.93] cm
+0 g
+0 G
+[1 0 0 1 -484.71 -135.93] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+484.71 135.93 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-271 TJm
+(ther) 15.4925 Tj
+1 TJm
+(e) 4.42357 Tj
+-271 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-271 TJm
+(an) 9.40507 Tj
+86.944 123.975 Td
+(error) 19.3581 Tj
+-246 TJm
+(read) 17.1463 Tj
+1 TJm
+(ing/writing) 44.2855 Tj
+-246 TJm
+(the) 12.1748 Tj
+-246 TJm
+(und) 14.9445 Tj
+1 TJm
+(erlying) 28.2252 Tj
+-246 TJm
+(compressed) 47.0353 Tj
+-245 TJm
+(\002le,) 15.2235 Tj
+-247 TJm
+(and) 14.3866 Tj
+-246 TJm
+(you) 14.9445 Tj
+-245 TJm
+(should) 26.5713 Tj
+-246 TJm
+(then) 17.1563 Tj
+-245 TJm
+(consult) 28.7831 Tj
+[1 0 0 1 414.096 123.975] cm
+0 g
+0 G
+[1 0 0 1 -414.096 -123.975] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+414.096 123.975 Td
+/F130_0 9.963 Tf
+(errno) 29.889 Tj
+[1 0 0 1 443.984 123.975] cm
+0 g
+0 G
+[1 0 0 1 -443.984 -123.975] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+446.432 123.975 Td
+/F128_0 9.963 Tf
+(/) 2.76971 Tj
+[1 0 0 1 451.649 123.975] cm
+0 g
+0 G
+[1 0 0 1 -451.649 -123.975] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+451.649 123.975 Td
+/F130_0 9.963 Tf
+(perror) 35.8668 Tj
+[1 0 0 1 487.514 123.975] cm
+0 g
+0 G
+[1 0 0 1 -487.514 -123.975] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+489.962 123.975 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-246 TJm
+(deter) 19.916 Tj
+1 TJm
+(mine) 19.926 Tj
+86.944 112.02 Td
+(the) 12.1748 Tj
+-356 TJm
+(cause) 22.1278 Tj
+-355 TJm
+(of) 8.29918 Tj
+-356 TJm
+(the) 12.1748 Tj
+-356 TJm
+(dif) 11.0689 Tj
+25 TJm
+(\002culty) 25.4654 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 206.528 112.02] cm
+0 g
+0 G
+[1 0 0 1 -206.528 -112.02] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+206.528 112.02 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 248.371 112.02] cm
+0 g
+0 G
+[1 0 0 1 -248.371 -112.02] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+251.916 112.02 Td
+/F128_0 9.963 Tf
+(may) 17.1563 Tj
+-356 TJm
+(also) 16.0504 Tj
+-355 TJm
+(be) 9.40507 Tj
+-356 TJm
+(set) 11.0689 Tj
+-356 TJm
+(to) 7.75121 Tj
+-356 TJm
+(v) 4.9815 Tj
+25 TJm
+(arious) 24.3496 Tj
+-355 TJm
+(other) 20.474 Tj
+-356 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues;) 23.2437 Tj
+-409 TJm
+(precise) 28.2152 Tj
+-356 TJm
+(d) 4.9815 Tj
+1 TJm
+(etails) 21.0319 Tj
+-356 TJm
+(are) 12.1648 Tj
+-356 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-356 TJm
+(on) 9.963 Tj
+-355 TJm
+(a) 4.42357 Tj
+86.944 100.064 Td
+(per) 12.7228 Tj
+20 TJm
+(-function) 36.5244 Tj
+-250 TJm
+(basis) 19.926 Tj
+-250 TJm
+(belo) 17.1563 Tj
+25 TJm
+(w) 7.19329 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 186.838 100.064] cm
+0 g
+0 G
+[1 0 0 1 -114.838 -49.212] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(18) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 22 22
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -31.517] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 710.037 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 710.037] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 710.037 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+[1 0 0 1 95.958 710.037] cm
+0 g
+0 G
+[1 0 0 1 -95.958 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.958 710.037 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 137.801 710.037] cm
+0 g
+0 G
+[1 0 0 1 -137.801 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+140.179 710.037 Td
+/F128_0 9.963 Tf
+(indicates) 35.4185 Tj
+-239 TJm
+(an) 9.40507 Tj
+-238 TJm
+(error) 19.3581 Tj
+-239 TJm
+(\(ie,) 13.0017 Tj
+-241 TJm
+(an) 9.40507 Tj
+15 TJm
+(ything) 25.4654 Tj
+-239 TJm
+(e) 4.42357 Tj
+15 TJm
+(x) 4.9815 Tj
+1 TJm
+(cept) 16.5984 Tj
+[1 0 0 1 292.225 710.037] cm
+0 g
+0 G
+[1 0 0 1 -292.225 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+292.225 710.037 Td
+/F130_0 9.963 Tf
+(BZ_OK) 29.889 Tj
+[1 0 0 1 322.113 710.037] cm
+0 g
+0 G
+[1 0 0 1 -322.113 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+324.492 710.037 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 341.257 710.037] cm
+0 g
+0 G
+[1 0 0 1 -341.257 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+341.257 710.037 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 418.965 710.037] cm
+0 g
+0 G
+[1 0 0 1 -418.965 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+418.965 710.037 Td
+/F128_0 9.963 Tf
+(\),) 5.80843 Tj
+-239 TJm
+(you) 14.9445 Tj
+-238 TJm
+(should) 26.5713 Tj
+-239 TJm
+(immediately) 49.815 Tj
+-239 TJm
+(cal) 11.6169 Tj
+1 TJm
+(l) 2.76971 Tj
+[1 0 0 1 86.944 698.082] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 698.082 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadClose) 89.667 Tj
+[1 0 0 1 176.608 698.082] cm
+0 g
+0 G
+[1 0 0 1 -176.608 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+179.343 698.082 Td
+/F128_0 9.963 Tf
+(\(or) 11.6169 Tj
+[1 0 0 1 193.695 698.082] cm
+0 g
+0 G
+[1 0 0 1 -193.695 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+193.695 698.082 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteClose) 95.6448 Tj
+[1 0 0 1 289.337 698.082] cm
+0 g
+0 G
+[1 0 0 1 -289.337 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+289.337 698.082 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-281 TJm
+(depending) 41.5059 Tj
+-274 TJm
+(on) 9.963 Tj
+-275 TJm
+(whethe) 28.7731 Tj
+1 TJm
+(r) 3.31768 Tj
+-275 TJm
+(you) 14.9445 Tj
+-275 TJm
+(are) 12.1648 Tj
+-274 TJm
+(attempting) 42.6217 Tj
+-274 TJm
+(to) 7.75121 Tj
+-275 TJm
+(read) 17.1463 Tj
+-274 TJm
+(or) 8.29918 Tj
+-275 TJm
+(to) 7.75121 Tj
+-275 TJm
+(writ) 16.0504 Tj
+1 TJm
+(e\)) 7.74125 Tj
+86.944 686.127 Td
+(to) 7.75121 Tj
+-242 TJm
+(free) 15.4825 Tj
+-241 TJm
+(up) 9.963 Tj
+-242 TJm
+(all) 9.963 Tj
+-242 TJm
+(resources) 37.6203 Tj
+-241 TJm
+(associated) 40.9479 Tj
+-242 TJm
+(with) 17.7142 Tj
+-242 TJm
+(the) 12.1748 Tj
+-241 TJm
+(stream.) 29.0521 Tj
+-615 TJm
+(Once) 21.0219 Tj
+-241 TJm
+(an) 9.40507 Tj
+-242 TJm
+(error) 19.3581 Tj
+-242 TJm
+(has) 13.2807 Tj
+-241 TJm
+(been) 18.8101 Tj
+-242 TJm
+(indicated,) 39.0151 Tj
+-243 TJm
+(beha) 18.8101 Tj
+20 TJm
+(viour) 21.0319 Tj
+-242 TJm
+(of) 8.29918 Tj
+-242 TJm
+(all) 9.963 Tj
+-241 TJm
+(calls) 18.2622 Tj
+-242 TJm
+(e) 4.42357 Tj
+15 TJm
+(xcept) 21.5799 Tj
+[1 0 0 1 86.944 674.172] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 674.172 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadClose) 89.667 Tj
+[1 0 0 1 176.608 674.172] cm
+0 g
+0 G
+[1 0 0 1 -176.608 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+179.705 674.172 Td
+/F128_0 9.963 Tf
+(\() 3.31768 Tj
+[1 0 0 1 183.022 674.172] cm
+0 g
+0 G
+[1 0 0 1 -183.022 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+183.022 674.172 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteClose) 95.6448 Tj
+[1 0 0 1 278.664 674.172] cm
+0 g
+0 G
+[1 0 0 1 -278.664 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+278.664 674.172 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-311 TJm
+(is) 6.64532 Tj
+-311 TJm
+(unde\002) 24.9075 Tj
+1 TJm
+(ned.) 16.8773 Tj
+-986 TJm
+(Th) 11.0689 Tj
+1 TJm
+(e) 4.42357 Tj
+-311 TJm
+(implication) 45.3914 Tj
+-311 TJm
+(is) 6.64532 Tj
+-311 TJm
+(that) 14.9445 Tj
+-311 TJm
+(\(1) 8.29918 Tj
+1 TJm
+(\)) 3.31768 Tj
+[1 0 0 1 455.988 674.172] cm
+0 g
+0 G
+[1 0 0 1 -455.988 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+455.988 674.172 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 497.831 674.172] cm
+0 g
+0 G
+[1 0 0 1 -497.831 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+500.928 674.172 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-311 TJm
+(be) 9.40507 Tj
+86.944 662.217 Td
+(check) 23.2337 Tj
+10 TJm
+(ed) 9.40507 Tj
+-291 TJm
+(after) 18.2522 Tj
+-291 TJm
+(each) 18.2522 Tj
+-291 TJm
+(call,) 16.8773 Tj
+-301 TJm
+(and) 14.3866 Tj
+-291 TJm
+(\(2\)) 11.6169 Tj
+-291 TJm
+(if) 6.08739 Tj
+[1 0 0 1 225.347 662.217] cm
+0 g
+0 G
+[1 0 0 1 -225.347 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+225.347 662.217 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 267.19 662.217] cm
+0 g
+0 G
+[1 0 0 1 -267.19 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+270.09 662.217 Td
+/F128_0 9.963 Tf
+(indicates) 35.4185 Tj
+-291 TJm
+(an) 9.40507 Tj
+-291 TJm
+(error) 19.3581 Tj
+40 TJm
+(,) 2.49075 Tj
+[1 0 0 1 345.161 662.217] cm
+0 g
+0 G
+[1 0 0 1 -345.161 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+345.161 662.217 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadClose) 89.667 Tj
+[1 0 0 1 434.824 662.217] cm
+0 g
+0 G
+[1 0 0 1 -434.824 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+437.724 662.217 Td
+/F128_0 9.963 Tf
+(\() 3.31768 Tj
+[1 0 0 1 441.041 662.217] cm
+0 g
+0 G
+[1 0 0 1 -441.041 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+441.041 662.217 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteClose) 95.6448 Tj
+[1 0 0 1 536.682 662.217] cm
+0 g
+0 G
+[1 0 0 1 -536.682 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+536.682 662.217 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+86.944 650.262 Td
+(should) 26.5713 Tj
+-250 TJm
+(then) 17.1563 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(called) 23.7916 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(clea) 16.0404 Tj
+1 TJm
+(n) 4.9815 Tj
+-250 TJm
+(up.) 12.4538 Tj
+[1 0 0 1 220.034 650.262] cm
+0 g
+0 G
+[1 0 0 1 -148.034 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -628.344] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 628.344 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 628.344] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -628.344] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 628.344 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+[1 0 0 1 106.362 628.344] cm
+0 g
+0 G
+[1 0 0 1 -106.362 -628.344] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+106.362 628.344 Td
+/F130_0 9.963 Tf
+(FILE*) 29.889 Tj
+[1 0 0 1 136.25 628.344] cm
+0 g
+0 G
+[1 0 0 1 -136.25 -628.344] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+140.177 628.344 Td
+/F128_0 9.963 Tf
+(ar) 7.74125 Tj
+18 TJm
+(guments) 33.7646 Tj
+-394 TJm
+(passed) 26.5614 Tj
+-394 TJm
+(to) 7.75121 Tj
+[1 0 0 1 227.592 628.344] cm
+0 g
+0 G
+[1 0 0 1 -227.592 -628.344] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+227.592 628.344 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadOpen) 83.6892 Tj
+[1 0 0 1 311.278 628.344] cm
+0 g
+0 G
+[1 0 0 1 -311.278 -628.344] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+315.205 628.344 Td
+/F128_0 9.963 Tf
+(/) 2.76971 Tj
+[1 0 0 1 321.901 628.344] cm
+0 g
+0 G
+[1 0 0 1 -321.901 -628.344] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+321.901 628.344 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteOpen) 89.667 Tj
+[1 0 0 1 411.565 628.344] cm
+0 g
+0 G
+[1 0 0 1 -411.565 -628.344] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+415.491 628.344 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-394 TJm
+(be) 9.40507 Tj
+-394 TJm
+(set) 11.0689 Tj
+-394 TJm
+(to) 7.75121 Tj
+-394 TJm
+(binary) 25.4555 Tj
+-394 TJm
+(mode.) 24.6285 Tj
+86.944 616.389 Td
+(Most) 20.4839 Tj
+-229 TJm
+(Unix) 19.926 Tj
+-229 TJm
+(s) 3.87561 Tj
+1 TJm
+(ystems) 27.6772 Tj
+-229 TJm
+(will) 15.5024 Tj
+-229 TJm
+(do) 9.963 Tj
+-229 TJm
+(this) 14.3965 Tj
+-229 TJm
+(by) 9.963 Tj
+-228 TJm
+(def) 12.7228 Tj
+10 TJm
+(ault,) 17.4353 Tj
+-233 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-229 TJm
+(other) 20.474 Tj
+-229 TJm
+(platforms,) 40.6789 Tj
+-233 TJm
+(including) 37.6402 Tj
+-228 TJm
+(W) 9.40507 Tj
+40 TJm
+(indo) 17.7142 Tj
+25 TJm
+(ws) 11.0689 Tj
+-229 TJm
+(and) 14.3866 Tj
+-229 TJm
+(Mac,) 20.195 Tj
+-233 TJm
+(will) 15.5024 Tj
+-229 TJm
+(not.) 15.2235 Tj
+-605 TJm
+(If) 6.63536 Tj
+-229 TJm
+(you) 14.9445 Tj
+-229 TJm
+(omit) 18.2721 Tj
+86.944 604.433 Td
+(this,) 16.8873 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(may) 17.1563 Tj
+-250 TJm
+(encounter) 39.2841 Tj
+-250 TJm
+(probl) 21.0319 Tj
+1 TJm
+(ems) 16.0504 Tj
+-250 TJm
+(when) 21.5799 Tj
+-250 TJm
+(mo) 12.7327 Tj
+15 TJm
+(ving) 17.7142 Tj
+-250 TJm
+(code) 18.8101 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(ne) 9.40507 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(platforms.) 40.6789 Tj
+[1 0 0 1 372.66 604.433] cm
+0 g
+0 G
+[1 0 0 1 -300.66 -21.917] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -582.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 582.516 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 582.516] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -582.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 582.516 Td
+/F128_0 9.963 Tf
+(Memory) 34.3126 Tj
+-348 TJm
+(allocation) 39.2941 Tj
+-348 TJm
+(requests) 32.6488 Tj
+-348 TJm
+(are) 12.1648 Tj
+-348 TJm
+(handled) 31.5429 Tj
+-348 TJm
+(by) 9.963 Tj
+[1 0 0 1 267.67 582.516] cm
+0 g
+0 G
+[1 0 0 1 -267.67 -582.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+267.67 582.516 Td
+/F130_0 9.963 Tf
+(malloc) 35.8668 Tj
+[1 0 0 1 303.535 582.516] cm
+0 g
+0 G
+[1 0 0 1 -303.535 -582.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+307.003 582.516 Td
+/F128_0 9.963 Tf
+(/) 2.76971 Tj
+[1 0 0 1 313.241 582.516] cm
+0 g
+0 G
+[1 0 0 1 -313.241 -582.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+313.241 582.516 Td
+/F130_0 9.963 Tf
+(free) 23.9112 Tj
+[1 0 0 1 337.151 582.516] cm
+0 g
+0 G
+[1 0 0 1 -337.151 -582.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+337.151 582.516 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1208 TJm
+(At) 9.963 Tj
+-349 TJm
+(pr) 8.29918 Tj
+1 TJm
+(esent) 20.474 Tj
+-348 TJm
+(there) 19.916 Tj
+-348 TJm
+(is) 6.64532 Tj
+-348 TJm
+(no) 9.963 Tj
+-349 TJm
+(f) 3.31768 Tj
+10 TJm
+(a) 4.42357 Tj
+1 TJm
+(cility) 20.4839 Tj
+-348 TJm
+(for) 11.6169 Tj
+-348 TJm
+(user) 16.5984 Tj
+20 TJm
+(-de\002ned) 32.6488 Tj
+86.944 570.56 Td
+(memory) 33.2067 Tj
+-250 TJm
+(allocators) 38.7361 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(\002l) 8.30914 Tj
+1 TJm
+(e) 4.42357 Tj
+-250 TJm
+(I/O) 13.2807 Tj
+-250 TJm
+(functions) 37.0823 Tj
+-250 TJm
+(\(could) 25.4555 Tj
+-250 TJm
+(easily) 23.2437 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(added,) 26.2824 Tj
+-250 TJm
+(though\).) 33.4856 Tj
+[1 0 0 1 387.165 570.56] cm
+0 g
+0 G
+[1 0 0 1 -315.165 -12.119] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -548.478] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 529.977 Td
+/F121_0 17.215 Tf
+(3.4.1.) 43.0719 Tj
+[1 0 0 1 119.858 529.977] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -529.977] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 529.977 Td
+/F387_0 17.215 Tf
+(BZ2_bzReadOpen) 144.606 Tj
+[1 0 0 1 264.468 529.977] cm
+0 g
+0 G
+[1 0 0 1 -192.468 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -72.727] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 71.731 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 68.145] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -518.279] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 518.279 Td
+/F130_0 9.963 Tf
+(typedef) 41.8446 Tj
+-426 TJm
+(void) 23.9112 Tj
+-426 TJm
+(BZFILE;) 41.8446 Tj
+90 494.369 Td
+(BZFILE) 35.8668 Tj
+-426 TJm
+(*BZ2_bzReadOpen\() 95.6448 Tj
+-426 TJm
+(i) 5.9778 Tj
+1 TJm
+(nt) 11.9556 Tj
+-426 TJm
+(*bzerror,) 53.8002 Tj
+-426 TJm
+(FILE) 23.9112 Tj
+-426 TJm
+(*f,) 17.9334 Tj
+191.855 482.414 Td
+(int) 17.9334 Tj
+-426 TJm
+(verbosity,) 59.778 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(small,) 35.8668 Tj
+191.855 470.458 Td
+(void) 23.9112 Tj
+-426 TJm
+(*unused,) 47.8224 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(nUnused) 41.8446 Tj
+-425 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 454.917] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -444.954] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 432.999 Td
+/F128_0 9.963 Tf
+(Prepare) 30.427 Tj
+-290 TJm
+(t) 2.76971 Tj
+1 TJm
+(o) 4.9815 Tj
+-290 TJm
+(read) 17.1463 Tj
+-290 TJm
+(compresse) 42.0538 Tj
+1 TJm
+(d) 4.9815 Tj
+-290 TJm
+(data) 16.5984 Tj
+-290 TJm
+(from) 19.3681 Tj
+-289 TJm
+(\002le) 12.7327 Tj
+-290 TJm
+(handle) 26.5614 Tj
+[1 0 0 1 272.697 432.999] cm
+0 g
+0 G
+[1 0 0 1 -272.697 -432.999] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+272.697 432.999 Td
+/F130_0 9.963 Tf
+(f) 5.9778 Tj
+[1 0 0 1 278.675 432.999] cm
+0 g
+0 G
+[1 0 0 1 -278.675 -432.999] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+278.675 432.999 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 285.439 432.999] cm
+0 g
+0 G
+[1 0 0 1 -285.439 -432.999] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+285.439 432.999 Td
+/F130_0 9.963 Tf
+(f) 5.9778 Tj
+[1 0 0 1 291.417 432.999] cm
+0 g
+0 G
+[1 0 0 1 -291.417 -432.999] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+294.302 432.999 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-290 TJm
+(refer) 18.8002 Tj
+-289 TJm
+(to) 7.75121 Tj
+-290 TJm
+(a) 4.42357 Tj
+-289 TJm
+(\002le) 12.7327 Tj
+-290 TJm
+(which) 24.3496 Tj
+-289 TJm
+(has) 13.2807 Tj
+-290 TJm
+(been) 18.8101 Tj
+-290 TJm
+(opened) 28.7731 Tj
+-289 TJm
+(for) 11.6169 Tj
+-290 TJm
+(reading,) 32.3698 Tj
+-299 TJm
+(and) 14.3866 Tj
+72 421.044 Td
+(for) 11.6169 Tj
+-306 TJm
+(which) 24.3496 Tj
+-305 TJm
+(the) 12.1748 Tj
+-306 TJm
+(error) 19.3581 Tj
+-305 TJm
+(indicator) 35.4185 Tj
+-306 TJm
+(\() 3.31768 Tj
+[1 0 0 1 193.457 421.044] cm
+0 g
+0 G
+[1 0 0 1 -193.457 -421.044] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+193.457 421.044 Td
+/F130_0 9.963 Tf
+(ferror\(f\)) 53.8002 Tj
+[1 0 0 1 247.255 421.044] cm
+0 g
+0 G
+[1 0 0 1 -247.255 -421.044] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+247.255 421.044 Td
+/F128_0 9.963 Tf
+(\)is) 9.963 Tj
+-306 TJm
+(not) 12.7327 Tj
+-305 TJm
+(set.) 13.5596 Tj
+-954 TJm
+(If) 6.63536 Tj
+[1 0 0 1 308.784 421.044] cm
+0 g
+0 G
+[1 0 0 1 -308.784 -421.044] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+308.784 421.044 Td
+/F130_0 9.963 Tf
+(small) 29.889 Tj
+[1 0 0 1 338.672 421.044] cm
+0 g
+0 G
+[1 0 0 1 -338.672 -421.044] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+341.717 421.044 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-306 TJm
+(1,) 7.47225 Tj
+-319 TJm
+(the) 12.1748 Tj
+-306 TJm
+(library) 26.5614 Tj
+-305 TJm
+(will) 15.5024 Tj
+-306 TJm
+(try) 11.0689 Tj
+-305 TJm
+(to) 7.75121 Tj
+-306 TJm
+(decompress) 47.0353 Tj
+-306 TJm
+(us) 8.85711 Tj
+1 TJm
+(ing) 12.7327 Tj
+-306 TJm
+(less) 14.9445 Tj
+72 409.089 Td
+(memory) 33.2067 Tj
+65 TJm
+(,) 2.49075 Tj
+-250 TJm
+(at) 7.19329 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(e) 4.42357 Tj
+15 TJm
+(xpense) 27.6673 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(spee) 17.7043 Tj
+1 TJm
+(d.) 7.47225 Tj
+[1 0 0 1 72 406.932] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -396.969] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 387.171 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-227 TJm
+(reasons) 29.879 Tj
+-227 TJm
+(e) 4.42357 Tj
+15 TJm
+(xplained) 34.3126 Tj
+-227 TJm
+(belo) 17.1563 Tj
+25 TJm
+(w) 7.19329 Tj
+65 TJm
+(,) 2.49075 Tj
+[1 0 0 1 189.193 387.171] cm
+0 g
+0 G
+[1 0 0 1 -189.193 -387.171] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+189.193 387.171 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 248.969 387.171] cm
+0 g
+0 G
+[1 0 0 1 -248.969 -387.171] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+251.232 387.171 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-227 TJm
+(decompress) 47.0353 Tj
+-227 TJm
+(the) 12.1748 Tj
+[1 0 0 1 332.732 387.171] cm
+0 g
+0 G
+[1 0 0 1 -332.732 -387.171] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+332.732 387.171 Td
+/F130_0 9.963 Tf
+(nUnused) 41.8446 Tj
+[1 0 0 1 374.575 387.171] cm
+0 g
+0 G
+[1 0 0 1 -374.575 -387.171] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+376.838 387.171 Td
+/F128_0 9.963 Tf
+(bytes) 21.0319 Tj
+-227 TJm
+(starting) 29.889 Tj
+-227 TJm
+(at) 7.19329 Tj
+[1 0 0 1 441.74 387.171] cm
+0 g
+0 G
+[1 0 0 1 -441.74 -387.171] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+441.74 387.171 Td
+/F130_0 9.963 Tf
+(unused) 35.8668 Tj
+[1 0 0 1 477.605 387.171] cm
+0 g
+0 G
+[1 0 0 1 -477.605 -387.171] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+477.605 387.171 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-232 TJm
+(before) 25.4455 Tj
+-227 TJm
+(starting) 29.889 Tj
+72 375.216 Td
+(to) 7.75121 Tj
+-279 TJm
+(read) 17.1463 Tj
+-280 TJm
+(from) 19.3681 Tj
+-279 TJm
+(the) 12.1748 Tj
+-280 TJm
+(\002le) 12.7327 Tj
+[1 0 0 1 155.094 375.216] cm
+0 g
+0 G
+[1 0 0 1 -155.094 -375.216] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+155.094 375.216 Td
+/F130_0 9.963 Tf
+(f) 5.9778 Tj
+[1 0 0 1 161.072 375.216] cm
+0 g
+0 G
+[1 0 0 1 -161.072 -375.216] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+161.072 375.216 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-797 TJm
+(At) 9.963 Tj
+-280 TJm
+(most) 19.378 Tj
+[1 0 0 1 206.414 375.216] cm
+0 g
+0 G
+[1 0 0 1 -206.414 -375.216] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+206.414 375.216 Td
+/F130_0 9.963 Tf
+(BZ_MAX_UNUSED) 77.7114 Tj
+[1 0 0 1 284.122 375.216] cm
+0 g
+0 G
+[1 0 0 1 -284.122 -375.216] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+286.907 375.216 Td
+/F128_0 9.963 Tf
+(bytes) 21.0319 Tj
+-279 TJm
+(may) 17.1563 Tj
+-280 TJm
+(be) 9.40507 Tj
+-279 TJm
+(supplied) 33.7646 Tj
+-280 TJm
+(lik) 10.5209 Tj
+10 TJm
+(e) 4.42357 Tj
+-279 TJm
+(this.) 16.8873 Tj
+-797 TJm
+(If) 6.63536 Tj
+-280 TJm
+(this) 14.3965 Tj
+-279 TJm
+(f) 3.31768 Tj
+10 TJm
+(acility) 24.9075 Tj
+-280 TJm
+(is) 6.64532 Tj
+-279 TJm
+(not) 12.7327 Tj
+-280 TJm
+(re) 7.74125 Tj
+1 TJm
+(quired,) 27.9462 Tj
+72 363.26 Td
+(you) 14.9445 Tj
+-250 TJm
+(should) 26.5713 Tj
+-250 TJm
+(pass) 17.1563 Tj
+[1 0 0 1 138.141 363.26] cm
+0 g
+0 G
+[1 0 0 1 -138.141 -363.26] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+138.141 363.26 Td
+/F130_0 9.963 Tf
+(NULL) 23.9112 Tj
+[1 0 0 1 162.052 363.26] cm
+0 g
+0 G
+[1 0 0 1 -162.052 -363.26] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+164.542 363.26 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 181.419 363.26] cm
+0 g
+0 G
+[1 0 0 1 -181.419 -363.26] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+181.419 363.26 Td
+/F130_0 9.963 Tf
+(0) 5.9778 Tj
+[1 0 0 1 187.397 363.26] cm
+0 g
+0 G
+[1 0 0 1 -187.397 -363.26] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+189.887 363.26 Td
+/F128_0 9.963 Tf
+(for) 11.6169 Tj
+[1 0 0 1 203.994 363.26] cm
+0 g
+0 G
+[1 0 0 1 -203.994 -363.26] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+203.994 363.26 Td
+/F130_0 9.963 Tf
+(unused) 35.8668 Tj
+[1 0 0 1 239.86 363.26] cm
+0 g
+0 G
+[1 0 0 1 -239.86 -363.26] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+242.351 363.26 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+-250 TJm
+(n) 4.9815 Tj
+[1 0 0 1 264.209 363.26] cm
+0 g
+0 G
+[1 0 0 1 -264.209 -363.26] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+264.209 363.26 Td
+/F130_0 9.963 Tf
+(Unused) 35.8668 Tj
+[1 0 0 1 300.074 363.26] cm
+0 g
+0 G
+[1 0 0 1 -300.074 -363.26] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+302.565 363.26 Td
+/F128_0 9.963 Tf
+(respecti) 30.9849 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ely) 12.1748 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 361.104] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -351.141] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 341.343 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(meaning) 34.3126 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(parameter) 39.8321 Tj
+1 TJm
+(s) 3.87561 Tj
+[1 0 0 1 196.631 341.343] cm
+0 g
+0 G
+[1 0 0 1 -196.631 -341.343] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+196.631 341.343 Td
+/F130_0 9.963 Tf
+(small) 29.889 Tj
+[1 0 0 1 226.519 341.343] cm
+0 g
+0 G
+[1 0 0 1 -226.519 -341.343] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+229.01 341.343 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 245.887 341.343] cm
+0 g
+0 G
+[1 0 0 1 -245.887 -341.343] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+245.887 341.343 Td
+/F130_0 9.963 Tf
+(verbosity) 53.8002 Tj
+[1 0 0 1 299.685 341.343] cm
+0 g
+0 G
+[1 0 0 1 -299.685 -341.343] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+299.685 341.343 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(see) 12.7228 Tj
+[1 0 0 1 319.879 341.343] cm
+0 g
+0 G
+[1 0 0 1 -319.879 -341.343] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+319.879 341.343 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompressInit) 119.556 Tj
+[1 0 0 1 439.431 341.343] cm
+0 g
+0 G
+[1 0 0 1 -439.431 -341.343] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+439.431 341.343 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 339.186] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -329.223] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 319.425 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-402 TJm
+(amount) 29.889 Tj
+-402 TJm
+(of) 8.29918 Tj
+-402 TJm
+(mem) 19.926 Tj
+1 TJm
+(ory) 13.2807 Tj
+-402 TJm
+(needed) 28.2152 Tj
+-402 TJm
+(to) 7.75121 Tj
+-402 TJm
+(decompress) 47.0353 Tj
+-402 TJm
+(a) 4.42357 Tj
+-402 TJm
+(\002le) 12.7327 Tj
+-402 TJm
+(c) 4.42357 Tj
+1 TJm
+(annot) 22.1378 Tj
+-402 TJm
+(be) 9.40507 Tj
+-402 TJm
+(determined) 44.8235 Tj
+-402 TJm
+(until) 18.2721 Tj
+-402 TJm
+(the) 12.1748 Tj
+-402 TJm
+(\002le') 16.0504 Tj
+55 TJm
+(s) 3.87561 Tj
+-401 TJm
+(header) 26.5514 Tj
+-402 TJm
+(has) 13.2807 Tj
+-402 TJm
+(been) 18.8101 Tj
+-402 TJm
+(read.) 19.6371 Tj
+72 307.47 Td
+(So) 10.5209 Tj
+-492 TJm
+(it) 5.53943 Tj
+-491 TJm
+(is) 6.64532 Tj
+-492 TJm
+(possible) 32.6587 Tj
+-491 TJm
+(that) 14.9445 Tj
+[1 0 0 1 166.797 307.47] cm
+0 g
+0 G
+[1 0 0 1 -166.797 -307.47] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+166.797 307.47 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadOpen) 83.6892 Tj
+[1 0 0 1 250.483 307.47] cm
+0 g
+0 G
+[1 0 0 1 -250.483 -307.47] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+255.381 307.47 Td
+/F128_0 9.963 Tf
+(returns) 27.6673 Tj
+[1 0 0 1 287.945 307.47] cm
+0 g
+0 G
+[1 0 0 1 -287.945 -307.47] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+287.945 307.47 Td
+/F130_0 9.963 Tf
+(BZ_OK) 29.889 Tj
+[1 0 0 1 317.833 307.47] cm
+0 g
+0 G
+[1 0 0 1 -317.833 -307.47] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+322.729 307.47 Td
+/F128_0 9.963 Tf
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-492 TJm
+(a) 4.42357 Tj
+-491 TJm
+(subsequent) 44.2756 Tj
+-492 TJm
+(call) 14.3866 Tj
+-491 TJm
+(of) 8.29918 Tj
+[1 0 0 1 431.135 307.47] cm
+0 g
+0 G
+[1 0 0 1 -431.135 -307.47] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+431.135 307.47 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 490.911 307.47] cm
+0 g
+0 G
+[1 0 0 1 -490.911 -307.47] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+495.81 307.47 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-492 TJm
+(re) 7.74125 Tj
+1 TJm
+(turn) 16.0504 Tj
+[1 0 0 1 72 295.514] cm
+0 g
+0 G
+[1 0 0 1 -72 -295.514] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 295.514 Td
+/F130_0 9.963 Tf
+(BZ_MEM_ERROR) 71.7336 Tj
+[1 0 0 1 143.731 295.514] cm
+0 g
+0 G
+[1 0 0 1 -143.731 -295.514] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+143.731 295.514 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 294.349] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -284.386] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 273.597 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(assignments) 48.7091 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 169.144 273.597] cm
+0 g
+0 G
+[1 0 0 1 -169.144 -273.597] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+169.144 273.597 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 210.987 273.597] cm
+0 g
+0 G
+[1 0 0 1 -210.987 -273.597] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.987 273.597 Td
+/F128_0 9.963 Tf
+(:) 2.76971 Tj
+[1 0 0 1 72 271.44] cm
+0 g
+0 G
+[1 0 0 1 0 -168.369] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 167.372 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 163.786] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -262.075] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 262.075 Td
+/F130_0 9.963 Tf
+(BZ_CONFIG_ERROR) 89.667 Tj
+98.488 250.12 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(library) 41.8446 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-425 TJm
+(mis-compiled) 71.7336 Tj
+90 238.165 Td
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 226.209 Td
+(if) 11.9556 Tj
+-426 TJm
+(f) 5.9778 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+98.488 214.254 Td
+(or) 11.9556 Tj
+-426 TJm
+(small) 29.889 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(neither) 41.8446 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(no) 11.9556 Tj
+1 TJm
+(r) 5.9778 Tj
+-426 TJm
+(1) 5.9778 Tj
+98.488 202.299 Td
+(or) 11.9556 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(unused) 35.8668 Tj
+-426 TJm
+(==) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(&&) 11.9556 Tj
+-426 TJm
+(n) 5.9778 Tj
+1 TJm
+(Unused) 35.8668 Tj
+-426 TJm
+(!=) 11.9556 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(\)) 5.9778 Tj
+98.488 190.344 Td
+(or) 11.9556 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(unused) 35.8668 Tj
+-426 TJm
+(!=) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(&&) 11.9556 Tj
+-426 TJm
+(!) 5.9778 Tj
+1 TJm
+(\(0) 11.9556 Tj
+-426 TJm
+(<=) 11.9556 Tj
+-426 TJm
+(nUnused) 41.8446 Tj
+-426 TJm
+(<=) 11.9556 Tj
+-426 TJm
+(BZ_MAX_UNUSED\)) 83.6892 Tj
+-426 TJm
+(\)) 5.9778 Tj
+90 178.389 Td
+(BZ_IO_ERROR) 65.7558 Tj
+98.488 166.434 Td
+(if) 11.9556 Tj
+-426 TJm
+(ferror\(f\)) 53.8002 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(nonzero) 41.8446 Tj
+90 154.478 Td
+(BZ_MEM_ERROR) 71.7336 Tj
+98.488 142.523 Td
+(if) 11.9556 Tj
+-426 TJm
+(insufficient) 71.7336 Tj
+-426 TJm
+(memory) 35.8668 Tj
+-426 TJm
+(is) 11.9556 Tj
+-425 TJm
+(available) 53.8002 Tj
+90 130.568 Td
+(BZ_OK) 29.889 Tj
+98.488 118.613 Td
+(otherwise.) 59.778 Tj
+[1 0 0 1 72 103.071] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -93.109] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 81.153 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 81.054] cm
+0 g
+0 G
+[1 0 0 1 0 -30.202] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.974] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -51.071] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 51.071 Td
+/F128_0 9.963 Tf
+(19) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 23 23
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -81.33] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 59.776 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 56.189] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(Pointer) 41.8446 Tj
+-426 TJm
+(to) 11.9556 Tj
+-426 TJm
+(an) 11.9556 Tj
+-426 TJm
+(abstract) 47.8224 Tj
+-426 TJm
+(B) 5.9778 Tj
+1 TJm
+(ZFILE) 29.889 Tj
+98.488 699.676 Td
+(if) 11.9556 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+90 687.721 Td
+(NULL) 23.9112 Tj
+98.488 675.766 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 660.224] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -650.261] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 638.306 Td
+/F128_0 9.963 Tf
+(Allo) 17.7142 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-250 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-250 TJm
+(actions:) 30.9949 Tj
+[1 0 0 1 72 638.207] cm
+0 g
+0 G
+[1 0 0 1 0 -60.772] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 59.776 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 56.19] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -628.842] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 628.842 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+98.488 616.887 Td
+(if) 11.9556 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+90 604.932 Td
+(BZ2_bzClose) 65.7558 Tj
+98.488 592.976 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 577.435] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.586] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -567.472] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 546.814 Td
+/F121_0 17.215 Tf
+(3.4.2.) 43.0719 Tj
+[1 0 0 1 119.858 546.814] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -546.814] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 546.814 Td
+/F387_0 17.215 Tf
+(BZ2_bzRead) 103.29 Tj
+[1 0 0 1 223.151 546.814] cm
+0 g
+0 G
+[1 0 0 1 -151.151 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.324] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -535.116] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 535.116 Td
+/F130_0 9.963 Tf
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzRead) 59.778 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(*bz) 17.9334 Tj
+1 TJm
+(error,) 35.8668 Tj
+-426 TJm
+(BZFILE) 35.8668 Tj
+-426 TJm
+(*b,) 17.9334 Tj
+-426 TJm
+(void) 23.9112 Tj
+-426 TJm
+(*buf,) 29.889 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(len) 17.9334 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 519.574] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -509.612] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 497.656 Td
+/F128_0 9.963 Tf
+(Reads) 24.3496 Tj
+-284 TJm
+(up) 9.963 Tj
+-285 TJm
+(to) 7.75121 Tj
+[1 0 0 1 122.569 497.656] cm
+0 g
+0 G
+[1 0 0 1 -122.569 -497.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+122.569 497.656 Td
+/F130_0 9.963 Tf
+(len) 17.9334 Tj
+[1 0 0 1 140.501 497.656] cm
+0 g
+0 G
+[1 0 0 1 -140.501 -497.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+143.337 497.656 Td
+/F128_0 9.963 Tf
+(\(uncompressed\)) 63.6337 Tj
+-284 TJm
+(bytes) 21.0319 Tj
+-285 TJm
+(from) 19.3681 Tj
+-284 TJm
+(the) 12.1748 Tj
+-285 TJm
+(compressed) 47.0353 Tj
+-284 TJm
+(\002le) 12.7327 Tj
+[1 0 0 1 336.319 497.656] cm
+0 g
+0 G
+[1 0 0 1 -336.319 -497.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+336.319 497.656 Td
+/F130_0 9.963 Tf
+(b) 5.9778 Tj
+[1 0 0 1 342.296 497.656] cm
+0 g
+0 G
+[1 0 0 1 -342.296 -497.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+345.132 497.656 Td
+/F128_0 9.963 Tf
+(into) 15.5024 Tj
+-285 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-285 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+[1 0 0 1 405.205 497.656] cm
+0 g
+0 G
+[1 0 0 1 -405.205 -497.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+405.205 497.656 Td
+/F130_0 9.963 Tf
+(buf) 17.9334 Tj
+[1 0 0 1 423.137 497.656] cm
+0 g
+0 G
+[1 0 0 1 -423.137 -497.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+423.137 497.656 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-828 TJm
+(If) 6.63536 Tj
+-284 TJm
+(the) 12.1748 Tj
+-285 TJm
+(read) 17.1463 Tj
+-284 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-285 TJm
+(successful,) 43.4387 Tj
+[1 0 0 1 72 485.701] cm
+0 g
+0 G
+[1 0 0 1 -72 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 485.701 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 113.843 485.701] cm
+0 g
+0 G
+[1 0 0 1 -113.843 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+117.36 485.701 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-353 TJm
+(set) 11.0689 Tj
+-353 TJm
+(to) 7.75121 Tj
+[1 0 0 1 153.374 485.701] cm
+0 g
+0 G
+[1 0 0 1 -153.374 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+153.374 485.701 Td
+/F130_0 9.963 Tf
+(BZ_OK) 29.889 Tj
+[1 0 0 1 183.262 485.701] cm
+0 g
+0 G
+[1 0 0 1 -183.262 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+186.778 485.701 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+-353 TJm
+(the) 12.1748 Tj
+-353 TJm
+(number) 30.437 Tj
+-353 TJm
+(of) 8.29918 Tj
+-353 TJm
+(bytes) 21.0319 Tj
+-353 TJm
+(read) 17.1463 Tj
+-352 TJm
+(is) 6.64532 Tj
+-353 TJm
+(returned.) 35.6875 Tj
+-1238 TJm
+(If) 6.63536 Tj
+-353 TJm
+(the) 12.1748 Tj
+-353 TJm
+(logical) 27.1193 Tj
+-353 TJm
+(end-of-stream) 55.8825 Tj
+-353 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-353 TJm
+(detecte) 28.2152 Tj
+1 TJm
+(d,) 7.47225 Tj
+[1 0 0 1 72 473.746] cm
+0 g
+0 G
+[1 0 0 1 -72 -473.746] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 473.746 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 113.843 473.746] cm
+0 g
+0 G
+[1 0 0 1 -113.843 -473.746] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+116.795 473.746 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-296 TJm
+(be) 9.40507 Tj
+-296 TJm
+(set) 11.0689 Tj
+-297 TJm
+(to) 7.75121 Tj
+[1 0 0 1 172.328 473.746] cm
+0 g
+0 G
+[1 0 0 1 -172.328 -473.746] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+172.328 473.746 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 250.037 473.746] cm
+0 g
+0 G
+[1 0 0 1 -250.037 -473.746] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+250.037 473.746 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-296 TJm
+(and) 14.3866 Tj
+-297 TJm
+(th) 7.75121 Tj
+1 TJm
+(e) 4.42357 Tj
+-297 TJm
+(number) 30.437 Tj
+-296 TJm
+(of) 8.29918 Tj
+-296 TJm
+(bytes) 21.0319 Tj
+-296 TJm
+(read) 17.1463 Tj
+-297 TJm
+(is) 6.64532 Tj
+-296 TJm
+(returned.) 35.6875 Tj
+-898 TJm
+(All) 12.7327 Tj
+-296 TJm
+(other) 20.474 Tj
+[1 0 0 1 470 473.746] cm
+0 g
+0 G
+[1 0 0 1 -470 -473.746] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+470 473.746 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 511.843 473.746] cm
+0 g
+0 G
+[1 0 0 1 -511.843 -473.746] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+514.795 473.746 Td
+/F128_0 9.963 Tf
+(v) 4.9815 Tj
+25 TJm
+(alues) 20.474 Tj
+72 461.791 Td
+(denote) 26.5614 Tj
+-250 TJm
+(an) 9.40507 Tj
+-250 TJm
+(error) 19.3581 Tj
+55 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 461.691] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -451.729] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 439.873 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 131.776 439.873] cm
+0 g
+0 G
+[1 0 0 1 -131.776 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+134.224 439.873 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-246 TJm
+(supply) 26.5713 Tj
+[1 0 0 1 181.193 439.873] cm
+0 g
+0 G
+[1 0 0 1 -181.193 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+181.193 439.873 Td
+/F130_0 9.963 Tf
+(len) 17.9334 Tj
+[1 0 0 1 199.126 439.873] cm
+0 g
+0 G
+[1 0 0 1 -199.126 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+201.575 439.873 Td
+/F128_0 9.963 Tf
+(bytes,) 23.5226 Tj
+-246 TJm
+(unless) 24.9075 Tj
+-246 TJm
+(the) 12.1748 Tj
+-246 TJm
+(logical) 27.1193 Tj
+-245 TJm
+(stream) 26.5614 Tj
+-246 TJm
+(end) 14.3866 Tj
+-246 TJm
+(is) 6.64532 Tj
+-246 TJm
+(detec) 21.0219 Tj
+1 TJm
+(ted) 12.1748 Tj
+-246 TJm
+(or) 8.29918 Tj
+-246 TJm
+(an) 9.40507 Tj
+-246 TJm
+(error) 19.3581 Tj
+-245 TJm
+(occurs.) 28.4942 Tj
+-617 TJm
+(Because) 33.1967 Tj
+-246 TJm
+(of) 8.29918 Tj
+-246 TJm
+(this,) 16.8873 Tj
+-246 TJm
+(it) 5.53943 Tj
+72 427.918 Td
+(is) 6.64532 Tj
+-231 TJm
+(possible) 32.6587 Tj
+-231 TJm
+(to) 7.75121 Tj
+-231 TJm
+(detect) 23.7916 Tj
+-231 TJm
+(the) 12.1748 Tj
+-231 TJm
+(stream) 26.5614 Tj
+-231 TJm
+(end) 14.3866 Tj
+-231 TJm
+(by) 9.963 Tj
+-231 TJm
+(observing) 39.2941 Tj
+-231 TJm
+(when) 21.5799 Tj
+-231 TJm
+(the) 12.1748 Tj
+-231 TJm
+(number) 30.437 Tj
+-231 TJm
+(of) 8.29918 Tj
+-231 TJm
+(bytes) 21.0319 Tj
+-231 TJm
+(returned) 33.1967 Tj
+-231 TJm
+(is) 6.64532 Tj
+-231 TJm
+(less) 14.9445 Tj
+-231 TJm
+(than) 17.1563 Tj
+-231 TJm
+(the) 12.1748 Tj
+-231 TJm
+(number) 30.437 Tj
+-231 TJm
+(requested.) 40.669 Tj
+72 415.963 Td
+(Ne) 11.6169 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ertheless,) 37.3513 Tj
+-309 TJm
+(this) 14.3965 Tj
+-297 TJm
+(is) 6.64532 Tj
+-297 TJm
+(re) 7.74125 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(arded) 22.1278 Tj
+-298 TJm
+(as) 8.29918 Tj
+-297 TJm
+(inadvisable;) 48.1512 Tj
+-321 TJm
+(you) 14.9445 Tj
+-297 TJm
+(should) 26.5713 Tj
+-297 TJm
+(instead) 28.2252 Tj
+-297 TJm
+(check) 23.2337 Tj
+[1 0 0 1 360.631 415.963] cm
+0 g
+0 G
+[1 0 0 1 -360.631 -415.963] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+360.631 415.963 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 402.475 415.963] cm
+0 g
+0 G
+[1 0 0 1 -402.475 -415.963] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+405.437 415.963 Td
+/F128_0 9.963 Tf
+(after) 18.2522 Tj
+-297 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ery) 12.7228 Tj
+-297 TJm
+(call) 14.3866 Tj
+-298 TJm
+(and) 14.3866 Tj
+-297 TJm
+(w) 7.19329 Tj
+10 TJm
+(atch) 16.5984 Tj
+-297 TJm
+(out) 12.7327 Tj
+-297 TJm
+(for) 11.6169 Tj
+[1 0 0 1 72 404.008] cm
+0 g
+0 G
+[1 0 0 1 -72 -404.008] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 404.008 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 149.709 404.008] cm
+0 g
+0 G
+[1 0 0 1 -149.709 -404.008] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+149.709 404.008 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 402.842] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -392.879] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 382.09 Td
+/F128_0 9.963 Tf
+(Internally) 38.7361 Tj
+65 TJm
+(,) 2.49075 Tj
+[1 0 0 1 117.541 382.09] cm
+0 g
+0 G
+[1 0 0 1 -117.541 -382.09] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+117.541 382.09 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 177.317 382.09] cm
+0 g
+0 G
+[1 0 0 1 -177.317 -382.09] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+181.786 382.09 Td
+/F128_0 9.963 Tf
+(copies) 25.4555 Tj
+-448 TJm
+(data) 16.5984 Tj
+-449 TJm
+(from) 19.3681 Tj
+-448 TJm
+(the) 12.1748 Tj
+-449 TJm
+(compressed) 47.0353 Tj
+-448 TJm
+(\002le) 12.7327 Tj
+-449 TJm
+(in) 7.75121 Tj
+-448 TJm
+(chunks) 28.2252 Tj
+-449 TJm
+(of) 8.29918 Tj
+-448 TJm
+(size) 15.4925 Tj
+[1 0 0 1 419.602 382.09] cm
+0 g
+0 G
+[1 0 0 1 -419.602 -382.09] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+419.602 382.09 Td
+/F130_0 9.963 Tf
+(BZ_MAX_UNUSED) 77.7114 Tj
+[1 0 0 1 497.311 382.09] cm
+0 g
+0 G
+[1 0 0 1 -497.311 -382.09] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+501.778 382.09 Td
+/F128_0 9.963 Tf
+(bytes) 21.0319 Tj
+-448 TJm
+(be-) 12.7228 Tj
+72 370.135 Td
+(fore) 16.0404 Tj
+-414 TJm
+(decompressing) 59.768 Tj
+-414 TJm
+(it.) 8.03018 Tj
+-1605 TJm
+(If) 6.63536 Tj
+-414 TJm
+(the) 12.1748 Tj
+-414 TJm
+(\002le) 12.7327 Tj
+-414 TJm
+(contains) 33.2067 Tj
+-414 TJm
+(more) 20.474 Tj
+-415 TJm
+(by) 9.963 Tj
+1 TJm
+(tes) 11.0689 Tj
+-415 TJm
+(than) 17.1563 Tj
+-414 TJm
+(strictly) 27.6772 Tj
+-414 TJm
+(needed) 28.2152 Tj
+-414 TJm
+(to) 7.75121 Tj
+-414 TJm
+(reach) 21.5699 Tj
+-414 TJm
+(the) 12.1748 Tj
+-414 TJm
+(logical) 27.1193 Tj
+-414 TJm
+(end-of-stream,) 58.3732 Tj
+[1 0 0 1 72 358.18] cm
+0 g
+0 G
+[1 0 0 1 -72 -358.18] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 358.18 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 131.776 358.18] cm
+0 g
+0 G
+[1 0 0 1 -131.776 -358.18] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+134.749 358.18 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-298 TJm
+(almost) 26.5713 Tj
+-299 TJm
+(certainly) 34.8605 Tj
+-298 TJm
+(read) 17.1463 Tj
+-298 TJm
+(some) 21.0319 Tj
+-299 TJm
+(of) 8.29918 Tj
+-298 TJm
+(the) 12.1748 Tj
+-299 TJm
+(t) 2.76971 Tj
+1 TJm
+(railing) 26.0134 Tj
+-299 TJm
+(data) 16.5984 Tj
+-298 TJm
+(before) 25.4455 Tj
+-299 TJm
+(s) 3.87561 Tj
+1 TJm
+(ignalling) 35.4284 Tj
+[1 0 0 1 413.162 358.18] cm
+0 g
+0 G
+[1 0 0 1 -413.162 -358.18] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+413.162 358.18 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_END) 89.667 Tj
+[1 0 0 1 502.826 358.18] cm
+0 g
+0 G
+[1 0 0 1 -502.826 -358.18] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+502.826 358.18 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-597 TJm
+(T) 6.08739 Tj
+80 TJm
+(o) 4.9815 Tj
+-298 TJm
+(col-) 15.4925 Tj
+72 346.224 Td
+(lect) 14.3866 Tj
+-242 TJm
+(the) 12.1748 Tj
+-242 TJm
+(read) 17.1463 Tj
+-242 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-242 TJm
+(unused) 28.2252 Tj
+-243 TJm
+(d) 4.9815 Tj
+1 TJm
+(ata) 11.6169 Tj
+-243 TJm
+(once) 18.8101 Tj
+[1 0 0 1 208.759 346.224] cm
+0 g
+0 G
+[1 0 0 1 -208.759 -346.224] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+208.759 346.224 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_END) 89.667 Tj
+[1 0 0 1 298.423 346.224] cm
+0 g
+0 G
+[1 0 0 1 -298.423 -346.224] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+300.835 346.224 Td
+/F128_0 9.963 Tf
+(has) 13.2807 Tj
+-242 TJm
+(appeared,) 38.4472 Tj
+-244 TJm
+(call) 14.3866 Tj
+[1 0 0 1 374.201 346.224] cm
+0 g
+0 G
+[1 0 0 1 -374.201 -346.224] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+374.201 346.224 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadGetUnused) 113.578 Tj
+[1 0 0 1 487.775 346.224] cm
+0 g
+0 G
+[1 0 0 1 -487.775 -346.224] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+490.188 346.224 Td
+/F128_0 9.963 Tf
+(immediately) 49.815 Tj
+72 334.269 Td
+(before) 25.4455 Tj
+[1 0 0 1 99.935 334.269] cm
+0 g
+0 G
+[1 0 0 1 -99.935 -334.269] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+99.935 334.269 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadClose) 89.667 Tj
+[1 0 0 1 189.599 334.269] cm
+0 g
+0 G
+[1 0 0 1 -189.599 -334.269] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+189.599 334.269 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 333.104] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -323.141] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 312.351 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(assignments) 48.7091 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 169.144 312.351] cm
+0 g
+0 G
+[1 0 0 1 -169.144 -312.351] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+169.144 312.351 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 210.987 312.351] cm
+0 g
+0 G
+[1 0 0 1 -210.987 -312.351] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.987 312.351 Td
+/F128_0 9.963 Tf
+(:) 2.76971 Tj
+[1 0 0 1 72 310.195] cm
+0 g
+0 G
+[1 0 0 1 0 -259.343] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(20) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 24 24
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -284.568] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 263.014 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 259.427] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 699.676 Td
+(if) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(buf) 17.9334 Tj
+-426 TJm
+(is) 11.9556 Tj
+-425 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(len) 17.9334 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(0) 5.9778 Tj
+90 687.721 Td
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+98.488 675.766 Td
+(if) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(opened) 35.8668 Tj
+-426 TJm
+(with) 23.9112 Tj
+-426 TJm
+(BZ2) 17.9334 Tj
+1 TJm
+(_bzWriteOpen) 71.7336 Tj
+90 663.811 Td
+(BZ_IO_ERROR) 65.7558 Tj
+98.488 651.856 Td
+(if) 11.9556 Tj
+-426 TJm
+(there) 29.889 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(an) 11.9556 Tj
+-426 TJm
+(error) 29.889 Tj
+-426 TJm
+(rea) 17.9334 Tj
+1 TJm
+(ding) 23.9112 Tj
+-426 TJm
+(from) 23.9112 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+-426 TJm
+(file) 23.9112 Tj
+90 639.9 Td
+(BZ_UNEXPECTED_EOF) 101.623 Tj
+98.488 627.945 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+-426 TJm
+(file) 23.9112 Tj
+-426 TJm
+(e) 5.9778 Tj
+1 TJm
+(nded) 23.9112 Tj
+-426 TJm
+(before) 35.8668 Tj
+98.488 615.99 Td
+(the) 17.9334 Tj
+-426 TJm
+(logical) 41.8446 Tj
+-426 TJm
+(end-of-stream) 77.7114 Tj
+-425 TJm
+(was) 17.9334 Tj
+-426 TJm
+(detected) 47.8224 Tj
+90 604.035 Td
+(BZ_DATA_ERROR) 77.7114 Tj
+98.488 592.08 Td
+(if) 11.9556 Tj
+-426 TJm
+(a) 5.9778 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(integrity) 53.8002 Tj
+-426 TJm
+(erro) 23.9112 Tj
+1 TJm
+(r) 5.9778 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(detected) 47.8224 Tj
+-426 TJm
+(in) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+-426 TJm
+(stream) 35.8668 Tj
+90 580.124 Td
+(BZ_DATA_ERROR_MAGIC) 113.578 Tj
+98.488 568.169 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(stream) 35.8668 Tj
+-426 TJm
+(does) 23.9112 Tj
+-426 TJm
+(not) 17.9334 Tj
+-426 TJm
+(b) 5.9778 Tj
+1 TJm
+(egin) 23.9112 Tj
+-426 TJm
+(with) 23.9112 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(requisite) 53.8002 Tj
+-426 TJm
+(header) 35.8668 Tj
+-426 TJm
+(bytes) 29.889 Tj
+98.488 556.214 Td
+(\(ie,) 23.9112 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(not) 17.9334 Tj
+-426 TJm
+(a) 5.9778 Tj
+-426 TJm
+(bzip2) 29.889 Tj
+-426 TJm
+(data) 23.9112 Tj
+-425 TJm
+(file\).) 35.8668 Tj
+-852 TJm
+(This) 23.9112 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(really) 35.8668 Tj
+98.488 544.259 Td
+(a) 5.9778 Tj
+-426 TJm
+(special) 41.8446 Tj
+-426 TJm
+(case) 23.9112 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(BZ_DAT) 35.8668 Tj
+1 TJm
+(A_ERROR.) 47.8224 Tj
+90 532.304 Td
+(BZ_MEM_ERROR) 71.7336 Tj
+98.488 520.349 Td
+(if) 11.9556 Tj
+-426 TJm
+(insufficient) 71.7336 Tj
+-426 TJm
+(memory) 35.8668 Tj
+-426 TJm
+(wa) 11.9556 Tj
+1 TJm
+(s) 5.9778 Tj
+-426 TJm
+(available) 53.8002 Tj
+90 508.393 Td
+(BZ_STREAM_END) 77.7114 Tj
+98.488 496.438 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(logical) 41.8446 Tj
+-426 TJm
+(end) 17.9334 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(st) 11.9556 Tj
+1 TJm
+(ream) 23.9112 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(detected.) 53.8002 Tj
+90 484.483 Td
+(BZ_OK) 29.889 Tj
+98.488 472.528 Td
+(otherwise.) 59.778 Tj
+[1 0 0 1 72 456.986] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -447.024] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 435.068 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 434.969] cm
+0 g
+0 G
+[1 0 0 1 0 -60.772] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 59.776 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 56.19] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -425.604] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 425.604 Td
+/F130_0 9.963 Tf
+(number) 35.8668 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(bytes) 29.889 Tj
+-426 TJm
+(read) 23.9112 Tj
+98.488 413.649 Td
+(if) 11.9556 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(B) 5.9778 Tj
+1 TJm
+(Z_STREAM_END) 71.7336 Tj
+90 401.694 Td
+(undefined) 53.8002 Tj
+98.488 389.739 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 374.197] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -364.234] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 352.279 Td
+/F128_0 9.963 Tf
+(Allo) 17.7142 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-250 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-250 TJm
+(actions:) 30.9949 Tj
+[1 0 0 1 72 352.179] cm
+0 g
+0 G
+[1 0 0 1 0 -84.682] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 83.686 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 80.099] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -342.815] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 342.815 Td
+/F130_0 9.963 Tf
+(collect) 41.8446 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(from) 23.9112 Tj
+-426 TJm
+(buf,) 23.9112 Tj
+-426 TJm
+(t) 5.9778 Tj
+1 TJm
+(hen) 17.9334 Tj
+-426 TJm
+(BZ2_bzRead) 59.778 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(BZ2_bzReadClose) 89.667 Tj
+98.488 330.859 Td
+(if) 11.9556 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+90 318.904 Td
+(collect) 41.8446 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(from) 23.9112 Tj
+-426 TJm
+(buf,) 23.9112 Tj
+-426 TJm
+(t) 5.9778 Tj
+1 TJm
+(hen) 17.9334 Tj
+-426 TJm
+(BZ2_bzReadClose) 89.667 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(BZ2_bzReadGetUnused) 113.578 Tj
+98.488 306.949 Td
+(if) 11.9556 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(BZ_SEQUENCE) 65.7558 Tj
+1 TJm
+(_END) 23.9112 Tj
+90 294.994 Td
+(BZ2_bzReadClose) 89.667 Tj
+98.488 283.039 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 267.497] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -257.534] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 236.876 Td
+/F121_0 17.215 Tf
+(3.4.3.) 43.0719 Tj
+[1 0 0 1 119.858 236.876] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -236.876] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 236.876 Td
+/F387_0 17.215 Tf
+(BZ2_bzReadGetUnused) 196.251 Tj
+[1 0 0 1 316.114 236.876] cm
+0 g
+0 G
+[1 0 0 1 -244.114 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -36.862] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 35.866 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 32.279] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -225.178] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 225.178 Td
+/F130_0 9.963 Tf
+(void) 23.9112 Tj
+-426 TJm
+(BZ2_bzReadGetUnused\() 119.556 Tj
+-425 TJm
+(int*) 23.9112 Tj
+-426 TJm
+(bzerror,) 47.8224 Tj
+-426 TJm
+(BZFILE) 35.8668 Tj
+-426 TJm
+(*b,) 17.9334 Tj
+200.343 213.223 Td
+(void**) 35.8668 Tj
+-426 TJm
+(unused,) 41.8446 Tj
+-426 TJm
+(int*) 23.9112 Tj
+-426 TJm
+(nUnuse) 35.8668 Tj
+1 TJm
+(d) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 197.681] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -187.719] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 175.764 Td
+/F128_0 9.963 Tf
+(Returns) 30.9949 Tj
+-435 TJm
+(data) 16.5984 Tj
+-435 TJm
+(which) 24.3496 Tj
+-435 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-435 TJm
+(rea) 12.1648 Tj
+1 TJm
+(d) 4.9815 Tj
+-435 TJm
+(from) 19.3681 Tj
+-435 TJm
+(the) 12.1748 Tj
+-435 TJm
+(compressed) 47.0353 Tj
+-435 TJm
+(\002le) 12.7327 Tj
+-435 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-435 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-435 TJm
+(not) 12.7327 Tj
+-435 TJm
+(needed) 28.2152 Tj
+-435 TJm
+(to) 7.75121 Tj
+-435 TJm
+(get) 12.1748 Tj
+-434 TJm
+(to) 7.75121 Tj
+-435 TJm
+(the) 12.1748 Tj
+-435 TJm
+(logical) 27.1193 Tj
+-435 TJm
+(end-of-stream.) 58.3732 Tj
+[1 0 0 1 72 163.808] cm
+0 g
+0 G
+[1 0 0 1 -72 -163.808] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 163.808 Td
+/F130_0 9.963 Tf
+(*unused) 41.8446 Tj
+[1 0 0 1 113.843 163.808] cm
+0 g
+0 G
+[1 0 0 1 -113.843 -163.808] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+117.2 163.808 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-337 TJm
+(set) 11.0689 Tj
+-337 TJm
+(to) 7.75121 Tj
+-337 TJm
+(the) 12.1748 Tj
+-336 TJm
+(address) 29.879 Tj
+-337 TJm
+(of) 8.29918 Tj
+-337 TJm
+(the) 12.1748 Tj
+-337 TJm
+(data,) 19.0891 Tj
+-359 TJm
+(a) 4.42357 Tj
+1 TJm
+(nd) 9.963 Tj
+[1 0 0 1 269.089 163.808] cm
+0 g
+0 G
+[1 0 0 1 -269.089 -163.808] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+269.089 163.808 Td
+/F130_0 9.963 Tf
+(*nUnused) 47.8224 Tj
+[1 0 0 1 316.91 163.808] cm
+0 g
+0 G
+[1 0 0 1 -316.91 -163.808] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+320.267 163.808 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-337 TJm
+(the) 12.1748 Tj
+-337 TJm
+(number) 30.437 Tj
+-337 TJm
+(o) 4.9815 Tj
+1 TJm
+(f) 3.31768 Tj
+-337 TJm
+(bytes.) 23.5226 Tj
+[1 0 0 1 427.247 163.808] cm
+0 g
+0 G
+[1 0 0 1 -427.247 -163.808] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+427.247 163.808 Td
+/F130_0 9.963 Tf
+(*nUnused) 47.8224 Tj
+[1 0 0 1 475.068 163.808] cm
+0 g
+0 G
+[1 0 0 1 -475.068 -163.808] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+478.425 163.808 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-337 TJm
+(be) 9.40507 Tj
+-337 TJm
+(set) 11.0689 Tj
+-337 TJm
+(to) 7.75121 Tj
+-336 TJm
+(a) 4.42357 Tj
+72 151.853 Td
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+-250 TJm
+(between) 33.1967 Tj
+[1 0 0 1 131.506 151.853] cm
+0 g
+0 G
+[1 0 0 1 -131.506 -151.853] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+131.506 151.853 Td
+/F130_0 9.963 Tf
+(0) 5.9778 Tj
+[1 0 0 1 137.484 151.853] cm
+0 g
+0 G
+[1 0 0 1 -137.484 -151.853] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+139.975 151.853 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 156.851 151.853] cm
+0 g
+0 G
+[1 0 0 1 -156.851 -151.853] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+156.851 151.853 Td
+/F130_0 9.963 Tf
+(BZ_MAX_UNUSED) 77.7114 Tj
+[1 0 0 1 234.56 151.853] cm
+0 g
+0 G
+[1 0 0 1 -234.56 -151.853] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+237.05 151.853 Td
+/F128_0 9.963 Tf
+(inclusi) 26.5713 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e.) 6.91432 Tj
+[1 0 0 1 72 150.688] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -140.725] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 129.936 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-882 TJm
+(function) 33.2067 Tj
+-883 TJm
+(may) 17.1563 Tj
+-882 TJm
+(only) 17.7142 Tj
+-882 TJm
+(be) 9.40507 Tj
+-883 TJm
+(called) 23.7916 Tj
+-882 TJm
+(once) 18.8101 Tj
+[1 0 0 1 271.332 129.936] cm
+0 g
+0 G
+[1 0 0 1 -271.332 -129.936] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+271.332 129.936 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 331.108 129.936] cm
+0 g
+0 G
+[1 0 0 1 -331.108 -129.936] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+339.9 129.936 Td
+/F128_0 9.963 Tf
+(has) 13.2807 Tj
+-882 TJm
+(signalled) 35.9764 Tj
+[1 0 0 1 406.737 129.936] cm
+0 g
+0 G
+[1 0 0 1 -406.737 -129.936] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+406.737 129.936 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 484.446 129.936] cm
+0 g
+0 G
+[1 0 0 1 -484.446 -129.936] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+493.231 129.936 Td
+/F128_0 9.963 Tf
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-882 TJm
+(before) 25.4455 Tj
+[1 0 0 1 72 117.98] cm
+0 g
+0 G
+[1 0 0 1 -72 -117.98] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 117.98 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadClose) 89.667 Tj
+[1 0 0 1 161.664 117.98] cm
+0 g
+0 G
+[1 0 0 1 -161.664 -117.98] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+161.664 117.98 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 116.815] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -106.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 96.063 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(assignments) 48.7091 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 169.144 96.063] cm
+0 g
+0 G
+[1 0 0 1 -169.144 -96.063] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+169.144 96.063 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 210.987 96.063] cm
+0 g
+0 G
+[1 0 0 1 -210.987 -96.063] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.987 96.063 Td
+/F128_0 9.963 Tf
+(:) 2.76971 Tj
+[1 0 0 1 72 93.906] cm
+0 g
+0 G
+[1 0 0 1 0 -43.054] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.754] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.754] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.852 Td
+/F128_0 9.963 Tf
+(21) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 25 25
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -129.151] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 107.597 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 104.01] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 699.676 Td
+(if) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+98.488 687.721 Td
+(or) 11.9556 Tj
+-426 TJm
+(unused) 35.8668 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(nUn) 17.9334 Tj
+1 TJm
+(used) 23.9112 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+90 675.766 Td
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+98.488 663.811 Td
+(if) 11.9556 Tj
+-426 TJm
+(BZ_STREAM_END) 77.7114 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(not) 17.9334 Tj
+-425 TJm
+(been) 23.9112 Tj
+-426 TJm
+(signalled) 53.8002 Tj
+98.488 651.856 Td
+(or) 11.9556 Tj
+-426 TJm
+(if) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(opened) 35.8668 Tj
+-426 TJm
+(with) 23.9112 Tj
+-425 TJm
+(BZ2_bzWriteOpen) 89.667 Tj
+90 639.9 Td
+(BZ_OK) 29.889 Tj
+98.488 627.945 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 612.403] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -602.441] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 590.486 Td
+/F128_0 9.963 Tf
+(Allo) 17.7142 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-250 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-250 TJm
+(actions:) 30.9949 Tj
+[1 0 0 1 72 590.386] cm
+0 g
+0 G
+[1 0 0 1 0 -24.906] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 20.324] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -581.021] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 581.021 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadClose) 89.667 Tj
+[1 0 0 1 72 565.48] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.586] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -555.517] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 534.858 Td
+/F121_0 17.215 Tf
+(3.4.4.) 43.0719 Tj
+[1 0 0 1 119.858 534.858] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -534.858] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 534.858 Td
+/F387_0 17.215 Tf
+(BZ2_bzReadClose) 154.935 Tj
+[1 0 0 1 274.797 534.858] cm
+0 g
+0 G
+[1 0 0 1 -202.797 -2.332] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.323] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -523.161] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 523.161 Td
+/F130_0 9.963 Tf
+(void) 23.9112 Tj
+-426 TJm
+(BZ2_bzReadClose) 89.667 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(in) 11.9556 Tj
+1 TJm
+(t) 5.9778 Tj
+-426 TJm
+(*bzerror,) 53.8002 Tj
+-426 TJm
+(BZFILE) 35.8668 Tj
+-426 TJm
+(*b) 11.9556 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 507.619] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -497.656] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 485.701 Td
+/F128_0 9.963 Tf
+(Releases) 34.8605 Tj
+-429 TJm
+(all) 9.963 Tj
+-430 TJm
+(memory) 33.2067 Tj
+-429 TJm
+(pertaining) 40.4 Tj
+-430 TJm
+(to) 7.75121 Tj
+-429 TJm
+(the) 12.1748 Tj
+-430 TJm
+(compressed) 47.0353 Tj
+-429 TJm
+(\002le) 12.7327 Tj
+[1 0 0 1 304.352 485.701] cm
+0 g
+0 G
+[1 0 0 1 -304.352 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+304.352 485.701 Td
+/F130_0 9.963 Tf
+(b) 5.9778 Tj
+[1 0 0 1 310.33 485.701] cm
+0 g
+0 G
+[1 0 0 1 -310.33 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+310.33 485.701 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 321.276 485.701] cm
+0 g
+0 G
+[1 0 0 1 -321.276 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+321.276 485.701 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadClose) 89.667 Tj
+[1 0 0 1 410.94 485.701] cm
+0 g
+0 G
+[1 0 0 1 -410.94 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+415.22 485.701 Td
+/F128_0 9.963 Tf
+(does) 18.2622 Tj
+-429 TJm
+(not) 12.7327 Tj
+-430 TJm
+(call) 14.3866 Tj
+[1 0 0 1 473.438 485.701] cm
+0 g
+0 G
+[1 0 0 1 -473.438 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+473.438 485.701 Td
+/F130_0 9.963 Tf
+(fclose) 35.8668 Tj
+[1 0 0 1 509.304 485.701] cm
+0 g
+0 G
+[1 0 0 1 -509.304 -485.701] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+513.583 485.701 Td
+/F128_0 9.963 Tf
+(on) 9.963 Tj
+-430 TJm
+(the) 12.1748 Tj
+72 473.746 Td
+(underlying) 43.1697 Tj
+-264 TJm
+(\002le) 12.7327 Tj
+-264 TJm
+(hand) 19.3681 Tj
+1 TJm
+(le,) 9.68404 Tj
+-268 TJm
+(so) 8.85711 Tj
+-264 TJm
+(you) 14.9445 Tj
+-264 TJm
+(sh) 8.85711 Tj
+1 TJm
+(ould) 17.7142 Tj
+-264 TJm
+(do) 9.963 Tj
+-264 TJm
+(that) 14.9445 Tj
+-264 TJm
+(yourself) 32.6488 Tj
+-264 TJm
+(if) 6.08739 Tj
+-264 TJm
+(appropri) 33.7546 Tj
+1 TJm
+(ate.) 14.1076 Tj
+[1 0 0 1 348.653 473.746] cm
+0 g
+0 G
+[1 0 0 1 -348.653 -473.746] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+348.653 473.746 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadClose) 89.667 Tj
+[1 0 0 1 438.317 473.746] cm
+0 g
+0 G
+[1 0 0 1 -438.317 -473.746] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+440.946 473.746 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-264 TJm
+(be) 9.40507 Tj
+-264 TJm
+(called) 23.7916 Tj
+-263 TJm
+(to) 7.75121 Tj
+-264 TJm
+(clean) 21.0219 Tj
+72 461.791 Td
+(up) 9.963 Tj
+-250 TJm
+(after) 18.2522 Tj
+-250 TJm
+(all) 9.963 Tj
+-250 TJm
+(error) 19.3581 Tj
+-250 TJm
+(situations.) 40.6889 Tj
+[1 0 0 1 72 459.634] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -449.671] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 439.873 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(assignments) 48.7091 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 169.144 439.873] cm
+0 g
+0 G
+[1 0 0 1 -169.144 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+169.144 439.873 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 210.987 439.873] cm
+0 g
+0 G
+[1 0 0 1 -210.987 -439.873] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.987 439.873 Td
+/F128_0 9.963 Tf
+(:) 2.76971 Tj
+[1 0 0 1 72 437.716] cm
+0 g
+0 G
+[1 0 0 1 0 -60.772] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 59.776 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 56.189] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -428.351] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 428.351 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+98.488 416.396 Td
+(if) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(opened) 35.8668 Tj
+-426 TJm
+(with) 23.9112 Tj
+-426 TJm
+(BZ2) 17.9334 Tj
+1 TJm
+(_bzOpenWrite) 71.7336 Tj
+90 404.441 Td
+(BZ_OK) 29.889 Tj
+98.488 392.486 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 376.944] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -366.982] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 355.026 Td
+/F128_0 9.963 Tf
+(Allo) 17.7142 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-250 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-250 TJm
+(actions:) 30.9949 Tj
+[1 0 0 1 72 354.927] cm
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.324] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -345.562] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 345.562 Td
+/F130_0 9.963 Tf
+(none) 23.9112 Tj
+[1 0 0 1 72 330.02] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -320.058] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 299.399 Td
+/F121_0 17.215 Tf
+(3.4.5.) 43.0719 Tj
+[1 0 0 1 119.858 299.399] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -299.399] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 299.399 Td
+/F387_0 17.215 Tf
+(BZ2_bzWriteOpen) 154.935 Tj
+[1 0 0 1 274.797 299.399] cm
+0 g
+0 G
+[1 0 0 1 -202.797 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -48.817] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 47.821 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 44.234] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -287.702] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 287.702 Td
+/F130_0 9.963 Tf
+(BZFILE) 35.8668 Tj
+-426 TJm
+(*BZ2_bzWriteOpen\() 101.623 Tj
+-425 TJm
+(int) 17.9334 Tj
+-426 TJm
+(*bzerror,) 53.8002 Tj
+-426 TJm
+(FILE) 23.9112 Tj
+-426 TJm
+(*f,) 17.9334 Tj
+196.099 275.746 Td
+(int) 17.9334 Tj
+-426 TJm
+(blockSize100k,) 83.6892 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(ver) 17.9334 Tj
+1 TJm
+(bosity,) 41.8446 Tj
+196.099 263.791 Td
+(int) 17.9334 Tj
+-426 TJm
+(workFactor) 59.778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 248.249] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -238.287] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 226.332 Td
+/F128_0 9.963 Tf
+(Prepare) 30.427 Tj
+-268 TJm
+(to) 7.75121 Tj
+-269 TJm
+(write) 20.474 Tj
+-268 TJm
+(compressed) 47.0353 Tj
+-268 TJm
+(data) 16.5984 Tj
+-269 TJm
+(to) 7.75121 Tj
+-268 TJm
+(\002le) 12.7327 Tj
+-269 TJm
+(hand) 19.3681 Tj
+1 TJm
+(le) 7.19329 Tj
+[1 0 0 1 262.72 226.332] cm
+0 g
+0 G
+[1 0 0 1 -262.72 -226.332] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+262.72 226.332 Td
+/F130_0 9.963 Tf
+(f) 5.9778 Tj
+[1 0 0 1 268.698 226.332] cm
+0 g
+0 G
+[1 0 0 1 -268.698 -226.332] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+268.698 226.332 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 274.829 226.332] cm
+0 g
+0 G
+[1 0 0 1 -274.829 -226.332] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+274.829 226.332 Td
+/F130_0 9.963 Tf
+(f) 5.9778 Tj
+[1 0 0 1 280.807 226.332] cm
+0 g
+0 G
+[1 0 0 1 -280.807 -226.332] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+283.481 226.332 Td
+/F128_0 9.963 Tf
+(should) 26.5713 Tj
+-268 TJm
+(refer) 18.8002 Tj
+-269 TJm
+(to) 7.75121 Tj
+-268 TJm
+(a) 4.42357 Tj
+-269 TJm
+(\002le) 12.7327 Tj
+-268 TJm
+(which) 24.3496 Tj
+-268 TJm
+(has) 13.2807 Tj
+-269 TJm
+(been) 18.8101 Tj
+-268 TJm
+(opened) 28.7731 Tj
+-269 TJm
+(f) 3.31768 Tj
+1 TJm
+(or) 8.29918 Tj
+-269 TJm
+(writing,) 31.2739 Tj
+-273 TJm
+(and) 14.3866 Tj
+-268 TJm
+(for) 11.6169 Tj
+72 214.377 Td
+(which) 24.3496 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(error) 19.3581 Tj
+-250 TJm
+(indicator) 35.4185 Tj
+-250 TJm
+(\() 3.31768 Tj
+[1 0 0 1 176.577 214.377] cm
+0 g
+0 G
+[1 0 0 1 -176.577 -214.377] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+176.577 214.377 Td
+/F130_0 9.963 Tf
+(ferror\(f\)) 53.8002 Tj
+[1 0 0 1 230.375 214.377] cm
+0 g
+0 G
+[1 0 0 1 -230.375 -214.377] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+230.375 214.377 Td
+/F128_0 9.963 Tf
+(\)is) 9.963 Tj
+-250 TJm
+(not) 12.7327 Tj
+-250 TJm
+(set.) 13.5596 Tj
+[1 0 0 1 72 212.593] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -202.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 192.459 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-223 TJm
+(the) 12.1748 Tj
+-224 TJm
+(meaning) 34.3126 Tj
+-223 TJm
+(of) 8.29918 Tj
+-223 TJm
+(parameters) 43.7077 Tj
+[1 0 0 1 195.306 192.459] cm
+0 g
+0 G
+[1 0 0 1 -195.306 -192.459] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+195.306 192.459 Td
+/F130_0 9.963 Tf
+(blockSize100k) 77.7114 Tj
+[1 0 0 1 273.015 192.459] cm
+0 g
+0 G
+[1 0 0 1 -273.015 -192.459] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+273.015 192.459 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 277.784 192.459] cm
+0 g
+0 G
+[1 0 0 1 -277.784 -192.459] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+277.784 192.459 Td
+/F130_0 9.963 Tf
+(verbosity) 53.8002 Tj
+[1 0 0 1 331.583 192.459] cm
+0 g
+0 G
+[1 0 0 1 -331.583 -192.459] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+333.808 192.459 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 350.42 192.459] cm
+0 g
+0 G
+[1 0 0 1 -350.42 -192.459] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+350.42 192.459 Td
+/F130_0 9.963 Tf
+(workFactor) 59.778 Tj
+[1 0 0 1 410.196 192.459] cm
+0 g
+0 G
+[1 0 0 1 -410.196 -192.459] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+410.196 192.459 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-229 TJm
+(see) 12.7228 Tj
+[1 0 0 1 429.913 192.459] cm
+0 g
+0 G
+[1 0 0 1 -429.913 -192.459] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+429.913 192.459 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 537.509 192.459] cm
+0 g
+0 G
+[1 0 0 1 -537.509 -192.459] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+537.509 192.459 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 190.302] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -180.339] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 170.541 Td
+/F128_0 9.963 Tf
+(All) 12.7327 Tj
+-382 TJm
+(required) 33.1967 Tj
+-382 TJm
+(memory) 33.2067 Tj
+-382 TJm
+(is) 6.64532 Tj
+-382 TJm
+(allocated) 35.9664 Tj
+-382 TJm
+(at) 7.19329 Tj
+-382 TJm
+(this) 14.3965 Tj
+-382 TJm
+(stage,) 22.9647 Tj
+-415 TJm
+(so) 8.85711 Tj
+-382 TJm
+(if) 6.08739 Tj
+-382 TJm
+(the) 12.1748 Tj
+-382 TJm
+(call) 14.3866 Tj
+-382 TJm
+(completes) 40.4 Tj
+-382 TJm
+(successfully) 48.6991 Tj
+65 TJm
+(,) 2.49075 Tj
+[1 0 0 1 424.692 170.541] cm
+0 g
+0 G
+[1 0 0 1 -424.692 -170.541] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+424.692 170.541 Td
+/F130_0 9.963 Tf
+(BZ_MEM_ERROR) 71.7336 Tj
+[1 0 0 1 496.423 170.541] cm
+0 g
+0 G
+[1 0 0 1 -496.423 -170.541] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+500.228 170.541 Td
+/F128_0 9.963 Tf
+(cannot) 26.5614 Tj
+-382 TJm
+(be) 9.40507 Tj
+72 158.586 Td
+(signalled) 35.9764 Tj
+-250 TJm
+(by) 9.963 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(subsequent) 44.2756 Tj
+-250 TJm
+(cal) 11.6169 Tj
+1 TJm
+(l) 2.76971 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 203.715 158.586] cm
+0 g
+0 G
+[1 0 0 1 -203.715 -158.586] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+203.715 158.586 Td
+/F130_0 9.963 Tf
+(BZ2_bzWrite) 65.7558 Tj
+[1 0 0 1 269.468 158.586] cm
+0 g
+0 G
+[1 0 0 1 -269.468 -158.586] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+269.468 158.586 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 156.429] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -146.466] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 136.668 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(assignments) 48.7091 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 169.144 136.668] cm
+0 g
+0 G
+[1 0 0 1 -169.144 -136.668] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+169.144 136.668 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 210.987 136.668] cm
+0 g
+0 G
+[1 0 0 1 -210.987 -136.668] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.987 136.668 Td
+/F128_0 9.963 Tf
+(:) 2.76971 Tj
+[1 0 0 1 72 134.511] cm
+0 g
+0 G
+[1 0 0 1 0 -83.659] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.754] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.754] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.852 Td
+/F128_0 9.963 Tf
+(22) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 26 26
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -165.016] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 143.462 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 139.875] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(BZ_CONFIG_ERROR) 89.667 Tj
+98.488 699.676 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(library) 41.8446 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-425 TJm
+(mis-compiled) 71.7336 Tj
+90 687.721 Td
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 675.766 Td
+(if) 11.9556 Tj
+-426 TJm
+(f) 5.9778 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+98.488 663.811 Td
+(or) 11.9556 Tj
+-426 TJm
+(blockSize100k) 77.7114 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(1) 5.9778 Tj
+-426 TJm
+(or) 11.9556 Tj
+-425 TJm
+(blockSize100k) 77.7114 Tj
+-426 TJm
+(>) 5.9778 Tj
+-426 TJm
+(9) 5.9778 Tj
+90 651.856 Td
+(BZ_IO_ERROR) 65.7558 Tj
+98.488 639.9 Td
+(if) 11.9556 Tj
+-426 TJm
+(ferror\(f\)) 53.8002 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(nonzero) 41.8446 Tj
+90 627.945 Td
+(BZ_MEM_ERROR) 71.7336 Tj
+98.488 615.99 Td
+(if) 11.9556 Tj
+-426 TJm
+(insufficient) 71.7336 Tj
+-426 TJm
+(memory) 35.8668 Tj
+-426 TJm
+(is) 11.9556 Tj
+-425 TJm
+(available) 53.8002 Tj
+90 604.035 Td
+(BZ_OK) 29.889 Tj
+98.488 592.08 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 576.538] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -566.575] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 554.62 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 554.521] cm
+0 g
+0 G
+[1 0 0 1 0 -60.772] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 59.776 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 56.189] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -545.156] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 545.156 Td
+/F130_0 9.963 Tf
+(Pointer) 41.8446 Tj
+-426 TJm
+(to) 11.9556 Tj
+-426 TJm
+(an) 11.9556 Tj
+-426 TJm
+(abstract) 47.8224 Tj
+-426 TJm
+(B) 5.9778 Tj
+1 TJm
+(ZFILE) 29.889 Tj
+98.488 533.201 Td
+(if) 11.9556 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+90 521.245 Td
+(NULL) 23.9112 Tj
+98.488 509.29 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 493.749] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -483.786] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 471.831 Td
+/F128_0 9.963 Tf
+(Allo) 17.7142 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able) 16.5984 Tj
+-250 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-250 TJm
+(actions:) 30.9949 Tj
+[1 0 0 1 72 471.731] cm
+0 g
+0 G
+[1 0 0 1 0 -84.682] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 83.686 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 80.1] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -462.366] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 462.366 Td
+/F130_0 9.963 Tf
+(BZ2_bzWrite) 65.7558 Tj
+98.488 450.411 Td
+(if) 11.9556 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+98.488 438.456 Td
+(\(you) 23.9112 Tj
+-426 TJm
+(could) 29.889 Tj
+-426 TJm
+(go) 11.9556 Tj
+-426 TJm
+(directly) 47.8224 Tj
+-426 TJm
+(t) 5.9778 Tj
+1 TJm
+(o) 5.9778 Tj
+-426 TJm
+(BZ2_bzWriteClose,) 101.623 Tj
+-426 TJm
+(but) 17.9334 Tj
+-426 TJm
+(this) 23.9112 Tj
+-426 TJm
+(would) 29.889 Tj
+-426 TJm
+(be) 11.9556 Tj
+-426 TJm
+(pretty) 35.8668 Tj
+485.506 434.212 Td
+/F559_0 9.963 Tf
+( ) 9.963 Tj
+493.808 434.212 Td
+/F143_0 9.963 Tf
+(-) 2.76971 Tj
+90 426.501 Td
+/F130_0 9.963 Tf
+(pointless\)) 59.778 Tj
+90 414.546 Td
+(BZ2_bzWriteClose) 95.6448 Tj
+98.488 402.59 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 387.049] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.586] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -377.086] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 356.428 Td
+/F121_0 17.215 Tf
+(3.4.6.) 43.0719 Tj
+[1 0 0 1 119.858 356.428] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -356.428] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 356.428 Td
+/F387_0 17.215 Tf
+(BZ2_bzWrite) 113.619 Tj
+[1 0 0 1 233.48 356.428] cm
+0 g
+0 G
+[1 0 0 1 -161.48 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.324] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -344.73] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 344.73 Td
+/F130_0 9.963 Tf
+(void) 23.9112 Tj
+-426 TJm
+(BZ2_bzWrite) 65.7558 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(*) 5.9778 Tj
+1 TJm
+(bzerror,) 47.8224 Tj
+-426 TJm
+(BZFILE) 35.8668 Tj
+-426 TJm
+(*b,) 17.9334 Tj
+-426 TJm
+(void) 23.9112 Tj
+-426 TJm
+(*buf,) 29.889 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(len) 17.9334 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 329.188] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -319.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 307.271 Td
+/F128_0 9.963 Tf
+(Absorbs) 33.2067 Tj
+[1 0 0 1 107.696 307.271] cm
+0 g
+0 G
+[1 0 0 1 -107.696 -307.271] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+107.696 307.271 Td
+/F130_0 9.963 Tf
+(len) 17.9334 Tj
+[1 0 0 1 125.629 307.271] cm
+0 g
+0 G
+[1 0 0 1 -125.629 -307.271] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+128.119 307.271 Td
+/F128_0 9.963 Tf
+(bytes) 21.0319 Tj
+-250 TJm
+(from) 19.3681 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+[1 0 0 1 214.544 307.271] cm
+0 g
+0 G
+[1 0 0 1 -214.544 -307.271] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+214.544 307.271 Td
+/F130_0 9.963 Tf
+(buf) 17.9334 Tj
+[1 0 0 1 232.477 307.271] cm
+0 g
+0 G
+[1 0 0 1 -232.477 -307.271] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+232.477 307.271 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(entually) 32.1008 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-249 TJm
+(and) 14.3866 Tj
+-250 TJm
+(written) 28.2252 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(\002le.) 15.2235 Tj
+[1 0 0 1 72 305.114] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -295.151] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 285.353 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(assignments) 48.7091 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 169.144 285.353] cm
+0 g
+0 G
+[1 0 0 1 -169.144 -285.353] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+169.144 285.353 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 210.987 285.353] cm
+0 g
+0 G
+[1 0 0 1 -210.987 -285.353] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.987 285.353 Td
+/F128_0 9.963 Tf
+(:) 2.76971 Tj
+[1 0 0 1 72 283.196] cm
+0 g
+0 G
+[1 0 0 1 0 -108.593] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 107.597 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 104.01] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -273.831] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 273.831 Td
+/F130_0 9.963 Tf
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 261.876 Td
+(if) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(buf) 17.9334 Tj
+-426 TJm
+(is) 11.9556 Tj
+-425 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(len) 17.9334 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(0) 5.9778 Tj
+90 249.921 Td
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+98.488 237.966 Td
+(if) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(opened) 35.8668 Tj
+-426 TJm
+(with) 23.9112 Tj
+-426 TJm
+(BZ2) 17.9334 Tj
+1 TJm
+(_bzReadOpen) 65.7558 Tj
+90 226.01 Td
+(BZ_IO_ERROR) 65.7558 Tj
+98.488 214.055 Td
+(if) 11.9556 Tj
+-426 TJm
+(there) 29.889 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(an) 11.9556 Tj
+-426 TJm
+(error) 29.889 Tj
+-426 TJm
+(wri) 17.9334 Tj
+1 TJm
+(ting) 23.9112 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+-426 TJm
+(file.) 29.889 Tj
+90 202.1 Td
+(BZ_OK) 29.889 Tj
+98.488 190.145 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 174.603] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -164.64] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 143.982 Td
+/F121_0 17.215 Tf
+(3.4.7.) 43.0719 Tj
+[1 0 0 1 119.858 143.982] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -143.982] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 143.982 Td
+/F387_0 17.215 Tf
+(BZ2_bzWriteClose) 165.264 Tj
+[1 0 0 1 285.126 143.982] cm
+0 g
+0 G
+[1 0 0 1 -213.126 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -90.797] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(23) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 27 27
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -165.016] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 143.462 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 139.875] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(void) 23.9112 Tj
+-426 TJm
+(BZ2_bzWriteClose\() 101.623 Tj
+-426 TJm
+(in) 11.9556 Tj
+1 TJm
+(t) 5.9778 Tj
+-426 TJm
+(*bzerror,) 53.8002 Tj
+-426 TJm
+(BZFILE*) 41.8446 Tj
+-426 TJm
+(f,) 11.9556 Tj
+187.611 699.676 Td
+(int) 17.9334 Tj
+-426 TJm
+(abandon,) 47.8224 Tj
+187.611 687.721 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int*) 23.9112 Tj
+-426 TJm
+(nbytes_in,) 59.778 Tj
+187.611 675.766 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int*) 23.9112 Tj
+-426 TJm
+(nbytes_out) 59.778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+90 651.856 Td
+(void) 23.9112 Tj
+-426 TJm
+(BZ2_bzWriteClose64\() 113.578 Tj
+-425 TJm
+(int) 17.9334 Tj
+-426 TJm
+(*bzerror,) 53.8002 Tj
+-426 TJm
+(BZFILE*) 41.8446 Tj
+-426 TJm
+(f,) 11.9556 Tj
+196.099 639.9 Td
+(int) 17.9334 Tj
+-426 TJm
+(abandon,) 47.8224 Tj
+196.099 627.945 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int*) 23.9112 Tj
+-426 TJm
+(nbytes_in_lo3) 77.7114 Tj
+1 TJm
+(2,) 11.9556 Tj
+196.099 615.99 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int*) 23.9112 Tj
+-426 TJm
+(nbytes_in_hi3) 77.7114 Tj
+1 TJm
+(2,) 11.9556 Tj
+196.099 604.035 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int*) 23.9112 Tj
+-426 TJm
+(nbytes_out_lo) 77.7114 Tj
+1 TJm
+(32,) 17.9334 Tj
+196.099 592.08 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int*) 23.9112 Tj
+-426 TJm
+(nbytes_out_hi) 77.7114 Tj
+1 TJm
+(32) 11.9556 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 576.538] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -566.575] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 554.62 Td
+/F128_0 9.963 Tf
+(Compresses) 48.1512 Tj
+-402 TJm
+(and) 14.3866 Tj
+-403 TJm
+(\003ushes) 27.6772 Tj
+-403 TJm
+(to) 7.75121 Tj
+-402 TJm
+(the) 12.1748 Tj
+-403 TJm
+(compressed) 47.0353 Tj
+-402 TJm
+(\002le) 12.7327 Tj
+-403 TJm
+(all) 9.963 Tj
+-402 TJm
+(data) 16.5984 Tj
+-403 TJm
+(so) 8.85711 Tj
+-403 TJm
+(f) 3.31768 Tj
+11 TJm
+(ar) 7.74125 Tj
+-403 TJm
+(supplied) 33.7646 Tj
+-403 TJm
+(by) 9.963 Tj
+[1 0 0 1 384.152 554.62] cm
+0 g
+0 G
+[1 0 0 1 -384.152 -554.62] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+384.152 554.62 Td
+/F130_0 9.963 Tf
+(BZ2_bzWrite) 65.7558 Tj
+[1 0 0 1 449.906 554.62] cm
+0 g
+0 G
+[1 0 0 1 -449.906 -554.62] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+449.906 554.62 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-768 TJm
+(The) 15.4925 Tj
+-402 TJm
+(logical) 27.1193 Tj
+-403 TJm
+(end-of-) 29.3211 Tj
+72 542.665 Td
+(stream) 26.5614 Tj
+-352 TJm
+(mark) 20.474 Tj
+10 TJm
+(ers) 11.6169 Tj
+-352 TJm
+(are) 12.1648 Tj
+-352 TJm
+(also) 16.0504 Tj
+-352 TJm
+(written,) 30.7159 Tj
+-378 TJm
+(so) 8.85711 Tj
+-352 TJm
+(subsequent) 44.2756 Tj
+-352 TJm
+(calls) 18.2622 Tj
+-352 TJm
+(to) 7.75121 Tj
+[1 0 0 1 300.456 542.665] cm
+0 g
+0 G
+[1 0 0 1 -300.456 -542.665] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+300.456 542.665 Td
+/F130_0 9.963 Tf
+(BZ2_bzWrite) 65.7558 Tj
+[1 0 0 1 366.209 542.665] cm
+0 g
+0 G
+[1 0 0 1 -366.209 -542.665] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+369.718 542.665 Td
+/F128_0 9.963 Tf
+(are) 12.1648 Tj
+-352 TJm
+(ille) 12.7327 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(al.) 9.68404 Tj
+-1233 TJm
+(All) 12.7327 Tj
+-352 TJm
+(memory) 33.2067 Tj
+-353 TJm
+(ass) 12.1748 Tj
+1 TJm
+(ociated) 28.7731 Tj
+-353 TJm
+(wit) 12.7327 Tj
+1 TJm
+(h) 4.9815 Tj
+72 530.71 Td
+(the) 12.1748 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+[1 0 0 1 151.411 530.71] cm
+0 g
+0 G
+[1 0 0 1 -151.411 -530.71] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+151.411 530.71 Td
+/F130_0 9.963 Tf
+(b) 5.9778 Tj
+[1 0 0 1 157.389 530.71] cm
+0 g
+0 G
+[1 0 0 1 -157.389 -530.71] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+159.88 530.71 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(released.) 35.1295 Tj
+[1 0 0 1 207.231 530.71] cm
+0 g
+0 G
+[1 0 0 1 -207.231 -530.71] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+207.231 530.71 Td
+/F130_0 9.963 Tf
+(fflush) 35.8668 Tj
+[1 0 0 1 243.097 530.71] cm
+0 g
+0 G
+[1 0 0 1 -243.097 -530.71] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+245.587 530.71 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(called) 23.7916 Tj
+-250 TJm
+(on) 9.963 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-250 TJm
+(\002l) 8.30914 Tj
+1 TJm
+(e,) 6.91432 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(it) 5.53943 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(not) 12.7327 Tj
+[1 0 0 1 422.771 530.71] cm
+0 g
+0 G
+[1 0 0 1 -422.771 -530.71] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+422.771 530.71 Td
+/F130_0 9.963 Tf
+(fclose) 35.8668 Tj
+[1 0 0 1 458.636 530.71] cm
+0 g
+0 G
+[1 0 0 1 -458.636 -530.71] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+458.636 530.71 Td
+/F128_0 9.963 Tf
+(') 3.31768 Tj
+50 TJm
+(d.) 7.47225 Tj
+[1 0 0 1 72 528.553] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -518.59] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 508.792 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+[1 0 0 1 81.574 508.792] cm
+0 g
+0 G
+[1 0 0 1 -81.574 -508.792] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+81.574 508.792 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteClose) 95.6448 Tj
+[1 0 0 1 177.216 508.792] cm
+0 g
+0 G
+[1 0 0 1 -177.216 -508.792] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+180.155 508.792 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-295 TJm
+(called) 23.7916 Tj
+-295 TJm
+(to) 7.75121 Tj
+-295 TJm
+(clean) 21.0219 Tj
+-295 TJm
+(up) 9.963 Tj
+-295 TJm
+(after) 18.2522 Tj
+-295 TJm
+(an) 9.40507 Tj
+-295 TJm
+(error) 19.3581 Tj
+40 TJm
+(,) 2.49075 Tj
+-306 TJm
+(the) 12.1748 Tj
+-295 TJm
+(only) 17.7142 Tj
+-295 TJm
+(action) 24.3496 Tj
+-295 TJm
+(is) 6.64532 Tj
+-295 TJm
+(to) 7.75121 Tj
+-295 TJm
+(relea) 19.3581 Tj
+1 TJm
+(se) 8.29918 Tj
+-295 TJm
+(the) 12.1748 Tj
+-295 TJm
+(memory) 33.2067 Tj
+65 TJm
+(.) 2.49075 Tj
+-890 TJm
+(The) 15.4925 Tj
+-295 TJm
+(library) 26.5614 Tj
+72 496.837 Td
+(records) 29.3211 Tj
+-289 TJm
+(the) 12.1748 Tj
+-289 TJm
+(error) 19.3581 Tj
+-289 TJm
+(codes) 22.6858 Tj
+-289 TJm
+(issued) 24.9075 Tj
+-289 TJm
+(by) 9.963 Tj
+-289 TJm
+(p) 4.9815 Tj
+1 TJm
+(re) 7.74125 Tj
+25 TJm
+(vious) 21.5898 Tj
+-289 TJm
+(calls,) 20.7529 Tj
+-299 TJm
+(so) 8.85711 Tj
+-289 TJm
+(this) 14.3965 Tj
+-289 TJm
+(situation) 34.3225 Tj
+-289 TJm
+(will) 15.5024 Tj
+-289 TJm
+(be) 9.40507 Tj
+-289 TJm
+(detecte) 28.2152 Tj
+1 TJm
+(d) 4.9815 Tj
+-289 TJm
+(automatically) 54.2386 Tj
+65 TJm
+(.) 2.49075 Tj
+-427 TJm
+(There) 23.2337 Tj
+-289 TJm
+(is) 6.64532 Tj
+-289 TJm
+(no) 9.963 Tj
+-289 TJm
+(attempt) 29.889 Tj
+72 484.882 Td
+(to) 7.75121 Tj
+-263 TJm
+(comple) 29.3311 Tj
+1 TJm
+(te) 7.19329 Tj
+-263 TJm
+(the) 12.1748 Tj
+-263 TJm
+(compression) 50.363 Tj
+-262 TJm
+(operation,) 40.121 Tj
+-266 TJm
+(nor) 13.2807 Tj
+-262 TJm
+(to) 7.75121 Tj
+[1 0 0 1 258.308 484.882] cm
+0 g
+0 G
+[1 0 0 1 -258.308 -484.882] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+258.308 484.882 Td
+/F130_0 9.963 Tf
+(fflush) 35.8668 Tj
+[1 0 0 1 294.173 484.882] cm
+0 g
+0 G
+[1 0 0 1 -294.173 -484.882] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+296.79 484.882 Td
+/F128_0 9.963 Tf
+(the) 12.1748 Tj
+-263 TJm
+(compres) 33.7546 Tj
+1 TJm
+(sed) 13.2807 Tj
+-263 TJm
+(\002le.) 15.2235 Tj
+-696 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-263 TJm
+(can) 13.8286 Tj
+-262 TJm
+(force) 20.464 Tj
+-263 TJm
+(this) 14.3965 Tj
+-262 TJm
+(beha) 18.8101 Tj
+20 TJm
+(viour) 21.0319 Tj
+-263 TJm
+(to) 7.75121 Tj
+-262 TJm
+(happen) 28.7731 Tj
+72 472.927 Td
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(case) 17.1463 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(no) 9.963 Tj
+-250 TJm
+(error) 19.3581 Tj
+40 TJm
+(,) 2.49075 Tj
+-250 TJm
+(by) 9.963 Tj
+-250 TJm
+(p) 4.9815 Tj
+1 TJm
+(assing) 24.9075 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(nonzero) 32.0908 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue) 16.5984 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 305.015 472.927] cm
+0 g
+0 G
+[1 0 0 1 -305.015 -472.927] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+305.015 472.927 Td
+/F130_0 9.963 Tf
+(abandon) 41.8446 Tj
+[1 0 0 1 346.858 472.927] cm
+0 g
+0 G
+[1 0 0 1 -346.858 -472.927] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+346.858 472.927 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 470.77] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -460.807] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 451.009 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+[1 0 0 1 80.597 451.009] cm
+0 g
+0 G
+[1 0 0 1 -80.597 -451.009] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+80.597 451.009 Td
+/F130_0 9.963 Tf
+(nbytes_in) 53.8002 Tj
+[1 0 0 1 134.396 451.009] cm
+0 g
+0 G
+[1 0 0 1 -134.396 -451.009] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+136.358 451.009 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-197 TJm
+(non-null,) 36.2554 Tj
+[1 0 0 1 183.287 451.009] cm
+0 g
+0 G
+[1 0 0 1 -183.287 -451.009] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+183.287 451.009 Td
+/F130_0 9.963 Tf
+(*nbytes_in) 59.778 Tj
+[1 0 0 1 243.063 451.009] cm
+0 g
+0 G
+[1 0 0 1 -243.063 -451.009] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+245.025 451.009 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-197 TJm
+(be) 9.40507 Tj
+-197 TJm
+(set) 11.0689 Tj
+-197 TJm
+(to) 7.75121 Tj
+-197 TJm
+(be) 9.40507 Tj
+-197 TJm
+(the) 12.1748 Tj
+-197 TJm
+(tot) 10.5209 Tj
+1 TJm
+(al) 7.19329 Tj
+-197 TJm
+(v) 4.9815 Tj
+20 TJm
+(olume) 24.9075 Tj
+-197 TJm
+(of) 8.29918 Tj
+-197 TJm
+(uncompressed) 56.9983 Tj
+-197 TJm
+(data) 16.5984 Tj
+-197 TJm
+(handled.) 34.0336 Tj
+-584 TJm
+(Similarly) 37.0922 Tj
+65 TJm
+(,) 2.49075 Tj
+[1 0 0 1 72 439.054] cm
+0 g
+0 G
+[1 0 0 1 -72 -439.054] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 439.054 Td
+/F130_0 9.963 Tf
+(nbytes_out) 59.778 Tj
+[1 0 0 1 131.776 439.054] cm
+0 g
+0 G
+[1 0 0 1 -131.776 -439.054] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+134.716 439.054 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-295 TJm
+(be) 9.40507 Tj
+-295 TJm
+(set) 11.0689 Tj
+-295 TJm
+(to) 7.75121 Tj
+-295 TJm
+(the) 12.1748 Tj
+-295 TJm
+(total) 17.7142 Tj
+-295 TJm
+(v) 4.9815 Tj
+20 TJm
+(olume) 24.9075 Tj
+-295 TJm
+(of) 8.29918 Tj
+-295 TJm
+(compressed) 47.0353 Tj
+-295 TJm
+(data) 16.5984 Tj
+-295 TJm
+(written.) 30.7159 Tj
+-890 TJm
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-295 TJm
+(compatibility) 53.1426 Tj
+-295 TJm
+(with) 17.7142 Tj
+-295 TJm
+(older) 20.474 Tj
+-295 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersions) 28.2252 Tj
+-295 TJm
+(of) 8.29918 Tj
+72 427.098 Td
+(the) 12.1748 Tj
+-283 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+[1 0 0 1 118.294 427.098] cm
+0 g
+0 G
+[1 0 0 1 -118.294 -427.098] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+118.294 427.098 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteClose) 95.6448 Tj
+[1 0 0 1 213.936 427.098] cm
+0 g
+0 G
+[1 0 0 1 -213.936 -427.098] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+216.753 427.098 Td
+/F128_0 9.963 Tf
+(only) 17.7142 Tj
+-283 TJm
+(yields) 23.8016 Tj
+-282 TJm
+(the) 12.1748 Tj
+-283 TJm
+(lo) 7.75121 Tj
+25 TJm
+(wer) 14.9345 Tj
+-283 TJm
+(32) 9.963 Tj
+-283 TJm
+(bits) 14.3965 Tj
+-282 TJm
+(of) 8.29918 Tj
+-283 TJm
+(these) 20.474 Tj
+-283 TJm
+(counts.) 28.5041 Tj
+-817 TJm
+(Use) 15.4925 Tj
+[1 0 0 1 423.499 427.098] cm
+0 g
+0 G
+[1 0 0 1 -423.499 -427.098] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+423.499 427.098 Td
+/F130_0 9.963 Tf
+(BZ2_bzWriteClose64) 107.6 Tj
+[1 0 0 1 531.095 427.098] cm
+0 g
+0 G
+[1 0 0 1 -531.095 -427.098] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+533.913 427.098 Td
+/F128_0 9.963 Tf
+(if) 6.08739 Tj
+72 415.143 Td
+(you) 14.9445 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(full) 13.8386 Tj
+-250 TJm
+(64) 9.963 Tj
+-250 TJm
+(bit) 10.5209 Tj
+-250 TJm
+(counts) 26.0134 Tj
+1 TJm
+(.) 2.49075 Tj
+-620 TJm
+(These) 23.7916 Tj
+-250 TJm
+(tw) 9.963 Tj
+10 TJm
+(o) 4.9815 Tj
+-250 TJm
+(functions) 37.0823 Tj
+-250 TJm
+(are) 12.1648 Tj
+-250 TJm
+(otherwise) 38.7361 Tj
+-250 TJm
+(absolutely) 40.9579 Tj
+-250 TJm
+(identic) 27.1193 Tj
+1 TJm
+(al.) 9.68404 Tj
+[1 0 0 1 72 412.986] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -403.024] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 393.225 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(assignments) 48.7091 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 169.144 393.225] cm
+0 g
+0 G
+[1 0 0 1 -169.144 -393.225] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+169.144 393.225 Td
+/F130_0 9.963 Tf
+(bzerror) 41.8446 Tj
+[1 0 0 1 210.987 393.225] cm
+0 g
+0 G
+[1 0 0 1 -210.987 -393.225] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.987 393.225 Td
+/F128_0 9.963 Tf
+(:) 2.76971 Tj
+[1 0 0 1 72 391.069] cm
+0 g
+0 G
+[1 0 0 1 0 -84.683] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 83.686 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 80.099] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -381.704] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 381.704 Td
+/F130_0 9.963 Tf
+(BZ_SEQUENCE_ERROR) 101.623 Tj
+98.488 369.749 Td
+(if) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(opened) 35.8668 Tj
+-426 TJm
+(with) 23.9112 Tj
+-426 TJm
+(BZ2) 17.9334 Tj
+1 TJm
+(_bzReadOpen) 65.7558 Tj
+90 357.793 Td
+(BZ_IO_ERROR) 65.7558 Tj
+98.488 345.838 Td
+(if) 11.9556 Tj
+-426 TJm
+(there) 29.889 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(an) 11.9556 Tj
+-426 TJm
+(error) 29.889 Tj
+-426 TJm
+(wri) 17.9334 Tj
+1 TJm
+(ting) 23.9112 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+-426 TJm
+(file) 23.9112 Tj
+90 333.883 Td
+(BZ_OK) 29.889 Tj
+98.488 321.928 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 306.386] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -296.423] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 275.765 Td
+/F121_0 17.215 Tf
+(3.4.8.) 43.0719 Tj
+-278 TJm
+(Handling) 73.6458 Tj
+-278 TJm
+(embed) 55.4839 Tj
+10 TJm
+(ded) 30.6083 Tj
+-278 TJm
+(compressed) 101.414 Tj
+-278 TJm
+(data) 35.394 Tj
+-278 TJm
+(streams) 66.0195 Tj
+[1 0 0 1 72 271.935] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -261.972] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 253.847 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-203 TJm
+(high-le) 28.2252 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-203 TJm
+(library) 26.5614 Tj
+-203 TJm
+(f) 3.31768 Tj
+10 TJm
+(acilitates) 35.4185 Tj
+-203 TJm
+(use) 13.2807 Tj
+-203 TJm
+(of) 8.29918 Tj
+[1 0 0 1 226.404 253.847] cm
+0 g
+0 G
+[1 0 0 1 -226.404 -253.847] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+226.404 253.847 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 256.292 253.847] cm
+0 g
+0 G
+[1 0 0 1 -256.292 -253.847] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+258.316 253.847 Td
+/F128_0 9.963 Tf
+(data) 16.5984 Tj
+-203 TJm
+(streams) 30.437 Tj
+-203 TJm
+(which) 24.3496 Tj
+-203 TJm
+(form) 19.3681 Tj
+-203 TJm
+(some) 21.0319 Tj
+-203 TJm
+(part) 15.4925 Tj
+-203 TJm
+(of) 8.29918 Tj
+-203 TJm
+(a) 4.42357 Tj
+-203 TJm
+(surrounding,) 50.6419 Tj
+-212 TJm
+(lar) 10.511 Tj
+18 TJm
+(ger) 12.7228 Tj
+-203 TJm
+(data) 16.5984 Tj
+-203 TJm
+(stream.) 29.0521 Tj
+[1 0 0 1 72 251.69] cm
+0 g
+0 G
+[1 0 0 1 0 -29.723] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -221.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 221.967 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 221.967] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -221.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 221.967 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-240 TJm
+(writing,) 31.2739 Tj
+-243 TJm
+(the) 12.1748 Tj
+-240 TJm
+(library) 26.5614 Tj
+-240 TJm
+(tak) 12.1748 Tj
+10 TJm
+(es) 8.29918 Tj
+-241 TJm
+(an) 9.40507 Tj
+-240 TJm
+(open) 19.3681 Tj
+-241 TJm
+(\002le) 12.7327 Tj
+-240 TJm
+(handle,) 29.0521 Tj
+-242 TJm
+(writes) 24.3496 Tj
+-241 TJm
+(compress) 37.6303 Tj
+1 TJm
+(ed) 9.40507 Tj
+-241 TJm
+(data) 16.5984 Tj
+-240 TJm
+(to) 7.75121 Tj
+-241 TJm
+(it,) 8.03018 Tj
+[1 0 0 1 398.926 221.967] cm
+0 g
+0 G
+[1 0 0 1 -398.926 -221.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+398.926 221.967 Td
+/F130_0 9.963 Tf
+(fflush) 35.8668 Tj
+[1 0 0 1 434.791 221.967] cm
+0 g
+0 G
+[1 0 0 1 -434.791 -221.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.791 221.967 Td
+/F128_0 9.963 Tf
+(es) 8.29918 Tj
+-240 TJm
+(it) 5.53943 Tj
+-241 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-240 TJm
+(does) 18.2622 Tj
+-241 TJm
+(not) 12.7327 Tj
+[1 0 0 1 504.135 221.967] cm
+0 g
+0 G
+[1 0 0 1 -504.135 -221.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+504.135 221.967 Td
+/F130_0 9.963 Tf
+(fclose) 35.8668 Tj
+[1 0 0 1 540 221.967] cm
+0 g
+0 G
+[1 0 0 1 -540 -221.967] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 210.012 Td
+/F128_0 9.963 Tf
+(it.) 8.03018 Tj
+-610 TJm
+(The) 15.4925 Tj
+-235 TJm
+(calling) 27.1193 Tj
+-235 TJm
+(application) 44.2756 Tj
+-234 TJm
+(can) 13.8286 Tj
+-235 TJm
+(write) 20.474 Tj
+-235 TJm
+(its) 9.41504 Tj
+-235 TJm
+(o) 4.9815 Tj
+25 TJm
+(wn) 12.1748 Tj
+-235 TJm
+(data) 16.5984 Tj
+-235 TJm
+(before) 25.4455 Tj
+-235 TJm
+(and) 14.3866 Tj
+-235 TJm
+(after) 18.2522 Tj
+-235 TJm
+(the) 12.1748 Tj
+-235 TJm
+(compressed) 47.0353 Tj
+-235 TJm
+(dat) 12.1748 Tj
+1 TJm
+(a) 4.42357 Tj
+-235 TJm
+(stream,) 29.0521 Tj
+-238 TJm
+(using) 21.5898 Tj
+-235 TJm
+(that) 14.9445 Tj
+-235 TJm
+(same) 20.474 Tj
+-235 TJm
+(\002le) 12.7327 Tj
+86.944 198.056 Td
+(handle.) 29.0521 Tj
+[1 0 0 1 115.995 198.056] cm
+0 g
+0 G
+[1 0 0 1 -43.995 -21.917] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -176.139] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 176.139 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 176.139] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -176.139] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 176.139 Td
+/F128_0 9.963 Tf
+(Reading) 33.2067 Tj
+-236 TJm
+(is) 6.64532 Tj
+-236 TJm
+(m) 7.75121 Tj
+1 TJm
+(ore) 12.7228 Tj
+-236 TJm
+(comple) 29.3311 Tj
+15 TJm
+(x,) 7.47225 Tj
+-239 TJm
+(and) 14.3866 Tj
+-236 TJm
+(the) 12.1748 Tj
+-235 TJm
+(f) 3.31768 Tj
+10 TJm
+(acilities) 30.9949 Tj
+-236 TJm
+(are) 12.1648 Tj
+-236 TJm
+(not) 12.7327 Tj
+-236 TJm
+(as) 8.29918 Tj
+-235 TJm
+(general) 29.3211 Tj
+-236 TJm
+(as) 8.29918 Tj
+-236 TJm
+(the) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-236 TJm
+(could) 22.1378 Tj
+-236 TJm
+(b) 4.9815 Tj
+1 TJm
+(e) 4.42357 Tj
+-236 TJm
+(since) 20.474 Tj
+-236 TJm
+(generality) 39.842 Tj
+-236 TJm
+(is) 6.64532 Tj
+-236 TJm
+(har) 12.7228 Tj
+1 TJm
+(d) 4.9815 Tj
+-236 TJm
+(to) 7.75121 Tj
+-236 TJm
+(reconcile) 36.5144 Tj
+86.944 164.183 Td
+(with) 17.7142 Tj
+-404 TJm
+(ef) 7.74125 Tj
+25 TJm
+(\002cienc) 26.5614 Tj
+15 TJm
+(y) 4.9815 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 164.811 164.183] cm
+0 g
+0 G
+[1 0 0 1 -164.811 -164.183] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+164.811 164.183 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 224.587 164.183] cm
+0 g
+0 G
+[1 0 0 1 -224.587 -164.183] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+228.614 164.183 Td
+/F128_0 9.963 Tf
+(reads) 21.0219 Tj
+-404 TJm
+(from) 19.3681 Tj
+-404 TJm
+(the) 12.1748 Tj
+-405 TJm
+(com) 17.1563 Tj
+1 TJm
+(pressed) 29.879 Tj
+-405 TJm
+(\002le) 12.7327 Tj
+-404 TJm
+(in) 7.75121 Tj
+-404 TJm
+(blocks) 26.0134 Tj
+-404 TJm
+(of) 8.29918 Tj
+-404 TJm
+(size) 15.4925 Tj
+[1 0 0 1 434.744 164.183] cm
+0 g
+0 G
+[1 0 0 1 -434.744 -164.183] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.744 164.183 Td
+/F130_0 9.963 Tf
+(BZ_MAX_UNUSED) 77.7114 Tj
+[1 0 0 1 512.452 164.183] cm
+0 g
+0 G
+[1 0 0 1 -512.452 -164.183] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+516.479 164.183 Td
+/F128_0 9.963 Tf
+(bytes,) 23.5226 Tj
+86.944 152.228 Td
+(and) 14.3866 Tj
+-413 TJm
+(in) 7.75121 Tj
+-413 TJm
+(doing) 22.6957 Tj
+-413 TJm
+(so) 8.85711 Tj
+-413 TJm
+(probably) 35.4185 Tj
+-413 TJm
+(wi) 9.963 Tj
+1 TJm
+(ll) 5.53943 Tj
+-413 TJm
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(ershoot) 29.3311 Tj
+-413 TJm
+(the) 12.1748 Tj
+-413 TJm
+(logical) 27.1193 Tj
+-413 TJm
+(end) 14.3866 Tj
+-413 TJm
+(of) 8.29918 Tj
+-413 TJm
+(compressed) 47.0353 Tj
+-413 TJm
+(stream.) 29.0521 Tj
+-1597 TJm
+(T) 6.08739 Tj
+80 TJm
+(o) 4.9815 Tj
+-413 TJm
+(reco) 17.1463 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-413 TJm
+(this) 14.3965 Tj
+-413 TJm
+(data) 16.5984 Tj
+-413 TJm
+(once) 18.8101 Tj
+86.944 140.273 Td
+(decompression) 59.768 Tj
+-252 TJm
+(has) 13.2807 Tj
+-252 TJm
+(ended,) 26.2824 Tj
+-252 TJm
+(call) 14.3866 Tj
+[1 0 0 1 210.705 140.273] cm
+0 g
+0 G
+[1 0 0 1 -210.705 -140.273] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.705 140.273 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadGetUnused) 113.578 Tj
+[1 0 0 1 324.279 140.273] cm
+0 g
+0 G
+[1 0 0 1 -324.279 -140.273] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+326.789 140.273 Td
+/F128_0 9.963 Tf
+(after) 18.2522 Tj
+-252 TJm
+(the) 12.1748 Tj
+-252 TJm
+(last) 13.8386 Tj
+-252 TJm
+(call) 14.3866 Tj
+-252 TJm
+(of) 8.29918 Tj
+[1 0 0 1 406.291 140.273] cm
+0 g
+0 G
+[1 0 0 1 -406.291 -140.273] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+406.291 140.273 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 466.067 140.273] cm
+0 g
+0 G
+[1 0 0 1 -466.067 -140.273] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+468.578 140.273 Td
+/F128_0 9.963 Tf
+(\(the) 15.4925 Tj
+-252 TJm
+(one) 14.3866 Tj
+-252 TJm
+(returning) 36.5244 Tj
+[1 0 0 1 86.944 128.318] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -128.318] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 128.318 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 164.653 128.318] cm
+0 g
+0 G
+[1 0 0 1 -164.653 -128.318] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+164.653 128.318 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(before) 25.4455 Tj
+-250 TJm
+(calling) 27.1193 Tj
+[1 0 0 1 243.028 128.318] cm
+0 g
+0 G
+[1 0 0 1 -243.028 -128.318] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+243.028 128.318 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadClose) 89.667 Tj
+[1 0 0 1 332.692 128.318] cm
+0 g
+0 G
+[1 0 0 1 -332.692 -128.318] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+332.692 128.318 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 335.182 128.318] cm
+0 g
+0 G
+[1 0 0 1 -263.182 -77.466] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.754] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.754] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.852] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.852 Td
+/F128_0 9.963 Tf
+(24) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 28 28
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-271 TJm
+(mechanism) 45.3815 Tj
+-271 TJm
+(mak) 17.1563 Tj
+10 TJm
+(es) 8.29918 Tj
+-272 TJm
+(i) 2.76971 Tj
+1 TJm
+(t) 2.76971 Tj
+-272 TJm
+(easy) 17.7043 Tj
+-271 TJm
+(to) 7.75121 Tj
+-271 TJm
+(decompress) 47.0353 Tj
+-271 TJm
+(multiple) 33.2166 Tj
+[1 0 0 1 293.313 710.037] cm
+0 g
+0 G
+[1 0 0 1 -293.313 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+293.313 710.037 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 323.2 710.037] cm
+0 g
+0 G
+[1 0 0 1 -323.2 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+325.903 710.037 Td
+/F128_0 9.963 Tf
+(streams) 30.437 Tj
+-271 TJm
+(placed) 26.0034 Tj
+-271 TJm
+(end-to-end.) 45.6505 Tj
+-374 TJm
+(As) 11.0689 Tj
+-271 TJm
+(the) 12.1748 Tj
+-272 TJm
+(end) 14.3866 Tj
+-271 TJm
+(of) 8.29918 Tj
+-271 TJm
+(one) 14.3866 Tj
+-271 TJm
+(stream,) 29.0521 Tj
+72 698.082 Td
+(when) 21.5799 Tj
+[1 0 0 1 96.195 698.082] cm
+0 g
+0 G
+[1 0 0 1 -96.195 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+96.195 698.082 Td
+/F130_0 9.963 Tf
+(BZ2_bzRead) 59.778 Tj
+[1 0 0 1 155.971 698.082] cm
+0 g
+0 G
+[1 0 0 1 -155.971 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+158.586 698.082 Td
+/F128_0 9.963 Tf
+(returns) 27.6673 Tj
+[1 0 0 1 188.868 698.082] cm
+0 g
+0 G
+[1 0 0 1 -188.868 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+188.868 698.082 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 266.577 698.082] cm
+0 g
+0 G
+[1 0 0 1 -266.577 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+266.577 698.082 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-263 TJm
+(c) 4.42357 Tj
+1 TJm
+(all) 9.963 Tj
+[1 0 0 1 288.685 698.082] cm
+0 g
+0 G
+[1 0 0 1 -288.685 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+288.685 698.082 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadGetUnused) 113.578 Tj
+[1 0 0 1 402.259 698.082] cm
+0 g
+0 G
+[1 0 0 1 -402.259 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+404.875 698.082 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-262 TJm
+(collect) 26.5614 Tj
+-263 TJm
+(the) 12.1748 Tj
+-262 TJm
+(unused) 28.2252 Tj
+-263 TJm
+(data) 16.5984 Tj
+-262 TJm
+(\(cop) 17.7043 Tj
+10 TJm
+(y) 4.9815 Tj
+-263 TJm
+(it) 5.53943 Tj
+72 686.127 Td
+(into) 15.5024 Tj
+-265 TJm
+(your) 18.2622 Tj
+-265 TJm
+(o) 4.9815 Tj
+25 TJm
+(wn) 12.1748 Tj
+-265 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-265 TJm
+(some) 21.0319 Tj
+25 TJm
+(where\).) 30.148 Tj
+-710 TJm
+(That) 18.2622 Tj
+-265 TJm
+(data) 16.5984 Tj
+-265 TJm
+(forms) 23.2437 Tj
+-265 TJm
+(the) 12.1748 Tj
+-265 TJm
+(start) 17.1563 Tj
+-265 TJm
+(of) 8.29918 Tj
+-265 TJm
+(the) 12.1748 Tj
+-265 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-265 TJm
+(compressed) 47.0353 Tj
+-265 TJm
+(stream.) 29.0521 Tj
+-710 TJm
+(T) 6.08739 Tj
+80 TJm
+(o) 4.9815 Tj
+-265 TJm
+(start) 17.1563 Tj
+-265 TJm
+(uncompressing) 60.326 Tj
+72 674.172 Td
+(that) 14.9445 Tj
+-246 TJm
+(ne) 9.40507 Tj
+15 TJm
+(xt) 7.75121 Tj
+-246 TJm
+(stream,) 29.0521 Tj
+-247 TJm
+(call) 14.3866 Tj
+[1 0 0 1 157.205 674.172] cm
+0 g
+0 G
+[1 0 0 1 -157.205 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+157.205 674.172 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadOpen) 83.6892 Tj
+[1 0 0 1 240.891 674.172] cm
+0 g
+0 G
+[1 0 0 1 -240.891 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+243.344 674.172 Td
+/F128_0 9.963 Tf
+(ag) 9.40507 Tj
+5 TJm
+(ain,) 14.6655 Tj
+-247 TJm
+(feeding) 29.879 Tj
+-246 TJm
+(in) 7.75121 Tj
+-246 TJm
+(the) 12.1748 Tj
+-246 TJm
+(unused) 28.2252 Tj
+-246 TJm
+(data) 16.5984 Tj
+-246 TJm
+(via) 12.1748 Tj
+-247 TJm
+(the) 12.1748 Tj
+[1 0 0 1 405.967 674.172] cm
+0 g
+0 G
+[1 0 0 1 -405.967 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+405.967 674.172 Td
+/F130_0 9.963 Tf
+(unused) 35.8668 Tj
+[1 0 0 1 441.833 674.172] cm
+0 g
+0 G
+[1 0 0 1 -441.833 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+444.286 674.172 Td
+/F128_0 9.963 Tf
+(/) 2.76971 Tj
+[1 0 0 1 449.508 674.172] cm
+0 g
+0 G
+[1 0 0 1 -449.508 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+449.508 674.172 Td
+/F130_0 9.963 Tf
+(nUnused) 41.8446 Tj
+[1 0 0 1 491.351 674.172] cm
+0 g
+0 G
+[1 0 0 1 -491.351 -674.172] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+493.804 674.172 Td
+/F128_0 9.963 Tf
+(parameters.) 46.1984 Tj
+72 662.217 Td
+(K) 7.19329 Tj
+25 TJm
+(eep) 13.8286 Tj
+-263 TJm
+(doing) 22.6957 Tj
+-263 TJm
+(this) 14.3965 Tj
+-263 TJm
+(until) 18.2721 Tj
+[1 0 0 1 158.622 662.217] cm
+0 g
+0 G
+[1 0 0 1 -158.622 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+158.622 662.217 Td
+/F130_0 9.963 Tf
+(BZ_STREAM_END) 77.7114 Tj
+[1 0 0 1 236.33 662.217] cm
+0 g
+0 G
+[1 0 0 1 -236.33 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+238.952 662.217 Td
+/F128_0 9.963 Tf
+(return) 23.7916 Tj
+-263 TJm
+(coincides) 37.6303 Tj
+-263 TJm
+(with) 17.7142 Tj
+-263 TJm
+(the) 12.1748 Tj
+-263 TJm
+(ph) 9.963 Tj
+5 TJm
+(ysical) 23.2437 Tj
+-263 TJm
+(end) 14.3866 Tj
+-263 TJm
+(of) 8.29918 Tj
+-264 TJm
+(\002le) 12.7327 Tj
+-263 TJm
+(\() 3.31768 Tj
+[1 0 0 1 423.125 662.217] cm
+0 g
+0 G
+[1 0 0 1 -423.125 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+423.125 662.217 Td
+/F130_0 9.963 Tf
+(feof\(f\)) 41.8446 Tj
+[1 0 0 1 464.968 662.217] cm
+0 g
+0 G
+[1 0 0 1 -464.968 -662.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+464.968 662.217 Td
+/F128_0 9.963 Tf
+(\).) 5.80843 Tj
+-699 TJm
+(In) 8.29918 Tj
+-263 TJm
+(this) 14.3965 Tj
+-263 TJm
+(situation) 34.3225 Tj
+[1 0 0 1 72 650.262] cm
+0 g
+0 G
+[1 0 0 1 -72 -650.262] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 650.262 Td
+/F130_0 9.963 Tf
+(BZ2_bzReadGetUnused) 113.578 Tj
+[1 0 0 1 185.574 650.262] cm
+0 g
+0 G
+[1 0 0 1 -185.574 -650.262] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+188.065 650.262 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(course) 26.0034 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(no) 9.963 Tj
+-250 TJm
+(data) 16.5984 Tj
+1 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 649.096] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -639.133] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 628.344 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-240 TJm
+(should) 26.5713 Tj
+-241 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-240 TJm
+(some) 21.0319 Tj
+-240 TJm
+(feel) 14.9345 Tj
+-241 TJm
+(for) 11.6169 Tj
+-240 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-240 TJm
+(the) 12.1748 Tj
+-241 TJm
+(high-le) 28.2252 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-240 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace) 13.2707 Tj
+-240 TJm
+(can) 13.8286 Tj
+-241 TJm
+(be) 9.40507 Tj
+-240 TJm
+(used.) 20.7529 Tj
+-614 TJm
+(If) 6.63536 Tj
+-240 TJm
+(you) 14.9445 Tj
+-240 TJm
+(require) 28.2152 Tj
+-241 TJm
+(e) 4.42357 Tj
+15 TJm
+(xtra) 15.4925 Tj
+-240 TJm
+(\003e) 9.963 Tj
+15 TJm
+(xibility) 28.7931 Tj
+65 TJm
+(,) 2.49075 Tj
+-242 TJm
+(you') 18.2622 Tj
+10 TJm
+(ll) 5.53943 Tj
+-241 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-240 TJm
+(to) 7.75121 Tj
+72 616.389 Td
+(bite) 14.9445 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ullet) 17.7142 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(get) 12.1748 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(grip) 16.0504 Tj
+1 TJm
+(s) 3.87561 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(lo) 7.75121 Tj
+25 TJm
+(w-le) 17.7043 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace.) 15.7615 Tj
+[1 0 0 1 72 614.232] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -604.269] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 585.767 Td
+/F121_0 17.215 Tf
+(3.4.9.) 43.0719 Tj
+-278 TJm
+(Standar) 64.0914 Tj
+20 TJm
+(d) 10.5184 Tj
+-278 TJm
+(\002le-reading/writing) 154.005 Tj
+-278 TJm
+(code) 40.1798 Tj
+[1 0 0 1 72 581.937] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -571.974] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 563.85 Td
+/F128_0 9.963 Tf
+(Here') 22.6758 Tj
+55 TJm
+(s) 3.87561 Tj
+-250 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(you') 18.2622 Tj
+50 TJm
+(d) 4.9815 Tj
+-250 TJm
+(write) 20.474 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(to) 7.75121 Tj
+-249 TJm
+(a) 4.42357 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-250 TJm
+(\002le:) 15.5024 Tj
+[1 0 0 1 72 561.693] cm
+0 g
+0 G
+[1 0 0 1 0 -371.607] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 370.61 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 367.023] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -552.328] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 552.328 Td
+/F130_0 9.963 Tf
+(FILE*) 29.889 Tj
+-1278 TJm
+(f;) 11.9556 Tj
+90 540.373 Td
+(BZFILE*) 41.8446 Tj
+-426 TJm
+(b;) 11.9556 Tj
+90 528.418 Td
+(int) 17.9334 Tj
+-2130 TJm
+(nBuf;) 29.889 Tj
+90 516.462 Td
+(char) 23.9112 Tj
+-1704 TJm
+(buf[) 23.9112 Tj
+-426 TJm
+(/*) 11.9556 Tj
+-426 TJm
+(whatever) 47.8224 Tj
+-425 TJm
+(size) 23.9112 Tj
+-426 TJm
+(you) 17.9334 Tj
+-426 TJm
+(like) 23.9112 Tj
+-426 TJm
+(*/) 11.9556 Tj
+-426 TJm
+(];) 11.9556 Tj
+90 504.507 Td
+(int) 17.9334 Tj
+-2130 TJm
+(bzerror;) 47.8224 Tj
+90 492.552 Td
+(int) 17.9334 Tj
+-2130 TJm
+(nWritten;) 53.8002 Tj
+90 468.642 Td
+(f) 5.9778 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(fopen) 29.889 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+("myfile.bz2") 71.7336 Tj
+1 TJm
+(,) 5.9778 Tj
+-426 TJm
+("w") 17.9334 Tj
+-426 TJm
+(\);) 11.9556 Tj
+90 456.687 Td
+(if) 11.9556 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(!f) 11.9556 Tj
+-426 TJm
+(\)) 5.9778 Tj
+-426 TJm
+({) 5.9778 Tj
+94.244 444.731 Td
+(/*) 11.9556 Tj
+-426 TJm
+(handle) 35.8668 Tj
+-426 TJm
+(error) 29.889 Tj
+-426 TJm
+(*/) 11.9556 Tj
+90 432.776 Td
+(}) 5.9778 Tj
+90 420.821 Td
+(b) 5.9778 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ2_bzWriteOpen\() 95.6448 Tj
+-426 TJm
+(&bze) 23.9112 Tj
+1 TJm
+(rror,) 29.889 Tj
+-426 TJm
+(f,) 11.9556 Tj
+-426 TJm
+(9) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+90 408.866 Td
+(if) 11.9556 Tj
+-426 TJm
+(\(bzerror) 47.8224 Tj
+-426 TJm
+(!=) 11.9556 Tj
+-426 TJm
+(BZ_OK\)) 35.8668 Tj
+-426 TJm
+({) 5.9778 Tj
+94.244 396.911 Td
+(BZ2_bzWriteClose) 95.6448 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+94.244 384.955 Td
+(/*) 11.9556 Tj
+-426 TJm
+(handle) 35.8668 Tj
+-426 TJm
+(error) 29.889 Tj
+-426 TJm
+(*/) 11.9556 Tj
+90 373 Td
+(}) 5.9778 Tj
+90 349.09 Td
+(while) 29.889 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(/*) 11.9556 Tj
+-426 TJm
+(condition) 53.8002 Tj
+-426 TJm
+(*/) 11.9556 Tj
+-425 TJm
+(\)) 5.9778 Tj
+-426 TJm
+({) 5.9778 Tj
+94.244 337.135 Td
+(/*) 11.9556 Tj
+-426 TJm
+(get) 17.9334 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(to) 11.9556 Tj
+-426 TJm
+(write) 29.889 Tj
+-426 TJm
+(int) 17.9334 Tj
+1 TJm
+(o) 5.9778 Tj
+-426 TJm
+(buf,) 23.9112 Tj
+-426 TJm
+(and) 17.9334 Tj
+-426 TJm
+(set) 17.9334 Tj
+-426 TJm
+(nBuf) 23.9112 Tj
+-426 TJm
+(appropriately) 77.7114 Tj
+-426 TJm
+(*/) 11.9556 Tj
+94.244 325.18 Td
+(nWritten) 47.8224 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ2_bzWrite) 65.7558 Tj
+-426 TJm
+(\() 5.9778 Tj
+-425 TJm
+(&bzerror,) 53.8002 Tj
+-426 TJm
+(b,) 11.9556 Tj
+-426 TJm
+(buf,) 23.9112 Tj
+-426 TJm
+(nBuf) 23.9112 Tj
+-426 TJm
+(\);) 11.9556 Tj
+94.244 313.224 Td
+(if) 11.9556 Tj
+-426 TJm
+(\(bzerror) 47.8224 Tj
+-426 TJm
+(==) 11.9556 Tj
+-426 TJm
+(BZ_IO_ERRO) 59.778 Tj
+1 TJm
+(R\)) 11.9556 Tj
+-426 TJm
+({) 5.9778 Tj
+102.732 301.269 Td
+(BZ2_bzWriteClose) 95.6448 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(&bzerr) 35.8668 Tj
+1 TJm
+(or,) 17.9334 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+102.732 289.314 Td
+(/*) 11.9556 Tj
+-426 TJm
+(handle) 35.8668 Tj
+-426 TJm
+(error) 29.889 Tj
+-426 TJm
+(*/) 11.9556 Tj
+94.244 277.359 Td
+(}) 5.9778 Tj
+90 265.404 Td
+(}) 5.9778 Tj
+90 241.493 Td
+(BZ2_bzWriteClose\() 101.623 Tj
+-426 TJm
+(&bzerro) 41.8446 Tj
+1 TJm
+(r,) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+90 229.538 Td
+(if) 11.9556 Tj
+-426 TJm
+(\(bzerror) 47.8224 Tj
+-426 TJm
+(==) 11.9556 Tj
+-426 TJm
+(BZ_IO_ERRO) 59.778 Tj
+1 TJm
+(R\)) 11.9556 Tj
+-426 TJm
+({) 5.9778 Tj
+94.244 217.583 Td
+(/*) 11.9556 Tj
+-426 TJm
+(handle) 35.8668 Tj
+-426 TJm
+(error) 29.889 Tj
+-426 TJm
+(*/) 11.9556 Tj
+90 205.628 Td
+(}) 5.9778 Tj
+[1 0 0 1 72 190.086] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -180.124] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 168.168 Td
+/F128_0 9.963 Tf
+(And) 17.1563 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(read) 17.1463 Tj
+-250 TJm
+(from) 19.3681 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(compresse) 42.0538 Tj
+1 TJm
+(d) 4.9815 Tj
+-250 TJm
+(\002le:) 15.5024 Tj
+[1 0 0 1 72 166.012] cm
+0 g
+0 G
+[1 0 0 1 0 -115.16] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(25) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 29 29
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -392.164] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 370.61 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 367.024] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(FILE*) 29.889 Tj
+-1278 TJm
+(f;) 11.9556 Tj
+90 699.676 Td
+(BZFILE*) 41.8446 Tj
+-426 TJm
+(b;) 11.9556 Tj
+90 687.721 Td
+(int) 17.9334 Tj
+-2130 TJm
+(nBuf;) 29.889 Tj
+90 675.766 Td
+(char) 23.9112 Tj
+-1704 TJm
+(buf[) 23.9112 Tj
+-426 TJm
+(/*) 11.9556 Tj
+-426 TJm
+(whatever) 47.8224 Tj
+-425 TJm
+(size) 23.9112 Tj
+-426 TJm
+(you) 17.9334 Tj
+-426 TJm
+(like) 23.9112 Tj
+-426 TJm
+(*/) 11.9556 Tj
+-426 TJm
+(];) 11.9556 Tj
+90 663.811 Td
+(int) 17.9334 Tj
+-2130 TJm
+(bzerror;) 47.8224 Tj
+90 651.856 Td
+(int) 17.9334 Tj
+-2130 TJm
+(nWritten;) 53.8002 Tj
+90 627.945 Td
+(f) 5.9778 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(fopen) 29.889 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+("myfile.bz2") 71.7336 Tj
+1 TJm
+(,) 5.9778 Tj
+-426 TJm
+("r") 17.9334 Tj
+-426 TJm
+(\);) 11.9556 Tj
+90 615.99 Td
+(if) 11.9556 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(!f) 11.9556 Tj
+-426 TJm
+(\)) 5.9778 Tj
+-426 TJm
+({) 5.9778 Tj
+98.488 604.035 Td
+(/*) 11.9556 Tj
+-426 TJm
+(handle) 35.8668 Tj
+-426 TJm
+(error) 29.889 Tj
+-426 TJm
+(*/) 11.9556 Tj
+90 592.08 Td
+(}) 5.9778 Tj
+90 580.125 Td
+(b) 5.9778 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ2_bzReadOpen) 83.6892 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(&bz) 17.9334 Tj
+1 TJm
+(error,) 35.8668 Tj
+-426 TJm
+(f,) 11.9556 Tj
+-426 TJm
+(0,) 11.9556 Tj
+-426 TJm
+(NULL,) 29.889 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+90 568.169 Td
+(if) 11.9556 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(!=) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+-426 TJm
+(\)) 5.9778 Tj
+-425 TJm
+({) 5.9778 Tj
+98.488 556.214 Td
+(BZ2_bzReadClose) 89.667 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(&bzerro) 41.8446 Tj
+1 TJm
+(r,) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+98.488 544.259 Td
+(/*) 11.9556 Tj
+-426 TJm
+(handle) 35.8668 Tj
+-426 TJm
+(error) 29.889 Tj
+-426 TJm
+(*/) 11.9556 Tj
+90 532.304 Td
+(}) 5.9778 Tj
+90 508.393 Td
+(bzerror) 41.8446 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ_OK;) 35.8668 Tj
+90 496.438 Td
+(while) 29.889 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(==) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+-425 TJm
+(&&) 11.9556 Tj
+-426 TJm
+(/*) 11.9556 Tj
+-426 TJm
+(arbitrary) 53.8002 Tj
+-426 TJm
+(other) 29.889 Tj
+-426 TJm
+(conditions) 59.778 Tj
+-426 TJm
+(*/\)) 17.9334 Tj
+-426 TJm
+({) 5.9778 Tj
+98.488 484.483 Td
+(nBuf) 23.9112 Tj
+-426 TJm
+(=) 5.9778 Tj
+-426 TJm
+(BZ2_bzRead) 59.778 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(&bze) 23.9112 Tj
+1 TJm
+(rror,) 29.889 Tj
+-426 TJm
+(b,) 11.9556 Tj
+-426 TJm
+(buf,) 23.9112 Tj
+-426 TJm
+(/*) 11.9556 Tj
+-426 TJm
+(size) 23.9112 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(buf) 17.9334 Tj
+-426 TJm
+(*/) 11.9556 Tj
+-426 TJm
+(\);) 11.9556 Tj
+98.488 472.528 Td
+(if) 11.9556 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(==) 11.9556 Tj
+-426 TJm
+(BZ_OK) 29.889 Tj
+-426 TJm
+(\)) 5.9778 Tj
+-425 TJm
+({) 5.9778 Tj
+106.976 460.573 Td
+(/*) 11.9556 Tj
+-426 TJm
+(do) 11.9556 Tj
+-426 TJm
+(something) 53.8002 Tj
+-426 TJm
+(with) 23.9112 Tj
+-426 TJm
+(buf) 17.9334 Tj
+1 TJm
+([0) 11.9556 Tj
+-426 TJm
+(..) 11.9556 Tj
+-426 TJm
+(nBuf-1]) 41.8446 Tj
+-426 TJm
+(*/) 11.9556 Tj
+98.488 448.618 Td
+(}) 5.9778 Tj
+90 436.662 Td
+(}) 5.9778 Tj
+90 424.707 Td
+(if) 11.9556 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(bzerror) 41.8446 Tj
+-426 TJm
+(!=) 11.9556 Tj
+-426 TJm
+(BZ_STREAM) 53.8002 Tj
+1 TJm
+(_END) 23.9112 Tj
+-426 TJm
+(\)) 5.9778 Tj
+-426 TJm
+({) 5.9778 Tj
+102.732 412.752 Td
+(BZ2_bzReadClose) 89.667 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(&bzerro) 41.8446 Tj
+1 TJm
+(r,) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+102.732 400.797 Td
+(/*) 11.9556 Tj
+-426 TJm
+(handle) 35.8668 Tj
+-426 TJm
+(error) 29.889 Tj
+-426 TJm
+(*/) 11.9556 Tj
+90 388.842 Td
+(}) 5.9778 Tj
+-426 TJm
+(else) 23.9112 Tj
+-426 TJm
+({) 5.9778 Tj
+102.732 376.887 Td
+(BZ2_bzReadClose) 89.667 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(&bzerro) 41.8446 Tj
+1 TJm
+(r) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+90 364.931 Td
+(}) 5.9778 Tj
+[1 0 0 1 72 349.39] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.586] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -339.427] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 314.637 Td
+/F121_0 20.659 Tf
+(3.5.) 34.4592 Tj
+-278 TJm
+(Utility) 57.3907 Tj
+-278 TJm
+(functions) 92.9655 Tj
+[1 0 0 1 72 310.361] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -300.398] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 284.016 Td
+/F121_0 17.215 Tf
+(3.5.1.) 43.0719 Tj
+[1 0 0 1 119.858 284.016] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -284.016] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 284.016 Td
+/F387_0 17.215 Tf
+(BZ2_bzBuffToBuffCompress) 247.896 Tj
+[1 0 0 1 367.76 284.016] cm
+0 g
+0 G
+[1 0 0 1 -295.76 -2.333] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -96.638] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 95.641 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 92.055] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -272.318] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 272.318 Td
+/F130_0 9.963 Tf
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzBuffToBuffCompr) 125.534 Tj
+1 TJm
+(ess\() 23.9112 Tj
+-426 TJm
+(char*) 29.889 Tj
+-3834 TJm
+(dest,) 29.889 Tj
+217.319 260.363 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int*) 23.9112 Tj
+-426 TJm
+(destLen,) 47.8224 Tj
+217.319 248.408 Td
+(char*) 29.889 Tj
+-3834 TJm
+(source,) 41.8446 Tj
+217.319 236.453 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int) 17.9334 Tj
+-852 TJm
+(sourceLen,) 59.778 Tj
+217.319 224.498 Td
+(int) 17.9334 Tj
+-4686 TJm
+(blockSize) 53.8002 Tj
+1 TJm
+(100k,) 29.889 Tj
+217.319 212.542 Td
+(int) 17.9334 Tj
+-4686 TJm
+(verbosity) 53.8002 Tj
+1 TJm
+(,) 5.9778 Tj
+217.319 200.587 Td
+(int) 17.9334 Tj
+-4686 TJm
+(workFacto) 53.8002 Tj
+1 TJm
+(r) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 185.045] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -175.083] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 163.128 Td
+/F128_0 9.963 Tf
+(Attempts) 36.5343 Tj
+-442 TJm
+(to) 7.75121 Tj
+-442 TJm
+(compress) 37.6303 Tj
+-442 TJm
+(the) 12.1748 Tj
+-442 TJm
+(data) 16.5984 Tj
+-443 TJm
+(in) 7.75121 Tj
+[1 0 0 1 216.87 163.128] cm
+0 g
+0 G
+[1 0 0 1 -216.87 -163.128] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+216.87 163.128 Td
+/F130_0 9.963 Tf
+(source[0) 47.8224 Tj
+-600 TJm
+(..) 11.9556 Tj
+-1200 TJm
+(sourceLen-1]) 71.7336 Tj
+[1 0 0 1 366.309 163.128] cm
+0 g
+0 G
+[1 0 0 1 -366.309 -163.128] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+370.715 163.128 Td
+/F128_0 9.963 Tf
+(into) 15.5024 Tj
+-442 TJm
+(the) 12.1748 Tj
+-442 TJm
+(destination) 43.7276 Tj
+-442 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+40 TJm
+(,) 2.49075 Tj
+[1 0 0 1 486.202 163.128] cm
+0 g
+0 G
+[1 0 0 1 -486.202 -163.128] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+486.202 163.128 Td
+/F130_0 9.963 Tf
+(dest[0) 35.8668 Tj
+-600 TJm
+(..) 11.9556 Tj
+72 151.173 Td
+(*destLen-1]) 65.7558 Tj
+[1 0 0 1 137.753 151.173] cm
+0 g
+0 G
+[1 0 0 1 -137.753 -151.173] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+137.753 151.173 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1393 TJm
+(If) 6.63536 Tj
+-379 TJm
+(the) 12.1748 Tj
+-379 TJm
+(destinat) 30.9949 Tj
+1 TJm
+(ion) 12.7327 Tj
+-379 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-379 TJm
+(is) 6.64532 Tj
+-379 TJm
+(big) 12.7327 Tj
+-379 TJm
+(enoug) 24.3496 Tj
+1 TJm
+(h,) 7.47225 Tj
+[1 0 0 1 318.487 151.173] cm
+0 g
+0 G
+[1 0 0 1 -318.487 -151.173] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+318.487 151.173 Td
+/F130_0 9.963 Tf
+(*destLen) 47.8224 Tj
+[1 0 0 1 366.307 151.173] cm
+0 g
+0 G
+[1 0 0 1 -366.307 -151.173] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+370.082 151.173 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-379 TJm
+(set) 11.0689 Tj
+-379 TJm
+(t) 2.76971 Tj
+1 TJm
+(o) 4.9815 Tj
+-379 TJm
+(the) 12.1748 Tj
+-379 TJm
+(size) 15.4925 Tj
+-379 TJm
+(of) 8.29918 Tj
+-379 TJm
+(the) 12.1748 Tj
+-378 TJm
+(compressed) 47.0353 Tj
+-379 TJm
+(data,) 19.0891 Tj
+72 139.217 Td
+(and) 14.3866 Tj
+[1 0 0 1 89.527 139.217] cm
+0 g
+0 G
+[1 0 0 1 -89.527 -139.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+89.527 139.217 Td
+/F130_0 9.963 Tf
+(BZ_OK) 29.889 Tj
+[1 0 0 1 119.415 139.217] cm
+0 g
+0 G
+[1 0 0 1 -119.415 -139.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+122.556 139.217 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-315 TJm
+(returned.) 35.6875 Tj
+-1012 TJm
+(If) 6.63536 Tj
+-315 TJm
+(the) 12.1748 Tj
+-315 TJm
+(compressed) 47.0353 Tj
+-316 TJm
+(da) 9.40507 Tj
+1 TJm
+(ta) 7.19329 Tj
+-316 TJm
+(w) 7.19329 Tj
+10 TJm
+(on') 13.2807 Tj
+18 TJm
+(t) 2.76971 Tj
+-315 TJm
+(\002t,) 10.7999 Tj
+[1 0 0 1 313.323 139.217] cm
+0 g
+0 G
+[1 0 0 1 -313.323 -139.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+313.323 139.217 Td
+/F130_0 9.963 Tf
+(*destLen) 47.8224 Tj
+[1 0 0 1 361.143 139.217] cm
+0 g
+0 G
+[1 0 0 1 -361.143 -139.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+364.285 139.217 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-315 TJm
+(unchanged,) 45.6505 Tj
+-332 TJm
+(and) 14.3866 Tj
+[1 0 0 1 440.551 139.217] cm
+0 g
+0 G
+[1 0 0 1 -440.551 -139.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+440.551 139.217 Td
+/F130_0 9.963 Tf
+(BZ_OUTBUFF_FULL) 89.667 Tj
+[1 0 0 1 530.214 139.217] cm
+0 g
+0 G
+[1 0 0 1 -530.214 -139.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+533.355 139.217 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+72 127.262 Td
+(returned.) 35.6875 Tj
+[1 0 0 1 72 127.163] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -117.2] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 105.344 Td
+/F128_0 9.963 Tf
+(Compression) 52.5847 Tj
+-297 TJm
+(in) 7.75121 Tj
+-297 TJm
+(this) 14.3965 Tj
+-297 TJm
+(manner) 29.879 Tj
+-297 TJm
+(is) 6.64532 Tj
+-297 TJm
+(a) 4.42357 Tj
+-297 TJm
+(one-shot) 34.3126 Tj
+-297 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ent,) 14.6655 Tj
+-308 TJm
+(done) 19.3681 Tj
+-297 TJm
+(with) 17.7142 Tj
+-297 TJm
+(a) 4.42357 Tj
+-297 TJm
+(single) 23.8016 Tj
+-297 TJm
+(call) 14.3866 Tj
+-297 TJm
+(to) 7.75121 Tj
+-297 TJm
+(this) 14.3965 Tj
+-297 TJm
+(function.) 35.6974 Tj
+-902 TJm
+(The) 15.4925 Tj
+-297 TJm
+(resulting) 34.8705 Tj
+-297 TJm
+(compressed) 47.0353 Tj
+72 93.389 Td
+(data) 16.5984 Tj
+-296 TJm
+(is) 6.64532 Tj
+-296 TJm
+(a) 4.42357 Tj
+-296 TJm
+(complete) 36.5244 Tj
+[1 0 0 1 147.987 93.389] cm
+0 g
+0 G
+[1 0 0 1 -147.987 -93.389] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+147.987 93.389 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 177.875 93.389] cm
+0 g
+0 G
+[1 0 0 1 -177.875 -93.389] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+180.825 93.389 Td
+/F128_0 9.963 Tf
+(format) 26.5614 Tj
+-296 TJm
+(data) 16.5984 Tj
+-296 TJm
+(stream.) 29.0521 Tj
+-896 TJm
+(There) 23.2337 Tj
+-296 TJm
+(is) 6.64532 Tj
+-296 TJm
+(no) 9.963 Tj
+-296 TJm
+(mechanism) 45.3815 Tj
+-296 TJm
+(for) 11.6169 Tj
+-296 TJm
+(making) 29.889 Tj
+-296 TJm
+(additional) 39.852 Tj
+-296 TJm
+(calls) 18.2622 Tj
+-296 TJm
+(to) 7.75121 Tj
+-296 TJm
+(pro) 13.2807 Tj
+15 TJm
+(vide) 17.1563 Tj
+-296 TJm
+(e) 4.42357 Tj
+15 TJm
+(xtra) 15.4925 Tj
+72 81.434 Td
+(input) 20.4839 Tj
+-250 TJm
+(data.) 19.0891 Tj
+-620 TJm
+(If) 6.63536 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-250 TJm
+(that) 14.9445 Tj
+-250 TJm
+(k) 4.9815 Tj
+1 TJm
+(ind) 12.7327 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(mechanism,) 47.8722 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(lo) 7.75121 Tj
+25 TJm
+(w-le) 17.7043 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(el) 7.19329 Tj
+-250 TJm
+(interf) 21.5799 Tj
+10 TJm
+(ace.) 15.7615 Tj
+[1 0 0 1 72 79.277] cm
+0 g
+0 G
+[1 0 0 1 0 -28.425] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(26) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 30 30
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-223 TJm
+(the) 12.1748 Tj
+-224 TJm
+(meaning) 34.3126 Tj
+-223 TJm
+(of) 8.29918 Tj
+-223 TJm
+(parameters) 43.7077 Tj
+[1 0 0 1 195.306 710.037] cm
+0 g
+0 G
+[1 0 0 1 -195.306 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+195.306 710.037 Td
+/F130_0 9.963 Tf
+(blockSize100k) 77.7114 Tj
+[1 0 0 1 273.015 710.037] cm
+0 g
+0 G
+[1 0 0 1 -273.015 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+273.015 710.037 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 277.784 710.037] cm
+0 g
+0 G
+[1 0 0 1 -277.784 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+277.784 710.037 Td
+/F130_0 9.963 Tf
+(verbosity) 53.8002 Tj
+[1 0 0 1 331.583 710.037] cm
+0 g
+0 G
+[1 0 0 1 -331.583 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+333.808 710.037 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 350.42 710.037] cm
+0 g
+0 G
+[1 0 0 1 -350.42 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+350.42 710.037 Td
+/F130_0 9.963 Tf
+(workFactor) 59.778 Tj
+[1 0 0 1 410.196 710.037] cm
+0 g
+0 G
+[1 0 0 1 -410.196 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+410.196 710.037 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-229 TJm
+(see) 12.7228 Tj
+[1 0 0 1 429.913 710.037] cm
+0 g
+0 G
+[1 0 0 1 -429.913 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+429.913 710.037 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 537.509 710.037] cm
+0 g
+0 G
+[1 0 0 1 -537.509 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+537.509 710.037 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 707.881] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -697.918] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 688.12 Td
+/F128_0 9.963 Tf
+(T) 6.08739 Tj
+80 TJm
+(o) 4.9815 Tj
+-410 TJm
+(guarantee) 38.7262 Tj
+-410 TJm
+(that) 14.9445 Tj
+-410 TJm
+(the) 12.1748 Tj
+-410 TJm
+(compressed) 47.0353 Tj
+-410 TJm
+(data) 16.5984 Tj
+-410 TJm
+(will) 15.5024 Tj
+-410 TJm
+(\002) 5.53943 Tj
+1 TJm
+(t) 2.76971 Tj
+-411 TJm
+(i) 2.76971 Tj
+1 TJm
+(n) 4.9815 Tj
+-411 TJm
+(i) 2.76971 Tj
+1 TJm
+(ts) 6.64532 Tj
+-410 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+40 TJm
+(,) 2.49075 Tj
+-450 TJm
+(allocate) 30.9849 Tj
+-410 TJm
+(an) 9.40507 Tj
+-410 TJm
+(output) 25.4654 Tj
+-410 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-410 TJm
+(of) 8.29918 Tj
+-410 TJm
+(size) 15.4925 Tj
+-410 TJm
+(1%) 13.2807 Tj
+-410 TJm
+(lar) 10.511 Tj
+18 TJm
+(ger) 12.7228 Tj
+-410 TJm
+(than) 17.1563 Tj
+-410 TJm
+(the) 12.1748 Tj
+72 676.164 Td
+(uncompressed) 56.9983 Tj
+-250 TJm
+(data,) 19.0891 Tj
+-250 TJm
+(plus) 16.6083 Tj
+-250 TJm
+(six) 11.6268 Tj
+-249 TJm
+(hundred) 32.6488 Tj
+-250 TJm
+(e) 4.42357 Tj
+15 TJm
+(xtra) 15.4925 Tj
+-250 TJm
+(bytes.) 23.5226 Tj
+[1 0 0 1 72 674.008] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -664.045] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 654.247 Td
+/F130_0 9.963 Tf
+(BZ2_bzBuffToBuffDecompress) 155.423 Tj
+[1 0 0 1 227.417 654.247] cm
+0 g
+0 G
+[1 0 0 1 -227.417 -654.247] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+230.553 654.247 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-315 TJm
+(not) 12.7327 Tj
+-314 TJm
+(write) 20.474 Tj
+-315 TJm
+(data) 16.5984 Tj
+-315 TJm
+(at) 7.19329 Tj
+-315 TJm
+(or) 8.29918 Tj
+-314 TJm
+(be) 9.40507 Tj
+15 TJm
+(yond) 19.926 Tj
+[1 0 0 1 362.484 654.247] cm
+0 g
+0 G
+[1 0 0 1 -362.484 -654.247] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+362.484 654.247 Td
+/F130_0 9.963 Tf
+(dest[*destLen]) 83.6892 Tj
+[1 0 0 1 446.17 654.247] cm
+0 g
+0 G
+[1 0 0 1 -446.17 -654.247] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+446.17 654.247 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-331 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-315 TJm
+(in) 7.75121 Tj
+-314 TJm
+(case) 17.1463 Tj
+-315 TJm
+(of) 8.29918 Tj
+-315 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+72 642.291 Td
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er\003o) 18.2622 Tj
+25 TJm
+(w) 7.19329 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 642.192] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -632.229] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 620.374 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 620.274] cm
+0 g
+0 G
+[1 0 0 1 0 -168.369] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 167.372 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 163.786] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -610.909] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 610.909 Td
+/F130_0 9.963 Tf
+(BZ_CONFIG_ERROR) 89.667 Tj
+98.488 598.954 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(library) 41.8446 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-425 TJm
+(mis-compiled) 71.7336 Tj
+90 586.999 Td
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 575.044 Td
+(if) 11.9556 Tj
+-426 TJm
+(dest) 23.9112 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(destL) 29.889 Tj
+1 TJm
+(en) 11.9556 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+98.488 563.088 Td
+(or) 11.9556 Tj
+-426 TJm
+(blockSize100k) 77.7114 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(1) 5.9778 Tj
+-426 TJm
+(or) 11.9556 Tj
+-425 TJm
+(blockSize100k) 77.7114 Tj
+-426 TJm
+(>) 5.9778 Tj
+-426 TJm
+(9) 5.9778 Tj
+98.488 551.133 Td
+(or) 11.9556 Tj
+-426 TJm
+(verbosity) 53.8002 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(verb) 23.9112 Tj
+1 TJm
+(osity) 29.889 Tj
+-426 TJm
+(>) 5.9778 Tj
+-426 TJm
+(4) 5.9778 Tj
+98.488 539.178 Td
+(or) 11.9556 Tj
+-426 TJm
+(workFactor) 59.778 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(wor) 17.9334 Tj
+1 TJm
+(kFactor) 41.8446 Tj
+-426 TJm
+(>) 5.9778 Tj
+-426 TJm
+(250) 17.9334 Tj
+90 527.223 Td
+(BZ_MEM_ERROR) 71.7336 Tj
+98.488 515.268 Td
+(if) 11.9556 Tj
+-426 TJm
+(insufficient) 71.7336 Tj
+-426 TJm
+(memory) 35.8668 Tj
+-426 TJm
+(is) 11.9556 Tj
+-425 TJm
+(available) 53.8002 Tj
+90 503.313 Td
+(BZ_OUTBUFF_FULL) 89.667 Tj
+98.488 491.357 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(size) 23.9112 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compr) 29.889 Tj
+1 TJm
+(essed) 29.889 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(exceeds) 41.8446 Tj
+-426 TJm
+(*destLen) 47.8224 Tj
+90 479.402 Td
+(BZ_OK) 29.889 Tj
+98.488 467.447 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 451.905] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -441.943] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 421.284 Td
+/F121_0 17.215 Tf
+(3.5.2.) 43.0719 Tj
+[1 0 0 1 119.858 421.284] cm
+0 g
+0 G
+[1 0 0 1 -119.858 -421.284] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.858 421.284 Td
+/F387_0 17.215 Tf
+(BZ2_bzBuffToBuffDecompress) 268.554 Tj
+[1 0 0 1 388.419 421.284] cm
+0 g
+0 G
+[1 0 0 1 -316.419 -2.332] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -84.683] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 83.686 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 80.099] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -409.587] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 409.587 Td
+/F130_0 9.963 Tf
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzBuffToBuffDecom) 125.534 Tj
+1 TJm
+(press\() 35.8668 Tj
+-426 TJm
+(char*) 29.889 Tj
+-3834 TJm
+(dest,) 29.889 Tj
+225.807 397.632 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int*) 23.9112 Tj
+-426 TJm
+(destLen,) 47.8224 Tj
+225.807 385.676 Td
+(char*) 29.889 Tj
+-3834 TJm
+(source,) 41.8446 Tj
+225.807 373.721 Td
+(unsigned) 47.8224 Tj
+-426 TJm
+(int) 17.9334 Tj
+-852 TJm
+(sourceLen,) 59.778 Tj
+225.807 361.766 Td
+(int) 17.9334 Tj
+-4686 TJm
+(small,) 35.8668 Tj
+225.807 349.811 Td
+(int) 17.9334 Tj
+-4686 TJm
+(verbosity) 53.8002 Tj
+-425 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 334.269] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -324.307] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 312.351 Td
+/F128_0 9.963 Tf
+(Attempts) 36.5343 Tj
+-358 TJm
+(to) 7.75121 Tj
+-358 TJm
+(decompress) 47.0353 Tj
+-359 TJm
+(the) 12.1748 Tj
+-358 TJm
+(data) 16.5984 Tj
+-358 TJm
+(in) 7.75121 Tj
+[1 0 0 1 221.259 312.351] cm
+0 g
+0 G
+[1 0 0 1 -221.259 -312.351] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+221.259 312.351 Td
+/F130_0 9.963 Tf
+(source[0) 47.8224 Tj
+-600 TJm
+(..) 11.9556 Tj
+-1200 TJm
+(sourceLen-1) 65.7558 Tj
+1 TJm
+(]) 5.9778 Tj
+[1 0 0 1 370.698 312.351] cm
+0 g
+0 G
+[1 0 0 1 -370.698 -312.351] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+374.268 312.351 Td
+/F128_0 9.963 Tf
+(into) 15.5024 Tj
+-358 TJm
+(the) 12.1748 Tj
+-359 TJm
+(des) 13.2807 Tj
+1 TJm
+(tination) 30.4469 Tj
+-359 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+40 TJm
+(,) 2.49075 Tj
+[1 0 0 1 486.202 312.351] cm
+0 g
+0 G
+[1 0 0 1 -486.202 -312.351] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+486.202 312.351 Td
+/F130_0 9.963 Tf
+(dest[0) 35.8668 Tj
+-600 TJm
+(..) 11.9556 Tj
+72 300.396 Td
+(*destLen-1]) 65.7558 Tj
+[1 0 0 1 137.753 300.396] cm
+0 g
+0 G
+[1 0 0 1 -137.753 -300.396] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+137.753 300.396 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1123 TJm
+(If) 6.63536 Tj
+-334 TJm
+(the) 12.1748 Tj
+-334 TJm
+(destination) 43.7276 Tj
+-334 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-334 TJm
+(is) 6.64532 Tj
+-333 TJm
+(big) 12.7327 Tj
+-334 TJm
+(enough,) 31.8218 Tj
+[1 0 0 1 312.554 300.396] cm
+0 g
+0 G
+[1 0 0 1 -312.554 -300.396] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+312.554 300.396 Td
+/F130_0 9.963 Tf
+(*destLen) 47.8224 Tj
+[1 0 0 1 360.374 300.396] cm
+0 g
+0 G
+[1 0 0 1 -360.374 -300.396] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+363.701 300.396 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-334 TJm
+(set) 11.0689 Tj
+-334 TJm
+(to) 7.75121 Tj
+-334 TJm
+(th) 7.75121 Tj
+1 TJm
+(e) 4.42357 Tj
+-334 TJm
+(size) 15.4925 Tj
+-334 TJm
+(of) 8.29918 Tj
+-334 TJm
+(the) 12.1748 Tj
+-334 TJm
+(uncompressed) 56.9983 Tj
+-334 TJm
+(d) 4.9815 Tj
+1 TJm
+(ata,) 14.1076 Tj
+72 288.441 Td
+(and) 14.3866 Tj
+[1 0 0 1 89.527 288.441] cm
+0 g
+0 G
+[1 0 0 1 -89.527 -288.441] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+89.527 288.441 Td
+/F130_0 9.963 Tf
+(BZ_OK) 29.889 Tj
+[1 0 0 1 119.415 288.441] cm
+0 g
+0 G
+[1 0 0 1 -119.415 -288.441] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+122.556 288.441 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-315 TJm
+(returned.) 35.6875 Tj
+-1012 TJm
+(If) 6.63536 Tj
+-315 TJm
+(the) 12.1748 Tj
+-315 TJm
+(compressed) 47.0353 Tj
+-316 TJm
+(da) 9.40507 Tj
+1 TJm
+(ta) 7.19329 Tj
+-316 TJm
+(w) 7.19329 Tj
+10 TJm
+(on') 13.2807 Tj
+18 TJm
+(t) 2.76971 Tj
+-315 TJm
+(\002t,) 10.7999 Tj
+[1 0 0 1 313.323 288.441] cm
+0 g
+0 G
+[1 0 0 1 -313.323 -288.441] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+313.323 288.441 Td
+/F130_0 9.963 Tf
+(*destLen) 47.8224 Tj
+[1 0 0 1 361.143 288.441] cm
+0 g
+0 G
+[1 0 0 1 -361.143 -288.441] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+364.285 288.441 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-315 TJm
+(unchanged,) 45.6505 Tj
+-332 TJm
+(and) 14.3866 Tj
+[1 0 0 1 440.551 288.441] cm
+0 g
+0 G
+[1 0 0 1 -440.551 -288.441] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+440.551 288.441 Td
+/F130_0 9.963 Tf
+(BZ_OUTBUFF_FULL) 89.667 Tj
+[1 0 0 1 530.214 288.441] cm
+0 g
+0 G
+[1 0 0 1 -530.214 -288.441] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+533.355 288.441 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+72 276.486 Td
+(returned.) 35.6875 Tj
+[1 0 0 1 72 276.386] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -266.424] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 254.568 Td
+/F130_0 9.963 Tf
+(source) 35.8668 Tj
+[1 0 0 1 107.865 254.568] cm
+0 g
+0 G
+[1 0 0 1 -107.865 -254.568] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+110.981 254.568 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-313 TJm
+(assumed) 34.3126 Tj
+-312 TJm
+(to) 7.75121 Tj
+-313 TJm
+(hold) 17.7142 Tj
+-313 TJm
+(a) 4.42357 Tj
+-312 TJm
+(complete) 36.5244 Tj
+[1 0 0 1 237.04 254.568] cm
+0 g
+0 G
+[1 0 0 1 -237.04 -254.568] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+237.04 254.568 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 266.928 254.568] cm
+0 g
+0 G
+[1 0 0 1 -266.928 -254.568] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+270.044 254.568 Td
+/F128_0 9.963 Tf
+(format) 26.5614 Tj
+-313 TJm
+(dat) 12.1748 Tj
+1 TJm
+(a) 4.42357 Tj
+-313 TJm
+(stream.) 29.0521 Tj
+[1 0 0 1 353.446 254.568] cm
+0 g
+0 G
+[1 0 0 1 -353.446 -254.568] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+353.446 254.568 Td
+/F130_0 9.963 Tf
+(BZ2_bzBuffToBuffDecompres) 149.445 Tj
+1 TJm
+(s) 5.9778 Tj
+[1 0 0 1 508.863 254.568] cm
+0 g
+0 G
+[1 0 0 1 -508.863 -254.568] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+511.979 254.568 Td
+/F128_0 9.963 Tf
+(tries) 17.1563 Tj
+-313 TJm
+(to) 7.75121 Tj
+72 242.613 Td
+(decompress) 47.0353 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(entirety) 30.437 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-250 TJm
+(stream) 26.5614 Tj
+-250 TJm
+(into) 15.5024 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(output) 25.4654 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+55 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 240.456] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -230.493] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 220.695 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(meaning) 34.3126 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(parameter) 39.8321 Tj
+1 TJm
+(s) 3.87561 Tj
+[1 0 0 1 196.631 220.695] cm
+0 g
+0 G
+[1 0 0 1 -196.631 -220.695] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+196.631 220.695 Td
+/F130_0 9.963 Tf
+(small) 29.889 Tj
+[1 0 0 1 226.519 220.695] cm
+0 g
+0 G
+[1 0 0 1 -226.519 -220.695] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+229.01 220.695 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 245.887 220.695] cm
+0 g
+0 G
+[1 0 0 1 -245.887 -220.695] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+245.887 220.695 Td
+/F130_0 9.963 Tf
+(verbosity) 53.8002 Tj
+[1 0 0 1 299.685 220.695] cm
+0 g
+0 G
+[1 0 0 1 -299.685 -220.695] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+299.685 220.695 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(see) 12.7228 Tj
+[1 0 0 1 319.879 220.695] cm
+0 g
+0 G
+[1 0 0 1 -319.879 -220.695] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+319.879 220.695 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompressInit) 119.556 Tj
+[1 0 0 1 439.431 220.695] cm
+0 g
+0 G
+[1 0 0 1 -439.431 -220.695] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+439.431 220.695 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 218.538] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -208.576] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 198.777 Td
+/F128_0 9.963 Tf
+(Because) 33.1967 Tj
+-249 TJm
+(the) 12.1748 Tj
+-250 TJm
+(compression) 50.363 Tj
+-249 TJm
+(ratio) 18.2622 Tj
+-250 TJm
+(of) 8.29918 Tj
+-249 TJm
+(the) 12.1748 Tj
+-250 TJm
+(compressed) 47.0353 Tj
+-249 TJm
+(data) 16.5984 Tj
+-250 TJm
+(canno) 23.7916 Tj
+1 TJm
+(t) 2.76971 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(kno) 14.9445 Tj
+25 TJm
+(w) 7.19329 Tj
+1 TJm
+(n) 4.9815 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(adv) 14.3866 Tj
+25 TJm
+(a) 4.42357 Tj
+1 TJm
+(nce,) 16.3194 Tj
+-250 TJm
+(there) 19.916 Tj
+-250 TJm
+(is) 6.64532 Tj
+-249 TJm
+(no) 9.963 Tj
+-250 TJm
+(easy) 17.7043 Tj
+-249 TJm
+(w) 7.19329 Tj
+10 TJm
+(ay) 9.40507 Tj
+-250 TJm
+(to) 7.75121 Tj
+-249 TJm
+(guarantee) 38.7262 Tj
+72 186.822 Td
+(that) 14.9445 Tj
+-286 TJm
+(the) 12.1748 Tj
+-287 TJm
+(output) 25.4654 Tj
+-286 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+-286 TJm
+(will) 15.5024 Tj
+-287 TJm
+(be) 9.40507 Tj
+-286 TJm
+(big) 12.7327 Tj
+-286 TJm
+(enough.) 31.8218 Tj
+-839 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-286 TJm
+(may) 17.1563 Tj
+-286 TJm
+(of) 8.29918 Tj
+-287 TJm
+(course) 26.0034 Tj
+-286 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e) 4.42357 Tj
+-286 TJm
+(arrangements) 53.6707 Tj
+-287 TJm
+(in) 7.75121 Tj
+-286 TJm
+(your) 18.2622 Tj
+-286 TJm
+(code) 18.8101 Tj
+-287 TJm
+(to) 7.75121 Tj
+-286 TJm
+(record) 25.4455 Tj
+-286 TJm
+(the) 12.1748 Tj
+-287 TJm
+(size) 15.4925 Tj
+-286 TJm
+(of) 8.29918 Tj
+72 174.867 Td
+(the) 12.1748 Tj
+-250 TJm
+(uncompressed) 56.9983 Tj
+-250 TJm
+(data,) 19.0891 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(su) 8.85711 Tj
+1 TJm
+(ch) 9.40507 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(mechanism) 45.3815 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(be) 9.40507 Tj
+15 TJm
+(yond) 19.926 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(scope) 22.6858 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(this) 14.3965 Tj
+-250 TJm
+(library) 26.5614 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 172.71] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -162.747] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 152.949 Td
+/F130_0 9.963 Tf
+(BZ2_bzBuffToBuffDecompress) 155.423 Tj
+[1 0 0 1 227.417 152.949] cm
+0 g
+0 G
+[1 0 0 1 -227.417 -152.949] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+230.553 152.949 Td
+/F128_0 9.963 Tf
+(will) 15.5024 Tj
+-315 TJm
+(not) 12.7327 Tj
+-314 TJm
+(write) 20.474 Tj
+-315 TJm
+(data) 16.5984 Tj
+-315 TJm
+(at) 7.19329 Tj
+-315 TJm
+(or) 8.29918 Tj
+-314 TJm
+(be) 9.40507 Tj
+15 TJm
+(yond) 19.926 Tj
+[1 0 0 1 362.484 152.949] cm
+0 g
+0 G
+[1 0 0 1 -362.484 -152.949] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+362.484 152.949 Td
+/F130_0 9.963 Tf
+(dest[*destLen]) 83.6892 Tj
+[1 0 0 1 446.17 152.949] cm
+0 g
+0 G
+[1 0 0 1 -446.17 -152.949] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+446.17 152.949 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-331 TJm
+(e) 4.42357 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(en) 9.40507 Tj
+-315 TJm
+(in) 7.75121 Tj
+-314 TJm
+(case) 17.1463 Tj
+-315 TJm
+(of) 8.29918 Tj
+-315 TJm
+(b) 4.9815 Tj
+20 TJm
+(uf) 8.29918 Tj
+25 TJm
+(fer) 11.0589 Tj
+72 140.994 Td
+(o) 4.9815 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(er\003o) 18.2622 Tj
+25 TJm
+(w) 7.19329 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 140.894] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -130.932] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 119.076 Td
+/F128_0 9.963 Tf
+(Possible) 33.2166 Tj
+-250 TJm
+(return) 23.7916 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues:) 23.2437 Tj
+[1 0 0 1 72 118.977] cm
+0 g
+0 G
+[1 0 0 1 0 -68.125] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(27) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 31 31
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 4.384 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -352.044 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+436.124 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip) 27.6772 Tj
+1 TJm
+(2) 4.9815 Tj
+[1 0 0 1 267.964 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -15.037 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -248.702] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 227.148 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 223.562] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -711.631] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 711.631 Td
+/F130_0 9.963 Tf
+(BZ_CONFIG_ERROR) 89.667 Tj
+98.488 699.676 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(library) 41.8446 Tj
+-426 TJm
+(has) 17.9334 Tj
+-426 TJm
+(been) 23.9112 Tj
+-425 TJm
+(mis-compiled) 71.7336 Tj
+90 687.721 Td
+(BZ_PARAM_ERROR) 83.6892 Tj
+98.488 675.766 Td
+(if) 11.9556 Tj
+-426 TJm
+(dest) 23.9112 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(destL) 29.889 Tj
+1 TJm
+(en) 11.9556 Tj
+-426 TJm
+(is) 11.9556 Tj
+-426 TJm
+(NULL) 23.9112 Tj
+98.488 663.811 Td
+(or) 11.9556 Tj
+-426 TJm
+(small) 29.889 Tj
+-426 TJm
+(!=) 11.9556 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(&&) 11.9556 Tj
+-426 TJm
+(small) 29.889 Tj
+-426 TJm
+(!) 5.9778 Tj
+1 TJm
+(=) 5.9778 Tj
+-426 TJm
+(1) 5.9778 Tj
+98.488 651.856 Td
+(or) 11.9556 Tj
+-426 TJm
+(verbosity) 53.8002 Tj
+-426 TJm
+(<) 5.9778 Tj
+-426 TJm
+(0) 5.9778 Tj
+-426 TJm
+(or) 11.9556 Tj
+-426 TJm
+(verb) 23.9112 Tj
+1 TJm
+(osity) 29.889 Tj
+-426 TJm
+(>) 5.9778 Tj
+-426 TJm
+(4) 5.9778 Tj
+90 639.9 Td
+(BZ_MEM_ERROR) 71.7336 Tj
+98.488 627.945 Td
+(if) 11.9556 Tj
+-426 TJm
+(insufficient) 71.7336 Tj
+-426 TJm
+(memory) 35.8668 Tj
+-426 TJm
+(is) 11.9556 Tj
+-425 TJm
+(available) 53.8002 Tj
+90 615.99 Td
+(BZ_OUTBUFF_FULL) 89.667 Tj
+98.488 604.035 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(size) 23.9112 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compr) 29.889 Tj
+1 TJm
+(essed) 29.889 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(exceeds) 41.8446 Tj
+-426 TJm
+(*destLen) 47.8224 Tj
+90 592.08 Td
+(BZ_DATA_ERROR) 77.7114 Tj
+98.488 580.124 Td
+(if) 11.9556 Tj
+-426 TJm
+(a) 5.9778 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(integrity) 53.8002 Tj
+-426 TJm
+(erro) 23.9112 Tj
+1 TJm
+(r) 5.9778 Tj
+-426 TJm
+(was) 17.9334 Tj
+-426 TJm
+(detected) 47.8224 Tj
+-426 TJm
+(in) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+-426 TJm
+(data) 23.9112 Tj
+90 568.169 Td
+(BZ_DATA_ERROR_MAGIC) 113.578 Tj
+98.488 556.214 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(d) 5.9778 Tj
+1 TJm
+(oesn't) 35.8668 Tj
+-426 TJm
+(begin) 29.889 Tj
+-426 TJm
+(with) 23.9112 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(right) 29.889 Tj
+-426 TJm
+(magic) 29.889 Tj
+-426 TJm
+(bytes) 29.889 Tj
+90 544.259 Td
+(BZ_UNEXPECTED_EOF) 101.623 Tj
+98.488 532.304 Td
+(if) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(compressed) 59.778 Tj
+-426 TJm
+(data) 23.9112 Tj
+-426 TJm
+(e) 5.9778 Tj
+1 TJm
+(nds) 17.9334 Tj
+-426 TJm
+(unexpectedly) 71.7336 Tj
+90 520.349 Td
+(BZ_OK) 29.889 Tj
+98.488 508.393 Td
+(otherwise) 53.8002 Tj
+[1 0 0 1 72 492.852] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.586] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -482.889] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 458.099 Td
+/F121_0 20.659 Tf
+(3.6.) 34.4592 Tj
+[1 0 0 1 112.201 458.099] cm
+0 g
+0 G
+[1 0 0 1 -112.201 -458.099] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+112.201 458.099 Td
+/F387_0 20.659 Tf
+(zlib) 49.5816 Tj
+[1 0 0 1 161.781 458.099] cm
+0 g
+0 G
+[1 0 0 1 -161.781 -458.099] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+167.524 458.099 Td
+/F121_0 20.659 Tf
+(compatibility) 127.425 Tj
+-278 TJm
+(functions) 92.9655 Tj
+[1 0 0 1 72 453.823] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -443.86] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 436.181 Td
+/F128_0 9.963 Tf
+(Y) 7.19329 Tj
+110 TJm
+(oshioka) 30.9949 Tj
+-604 TJm
+(Tsuneo) 29.3311 Tj
+-604 TJm
+(has) 13.2807 Tj
+-604 TJm
+(contrib) 28.2252 Tj
+20 TJm
+(uted) 17.1563 Tj
+-604 TJm
+(some) 21.0319 Tj
+-604 TJm
+(funct) 20.474 Tj
+1 TJm
+(ions) 16.6083 Tj
+-604 TJm
+(to) 7.75121 Tj
+-604 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-604 TJm
+(better) 22.6858 Tj
+[1 0 0 1 356.347 436.181] cm
+0 g
+0 G
+[1 0 0 1 -356.347 -436.181] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+356.347 436.181 Td
+/F130_0 9.963 Tf
+(zlib) 23.9112 Tj
+[1 0 0 1 380.257 436.181] cm
+0 g
+0 G
+[1 0 0 1 -380.257 -436.181] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+386.275 436.181 Td
+/F128_0 9.963 Tf
+(compatibility) 53.1426 Tj
+65 TJm
+(.) 2.49075 Tj
+-1372 TJm
+(These) 23.7916 Tj
+-604 TJm
+(functions) 37.0823 Tj
+-604 TJm
+(are) 12.1648 Tj
+[1 0 0 1 72 424.226] cm
+0 g
+0 G
+[1 0 0 1 -72 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 424.226 Td
+/F130_0 9.963 Tf
+(BZ2_bzopen) 59.778 Tj
+[1 0 0 1 131.776 424.226] cm
+0 g
+0 G
+[1 0 0 1 -131.776 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+131.776 424.226 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 144.283 424.226] cm
+0 g
+0 G
+[1 0 0 1 -144.283 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+144.283 424.226 Td
+/F130_0 9.963 Tf
+(BZ2_bzread) 59.778 Tj
+[1 0 0 1 204.059 424.226] cm
+0 g
+0 G
+[1 0 0 1 -204.059 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+204.059 424.226 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 216.567 424.226] cm
+0 g
+0 G
+[1 0 0 1 -216.567 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+216.567 424.226 Td
+/F130_0 9.963 Tf
+(BZ2_bzwrite) 65.7558 Tj
+[1 0 0 1 282.32 424.226] cm
+0 g
+0 G
+[1 0 0 1 -282.32 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+282.32 424.226 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 294.827 424.226] cm
+0 g
+0 G
+[1 0 0 1 -294.827 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+294.827 424.226 Td
+/F130_0 9.963 Tf
+(BZ2_bzflush) 65.7558 Tj
+[1 0 0 1 360.581 424.226] cm
+0 g
+0 G
+[1 0 0 1 -360.581 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+360.581 424.226 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 373.088 424.226] cm
+0 g
+0 G
+[1 0 0 1 -373.088 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+373.088 424.226 Td
+/F130_0 9.963 Tf
+(BZ2_bzclose) 65.7558 Tj
+[1 0 0 1 438.842 424.226] cm
+0 g
+0 G
+[1 0 0 1 -438.842 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+438.842 424.226 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 451.349 424.226] cm
+0 g
+0 G
+[1 0 0 1 -451.349 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+451.349 424.226 Td
+/F130_0 9.963 Tf
+(BZ2_bzerror) 65.7558 Tj
+[1 0 0 1 517.102 424.226] cm
+0 g
+0 G
+[1 0 0 1 -517.102 -424.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+525.614 424.226 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 72 412.271] cm
+0 g
+0 G
+[1 0 0 1 -72 -412.271] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 412.271 Td
+/F130_0 9.963 Tf
+(BZ2_bzlibVersion) 95.6448 Tj
+[1 0 0 1 167.641 412.271] cm
+0 g
+0 G
+[1 0 0 1 -167.641 -412.271] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+167.641 412.271 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1419 TJm
+(These) 23.7916 Tj
+-384 TJm
+(functi) 23.2437 Tj
+1 TJm
+(ons) 13.8386 Tj
+-384 TJm
+(are) 12.1648 Tj
+-383 TJm
+(not) 12.7327 Tj
+-383 TJm
+(\(yet\)) 18.8101 Tj
+-383 TJm
+(of) 8.29918 Tj
+25 TJm
+(\002cially) 27.6772 Tj
+-383 TJm
+(part) 15.4925 Tj
+-383 TJm
+(of) 8.29918 Tj
+-384 TJm
+(the) 12.1748 Tj
+-383 TJm
+(library) 26.5614 Tj
+65 TJm
+(.) 2.49075 Tj
+-1419 TJm
+(If) 6.63536 Tj
+-383 TJm
+(the) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-383 TJm
+(break,) 24.6186 Tj
+-417 TJm
+(you) 14.9445 Tj
+-383 TJm
+(get) 12.1748 Tj
+-383 TJm
+(to) 7.75121 Tj
+72 400.316 Td
+(k) 4.9815 Tj
+10 TJm
+(eep) 13.8286 Tj
+-250 TJm
+(all) 9.963 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(pieces.) 27.3883 Tj
+-620 TJm
+(Ne) 11.6169 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(erth) 15.4925 Tj
+1 TJm
+(eless,) 21.8588 Tj
+-250 TJm
+(I) 3.31768 Tj
+-250 TJm
+(think) 20.4839 Tj
+-250 TJm
+(the) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork) 13.2807 Tj
+-250 TJm
+(ok.) 12.4538 Tj
+[1 0 0 1 72 398.159] cm
+0 g
+0 G
+[1 0 0 1 0 -48.817] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 47.821 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 44.235] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -388.794] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 388.794 Td
+/F130_0 9.963 Tf
+(typedef) 41.8446 Tj
+-426 TJm
+(void) 23.9112 Tj
+-426 TJm
+(BZFILE;) 41.8446 Tj
+90 364.884 Td
+(const) 29.889 Tj
+-426 TJm
+(char) 23.9112 Tj
+-426 TJm
+(*) 5.9778 Tj
+-426 TJm
+(BZ2_bzlibVer) 71.7336 Tj
+1 TJm
+(sion) 23.9112 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(void) 23.9112 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 349.342] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -339.379] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 327.424 Td
+/F128_0 9.963 Tf
+(Returns) 30.9949 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(string) 22.6957 Tj
+-250 TJm
+(indicating) 39.852 Tj
+-250 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-250 TJm
+(library) 26.5614 Tj
+-250 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersion.) 26.8403 Tj
+[1 0 0 1 72 325.267] cm
+0 g
+0 G
+[1 0 0 1 0 -36.862] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 35.866 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 32.279] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -315.902] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 315.902 Td
+/F130_0 9.963 Tf
+(BZFILE) 35.8668 Tj
+-426 TJm
+(*) 5.9778 Tj
+-426 TJm
+(BZ2_bzopen) 59.778 Tj
+-852 TJm
+(\() 5.9778 Tj
+-426 TJm
+(c) 5.9778 Tj
+1 TJm
+(onst) 23.9112 Tj
+-426 TJm
+(char) 23.9112 Tj
+-426 TJm
+(*path,) 35.8668 Tj
+-426 TJm
+(const) 29.889 Tj
+-426 TJm
+(char) 23.9112 Tj
+-426 TJm
+(*mode) 29.889 Tj
+-426 TJm
+(\);) 11.9556 Tj
+90 303.947 Td
+(BZFILE) 35.8668 Tj
+-426 TJm
+(*) 5.9778 Tj
+-426 TJm
+(BZ2_bzdopen) 65.7558 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(i) 5.9778 Tj
+1 TJm
+(nt) 11.9556 Tj
+-3408 TJm
+(fd,) 17.9334 Tj
+-1704 TJm
+(const) 29.889 Tj
+-426 TJm
+(char) 23.9112 Tj
+-426 TJm
+(*mode) 29.889 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 288.405] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -278.443] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 266.488 Td
+/F128_0 9.963 Tf
+(Opens) 25.4555 Tj
+-243 TJm
+(a) 4.42357 Tj
+[1 0 0 1 106.713 266.488] cm
+0 g
+0 G
+[1 0 0 1 -106.713 -266.488] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+106.713 266.488 Td
+/F130_0 9.963 Tf
+(.bz2) 23.9112 Tj
+[1 0 0 1 130.624 266.488] cm
+0 g
+0 G
+[1 0 0 1 -130.624 -266.488] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+133.041 266.488 Td
+/F128_0 9.963 Tf
+(\002le) 12.7327 Tj
+-243 TJm
+(for) 11.6169 Tj
+-242 TJm
+(reading) 29.879 Tj
+-243 TJm
+(or) 8.29918 Tj
+-242 TJm
+(writing,) 31.2739 Tj
+-244 TJm
+(using) 21.5898 Tj
+-243 TJm
+(either) 22.6858 Tj
+-243 TJm
+(its) 9.41504 Tj
+-242 TJm
+(name) 21.5799 Tj
+-243 TJm
+(or) 8.29918 Tj
+-242 TJm
+(a) 4.42357 Tj
+-243 TJm
+(pre-e) 20.464 Tj
+15 TJm
+(xisting) 27.1292 Tj
+-243 TJm
+(\002le) 12.7327 Tj
+-242 TJm
+(descriptor) 39.842 Tj
+55 TJm
+(.) 2.49075 Tj
+-615 TJm
+(Analogous) 43.1697 Tj
+-243 TJm
+(to) 7.75121 Tj
+[1 0 0 1 510.112 266.488] cm
+0 g
+0 G
+[1 0 0 1 -510.112 -266.488] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+510.112 266.488 Td
+/F130_0 9.963 Tf
+(fopen) 29.889 Tj
+[1 0 0 1 540 266.488] cm
+0 g
+0 G
+[1 0 0 1 -540 -266.488] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 254.532 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 88.877 254.532] cm
+0 g
+0 G
+[1 0 0 1 -88.877 -254.532] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+88.877 254.532 Td
+/F130_0 9.963 Tf
+(fdopen) 35.8668 Tj
+[1 0 0 1 124.742 254.532] cm
+0 g
+0 G
+[1 0 0 1 -124.742 -254.532] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+124.742 254.532 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 252.968] cm
+0 g
+0 G
+[1 0 0 1 0 -36.861] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 35.866 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 32.279] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -243.604] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 243.604 Td
+/F130_0 9.963 Tf
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzread) 59.778 Tj
+-852 TJm
+(\() 5.9778 Tj
+-426 TJm
+(BZFILE) 35.8668 Tj
+1 TJm
+(*) 5.9778 Tj
+-426 TJm
+(b,) 11.9556 Tj
+-426 TJm
+(void*) 29.889 Tj
+-426 TJm
+(buf,) 23.9112 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(len) 17.9334 Tj
+-426 TJm
+(\);) 11.9556 Tj
+90 231.648 Td
+(int) 17.9334 Tj
+-426 TJm
+(BZ2_bzwrite) 65.7558 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(BZFILE*) 41.8446 Tj
+-425 TJm
+(b,) 11.9556 Tj
+-426 TJm
+(void*) 29.889 Tj
+-426 TJm
+(buf,) 23.9112 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(len) 17.9334 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 216.107] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -206.144] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 194.189 Td
+/F128_0 9.963 Tf
+(Reads/writes) 51.4689 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(from/to) 29.889 Tj
+-249 TJm
+(a) 4.42357 Tj
+-250 TJm
+(pre) 12.7228 Tj
+25 TJm
+(viously) 29.341 Tj
+-250 TJm
+(opened) 28.7731 Tj
+[1 0 0 1 259.903 194.189] cm
+0 g
+0 G
+[1 0 0 1 -259.903 -194.189] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+259.903 194.189 Td
+/F130_0 9.963 Tf
+(BZFILE) 35.8668 Tj
+[1 0 0 1 295.769 194.189] cm
+0 g
+0 G
+[1 0 0 1 -295.769 -194.189] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+295.769 194.189 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-500 TJm
+(Analogous) 43.1697 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 359.141 194.189] cm
+0 g
+0 G
+[1 0 0 1 -359.141 -194.189] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+359.141 194.189 Td
+/F130_0 9.963 Tf
+(fread) 29.889 Tj
+[1 0 0 1 389.029 194.189] cm
+0 g
+0 G
+[1 0 0 1 -389.029 -194.189] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+391.519 194.189 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 408.396 194.189] cm
+0 g
+0 G
+[1 0 0 1 -408.396 -194.189] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+408.396 194.189 Td
+/F130_0 9.963 Tf
+(fwrite) 35.8668 Tj
+[1 0 0 1 444.261 194.189] cm
+0 g
+0 G
+[1 0 0 1 -444.261 -194.189] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+444.261 194.189 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 192.032] cm
+0 g
+0 G
+[1 0 0 1 0 -36.862] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 35.866 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 32.279] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -182.667] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 182.667 Td
+/F130_0 9.963 Tf
+(int) 17.9334 Tj
+-852 TJm
+(BZ2_bzflush) 65.7558 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(BZFIL) 29.889 Tj
+1 TJm
+(E*) 11.9556 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+90 170.712 Td
+(void) 23.9112 Tj
+-426 TJm
+(BZ2_bzclose) 65.7558 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(BZFILE) 35.8668 Tj
+1 TJm
+(*) 5.9778 Tj
+-426 TJm
+(b) 5.9778 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 155.17] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -145.208] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 133.252 Td
+/F128_0 9.963 Tf
+(Flushes/closes) 57.5662 Tj
+-250 TJm
+(a) 4.42357 Tj
+[1 0 0 1 138.968 133.252] cm
+0 g
+0 G
+[1 0 0 1 -138.968 -133.252] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+138.968 133.252 Td
+/F130_0 9.963 Tf
+(BZFILE) 35.8668 Tj
+[1 0 0 1 174.833 133.252] cm
+0 g
+0 G
+[1 0 0 1 -174.833 -133.252] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+174.833 133.252 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 179.815 133.252] cm
+0 g
+0 G
+[1 0 0 1 -179.815 -133.252] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+179.815 133.252 Td
+/F130_0 9.963 Tf
+(BZ2_bzflush) 65.7558 Tj
+[1 0 0 1 245.568 133.252] cm
+0 g
+0 G
+[1 0 0 1 -245.568 -133.252] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+248.059 133.252 Td
+/F128_0 9.963 Tf
+(doesn') 26.5614 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(actually) 31.5429 Tj
+-250 TJm
+(do) 9.963 Tj
+-250 TJm
+(an) 9.40507 Tj
+15 TJm
+(ything.) 27.9562 Tj
+-619 TJm
+(Analogous) 43.1697 Tj
+-250 TJm
+(to) 7.75121 Tj
+[1 0 0 1 425.472 133.252] cm
+0 g
+0 G
+[1 0 0 1 -425.472 -133.252] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+425.472 133.252 Td
+/F130_0 9.963 Tf
+(fflush) 35.8668 Tj
+[1 0 0 1 461.338 133.252] cm
+0 g
+0 G
+[1 0 0 1 -461.338 -133.252] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+463.828 133.252 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 480.705 133.252] cm
+0 g
+0 G
+[1 0 0 1 -480.705 -133.252] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+480.705 133.252 Td
+/F130_0 9.963 Tf
+(fclose) 35.8668 Tj
+[1 0 0 1 516.57 133.252] cm
+0 g
+0 G
+[1 0 0 1 -516.57 -133.252] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+516.57 133.252 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 131.096] cm
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.323] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -121.731] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 121.731 Td
+/F130_0 9.963 Tf
+(const) 29.889 Tj
+-426 TJm
+(char) 23.9112 Tj
+-426 TJm
+(*) 5.9778 Tj
+-426 TJm
+(BZ2_bzerror) 65.7558 Tj
+-425 TJm
+(\() 5.9778 Tj
+-426 TJm
+(BZFILE) 35.8668 Tj
+-426 TJm
+(*b,) 17.9334 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(*errnum) 41.8446 Tj
+-426 TJm
+(\)) 5.9778 Tj
+[1 0 0 1 72 106.189] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -96.226] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 84.271 Td
+/F128_0 9.963 Tf
+(Returns) 30.9949 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(string) 22.6957 Tj
+-250 TJm
+(describing) 41.5059 Tj
+-250 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-250 TJm
+(more) 20.474 Tj
+-250 TJm
+(recent) 24.3396 Tj
+-250 TJm
+(error) 19.3581 Tj
+-250 TJm
+(status) 22.6957 Tj
+-250 TJm
+(of) 8.29918 Tj
+[1 0 0 1 303.858 84.271] cm
+0 g
+0 G
+[1 0 0 1 -303.858 -84.271] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+303.858 84.271 Td
+/F130_0 9.963 Tf
+(b) 5.9778 Tj
+[1 0 0 1 309.835 84.271] cm
+0 g
+0 G
+[1 0 0 1 -309.835 -84.271] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+309.835 84.271 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(also) 16.0504 Tj
+-250 TJm
+(sets) 14.9445 Tj
+[1 0 0 1 367.668 84.271] cm
+0 g
+0 G
+[1 0 0 1 -367.668 -84.271] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+367.668 84.271 Td
+/F130_0 9.963 Tf
+(*errnum) 41.8446 Tj
+[1 0 0 1 409.511 84.271] cm
+0 g
+0 G
+[1 0 0 1 -409.511 -84.271] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+412.002 84.271 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(its) 9.41504 Tj
+-250 TJm
+(numerical) 39.842 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alue.) 19.0891 Tj
+[1 0 0 1 72 82.114] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -21.3] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 4.384 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.573 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -495.734 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+536.307 50.951 Td
+/F128_0 9.963 Tf
+(28) 9.963 Tj
+[1 0 0 1 455.161 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.599 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -15.037 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 32 32
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -540 -741.554] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 704.93 Td
+/F121_0 20.659 Tf
+(3.7.) 34.4592 Tj
+-449 TJm
+(Using) 57.3907 Tj
+-449 TJm
+(the) 30.9885 Tj
+-449 TJm
+(librar) 51.6682 Tj
+-10 TJm
+(y) 11.4864 Tj
+-449 TJm
+(in) 18.3659 Tj
+-450 TJm
+(a) 11.4864 Tj
+[1 0 0 1 343.721 704.93] cm
+0 g
+0 G
+[1 0 0 1 -343.721 -704.93] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+343.721 704.93 Td
+/F387_0 20.659 Tf
+(stdio) 61.977 Tj
+[1 0 0 1 405.696 704.93] cm
+0 g
+0 G
+[1 0 0 1 -405.696 -704.93] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+405.696 704.93 Td
+/F121_0 20.659 Tf
+(-free) 44.7681 Tj
+-449 TJm
+(en) 24.1091 Tj
+40 TJm
+(vir) 25.266 Tj
+20 TJm
+(on-) 32.1247 Tj
+72 680.139 Td
+(ment) 49.3544 Tj
+[1 0 0 1 72 679.881] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -669.919] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 649.518 Td
+/F121_0 17.215 Tf
+(3.7.1.) 43.0719 Tj
+-278 TJm
+(Getting) 60.2525 Tj
+-278 TJm
+(rid) 22.0008 Tj
+-278 TJm
+(of) 16.251 Tj
+[1 0 0 1 232.721 649.518] cm
+0 g
+0 G
+[1 0 0 1 -232.721 -649.518] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+232.721 649.518 Td
+/F387_0 17.215 Tf
+(stdio) 51.645 Tj
+[1 0 0 1 284.367 649.518] cm
+0 g
+0 G
+[1 0 0 1 -212.367 -3.83] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -635.725] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 627.6 Td
+/F128_0 9.963 Tf
+(In) 8.29918 Tj
+-319 TJm
+(a) 4.42357 Tj
+-319 TJm
+(deeply) 26.5614 Tj
+-319 TJm
+(embedded) 40.9479 Tj
+-319 TJm
+(application,) 46.7663 Tj
+-336 TJm
+(you) 14.9445 Tj
+-319 TJm
+(might) 23.2536 Tj
+-319 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-319 TJm
+(to) 7.75121 Tj
+-319 TJm
+(use) 13.2807 Tj
+-319 TJm
+(just) 14.3965 Tj
+-319 TJm
+(t) 2.76971 Tj
+1 TJm
+(he) 9.40507 Tj
+-319 TJm
+(memory-to-memory) 80.7999 Tj
+-319 TJm
+(functions.) 39.573 Tj
+-1034 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-319 TJm
+(can) 13.8286 Tj
+-319 TJm
+(do) 9.963 Tj
+-319 TJm
+(this) 14.3965 Tj
+72 615.645 Td
+(con) 14.3866 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(eniently) 32.1008 Tj
+-327 TJm
+(by) 9.963 Tj
+-327 TJm
+(compiling) 40.4099 Tj
+-327 TJm
+(the) 12.1748 Tj
+-327 TJm
+(library) 26.5614 Tj
+-327 TJm
+(with) 17.7142 Tj
+-327 TJm
+(preprocessor) 50.901 Tj
+-327 TJm
+(symbol) 29.341 Tj
+[1 0 0 1 336.045 615.645] cm
+0 g
+0 G
+[1 0 0 1 -336.045 -615.645] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+336.045 615.645 Td
+/F130_0 9.963 Tf
+(BZ_NO_STDIO) 65.7558 Tj
+[1 0 0 1 401.799 615.645] cm
+0 g
+0 G
+[1 0 0 1 -401.799 -615.645] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+405.057 615.645 Td
+/F128_0 9.963 Tf
+(de\002ned.) 31.8218 Tj
+-1082 TJm
+(Doing) 24.9075 Tj
+-327 TJm
+(this) 14.3965 Tj
+-327 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(es) 8.29918 Tj
+-327 TJm
+(you) 14.9445 Tj
+-327 TJm
+(a) 4.42357 Tj
+72 603.69 Td
+(library) 26.5614 Tj
+-250 TJm
+(containing) 42.0638 Tj
+-250 TJm
+(only) 17.7142 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(fo) 8.29918 Tj
+1 TJm
+(llo) 10.5209 Tj
+25 TJm
+(wing) 19.926 Tj
+-250 TJm
+(eight) 19.926 Tj
+-250 TJm
+(functions:) 39.852 Tj
+[1 0 0 1 72 601.533] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -591.571] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 581.772 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressInit) 107.6 Tj
+[1 0 0 1 179.597 581.772] cm
+0 g
+0 G
+[1 0 0 1 -179.597 -581.772] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+179.597 581.772 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 199.079 581.772] cm
+0 g
+0 G
+[1 0 0 1 -199.079 -581.772] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+199.079 581.772 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompress) 83.6892 Tj
+[1 0 0 1 282.765 581.772] cm
+0 g
+0 G
+[1 0 0 1 -282.765 -581.772] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+282.765 581.772 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 302.247 581.772] cm
+0 g
+0 G
+[1 0 0 1 -302.247 -581.772] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+302.247 581.772 Td
+/F130_0 9.963 Tf
+(BZ2_bzCompressEnd) 101.623 Tj
+[1 0 0 1 403.866 581.772] cm
+0 g
+0 G
+[1 0 0 1 14.092 0] cm
+0 g
+0 G
+[1 0 0 1 -417.958 -581.772] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+417.958 581.772 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompressInit) 119.556 Tj
+[1 0 0 1 537.509 581.772] cm
+0 g
+0 G
+[1 0 0 1 -537.509 -581.772] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+537.509 581.772 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 72 569.817] cm
+0 g
+0 G
+[1 0 0 1 -72 -569.817] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 569.817 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompress) 95.6448 Tj
+[1 0 0 1 167.641 569.817] cm
+0 g
+0 G
+[1 0 0 1 -167.641 -569.817] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+167.641 569.817 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 172.144 569.817] cm
+0 g
+0 G
+[1 0 0 1 -172.144 -569.817] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+172.144 569.817 Td
+/F130_0 9.963 Tf
+(BZ2_bzDecompressEnd) 113.578 Tj
+[1 0 0 1 285.719 569.817] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 -287.612 -569.817] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+287.612 569.817 Td
+/F130_0 9.963 Tf
+(BZ2_bzBuffToBuffCompres) 137.489 Tj
+1 TJm
+(s) 5.9778 Tj
+[1 0 0 1 431.074 569.817] cm
+0 g
+0 G
+[1 0 0 1 -431.074 -569.817] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+431.074 569.817 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 435.577 569.817] cm
+0 g
+0 G
+[1 0 0 1 -435.577 -569.817] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+435.577 569.817 Td
+/F130_0 9.963 Tf
+(BZ2_bzBuffToBuffDecompre) 143.467 Tj
+1 TJm
+(ss) 11.9556 Tj
+[1 0 0 1 590.994 569.817] cm
+0 g
+0 G
+[1 0 0 1 -518.994 -1.564] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -558.29] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 547.899 Td
+/F128_0 9.963 Tf
+(When) 23.7916 Tj
+-250 TJm
+(compiled) 37.0823 Tj
+-250 TJm
+(lik) 10.5209 Tj
+10 TJm
+(e) 4.42357 Tj
+-250 TJm
+(this,) 16.8873 Tj
+-250 TJm
+(all) 9.963 Tj
+-249 TJm
+(functions) 37.0823 Tj
+-250 TJm
+(will) 15.5024 Tj
+-250 TJm
+(ignore) 25.4555 Tj
+[1 0 0 1 272.526 547.899] cm
+0 g
+0 G
+[1 0 0 1 -272.526 -547.899] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+272.526 547.899 Td
+/F130_0 9.963 Tf
+(verbosity) 53.8002 Tj
+[1 0 0 1 326.324 547.899] cm
+0 g
+0 G
+[1 0 0 1 -326.324 -547.899] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+328.815 547.899 Td
+/F128_0 9.963 Tf
+(settings.) 32.9377 Tj
+[1 0 0 1 72 545.742] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -535.78] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 517.278 Td
+/F121_0 17.215 Tf
+(3.7.2.) 43.0719 Tj
+-278 TJm
+(Critical) 58.3589 Tj
+-278 TJm
+(err) 22.9648 Tj
+20 TJm
+(or) 17.215 Tj
+-278 TJm
+(handling) 71.7349 Tj
+[1 0 0 1 72 513.448] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -503.485] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 495.36 Td
+/F130_0 9.963 Tf
+(libbzip2) 47.8224 Tj
+[1 0 0 1 119.821 495.36] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -495.36] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+124.529 495.36 Td
+/F128_0 9.963 Tf
+(contains) 33.2067 Tj
+-472 TJm
+(a) 4.42357 Tj
+-473 TJm
+(number) 30.437 Tj
+-472 TJm
+(of) 8.29918 Tj
+-473 TJm
+(internal) 30.437 Tj
+-472 TJm
+(assertion) 35.4185 Tj
+-473 TJm
+(checks) 27.1093 Tj
+-472 TJm
+(which) 24.3496 Tj
+-473 TJm
+(sho) 13.8386 Tj
+1 TJm
+(uld,) 15.2235 Tj
+-529 TJm
+(needles) 29.879 Tj
+1 TJm
+(s) 3.87561 Tj
+-473 TJm
+(to) 7.75121 Tj
+-473 TJm
+(sa) 8.29918 Tj
+1 TJm
+(y) 4.9815 Tj
+65 TJm
+(,) 2.49075 Tj
+-529 TJm
+(ne) 9.40507 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-472 TJm
+(be) 9.40507 Tj
+-473 TJm
+(acti) 14.3866 Tj
+25 TJm
+(v) 4.9815 Tj
+25 TJm
+(ated.) 19.0891 Tj
+72 483.405 Td
+(Ne) 11.6169 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ertheless,) 37.3513 Tj
+-532 TJm
+(if) 6.08739 Tj
+-476 TJm
+(an) 9.40507 Tj
+-476 TJm
+(assertion) 35.4185 Tj
+-476 TJm
+(should) 26.5713 Tj
+-476 TJm
+(f) 3.31768 Tj
+10 TJm
+(ail,) 12.4538 Tj
+-533 TJm
+(beha) 18.8101 Tj
+21 TJm
+(viour) 21.0319 Tj
+-476 TJm
+(depends) 32.6488 Tj
+-476 TJm
+(on) 9.963 Tj
+-476 TJm
+(whether) 32.0908 Tj
+-476 TJm
+(or) 8.29918 Tj
+-476 TJm
+(not) 12.7327 Tj
+-476 TJm
+(the) 12.1748 Tj
+-476 TJm
+(library) 26.5614 Tj
+-476 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-476 TJm
+(compiled) 37.0823 Tj
+-476 TJm
+(with) 17.7142 Tj
+[1 0 0 1 72 471.45] cm
+0 g
+0 G
+[1 0 0 1 -72 -471.45] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 471.45 Td
+/F130_0 9.963 Tf
+(BZ_NO_STDIO) 65.7558 Tj
+[1 0 0 1 137.753 471.45] cm
+0 g
+0 G
+[1 0 0 1 -137.753 -471.45] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+140.244 471.45 Td
+/F128_0 9.963 Tf
+(set.) 13.5596 Tj
+[1 0 0 1 72 470.284] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -460.322] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 449.532 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(normal) 28.2252 Tj
+-250 TJm
+(compile,) 34.5915 Tj
+-250 TJm
+(an) 9.40507 Tj
+-250 TJm
+(asse) 16.5984 Tj
+1 TJm
+(rtion) 18.8201 Tj
+-250 TJm
+(f) 3.31768 Tj
+10 TJm
+(ailure) 22.6858 Tj
+-250 TJm
+(yields) 23.8016 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(message:) 36.5244 Tj
+[1 0 0 1 72 447.375] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -437.413] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 427.614 Td
+/F128_0 9.963 Tf
+(bzip2/libbzip2:) 60.3359 Tj
+-310 TJm
+(internal) 30.437 Tj
+-250 TJm
+(err) 11.0589 Tj
+1 TJm
+(or) 8.29918 Tj
+-250 TJm
+(number) 30.437 Tj
+-250 TJm
+(N.) 9.68404 Tj
+[1 0 0 1 72 425.458] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -415.495] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+108 405.697 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-475 TJm
+(is) 6.64532 Tj
+-476 TJm
+(a) 4.42357 Tj
+-476 TJm
+(b) 4.9815 Tj
+20 TJm
+(u) 4.9815 Tj
+1 TJm
+(g) 4.9815 Tj
+-476 TJm
+(in) 7.75121 Tj
+-476 TJm
+(bzi) 12.1748 Tj
+1 TJm
+(p2/libbzip2,) 47.8822 Tj
+-532 TJm
+(1.0.3) 19.926 Tj
+-476 TJm
+(of) 8.29918 Tj
+-475 TJm
+(15) 9.963 Tj
+-476 TJm
+(February) 35.9664 Tj
+-475 TJm
+(2005.) 22.4168 Tj
+-987 TJm
+(Please) 25.4555 Tj
+-475 TJm
+(report) 23.7916 Tj
+-476 TJm
+(it) 5.53943 Tj
+-475 TJm
+(to) 7.75121 Tj
+-476 TJm
+(me) 12.1748 Tj
+-475 TJm
+(at:) 9.963 Tj
+-761 TJm
+(jse-) 14.3866 Tj
+108 393.741 Td
+(w) 7.19329 Tj
+10 TJm
+(ard@bzip.or) 49.8449 Tj
+18 TJm
+(g.) 7.47225 Tj
+-1091 TJm
+(If) 6.63536 Tj
+-329 TJm
+(this) 14.3965 Tj
+-328 TJm
+(happened) 38.1782 Tj
+-329 TJm
+(wh) 12.1748 Tj
+1 TJm
+(en) 9.40507 Tj
+-329 TJm
+(you) 14.9445 Tj
+-329 TJm
+(w) 7.19329 Tj
+1 TJm
+(ere) 12.1648 Tj
+-329 TJm
+(using) 21.5898 Tj
+-328 TJm
+(some) 21.0319 Tj
+-329 TJm
+(program) 33.7546 Tj
+-328 TJm
+(which) 24.3496 Tj
+-329 TJm
+(uses) 17.1563 Tj
+-328 TJm
+(libbzip2) 32.6587 Tj
+-329 TJm
+(as) 8.29918 Tj
+-328 TJm
+(a) 4.42357 Tj
+108 381.786 Td
+(component,) 46.7663 Tj
+-323 TJm
+(you) 14.9445 Tj
+-309 TJm
+(should) 26.5713 Tj
+-308 TJm
+(also) 16.0504 Tj
+-309 TJm
+(report) 23.7916 Tj
+-309 TJm
+(this) 14.3965 Tj
+-308 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug) 9.963 Tj
+-309 TJm
+(to) 7.75121 Tj
+-309 TJm
+(the) 12.1748 Tj
+-308 TJm
+(author\(s\)) 35.9664 Tj
+-309 TJm
+(of) 8.29918 Tj
+-309 TJm
+(tha) 12.1748 Tj
+1 TJm
+(t) 2.76971 Tj
+-309 TJm
+(program.) 36.2454 Tj
+-972 TJm
+(Please) 25.4555 Tj
+-309 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e) 4.42357 Tj
+-309 TJm
+(an) 9.40507 Tj
+-308 TJm
+(ef-) 11.0589 Tj
+108 369.831 Td
+(fort) 14.3866 Tj
+-315 TJm
+(to) 7.75121 Tj
+-315 TJm
+(report) 23.7916 Tj
+-316 TJm
+(this) 14.3965 Tj
+-315 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug;) 12.7327 Tj
+-348 TJm
+(timely) 25.4654 Tj
+-315 TJm
+(and) 14.3866 Tj
+-315 TJm
+(accurate) 33.1868 Tj
+-315 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug) 9.963 Tj
+-315 TJm
+(reports) 27.6673 Tj
+-316 TJm
+(e) 4.42357 Tj
+26 TJm
+(v) 4.9815 Tj
+15 TJm
+(entually) 32.1008 Tj
+-316 TJm
+(lead) 16.5984 Tj
+-315 TJm
+(to) 7.75121 Tj
+-315 TJm
+(higher) 25.4555 Tj
+-315 TJm
+(quality) 27.6772 Tj
+-315 TJm
+(softw) 22.1378 Tj
+10 TJm
+(are.) 14.6556 Tj
+108 357.876 Td
+(Thanks.) 31.8218 Tj
+-620 TJm
+(Julian) 23.8016 Tj
+-250 TJm
+(Se) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(ard,) 15.2135 Tj
+-250 TJm
+(15) 9.963 Tj
+-250 TJm
+(Fe) 9.963 Tj
+1 TJm
+(bruary) 26.0034 Tj
+-250 TJm
+(2005.) 22.4168 Tj
+[1 0 0 1 72 355.719] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -335.794] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 325.995 Td
+/F128_0 9.963 Tf
+(where) 24.3396 Tj
+[1 0 0 1 98.831 325.995] cm
+0 g
+0 G
+[1 0 0 1 -98.831 -325.995] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+98.831 325.995 Td
+/F130_0 9.963 Tf
+(N) 5.9778 Tj
+[1 0 0 1 104.809 325.995] cm
+0 g
+0 G
+[1 0 0 1 -104.809 -325.995] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+107.301 325.995 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(some) 21.0319 Tj
+-250 TJm
+(error) 19.3581 Tj
+-250 TJm
+(code) 18.8101 Tj
+-251 TJm
+(nu) 9.963 Tj
+1 TJm
+(mber) 20.474 Tj
+55 TJm
+(.) 2.49075 Tj
+-622 TJm
+(If) 6.63536 Tj
+[1 0 0 1 230.81 325.995] cm
+0 g
+0 G
+[1 0 0 1 -230.81 -325.995] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+230.81 325.995 Td
+/F130_0 9.963 Tf
+(N) 5.9778 Tj
+-600 TJm
+(==) 11.9556 Tj
+-600 TJm
+(1007) 23.9112 Tj
+[1 0 0 1 284.608 325.995] cm
+0 g
+0 G
+[1 0 0 1 -284.608 -325.995] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+284.608 325.995 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(it) 5.53943 Tj
+-250 TJm
+(also) 16.0504 Tj
+-250 TJm
+(prints) 22.6957 Tj
+-251 TJm
+(som) 16.6083 Tj
+1 TJm
+(e) 4.42357 Tj
+-251 TJm
+(e) 4.42357 Tj
+15 TJm
+(xtra) 15.4925 Tj
+-250 TJm
+(te) 7.19329 Tj
+15 TJm
+(xt) 7.75121 Tj
+-250 TJm
+(advising) 33.7646 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(reader) 24.8876 Tj
+-250 TJm
+(that) 14.9445 Tj
+-250 TJm
+(unreliable) 39.842 Tj
+72 314.04 Td
+(memory) 33.2067 Tj
+-425 TJm
+(i) 2.76971 Tj
+1 TJm
+(s) 3.87561 Tj
+-425 TJm
+(often) 20.474 Tj
+-425 TJm
+(associate) 35.9664 Tj
+1 TJm
+(d) 4.9815 Tj
+-425 TJm
+(with) 17.7142 Tj
+-425 TJm
+(internal) 30.437 Tj
+-424 TJm
+(error) 19.3581 Tj
+-425 TJm
+(1007.) 22.4168 Tj
+-834 TJm
+(\(This) 21.0319 Tj
+-424 TJm
+(is) 6.64532 Tj
+-425 TJm
+(a) 4.42357 Tj
+-424 TJm
+(frequently-observ) 70.827 Tj
+15 TJm
+(ed-phenomenon) 64.1916 Tj
+-425 TJm
+(w) 7.19329 Tj
+1 TJm
+(ith) 10.5209 Tj
+-425 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersions) 28.2252 Tj
+72 302.085 Td
+(1.0.0/1.0.1\).) 48.4301 Tj
+[1 0 0 1 72 300.302] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -290.339] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 280.167 Td
+/F130_0 9.963 Tf
+(exit\(3\)) 41.8446 Tj
+[1 0 0 1 113.843 280.167] cm
+0 g
+0 G
+[1 0 0 1 -113.843 -280.167] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+116.334 280.167 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(then) 17.1563 Tj
+-250 TJm
+(called.) 26.2824 Tj
+[1 0 0 1 72 279.002] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -269.039] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 258.25 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-250 TJm
+(a) 4.42357 Tj
+[1 0 0 1 95.093 258.25] cm
+0 g
+0 G
+[1 0 0 1 -95.093 -258.25] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.093 258.25 Td
+/F130_0 9.963 Tf
+(stdio) 29.889 Tj
+[1 0 0 1 124.981 258.25] cm
+0 g
+0 G
+[1 0 0 1 -124.981 -258.25] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+124.981 258.25 Td
+/F128_0 9.963 Tf
+(-free) 18.8002 Tj
+-250 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+-250 TJm
+(assertion) 35.4185 Tj
+-250 TJm
+(f) 3.31768 Tj
+10 TJm
+(ailure) 22.6858 Tj
+1 TJm
+(s) 3.87561 Tj
+-250 TJm
+(result) 22.1378 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(call) 14.3866 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(function) 33.2067 Tj
+-250 TJm
+(declared) 33.7447 Tj
+-250 TJm
+(as:) 11.0689 Tj
+[1 0 0 1 72 256.093] cm
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.323] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -246.728] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 246.728 Td
+/F130_0 9.963 Tf
+(extern) 35.8668 Tj
+-426 TJm
+(void) 23.9112 Tj
+-426 TJm
+(bz_internal_e) 77.7114 Tj
+1 TJm
+(rror) 23.9112 Tj
+-426 TJm
+(\() 5.9778 Tj
+-426 TJm
+(int) 17.9334 Tj
+-426 TJm
+(errcode) 41.8446 Tj
+-426 TJm
+(\);) 11.9556 Tj
+[1 0 0 1 72 231.186] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -221.223] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 209.268 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-250 TJm
+(rele) 14.9345 Tj
+25 TJm
+(v) 4.9815 Tj
+25 TJm
+(ant) 12.1748 Tj
+-250 TJm
+(code) 18.8101 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(passed) 26.5614 Tj
+-250 TJm
+(a) 4.42357 Tj
+1 TJm
+(s) 3.87561 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(parameter) 39.8321 Tj
+55 TJm
+(.) 2.49075 Tj
+-620 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-250 TJm
+(should) 26.5713 Tj
+-250 TJm
+(supply) 26.5713 Tj
+-250 TJm
+(such) 18.2622 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(function.) 35.6974 Tj
+[1 0 0 1 72 207.111] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -197.149] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 187.35 Td
+/F128_0 9.963 Tf
+(In) 8.29918 Tj
+-294 TJm
+(either) 22.6858 Tj
+-294 TJm
+(case,) 19.6371 Tj
+-305 TJm
+(once) 18.8101 Tj
+-295 TJm
+(an) 9.40507 Tj
+-294 TJm
+(assertion) 35.4185 Tj
+-294 TJm
+(f) 3.31768 Tj
+10 TJm
+(ailure) 22.6858 Tj
+-294 TJm
+(has) 13.2807 Tj
+-294 TJm
+(occurred,) 37.3413 Tj
+-305 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+[1 0 0 1 306.541 187.35] cm
+0 g
+0 G
+[1 0 0 1 -306.541 -187.35] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+306.541 187.35 Td
+/F130_0 9.963 Tf
+(bz_stream) 53.8002 Tj
+[1 0 0 1 360.34 187.35] cm
+0 g
+0 G
+[1 0 0 1 -360.34 -187.35] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+363.271 187.35 Td
+/F128_0 9.963 Tf
+(records) 29.3211 Tj
+-294 TJm
+(in) 7.75121 Tj
+40 TJm
+(v) 4.9815 Tj
+20 TJm
+(olv) 12.7327 Tj
+15 TJm
+(ed) 9.40507 Tj
+-294 TJm
+(can) 13.8286 Tj
+-294 TJm
+(be) 9.40507 Tj
+-294 TJm
+(re) 7.74125 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(arded) 22.1278 Tj
+-295 TJm
+(as) 8.29918 Tj
+-294 TJm
+(in) 7.75121 Tj
+40 TJm
+(v) 4.9815 Tj
+25 TJm
+(alid.) 17.4353 Tj
+72 175.395 Td
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-250 TJm
+(should) 26.5713 Tj
+-250 TJm
+(not) 12.7327 Tj
+-250 TJm
+(attempt) 29.889 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(res) 11.6169 Tj
+1 TJm
+(ume) 17.1563 Tj
+-250 TJm
+(normal) 28.2252 Tj
+-250 TJm
+(operation) 37.6303 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(them.) 22.4168 Tj
+[1 0 0 1 72 173.238] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -163.276] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 153.477 Td
+/F128_0 9.963 Tf
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-299 TJm
+(m) 7.75121 Tj
+1 TJm
+(ay) 9.40507 Tj
+65 TJm
+(,) 2.49075 Tj
+-311 TJm
+(of) 8.29918 Tj
+-299 TJm
+(course,) 28.4942 Tj
+-310 TJm
+(change) 28.2152 Tj
+-299 TJm
+(critical) 27.6673 Tj
+-298 TJm
+(error) 19.3581 Tj
+-299 TJm
+(ha) 9.40507 Tj
+1 TJm
+(ndling) 25.4654 Tj
+-299 TJm
+(to) 7.75121 Tj
+-298 TJm
+(suit) 14.3965 Tj
+-299 TJm
+(your) 18.2622 Tj
+-298 TJm
+(needs.) 25.1765 Tj
+-912 TJm
+(As) 11.0689 Tj
+-298 TJm
+(I) 3.31768 Tj
+-299 TJm
+(said) 16.0504 Tj
+-298 TJm
+(abo) 14.3866 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e,) 6.91432 Tj
+-311 TJm
+(critical) 27.6673 Tj
+-298 TJm
+(errors) 23.2337 Tj
+-299 TJm
+(indic) 19.926 Tj
+1 TJm
+(ate) 11.6169 Tj
+-299 TJm
+(b) 4.9815 Tj
+20 TJm
+(ugs) 13.8386 Tj
+72 141.522 Td
+(in) 7.75121 Tj
+-263 TJm
+(the) 12.1748 Tj
+-263 TJm
+(library) 26.5614 Tj
+-263 TJm
+(and) 14.3866 Tj
+-263 TJm
+(s) 3.87561 Tj
+1 TJm
+(hould) 22.6957 Tj
+-263 TJm
+(not) 12.7327 Tj
+-263 TJm
+(occur) 22.1278 Tj
+55 TJm
+(.) 2.49075 Tj
+-698 TJm
+(All) 12.7327 Tj
+-263 TJm
+("normal") 36.355 Tj
+-263 TJm
+(er) 7.74125 Tj
+1 TJm
+(ror) 11.6169 Tj
+-263 TJm
+(situations) 38.1981 Tj
+-263 TJm
+(are) 12.1648 Tj
+-263 TJm
+(indicated) 36.5244 Tj
+-263 TJm
+(via) 12.1748 Tj
+-263 TJm
+(error) 19.3581 Tj
+-263 TJm
+(retu) 15.4925 Tj
+1 TJm
+(rn) 8.29918 Tj
+-263 TJm
+(codes) 22.6858 Tj
+-263 TJm
+(from) 19.3681 Tj
+-263 TJm
+(functions,) 39.573 Tj
+72 129.567 Td
+(and) 14.3866 Tj
+-250 TJm
+(can) 13.8286 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(reco) 17.1463 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(ered) 17.1463 Tj
+-250 TJm
+(from.) 21.8588 Tj
+[1 0 0 1 72 129.468] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -119.505] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 94.814 Td
+/F121_0 20.659 Tf
+(3.8.) 34.4592 Tj
+-278 TJm
+(Making) 71.1703 Tj
+-278 TJm
+(a) 11.4864 Tj
+-278 TJm
+(Windo) 63.1132 Tj
+15 TJm
+(ws) 27.5591 Tj
+-278 TJm
+(DLL) 40.1611 Tj
+[1 0 0 1 72 90.218] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 0 -29.403] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.974] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -51.071] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 51.071 Td
+/F128_0 9.963 Tf
+(29) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 33 33
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -8.911] cm
+0 g
+0 G
+[1 0 0 1 0 8.911] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 84.08 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -350.151 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+434.231 749.245 Td
+/F128_0 9.963 Tf
+(Programming) 54.7965 Tj
+-250 TJm
+(with) 17.7142 Tj
+-250 TJm
+(libbzip2) 32.6587 Tj
+[1 0 0 1 266.071 747.089] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -5.037] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -540 -741.554] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(Ev) 11.0689 Tj
+15 TJm
+(erything) 33.2067 Tj
+-452 TJm
+(related) 27.1093 Tj
+-452 TJm
+(to) 7.75121 Tj
+-453 TJm
+(W) 9.40507 Tj
+40 TJm
+(indo) 17.7142 Tj
+25 TJm
+(ws) 11.0689 Tj
+-452 TJm
+(has) 13.2807 Tj
+-452 TJm
+(been) 18.8101 Tj
+-453 TJm
+(c) 4.42357 Tj
+1 TJm
+(ontrib) 23.8016 Tj
+20 TJm
+(uted) 17.1563 Tj
+-453 TJm
+(by) 9.963 Tj
+-452 TJm
+(Y) 7.19329 Tj
+110 TJm
+(oshioka) 30.9949 Tj
+-452 TJm
+(Tsuneo) 29.3311 Tj
+-452 TJm
+(\() 3.31768 Tj
+[1 0 0 1 390.56 710.037] cm
+0 g
+0 G
+[1 0 0 1 -390.56 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+390.56 710.037 Td
+/F130_0 9.963 Tf
+(QWF00133@niftyserve.or.jp) 149.445 Tj
+[1 0 0 1 540 710.037] cm
+0 g
+0 G
+[1 0 0 1 -540 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 698.082 Td
+/F128_0 9.963 Tf
+(/) 2.76971 Tj
+[1 0 0 1 80.825 698.082] cm
+0 g
+0 G
+[1 0 0 1 -80.825 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+80.825 698.082 Td
+/F130_0 9.963 Tf
+(tsuneo-y@is.aist-nara.ac.) 149.445 Tj
+1 TJm
+(jp) 11.9556 Tj
+[1 0 0 1 242.22 698.082] cm
+0 g
+0 G
+[1 0 0 1 -242.22 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+242.22 698.082 Td
+/F128_0 9.963 Tf
+(\),) 5.80843 Tj
+-697 TJm
+(so) 8.85711 Tj
+-608 TJm
+(you) 14.9445 Tj
+-608 TJm
+(should) 26.5713 Tj
+-607 TJm
+(send) 18.2622 Tj
+-608 TJm
+(your) 18.2622 Tj
+-608 TJm
+(queries) 28.7731 Tj
+-607 TJm
+(to) 7.75121 Tj
+-608 TJm
+(him) 15.5024 Tj
+-608 TJm
+(\(b) 8.29918 Tj
+20 TJm
+(ut) 7.75121 Tj
+-608 TJm
+(perha) 22.1278 Tj
+1 TJm
+(ps) 8.85711 Tj
+-608 TJm
+(Cc:) 13.8386 Tj
+-1026 TJm
+(me,) 14.6655 Tj
+[1 0 0 1 72 686.127] cm
+0 g
+0 G
+[1 0 0 1 -72 -686.127] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 686.127 Td
+/F130_0 9.963 Tf
+(jseward@bzip.org) 95.6448 Tj
+[1 0 0 1 167.641 686.127] cm
+0 g
+0 G
+[1 0 0 1 -167.641 -686.127] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+167.641 686.127 Td
+/F128_0 9.963 Tf
+(\).) 5.80843 Tj
+[1 0 0 1 72 684.344] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -674.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 664.209 Td
+/F128_0 9.963 Tf
+(My) 13.8386 Tj
+-367 TJm
+(v) 4.9815 Tj
+25 TJm
+(ague) 18.8101 Tj
+-367 TJm
+(understanding) 56.4504 Tj
+-367 TJm
+(of) 8.29918 Tj
+-367 TJm
+(what) 19.3681 Tj
+-367 TJm
+(to) 7.75121 Tj
+-367 TJm
+(do) 9.963 Tj
+-367 TJm
+(is:) 9.41504 Tj
+-544 TJm
+(using) 21.5898 Tj
+-367 TJm
+(V) 7.19329 Tj
+60 TJm
+(isual) 18.8201 Tj
+-367 TJm
+(C++) 17.8836 Tj
+-367 TJm
+(5.0,) 14.9445 Tj
+-397 TJm
+(open) 19.3681 Tj
+-367 TJm
+(the) 12.1748 Tj
+-367 TJm
+(project) 27.6673 Tj
+-367 TJm
+(\002le) 12.7327 Tj
+[1 0 0 1 432.966 664.209] cm
+0 g
+0 G
+[1 0 0 1 -432.966 -664.209] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+432.966 664.209 Td
+/F130_0 9.963 Tf
+(libbz2.dsp) 59.778 Tj
+[1 0 0 1 492.742 664.209] cm
+0 g
+0 G
+[1 0 0 1 -492.742 -664.209] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+492.742 664.209 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-396 TJm
+(and) 14.3866 Tj
+-367 TJm
+(b) 4.9815 Tj
+20 TJm
+(uild.) 17.9932 Tj
+72 652.254 Td
+(That') 21.5799 Tj
+55 TJm
+(s) 3.87561 Tj
+-250 TJm
+(all.) 12.4538 Tj
+[1 0 0 1 72 652.155] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -642.192] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 630.336 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-284 TJm
+(you) 14.9445 Tj
+-284 TJm
+(can') 17.1463 Tj
+18 TJm
+(t) 2.76971 Tj
+-284 TJm
+(open) 19.3681 Tj
+-285 TJm
+(the) 12.1748 Tj
+-284 TJm
+(project) 27.6673 Tj
+-284 TJm
+(\002le) 12.7327 Tj
+-284 TJm
+(for) 11.6169 Tj
+-284 TJm
+(some) 21.0319 Tj
+-284 TJm
+(reason,) 28.4942 Tj
+-293 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e) 4.42357 Tj
+-284 TJm
+(a) 4.42357 Tj
+-284 TJm
+(ne) 9.40507 Tj
+25 TJm
+(w) 7.19329 Tj
+-284 TJm
+(one,) 16.8773 Tj
+-293 TJm
+(naming) 29.889 Tj
+-284 TJm
+(these) 20.474 Tj
+-284 TJm
+(\002les:) 19.378 Tj
+[1 0 0 1 424.505 630.336] cm
+0 g
+0 G
+[1 0 0 1 -424.505 -630.336] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+424.505 630.336 Td
+/F130_0 9.963 Tf
+(blocksort.c) 65.7558 Tj
+[1 0 0 1 490.259 630.336] cm
+0 g
+0 G
+[1 0 0 1 -490.259 -630.336] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+490.259 630.336 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 495.666 630.336] cm
+0 g
+0 G
+[1 0 0 1 -495.666 -630.336] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+495.666 630.336 Td
+/F130_0 9.963 Tf
+(bzlib.c) 41.8446 Tj
+[1 0 0 1 537.509 630.336] cm
+0 g
+0 G
+[1 0 0 1 -537.509 -630.336] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+537.509 630.336 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 72 618.381] cm
+0 g
+0 G
+[1 0 0 1 -72 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 618.381 Td
+/F130_0 9.963 Tf
+(compress.c) 59.778 Tj
+[1 0 0 1 131.776 618.381] cm
+0 g
+0 G
+[1 0 0 1 -131.776 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+131.776 618.381 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 136.436 618.381] cm
+0 g
+0 G
+[1 0 0 1 -136.436 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+136.436 618.381 Td
+/F130_0 9.963 Tf
+(crctable.c) 59.778 Tj
+[1 0 0 1 196.211 618.381] cm
+0 g
+0 G
+[1 0 0 1 -196.211 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+196.211 618.381 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 200.871 618.381] cm
+0 g
+0 G
+[1 0 0 1 -200.871 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+200.871 618.381 Td
+/F130_0 9.963 Tf
+(decompress.c) 71.7336 Tj
+[1 0 0 1 272.602 618.381] cm
+0 g
+0 G
+[1 0 0 1 -272.602 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+272.602 618.381 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 277.262 618.381] cm
+0 g
+0 G
+[1 0 0 1 -277.262 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+277.262 618.381 Td
+/F130_0 9.963 Tf
+(huffman.c) 53.8002 Tj
+[1 0 0 1 331.06 618.381] cm
+0 g
+0 G
+[1 0 0 1 -331.06 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+331.06 618.381 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 335.72 618.381] cm
+0 g
+0 G
+[1 0 0 1 -335.72 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+335.72 618.381 Td
+/F130_0 9.963 Tf
+(randtable.c) 65.7558 Tj
+[1 0 0 1 401.473 618.381] cm
+0 g
+0 G
+[1 0 0 1 -401.473 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+403.562 618.381 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 420.037 618.381] cm
+0 g
+0 G
+[1 0 0 1 -420.037 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+420.037 618.381 Td
+/F130_0 9.963 Tf
+(libbz2.def) 59.778 Tj
+[1 0 0 1 479.812 618.381] cm
+0 g
+0 G
+[1 0 0 1 -479.812 -618.381] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+479.812 618.381 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-593 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-210 TJm
+(will) 15.5024 Tj
+-209 TJm
+(also) 16.0504 Tj
+72 606.426 Td
+(need) 18.8101 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(name) 21.5799 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(header) 26.5514 Tj
+-250 TJm
+(\002les) 16.6083 Tj
+[1 0 0 1 190.415 606.426] cm
+0 g
+0 G
+[1 0 0 1 -190.415 -606.426] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+190.415 606.426 Td
+/F130_0 9.963 Tf
+(bzlib.h) 41.8446 Tj
+[1 0 0 1 232.258 606.426] cm
+0 g
+0 G
+[1 0 0 1 -232.258 -606.426] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+234.749 606.426 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 251.625 606.426] cm
+0 g
+0 G
+[1 0 0 1 -251.625 -606.426] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+251.625 606.426 Td
+/F130_0 9.963 Tf
+(bzlib_private.h) 89.667 Tj
+[1 0 0 1 341.289 606.426] cm
+0 g
+0 G
+[1 0 0 1 -341.289 -606.426] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+341.289 606.426 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 604.862] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -594.899] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 584.508 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(don') 18.2622 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(VC++,) 27.5676 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(ma) 12.1748 Tj
+1 TJm
+(y) 4.9815 Tj
+-250 TJm
+(need) 18.8101 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(de\002ne) 24.3496 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(proprocessor) 51.4589 Tj
+-250 TJm
+(symbol) 29.341 Tj
+[1 0 0 1 363.634 584.508] cm
+0 g
+0 G
+[1 0 0 1 -363.634 -584.508] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+363.634 584.508 Td
+/F130_0 9.963 Tf
+(_WIN32) 35.8668 Tj
+[1 0 0 1 399.5 584.508] cm
+0 g
+0 G
+[1 0 0 1 -399.5 -584.508] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+399.5 584.508 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 582.351] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -572.389] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 562.59 Td
+/F128_0 9.963 Tf
+(Finally) 28.2351 Tj
+65 TJm
+(,) 2.49075 Tj
+[1 0 0 1 104.568 562.59] cm
+0 g
+0 G
+[1 0 0 1 -104.568 -562.59] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+104.568 562.59 Td
+/F130_0 9.963 Tf
+(dlltest.c) 53.8002 Tj
+[1 0 0 1 158.366 562.59] cm
+0 g
+0 G
+[1 0 0 1 -158.366 -562.59] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+160.856 562.59 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(sample) 28.2252 Tj
+-250 TJm
+(program) 33.7546 Tj
+-250 TJm
+(using) 21.5898 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(D) 7.19329 Tj
+1 TJm
+(LL.) 14.6655 Tj
+-500 TJm
+(It) 6.08739 Tj
+-250 TJm
+(has) 13.2807 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(project) 27.6673 Tj
+-250 TJm
+(\002le,) 15.2235 Tj
+[1 0 0 1 388.58 562.59] cm
+0 g
+0 G
+[1 0 0 1 -388.58 -562.59] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+388.58 562.59 Td
+/F130_0 9.963 Tf
+(dlltest.dsp) 65.7558 Tj
+[1 0 0 1 454.333 562.59] cm
+0 g
+0 G
+[1 0 0 1 -454.333 -562.59] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+454.333 562.59 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 560.433] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -550.471] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 540.672 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(just) 14.3965 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e\002le) 17.1563 Tj
+-250 TJm
+(fo) 8.29918 Tj
+1 TJm
+(r) 3.31768 Tj
+-250 TJm
+(V) 7.19329 Tj
+60 TJm
+(isual) 18.8201 Tj
+-250 TJm
+(C,) 9.13607 Tj
+-250 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(look) 17.7142 Tj
+-250 TJm
+(at) 7.19329 Tj
+[1 0 0 1 292.212 540.672] cm
+0 g
+0 G
+[1 0 0 1 -292.212 -540.672] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+292.212 540.672 Td
+/F130_0 9.963 Tf
+(makefile.msc) 71.7336 Tj
+[1 0 0 1 363.943 540.672] cm
+0 g
+0 G
+[1 0 0 1 -363.943 -540.672] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+363.943 540.672 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 538.516] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -528.553] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 518.755 Td
+/F128_0 9.963 Tf
+(Be) 11.0689 Tj
+-291 TJm
+(a) 4.42357 Tj
+15 TJm
+(w) 7.19329 Tj
+10 TJm
+(are) 12.1648 Tj
+-291 TJm
+(that) 14.9445 Tj
+-291 TJm
+(if) 6.08739 Tj
+-291 TJm
+(you) 14.9445 Tj
+-291 TJm
+(compile) 32.1008 Tj
+[1 0 0 1 192.07 518.755] cm
+0 g
+0 G
+[1 0 0 1 -192.07 -518.755] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+192.07 518.755 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 221.957 518.755] cm
+0 g
+0 G
+[1 0 0 1 -221.957 -518.755] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+224.857 518.755 Td
+/F128_0 9.963 Tf
+(itself) 19.926 Tj
+-291 TJm
+(on) 9.963 Tj
+-291 TJm
+(W) 9.40507 Tj
+40 TJm
+(in32,) 20.205 Tj
+-301 TJm
+(you) 14.9445 Tj
+-291 TJm
+(must) 19.378 Tj
+-291 TJm
+(set) 11.0689 Tj
+[1 0 0 1 346.842 518.755] cm
+0 g
+0 G
+[1 0 0 1 -346.842 -518.755] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+346.842 518.755 Td
+/F130_0 9.963 Tf
+(BZ_UNIX) 41.8446 Tj
+[1 0 0 1 388.685 518.755] cm
+0 g
+0 G
+[1 0 0 1 -388.685 -518.755] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+391.584 518.755 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-291 TJm
+(0) 4.9815 Tj
+-291 TJm
+(and) 14.3866 Tj
+[1 0 0 1 427.399 518.755] cm
+0 g
+0 G
+[1 0 0 1 -427.399 -518.755] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+427.399 518.755 Td
+/F130_0 9.963 Tf
+(BZ_LCCWIN32) 65.7558 Tj
+[1 0 0 1 493.153 518.755] cm
+0 g
+0 G
+[1 0 0 1 -493.153 -518.755] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+496.052 518.755 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-291 TJm
+(1,) 7.47225 Tj
+-301 TJm
+(in) 7.75121 Tj
+-291 TJm
+(the) 12.1748 Tj
+72 506.8 Td
+(\002le) 12.7327 Tj
+[1 0 0 1 87.223 506.799] cm
+0 g
+0 G
+[1 0 0 1 -87.223 -506.799] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+87.223 506.799 Td
+/F130_0 9.963 Tf
+(bzip2.c) 41.8446 Tj
+[1 0 0 1 129.066 506.799] cm
+0 g
+0 G
+[1 0 0 1 -129.066 -506.799] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+129.066 506.799 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(before) 25.4455 Tj
+-250 TJm
+(compiling.) 42.9007 Tj
+-310 TJm
+(Otherwi) 32.6488 Tj
+1 TJm
+(se) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(resulting) 34.8705 Tj
+-250 TJm
+(binary) 25.4555 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(on') 13.2807 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork) 13.2807 Tj
+-250 TJm
+(correctly) 35.4085 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 504.643] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -494.68] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 484.882 Td
+/F128_0 9.963 Tf
+(I) 3.31768 Tj
+-250 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(en') 12.7228 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(tried) 18.2622 Tj
+-250 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(this) 14.3965 Tj
+-250 TJm
+(stuf) 14.9445 Tj
+25 TJm
+(f) 3.31768 Tj
+-249 TJm
+(myself,) 29.61 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(it) 5.53943 Tj
+-250 TJm
+(all) 9.963 Tj
+-250 TJm
+(looks) 21.5898 Tj
+-250 TJm
+(plausible.) 38.4671 Tj
+[1 0 0 1 72 482.725] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -431.873] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(30) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 34 34
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 140.398 0] cm
+0 g
+0 G
+[1 0 0 1 -140.398 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -13.948] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -21.554] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -720] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 701.916 Td
+/F121_0 24.79 Tf
+(4.) 20.6749 Tj
+-278 TJm
+(Miscellanea) 139.171 Tj
+[1 0 0 1 72 701.606] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.135] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -14.116] cm
+0 g
+0 G
+[1 0 0 1 -72 -678.355] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 658.006 Td
+/F121_0 17.215 Tf
+(T) 10.5184 Tj
+80 TJm
+(ab) 20.0899 Tj
+10 TJm
+(le) 14.3573 Tj
+-278 TJm
+(of) 16.251 Tj
+-278 TJm
+(Contents) 74.5926 Tj
+[1 0 0 1 72 649.183] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -11.74] cm
+0 g
+0 G
+[1 0 0 1 -72 -637.443] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 637.443 Td
+/F128_0 9.963 Tf
+(4.1.) 14.9445 Tj
+-310 TJm
+(Limitations) 45.9494 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(comp) 22.1378 Tj
+1 TJm
+(ressed) 24.8975 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+-250 TJm
+(format) 26.5614 Tj
+[1 0 0 1 255.231 637.443] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -260.212 -637.443] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+269.154 637.443 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 637.443] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -637.443] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 637.443 Td
+/F128_0 9.963 Tf
+(31) 9.963 Tj
+[1 0 0 1 516.09 637.443] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -72 -625.488] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 625.488 Td
+/F128_0 9.963 Tf
+(4.2.) 14.9445 Tj
+-310 TJm
+(Portability) 42.0737 Tj
+-250 TJm
+(issues) 23.8016 Tj
+[1 0 0 1 158.395 625.488] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -163.376 -625.488] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+172.03 625.488 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 625.488] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -625.488] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 625.488 Td
+/F128_0 9.963 Tf
+(32) 9.963 Tj
+[1 0 0 1 516.09 625.488] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -72 -613.533] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 613.533 Td
+/F128_0 9.963 Tf
+(4.3.) 14.9445 Tj
+-310 TJm
+(Reporting) 39.852 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ugs) 13.8386 Tj
+[1 0 0 1 150.993 613.533] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 -155.975 -613.533] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+166.115 613.533 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 613.533] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -613.533] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 613.533 Td
+/F128_0 9.963 Tf
+(32) 9.963 Tj
+[1 0 0 1 516.09 613.533] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -72 -601.578] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 601.578 Td
+/F128_0 9.963 Tf
+(4.4.) 14.9445 Tj
+-310 TJm
+(Did) 14.9445 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(get) 12.1748 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(right) 18.8201 Tj
+-250 TJm
+(packa) 23.2337 Tj
+1 TJm
+(ge?) 13.8286 Tj
+[1 0 0 1 212.602 601.578] cm
+0 g
+0 G
+[1 0 0 1 3.088 0] cm
+0 g
+0 G
+[1 0 0 1 3.088 0] cm
+0 g
+0 G
+[1 0 0 1 -218.778 -601.578] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+229.109 601.578 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 601.578] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -601.578] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 601.578 Td
+/F128_0 9.963 Tf
+(33) 9.963 Tj
+[1 0 0 1 516.09 601.578] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.798] cm
+0 g
+0 G
+[1 0 0 1 -72 -589.623] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 589.623 Td
+/F128_0 9.963 Tf
+(4.5.) 14.9445 Tj
+-310 TJm
+(Further) 29.3311 Tj
+-250 TJm
+(Reading) 33.2067 Tj
+[1 0 0 1 155.058 589.623] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 -160.039 -589.623] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+170.361 589.623 Td
+/F143_0 9.963 Tf
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+-166 TJm
+(:) 2.76971 Tj
+-167 TJm
+(:) 2.76971 Tj
+[1 0 0 1 506.127 589.623] cm
+0 g
+0 G
+[1 0 0 1 -506.127 -589.623] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+506.127 589.623 Td
+/F128_0 9.963 Tf
+(34) 9.963 Tj
+[1 0 0 1 516.09 589.623] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -444.09 -2.157] cm
+0 g
+0 G
+[1 0 0 1 0 -9.135] cm
+0 g
+0 G
+[1 0 0 1 0 -9.631] cm
+0 g
+0 G
+[1 0 0 1 -72 -568.7] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 558.901 Td
+/F128_0 9.963 Tf
+(These) 23.7916 Tj
+-250 TJm
+(are) 12.1648 Tj
+-250 TJm
+(just) 14.3965 Tj
+-250 TJm
+(some) 21.0319 Tj
+-250 TJm
+(random) 30.437 Tj
+-249 TJm
+(thoughts) 34.3225 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(mine.) 22.4168 Tj
+-620 TJm
+(Y) 7.19329 Tj
+110 TJm
+(our) 13.2807 Tj
+-250 TJm
+(mileage) 31.5429 Tj
+-250 TJm
+(may) 17.1563 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(ary) 12.7228 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 556.744] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.631] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -547.113] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 524.48 Td
+/F121_0 20.659 Tf
+(4.1.) 34.4592 Tj
+-278 TJm
+(Limitations) 110.195 Tj
+-278 TJm
+(of) 19.5021 Tj
+-278 TJm
+(the) 30.9885 Tj
+-278 TJm
+(compres) 86.1067 Tj
+1 TJm
+(sed) 35.5955 Tj
+-278 TJm
+(\002le) 29.8523 Tj
+-278 TJm
+(f) 6.87945 Tj
+20 TJm
+(ormat) 57.3907 Tj
+[1 0 0 1 72 520.203] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.631] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -510.572] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 502.893 Td
+/F130_0 9.963 Tf
+(bzip2-1.0.X) 65.7558 Tj
+[1 0 0 1 137.753 502.893] cm
+0 g
+0 G
+[1 0 0 1 -137.753 -502.893] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+137.753 502.893 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+[1 0 0 1 143.405 502.893] cm
+0 g
+0 G
+[1 0 0 1 -143.405 -502.893] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+143.405 502.893 Td
+/F130_0 9.963 Tf
+(0.9.5) 29.889 Tj
+[1 0 0 1 173.293 502.893] cm
+0 g
+0 G
+[1 0 0 1 -173.293 -502.893] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+176.453 502.893 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 194 502.893] cm
+0 g
+0 G
+[1 0 0 1 -194 -502.893] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+194 502.893 Td
+/F130_0 9.963 Tf
+(0.9.0) 29.889 Tj
+[1 0 0 1 223.888 502.893] cm
+0 g
+0 G
+[1 0 0 1 -223.888 -502.893] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+227.048 502.893 Td
+/F128_0 9.963 Tf
+(use) 13.2807 Tj
+-317 TJm
+(e) 4.42357 Tj
+15 TJm
+(xactly) 24.3496 Tj
+-317 TJm
+(the) 12.1748 Tj
+-318 TJm
+(s) 3.87561 Tj
+1 TJm
+(ame) 16.5984 Tj
+-318 TJm
+(\002le) 12.7327 Tj
+-317 TJm
+(format) 26.5614 Tj
+-317 TJm
+(as) 8.29918 Tj
+-317 TJm
+(the) 12.1748 Tj
+-317 TJm
+(original) 30.9949 Tj
+-317 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersion,) 26.8403 Tj
+[1 0 0 1 455.801 502.893] cm
+0 g
+0 G
+[1 0 0 1 -455.801 -502.893] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+455.801 502.893 Td
+/F130_0 9.963 Tf
+(bzip2-0.1) 53.8002 Tj
+[1 0 0 1 509.599 502.893] cm
+0 g
+0 G
+[1 0 0 1 -509.599 -502.893] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+509.599 502.893 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-1023 TJm
+(This) 17.7142 Tj
+72 490.938 Td
+(decision) 33.2067 Tj
+-222 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-221 TJm
+(made) 21.5799 Tj
+-222 TJm
+(in) 7.75121 Tj
+-222 TJm
+(the) 12.1748 Tj
+-222 TJm
+(interests) 33.2067 Tj
+-221 TJm
+(of) 8.29918 Tj
+-222 TJm
+(stability) 32.1107 Tj
+65 TJm
+(.) 2.49075 Tj
+-601 TJm
+(Creating) 34.3126 Tj
+-222 TJm
+(yet) 12.1748 Tj
+-222 TJm
+(another) 29.879 Tj
+-222 TJm
+(inc) 12.1748 Tj
+1 TJm
+(ompatible) 39.852 Tj
+-222 TJm
+(compressed) 47.0353 Tj
+-222 TJm
+(\002le) 12.7327 Tj
+-222 TJm
+(form) 19.3681 Tj
+1 TJm
+(at) 7.19329 Tj
+-222 TJm
+(w) 7.19329 Tj
+10 TJm
+(ould) 17.7142 Tj
+-222 TJm
+(create) 23.7817 Tj
+72 478.983 Td
+(further) 27.1093 Tj
+-250 TJm
+(confusion) 39.2941 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(disrupti) 30.4469 Tj
+1 TJm
+(on) 9.963 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(users.) 22.9647 Tj
+[1 0 0 1 72 476.826] cm
+0 g
+0 G
+[1 0 0 1 0 -9.632] cm
+0 g
+0 G
+[1 0 0 1 -72 -467.194] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 457.396 Td
+/F128_0 9.963 Tf
+(Ne) 11.6169 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ertheless,) 37.3513 Tj
+-233 TJm
+(this) 14.3965 Tj
+-230 TJm
+(is) 6.64532 Tj
+-229 TJm
+(not) 12.7327 Tj
+-230 TJm
+(a) 4.42357 Tj
+-229 TJm
+(painless) 32.1008 Tj
+-230 TJm
+(decisio) 28.2252 Tj
+1 TJm
+(n.) 7.47225 Tj
+-607 TJm
+(De) 11.6169 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(elopment) 37.0823 Tj
+-229 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork) 13.2807 Tj
+-230 TJm
+(si) 6.64532 Tj
+1 TJm
+(nce) 13.8286 Tj
+-230 TJm
+(the) 12.1748 Tj
+-229 TJm
+(release) 27.6573 Tj
+-230 TJm
+(of) 8.29918 Tj
+[1 0 0 1 407.317 457.396] cm
+0 g
+0 G
+[1 0 0 1 -407.317 -457.396] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+407.317 457.396 Td
+/F130_0 9.963 Tf
+(bzip2-0.1) 53.8002 Tj
+[1 0 0 1 461.115 457.396] cm
+0 g
+0 G
+[1 0 0 1 -461.115 -457.396] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+463.402 457.396 Td
+/F128_0 9.963 Tf
+(in) 7.75121 Tj
+-229 TJm
+(August) 28.7831 Tj
+-230 TJm
+(1997) 19.926 Tj
+-229 TJm
+(has) 13.2807 Tj
+72 445.441 Td
+(sho) 13.8386 Tj
+25 TJm
+(wn) 12.1748 Tj
+-226 TJm
+(comple) 29.3311 Tj
+15 TJm
+(xities) 21.5898 Tj
+-225 TJm
+(in) 7.75121 Tj
+-226 TJm
+(the) 12.1748 Tj
+-226 TJm
+(\002le) 12.7327 Tj
+-226 TJm
+(forma) 23.7916 Tj
+1 TJm
+(t) 2.76971 Tj
+-226 TJm
+(which) 24.3496 Tj
+-226 TJm
+(slo) 11.6268 Tj
+25 TJm
+(w) 7.19329 Tj
+-226 TJm
+(do) 9.963 Tj
+25 TJm
+(wn) 12.1748 Tj
+-225 TJm
+(decompression) 59.768 Tj
+-226 TJm
+(and,) 16.8773 Tj
+-231 TJm
+(in) 7.75121 Tj
+-225 TJm
+(retrospect,) 41.7749 Tj
+-231 TJm
+(are) 12.1648 Tj
+-226 TJm
+(unnecess) 35.9664 Tj
+1 TJm
+(ary) 12.7228 Tj
+65 TJm
+(.) 2.49075 Tj
+-604 TJm
+(These) 23.7916 Tj
+-226 TJm
+(are:) 14.9345 Tj
+[1 0 0 1 72 443.284] cm
+0 g
+0 G
+[1 0 0 1 0 -29.062] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -414.222] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 414.222 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 414.222] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -414.222] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 414.222 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-265 TJm
+(run-length) 41.5059 Tj
+-265 TJm
+(encoder) 31.5329 Tj
+40 TJm
+(,) 2.49075 Tj
+-269 TJm
+(which) 24.3496 Tj
+-266 TJm
+(is) 6.64532 Tj
+-265 TJm
+(the) 12.1748 Tj
+-265 TJm
+(\002rst) 15.5024 Tj
+-265 TJm
+(of) 8.29918 Tj
+-266 TJm
+(the) 12.1748 Tj
+-265 TJm
+(compression) 50.363 Tj
+-265 TJm
+(transformations,) 65.0285 Tj
+-269 TJm
+(is) 6.64532 Tj
+-265 TJm
+(entirely) 30.437 Tj
+-265 TJm
+(irrele) 21.0219 Tj
+25 TJm
+(v) 4.9815 Tj
+25 TJm
+(ant.) 14.6655 Tj
+-712 TJm
+(The) 15.4925 Tj
+-265 TJm
+(original) 30.9949 Tj
+86.944 402.267 Td
+(purpose) 31.5429 Tj
+-301 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-301 TJm
+(to) 7.75121 Tj
+-301 TJm
+(protect) 27.6673 Tj
+-301 TJm
+(the) 12.1748 Tj
+-301 TJm
+(sorting) 27.6772 Tj
+-301 TJm
+(algorit) 26.0134 Tj
+1 TJm
+(hm) 12.7327 Tj
+-301 TJm
+(from) 19.3681 Tj
+-301 TJm
+(the) 12.1748 Tj
+-301 TJm
+(v) 4.9815 Tj
+15 TJm
+(ery) 12.7228 Tj
+-301 TJm
+(w) 7.19329 Tj
+10 TJm
+(orst) 14.9445 Tj
+-301 TJm
+(case) 17.1463 Tj
+-301 TJm
+(input:) 23.2536 Tj
+-412 TJm
+(a) 4.42357 Tj
+-301 TJm
+(string) 22.6957 Tj
+-301 TJm
+(of) 8.29918 Tj
+-301 TJm
+(repeated) 33.7447 Tj
+-301 TJm
+(symbols.) 35.7074 Tj
+-926 TJm
+(But) 14.3965 Tj
+86.944 390.312 Td
+(algorithm) 38.7461 Tj
+-274 TJm
+(steps) 19.926 Tj
+-274 TJm
+(Q6a) 16.5984 Tj
+-275 TJm
+(and) 14.3866 Tj
+-274 TJm
+(Q6b) 17.1563 Tj
+-274 TJm
+(in) 7.75121 Tj
+-274 TJm
+(the) 12.1748 Tj
+-275 TJm
+(original) 30.9949 Tj
+-274 TJm
+(Burro) 23.2437 Tj
+25 TJm
+(ws-Wheeler) 48.1313 Tj
+-274 TJm
+(technical) 35.9664 Tj
+-274 TJm
+(report) 23.7916 Tj
+-274 TJm
+(\(SRC-124\)) 43.7276 Tj
+-274 TJm
+(sho) 13.8386 Tj
+25 TJm
+(w) 7.19329 Tj
+-275 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-274 TJm
+(repeats) 28.2152 Tj
+-274 TJm
+(can) 13.8286 Tj
+86.944 378.357 Td
+(be) 9.40507 Tj
+-250 TJm
+(handled) 31.5429 Tj
+-250 TJm
+(without) 30.4469 Tj
+-250 TJm
+(dif) 11.0689 Tj
+25 TJm
+(\002culty) 25.4654 Tj
+-249 TJm
+(in) 7.75121 Tj
+-250 TJm
+(block) 22.1378 Tj
+-250 TJm
+(sorting.) 30.168 Tj
+[1 0 0 1 269.617 378.357] cm
+0 g
+0 G
+[1 0 0 1 -197.617 -21.587] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -356.77] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 356.77 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 356.77] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -356.77] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 356.77 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-293 TJm
+(randomisation) 57.0083 Tj
+-293 TJm
+(mechanism) 45.3815 Tj
+-293 TJm
+(doesn') 26.5614 Tj
+18 TJm
+(t) 2.76971 Tj
+-293 TJm
+(really) 22.6858 Tj
+-293 TJm
+(need) 18.8101 Tj
+-293 TJm
+(to) 7.75121 Tj
+-293 TJm
+(be) 9.40507 Tj
+-293 TJm
+(there.) 22.4068 Tj
+-879 TJm
+(Udi) 14.9445 Tj
+-294 TJm
+(Man) 18.2622 Tj
+1 TJm
+(ber) 12.7228 Tj
+-294 TJm
+(and) 14.3866 Tj
+-293 TJm
+(Gene) 21.0219 Tj
+-293 TJm
+(Myers) 25.4555 Tj
+-293 TJm
+(published) 38.7461 Tj
+-293 TJm
+(a) 4.42357 Tj
+-293 TJm
+(suf) 12.1748 Tj
+25 TJm
+(\002x) 10.5209 Tj
+86.944 344.815 Td
+(array) 20.464 Tj
+-238 TJm
+(construction) 49.2571 Tj
+-238 TJm
+(algorithm) 38.7461 Tj
+-239 TJm
+(a) 4.42357 Tj
+-238 TJm
+(fe) 7.74125 Tj
+25 TJm
+(w) 7.19329 Tj
+-238 TJm
+(years) 21.0219 Tj
+-238 TJm
+(back,) 21.3009 Tj
+-241 TJm
+(which) 24.3496 Tj
+-238 TJm
+(can) 13.8286 Tj
+-238 TJm
+(be) 9.40507 Tj
+-239 TJm
+(emplo) 24.9075 Tj
+10 TJm
+(yed) 14.3866 Tj
+-238 TJm
+(to) 7.75121 Tj
+-238 TJm
+(sort) 14.9445 Tj
+-239 TJm
+(a) 4.42357 Tj
+1 TJm
+(n) 4.9815 Tj
+15 TJm
+(y) 4.9815 Tj
+-239 TJm
+(block,) 24.6285 Tj
+-240 TJm
+(no) 9.963 Tj
+-239 TJm
+(matter) 25.4555 Tj
+-238 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-238 TJm
+(repetiti) 28.2252 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e,) 6.91432 Tj
+86.944 332.86 Td
+(in) 7.75121 Tj
+-229 TJm
+(O\(N) 17.7043 Tj
+-230 TJm
+(log) 12.7327 Tj
+-229 TJm
+(N\)) 10.511 Tj
+-230 TJm
+(time.) 20.205 Tj
+-606 TJm
+(Subsequent) 45.9394 Tj
+-229 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork) 13.2807 Tj
+-229 TJm
+(by) 9.963 Tj
+-230 TJm
+(K) 7.19329 Tj
+15 TJm
+(unihik) 25.4654 Tj
+10 TJm
+(o) 4.9815 Tj
+-229 TJm
+(Sadakane) 38.1782 Tj
+-230 TJm
+(ha) 9.40507 Tj
+1 TJm
+(s) 3.87561 Tj
+-230 TJm
+(produced) 37.0723 Tj
+-229 TJm
+(a) 4.42357 Tj
+-230 TJm
+(deri) 15.4925 Tj
+25 TJm
+(v) 4.9815 Tj
+25 TJm
+(ati) 9.963 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-229 TJm
+(O\(N) 17.7043 Tj
+-229 TJm
+(\(log) 16.0504 Tj
+-230 TJm
+(N\)^2\)) 23.4828 Tj
+-229 TJm
+(algorithm) 38.7461 Tj
+86.944 320.905 Td
+(which) 24.3496 Tj
+-250 TJm
+(usually) 28.7831 Tj
+-250 TJm
+(outperforms) 48.6991 Tj
+-250 TJm
+(th) 7.75121 Tj
+1 TJm
+(e) 4.42357 Tj
+-250 TJm
+(Manber) 30.9849 Tj
+20 TJm
+(-Myers) 28.7731 Tj
+-250 TJm
+(algorithm.) 41.2369 Tj
+[1 0 0 1 314.189 320.905] cm
+0 g
+0 G
+[1 0 0 1 -242.189 -11.789] cm
+0 g
+0 G
+[1 0 0 1 -72 -309.116] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 299.318 Td
+/F128_0 9.963 Tf
+(I) 3.31768 Tj
+-248 TJm
+(could) 22.1378 Tj
+-248 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-248 TJm
+(changed) 33.1967 Tj
+-248 TJm
+(to) 7.75121 Tj
+-248 TJm
+(Sadakane') 41.4959 Tj
+55 TJm
+(s) 3.87561 Tj
+-248 TJm
+(algor) 20.474 Tj
+1 TJm
+(ithm,) 20.7629 Tj
+-249 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-248 TJm
+(I) 3.31768 Tj
+-248 TJm
+(\002nd) 15.5024 Tj
+-248 TJm
+(it) 5.53943 Tj
+-248 TJm
+(to) 7.75121 Tj
+-248 TJm
+(be) 9.40507 Tj
+-248 TJm
+(slo) 11.6268 Tj
+25 TJm
+(wer) 14.9345 Tj
+-248 TJm
+(than) 17.1563 Tj
+[1 0 0 1 392.444 299.318] cm
+0 g
+0 G
+[1 0 0 1 -392.444 -299.318] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+392.444 299.318 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 422.332 299.318] cm
+0 g
+0 G
+[1 0 0 1 -422.332 -299.318] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+422.332 299.318 Td
+/F128_0 9.963 Tf
+(') 3.31768 Tj
+55 TJm
+(s) 3.87561 Tj
+-248 TJm
+(e) 4.42357 Tj
+15 TJm
+(xisting) 27.1292 Tj
+-248 TJm
+(algorithm) 38.7461 Tj
+-248 TJm
+(for) 11.6169 Tj
+-248 TJm
+(most) 19.378 Tj
+86.944 287.363 Td
+(inputs,) 26.8503 Tj
+-369 TJm
+(and) 14.3866 Tj
+-346 TJm
+(the) 12.1748 Tj
+-346 TJm
+(randomis) 37.0823 Tj
+1 TJm
+(ation) 19.926 Tj
+-346 TJm
+(mechanism) 45.3815 Tj
+-346 TJm
+(p) 4.9815 Tj
+1 TJm
+(rotects) 26.5614 Tj
+-346 TJm
+(adequately) 43.1597 Tj
+-345 TJm
+(ag) 9.40507 Tj
+5 TJm
+(ainst) 18.8201 Tj
+-346 TJm
+(bad) 14.3866 Tj
+-346 TJm
+(cases) 21.0219 Tj
+1 TJm
+(.) 2.49075 Tj
+-1194 TJm
+(I) 3.31768 Tj
+-346 TJm
+(didn') 21.0319 Tj
+18 TJm
+(t) 2.76971 Tj
+-346 TJm
+(think) 20.4839 Tj
+-345 TJm
+(it) 5.53943 Tj
+-346 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-345 TJm
+(a) 4.42357 Tj
+-346 TJm
+(good) 19.926 Tj
+86.944 275.408 Td
+(tradeof) 28.2152 Tj
+25 TJm
+(f) 3.31768 Tj
+-261 TJm
+(to) 7.75121 Tj
+-262 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e.) 6.91432 Tj
+-690 TJm
+(P) 5.53943 Tj
+15 TJm
+(artly) 18.2622 Tj
+-261 TJm
+(this) 14.3965 Tj
+-262 TJm
+(is) 6.64532 Tj
+-261 TJm
+(due) 14.3866 Tj
+-262 TJm
+(to) 7.75121 Tj
+-261 TJm
+(the) 12.1748 Tj
+-262 TJm
+(f) 3.31768 Tj
+10 TJm
+(act) 11.6169 Tj
+-261 TJm
+(that) 14.9445 Tj
+-262 TJm
+(I) 3.31768 Tj
+-262 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-261 TJm
+(not) 12.7327 Tj
+-262 TJm
+(\003ooded) 29.889 Tj
+-261 TJm
+(with) 17.7142 Tj
+-262 TJm
+(email) 22.1378 Tj
+-261 TJm
+(complaints) 43.7276 Tj
+-262 TJm
+(about) 22.1378 Tj
+[1 0 0 1 479.557 275.408] cm
+0 g
+0 G
+[1 0 0 1 -479.557 -275.408] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+479.557 275.408 Td
+/F130_0 9.963 Tf
+(bzip2-0.1) 53.8002 Tj
+[1 0 0 1 533.355 275.408] cm
+0 g
+0 G
+[1 0 0 1 -533.355 -275.408] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+533.355 275.408 Td
+/F128_0 9.963 Tf
+(') 3.31768 Tj
+55 TJm
+(s) 3.87561 Tj
+86.944 263.453 Td
+(performance) 50.343 Tj
+-250 TJm
+(on) 9.963 Tj
+-250 TJm
+(repetiti) 28.2252 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(dat) 12.1748 Tj
+1 TJm
+(a,) 6.91432 Tj
+-250 TJm
+(so) 8.85711 Tj
+-250 TJm
+(perhaps) 30.9849 Tj
+-250 TJm
+(it) 5.53943 Tj
+-250 TJm
+(isn') 14.9445 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(problem) 33.2067 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(real) 14.9345 Tj
+-250 TJm
+(inputs.) 26.8503 Tj
+[1 0 0 1 72 261.296] cm
+0 g
+0 G
+[1 0 0 1 0 -9.632] cm
+0 g
+0 G
+[1 0 0 1 -72 -251.664] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 241.866 Td
+/F128_0 9.963 Tf
+(Probably) 35.9764 Tj
+-289 TJm
+(the) 12.1748 Tj
+-288 TJm
+(best) 16.0504 Tj
+-289 TJm
+(long-term) 39.2941 Tj
+-288 TJm
+(solution,) 34.6015 Tj
+-299 TJm
+(and) 14.3866 Tj
+-288 TJm
+(the) 12.1748 Tj
+-289 TJm
+(one) 14.3866 Tj
+-289 TJm
+(I) 3.31768 Tj
+-288 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-289 TJm
+(incorporated) 50.353 Tj
+-288 TJm
+(into) 15.5024 Tj
+-289 TJm
+(0.9.5) 19.926 Tj
+-289 TJm
+(and) 14.3866 Tj
+-288 TJm
+(abo) 14.3866 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e,) 6.91432 Tj
+-298 TJm
+(is) 6.64532 Tj
+-289 TJm
+(to) 7.75121 Tj
+-289 TJm
+(use) 13.2807 Tj
+-288 TJm
+(the) 12.1748 Tj
+-289 TJm
+(e) 4.42357 Tj
+15 TJm
+(xisting) 27.1292 Tj
+86.944 229.911 Td
+(sorting) 27.6772 Tj
+-451 TJm
+(algorithm) 38.7461 Tj
+-451 TJm
+(initially) 31.0049 Tj
+65 TJm
+(,) 2.49075 Tj
+-502 TJm
+(and) 14.3866 Tj
+-451 TJm
+(f) 3.31768 Tj
+10 TJm
+(all) 9.963 Tj
+-452 TJm
+(back) 18.8101 Tj
+-451 TJm
+(to) 7.75121 Tj
+-451 TJm
+(a) 4.42357 Tj
+-452 TJm
+(O\(N) 17.7043 Tj
+-451 TJm
+(\(log) 16.0504 Tj
+-451 TJm
+(N\)^2\)) 23.4828 Tj
+-451 TJm
+(algorithm) 38.7461 Tj
+-452 TJm
+(if) 6.08739 Tj
+-451 TJm
+(the) 12.1748 Tj
+-451 TJm
+(standard) 33.7546 Tj
+-452 TJm
+(al) 7.19329 Tj
+1 TJm
+(gorithm) 31.5528 Tj
+-452 TJm
+(gets) 16.0504 Tj
+-451 TJm
+(into) 15.5024 Tj
+86.944 217.956 Td
+(dif) 11.0689 Tj
+25 TJm
+(\002culties.) 34.0436 Tj
+[1 0 0 1 72 217.856] cm
+0 g
+0 G
+[1 0 0 1 0 -21.487] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -196.369] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 196.369 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 196.369] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -196.369] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 196.369 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-299 TJm
+(compressed) 47.0353 Tj
+-299 TJm
+(\002le) 12.7327 Tj
+-299 TJm
+(format) 26.5614 Tj
+-299 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-299 TJm
+(ne) 9.40507 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-299 TJm
+(designed) 35.4185 Tj
+-299 TJm
+(to) 7.75121 Tj
+-299 TJm
+(be) 9.40507 Tj
+-299 TJm
+(handled) 31.5429 Tj
+-299 TJm
+(by) 9.963 Tj
+-299 TJm
+(a) 4.42357 Tj
+-299 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+-312 TJm
+(and) 14.3866 Tj
+-299 TJm
+(I) 3.31768 Tj
+-299 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-299 TJm
+(had) 14.3866 Tj
+-299 TJm
+(to) 7.75121 Tj
+-299 TJm
+(jump) 20.4839 Tj
+-299 TJm
+(though) 27.6772 Tj
+-299 TJm
+(some) 21.0319 Tj
+86.944 184.414 Td
+(hoops) 23.8016 Tj
+-278 TJm
+(to) 7.75121 Tj
+-277 TJm
+(produce) 32.0908 Tj
+-278 TJm
+(an) 9.40507 Tj
+-277 TJm
+(ef) 7.74125 Tj
+25 TJm
+(\002cient) 24.9075 Tj
+-278 TJm
+(implementation) 62.5477 Tj
+-277 TJm
+(of) 8.29918 Tj
+-278 TJm
+(decompression.) 62.2588 Tj
+-786 TJm
+(It') 9.40507 Tj
+55 TJm
+(s) 3.87561 Tj
+-278 TJm
+(a) 4.42357 Tj
+-277 TJm
+(bit) 10.5209 Tj
+-278 TJm
+(hairy) 20.474 Tj
+65 TJm
+(.) 2.49075 Tj
+-786 TJm
+(T) 6.08739 Tj
+35 TJm
+(ry) 8.29918 Tj
+-278 TJm
+(passing) 29.889 Tj
+[1 0 0 1 468.269 184.414] cm
+0 g
+0 G
+[1 0 0 1 -468.269 -184.414] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+468.269 184.414 Td
+/F130_0 9.963 Tf
+(decompress.c) 71.7336 Tj
+[1 0 0 1 540 184.414] cm
+0 g
+0 G
+[1 0 0 1 -540 -184.414] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 172.459 Td
+/F128_0 9.963 Tf
+(through) 30.9949 Tj
+-268 TJm
+(the) 12.1748 Tj
+-268 TJm
+(C) 6.64532 Tj
+-268 TJm
+(preprocessor) 50.901 Tj
+-268 TJm
+(and) 14.3866 Tj
+-268 TJm
+(you') 18.2622 Tj
+10 TJm
+(ll) 5.53943 Tj
+-268 TJm
+(see) 12.7228 Tj
+-268 TJm
+(what) 19.3681 Tj
+-268 TJm
+(I) 3.31768 Tj
+-269 TJm
+(mea) 16.5984 Tj
+1 TJm
+(n.) 7.47225 Tj
+-729 TJm
+(Much) 23.2437 Tj
+-268 TJm
+(of) 8.29918 Tj
+-269 TJm
+(this) 14.3965 Tj
+-268 TJm
+(comple) 29.3311 Tj
+15 TJm
+(xit) 10.5209 Tj
+1 TJm
+(y) 4.9815 Tj
+-269 TJm
+(could) 22.1378 Tj
+-268 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-268 TJm
+(been) 18.8101 Tj
+-268 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+20 TJm
+(oided) 22.1378 Tj
+-268 TJm
+(if) 6.08739 Tj
+-268 TJm
+(the) 12.1748 Tj
+86.944 160.503 Td
+(compressed) 47.0353 Tj
+-250 TJm
+(size) 15.4925 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(each) 18.2522 Tj
+-250 TJm
+(bloc) 17.1563 Tj
+1 TJm
+(k) 4.9815 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-250 TJm
+(recorded) 34.8506 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(data) 16.5984 Tj
+-250 TJm
+(stream.) 29.0521 Tj
+[1 0 0 1 368.754 160.503] cm
+0 g
+0 G
+[1 0 0 1 -296.754 -21.586] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -138.917] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 138.917 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 138.917] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -138.917] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 138.917 Td
+/F128_0 9.963 Tf
+(An) 12.1748 Tj
+-250 TJm
+(Adler) 22.6858 Tj
+20 TJm
+(-32) 13.2807 Tj
+-250 TJm
+(checksum,) 42.3328 Tj
+-250 TJm
+(rather) 23.2337 Tj
+-249 TJm
+(than) 17.1563 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(CRC32) 29.899 Tj
+-250 TJm
+(checksum,) 42.3328 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ould) 17.7142 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(f) 3.31768 Tj
+10 TJm
+(aster) 18.8101 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(compute.) 36.8033 Tj
+[1 0 0 1 424.934 138.917] cm
+0 g
+0 G
+[1 0 0 1 -352.934 -11.789] cm
+0 g
+0 G
+[1 0 0 1 -72 -127.128] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 117.33 Td
+/F128_0 9.963 Tf
+(It) 6.08739 Tj
+-349 TJm
+(w) 7.19329 Tj
+10 TJm
+(ould) 17.7142 Tj
+-349 TJm
+(be) 9.40507 Tj
+-348 TJm
+(f) 3.31768 Tj
+10 TJm
+(air) 10.511 Tj
+-349 TJm
+(to) 7.75121 Tj
+-349 TJm
+(say) 13.2807 Tj
+-349 TJm
+(that) 14.9445 Tj
+-348 TJm
+(the) 12.1748 Tj
+[1 0 0 1 201.979 117.33] cm
+0 g
+0 G
+[1 0 0 1 -201.979 -117.33] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+201.979 117.33 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 231.867 117.33] cm
+0 g
+0 G
+[1 0 0 1 -231.867 -117.33] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+235.342 117.33 Td
+/F128_0 9.963 Tf
+(format) 26.5614 Tj
+-349 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-348 TJm
+(frozen) 25.4455 Tj
+-349 TJm
+(before) 25.4455 Tj
+-349 TJm
+(I) 3.31768 Tj
+-349 TJm
+(properl) 28.7731 Tj
+1 TJm
+(y) 4.9815 Tj
+-349 TJm
+(and) 14.3866 Tj
+-349 TJm
+(fully) 18.8201 Tj
+-349 TJm
+(understood) 44.2756 Tj
+-348 TJm
+(the) 12.1748 Tj
+-349 TJm
+(performance) 50.343 Tj
+72 105.375 Td
+(consequences) 54.7766 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(doing) 22.6957 Tj
+-250 TJm
+(so.) 11.3479 Tj
+[1 0 0 1 72 103.218] cm
+0 g
+0 G
+[1 0 0 1 0 -9.631] cm
+0 g
+0 G
+[1 0 0 1 -72 -93.587] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 83.788 Td
+/F128_0 9.963 Tf
+(Impro) 24.3496 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(ements) 28.2252 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(I) 3.31768 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(as) 8.29918 Tj
+-250 TJm
+(abl) 12.1748 Tj
+1 TJm
+(e) 4.42357 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(incorporate) 45.3715 Tj
+-250 TJm
+(into) 15.5024 Tj
+-250 TJm
+(0.9.0,) 22.4168 Tj
+-250 TJm
+(despite) 28.2252 Tj
+-250 TJm
+(using) 21.5898 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(same) 20.474 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+-250 TJm
+(for) 11.6169 Tj
+1 TJm
+(mat,) 17.4353 Tj
+-250 TJm
+(are:) 14.9345 Tj
+[1 0 0 1 72 81.631] cm
+0 g
+0 G
+[1 0 0 1 0 -30.779] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(31) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 35 35
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -6.854] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 116.329 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -382.4 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+498.728 749.245 Td
+/F128_0 9.963 Tf
+(Miscellanea) 48.1412 Tj
+[1 0 0 1 266.071 749.146] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -7.094] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -31.517] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 710.037 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 710.037] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 710.037 Td
+/F128_0 9.963 Tf
+(Single) 25.4654 Tj
+-202 TJm
+(ar) 7.74125 Tj
+1 TJm
+(ray) 12.7228 Tj
+-202 TJm
+(implementation) 62.5477 Tj
+-201 TJm
+(of) 8.29918 Tj
+-202 TJm
+(the) 12.1748 Tj
+-202 TJm
+(in) 7.75121 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(erse) 16.0404 Tj
+-201 TJm
+(BWT) 22.1378 Tj
+74 TJm
+(.) 2.49075 Tj
+-403 TJm
+(This) 17.7142 Tj
+-202 TJm
+(signi\002cantly) 49.267 Tj
+-201 TJm
+(speeds) 26.5614 Tj
+-202 TJm
+(up) 9.963 Tj
+-202 TJm
+(decom) 26.5614 Tj
+1 TJm
+(pression,) 35.6974 Tj
+-212 TJm
+(presuma) 33.7546 Tj
+1 TJm
+(bly) 12.7327 Tj
+-202 TJm
+(because) 31.5329 Tj
+86.944 698.082 Td
+(it) 5.53943 Tj
+-250 TJm
+(reduces) 30.427 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(number) 30.437 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(cach) 18.2522 Tj
+1 TJm
+(e) 4.42357 Tj
+-250 TJm
+(misses.) 29.0621 Tj
+[1 0 0 1 240.496 698.082] cm
+0 g
+0 G
+[1 0 0 1 -168.496 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 676.164 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 676.164] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -676.164] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 676.164 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(aster) 18.8101 Tj
+-314 TJm
+(in) 7.75121 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(erse) 16.0404 Tj
+-315 TJm
+(MTF) 20.4839 Tj
+-314 TJm
+(transform) 38.7361 Tj
+-314 TJm
+(for) 11.6169 Tj
+-315 TJm
+(lar) 10.511 Tj
+18 TJm
+(ge) 9.40507 Tj
+-314 TJm
+(MTF) 20.4839 Tj
+-314 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues.) 22.9647 Tj
+-504 TJm
+(The) 15.4925 Tj
+-314 TJm
+(ne) 9.40507 Tj
+25 TJm
+(w) 7.19329 Tj
+-315 TJm
+(i) 2.76971 Tj
+1 TJm
+(mplementation) 59.778 Tj
+-315 TJm
+(is) 6.64532 Tj
+-314 TJm
+(based) 22.6858 Tj
+-314 TJm
+(on) 9.963 Tj
+-315 TJm
+(the) 12.1748 Tj
+-314 TJm
+(notion) 25.4654 Tj
+-315 TJm
+(of) 8.29918 Tj
+-314 TJm
+(sliding) 27.1292 Tj
+86.944 664.209 Td
+(blocks) 26.0134 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(v) 4.9815 Tj
+25 TJm
+(alues.) 22.9647 Tj
+[1 0 0 1 153.932 664.209] cm
+0 g
+0 G
+[1 0 0 1 -81.932 -21.918] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 642.291 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 642.291] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -86.944 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 642.291 Td
+/F130_0 9.963 Tf
+(bzip2-0.9.0) 65.7558 Tj
+[1 0 0 1 152.697 642.291] cm
+0 g
+0 G
+[1 0 0 1 -152.697 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+155.412 642.291 Td
+/F128_0 9.963 Tf
+(no) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-272 TJm
+(reads) 21.0219 Tj
+-273 TJm
+(and) 14.3866 Tj
+-272 TJm
+(writes) 24.3496 Tj
+-272 TJm
+(\002les) 16.6083 Tj
+-273 TJm
+(with) 17.7142 Tj
+[1 0 0 1 282.68 642.291] cm
+0 g
+0 G
+[1 0 0 1 -282.68 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+282.68 642.291 Td
+/F130_0 9.963 Tf
+(fread) 29.889 Tj
+[1 0 0 1 312.568 642.291] cm
+0 g
+0 G
+[1 0 0 1 -312.568 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+315.282 642.291 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 332.383 642.291] cm
+0 g
+0 G
+[1 0 0 1 -332.383 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+332.383 642.291 Td
+/F130_0 9.963 Tf
+(fwrite) 35.8668 Tj
+[1 0 0 1 368.248 642.291] cm
+0 g
+0 G
+[1 0 0 1 -368.248 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+368.248 642.291 Td
+/F128_0 9.963 Tf
+(;) 2.76971 Tj
+-284 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersion) 24.3496 Tj
+-272 TJm
+(0.1) 12.4538 Tj
+-272 TJm
+(used) 18.2622 Tj
+[1 0 0 1 441.882 642.291] cm
+0 g
+0 G
+[1 0 0 1 -441.882 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+441.882 642.291 Td
+/F130_0 9.963 Tf
+(putc) 23.9112 Tj
+[1 0 0 1 465.792 642.291] cm
+0 g
+0 G
+[1 0 0 1 -465.792 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+468.507 642.291 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 485.607 642.291] cm
+0 g
+0 G
+[1 0 0 1 -485.607 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+485.607 642.291 Td
+/F130_0 9.963 Tf
+(getc) 23.9112 Tj
+[1 0 0 1 509.517 642.291] cm
+0 g
+0 G
+[1 0 0 1 -509.517 -642.291] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+509.517 642.291 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-755 TJm
+(Duh!) 20.474 Tj
+86.944 630.336 Td
+(W) 9.40507 Tj
+80 TJm
+(ell,) 12.4538 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(li) 5.53943 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(learn.) 22.4068 Tj
+[1 0 0 1 184.248 630.336] cm
+0 g
+0 G
+[1 0 0 1 -112.248 -12.119] cm
+0 g
+0 G
+[1 0 0 1 -72 -618.217] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 608.418 Td
+/F128_0 9.963 Tf
+(Further) 29.3311 Tj
+-304 TJm
+(ahead,) 25.7245 Tj
+-318 TJm
+(it) 5.53943 Tj
+-305 TJm
+(w) 7.19329 Tj
+10 TJm
+(ould) 17.7142 Tj
+-304 TJm
+(be) 9.40507 Tj
+-304 TJm
+(nice) 16.5984 Tj
+-305 TJm
+(to) 7.75121 Tj
+-304 TJm
+(be) 9.40507 Tj
+-304 TJm
+(able) 16.5984 Tj
+-305 TJm
+(to) 7.75121 Tj
+-304 TJm
+(do) 9.963 Tj
+-305 TJm
+(random) 30.437 Tj
+-304 TJm
+(access) 25.4455 Tj
+-304 TJm
+(into) 15.5024 Tj
+-305 TJm
+(\002l) 8.30914 Tj
+1 TJm
+(es.) 10.7899 Tj
+-947 TJm
+(This) 17.7142 Tj
+-304 TJm
+(will) 15.5024 Tj
+-305 TJm
+(require) 28.2152 Tj
+-304 TJm
+(some) 21.0319 Tj
+-304 TJm
+(careful) 27.6573 Tj
+-305 TJm
+(design) 26.0134 Tj
+-304 TJm
+(of) 8.29918 Tj
+72 596.463 Td
+(compressed) 47.0353 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+-250 TJm
+(formats.) 32.9277 Tj
+[1 0 0 1 72 594.306] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -584.344] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 561.71 Td
+/F121_0 20.659 Tf
+(4.2.) 34.4592 Tj
+-278 TJm
+(P) 13.7796 Tj
+40 TJm
+(or) 20.659 Tj
+-20 TJm
+(tability) 66.584 Tj
+-278 TJm
+(issues) 64.3115 Tj
+[1 0 0 1 72 557.434] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -547.472] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 539.793 Td
+/F128_0 9.963 Tf
+(After) 21.0219 Tj
+-250 TJm
+(some) 21.0319 Tj
+-250 TJm
+(consideration,) 56.1714 Tj
+-250 TJm
+(I) 3.31768 Tj
+-250 TJm
+(h) 4.9815 Tj
+1 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(decided) 30.9849 Tj
+-250 TJm
+(not) 12.7327 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(use) 13.2807 Tj
+-250 TJm
+(GNU) 21.5799 Tj
+[1 0 0 1 303.231 539.793] cm
+0 g
+0 G
+[1 0 0 1 -303.231 -539.793] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+303.231 539.793 Td
+/F130_0 9.963 Tf
+(autoconf) 47.8224 Tj
+[1 0 0 1 351.052 539.793] cm
+0 g
+0 G
+[1 0 0 1 -351.052 -539.793] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+353.542 539.793 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-250 TJm
+(con\002gure) 37.6303 Tj
+-250 TJm
+(0.9.5) 19.926 Tj
+-250 TJm
+(or) 8.29918 Tj
+-250 TJm
+(1.0.) 14.9445 Tj
+[1 0 0 1 72 537.636] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -527.673] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 517.875 Td
+/F130_0 9.963 Tf
+(autoconf) 47.8224 Tj
+[1 0 0 1 119.821 517.875] cm
+0 g
+0 G
+[1 0 0 1 -119.821 -517.875] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+119.821 517.875 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-502 TJm
+(admirable) 39.842 Tj
+-452 TJm
+(and) 14.3866 Tj
+-452 TJm
+(w) 7.19329 Tj
+10 TJm
+(onderful) 33.7546 Tj
+-452 TJm
+(though) 27.6772 Tj
+-451 TJm
+(it) 5.53943 Tj
+-452 TJm
+(is,) 9.13607 Tj
+-503 TJm
+(mainly) 27.6772 Tj
+-451 TJm
+(assists) 25.4654 Tj
+-452 TJm
+(with) 17.7142 Tj
+-452 TJm
+(portability) 41.5158 Tj
+-452 TJm
+(problems) 37.0823 Tj
+-451 TJm
+(between) 33.1967 Tj
+-452 TJm
+(Unix-lik) 33.7646 Tj
+10 TJm
+(e) 4.42357 Tj
+72 505.92 Td
+(platforms.) 40.6789 Tj
+-1398 TJm
+(But) 14.3965 Tj
+[1 0 0 1 144.784 505.92] cm
+0 g
+0 G
+[1 0 0 1 -144.784 -505.92] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+144.784 505.92 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 174.672 505.92] cm
+0 g
+0 G
+[1 0 0 1 -174.672 -505.92] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+178.455 505.92 Td
+/F128_0 9.963 Tf
+(doesn') 26.5614 Tj
+18 TJm
+(t) 2.76971 Tj
+-380 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+16 TJm
+(e) 4.42357 Tj
+-380 TJm
+(much) 22.1378 Tj
+-380 TJm
+(in) 7.75121 Tj
+-379 TJm
+(the) 12.1748 Tj
+-380 TJm
+(w) 7.19329 Tj
+10 TJm
+(ay) 9.40507 Tj
+-380 TJm
+(of) 8.29918 Tj
+-379 TJm
+(portability) 41.5158 Tj
+-380 TJm
+(problems) 37.0823 Tj
+-379 TJm
+(on) 9.963 Tj
+-380 TJm
+(Unix;) 22.6957 Tj
+-444 TJm
+(most) 19.378 Tj
+-380 TJm
+(of) 8.29918 Tj
+-379 TJm
+(the) 12.1748 Tj
+-380 TJm
+(dif) 11.0689 Tj
+25 TJm
+(\002culties) 31.5528 Tj
+72 493.964 Td
+(appear) 26.5514 Tj
+-297 TJm
+(when) 21.5799 Tj
+-296 TJm
+(porting) 28.7831 Tj
+-297 TJm
+(to) 7.75121 Tj
+-297 TJm
+(the) 12.1748 Tj
+-296 TJm
+(Mac,) 20.195 Tj
+-309 TJm
+(or) 8.29918 Tj
+-296 TJm
+(to) 7.75121 Tj
+-297 TJm
+(Microsoft') 42.6118 Tj
+55 TJm
+(s) 3.87561 Tj
+-297 TJm
+(oper) 17.7043 Tj
+1 TJm
+(ating) 19.926 Tj
+-297 TJm
+(systems.) 34.0436 Tj
+[1 0 0 1 361.339 493.964] cm
+0 g
+0 G
+[1 0 0 1 -361.339 -493.964] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+361.339 493.964 Td
+/F130_0 9.963 Tf
+(autoconf) 47.8224 Tj
+[1 0 0 1 409.16 493.964] cm
+0 g
+0 G
+[1 0 0 1 -409.16 -493.964] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+412.116 493.964 Td
+/F128_0 9.963 Tf
+(doesn') 26.5614 Tj
+18 TJm
+(t) 2.76971 Tj
+-297 TJm
+(help) 17.1563 Tj
+-296 TJm
+(in) 7.75121 Tj
+-297 TJm
+(those) 21.0319 Tj
+-297 TJm
+(cases,) 23.5127 Tj
+-308 TJm
+(and) 14.3866 Tj
+72 482.009 Td
+(brings) 24.9075 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(whole) 24.3496 Tj
+-250 TJm
+(load) 17.1563 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(ne) 9.40507 Tj
+25 TJm
+(w) 7.19329 Tj
+-250 TJm
+(c) 4.42357 Tj
+1 TJm
+(omple) 24.9075 Tj
+15 TJm
+(xity) 15.5024 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 479.852] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -469.89] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 460.091 Td
+/F128_0 9.963 Tf
+(Most) 20.4839 Tj
+-392 TJm
+(people) 26.5614 Tj
+-392 TJm
+(should) 26.5713 Tj
+-392 TJm
+(be) 9.40507 Tj
+-393 TJm
+(able) 16.5984 Tj
+-392 TJm
+(to) 7.75121 Tj
+-392 TJm
+(compile) 32.1008 Tj
+-392 TJm
+(the) 12.1748 Tj
+-392 TJm
+(library) 26.5614 Tj
+-392 TJm
+(and) 14.3866 Tj
+-393 TJm
+(prog) 18.2622 Tj
+1 TJm
+(ram) 15.4925 Tj
+-393 TJm
+(under) 22.6858 Tj
+-392 TJm
+(Unix) 19.926 Tj
+-392 TJm
+(straight) 29.889 Tj
+-392 TJm
+(out-of-the-box,) 60.595 Tj
+-428 TJm
+(so) 8.85711 Tj
+-392 TJm
+(to) 7.75121 Tj
+-392 TJm
+(speak,) 25.1765 Tj
+72 448.136 Td
+(especially) 39.842 Tj
+-250 TJm
+(if) 6.08739 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersio) 19.3681 Tj
+1 TJm
+(n) 4.9815 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(GNU) 21.5799 Tj
+-250 TJm
+(C) 6.64532 Tj
+-250 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+25 TJm
+(ailable.) 29.0521 Tj
+[1 0 0 1 72 445.979] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -436.017] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 426.218 Td
+/F128_0 9.963 Tf
+(There) 23.2337 Tj
+-258 TJm
+(are) 12.1648 Tj
+-259 TJm
+(a) 4.42357 Tj
+-259 TJm
+(coupl) 22.1378 Tj
+1 TJm
+(e) 4.42357 Tj
+-259 TJm
+(of) 8.29918 Tj
+[1 0 0 1 159.561 426.218] cm
+0 g
+0 G
+[1 0 0 1 -159.561 -426.218] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+159.561 426.218 Td
+/F130_0 9.963 Tf
+(__inline__) 59.778 Tj
+[1 0 0 1 219.337 426.218] cm
+0 g
+0 G
+[1 0 0 1 -219.337 -426.218] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+221.913 426.218 Td
+/F128_0 9.963 Tf
+(directi) 25.4555 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(es) 8.29918 Tj
+-258 TJm
+(in) 7.75121 Tj
+-259 TJm
+(the) 12.1748 Tj
+-258 TJm
+(code.) 21.3009 Tj
+-672 TJm
+(GNU) 21.5799 Tj
+-258 TJm
+(C) 6.64532 Tj
+-259 TJm
+(\() 3.31768 Tj
+[1 0 0 1 352.587 426.218] cm
+0 g
+0 G
+[1 0 0 1 -352.587 -426.218] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+352.587 426.218 Td
+/F130_0 9.963 Tf
+(gcc) 17.9334 Tj
+[1 0 0 1 370.52 426.218] cm
+0 g
+0 G
+[1 0 0 1 -370.52 -426.218] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+370.52 426.218 Td
+/F128_0 9.963 Tf
+(\)) 3.31768 Tj
+-259 TJm
+(sho) 13.8386 Tj
+1 TJm
+(uld) 12.7327 Tj
+-259 TJm
+(be) 9.40507 Tj
+-259 TJm
+(able) 16.5984 Tj
+-258 TJm
+(to) 7.75121 Tj
+-259 TJm
+(handle) 26.5614 Tj
+-258 TJm
+(them.) 22.4168 Tj
+-672 TJm
+(If) 6.63536 Tj
+-258 TJm
+(you') 18.2622 Tj
+50 TJm
+(re) 7.74125 Tj
+72 414.263 Td
+(not) 12.7327 Tj
+-279 TJm
+(using) 21.5898 Tj
+-279 TJm
+(GNU) 21.5799 Tj
+-279 TJm
+(C,) 9.13607 Tj
+-279 TJm
+(your) 18.2622 Tj
+-279 TJm
+(C) 6.64532 Tj
+-279 TJm
+(compile) 32.1008 Tj
+1 TJm
+(r) 3.31768 Tj
+-279 TJm
+(shouldn') 34.8705 Tj
+18 TJm
+(t) 2.76971 Tj
+-279 TJm
+(see) 12.7228 Tj
+-279 TJm
+(them) 19.926 Tj
+-279 TJm
+(at) 7.19329 Tj
+-279 TJm
+(all.) 12.4538 Tj
+-794 TJm
+(If) 6.63536 Tj
+-279 TJm
+(your) 18.2622 Tj
+-279 TJm
+(compiler) 35.4185 Tj
+-279 TJm
+(does,) 20.7529 Tj
+-286 TJm
+(for) 11.6169 Tj
+-279 TJm
+(some) 21.0319 Tj
+-279 TJm
+(reason,) 28.4942 Tj
+-286 TJm
+(see) 12.7228 Tj
+-279 TJm
+(them) 19.926 Tj
+-279 TJm
+(and) 14.3866 Tj
+72 402.308 Td
+(doesn') 26.5614 Tj
+18 TJm
+(t) 2.76971 Tj
+-283 TJm
+(lik) 10.5209 Tj
+10 TJm
+(e) 4.42357 Tj
+-283 TJm
+(them,) 22.4168 Tj
+-291 TJm
+(just) 14.3965 Tj
+[1 0 0 1 164.167 402.308] cm
+0 g
+0 G
+[1 0 0 1 -164.167 -402.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+164.167 402.308 Td
+/F130_0 9.963 Tf
+(#define) 41.8446 Tj
+[1 0 0 1 206.01 402.308] cm
+0 g
+0 G
+[1 0 0 1 2.819 0] cm
+0 g
+0 G
+[1 0 0 1 -208.829 -402.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+208.829 402.308 Td
+/F130_0 9.963 Tf
+(__inline__) 59.778 Tj
+[1 0 0 1 268.605 402.308] cm
+0 g
+0 G
+[1 0 0 1 -268.605 -402.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+271.425 402.308 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-283 TJm
+(be) 9.40507 Tj
+[1 0 0 1 294.22 402.308] cm
+0 g
+0 G
+[1 0 0 1 -294.22 -402.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+294.22 402.308 Td
+/F130_0 9.963 Tf
+(/*) 11.9556 Tj
+-600 TJm
+(*/) 11.9556 Tj
+[1 0 0 1 324.108 402.308] cm
+0 g
+0 G
+[1 0 0 1 -324.108 -402.308] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+324.108 402.308 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-818 TJm
+(One) 16.5984 Tj
+-283 TJm
+(easy) 17.7043 Tj
+-283 TJm
+(w) 7.19329 Tj
+10 TJm
+(ay) 9.40507 Tj
+-283 TJm
+(to) 7.75121 Tj
+-283 TJm
+(do) 9.963 Tj
+-283 TJm
+(this) 14.3965 Tj
+-283 TJm
+(is) 6.64532 Tj
+-283 TJm
+(to) 7.75121 Tj
+-283 TJm
+(compile) 32.1008 Tj
+-283 TJm
+(with) 17.7142 Tj
+-283 TJm
+(th) 7.75121 Tj
+1 TJm
+(e) 4.42357 Tj
+-283 TJm
+(\003ag) 14.9445 Tj
+[1 0 0 1 72 390.353] cm
+0 g
+0 G
+[1 0 0 1 -72 -390.353] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 390.353 Td
+/F130_0 9.963 Tf
+(-D__inline__=) 77.7114 Tj
+[1 0 0 1 149.709 390.353] cm
+0 g
+0 G
+[1 0 0 1 -149.709 -390.353] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+149.709 390.353 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-250 TJm
+(which) 24.3496 Tj
+-250 TJm
+(should) 26.5713 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(understood) 44.2756 Tj
+-249 TJm
+(by) 9.963 Tj
+-250 TJm
+(most) 19.378 Tj
+-250 TJm
+(Unix) 19.926 Tj
+-250 TJm
+(compilers.) 41.7848 Tj
+[1 0 0 1 72 388.196] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -378.234] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 368.435 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-321 TJm
+(you) 14.9445 Tj
+-321 TJm
+(still) 14.9545 Tj
+-321 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-322 TJm
+(dif) 11.0689 Tj
+25 TJm
+(\002cul) 17.7142 Tj
+1 TJm
+(ties,) 16.3294 Tj
+-339 TJm
+(try) 11.0689 Tj
+-322 TJm
+(compi) 24.9075 Tj
+1 TJm
+(ling) 15.5024 Tj
+-322 TJm
+(with) 17.7142 Tj
+-321 TJm
+(the) 12.1748 Tj
+-321 TJm
+(macro) 24.8975 Tj
+[1 0 0 1 310.295 368.435] cm
+0 g
+0 G
+[1 0 0 1 -310.295 -368.435] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+310.295 368.435 Td
+/F130_0 9.963 Tf
+(BZ_STRICT_ANSI) 83.6892 Tj
+[1 0 0 1 393.981 368.435] cm
+0 g
+0 G
+[1 0 0 1 -393.981 -368.435] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+397.18 368.435 Td
+/F128_0 9.963 Tf
+(de\002ned.) 31.8218 Tj
+-524 TJm
+(This) 17.7142 Tj
+-321 TJm
+(should) 26.5713 Tj
+-321 TJm
+(enable) 26.0034 Tj
+-321 TJm
+(you) 14.9445 Tj
+-321 TJm
+(to) 7.75121 Tj
+72 356.48 Td
+(b) 4.9815 Tj
+20 TJm
+(uild) 15.5024 Tj
+-321 TJm
+(the) 12.1748 Tj
+-321 TJm
+(library) 26.5614 Tj
+-321 TJm
+(in) 7.75121 Tj
+-322 TJm
+(a) 4.42357 Tj
+-321 TJm
+(strictly) 27.6772 Tj
+-321 TJm
+(ANSI) 23.2437 Tj
+-321 TJm
+(compliant) 39.852 Tj
+-321 TJm
+(en) 9.40507 Tj
+40 TJm
+(vironment.) 43.4486 Tj
+-1047 TJm
+(Building) 34.8805 Tj
+-321 TJm
+(the) 12.1748 Tj
+-321 TJm
+(program) 33.7546 Tj
+-321 TJm
+(itself) 19.926 Tj
+-321 TJm
+(lik) 10.5209 Tj
+10 TJm
+(e) 4.42357 Tj
+-322 TJm
+(this) 14.3965 Tj
+-321 TJm
+(is) 6.64532 Tj
+-321 TJm
+(dangerous) 40.9479 Tj
+-321 TJm
+(and) 14.3866 Tj
+72 344.525 Td
+(not) 12.7327 Tj
+-260 TJm
+(supported,) 41.7848 Tj
+-263 TJm
+(since) 20.474 Tj
+-260 TJm
+(you) 14.9445 Tj
+-260 TJm
+(remo) 20.474 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+[1 0 0 1 204.498 344.525] cm
+0 g
+0 G
+[1 0 0 1 -204.498 -344.525] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+204.498 344.525 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 234.385 344.525] cm
+0 g
+0 G
+[1 0 0 1 -234.385 -344.525] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+234.385 344.525 Td
+/F128_0 9.963 Tf
+(') 3.31768 Tj
+55 TJm
+(s) 3.87561 Tj
+-260 TJm
+(checks) 27.1093 Tj
+-260 TJm
+(ag) 9.40507 Tj
+5 TJm
+(ainst) 18.8201 Tj
+-260 TJm
+(compressing) 50.363 Tj
+-260 TJm
+(directories,) 44.5446 Tj
+-263 TJm
+(symbolic) 36.5343 Tj
+-260 TJm
+(links,) 21.8688 Tj
+-262 TJm
+(de) 9.40507 Tj
+25 TJm
+(vices,) 22.9647 Tj
+-263 TJm
+(and) 14.3866 Tj
+-260 TJm
+(other) 20.474 Tj
+72 332.57 Td
+(not-really-a-\002le) 62.5278 Tj
+-250 TJm
+(entities.) 31.2739 Tj
+-619 TJm
+(This) 17.7142 Tj
+-250 TJm
+(could) 22.1378 Tj
+-250 TJm
+(cause) 22.1278 Tj
+-250 TJm
+(\002lesystem) 40.4099 Tj
+-250 TJm
+(corruption!) 44.8235 Tj
+[1 0 0 1 72 330.413] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -320.45] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 310.652 Td
+/F128_0 9.963 Tf
+(One) 16.5984 Tj
+-392 TJm
+(othe) 17.1563 Tj
+1 TJm
+(r) 3.31768 Tj
+-392 TJm
+(thing:) 23.2536 Tj
+-593 TJm
+(if) 6.08739 Tj
+-392 TJm
+(you) 14.9445 Tj
+-391 TJm
+(create) 23.7817 Tj
+-392 TJm
+(a) 4.42357 Tj
+[1 0 0 1 210.879 310.652] cm
+0 g
+0 G
+[1 0 0 1 -210.879 -310.652] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+210.879 310.652 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 240.767 310.652] cm
+0 g
+0 G
+[1 0 0 1 -240.767 -310.652] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+244.669 310.652 Td
+/F128_0 9.963 Tf
+(binary) 25.4555 Tj
+-392 TJm
+(fo) 8.29918 Tj
+1 TJm
+(r) 3.31768 Tj
+-392 TJm
+(public) 24.9075 Tj
+-392 TJm
+(distrib) 25.4654 Tj
+20 TJm
+(u) 4.9815 Tj
+1 TJm
+(tion,) 17.9932 Tj
+-427 TJm
+(please) 24.8975 Tj
+-392 TJm
+(consider) 33.7546 Tj
+-391 TJm
+(linking) 28.2351 Tj
+-392 TJm
+(it) 5.53943 Tj
+-392 TJm
+(s) 3.87561 Tj
+1 TJm
+(tatically) 32.1008 Tj
+-392 TJm
+(\() 3.31768 Tj
+[1 0 0 1 522.067 310.652] cm
+0 g
+0 G
+[1 0 0 1 -522.067 -310.652] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+522.067 310.652 Td
+/F130_0 9.963 Tf
+(gcc) 17.9334 Tj
+72 298.697 Td
+(-static) 41.8446 Tj
+[1 0 0 1 113.843 298.697] cm
+0 g
+0 G
+[1 0 0 1 -113.843 -298.697] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+113.843 298.697 Td
+/F128_0 9.963 Tf
+(\).) 5.80843 Tj
+-620 TJm
+(This) 17.7142 Tj
+-250 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+20 TJm
+(oids) 16.6083 Tj
+-250 TJm
+(all) 9.963 Tj
+-250 TJm
+(sorts) 18.8201 Tj
+-250 TJm
+(of) 8.29918 Tj
+-250 TJm
+(lib) 10.5209 Tj
+1 TJm
+(rary-v) 24.3396 Tj
+15 TJm
+(ersion) 24.3496 Tj
+-250 TJm
+(issues) 23.8016 Tj
+-250 TJm
+(that) 14.9445 Tj
+-250 TJm
+(others) 24.3496 Tj
+-250 TJm
+(may) 17.1563 Tj
+-250 TJm
+(encounter) 39.2841 Tj
+-250 TJm
+(later) 17.7043 Tj
+-250 TJm
+(on.) 12.4538 Tj
+[1 0 0 1 72 296.54] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -286.577] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 276.779 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-296 TJm
+(you) 14.9445 Tj
+-296 TJm
+(b) 4.9815 Tj
+20 TJm
+(uild) 15.5024 Tj
+[1 0 0 1 122.708 276.779] cm
+0 g
+0 G
+[1 0 0 1 -122.708 -276.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+122.708 276.779 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 152.596 276.779] cm
+0 g
+0 G
+[1 0 0 1 -152.596 -276.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+155.545 276.779 Td
+/F128_0 9.963 Tf
+(on) 9.963 Tj
+-296 TJm
+(W) 9.40507 Tj
+40 TJm
+(in32,) 20.205 Tj
+-307 TJm
+(you) 14.9445 Tj
+-296 TJm
+(must) 19.378 Tj
+-296 TJm
+(set) 11.0689 Tj
+[1 0 0 1 254.965 276.779] cm
+0 g
+0 G
+[1 0 0 1 -254.965 -276.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+254.965 276.779 Td
+/F130_0 9.963 Tf
+(BZ_UNIX) 41.8446 Tj
+[1 0 0 1 296.808 276.779] cm
+0 g
+0 G
+[1 0 0 1 -296.808 -276.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+299.756 276.779 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-296 TJm
+(0) 4.9815 Tj
+-296 TJm
+(and) 14.3866 Tj
+[1 0 0 1 335.72 276.779] cm
+0 g
+0 G
+[1 0 0 1 -335.72 -276.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+335.72 276.779 Td
+/F130_0 9.963 Tf
+(BZ_LCCWIN32) 65.7558 Tj
+[1 0 0 1 401.473 276.779] cm
+0 g
+0 G
+[1 0 0 1 -401.473 -276.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+404.422 276.779 Td
+/F128_0 9.963 Tf
+(to) 7.75121 Tj
+-296 TJm
+(1,) 7.47225 Tj
+-307 TJm
+(in) 7.75121 Tj
+-296 TJm
+(the) 12.1748 Tj
+-296 TJm
+(\002le) 12.7327 Tj
+[1 0 0 1 467.159 276.779] cm
+0 g
+0 G
+[1 0 0 1 -467.159 -276.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+467.159 276.779 Td
+/F130_0 9.963 Tf
+(bzip2.c) 41.8446 Tj
+[1 0 0 1 509.002 276.779] cm
+0 g
+0 G
+[1 0 0 1 -509.002 -276.779] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+509.002 276.779 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-307 TJm
+(before) 25.4455 Tj
+72 264.824 Td
+(compiling.) 42.9007 Tj
+-310 TJm
+(Otherwise) 40.9479 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(re) 7.74125 Tj
+1 TJm
+(sulting) 27.1292 Tj
+-250 TJm
+(binary) 25.4555 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(on') 13.2807 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork) 13.2807 Tj
+-250 TJm
+(correctly) 35.4085 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 262.667] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -252.704] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 230.071 Td
+/F121_0 20.659 Tf
+(4.3.) 34.4592 Tj
+-278 TJm
+(Repor) 59.6839 Tj
+-20 TJm
+(ting) 37.8679 Tj
+-278 TJm
+(b) 12.6226 Tj
+20 TJm
+(ugs) 36.7317 Tj
+[1 0 0 1 72 225.475] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -215.512] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 208.153 Td
+/F128_0 9.963 Tf
+(I) 3.31768 Tj
+-228 TJm
+(tried) 18.2622 Tj
+-228 TJm
+(pretty) 23.2437 Tj
+-228 TJm
+(hard) 17.7043 Tj
+-228 TJm
+(t) 2.76971 Tj
+1 TJm
+(o) 4.9815 Tj
+-228 TJm
+(mak) 17.1563 Tj
+10 TJm
+(e) 4.42357 Tj
+-228 TJm
+(sure) 16.5984 Tj
+[1 0 0 1 196.25 208.153] cm
+0 g
+0 G
+[1 0 0 1 -196.25 -208.153] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+196.25 208.153 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 226.138 208.153] cm
+0 g
+0 G
+[1 0 0 1 -226.138 -208.153] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+228.409 208.153 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-228 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug) 9.963 Tj
+-228 TJm
+(free,) 17.9733 Tj
+-232 TJm
+(both) 17.7142 Tj
+-228 TJm
+(by) 9.963 Tj
+-228 TJm
+(design) 26.0134 Tj
+-228 TJm
+(and) 14.3866 Tj
+-228 TJm
+(by) 9.963 Tj
+-228 TJm
+(te) 7.19329 Tj
+1 TJm
+(sting.) 21.8688 Tj
+-606 TJm
+(Hopefully) 40.4 Tj
+-227 TJm
+(you') 18.2622 Tj
+10 TJm
+(ll) 5.53943 Tj
+-228 TJm
+(ne) 9.40507 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+-228 TJm
+(need) 18.8101 Tj
+-228 TJm
+(to) 7.75121 Tj
+-228 TJm
+(read) 17.1463 Tj
+72 196.198 Td
+(this) 14.3965 Tj
+-250 TJm
+(section) 28.2252 Tj
+-250 TJm
+(for) 11.6169 Tj
+-250 TJm
+(real.) 17.4253 Tj
+[1 0 0 1 72 196.098] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -186.136] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 174.28 Td
+/F128_0 9.963 Tf
+(Ne) 11.6169 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ertheless,) 37.3513 Tj
+-313 TJm
+(if) 6.08739 Tj
+[1 0 0 1 137.751 174.28] cm
+0 g
+0 G
+[1 0 0 1 -137.751 -174.28] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+137.751 174.28 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 167.639 174.28] cm
+0 g
+0 G
+[1 0 0 1 -167.639 -174.28] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+170.634 174.28 Td
+/F128_0 9.963 Tf
+(dies) 16.0504 Tj
+-301 TJm
+(w) 7.19329 Tj
+1 TJm
+(ith) 10.5209 Tj
+-301 TJm
+(a) 4.42357 Tj
+-301 TJm
+(se) 8.29918 Tj
+15 TJm
+(gm) 12.7327 Tj
+1 TJm
+(entation) 32.1008 Tj
+-301 TJm
+(f) 3.31768 Tj
+10 TJm
+(ault,) 17.4353 Tj
+-313 TJm
+(a) 4.42357 Tj
+-301 TJm
+(b) 4.9815 Tj
+20 TJm
+(us) 8.85711 Tj
+-300 TJm
+(error) 19.3581 Tj
+-301 TJm
+(or) 8.29918 Tj
+-300 TJm
+(an) 9.40507 Tj
+-301 TJm
+(internal) 30.437 Tj
+-300 TJm
+(assertion) 35.4185 Tj
+-301 TJm
+(f) 3.31768 Tj
+10 TJm
+(ailure,) 25.1765 Tj
+-313 TJm
+(it) 5.53943 Tj
+-300 TJm
+(will) 15.5024 Tj
+-301 TJm
+(ask) 13.2807 Tj
+-300 TJm
+(you) 14.9445 Tj
+-301 TJm
+(to) 7.75121 Tj
+72 162.325 Td
+(email) 22.1378 Tj
+-242 TJm
+(me) 12.1748 Tj
+-243 TJm
+(a) 4.42357 Tj
+-242 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug) 9.963 Tj
+-243 TJm
+(r) 3.31768 Tj
+1 TJm
+(eport.) 22.9647 Tj
+-615 TJm
+(Experience) 44.8136 Tj
+-243 TJm
+(from) 19.3681 Tj
+-242 TJm
+(years) 21.0219 Tj
+-242 TJm
+(of) 8.29918 Tj
+-243 TJm
+(feedback) 35.9565 Tj
+-242 TJm
+(of) 8.29918 Tj
+-242 TJm
+(bzip2) 22.1378 Tj
+-243 TJm
+(users) 20.474 Tj
+-242 TJm
+(indicates) 35.4185 Tj
+-242 TJm
+(that) 14.9445 Tj
+-243 TJm
+(almost) 26.5713 Tj
+-242 TJm
+(all) 9.963 Tj
+-242 TJm
+(these) 20.474 Tj
+-243 TJm
+(problems) 37.0823 Tj
+-242 TJm
+(can) 13.8286 Tj
+72 150.37 Td
+(be) 9.40507 Tj
+-250 TJm
+(traced) 24.3396 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(either) 22.6858 Tj
+-250 TJm
+(compiler) 35.4185 Tj
+-249 TJm
+(b) 4.9815 Tj
+20 TJm
+(ugs) 13.8386 Tj
+-250 TJm
+(or) 8.29918 Tj
+-250 TJm
+(hardw) 24.8975 Tj
+10 TJm
+(are) 12.1648 Tj
+-250 TJm
+(problems.) 39.573 Tj
+[1 0 0 1 72 148.213] cm
+0 g
+0 G
+[1 0 0 1 0 -97.361] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(32) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 36 36
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -6.854] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 116.329 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -382.4 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+498.728 749.245 Td
+/F128_0 9.963 Tf
+(Miscellanea) 48.1412 Tj
+[1 0 0 1 266.071 749.146] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -7.094] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -468 -31.517] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 710.037 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 710.037] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -710.037] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 710.037 Td
+/F128_0 9.963 Tf
+(Recompile) 43.1697 Tj
+-306 TJm
+(the) 12.1748 Tj
+-306 TJm
+(program) 33.7546 Tj
+-306 TJm
+(with) 17.7142 Tj
+-305 TJm
+(no) 9.963 Tj
+-306 TJm
+(optimisation,) 52.3157 Tj
+-320 TJm
+(and) 14.3866 Tj
+-306 TJm
+(see) 12.7228 Tj
+-306 TJm
+(if) 6.08739 Tj
+-306 TJm
+(it) 5.53943 Tj
+-306 TJm
+(w) 7.19329 Tj
+10 TJm
+(orks.) 19.647 Tj
+-956 TJm
+(And/or) 28.2252 Tj
+-306 TJm
+(try) 11.0689 Tj
+-306 TJm
+(a) 4.42357 Tj
+-306 TJm
+(dif) 11.0689 Tj
+25 TJm
+(fe) 7.74125 Tj
+1 TJm
+(rent) 15.4925 Tj
+-306 TJm
+(compiler) 35.4185 Tj
+55 TJm
+(.) 2.49075 Tj
+-956 TJm
+(I) 3.31768 Tj
+-306 TJm
+(heard) 22.1278 Tj
+-306 TJm
+(all) 9.963 Tj
+86.944 698.082 Td
+(sorts) 18.8201 Tj
+-282 TJm
+(of) 8.29918 Tj
+-282 TJm
+(stories) 26.0134 Tj
+-282 TJm
+(about) 22.1378 Tj
+-282 TJm
+(v) 4.9815 Tj
+25 TJm
+(arious) 24.3496 Tj
+-282 TJm
+(\003a) 9.963 Tj
+20 TJm
+(v) 4.9815 Tj
+20 TJm
+(ours) 17.1563 Tj
+-282 TJm
+(of) 8.29918 Tj
+-282 TJm
+(GNU) 21.5799 Tj
+-282 TJm
+(C) 6.64532 Tj
+-283 TJm
+(\(a) 7.74125 Tj
+1 TJm
+(nd) 9.963 Tj
+-283 TJm
+(other) 20.474 Tj
+-282 TJm
+(compiler) 35.4185 Tj
+1 TJm
+(s\)) 7.19329 Tj
+-283 TJm
+(genera) 26.5514 Tj
+1 TJm
+(ting) 15.5024 Tj
+-283 TJm
+(bad) 14.3866 Tj
+-282 TJm
+(code) 18.8101 Tj
+-282 TJm
+(for) 11.6169 Tj
+[1 0 0 1 472.141 698.082] cm
+0 g
+0 G
+[1 0 0 1 -472.141 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+472.141 698.082 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 502.029 698.082] cm
+0 g
+0 G
+[1 0 0 1 -502.029 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+502.029 698.082 Td
+/F128_0 9.963 Tf
+(,) 2.49075 Tj
+-290 TJm
+(and) 14.3866 Tj
+-282 TJm
+(I') 6.63536 Tj
+50 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+86.944 686.127 Td
+(run) 13.2807 Tj
+-250 TJm
+(across) 24.8975 Tj
+-250 TJm
+(tw) 9.963 Tj
+10 TJm
+(o) 4.9815 Tj
+-250 TJm
+(such) 18.2622 Tj
+-250 TJm
+(e) 4.42357 Tj
+15 TJm
+(xamples) 33.2067 Tj
+-249 TJm
+(myself.) 29.61 Tj
+[1 0 0 1 237.767 686.127] cm
+0 g
+0 G
+[1 0 0 1 -165.767 -12.119] cm
+0 g
+0 G
+[1 0 0 1 -72 -674.008] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 664.209 Td
+/F128_0 9.963 Tf
+(2.7.X) 22.1378 Tj
+-279 TJm
+(v) 4.9815 Tj
+15 TJm
+(ersions) 28.2252 Tj
+-280 TJm
+(of) 8.29918 Tj
+-279 TJm
+(GNU) 21.5799 Tj
+-280 TJm
+(C) 6.64532 Tj
+-279 TJm
+(are) 12.1648 Tj
+-280 TJm
+(kno) 14.9445 Tj
+25 TJm
+(wn) 12.1748 Tj
+-279 TJm
+(to) 7.75121 Tj
+-280 TJm
+(generate) 33.7447 Tj
+-279 TJm
+(bad) 14.3866 Tj
+-280 TJm
+(code) 18.8101 Tj
+-279 TJm
+(from) 19.3681 Tj
+-280 TJm
+(time) 17.7142 Tj
+-279 TJm
+(to) 7.75121 Tj
+-280 TJm
+(time,) 20.205 Tj
+-287 TJm
+(at) 7.19329 Tj
+-279 TJm
+(high) 17.7142 Tj
+-280 TJm
+(optimisation) 49.825 Tj
+-279 TJm
+(le) 7.19329 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(els.) 13.5596 Tj
+-797 TJm
+(If) 6.63536 Tj
+-280 TJm
+(you) 14.9445 Tj
+86.944 652.254 Td
+(get) 12.1748 Tj
+-295 TJm
+(problems,) 39.573 Tj
+-307 TJm
+(try) 11.0689 Tj
+-296 TJm
+(u) 4.9815 Tj
+1 TJm
+(sing) 16.6083 Tj
+-296 TJm
+(the) 12.1748 Tj
+-295 TJm
+(\003ags) 18.8201 Tj
+[1 0 0 1 220.116 652.254] cm
+0 g
+0 G
+[1 0 0 1 -220.116 -652.254] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+220.116 652.254 Td
+/F130_0 9.963 Tf
+(-O2) 17.9334 Tj
+[1 0 0 1 238.049 652.254] cm
+0 g
+0 G
+[1 0 0 1 2.944 0] cm
+0 g
+0 G
+[1 0 0 1 -240.993 -652.254] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+240.993 652.254 Td
+/F130_0 9.963 Tf
+(-fomit-frame-pointer) 119.556 Tj
+[1 0 0 1 360.544 652.254] cm
+0 g
+0 G
+[1 0 0 1 2.944 0] cm
+0 g
+0 G
+[1 0 0 1 -363.488 -652.254] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+363.488 652.254 Td
+/F130_0 9.963 Tf
+(-fno-strength-reduce) 119.556 Tj
+[1 0 0 1 483.04 652.254] cm
+0 g
+0 G
+[1 0 0 1 -483.04 -652.254] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+483.04 652.254 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-893 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-295 TJm
+(should) 26.5713 Tj
+86.944 640.299 Td
+(speci\002cally) 45.3815 Tj
+[1 0 0 1 134.814 640.299] cm
+0 g
+0 G
+[1 0 0 1 -134.814 -640.299] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+134.814 640.299 Td
+/F631_0 9.963 Tf
+(not) 12.7327 Tj
+[1 0 0 1 147.546 640.299] cm
+0 g
+0 G
+[1 0 0 1 -147.546 -640.299] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+150.037 640.299 Td
+/F128_0 9.963 Tf
+(use) 13.2807 Tj
+[1 0 0 1 165.807 640.299] cm
+0 g
+0 G
+[1 0 0 1 -165.807 -640.299] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+165.807 640.299 Td
+/F130_0 9.963 Tf
+(-funroll-loops) 83.6892 Tj
+[1 0 0 1 249.493 640.299] cm
+0 g
+0 G
+[1 0 0 1 -249.493 -640.299] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+249.493 640.299 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+[1 0 0 1 72 638.142] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -628.179] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 618.381 Td
+/F128_0 9.963 Tf
+(Y) 7.19329 Tj
+110 TJm
+(ou) 9.963 Tj
+-249 TJm
+(may) 17.1563 Tj
+-248 TJm
+(notice) 24.3496 Tj
+-249 TJm
+(that) 14.9445 Tj
+-249 TJm
+(the) 12.1748 Tj
+-249 TJm
+(M) 8.85711 Tj
+1 TJm
+(ak) 9.40507 Tj
+10 TJm
+(e\002le) 17.1563 Tj
+-249 TJm
+(runs) 17.1563 Tj
+-249 TJm
+(six) 11.6268 Tj
+-249 TJm
+(test) 13.8386 Tj
+1 TJm
+(s) 3.87561 Tj
+-249 TJm
+(as) 8.29918 Tj
+-249 TJm
+(part) 15.4925 Tj
+-249 TJm
+(of) 8.29918 Tj
+-248 TJm
+(the) 12.1748 Tj
+-249 TJm
+(b) 4.9815 Tj
+20 TJm
+(uild) 15.5024 Tj
+-249 TJm
+(process.) 32.3698 Tj
+-619 TJm
+(If) 6.63536 Tj
+-249 TJm
+(the) 12.1748 Tj
+-248 TJm
+(program) 33.7546 Tj
+-249 TJm
+(passes) 25.4555 Tj
+-249 TJm
+(all) 9.963 Tj
+-248 TJm
+(of) 8.29918 Tj
+-249 TJm
+(these,) 22.9647 Tj
+-249 TJm
+(it') 8.85711 Tj
+55 TJm
+(s) 3.87561 Tj
+86.944 606.426 Td
+(a) 4.42357 Tj
+-250 TJm
+(pretty) 23.2437 Tj
+-250 TJm
+(good) 19.926 Tj
+-250 TJm
+(\(b) 8.29918 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(not) 12.7327 Tj
+-250 TJm
+(100%\)) 26.5614 Tj
+-250 TJm
+(in) 7.75121 Tj
+1 TJm
+(dication) 32.1008 Tj
+-250 TJm
+(that) 14.9445 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(compiler) 35.4185 Tj
+-250 TJm
+(has) 13.2807 Tj
+-250 TJm
+(done) 19.3681 Tj
+-250 TJm
+(its) 9.41504 Tj
+-250 TJm
+(job) 12.7327 Tj
+-250 TJm
+(correctly) 35.4085 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 604.269] cm
+0 g
+0 G
+[1 0 0 1 0 -19.761] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -584.508] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 584.508 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 584.508] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -584.508] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 584.508 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+[1 0 0 1 95.956 584.508] cm
+0 g
+0 G
+[1 0 0 1 -95.956 -584.508] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+95.956 584.508 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 125.844 584.508] cm
+0 g
+0 G
+[1 0 0 1 -125.844 -584.508] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+128.22 584.508 Td
+/F128_0 9.963 Tf
+(crashes) 29.3211 Tj
+-238 TJm
+(randomly) 38.1882 Tj
+65 TJm
+(,) 2.49075 Tj
+-241 TJm
+(and) 14.3866 Tj
+-239 TJm
+(the) 12.1748 Tj
+-238 TJm
+(crashes) 29.3211 Tj
+-239 TJm
+(are) 12.1648 Tj
+-238 TJm
+(not) 12.7327 Tj
+-239 TJm
+(repea) 21.5699 Tj
+1 TJm
+(table,) 21.8588 Tj
+-241 TJm
+(you) 14.9445 Tj
+-239 TJm
+(may) 17.1563 Tj
+-238 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-239 TJm
+(a) 4.42357 Tj
+-238 TJm
+(\003ak) 14.9445 Tj
+15 TJm
+(y) 4.9815 Tj
+-239 TJm
+(memory) 33.2067 Tj
+-238 TJm
+(subsystem.) 44.0066 Tj
+[1 0 0 1 510.112 584.508] cm
+0 g
+0 G
+[1 0 0 1 -510.112 -584.508] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+510.112 584.508 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 540 584.508] cm
+0 g
+0 G
+[1 0 0 1 -540 -584.508] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 572.553 Td
+/F128_0 9.963 Tf
+(really) 22.6858 Tj
+-253 TJm
+(hammers) 36.5244 Tj
+-254 TJm
+(your) 18.2622 Tj
+-253 TJm
+(memory) 33.2067 Tj
+-254 TJm
+(hierarch) 32.6388 Tj
+5 TJm
+(y) 4.9815 Tj
+65 TJm
+(,) 2.49075 Tj
+-254 TJm
+(and) 14.3866 Tj
+-254 TJm
+(if) 6.08739 Tj
+-253 TJm
+(it') 8.85711 Tj
+55 TJm
+(s) 3.87561 Tj
+-254 TJm
+(a) 4.42357 Tj
+-253 TJm
+(bit) 10.5209 Tj
+-254 TJm
+(mar) 15.4925 Tj
+18 TJm
+(ginal,) 22.4168 Tj
+-254 TJm
+(you) 14.9445 Tj
+-254 TJm
+(may) 17.1563 Tj
+-253 TJm
+(get) 12.1748 Tj
+-254 TJm
+(these) 20.474 Tj
+-253 TJm
+(problems.) 39.573 Tj
+-642 TJm
+(D) 7.19329 Tj
+1 TJm
+(itto) 13.2906 Tj
+-254 TJm
+(if) 6.08739 Tj
+-254 TJm
+(you) 14.9445 Tj
+1 TJm
+(r) 3.31768 Tj
+-254 TJm
+(disk) 16.6083 Tj
+86.944 560.598 Td
+(or) 8.29918 Tj
+-250 TJm
+(I/O) 13.2807 Tj
+-250 TJm
+(subsystem) 41.5158 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(slo) 11.6268 Tj
+25 TJm
+(wly) 14.9445 Tj
+-249 TJm
+(f) 3.31768 Tj
+10 TJm
+(ailing.) 25.1865 Tj
+-620 TJm
+(Y) 7.19329 Tj
+111 TJm
+(up,) 12.4538 Tj
+-250 TJm
+(this) 14.3965 Tj
+-250 TJm
+(really) 22.6858 Tj
+-250 TJm
+(does) 18.2622 Tj
+-250 TJm
+(happen.) 31.2639 Tj
+[1 0 0 1 345.143 560.598] cm
+0 g
+0 G
+[1 0 0 1 -273.143 -12.12] cm
+0 g
+0 G
+[1 0 0 1 -72 -548.478] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 538.68 Td
+/F128_0 9.963 Tf
+(T) 6.08739 Tj
+35 TJm
+(ry) 8.29918 Tj
+-250 TJm
+(using) 21.5898 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(dif) 11.0689 Tj
+25 TJm
+(ferent) 23.2337 Tj
+-250 TJm
+(machine) 33.7546 Tj
+-249 TJm
+(of) 8.29918 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(same) 20.474 Tj
+-250 TJm
+(type,) 19.647 Tj
+-250 TJm
+(and) 14.3866 Tj
+-250 TJm
+(see) 12.7228 Tj
+-250 TJm
+(if) 6.08739 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(can) 13.8286 Tj
+-250 TJm
+(repeat) 24.3396 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(problem.) 35.6974 Tj
+[1 0 0 1 72 536.523] cm
+0 g
+0 G
+[1 0 0 1 0 -19.761] cm
+0 g
+0 G
+[1 0 0 1 6.974 0] cm
+0 g
+0 G
+[1 0 0 1 -78.974 -516.762] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+78.974 516.762 Td
+/F128_0 9.963 Tf
+(\225) 3.48705 Tj
+[1 0 0 1 82.461 516.762] cm
+0 g
+0 G
+[1 0 0 1 2.49 0] cm
+0 g
+0 G
+[1 0 0 1 1.993 0] cm
+0 g
+0 G
+[1 0 0 1 -86.944 -516.762] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+86.944 516.762 Td
+/F128_0 9.963 Tf
+(This) 17.7142 Tj
+-229 TJm
+(isn') 14.9445 Tj
+18 TJm
+(t) 2.76971 Tj
+-230 TJm
+(real) 14.9345 Tj
+1 TJm
+(ly) 7.75121 Tj
+-230 TJm
+(a) 4.42357 Tj
+-229 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug,) 12.4538 Tj
+-234 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-229 TJm
+(...) 7.47225 Tj
+-303 TJm
+(If) 6.63536 Tj
+[1 0 0 1 212.232 516.762] cm
+0 g
+0 G
+[1 0 0 1 -212.232 -516.762] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+212.232 516.762 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 242.12 516.762] cm
+0 g
+0 G
+[1 0 0 1 -242.12 -516.762] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+244.405 516.762 Td
+/F128_0 9.963 Tf
+(tells) 16.6083 Tj
+-229 TJm
+(you) 14.9445 Tj
+-230 TJm
+(your) 18.2622 Tj
+-229 TJm
+(\002le) 12.7327 Tj
+-229 TJm
+(is) 6.64532 Tj
+-229 TJm
+(corrupted) 38.1782 Tj
+-230 TJm
+(on) 9.963 Tj
+-229 TJm
+(decompression,) 62.2588 Tj
+-233 TJm
+(and) 14.3866 Tj
+-230 TJm
+(you) 14.9445 Tj
+-229 TJm
+(obtained) 34.3126 Tj
+-229 TJm
+(the) 12.1748 Tj
+-229 TJm
+(\002le) 12.7327 Tj
+86.944 504.807 Td
+(via) 12.1748 Tj
+-262 TJm
+(FTP) 17.1662 Tj
+111 TJm
+(,) 2.49075 Tj
+-262 TJm
+(there) 19.916 Tj
+-263 TJm
+(is) 6.64532 Tj
+-262 TJm
+(a) 4.42357 Tj
+-262 TJm
+(possibility) 41.5258 Tj
+-262 TJm
+(that) 14.9445 Tj
+-263 TJm
+(y) 4.9815 Tj
+1 TJm
+(ou) 9.963 Tj
+-263 TJm
+(for) 11.6169 Tj
+18 TJm
+(got) 12.7327 Tj
+-262 TJm
+(to) 7.75121 Tj
+-262 TJm
+(tell) 12.7327 Tj
+-262 TJm
+(FTP) 17.1662 Tj
+-263 TJm
+(to) 7.75121 Tj
+-262 TJm
+(do) 9.963 Tj
+-262 TJm
+(a) 4.42357 Tj
+-262 TJm
+(binary) 25.4555 Tj
+-263 TJm
+(mode) 22.1378 Tj
+-262 TJm
+(transfer) 30.427 Tj
+55 TJm
+(.) 2.49075 Tj
+-694 TJm
+(Th) 11.0689 Tj
+1 TJm
+(at) 7.19329 Tj
+-263 TJm
+(absolutely) 40.9579 Tj
+-262 TJm
+(will) 15.5024 Tj
+-262 TJm
+(cause) 22.1278 Tj
+86.944 492.852 Td
+(the) 12.1748 Tj
+-250 TJm
+(\002le) 12.7327 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(be) 9.40507 Tj
+-250 TJm
+(non-decompress) 65.2975 Tj
+1 TJm
+(ible.) 17.4353 Tj
+-620 TJm
+(Y) 7.19329 Tj
+110 TJm
+(ou') 13.2807 Tj
+10 TJm
+(ll) 5.53943 Tj
+-250 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(transfer) 30.427 Tj
+-250 TJm
+(it) 5.53943 Tj
+-250 TJm
+(ag) 9.40507 Tj
+5 TJm
+(ain.) 14.6655 Tj
+[1 0 0 1 351.34 492.852] cm
+0 g
+0 G
+[1 0 0 1 -279.34 -12.12] cm
+0 g
+0 G
+[1 0 0 1 -72 -480.732] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 470.934 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-235 TJm
+(you') 18.2622 Tj
+50 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-235 TJm
+(incorporated) 50.353 Tj
+[1 0 0 1 163.036 470.934] cm
+0 g
+0 G
+[1 0 0 1 -163.036 -470.934] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+163.036 470.934 Td
+/F130_0 9.963 Tf
+(libbzip2) 47.8224 Tj
+[1 0 0 1 210.856 470.934] cm
+0 g
+0 G
+[1 0 0 1 -210.856 -470.934] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+213.2 470.934 Td
+/F128_0 9.963 Tf
+(into) 15.5024 Tj
+-235 TJm
+(your) 18.2622 Tj
+-235 TJm
+(o) 4.9815 Tj
+25 TJm
+(wn) 12.1748 Tj
+-236 TJm
+(prog) 18.2622 Tj
+1 TJm
+(ram) 15.4925 Tj
+-236 TJm
+(and) 14.3866 Tj
+-235 TJm
+(are) 12.1648 Tj
+-235 TJm
+(getting) 27.6772 Tj
+-235 TJm
+(problems,) 39.573 Tj
+-238 TJm
+(please,) 27.3883 Tj
+-238 TJm
+(please,) 27.3883 Tj
+-238 TJm
+(please,) 27.3883 Tj
+-238 TJm
+(check) 23.2337 Tj
+-236 TJm
+(t) 2.76971 Tj
+1 TJm
+(hat) 12.1748 Tj
+72 458.979 Td
+(the) 12.1748 Tj
+-242 TJm
+(parameters) 43.7077 Tj
+-242 TJm
+(you) 14.9445 Tj
+-243 TJm
+(are) 12.1648 Tj
+-242 TJm
+(passing) 29.889 Tj
+-242 TJm
+(in) 7.75121 Tj
+-243 TJm
+(calls) 18.2622 Tj
+-242 TJm
+(to) 7.75121 Tj
+-242 TJm
+(the) 12.1748 Tj
+-242 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+-244 TJm
+(are) 12.1648 Tj
+-243 TJm
+(co) 9.40507 Tj
+1 TJm
+(rrect,) 20.743 Tj
+-244 TJm
+(and) 14.3866 Tj
+-243 TJm
+(in) 7.75121 Tj
+-242 TJm
+(accordance) 44.8036 Tj
+-242 TJm
+(with) 17.7142 Tj
+-242 TJm
+(what) 19.3681 Tj
+-243 TJm
+(the) 12.1748 Tj
+-242 TJm
+(documentation) 59.2201 Tj
+-242 TJm
+(says) 17.1563 Tj
+72 447.024 Td
+(is) 6.64532 Tj
+-250 TJm
+(allo) 14.9445 Tj
+25 TJm
+(w) 7.19329 Tj
+10 TJm
+(able.) 19.0891 Tj
+-310 TJm
+(I) 3.31768 Tj
+-250 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(tried) 18.2622 Tj
+-250 TJm
+(to) 7.75121 Tj
+-250 TJm
+(m) 7.75121 Tj
+1 TJm
+(ak) 9.40507 Tj
+10 TJm
+(e) 4.42357 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(library) 26.5614 Tj
+-250 TJm
+(rob) 13.2807 Tj
+20 TJm
+(ust) 11.6268 Tj
+-250 TJm
+(ag) 9.40507 Tj
+5 TJm
+(ainst) 18.8201 Tj
+-250 TJm
+(such) 18.2622 Tj
+-250 TJm
+(problems,) 39.573 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-250 TJm
+(I'm) 14.3866 Tj
+-250 TJm
+(sur) 12.1748 Tj
+1 TJm
+(e) 4.42357 Tj
+-250 TJm
+(I) 3.31768 Tj
+-250 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(en') 12.7228 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(succeeded.) 43.4287 Tj
+[1 0 0 1 72 444.867] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -434.904] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 425.106 Td
+/F128_0 9.963 Tf
+(Finally) 28.2351 Tj
+65 TJm
+(,) 2.49075 Tj
+-324 TJm
+(if) 6.08739 Tj
+-309 TJm
+(the) 12.1748 Tj
+-310 TJm
+(abo) 14.3866 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-309 TJm
+(comments) 40.9579 Tj
+-309 TJm
+(don') 18.2622 Tj
+18 TJm
+(t) 2.76971 Tj
+-309 TJm
+(help,) 19.647 Tj
+-325 TJm
+(you') 18.2622 Tj
+11 TJm
+(ll) 5.53943 Tj
+-310 TJm
+(ha) 9.40507 Tj
+20 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-309 TJm
+(to) 7.75121 Tj
+-309 TJm
+(send) 18.2622 Tj
+-310 TJm
+(me) 12.1748 Tj
+-309 TJm
+(a) 4.42357 Tj
+-309 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug) 9.963 Tj
+-310 TJm
+(report.) 26.2824 Tj
+-976 TJm
+(No) 12.1748 Tj
+25 TJm
+(w) 7.19329 Tj
+65 TJm
+(,) 2.49075 Tj
+-324 TJm
+(it') 8.85711 Tj
+55 TJm
+(s) 3.87561 Tj
+-309 TJm
+(just) 14.3965 Tj
+-309 TJm
+(amazing) 33.7546 Tj
+-310 TJm
+(ho) 9.963 Tj
+25 TJm
+(w) 7.19329 Tj
+-309 TJm
+(man) 17.1563 Tj
+15 TJm
+(y) 4.9815 Tj
+72 413.151 Td
+(people) 26.5614 Tj
+-250 TJm
+(will) 15.5024 Tj
+-250 TJm
+(send) 18.2622 Tj
+-250 TJm
+(me) 12.1748 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(b) 4.9815 Tj
+20 TJm
+(ug) 9.963 Tj
+-250 TJm
+(rep) 12.7228 Tj
+1 TJm
+(ort) 11.0689 Tj
+-250 TJm
+(saying) 26.0134 Tj
+-250 TJm
+(something) 41.5158 Tj
+-250 TJm
+(lik) 10.5209 Tj
+10 TJm
+(e:) 7.19329 Tj
+[1 0 0 1 72 410.994] cm
+0 g
+0 G
+[1 0 0 1 0 -24.907] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 23.91 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 20.324] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -401.629] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 401.629 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+-426 TJm
+(crashed) 41.8446 Tj
+-426 TJm
+(with) 23.9112 Tj
+-426 TJm
+(segmen) 35.8668 Tj
+1 TJm
+(tation) 35.8668 Tj
+-426 TJm
+(fault) 29.889 Tj
+-426 TJm
+(on) 11.9556 Tj
+-426 TJm
+(my) 11.9556 Tj
+-426 TJm
+(machine) 41.8446 Tj
+[1 0 0 1 72 386.087] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -376.125] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 364.169 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+-241 TJm
+(absolutely) 40.9579 Tj
+-240 TJm
+(nothing) 30.4469 Tj
+-241 TJm
+(else.) 17.9832 Tj
+-614 TJm
+(Needless) 35.9664 Tj
+-241 TJm
+(to) 7.75121 Tj
+-240 TJm
+(say) 13.2807 Tj
+65 TJm
+(,) 2.49075 Tj
+-243 TJm
+(a) 4.42357 Tj
+-241 TJm
+(such) 18.2622 Tj
+-241 TJm
+(a) 4.42357 Tj
+-240 TJm
+(report) 23.7916 Tj
+-241 TJm
+(is) 6.64532 Tj
+[1 0 0 1 324.681 364.169] cm
+0 g
+0 G
+[1 0 0 1 -324.681 -364.169] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+324.681 364.169 Td
+/F631_0 9.963 Tf
+(totally) 25.4654 Tj
+55 TJm
+(,) 2.49075 Tj
+-243 TJm
+(u) 4.9815 Tj
+1 TJm
+(tterly) 21.0319 Tj
+55 TJm
+(,) 2.49075 Tj
+-243 TJm
+(completely) 43.1597 Tj
+-241 TJm
+(and) 14.9445 Tj
+-240 TJm
+(compr) 25.4555 Tj
+37 TJm
+(ehensively) 41.4959 Tj
+-241 TJm
+(100%) 23.2437 Tj
+72 352.214 Td
+(useless;) 31.5429 Tj
+-257 TJm
+(a) 4.9815 Tj
+-255 TJm
+(waste) 22.6957 Tj
+-255 TJm
+(of) 7.75121 Tj
+-255 TJm
+(your) 18.2622 Tj
+-255 TJm
+(time) 17.1563 Tj
+10 TJm
+(,) 2.49075 Tj
+-256 TJm
+(my) 11.6169 Tj
+-255 TJm
+(t) 2.76971 Tj
+1 TJm
+(ime) 14.3866 Tj
+10 TJm
+(,) 2.49075 Tj
+-257 TJm
+(and) 14.9445 Tj
+-254 TJm
+(net) 12.1748 Tj
+-255 TJm
+(bandwidth) 42.0737 Tj
+[1 0 0 1 302.574 352.214] cm
+0 g
+0 G
+[1 0 0 1 -302.574 -352.214] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+302.574 352.214 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-649 TJm
+(W) 9.40507 Tj
+40 TJm
+(ith) 10.5209 Tj
+-255 TJm
+(no) 9.963 Tj
+-255 TJm
+(details) 26.0134 Tj
+-255 TJm
+(at) 7.19329 Tj
+-255 TJm
+(all,) 12.4538 Tj
+-256 TJm
+(there') 23.2337 Tj
+55 TJm
+(s) 3.87561 Tj
+-255 TJm
+(no) 9.963 Tj
+-255 TJm
+(w) 7.19329 Tj
+10 TJm
+(ay) 9.40507 Tj
+-254 TJm
+(I) 3.31768 Tj
+-255 TJm
+(can) 13.8286 Tj
+-255 TJm
+(possibly) 33.2166 Tj
+-255 TJm
+(be) 9.40507 Tj
+15 TJm
+(gin) 12.7327 Tj
+72 340.259 Td
+(to) 7.75121 Tj
+-250 TJm
+(\002gure) 23.2437 Tj
+-250 TJm
+(out) 12.7327 Tj
+-250 TJm
+(what) 19.3681 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(problem) 33.2067 Tj
+-249 TJm
+(is.) 9.13607 Tj
+[1 0 0 1 72 338.102] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -328.14] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 318.341 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-309 TJm
+(rules) 19.3681 Tj
+-309 TJm
+(of) 8.29918 Tj
+-309 TJm
+(the) 12.1748 Tj
+-309 TJm
+(g) 4.9815 Tj
+5 TJm
+(ame) 16.5984 Tj
+-309 TJm
+(are:) 14.9345 Tj
+-429 TJm
+(f) 3.31768 Tj
+10 TJm
+(ac) 8.84714 Tj
+1 TJm
+(ts,) 9.13607 Tj
+-324 TJm
+(f) 3.31768 Tj
+10 TJm
+(acts,) 17.9832 Tj
+-324 TJm
+(f) 3.31768 Tj
+10 TJm
+(acts.) 17.9832 Tj
+-975 TJm
+(Don') 20.474 Tj
+18 TJm
+(t) 2.76971 Tj
+-309 TJm
+(omit) 18.2721 Tj
+-309 TJm
+(them) 19.926 Tj
+-309 TJm
+(because) 31.5329 Tj
+-309 TJm
+("oh,) 16.5187 Tj
+-324 TJm
+(the) 12.1748 Tj
+15 TJm
+(y) 4.9815 Tj
+-309 TJm
+(w) 7.19329 Tj
+10 TJm
+(on') 13.2807 Tj
+18 TJm
+(t) 2.76971 Tj
+-309 TJm
+(be) 9.40507 Tj
+-309 TJm
+(rele) 14.9345 Tj
+25 TJm
+(v) 4.9815 Tj
+25 TJm
+(ant".) 18.7304 Tj
+-975 TJm
+(At) 9.963 Tj
+-309 TJm
+(the) 12.1748 Tj
+-309 TJm
+(bare) 17.1463 Tj
+72 306.386 Td
+(minimum:) 41.5258 Tj
+[1 0 0 1 72 306.287] cm
+0 g
+0 G
+[1 0 0 1 0 -60.772] cm
+0.949 0.949 0.97646 rg
+0.949 0.949 0.97646 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 59.776 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 56.189] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -296.922] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 296.922 Td
+/F130_0 9.963 Tf
+(Machine) 41.8446 Tj
+-426 TJm
+(type.) 29.889 Tj
+-852 TJm
+(Operating) 53.8002 Tj
+-425 TJm
+(system) 35.8668 Tj
+-426 TJm
+(version.) 47.8224 Tj
+90 284.967 Td
+(Exact) 29.889 Tj
+-426 TJm
+(version) 41.8446 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(bzip2) 29.889 Tj
+-426 TJm
+(\() 5.9778 Tj
+1 TJm
+(do) 11.9556 Tj
+-426 TJm
+(bzip2) 29.889 Tj
+-426 TJm
+(-V\).) 23.9112 Tj
+90 273.011 Td
+(Exact) 29.889 Tj
+-426 TJm
+(version) 41.8446 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(com) 17.9334 Tj
+1 TJm
+(piler) 29.889 Tj
+-426 TJm
+(used.) 29.889 Tj
+90 261.056 Td
+(Flags) 29.889 Tj
+-426 TJm
+(passed) 35.8668 Tj
+-426 TJm
+(to) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(comp) 23.9112 Tj
+1 TJm
+(iler.) 29.889 Tj
+[1 0 0 1 72 245.514] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -235.552] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 223.597 Td
+/F128_0 9.963 Tf
+(Ho) 12.1748 Tj
+25 TJm
+(we) 11.6169 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(er) 7.74125 Tj
+40 TJm
+(,) 2.49075 Tj
+-253 TJm
+(the) 12.1748 Tj
+-253 TJm
+(most) 19.378 Tj
+-253 TJm
+(important) 38.7461 Tj
+-252 TJm
+(single) 23.8016 Tj
+-253 TJm
+(thing) 20.4839 Tj
+-253 TJm
+(that) 14.9445 Tj
+-253 TJm
+(will) 15.5024 Tj
+-252 TJm
+(help) 17.1563 Tj
+-253 TJm
+(me) 12.1748 Tj
+-253 TJm
+(is) 6.64532 Tj
+-253 TJm
+(the) 12.1748 Tj
+-252 TJm
+(\002le) 12.7327 Tj
+-253 TJm
+(that) 14.9445 Tj
+-253 TJm
+(you) 14.9445 Tj
+-253 TJm
+(we) 11.6169 Tj
+1 TJm
+(re) 7.74125 Tj
+-253 TJm
+(trying) 23.8016 Tj
+-253 TJm
+(to) 7.75121 Tj
+-253 TJm
+(compress) 37.6303 Tj
+-252 TJm
+(or) 8.29918 Tj
+-253 TJm
+(decompress) 47.0353 Tj
+72 211.642 Td
+(at) 7.19329 Tj
+-304 TJm
+(the) 12.1748 Tj
+-305 TJm
+(time) 17.7142 Tj
+-304 TJm
+(the) 12.1748 Tj
+-304 TJm
+(problem) 33.2067 Tj
+-304 TJm
+(happened.) 40.669 Tj
+-946 TJm
+(W) 9.40507 Tj
+40 TJm
+(ithout) 23.2536 Tj
+-305 TJm
+(that,) 17.4353 Tj
+-317 TJm
+(my) 12.7327 Tj
+-305 TJm
+(ability) 25.4654 Tj
+-304 TJm
+(to) 7.75121 Tj
+-304 TJm
+(do) 9.963 Tj
+-305 TJm
+(an) 9.40507 Tj
+15 TJm
+(ythin) 20.4839 Tj
+1 TJm
+(g) 4.9815 Tj
+-305 TJm
+(more) 20.474 Tj
+-304 TJm
+(than) 17.1563 Tj
+-304 TJm
+(speculate) 37.0723 Tj
+-305 TJm
+(abou) 19.3681 Tj
+1 TJm
+(t) 2.76971 Tj
+-305 TJm
+(the) 12.1748 Tj
+-304 TJm
+(cause,) 24.6186 Tj
+-318 TJm
+(is) 6.64532 Tj
+72 199.686 Td
+(limited.) 30.7259 Tj
+[1 0 0 1 72 199.587] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -189.624] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 164.933 Td
+/F121_0 20.659 Tf
+(4.4.) 34.4592 Tj
+-278 TJm
+(Did) 33.2816 Tj
+-278 TJm
+(y) 11.4864 Tj
+25 TJm
+(ou) 25.2453 Tj
+-278 TJm
+(g) 12.6226 Tj
+-10 TJm
+(et) 18.3659 Tj
+-278 TJm
+(the) 30.9885 Tj
+-278 TJm
+(right) 45.9043 Tj
+-278 TJm
+(pac) 35.5955 Tj
+20 TJm
+(ka) 22.9728 Tj
+11 TJm
+(g) 12.6226 Tj
+-10 TJm
+(e?) 24.1091 Tj
+[1 0 0 1 72 160.337] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -150.374] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 143.016 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 143.016] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -143.016] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+104.603 143.016 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-272 TJm
+(a) 4.42357 Tj
+-273 TJm
+(resource) 33.7447 Tj
+-272 TJm
+(hog.) 17.4353 Tj
+-378 TJm
+(It) 6.08739 Tj
+-272 TJm
+(soaks) 22.1378 Tj
+-272 TJm
+(up) 9.963 Tj
+-273 TJm
+(lar) 10.511 Tj
+18 TJm
+(ge) 9.40507 Tj
+-272 TJm
+(amounts) 33.7646 Tj
+-273 TJm
+(of) 8.29918 Tj
+-272 TJm
+(CPU) 19.378 Tj
+-272 TJm
+(c) 4.42357 Tj
+15 TJm
+(ycles) 20.474 Tj
+-273 TJm
+(and) 14.3866 Tj
+-272 TJm
+(memory) 33.2067 Tj
+65 TJm
+(.) 2.49075 Tj
+-755 TJm
+(Also,) 21.3109 Tj
+-278 TJm
+(it) 5.53943 Tj
+-272 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(es) 8.29918 Tj
+-273 TJm
+(v) 4.9815 Tj
+15 TJm
+(ery) 12.7228 Tj
+-272 TJm
+(lar) 10.511 Tj
+18 TJm
+(ge) 9.40507 Tj
+-273 TJm
+(latencies.) 37.3513 Tj
+72 131.061 Td
+(In) 8.29918 Tj
+-251 TJm
+(the) 12.1748 Tj
+-251 TJm
+(w) 7.19329 Tj
+10 TJm
+(orst) 14.9445 Tj
+-251 TJm
+(case,) 19.6371 Tj
+-251 TJm
+(you) 14.9445 Tj
+-251 TJm
+(can) 13.8286 Tj
+-251 TJm
+(feed) 17.1463 Tj
+-251 TJm
+(man) 17.1563 Tj
+15 TJm
+(y) 4.9815 Tj
+-251 TJm
+(me) 12.1748 Tj
+15 TJm
+(g) 4.9815 Tj
+5 TJm
+(abytes) 25.4555 Tj
+-251 TJm
+(of) 8.29918 Tj
+-251 TJm
+(uncompressed) 56.9983 Tj
+-251 TJm
+(dat) 12.1748 Tj
+1 TJm
+(a) 4.42357 Tj
+-251 TJm
+(into) 15.5024 Tj
+-251 TJm
+(the) 12.1748 Tj
+-251 TJm
+(library) 26.5614 Tj
+-251 TJm
+(before) 25.4455 Tj
+-251 TJm
+(getting) 27.6772 Tj
+-251 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-251 TJm
+(compressed) 47.0353 Tj
+72 119.105 Td
+(output,) 27.9562 Tj
+-250 TJm
+(so) 8.85711 Tj
+-250 TJm
+(this) 14.3965 Tj
+-250 TJm
+(probably) 35.4185 Tj
+-250 TJm
+(rules) 19.3681 Tj
+-249 TJm
+(out) 12.7327 Tj
+-250 TJm
+(applications) 48.1512 Tj
+-250 TJm
+(requiring) 36.5244 Tj
+-250 TJm
+(interacti) 32.6488 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+-250 TJm
+(beha) 18.8101 Tj
+20 TJm
+(viour) 21.0319 Tj
+55 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 116.949] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 -72 -106.986] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 97.188 Td
+/F128_0 9.963 Tf
+(These) 23.7916 Tj
+-304 TJm
+(aren') 20.464 Tj
+18 TJm
+(t) 2.76971 Tj
+-304 TJm
+(f) 3.31768 Tj
+10 TJm
+(aults) 18.8201 Tj
+-304 TJm
+(of) 8.29918 Tj
+-304 TJm
+(my) 12.7327 Tj
+-304 TJm
+(im) 10.5209 Tj
+1 TJm
+(plementation,) 54.5175 Tj
+-318 TJm
+(I) 3.31768 Tj
+-304 TJm
+(hope,) 21.8588 Tj
+-317 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-304 TJm
+(more) 20.474 Tj
+-304 TJm
+(an) 9.40507 Tj
+-304 TJm
+(intrinsic) 32.6587 Tj
+-304 TJm
+(property) 33.7546 Tj
+-304 TJm
+(of) 8.29918 Tj
+-303 TJm
+(the) 12.1748 Tj
+-304 TJm
+(Burro) 23.2437 Tj
+25 TJm
+(ws-Wheeler) 48.1313 Tj
+-304 TJm
+(transform) 38.7361 Tj
+72 85.232 Td
+(\(unfortunately\).) 62.8068 Tj
+-620 TJm
+(Maybe) 27.6673 Tj
+-250 TJm
+(this) 14.3965 Tj
+-249 TJm
+(isn') 14.9445 Tj
+18 TJm
+(t) 2.76971 Tj
+-250 TJm
+(what) 19.3681 Tj
+-250 TJm
+(you) 14.9445 Tj
+-250 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant.) 14.6655 Tj
+[1 0 0 1 72 83.076] cm
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+[1 0 0 1 0 -22.261] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(33) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 37 37
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -6.854] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 116.329 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -382.4 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+498.728 749.245 Td
+/F128_0 9.963 Tf
+(Miscellanea) 48.1412 Tj
+[1 0 0 1 266.071 749.146] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -7.094] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -540 -741.554] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(If) 6.63536 Tj
+-275 TJm
+(you) 14.9445 Tj
+-274 TJm
+(w) 7.19329 Tj
+10 TJm
+(ant) 12.1748 Tj
+-275 TJm
+(a) 4.42357 Tj
+-274 TJm
+(compressor) 45.9294 Tj
+-275 TJm
+(and/or) 25.4555 Tj
+-274 TJm
+(library) 26.5614 Tj
+-275 TJm
+(which) 24.3496 Tj
+-274 TJm
+(is) 6.64532 Tj
+-275 TJm
+(f) 3.31768 Tj
+10 TJm
+(aster) 18.8101 Tj
+40 TJm
+(,) 2.49075 Tj
+-280 TJm
+(uses) 17.1563 Tj
+-275 TJm
+(less) 14.9445 Tj
+-274 TJm
+(memory) 33.2067 Tj
+-275 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-274 TJm
+(gets) 16.0504 Tj
+-275 TJm
+(pretty) 23.2437 Tj
+-274 TJm
+(good) 19.926 Tj
+-275 TJm
+(compression,) 52.8537 Tj
+-280 TJm
+(and) 14.3866 Tj
+-275 TJm
+(has) 13.2807 Tj
+72 698.082 Td
+(minimal) 33.2166 Tj
+-288 TJm
+(latenc) 23.7916 Tj
+15 TJm
+(y) 4.9815 Tj
+65 TJm
+(,) 2.49075 Tj
+-297 TJm
+(consider) 33.7546 Tj
+-288 TJm
+(Jean-lou) 33.7546 Tj
+1 TJm
+(p) 4.9815 Tj
+-288 TJm
+(Gailly') 28.2252 Tj
+55 TJm
+(s) 3.87561 Tj
+-288 TJm
+(and) 14.3866 Tj
+-288 TJm
+(Mark) 21.5799 Tj
+-288 TJm
+(Adler') 26.0034 Tj
+55 TJm
+(s) 3.87561 Tj
+-287 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork,) 15.7714 Tj
+[1 0 0 1 353.879 698.082] cm
+0 g
+0 G
+[1 0 0 1 -353.879 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+353.879 698.082 Td
+/F130_0 9.963 Tf
+(zlib-1.2.1) 59.778 Tj
+[1 0 0 1 413.655 698.082] cm
+0 g
+0 G
+[1 0 0 1 -413.655 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+416.523 698.082 Td
+/F128_0 9.963 Tf
+(and) 14.3866 Tj
+[1 0 0 1 433.777 698.082] cm
+0 g
+0 G
+[1 0 0 1 -433.777 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+433.777 698.082 Td
+/F130_0 9.963 Tf
+(gzip-1.2.4) 59.778 Tj
+[1 0 0 1 493.553 698.082] cm
+0 g
+0 G
+[1 0 0 1 -493.553 -698.082] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+493.553 698.082 Td
+/F128_0 9.963 Tf
+(.) 2.49075 Tj
+-847 TJm
+(Look) 21.0319 Tj
+-288 TJm
+(for) 11.6169 Tj
+72 686.127 Td
+(them) 19.926 Tj
+-250 TJm
+(at) 7.19329 Tj
+-250 TJm
+(http://www) 45.3914 Tj
+65 TJm
+(.zlib) 17.4353 Tj
+40 TJm
+(.or) 10.7899 Tj
+18 TJm
+(g) 4.9815 Tj
+-250 TJm
+(a) 4.42357 Tj
+1 TJm
+(nd) 9.963 Tj
+-250 TJm
+(http://www) 45.3914 Tj
+65 TJm
+(.gzip.or) 30.437 Tj
+18 TJm
+(g) 4.9815 Tj
+-250 TJm
+(respecti) 30.9849 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(ely) 12.1748 Tj
+65 TJm
+(.) 2.49075 Tj
+[1 0 0 1 72 683.97] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -674.008] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 664.209 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(or) 8.29918 Tj
+-582 TJm
+(something) 41.5158 Tj
+-582 TJm
+(f) 3.31768 Tj
+10 TJm
+(aster) 18.8101 Tj
+-583 TJm
+(and) 14.3866 Tj
+-582 TJm
+(lighter) 26.0134 Tj
+-582 TJm
+(still,) 17.4452 Tj
+-665 TJm
+(you) 14.9445 Tj
+-583 TJm
+(m) 7.75121 Tj
+1 TJm
+(ight) 15.5024 Tj
+-583 TJm
+(try) 11.0689 Tj
+-582 TJm
+(Markus) 30.437 Tj
+-582 TJm
+(F) 5.53943 Tj
+-582 TJm
+(X) 7.19329 Tj
+-582 TJm
+(J) 3.87561 Tj
+-582 TJm
+(Oberhumer') 48.6892 Tj
+55 TJm
+(s) 3.87561 Tj
+[1 0 0 1 437.433 664.209] cm
+0 g
+0 G
+[1 0 0 1 -437.433 -664.209] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+437.433 664.209 Td
+/F130_0 9.963 Tf
+(LZO) 17.9334 Tj
+[1 0 0 1 455.365 664.209] cm
+0 g
+0 G
+[1 0 0 1 -455.365 -664.209] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+461.164 664.209 Td
+/F128_0 9.963 Tf
+(real-time) 35.9664 Tj
+-582 TJm
+(compres-) 37.0723 Tj
+72 652.254 Td
+(sion/decompression) 79.1461 Tj
+-250 TJm
+(library) 26.5614 Tj
+65 TJm
+(,) 2.49075 Tj
+-250 TJm
+(a) 4.42357 Tj
+1 TJm
+(t) 2.76971 Tj
+-250 TJm
+(http://www) 45.3914 Tj
+65 TJm
+(.oberhumer) 45.6505 Tj
+55 TJm
+(.com/opensource.) 70.279 Tj
+[1 0 0 1 72 650.097] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -640.135] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 617.501 Td
+/F121_0 20.659 Tf
+(4.5.) 34.4592 Tj
+-278 TJm
+(Fur) 33.2816 Tj
+-20 TJm
+(ther) 39.0249 Tj
+-278 TJm
+(Reading) 81.4998 Tj
+[1 0 0 1 72 612.905] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 0 -9.963] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -72 -602.942] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 595.583 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 101.888 595.583] cm
+0 g
+0 G
+[1 0 0 1 -101.888 -595.583] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+104.923 595.583 Td
+/F128_0 9.963 Tf
+(is) 6.64532 Tj
+-305 TJm
+(n) 4.9815 Tj
+1 TJm
+(ot) 7.75121 Tj
+-305 TJm
+(research) 33.1868 Tj
+-304 TJm
+(w) 7.19329 Tj
+10 TJm
+(ork,) 15.7714 Tj
+-319 TJm
+(in) 7.75121 Tj
+-304 TJm
+(the) 12.1748 Tj
+-305 TJm
+(sense) 21.5799 Tj
+-304 TJm
+(that) 14.9445 Tj
+-305 TJm
+(it) 5.53943 Tj
+-304 TJm
+(doesn') 26.5614 Tj
+18 TJm
+(t) 2.76971 Tj
+-305 TJm
+(present) 28.7731 Tj
+-304 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-305 TJm
+(ne) 9.40507 Tj
+25 TJm
+(w) 7.19329 Tj
+-304 TJm
+(ideas.) 22.9647 Tj
+-474 TJm
+(Rather) 26.5614 Tj
+40 TJm
+(,) 2.49075 Tj
+-318 TJm
+(it') 8.85711 Tj
+55 TJm
+(s) 3.87561 Tj
+-305 TJm
+(an) 9.40507 Tj
+-304 TJm
+(engineering) 47.0353 Tj
+-305 TJm
+(e) 4.42357 Tj
+15 TJm
+(x) 4.9815 Tj
+15 TJm
+(e) 4.42357 Tj
+1 TJm
+(rcise) 18.8101 Tj
+72 583.628 Td
+(based) 22.6858 Tj
+-250 TJm
+(on) 9.963 Tj
+-250 TJm
+(e) 4.42357 Tj
+15 TJm
+(xisting) 27.1292 Tj
+-250 TJm
+(ideas.) 22.9647 Tj
+[1 0 0 1 72 581.471] cm
+0 g
+0 G
+[1 0 0 1 0 -9.962] cm
+0 g
+0 G
+[1 0 0 1 -72 -571.509] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 561.71 Td
+/F128_0 9.963 Tf
+(F) 5.53943 Tj
+15 TJm
+(our) 13.2807 Tj
+-250 TJm
+(documents) 43.1697 Tj
+-250 TJm
+(describe) 33.1967 Tj
+-250 TJm
+(esse) 16.5984 Tj
+1 TJm
+(ntially) 25.4654 Tj
+-250 TJm
+(all) 9.963 Tj
+-250 TJm
+(the) 12.1748 Tj
+-250 TJm
+(ideas) 20.474 Tj
+-250 TJm
+(behind) 27.1193 Tj
+[1 0 0 1 298.747 561.71] cm
+0 g
+0 G
+[1 0 0 1 -298.747 -561.71] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+298.747 561.71 Td
+/F130_0 9.963 Tf
+(bzip2) 29.889 Tj
+[1 0 0 1 328.635 561.71] cm
+0 g
+0 G
+[1 0 0 1 -328.635 -561.71] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+328.635 561.71 Td
+/F128_0 9.963 Tf
+(:) 2.76971 Tj
+[1 0 0 1 72 559.554] cm
+0 g
+0 G
+[1 0 0 1 0 -299.876] cm
+0.9294 0.96861 0.95685 rg
+0.9294 0.96861 0.95685 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 298.879 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 295.292] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -550.189] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 550.189 Td
+/F130_0 9.963 Tf
+(Michael) 41.8446 Tj
+-426 TJm
+(Burrows) 41.8446 Tj
+-426 TJm
+(and) 17.9334 Tj
+-426 TJm
+(D.) 11.9556 Tj
+-426 TJm
+(J) 5.9778 Tj
+1 TJm
+(.) 5.9778 Tj
+-426 TJm
+(Wheeler:) 47.8224 Tj
+98.488 538.234 Td
+("A) 11.9556 Tj
+-426 TJm
+(block-sorting) 77.7114 Tj
+-426 TJm
+(lossless) 47.8224 Tj
+-425 TJm
+(data) 23.9112 Tj
+-426 TJm
+(compression) 65.7558 Tj
+-426 TJm
+(algorithm") 59.778 Tj
+102.732 526.278 Td
+(10th) 23.9112 Tj
+-426 TJm
+(May) 17.9334 Tj
+-426 TJm
+(1994.) 29.889 Tj
+102.732 514.323 Td
+(Digital) 41.8446 Tj
+-426 TJm
+(SRC) 17.9334 Tj
+-426 TJm
+(Research) 47.8224 Tj
+-426 TJm
+(Rep) 17.9334 Tj
+1 TJm
+(ort) 17.9334 Tj
+-426 TJm
+(124.) 23.9112 Tj
+102.732 502.368 Td
+(ftp://ftp.digital.com/pub) 149.445 Tj
+1 TJm
+(/DEC/SRC/research-reports/SRC-124.ps.gz) 233.134 Tj
+102.732 490.413 Td
+(If) 11.9556 Tj
+-426 TJm
+(you) 17.9334 Tj
+-426 TJm
+(have) 23.9112 Tj
+-426 TJm
+(trouble) 41.8446 Tj
+-426 TJm
+(find) 23.9112 Tj
+1 TJm
+(ing) 17.9334 Tj
+-426 TJm
+(it,) 17.9334 Tj
+-426 TJm
+(try) 17.9334 Tj
+-426 TJm
+(searching) 53.8002 Tj
+-426 TJm
+(at) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+102.732 478.458 Td
+(New) 17.9334 Tj
+-426 TJm
+(Zealand) 41.8446 Tj
+-426 TJm
+(Digital) 41.8446 Tj
+-426 TJm
+(Libr) 23.9112 Tj
+1 TJm
+(ary,) 23.9112 Tj
+-426 TJm
+(http://www.nzdl.org.) 119.556 Tj
+90 454.547 Td
+(Daniel) 35.8668 Tj
+-426 TJm
+(S.) 11.9556 Tj
+-426 TJm
+(Hirschberg) 59.778 Tj
+-426 TJm
+(and) 17.9334 Tj
+-425 TJm
+(Debra) 29.889 Tj
+-426 TJm
+(A.) 11.9556 Tj
+-426 TJm
+(LeLewer) 41.8446 Tj
+98.488 442.592 Td
+("Efficient) 59.778 Tj
+-426 TJm
+(Decoding) 47.8224 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(Pr) 11.9556 Tj
+1 TJm
+(efix) 23.9112 Tj
+-426 TJm
+(Codes") 35.8668 Tj
+102.732 430.637 Td
+(Communications) 83.6892 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(ACM) 17.9334 Tj
+1 TJm
+(,) 5.9778 Tj
+-426 TJm
+(April) 29.889 Tj
+-426 TJm
+(1990,) 29.889 Tj
+-426 TJm
+(Vol) 17.9334 Tj
+-426 TJm
+(33,) 17.9334 Tj
+-426 TJm
+(Number) 35.8668 Tj
+-426 TJm
+(4.) 11.9556 Tj
+102.732 418.682 Td
+(You) 17.9334 Tj
+-426 TJm
+(might) 29.889 Tj
+-426 TJm
+(be) 11.9556 Tj
+-426 TJm
+(able) 23.9112 Tj
+-426 TJm
+(to) 11.9556 Tj
+-426 TJm
+(get) 17.9334 Tj
+-425 TJm
+(an) 11.9556 Tj
+-426 TJm
+(electronic) 59.778 Tj
+-426 TJm
+(copy) 23.9112 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(this) 23.9112 Tj
+102.732 406.727 Td
+(from) 23.9112 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(ACM) 17.9334 Tj
+-426 TJm
+(Digital) 41.8446 Tj
+-426 TJm
+(Lib) 17.9334 Tj
+1 TJm
+(rary.) 29.889 Tj
+90 382.816 Td
+(David) 29.889 Tj
+-426 TJm
+(J.) 11.9556 Tj
+-426 TJm
+(Wheeler) 41.8446 Tj
+102.732 370.861 Td
+(Program) 41.8446 Tj
+-426 TJm
+(bred3.c) 41.8446 Tj
+-426 TJm
+(and) 17.9334 Tj
+-426 TJm
+(accom) 29.889 Tj
+1 TJm
+(panying) 41.8446 Tj
+-426 TJm
+(document) 47.8224 Tj
+-426 TJm
+(bred3.ps.) 53.8002 Tj
+102.732 358.906 Td
+(This) 23.9112 Tj
+-426 TJm
+(contains) 47.8224 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(idea) 23.9112 Tj
+-426 TJm
+(b) 5.9778 Tj
+1 TJm
+(ehind) 29.889 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(multi-table) 65.7558 Tj
+-426 TJm
+(Huffman) 41.8446 Tj
+-426 TJm
+(coding) 35.8668 Tj
+-426 TJm
+(scheme.) 41.8446 Tj
+102.732 346.951 Td
+(ftp://ftp.cl.cam.ac.uk/us) 149.445 Tj
+1 TJm
+(ers/djw3/) 53.8002 Tj
+90 323.04 Td
+(Jon) 17.9334 Tj
+-426 TJm
+(L.) 11.9556 Tj
+-426 TJm
+(Bentley) 41.8446 Tj
+-426 TJm
+(and) 17.9334 Tj
+-426 TJm
+(Robert) 35.8668 Tj
+-425 TJm
+(Sedgewick) 53.8002 Tj
+98.488 311.085 Td
+("Fast) 29.889 Tj
+-426 TJm
+(Algorithms) 59.778 Tj
+-426 TJm
+(for) 17.9334 Tj
+-426 TJm
+(Sort) 23.9112 Tj
+1 TJm
+(ing) 17.9334 Tj
+-426 TJm
+(and) 17.9334 Tj
+-426 TJm
+(Searching) 53.8002 Tj
+-426 TJm
+(Strings") 47.8224 Tj
+102.732 299.13 Td
+(Available) 53.8002 Tj
+-426 TJm
+(from) 23.9112 Tj
+-426 TJm
+(Sedgewick') 59.778 Tj
+1 TJm
+(s) 5.9778 Tj
+-426 TJm
+(web) 17.9334 Tj
+-426 TJm
+(page,) 29.889 Tj
+102.732 287.175 Td
+(www.cs.princeton.edu/~rs) 143.467 Tj
+[1 0 0 1 72 259.678] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -249.715] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 237.76 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-239 TJm
+(follo) 18.8201 Tj
+26 TJm
+(wing) 19.926 Tj
+-239 TJm
+(paper) 22.1278 Tj
+-239 TJm
+(gi) 7.75121 Tj
+25 TJm
+(v) 4.9815 Tj
+15 TJm
+(es) 8.29918 Tj
+-238 TJm
+(v) 4.9815 Tj
+25 TJm
+(aluable) 28.7731 Tj
+-239 TJm
+(additiona) 37.0823 Tj
+1 TJm
+(l) 2.76971 Tj
+-239 TJm
+(insights) 31.0049 Tj
+-239 TJm
+(into) 15.5024 Tj
+-238 TJm
+(the) 12.1748 Tj
+-239 TJm
+(algorithm,) 41.2369 Tj
+-240 TJm
+(b) 4.9815 Tj
+20 TJm
+(ut) 7.75121 Tj
+-239 TJm
+(is) 6.64532 Tj
+-239 TJm
+(not) 12.7327 Tj
+-238 TJm
+(immediately) 49.815 Tj
+-239 TJm
+(the) 12.1748 Tj
+-238 TJm
+(basis) 19.926 Tj
+-239 TJm
+(of) 8.29918 Tj
+-238 TJm
+(an) 9.40507 Tj
+15 TJm
+(y) 4.9815 Tj
+-239 TJm
+(code) 18.8101 Tj
+72 225.805 Td
+(used) 18.2622 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(bzip2.) 24.6285 Tj
+[1 0 0 1 72 223.648] cm
+0 g
+0 G
+[1 0 0 1 0 -72.727] cm
+0.9294 0.96861 0.95685 rg
+0.9294 0.96861 0.95685 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 71.731 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.587] cm
+0 g
+0 G
+[1 0 0 1 0 68.144] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -214.283] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 214.283 Td
+/F130_0 9.963 Tf
+(Peter) 29.889 Tj
+-426 TJm
+(Fenwick:) 47.8224 Tj
+102.732 202.328 Td
+(Block) 29.889 Tj
+-426 TJm
+(Sorting) 41.8446 Tj
+-426 TJm
+(Text) 23.9112 Tj
+-426 TJm
+(Compr) 29.889 Tj
+1 TJm
+(ession) 35.8668 Tj
+102.732 190.373 Td
+(Proceedings) 65.7558 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(19th) 23.9112 Tj
+-425 TJm
+(Australasian) 71.7336 Tj
+-426 TJm
+(Computer) 47.8224 Tj
+-426 TJm
+(Science) 41.8446 Tj
+-426 TJm
+(Conference,) 65.7558 Tj
+111.22 178.418 Td
+(Melbourne,) 59.778 Tj
+-426 TJm
+(Australia.) 59.778 Tj
+-852 TJm
+(J) 5.9778 Tj
+1 TJm
+(an) 11.9556 Tj
+-426 TJm
+(31) 11.9556 Tj
+-426 TJm
+(-) 5.9778 Tj
+-426 TJm
+(Feb) 17.9334 Tj
+-426 TJm
+(2,) 11.9556 Tj
+-426 TJm
+(1996.) 29.889 Tj
+102.732 166.463 Td
+(ftp://ftp.cs.auckland.ac.) 149.445 Tj
+1 TJm
+(nz/pub/peter-f/ACSC96paper.ps) 173.356 Tj
+[1 0 0 1 72 150.921] cm
+0 g
+0 G
+[1 0 0 1 468 3.587] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.55] cm
+0 g
+0 G
+[1 0 0 1 -72 -140.958] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 129.003 Td
+/F128_0 9.963 Tf
+(K) 7.19329 Tj
+15 TJm
+(unihik) 25.4654 Tj
+10 TJm
+(o) 4.9815 Tj
+-250 TJm
+(Sadakane') 41.4959 Tj
+55 TJm
+(s) 3.87561 Tj
+-250 TJm
+(sorting) 27.6772 Tj
+-250 TJm
+(al) 7.19329 Tj
+1 TJm
+(gorithm,) 34.0436 Tj
+-250 TJm
+(mentioned) 42.0638 Tj
+-250 TJm
+(abo) 14.3866 Tj
+15 TJm
+(v) 4.9815 Tj
+15 TJm
+(e,) 6.91432 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+25 TJm
+(ailable) 26.5614 Tj
+-250 TJm
+(from:) 22.1378 Tj
+[1 0 0 1 72 126.846] cm
+0 g
+0 G
+[1 0 0 1 0 -36.861] cm
+0.9294 0.96861 0.95685 rg
+0.9294 0.96861 0.95685 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 35.866 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 32.279] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -117.481] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 117.481 Td
+/F130_0 9.963 Tf
+(http://naomi.is.s.u-tokyo.) 155.423 Tj
+1 TJm
+(ac.jp/~sada/papers/Sada98b.ps.gz) 191.29 Tj
+[1 0 0 1 72 89.985] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 0 -29.17] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(34) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Page: 38 38
+%%BeginPageSetup
+%%PageOrientation: Portrait
+pdfStartPage
+%%EndPageSetup
+[] 0 d
+1 i
+0 j
+0 J
+10 M
+1 w
+0 g
+0 G
+q
+[1 0 0 1 72 741.554] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 14.446] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 187.197 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.49 -6.854] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 116.329 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -382.4 -749.245] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+498.728 749.245 Td
+/F128_0 9.963 Tf
+(Miscellanea) 48.1412 Tj
+[1 0 0 1 266.071 749.146] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 280.796 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -472.974 -7.094] cm
+0 g
+0 G
+[1 0 0 1 0 -0.498] cm
+q
+[] 0 d
+0 J
+0.498 w
+0 0.249 m
+475.465 0.249 l
+S
+Q
+0 g
+0 G
+[1 0 0 1 479.251 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+[1 0 0 1 -540 -741.554] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 710.037 Td
+/F128_0 9.963 Tf
+(The) 15.4925 Tj
+-250 TJm
+(Manber) 30.9849 Tj
+20 TJm
+(-Myers) 28.7731 Tj
+-250 TJm
+(suf) 12.1748 Tj
+25 TJm
+(\002x) 10.5209 Tj
+-250 TJm
+(arra) 15.4825 Tj
+1 TJm
+(y) 4.9815 Tj
+-250 TJm
+(construction) 49.2571 Tj
+-250 TJm
+(algorithm) 38.7461 Tj
+-250 TJm
+(is) 6.64532 Tj
+-250 TJm
+(described) 38.1782 Tj
+-250 TJm
+(in) 7.75121 Tj
+-250 TJm
+(a) 4.42357 Tj
+-250 TJm
+(paper) 22.1278 Tj
+-250 TJm
+(a) 4.42357 Tj
+20 TJm
+(v) 4.9815 Tj
+25 TJm
+(ailabl) 22.1378 Tj
+1 TJm
+(e) 4.42357 Tj
+-250 TJm
+(from:) 22.1378 Tj
+[1 0 0 1 72 707.881] cm
+0 g
+0 G
+[1 0 0 1 0 -36.862] cm
+0.9294 0.96861 0.95685 rg
+0.9294 0.96861 0.95685 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 35.866 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 32.279] cm
+0 g
+0 G
+[1 0 0 1 18 -8.368] cm
+0 g
+0 G
+[1 0 0 1 -90 -698.516] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 698.516 Td
+/F130_0 9.963 Tf
+(http://www.cs.arizona.edu/) 155.423 Tj
+1 TJm
+(people/gene/PAPERS/suffix.ps) 167.378 Tj
+[1 0 0 1 72 671.019] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -13.549] cm
+0 g
+0 G
+[1 0 0 1 -72 -661.056] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+72 649.101 Td
+/F128_0 9.963 Tf
+(Finally) 28.2351 Tj
+65 TJm
+(,) 2.49075 Tj
+-227 TJm
+(the) 12.1748 Tj
+-221 TJm
+(follo) 18.8201 Tj
+25 TJm
+(wing) 19.926 Tj
+-221 TJm
+(papers) 26.0034 Tj
+-222 TJm
+(docume) 31.5429 Tj
+1 TJm
+(nt) 7.75121 Tj
+-222 TJm
+(some) 21.0319 Tj
+-221 TJm
+(in) 7.75121 Tj
+40 TJm
+(v) 4.9815 Tj
+15 TJm
+(estig) 18.8201 Tj
+5 TJm
+(ations) 23.8016 Tj
+-221 TJm
+(I) 3.31768 Tj
+-221 TJm
+(made) 21.5799 Tj
+-222 TJm
+(into) 15.5024 Tj
+-221 TJm
+(the) 12.1748 Tj
+-221 TJm
+(performance) 50.343 Tj
+-221 TJm
+(of) 8.29918 Tj
+-222 TJm
+(sorting) 27.6772 Tj
+-221 TJm
+(and) 14.3866 Tj
+-221 TJm
+(decompression) 59.768 Tj
+72 637.146 Td
+(algorithms:) 45.3914 Tj
+[1 0 0 1 72 634.989] cm
+0 g
+0 G
+[1 0 0 1 0 -132.503] cm
+0.9294 0.96861 0.95685 rg
+0.9294 0.96861 0.95685 RG
+q
+[] 0 d
+0 J
+0 j
+0 w
+0 0 468 131.507 re
+f
+Q
+0 g
+0 G
+[1 0 0 1 0 3.586] cm
+0 g
+0 G
+[1 0 0 1 0 127.921] cm
+0 g
+0 G
+[1 0 0 1 18 -8.369] cm
+0 g
+0 G
+[1 0 0 1 -90 -625.624] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+90 625.624 Td
+/F130_0 9.963 Tf
+(Julian) 35.8668 Tj
+-426 TJm
+(Seward) 35.8668 Tj
+102.732 613.669 Td
+(On) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(Performance) 65.7558 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(BW) 11.9556 Tj
+1 TJm
+(T) 5.9778 Tj
+-426 TJm
+(Sorting) 41.8446 Tj
+-426 TJm
+(Algorithms) 59.778 Tj
+102.732 601.714 Td
+(Proceedings) 65.7558 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(IEEE) 23.9112 Tj
+-425 TJm
+(Data) 23.9112 Tj
+-426 TJm
+(Compression) 65.7558 Tj
+-426 TJm
+(Conference) 59.778 Tj
+-426 TJm
+(2000) 23.9112 Tj
+111.22 589.759 Td
+(Snowbird,) 53.8002 Tj
+-426 TJm
+(Utah.) 29.889 Tj
+-852 TJm
+(28-30) 29.889 Tj
+-426 TJm
+(M) 5.9778 Tj
+1 TJm
+(arch) 23.9112 Tj
+-426 TJm
+(2000.) 29.889 Tj
+90 565.848 Td
+(Julian) 35.8668 Tj
+-426 TJm
+(Seward) 35.8668 Tj
+102.732 553.893 Td
+(Space-time) 59.778 Tj
+-426 TJm
+(Tradeoffs) 53.8002 Tj
+-426 TJm
+(in) 11.9556 Tj
+-425 TJm
+(the) 17.9334 Tj
+-426 TJm
+(Inverse) 41.8446 Tj
+-426 TJm
+(B-W) 17.9334 Tj
+-426 TJm
+(Transform) 53.8002 Tj
+102.732 541.938 Td
+(Proceedings) 65.7558 Tj
+-426 TJm
+(of) 11.9556 Tj
+-426 TJm
+(the) 17.9334 Tj
+-426 TJm
+(IEEE) 23.9112 Tj
+-425 TJm
+(Data) 23.9112 Tj
+-426 TJm
+(Compression) 65.7558 Tj
+-426 TJm
+(Conference) 59.778 Tj
+-426 TJm
+(2001) 23.9112 Tj
+111.22 529.983 Td
+(Snowbird,) 53.8002 Tj
+-426 TJm
+(Utah.) 29.889 Tj
+-852 TJm
+(27-29) 29.889 Tj
+-426 TJm
+(M) 5.9778 Tj
+1 TJm
+(arch) 23.9112 Tj
+-426 TJm
+(2001.) 29.889 Tj
+[1 0 0 1 72 502.486] cm
+0 g
+0 G
+[1 0 0 1 468 3.586] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 -468 -3.586] cm
+0 g
+0 G
+[1 0 0 1 0 -451.634] cm
+0 g
+0 G
+[1 0 0 1 1.893 0] cm
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 374.394 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 2.491 0] cm
+0 g
+0 G
+[1 0 0 1 0 6.854] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 40.572 -6.755] cm
+0 g
+0 G
+[1 0 0 1 -493.841 -50.951] cm
+[1 0 0 1 0 0] Tm
+0 0 Td
+534.414 50.951 Td
+/F128_0 9.963 Tf
+(35) 9.963 Tj
+[1 0 0 1 453.269 50.852] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 93.598 0] cm
+0 g
+0 G
+0 g
+0 G
+[1 0 0 1 6.277 0] cm
+0 g
+0 G
+[1 0 0 1 -13.144 0] cm
+0 g
+0 G
+Q
+showpage
+%%PageTrailer
+pdfEndPage
+%%Trailer
+end
+%%DocumentSuppliedResources:
+%%+ font CJBHNS+CMMI10
+%%+ font RBGKEI+CMSY10
+%%EOF
diff --git a/updater/bzip2-1.0.3/manual.xml b/updater/bzip2-1.0.3/manual.xml
new file mode 100644
index 0000000..1ab5bd7
--- /dev/null
+++ b/updater/bzip2-1.0.3/manual.xml
@@ -0,0 +1,2966 @@
+<?xml version="1.0"?> <!-- -*- sgml -*- -->
+<!DOCTYPE book PUBLIC "-//OASIS//DTD DocBook XML V4.2//EN"
+  "http://www.oasis-open.org/docbook/xml/4.2/docbookx.dtd"[
+
+<!-- various strings, dates etc. common to all docs -->
+<!ENTITY % common-ents SYSTEM "entities.xml"> %common-ents;
+]>
+
+<book lang="en" id="userman" xreflabel="bzip2 Manual">
+
+ <bookinfo>
+  <title>bzip2 and libbzip2, version 1.0.3</title>
+  <subtitle>A program and library for data compression</subtitle>
+  <copyright>
+   <year>&bz-lifespan;</year>
+   <holder>Julian Seward</holder>
+  </copyright>
+  <releaseinfo>Version &bz-version; of &bz-date;</releaseinfo>
+
+  <authorgroup>
+   <author>
+    <firstname>Julian</firstname>
+    <surname>Seward</surname>
+    <affiliation>
+     <orgname>&bz-url;</orgname>
+    </affiliation>
+   </author>
+  </authorgroup>
+
+  <legalnotice>
+
+  <para>This program, <computeroutput>bzip2</computeroutput>, the
+  associated library <computeroutput>libbzip2</computeroutput>, and
+  all documentation, are copyright &copy; &bz-lifespan; Julian Seward.
+  All rights reserved.</para>
+
+  <para>Redistribution and use in source and binary forms, with
+  or without modification, are permitted provided that the
+  following conditions are met:</para>
+
+  <itemizedlist mark='bullet'>
+
+   <listitem><para>Redistributions of source code must retain the
+   above copyright notice, this list of conditions and the
+   following disclaimer.</para></listitem>
+
+   <listitem><para>The origin of this software must not be
+   misrepresented; you must not claim that you wrote the original
+   software.  If you use this software in a product, an
+   acknowledgment in the product documentation would be
+   appreciated but is not required.</para></listitem>
+
+   <listitem><para>Altered source versions must be plainly marked
+   as such, and must not be misrepresented as being the original
+   software.</para></listitem>
+
+   <listitem><para>The name of the author may not be used to
+   endorse or promote products derived from this software without
+   specific prior written permission.</para></listitem>
+
+  </itemizedlist>
+
+  <para>THIS SOFTWARE IS PROVIDED BY THE AUTHOR "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 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.</para>
+
+ <para>PATENTS: To the best of my knowledge,
+ <computeroutput>bzip2</computeroutput> and
+ <computeroutput>libbzip2</computeroutput> do not use any patented
+ algorithms.  However, I do not have the resources to carry
+ out a patent search.  Therefore I cannot give any guarantee of
+ the above statement.
+ </para>
+
+</legalnotice>
+
+</bookinfo>
+
+
+
+<chapter id="intro" xreflabel="Introduction">
+<title>Introduction</title>
+
+<para><computeroutput>bzip2</computeroutput> compresses files
+using the Burrows-Wheeler block-sorting text compression
+algorithm, and Huffman coding.  Compression is generally
+considerably better than that achieved by more conventional
+LZ77/LZ78-based compressors, and approaches the performance of
+the PPM family of statistical compressors.</para>
+
+<para><computeroutput>bzip2</computeroutput> is built on top of
+<computeroutput>libbzip2</computeroutput>, a flexible library for
+handling compressed data in the
+<computeroutput>bzip2</computeroutput> format.  This manual
+describes both how to use the program and how to work with the
+library interface.  Most of the manual is devoted to this
+library, not the program, which is good news if your interest is
+only in the program.</para>
+
+<itemizedlist mark='bullet'>
+
+ <listitem><para><xref linkend="using"/> describes how to use
+ <computeroutput>bzip2</computeroutput>; this is the only part
+ you need to read if you just want to know how to operate the
+ program.</para></listitem>
+
+ <listitem><para><xref linkend="libprog"/> describes the
+ programming interfaces in detail, and</para></listitem>
+
+ <listitem><para><xref linkend="misc"/> records some
+ miscellaneous notes which I thought ought to be recorded
+ somewhere.</para></listitem>
+
+</itemizedlist>
+
+</chapter>
+
+
+<chapter id="using" xreflabel="How to use bzip2">
+<title>How to use bzip2</title>
+
+<para>This chapter contains a copy of the
+<computeroutput>bzip2</computeroutput> man page, and nothing
+else.</para>
+
+<sect1 id="name" xreflabel="NAME">
+<title>NAME</title>
+
+<itemizedlist mark='bullet'>
+
+ <listitem><para><computeroutput>bzip2</computeroutput>,
+  <computeroutput>bunzip2</computeroutput> - a block-sorting file
+  compressor, v1.0.3</para></listitem>
+
+ <listitem><para><computeroutput>bzcat</computeroutput> -
+   decompresses files to stdout</para></listitem>
+
+ <listitem><para><computeroutput>bzip2recover</computeroutput> -
+   recovers data from damaged bzip2 files</para></listitem>
+
+</itemizedlist>
+
+</sect1>
+
+
+<sect1 id="synopsis" xreflabel="SYNOPSIS">
+<title>SYNOPSIS</title>
+
+<itemizedlist mark='bullet'>
+
+ <listitem><para><computeroutput>bzip2</computeroutput> [
+  -cdfkqstvzVL123456789 ] [ filenames ...  ]</para></listitem>
+
+ <listitem><para><computeroutput>bunzip2</computeroutput> [
+  -fkvsVL ] [ filenames ...  ]</para></listitem>
+
+ <listitem><para><computeroutput>bzcat</computeroutput> [ -s ] [
+  filenames ...  ]</para></listitem>
+
+ <listitem><para><computeroutput>bzip2recover</computeroutput>
+  filename</para></listitem>
+
+</itemizedlist>
+
+</sect1>
+
+
+<sect1 id="description" xreflabel="DESCRIPTION">
+<title>DESCRIPTION</title>
+
+<para><computeroutput>bzip2</computeroutput> compresses files
+using the Burrows-Wheeler block sorting text compression
+algorithm, and Huffman coding.  Compression is generally
+considerably better than that achieved by more conventional
+LZ77/LZ78-based compressors, and approaches the performance of
+the PPM family of statistical compressors.</para>
+
+<para>The command-line options are deliberately very similar to
+those of GNU <computeroutput>gzip</computeroutput>, but they are
+not identical.</para>
+
+<para><computeroutput>bzip2</computeroutput> expects a list of
+file names to accompany the command-line flags.  Each file is
+replaced by a compressed version of itself, with the name
+<computeroutput>original_name.bz2</computeroutput>.  Each
+compressed file has the same modification date, permissions, and,
+when possible, ownership as the corresponding original, so that
+these properties can be correctly restored at decompression time.
+File name handling is naive in the sense that there is no
+mechanism for preserving original file names, permissions,
+ownerships or dates in filesystems which lack these concepts, or
+have serious file name length restrictions, such as
+MS-DOS.</para>
+
+<para><computeroutput>bzip2</computeroutput> and
+<computeroutput>bunzip2</computeroutput> will by default not
+overwrite existing files.  If you want this to happen, specify
+the <computeroutput>-f</computeroutput> flag.</para>
+
+<para>If no file names are specified,
+<computeroutput>bzip2</computeroutput> compresses from standard
+input to standard output.  In this case,
+<computeroutput>bzip2</computeroutput> will decline to write
+compressed output to a terminal, as this would be entirely
+incomprehensible and therefore pointless.</para>
+
+<para><computeroutput>bunzip2</computeroutput> (or
+<computeroutput>bzip2 -d</computeroutput>) decompresses all
+specified files.  Files which were not created by
+<computeroutput>bzip2</computeroutput> will be detected and
+ignored, and a warning issued.
+<computeroutput>bzip2</computeroutput> attempts to guess the
+filename for the decompressed file from that of the compressed
+file as follows:</para>
+
+<itemizedlist mark='bullet'>
+
+ <listitem><para><computeroutput>filename.bz2 </computeroutput>
+  becomes
+  <computeroutput>filename</computeroutput></para></listitem>
+
+ <listitem><para><computeroutput>filename.bz </computeroutput>
+  becomes
+  <computeroutput>filename</computeroutput></para></listitem>
+
+ <listitem><para><computeroutput>filename.tbz2</computeroutput>
+  becomes
+  <computeroutput>filename.tar</computeroutput></para></listitem>
+
+ <listitem><para><computeroutput>filename.tbz </computeroutput>
+  becomes
+  <computeroutput>filename.tar</computeroutput></para></listitem>
+
+ <listitem><para><computeroutput>anyothername </computeroutput>
+  becomes
+  <computeroutput>anyothername.out</computeroutput></para></listitem>
+
+</itemizedlist>
+
+<para>If the file does not end in one of the recognised endings,
+<computeroutput>.bz2</computeroutput>,
+<computeroutput>.bz</computeroutput>,
+<computeroutput>.tbz2</computeroutput> or
+<computeroutput>.tbz</computeroutput>,
+<computeroutput>bzip2</computeroutput> complains that it cannot
+guess the name of the original file, and uses the original name
+with <computeroutput>.out</computeroutput> appended.</para>
+
+<para>As with compression, supplying no filenames causes
+decompression from standard input to standard output.</para>
+
+<para><computeroutput>bunzip2</computeroutput> will correctly
+decompress a file which is the concatenation of two or more
+compressed files.  The result is the concatenation of the
+corresponding uncompressed files.  Integrity testing
+(<computeroutput>-t</computeroutput>) of concatenated compressed
+files is also supported.</para>
+
+<para>You can also compress or decompress files to the standard
+output by giving the <computeroutput>-c</computeroutput> flag.
+Multiple files may be compressed and decompressed like this.  The
+resulting outputs are fed sequentially to stdout.  Compression of
+multiple files in this manner generates a stream containing
+multiple compressed file representations.  Such a stream can be
+decompressed correctly only by
+<computeroutput>bzip2</computeroutput> version 0.9.0 or later.
+Earlier versions of <computeroutput>bzip2</computeroutput> will
+stop after decompressing the first file in the stream.</para>
+
+<para><computeroutput>bzcat</computeroutput> (or
+<computeroutput>bzip2 -dc</computeroutput>) decompresses all
+specified files to the standard output.</para>
+
+<para><computeroutput>bzip2</computeroutput> will read arguments
+from the environment variables
+<computeroutput>BZIP2</computeroutput> and
+<computeroutput>BZIP</computeroutput>, in that order, and will
+process them before any arguments read from the command line.
+This gives a convenient way to supply default arguments.</para>
+
+<para>Compression is always performed, even if the compressed
+file is slightly larger than the original.  Files of less than
+about one hundred bytes tend to get larger, since the compression
+mechanism has a constant overhead in the region of 50 bytes.
+Random data (including the output of most file compressors) is
+coded at about 8.05 bits per byte, giving an expansion of around
+0.5%.</para>
+
+<para>As a self-check for your protection,
+<computeroutput>bzip2</computeroutput> uses 32-bit CRCs to make
+sure that the decompressed version of a file is identical to the
+original.  This guards against corruption of the compressed data,
+and against undetected bugs in
+<computeroutput>bzip2</computeroutput> (hopefully very unlikely).
+The chances of data corruption going undetected is microscopic,
+about one chance in four billion for each file processed.  Be
+aware, though, that the check occurs upon decompression, so it
+can only tell you that something is wrong.  It can't help you
+recover the original uncompressed data.  You can use
+<computeroutput>bzip2recover</computeroutput> to try to recover
+data from damaged files.</para>
+
+<para>Return values: 0 for a normal exit, 1 for environmental
+problems (file not found, invalid flags, I/O errors, etc.), 2
+to indicate a corrupt compressed file, 3 for an internal
+consistency error (eg, bug) which caused
+<computeroutput>bzip2</computeroutput> to panic.</para>
+
+</sect1>
+
+
+<sect1 id="options" xreflabel="OPTIONS">
+<title>OPTIONS</title>
+
+<variablelist>
+
+ <varlistentry>
+ <term><computeroutput>-c --stdout</computeroutput></term>
+ <listitem><para>Compress or decompress to standard
+  output.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>-d --decompress</computeroutput></term>
+ <listitem><para>Force decompression.
+  <computeroutput>bzip2</computeroutput>,
+  <computeroutput>bunzip2</computeroutput> and
+  <computeroutput>bzcat</computeroutput> are really the same
+  program, and the decision about what actions to take is done on
+  the basis of which name is used.  This flag overrides that
+  mechanism, and forces bzip2 to decompress.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>-z --compress</computeroutput></term>
+ <listitem><para>The complement to
+  <computeroutput>-d</computeroutput>: forces compression,
+  regardless of the invokation name.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>-t --test</computeroutput></term>
+ <listitem><para>Check integrity of the specified file(s), but
+  don't decompress them.  This really performs a trial
+  decompression and throws away the result.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>-f --force</computeroutput></term>
+ <listitem><para>Force overwrite of output files.  Normally,
+  <computeroutput>bzip2</computeroutput> will not overwrite
+  existing output files.  Also forces
+  <computeroutput>bzip2</computeroutput> to break hard links to
+  files, which it otherwise wouldn't do.</para>
+  <para><computeroutput>bzip2</computeroutput> normally declines
+  to decompress files which don't have the correct magic header
+  bytes. If forced (<computeroutput>-f</computeroutput>),
+  however, it will pass such files through unmodified. This is
+  how GNU <computeroutput>gzip</computeroutput> behaves.</para>
+ </listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>-k --keep</computeroutput></term>
+ <listitem><para>Keep (don't delete) input files during
+  compression or decompression.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>-s --small</computeroutput></term>
+ <listitem><para>Reduce memory usage, for compression,
+  decompression and testing.  Files are decompressed and tested
+  using a modified algorithm which only requires 2.5 bytes per
+  block byte.  This means any file can be decompressed in 2300k
+  of memory, albeit at about half the normal speed.</para>
+  <para>During compression, <computeroutput>-s</computeroutput>
+  selects a block size of 200k, which limits memory use to around
+  the same figure, at the expense of your compression ratio.  In
+  short, if your machine is low on memory (8 megabytes or less),
+  use <computeroutput>-s</computeroutput> for everything.  See
+  <xref linkend="memory-management"/> below.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>-q --quiet</computeroutput></term>
+ <listitem><para>Suppress non-essential warning messages.
+  Messages pertaining to I/O errors and other critical events
+  will not be suppressed.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>-v --verbose</computeroutput></term>
+ <listitem><para>Verbose mode -- show the compression ratio for
+  each file processed.  Further
+  <computeroutput>-v</computeroutput>'s increase the verbosity
+  level, spewing out lots of information which is primarily of
+  interest for diagnostic purposes.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>-L --license -V --version</computeroutput></term>
+ <listitem><para>Display the software version, license terms and
+  conditions.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>-1</computeroutput> (or
+ <computeroutput>--fast</computeroutput>) to
+ <computeroutput>-9</computeroutput> (or
+ <computeroutput>-best</computeroutput>)</term>
+ <listitem><para>Set the block size to 100 k, 200 k ...  900 k
+  when compressing.  Has no effect when decompressing.  See <xref
+  linkend="memory-management" /> below.  The
+  <computeroutput>--fast</computeroutput> and
+  <computeroutput>--best</computeroutput> aliases are primarily
+  for GNU <computeroutput>gzip</computeroutput> compatibility.
+  In particular, <computeroutput>--fast</computeroutput> doesn't
+  make things significantly faster.  And
+  <computeroutput>--best</computeroutput> merely selects the
+  default behaviour.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>--</computeroutput></term>
+ <listitem><para>Treats all subsequent arguments as file names,
+  even if they start with a dash.  This is so you can handle
+  files with names beginning with a dash, for example:
+  <computeroutput>bzip2 --
+  -myfilename</computeroutput>.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+ <term><computeroutput>--repetitive-fast</computeroutput></term>
+ <term><computeroutput>--repetitive-best</computeroutput></term>
+ <listitem><para>These flags are redundant in versions 0.9.5 and
+  above.  They provided some coarse control over the behaviour of
+  the sorting algorithm in earlier versions, which was sometimes
+  useful.  0.9.5 and above have an improved algorithm which
+  renders these flags irrelevant.</para></listitem>
+ </varlistentry>
+
+</variablelist>
+
+</sect1>
+
+
+<sect1 id="memory-management" xreflabel="MEMORY MANAGEMENT">
+<title>MEMORY MANAGEMENT</title>
+
+<para><computeroutput>bzip2</computeroutput> compresses large
+files in blocks.  The block size affects both the compression
+ratio achieved, and the amount of memory needed for compression
+and decompression.  The flags <computeroutput>-1</computeroutput>
+through <computeroutput>-9</computeroutput> specify the block
+size to be 100,000 bytes through 900,000 bytes (the default)
+respectively.  At decompression time, the block size used for
+compression is read from the header of the compressed file, and
+<computeroutput>bunzip2</computeroutput> then allocates itself
+just enough memory to decompress the file.  Since block sizes are
+stored in compressed files, it follows that the flags
+<computeroutput>-1</computeroutput> to
+<computeroutput>-9</computeroutput> are irrelevant to and so
+ignored during decompression.</para>
+
+<para>Compression and decompression requirements, in bytes, can be
+estimated as:</para>
+<programlisting>
+Compression:   400k + ( 8 x block size )
+
+Decompression: 100k + ( 4 x block size ), or
+               100k + ( 2.5 x block size )
+</programlisting>
+
+<para>Larger block sizes give rapidly diminishing marginal
+returns.  Most of the compression comes from the first two or
+three hundred k of block size, a fact worth bearing in mind when
+using <computeroutput>bzip2</computeroutput> on small machines.
+It is also important to appreciate that the decompression memory
+requirement is set at compression time by the choice of block
+size.</para>
+
+<para>For files compressed with the default 900k block size,
+<computeroutput>bunzip2</computeroutput> will require about 3700
+kbytes to decompress.  To support decompression of any file on a
+4 megabyte machine, <computeroutput>bunzip2</computeroutput> has
+an option to decompress using approximately half this amount of
+memory, about 2300 kbytes.  Decompression speed is also halved,
+so you should use this option only where necessary.  The relevant
+flag is <computeroutput>-s</computeroutput>.</para>
+
+<para>In general, try and use the largest block size memory
+constraints allow, since that maximises the compression achieved.
+Compression and decompression speed are virtually unaffected by
+block size.</para>
+
+<para>Another significant point applies to files which fit in a
+single block -- that means most files you'd encounter using a
+large block size.  The amount of real memory touched is
+proportional to the size of the file, since the file is smaller
+than a block.  For example, compressing a file 20,000 bytes long
+with the flag <computeroutput>-9</computeroutput> will cause the
+compressor to allocate around 7600k of memory, but only touch
+400k + 20000 * 8 = 560 kbytes of it.  Similarly, the decompressor
+will allocate 3700k but only touch 100k + 20000 * 4 = 180
+kbytes.</para>
+
+<para>Here is a table which summarises the maximum memory usage
+for different block sizes.  Also recorded is the total compressed
+size for 14 files of the Calgary Text Compression Corpus
+totalling 3,141,622 bytes.  This column gives some feel for how
+compression varies with block size.  These figures tend to
+understate the advantage of larger block sizes for larger files,
+since the Corpus is dominated by smaller files.</para>
+
+<programlisting>
+        Compress   Decompress   Decompress   Corpus
+Flag     usage      usage       -s usage     Size
+
+ -1      1200k       500k         350k      914704
+ -2      2000k       900k         600k      877703
+ -3      2800k      1300k         850k      860338
+ -4      3600k      1700k        1100k      846899
+ -5      4400k      2100k        1350k      845160
+ -6      5200k      2500k        1600k      838626
+ -7      6100k      2900k        1850k      834096
+ -8      6800k      3300k        2100k      828642
+ -9      7600k      3700k        2350k      828642
+</programlisting>
+
+</sect1>
+
+
+<sect1 id="recovering" xreflabel="RECOVERING DATA FROM DAMAGED FILES">
+<title>RECOVERING DATA FROM DAMAGED FILES</title>
+
+<para><computeroutput>bzip2</computeroutput> compresses files in
+blocks, usually 900kbytes long.  Each block is handled
+independently.  If a media or transmission error causes a
+multi-block <computeroutput>.bz2</computeroutput> file to become
+damaged, it may be possible to recover data from the undamaged
+blocks in the file.</para>
+
+<para>The compressed representation of each block is delimited by
+a 48-bit pattern, which makes it possible to find the block
+boundaries with reasonable certainty.  Each block also carries
+its own 32-bit CRC, so damaged blocks can be distinguished from
+undamaged ones.</para>
+
+<para><computeroutput>bzip2recover</computeroutput> is a simple
+program whose purpose is to search for blocks in
+<computeroutput>.bz2</computeroutput> files, and write each block
+out into its own <computeroutput>.bz2</computeroutput> file.  You
+can then use <computeroutput>bzip2 -t</computeroutput> to test
+the integrity of the resulting files, and decompress those which
+are undamaged.</para>
+
+<para><computeroutput>bzip2recover</computeroutput> takes a
+single argument, the name of the damaged file, and writes a
+number of files <computeroutput>rec0001file.bz2</computeroutput>,
+<computeroutput>rec0002file.bz2</computeroutput>, etc, containing
+the extracted blocks.  The output filenames are designed so that
+the use of wildcards in subsequent processing -- for example,
+<computeroutput>bzip2 -dc rec*file.bz2 &#62;
+recovered_data</computeroutput> -- lists the files in the correct
+order.</para>
+
+<para><computeroutput>bzip2recover</computeroutput> should be of
+most use dealing with large <computeroutput>.bz2</computeroutput>
+files, as these will contain many blocks.  It is clearly futile
+to use it on damaged single-block files, since a damaged block
+cannot be recovered.  If you wish to minimise any potential data
+loss through media or transmission errors, you might consider
+compressing with a smaller block size.</para>
+
+</sect1>
+
+
+<sect1 id="performance" xreflabel="PERFORMANCE NOTES">
+<title>PERFORMANCE NOTES</title>
+
+<para>The sorting phase of compression gathers together similar
+strings in the file.  Because of this, files containing very long
+runs of repeated symbols, like "aabaabaabaab ..."  (repeated
+several hundred times) may compress more slowly than normal.
+Versions 0.9.5 and above fare much better than previous versions
+in this respect.  The ratio between worst-case and average-case
+compression time is in the region of 10:1.  For previous
+versions, this figure was more like 100:1.  You can use the
+<computeroutput>-vvvv</computeroutput> option to monitor progress
+in great detail, if you want.</para>
+
+<para>Decompression speed is unaffected by these
+phenomena.</para>
+
+<para><computeroutput>bzip2</computeroutput> usually allocates
+several megabytes of memory to operate in, and then charges all
+over it in a fairly random fashion.  This means that performance,
+both for compressing and decompressing, is largely determined by
+the speed at which your machine can service cache misses.
+Because of this, small changes to the code to reduce the miss
+rate have been observed to give disproportionately large
+performance improvements.  I imagine
+<computeroutput>bzip2</computeroutput> will perform best on
+machines with very large caches.</para>
+
+</sect1>
+
+
+
+<sect1 id="caveats" xreflabel="CAVEATS">
+<title>CAVEATS</title>
+
+<para>I/O error messages are not as helpful as they could be.
+<computeroutput>bzip2</computeroutput> tries hard to detect I/O
+errors and exit cleanly, but the details of what the problem is
+sometimes seem rather misleading.</para>
+
+<para>This manual page pertains to version &bz-version; of
+<computeroutput>bzip2</computeroutput>.  Compressed data created
+by this version is entirely forwards and backwards compatible
+with the previous public releases, versions 0.1pl2, 0.9.0 and
+0.9.5, 1.0.0, 1.0.1 and 1.0.2, but with the following exception: 0.9.0
+and above can correctly decompress multiple concatenated
+compressed files.  0.1pl2 cannot do this; it will stop after
+decompressing just the first file in the stream.</para>
+
+<para><computeroutput>bzip2recover</computeroutput> versions
+prior to 1.0.2 used 32-bit integers to represent bit positions in
+compressed files, so it could not handle compressed files more
+than 512 megabytes long.  Versions 1.0.2 and above use 64-bit ints
+on some platforms which support them (GNU supported targets, and
+Windows). To establish whether or not
+<computeroutput>bzip2recover</computeroutput> was built with such
+a limitation, run it without arguments. In any event you can
+build yourself an unlimited version if you can recompile it with
+<computeroutput>MaybeUInt64</computeroutput> set to be an
+unsigned 64-bit integer.</para>
+
+</sect1>
+
+
+
+<sect1 id="author" xreflabel="AUTHOR">
+<title>AUTHOR</title>
+
+<para>Julian Seward,
+<computeroutput>&bz-email;</computeroutput></para>
+
+<para>The ideas embodied in
+<computeroutput>bzip2</computeroutput> are due to (at least) the
+following people: Michael Burrows and David Wheeler (for the
+block sorting transformation), David Wheeler (again, for the
+Huffman coder), Peter Fenwick (for the structured coding model in
+the original <computeroutput>bzip</computeroutput>, and many
+refinements), and Alistair Moffat, Radford Neal and Ian Witten
+(for the arithmetic coder in the original
+<computeroutput>bzip</computeroutput>).  I am much indebted for
+their help, support and advice.  See the manual in the source
+distribution for pointers to sources of documentation.  Christian
+von Roques encouraged me to look for faster sorting algorithms,
+so as to speed up compression.  Bela Lubkin encouraged me to
+improve the worst-case compression performance.  
+Donna Robinson XMLised the documentation.
+Many people sent
+patches, helped with portability problems, lent machines, gave
+advice and were generally helpful.</para>
+
+</sect1>
+
+</chapter>
+
+
+
+<chapter id="libprog" xreflabel="Programming with libbzip2">
+<title>
+Programming with <computeroutput>libbzip2</computeroutput>
+</title>
+
+<para>This chapter describes the programming interface to
+<computeroutput>libbzip2</computeroutput>.</para>
+
+<para>For general background information, particularly about
+memory use and performance aspects, you'd be well advised to read
+<xref linkend="using"/> as well.</para>
+
+
+<sect1 id="top-level" xreflabel="Top-level structure">
+<title>Top-level structure</title>
+
+<para><computeroutput>libbzip2</computeroutput> is a flexible
+library for compressing and decompressing data in the
+<computeroutput>bzip2</computeroutput> data format.  Although
+packaged as a single entity, it helps to regard the library as
+three separate parts: the low level interface, and the high level
+interface, and some utility functions.</para>
+
+<para>The structure of
+<computeroutput>libbzip2</computeroutput>'s interfaces is similar
+to that of Jean-loup Gailly's and Mark Adler's excellent
+<computeroutput>zlib</computeroutput> library.</para>
+
+<para>All externally visible symbols have names beginning
+<computeroutput>BZ2_</computeroutput>.  This is new in version
+1.0.  The intention is to minimise pollution of the namespaces of
+library clients.</para>
+
+<para>To use any part of the library, you need to
+<computeroutput>#include &lt;bzlib.h&gt;</computeroutput>
+into your sources.</para>
+
+
+
+<sect2 id="ll-summary" xreflabel="Low-level summary">
+<title>Low-level summary</title>
+
+<para>This interface provides services for compressing and
+decompressing data in memory.  There's no provision for dealing
+with files, streams or any other I/O mechanisms, just straight
+memory-to-memory work.  In fact, this part of the library can be
+compiled without inclusion of
+<computeroutput>stdio.h</computeroutput>, which may be helpful
+for embedded applications.</para>
+
+<para>The low-level part of the library has no global variables
+and is therefore thread-safe.</para>
+
+<para>Six routines make up the low level interface:
+<computeroutput>BZ2_bzCompressInit</computeroutput>,
+<computeroutput>BZ2_bzCompress</computeroutput>, and
+<computeroutput>BZ2_bzCompressEnd</computeroutput> for
+compression, and a corresponding trio
+<computeroutput>BZ2_bzDecompressInit</computeroutput>,
+<computeroutput>BZ2_bzDecompress</computeroutput> and
+<computeroutput>BZ2_bzDecompressEnd</computeroutput> for
+decompression.  The <computeroutput>*Init</computeroutput>
+functions allocate memory for compression/decompression and do
+other initialisations, whilst the
+<computeroutput>*End</computeroutput> functions close down
+operations and release memory.</para>
+
+<para>The real work is done by
+<computeroutput>BZ2_bzCompress</computeroutput> and
+<computeroutput>BZ2_bzDecompress</computeroutput>.  These
+compress and decompress data from a user-supplied input buffer to
+a user-supplied output buffer.  These buffers can be any size;
+arbitrary quantities of data are handled by making repeated calls
+to these functions.  This is a flexible mechanism allowing a
+consumer-pull style of activity, or producer-push, or a mixture
+of both.</para>
+
+</sect2>
+
+
+<sect2 id="hl-summary" xreflabel="High-level summary">
+<title>High-level summary</title>
+
+<para>This interface provides some handy wrappers around the
+low-level interface to facilitate reading and writing
+<computeroutput>bzip2</computeroutput> format files
+(<computeroutput>.bz2</computeroutput> files).  The routines
+provide hooks to facilitate reading files in which the
+<computeroutput>bzip2</computeroutput> data stream is embedded
+within some larger-scale file structure, or where there are
+multiple <computeroutput>bzip2</computeroutput> data streams
+concatenated end-to-end.</para>
+
+<para>For reading files,
+<computeroutput>BZ2_bzReadOpen</computeroutput>,
+<computeroutput>BZ2_bzRead</computeroutput>,
+<computeroutput>BZ2_bzReadClose</computeroutput> and 
+<computeroutput>BZ2_bzReadGetUnused</computeroutput> are
+supplied.  For writing files,
+<computeroutput>BZ2_bzWriteOpen</computeroutput>,
+<computeroutput>BZ2_bzWrite</computeroutput> and
+<computeroutput>BZ2_bzWriteFinish</computeroutput> are
+available.</para>
+
+<para>As with the low-level library, no global variables are used
+so the library is per se thread-safe.  However, if I/O errors
+occur whilst reading or writing the underlying compressed files,
+you may have to consult <computeroutput>errno</computeroutput> to
+determine the cause of the error.  In that case, you'd need a C
+library which correctly supports
+<computeroutput>errno</computeroutput> in a multithreaded
+environment.</para>
+
+<para>To make the library a little simpler and more portable,
+<computeroutput>BZ2_bzReadOpen</computeroutput> and
+<computeroutput>BZ2_bzWriteOpen</computeroutput> require you to
+pass them file handles (<computeroutput>FILE*</computeroutput>s)
+which have previously been opened for reading or writing
+respectively.  That avoids portability problems associated with
+file operations and file attributes, whilst not being much of an
+imposition on the programmer.</para>
+
+</sect2>
+
+
+<sect2 id="util-fns-summary" xreflabel="Utility functions summary">
+<title>Utility functions summary</title>
+
+<para>For very simple needs,
+<computeroutput>BZ2_bzBuffToBuffCompress</computeroutput> and
+<computeroutput>BZ2_bzBuffToBuffDecompress</computeroutput> are
+provided.  These compress data in memory from one buffer to
+another buffer in a single function call.  You should assess
+whether these functions fulfill your memory-to-memory
+compression/decompression requirements before investing effort in
+understanding the more general but more complex low-level
+interface.</para>
+
+<para>Yoshioka Tsuneo
+(<computeroutput>QWF00133@niftyserve.or.jp</computeroutput> /
+<computeroutput>tsuneo-y@is.aist-nara.ac.jp</computeroutput>) has
+contributed some functions to give better
+<computeroutput>zlib</computeroutput> compatibility.  These
+functions are <computeroutput>BZ2_bzopen</computeroutput>,
+<computeroutput>BZ2_bzread</computeroutput>,
+<computeroutput>BZ2_bzwrite</computeroutput>,
+<computeroutput>BZ2_bzflush</computeroutput>,
+<computeroutput>BZ2_bzclose</computeroutput>,
+<computeroutput>BZ2_bzerror</computeroutput> and
+<computeroutput>BZ2_bzlibVersion</computeroutput>.  You may find
+these functions more convenient for simple file reading and
+writing, than those in the high-level interface.  These functions
+are not (yet) officially part of the library, and are minimally
+documented here.  If they break, you get to keep all the pieces.
+I hope to document them properly when time permits.</para>
+
+<para>Yoshioka also contributed modifications to allow the
+library to be built as a Windows DLL.</para>
+
+</sect2>
+
+</sect1>
+
+
+<sect1 id="err-handling" xreflabel="Error handling">
+<title>Error handling</title>
+
+<para>The library is designed to recover cleanly in all
+situations, including the worst-case situation of decompressing
+random data.  I'm not 100% sure that it can always do this, so
+you might want to add a signal handler to catch segmentation
+violations during decompression if you are feeling especially
+paranoid.  I would be interested in hearing more about the
+robustness of the library to corrupted compressed data.</para>
+
+<para>Version 1.0.3 more robust in this respect than any
+previous version.  Investigations with Valgrind (a tool for detecting
+problems with memory management) indicate
+that, at least for the few files I tested, all single-bit errors
+in the decompressed data are caught properly, with no
+segmentation faults, no uses of uninitialised data, no out of
+range reads or writes, and no infinite looping in the decompressor.
+So it's certainly pretty robust, although
+I wouldn't claim it to be totally bombproof.</para>
+
+<para>The file <computeroutput>bzlib.h</computeroutput> contains
+all definitions needed to use the library.  In particular, you
+should definitely not include
+<computeroutput>bzlib_private.h</computeroutput>.</para>
+
+<para>In <computeroutput>bzlib.h</computeroutput>, the various
+return values are defined.  The following list is not intended as
+an exhaustive description of the circumstances in which a given
+value may be returned -- those descriptions are given later.
+Rather, it is intended to convey the rough meaning of each return
+value.  The first five actions are normal and not intended to
+denote an error situation.</para>
+
+<variablelist>
+
+ <varlistentry>
+  <term><computeroutput>BZ_OK</computeroutput></term>
+  <listitem><para>The requested action was completed
+   successfully.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+  <term><computeroutput>BZ_RUN_OK, BZ_FLUSH_OK,
+    BZ_FINISH_OK</computeroutput></term>
+  <listitem><para>In 
+   <computeroutput>BZ2_bzCompress</computeroutput>, the requested
+   flush/finish/nothing-special action was completed
+   successfully.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+  <term><computeroutput>BZ_STREAM_END</computeroutput></term>
+  <listitem><para>Compression of data was completed, or the
+   logical stream end was detected during
+   decompression.</para></listitem>
+ </varlistentry>
+
+</variablelist>
+
+<para>The following return values indicate an error of some
+kind.</para>
+
+<variablelist>
+
+ <varlistentry>
+  <term><computeroutput>BZ_CONFIG_ERROR</computeroutput></term>
+  <listitem><para>Indicates that the library has been improperly
+   compiled on your platform -- a major configuration error.
+   Specifically, it means that
+   <computeroutput>sizeof(char)</computeroutput>,
+   <computeroutput>sizeof(short)</computeroutput> and
+   <computeroutput>sizeof(int)</computeroutput> are not 1, 2 and
+   4 respectively, as they should be.  Note that the library
+   should still work properly on 64-bit platforms which follow
+   the LP64 programming model -- that is, where
+   <computeroutput>sizeof(long)</computeroutput> and
+   <computeroutput>sizeof(void*)</computeroutput> are 8.  Under
+   LP64, <computeroutput>sizeof(int)</computeroutput> is still 4,
+   so <computeroutput>libbzip2</computeroutput>, which doesn't
+   use the <computeroutput>long</computeroutput> type, is
+   OK.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+  <term><computeroutput>BZ_SEQUENCE_ERROR</computeroutput></term>
+  <listitem><para>When using the library, it is important to call
+   the functions in the correct sequence and with data structures
+   (buffers etc) in the correct states.
+   <computeroutput>libbzip2</computeroutput> checks as much as it
+   can to ensure this is happening, and returns
+   <computeroutput>BZ_SEQUENCE_ERROR</computeroutput> if not.
+   Code which complies precisely with the function semantics, as
+   detailed below, should never receive this value; such an event
+   denotes buggy code which you should
+   investigate.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+  <term><computeroutput>BZ_PARAM_ERROR</computeroutput></term>
+  <listitem><para>Returned when a parameter to a function call is
+   out of range or otherwise manifestly incorrect.  As with
+   <computeroutput>BZ_SEQUENCE_ERROR</computeroutput>, this
+   denotes a bug in the client code.  The distinction between
+   <computeroutput>BZ_PARAM_ERROR</computeroutput> and
+   <computeroutput>BZ_SEQUENCE_ERROR</computeroutput> is a bit
+   hazy, but still worth making.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+  <term><computeroutput>BZ_MEM_ERROR</computeroutput></term>
+  <listitem><para>Returned when a request to allocate memory
+   failed.  Note that the quantity of memory needed to decompress
+   a stream cannot be determined until the stream's header has
+   been read.  So
+   <computeroutput>BZ2_bzDecompress</computeroutput> and
+   <computeroutput>BZ2_bzRead</computeroutput> may return
+   <computeroutput>BZ_MEM_ERROR</computeroutput> even though some
+   of the compressed data has been read.  The same is not true
+   for compression; once
+   <computeroutput>BZ2_bzCompressInit</computeroutput> or
+   <computeroutput>BZ2_bzWriteOpen</computeroutput> have
+   successfully completed,
+   <computeroutput>BZ_MEM_ERROR</computeroutput> cannot
+   occur.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+  <term><computeroutput>BZ_DATA_ERROR</computeroutput></term>
+  <listitem><para>Returned when a data integrity error is
+   detected during decompression.  Most importantly, this means
+   when stored and computed CRCs for the data do not match.  This
+   value is also returned upon detection of any other anomaly in
+   the compressed data.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+  <term><computeroutput>BZ_DATA_ERROR_MAGIC</computeroutput></term>
+  <listitem><para>As a special case of
+   <computeroutput>BZ_DATA_ERROR</computeroutput>, it is
+   sometimes useful to know when the compressed stream does not
+   start with the correct magic bytes (<computeroutput>'B' 'Z'
+   'h'</computeroutput>).</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+  <term><computeroutput>BZ_IO_ERROR</computeroutput></term>
+  <listitem><para>Returned by
+   <computeroutput>BZ2_bzRead</computeroutput> and
+   <computeroutput>BZ2_bzWrite</computeroutput> when there is an
+   error reading or writing in the compressed file, and by
+   <computeroutput>BZ2_bzReadOpen</computeroutput> and
+   <computeroutput>BZ2_bzWriteOpen</computeroutput> for attempts
+   to use a file for which the error indicator (viz,
+   <computeroutput>ferror(f)</computeroutput>) is set.  On
+   receipt of <computeroutput>BZ_IO_ERROR</computeroutput>, the
+   caller should consult <computeroutput>errno</computeroutput>
+   and/or <computeroutput>perror</computeroutput> to acquire
+   operating-system specific information about the
+   problem.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+  <term><computeroutput>BZ_UNEXPECTED_EOF</computeroutput></term>
+  <listitem><para>Returned by
+   <computeroutput>BZ2_bzRead</computeroutput> when the
+   compressed file finishes before the logical end of stream is
+   detected.</para></listitem>
+ </varlistentry>
+
+ <varlistentry>
+  <term><computeroutput>BZ_OUTBUFF_FULL</computeroutput></term>
+  <listitem><para>Returned by
+   <computeroutput>BZ2_bzBuffToBuffCompress</computeroutput> and
+   <computeroutput>BZ2_bzBuffToBuffDecompress</computeroutput> to
+   indicate that the output data will not fit into the output
+   buffer provided.</para></listitem>
+ </varlistentry>
+
+</variablelist>
+
+</sect1>
+
+
+
+<sect1 id="low-level" xreflabel=">Low-level interface">
+<title>Low-level interface</title>
+
+
+<sect2 id="bzcompress-init" xreflabel="BZ2_bzCompressInit">
+<title><computeroutput>BZ2_bzCompressInit</computeroutput></title>
+
+<programlisting>
+typedef struct {
+  char *next_in;
+  unsigned int avail_in;
+  unsigned int total_in_lo32;
+  unsigned int total_in_hi32;
+
+  char *next_out;
+  unsigned int avail_out;
+  unsigned int total_out_lo32;
+  unsigned int total_out_hi32;
+
+  void *state;
+
+  void *(*bzalloc)(void *,int,int);
+  void (*bzfree)(void *,void *);
+  void *opaque;
+} bz_stream;
+
+int BZ2_bzCompressInit ( bz_stream *strm, 
+                         int blockSize100k, 
+                         int verbosity,
+                         int workFactor );
+</programlisting>
+
+<para>Prepares for compression.  The
+<computeroutput>bz_stream</computeroutput> structure holds all
+data pertaining to the compression activity.  A
+<computeroutput>bz_stream</computeroutput> structure should be
+allocated and initialised prior to the call.  The fields of
+<computeroutput>bz_stream</computeroutput> comprise the entirety
+of the user-visible data.  <computeroutput>state</computeroutput>
+is a pointer to the private data structures required for
+compression.</para>
+
+<para>Custom memory allocators are supported, via fields
+<computeroutput>bzalloc</computeroutput>,
+<computeroutput>bzfree</computeroutput>, and
+<computeroutput>opaque</computeroutput>.  The value
+<computeroutput>opaque</computeroutput> is passed to as the first
+argument to all calls to <computeroutput>bzalloc</computeroutput>
+and <computeroutput>bzfree</computeroutput>, but is otherwise
+ignored by the library.  The call <computeroutput>bzalloc (
+opaque, n, m )</computeroutput> is expected to return a pointer
+<computeroutput>p</computeroutput> to <computeroutput>n *
+m</computeroutput> bytes of memory, and <computeroutput>bzfree (
+opaque, p )</computeroutput> should free that memory.</para>
+
+<para>If you don't want to use a custom memory allocator, set
+<computeroutput>bzalloc</computeroutput>,
+<computeroutput>bzfree</computeroutput> and
+<computeroutput>opaque</computeroutput> to
+<computeroutput>NULL</computeroutput>, and the library will then
+use the standard <computeroutput>malloc</computeroutput> /
+<computeroutput>free</computeroutput> routines.</para>
+
+<para>Before calling
+<computeroutput>BZ2_bzCompressInit</computeroutput>, fields
+<computeroutput>bzalloc</computeroutput>,
+<computeroutput>bzfree</computeroutput> and
+<computeroutput>opaque</computeroutput> should be filled
+appropriately, as just described.  Upon return, the internal
+state will have been allocated and initialised, and
+<computeroutput>total_in_lo32</computeroutput>,
+<computeroutput>total_in_hi32</computeroutput>,
+<computeroutput>total_out_lo32</computeroutput> and
+<computeroutput>total_out_hi32</computeroutput> will have been
+set to zero.  These four fields are used by the library to inform
+the caller of the total amount of data passed into and out of the
+library, respectively.  You should not try to change them.  As of
+version 1.0, 64-bit counts are maintained, even on 32-bit
+platforms, using the <computeroutput>_hi32</computeroutput>
+fields to store the upper 32 bits of the count.  So, for example,
+the total amount of data in is <computeroutput>(total_in_hi32
+&#60;&#60; 32) + total_in_lo32</computeroutput>.</para>
+
+<para>Parameter <computeroutput>blockSize100k</computeroutput>
+specifies the block size to be used for compression.  It should
+be a value between 1 and 9 inclusive, and the actual block size
+used is 100000 x this figure.  9 gives the best compression but
+takes most memory.</para>
+
+<para>Parameter <computeroutput>verbosity</computeroutput> should
+be set to a number between 0 and 4 inclusive.  0 is silent, and
+greater numbers give increasingly verbose monitoring/debugging
+output.  If the library has been compiled with
+<computeroutput>-DBZ_NO_STDIO</computeroutput>, no such output
+will appear for any verbosity setting.</para>
+
+<para>Parameter <computeroutput>workFactor</computeroutput>
+controls how the compression phase behaves when presented with
+worst case, highly repetitive, input data.  If compression runs
+into difficulties caused by repetitive data, the library switches
+from the standard sorting algorithm to a fallback algorithm.  The
+fallback is slower than the standard algorithm by perhaps a
+factor of three, but always behaves reasonably, no matter how bad
+the input.</para>
+
+<para>Lower values of <computeroutput>workFactor</computeroutput>
+reduce the amount of effort the standard algorithm will expend
+before resorting to the fallback.  You should set this parameter
+carefully; too low, and many inputs will be handled by the
+fallback algorithm and so compress rather slowly, too high, and
+your average-to-worst case compression times can become very
+large.  The default value of 30 gives reasonable behaviour over a
+wide range of circumstances.</para>
+
+<para>Allowable values range from 0 to 250 inclusive.  0 is a
+special case, equivalent to using the default value of 30.</para>
+
+<para>Note that the compressed output generated is the same
+regardless of whether or not the fallback algorithm is
+used.</para>
+
+<para>Be aware also that this parameter may disappear entirely in
+future versions of the library.  In principle it should be
+possible to devise a good way to automatically choose which
+algorithm to use.  Such a mechanism would render the parameter
+obsolete.</para>
+
+<para>Possible return values:</para>
+
+<programlisting>
+BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if strm is NULL 
+  or blockSize < 1 or blockSize > 9
+  or verbosity < 0 or verbosity > 4
+  or workFactor < 0 or workFactor > 250
+BZ_MEM_ERROR 
+  if not enough memory is available
+BZ_OK 
+  otherwise
+</programlisting>
+
+<para>Allowable next actions:</para>
+
+<programlisting>
+BZ2_bzCompress
+  if BZ_OK is returned
+  no specific action needed in case of error
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzCompress" xreflabel="BZ2_bzCompress">
+<title><computeroutput>BZ2_bzCompress</computeroutput></title>
+
+<programlisting>
+int BZ2_bzCompress ( bz_stream *strm, int action );
+</programlisting>
+
+<para>Provides more input and/or output buffer space for the
+library.  The caller maintains input and output buffers, and
+calls <computeroutput>BZ2_bzCompress</computeroutput> to transfer
+data between them.</para>
+
+<para>Before each call to
+<computeroutput>BZ2_bzCompress</computeroutput>,
+<computeroutput>next_in</computeroutput> should point at the data
+to be compressed, and <computeroutput>avail_in</computeroutput>
+should indicate how many bytes the library may read.
+<computeroutput>BZ2_bzCompress</computeroutput> updates
+<computeroutput>next_in</computeroutput>,
+<computeroutput>avail_in</computeroutput> and
+<computeroutput>total_in</computeroutput> to reflect the number
+of bytes it has read.</para>
+
+<para>Similarly, <computeroutput>next_out</computeroutput> should
+point to a buffer in which the compressed data is to be placed,
+with <computeroutput>avail_out</computeroutput> indicating how
+much output space is available.
+<computeroutput>BZ2_bzCompress</computeroutput> updates
+<computeroutput>next_out</computeroutput>,
+<computeroutput>avail_out</computeroutput> and
+<computeroutput>total_out</computeroutput> to reflect the number
+of bytes output.</para>
+
+<para>You may provide and remove as little or as much data as you
+like on each call of
+<computeroutput>BZ2_bzCompress</computeroutput>.  In the limit,
+it is acceptable to supply and remove data one byte at a time,
+although this would be terribly inefficient.  You should always
+ensure that at least one byte of output space is available at
+each call.</para>
+
+<para>A second purpose of
+<computeroutput>BZ2_bzCompress</computeroutput> is to request a
+change of mode of the compressed stream.</para>
+
+<para>Conceptually, a compressed stream can be in one of four
+states: IDLE, RUNNING, FLUSHING and FINISHING.  Before
+initialisation
+(<computeroutput>BZ2_bzCompressInit</computeroutput>) and after
+termination (<computeroutput>BZ2_bzCompressEnd</computeroutput>),
+a stream is regarded as IDLE.</para>
+
+<para>Upon initialisation
+(<computeroutput>BZ2_bzCompressInit</computeroutput>), the stream
+is placed in the RUNNING state.  Subsequent calls to
+<computeroutput>BZ2_bzCompress</computeroutput> should pass
+<computeroutput>BZ_RUN</computeroutput> as the requested action;
+other actions are illegal and will result in
+<computeroutput>BZ_SEQUENCE_ERROR</computeroutput>.</para>
+
+<para>At some point, the calling program will have provided all
+the input data it wants to.  It will then want to finish up -- in
+effect, asking the library to process any data it might have
+buffered internally.  In this state,
+<computeroutput>BZ2_bzCompress</computeroutput> will no longer
+attempt to read data from
+<computeroutput>next_in</computeroutput>, but it will want to
+write data to <computeroutput>next_out</computeroutput>.  Because
+the output buffer supplied by the user can be arbitrarily small,
+the finishing-up operation cannot necessarily be done with a
+single call of
+<computeroutput>BZ2_bzCompress</computeroutput>.</para>
+
+<para>Instead, the calling program passes
+<computeroutput>BZ_FINISH</computeroutput> as an action to
+<computeroutput>BZ2_bzCompress</computeroutput>.  This changes
+the stream's state to FINISHING.  Any remaining input (ie,
+<computeroutput>next_in[0 .. avail_in-1]</computeroutput>) is
+compressed and transferred to the output buffer.  To do this,
+<computeroutput>BZ2_bzCompress</computeroutput> must be called
+repeatedly until all the output has been consumed.  At that
+point, <computeroutput>BZ2_bzCompress</computeroutput> returns
+<computeroutput>BZ_STREAM_END</computeroutput>, and the stream's
+state is set back to IDLE.
+<computeroutput>BZ2_bzCompressEnd</computeroutput> should then be
+called.</para>
+
+<para>Just to make sure the calling program does not cheat, the
+library makes a note of <computeroutput>avail_in</computeroutput>
+at the time of the first call to
+<computeroutput>BZ2_bzCompress</computeroutput> which has
+<computeroutput>BZ_FINISH</computeroutput> as an action (ie, at
+the time the program has announced its intention to not supply
+any more input).  By comparing this value with that of
+<computeroutput>avail_in</computeroutput> over subsequent calls
+to <computeroutput>BZ2_bzCompress</computeroutput>, the library
+can detect any attempts to slip in more data to compress.  Any
+calls for which this is detected will return
+<computeroutput>BZ_SEQUENCE_ERROR</computeroutput>.  This
+indicates a programming mistake which should be corrected.</para>
+
+<para>Instead of asking to finish, the calling program may ask
+<computeroutput>BZ2_bzCompress</computeroutput> to take all the
+remaining input, compress it and terminate the current
+(Burrows-Wheeler) compression block.  This could be useful for
+error control purposes.  The mechanism is analogous to that for
+finishing: call <computeroutput>BZ2_bzCompress</computeroutput>
+with an action of <computeroutput>BZ_FLUSH</computeroutput>,
+remove output data, and persist with the
+<computeroutput>BZ_FLUSH</computeroutput> action until the value
+<computeroutput>BZ_RUN</computeroutput> is returned.  As with
+finishing, <computeroutput>BZ2_bzCompress</computeroutput>
+detects any attempt to provide more input data once the flush has
+begun.</para>
+
+<para>Once the flush is complete, the stream returns to the
+normal RUNNING state.</para>
+
+<para>This all sounds pretty complex, but isn't really.  Here's a
+table which shows which actions are allowable in each state, what
+action will be taken, what the next state is, and what the
+non-error return values are.  Note that you can't explicitly ask
+what state the stream is in, but nor do you need to -- it can be
+inferred from the values returned by
+<computeroutput>BZ2_bzCompress</computeroutput>.</para>
+
+<programlisting>
+IDLE/any
+  Illegal.  IDLE state only exists after BZ2_bzCompressEnd or
+  before BZ2_bzCompressInit.
+  Return value = BZ_SEQUENCE_ERROR
+
+RUNNING/BZ_RUN
+  Compress from next_in to next_out as much as possible.
+  Next state = RUNNING
+  Return value = BZ_RUN_OK
+
+RUNNING/BZ_FLUSH
+  Remember current value of next_in. Compress from next_in
+  to next_out as much as possible, but do not accept any more input.
+  Next state = FLUSHING
+  Return value = BZ_FLUSH_OK
+
+RUNNING/BZ_FINISH
+  Remember current value of next_in. Compress from next_in
+  to next_out as much as possible, but do not accept any more input.
+  Next state = FINISHING
+  Return value = BZ_FINISH_OK
+
+FLUSHING/BZ_FLUSH
+  Compress from next_in to next_out as much as possible, 
+  but do not accept any more input.
+  If all the existing input has been used up and all compressed
+  output has been removed
+    Next state = RUNNING; Return value = BZ_RUN_OK
+  else
+    Next state = FLUSHING; Return value = BZ_FLUSH_OK
+
+FLUSHING/other     
+  Illegal.
+  Return value = BZ_SEQUENCE_ERROR
+
+FINISHING/BZ_FINISH
+  Compress from next_in to next_out as much as possible,
+  but to not accept any more input.  
+  If all the existing input has been used up and all compressed
+  output has been removed
+    Next state = IDLE; Return value = BZ_STREAM_END
+  else
+    Next state = FINISHING; Return value = BZ_FINISHING
+
+FINISHING/other
+  Illegal.
+  Return value = BZ_SEQUENCE_ERROR
+</programlisting>
+
+
+<para>That still looks complicated?  Well, fair enough.  The
+usual sequence of calls for compressing a load of data is:</para>
+
+<orderedlist>
+
+ <listitem><para>Get started with
+  <computeroutput>BZ2_bzCompressInit</computeroutput>.</para></listitem>
+
+ <listitem><para>Shovel data in and shlurp out its compressed form
+  using zero or more calls of
+  <computeroutput>BZ2_bzCompress</computeroutput> with action =
+  <computeroutput>BZ_RUN</computeroutput>.</para></listitem>
+
+ <listitem><para>Finish up. Repeatedly call
+  <computeroutput>BZ2_bzCompress</computeroutput> with action =
+  <computeroutput>BZ_FINISH</computeroutput>, copying out the
+  compressed output, until
+  <computeroutput>BZ_STREAM_END</computeroutput> is
+  returned.</para></listitem> <listitem><para>Close up and go home.  Call
+  <computeroutput>BZ2_bzCompressEnd</computeroutput>.</para></listitem>
+
+</orderedlist>
+
+<para>If the data you want to compress fits into your input
+buffer all at once, you can skip the calls of
+<computeroutput>BZ2_bzCompress ( ..., BZ_RUN )</computeroutput>
+and just do the <computeroutput>BZ2_bzCompress ( ..., BZ_FINISH
+)</computeroutput> calls.</para>
+
+<para>All required memory is allocated by
+<computeroutput>BZ2_bzCompressInit</computeroutput>.  The
+compression library can accept any data at all (obviously).  So
+you shouldn't get any error return values from the
+<computeroutput>BZ2_bzCompress</computeroutput> calls.  If you
+do, they will be
+<computeroutput>BZ_SEQUENCE_ERROR</computeroutput>, and indicate
+a bug in your programming.</para>
+
+<para>Trivial other possible return values:</para>
+
+<programlisting>
+BZ_PARAM_ERROR
+  if strm is NULL, or strm->s is NULL
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzCompress-end" xreflabel="BZ2_bzCompressEnd">
+<title><computeroutput>BZ2_bzCompressEnd</computeroutput></title>
+
+<programlisting>
+int BZ2_bzCompressEnd ( bz_stream *strm );
+</programlisting>
+
+<para>Releases all memory associated with a compression
+stream.</para>
+
+<para>Possible return values:</para>
+
+<programlisting>
+BZ_PARAM_ERROR  if strm is NULL or strm->s is NULL
+BZ_OK           otherwise
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzDecompress-init" xreflabel="BZ2_bzDecompressInit">
+<title><computeroutput>BZ2_bzDecompressInit</computeroutput></title>
+
+<programlisting>
+int BZ2_bzDecompressInit ( bz_stream *strm, int verbosity, int small );
+</programlisting>
+
+<para>Prepares for decompression.  As with
+<computeroutput>BZ2_bzCompressInit</computeroutput>, a
+<computeroutput>bz_stream</computeroutput> record should be
+allocated and initialised before the call.  Fields
+<computeroutput>bzalloc</computeroutput>,
+<computeroutput>bzfree</computeroutput> and
+<computeroutput>opaque</computeroutput> should be set if a custom
+memory allocator is required, or made
+<computeroutput>NULL</computeroutput> for the normal
+<computeroutput>malloc</computeroutput> /
+<computeroutput>free</computeroutput> routines.  Upon return, the
+internal state will have been initialised, and
+<computeroutput>total_in</computeroutput> and
+<computeroutput>total_out</computeroutput> will be zero.</para>
+
+<para>For the meaning of parameter
+<computeroutput>verbosity</computeroutput>, see
+<computeroutput>BZ2_bzCompressInit</computeroutput>.</para>
+
+<para>If <computeroutput>small</computeroutput> is nonzero, the
+library will use an alternative decompression algorithm which
+uses less memory but at the cost of decompressing more slowly
+(roughly speaking, half the speed, but the maximum memory
+requirement drops to around 2300k).  See <xref linkend="using"/>
+for more information on memory management.</para>
+
+<para>Note that the amount of memory needed to decompress a
+stream cannot be determined until the stream's header has been
+read, so even if
+<computeroutput>BZ2_bzDecompressInit</computeroutput> succeeds, a
+subsequent <computeroutput>BZ2_bzDecompress</computeroutput>
+could fail with
+<computeroutput>BZ_MEM_ERROR</computeroutput>.</para>
+
+<para>Possible return values:</para>
+
+<programlisting>
+BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if ( small != 0 && small != 1 )
+  or (verbosity <; 0 || verbosity > 4)
+BZ_MEM_ERROR
+  if insufficient memory is available
+</programlisting>
+
+<para>Allowable next actions:</para>
+
+<programlisting>
+BZ2_bzDecompress
+  if BZ_OK was returned
+  no specific action required in case of error
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzDecompress" xreflabel="BZ2_bzDecompress">
+<title><computeroutput>BZ2_bzDecompress</computeroutput></title>
+
+<programlisting>
+int BZ2_bzDecompress ( bz_stream *strm );
+</programlisting>
+
+<para>Provides more input and/out output buffer space for the
+library.  The caller maintains input and output buffers, and uses
+<computeroutput>BZ2_bzDecompress</computeroutput> to transfer
+data between them.</para>
+
+<para>Before each call to
+<computeroutput>BZ2_bzDecompress</computeroutput>,
+<computeroutput>next_in</computeroutput> should point at the
+compressed data, and <computeroutput>avail_in</computeroutput>
+should indicate how many bytes the library may read.
+<computeroutput>BZ2_bzDecompress</computeroutput> updates
+<computeroutput>next_in</computeroutput>,
+<computeroutput>avail_in</computeroutput> and
+<computeroutput>total_in</computeroutput> to reflect the number
+of bytes it has read.</para>
+
+<para>Similarly, <computeroutput>next_out</computeroutput> should
+point to a buffer in which the uncompressed output is to be
+placed, with <computeroutput>avail_out</computeroutput>
+indicating how much output space is available.
+<computeroutput>BZ2_bzCompress</computeroutput> updates
+<computeroutput>next_out</computeroutput>,
+<computeroutput>avail_out</computeroutput> and
+<computeroutput>total_out</computeroutput> to reflect the number
+of bytes output.</para>
+
+<para>You may provide and remove as little or as much data as you
+like on each call of
+<computeroutput>BZ2_bzDecompress</computeroutput>.  In the limit,
+it is acceptable to supply and remove data one byte at a time,
+although this would be terribly inefficient.  You should always
+ensure that at least one byte of output space is available at
+each call.</para>
+
+<para>Use of <computeroutput>BZ2_bzDecompress</computeroutput> is
+simpler than
+<computeroutput>BZ2_bzCompress</computeroutput>.</para>
+
+<para>You should provide input and remove output as described
+above, and repeatedly call
+<computeroutput>BZ2_bzDecompress</computeroutput> until
+<computeroutput>BZ_STREAM_END</computeroutput> is returned.
+Appearance of <computeroutput>BZ_STREAM_END</computeroutput>
+denotes that <computeroutput>BZ2_bzDecompress</computeroutput>
+has detected the logical end of the compressed stream.
+<computeroutput>BZ2_bzDecompress</computeroutput> will not
+produce <computeroutput>BZ_STREAM_END</computeroutput> until all
+output data has been placed into the output buffer, so once
+<computeroutput>BZ_STREAM_END</computeroutput> appears, you are
+guaranteed to have available all the decompressed output, and
+<computeroutput>BZ2_bzDecompressEnd</computeroutput> can safely
+be called.</para>
+
+<para>If case of an error return value, you should call
+<computeroutput>BZ2_bzDecompressEnd</computeroutput> to clean up
+and release memory.</para>
+
+<para>Possible return values:</para>
+
+<programlisting>
+BZ_PARAM_ERROR
+  if strm is NULL or strm->s is NULL
+  or strm->avail_out < 1
+BZ_DATA_ERROR
+  if a data integrity error is detected in the compressed stream
+BZ_DATA_ERROR_MAGIC
+  if the compressed stream doesn't begin with the right magic bytes
+BZ_MEM_ERROR
+  if there wasn't enough memory available
+BZ_STREAM_END
+  if the logical end of the data stream was detected and all
+  output in has been consumed, eg s-->avail_out > 0
+BZ_OK
+  otherwise
+</programlisting>
+
+<para>Allowable next actions:</para>
+
+<programlisting>
+BZ2_bzDecompress
+  if BZ_OK was returned
+BZ2_bzDecompressEnd
+  otherwise
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzDecompress-end" xreflabel="BZ2_bzDecompressEnd">
+<title><computeroutput>BZ2_bzDecompressEnd</computeroutput></title>
+
+<programlisting>
+int BZ2_bzDecompressEnd ( bz_stream *strm );
+</programlisting>
+
+<para>Releases all memory associated with a decompression
+stream.</para>
+
+<para>Possible return values:</para>
+
+<programlisting>
+BZ_PARAM_ERROR
+  if strm is NULL or strm->s is NULL
+BZ_OK
+  otherwise
+</programlisting>
+
+<para>Allowable next actions:</para>
+
+<programlisting>
+  None.
+</programlisting>
+
+</sect2>
+
+</sect1>
+
+
+<sect1 id="hl-interface" xreflabel="High-level interface">
+<title>High-level interface</title>
+
+<para>This interface provides functions for reading and writing
+<computeroutput>bzip2</computeroutput> format files.  First, some
+general points.</para>
+
+<itemizedlist mark='bullet'>
+
+ <listitem><para>All of the functions take an
+  <computeroutput>int*</computeroutput> first argument,
+  <computeroutput>bzerror</computeroutput>.  After each call,
+  <computeroutput>bzerror</computeroutput> should be consulted
+  first to determine the outcome of the call.  If
+  <computeroutput>bzerror</computeroutput> is
+  <computeroutput>BZ_OK</computeroutput>, the call completed
+  successfully, and only then should the return value of the
+  function (if any) be consulted.  If
+  <computeroutput>bzerror</computeroutput> is
+  <computeroutput>BZ_IO_ERROR</computeroutput>, there was an
+  error reading/writing the underlying compressed file, and you
+  should then consult <computeroutput>errno</computeroutput> /
+  <computeroutput>perror</computeroutput> to determine the cause
+  of the difficulty.  <computeroutput>bzerror</computeroutput>
+  may also be set to various other values; precise details are
+  given on a per-function basis below.</para></listitem>
+
+ <listitem><para>If <computeroutput>bzerror</computeroutput> indicates
+  an error (ie, anything except
+  <computeroutput>BZ_OK</computeroutput> and
+  <computeroutput>BZ_STREAM_END</computeroutput>), you should
+  immediately call
+  <computeroutput>BZ2_bzReadClose</computeroutput> (or
+  <computeroutput>BZ2_bzWriteClose</computeroutput>, depending on
+  whether you are attempting to read or to write) to free up all
+  resources associated with the stream.  Once an error has been
+  indicated, behaviour of all calls except
+  <computeroutput>BZ2_bzReadClose</computeroutput>
+  (<computeroutput>BZ2_bzWriteClose</computeroutput>) is
+  undefined.  The implication is that (1)
+  <computeroutput>bzerror</computeroutput> should be checked
+  after each call, and (2) if
+  <computeroutput>bzerror</computeroutput> indicates an error,
+  <computeroutput>BZ2_bzReadClose</computeroutput>
+  (<computeroutput>BZ2_bzWriteClose</computeroutput>) should then
+  be called to clean up.</para></listitem>
+
+ <listitem><para>The <computeroutput>FILE*</computeroutput> arguments
+  passed to <computeroutput>BZ2_bzReadOpen</computeroutput> /
+  <computeroutput>BZ2_bzWriteOpen</computeroutput> should be set
+  to binary mode.  Most Unix systems will do this by default, but
+  other platforms, including Windows and Mac, will not.  If you
+  omit this, you may encounter problems when moving code to new
+  platforms.</para></listitem>
+
+ <listitem><para>Memory allocation requests are handled by
+  <computeroutput>malloc</computeroutput> /
+  <computeroutput>free</computeroutput>.  At present there is no
+  facility for user-defined memory allocators in the file I/O
+  functions (could easily be added, though).</para></listitem>
+
+</itemizedlist>
+
+
+
+<sect2 id="bzreadopen" xreflabel="BZ2_bzReadOpen">
+<title><computeroutput>BZ2_bzReadOpen</computeroutput></title>
+
+<programlisting>
+typedef void BZFILE;
+
+BZFILE *BZ2_bzReadOpen( int *bzerror, FILE *f, 
+                        int verbosity, int small,
+                        void *unused, int nUnused );
+</programlisting>
+
+<para>Prepare to read compressed data from file handle
+<computeroutput>f</computeroutput>.
+<computeroutput>f</computeroutput> should refer to a file which
+has been opened for reading, and for which the error indicator
+(<computeroutput>ferror(f)</computeroutput>)is not set.  If
+<computeroutput>small</computeroutput> is 1, the library will try
+to decompress using less memory, at the expense of speed.</para>
+
+<para>For reasons explained below,
+<computeroutput>BZ2_bzRead</computeroutput> will decompress the
+<computeroutput>nUnused</computeroutput> bytes starting at
+<computeroutput>unused</computeroutput>, before starting to read
+from the file <computeroutput>f</computeroutput>.  At most
+<computeroutput>BZ_MAX_UNUSED</computeroutput> bytes may be
+supplied like this.  If this facility is not required, you should
+pass <computeroutput>NULL</computeroutput> and
+<computeroutput>0</computeroutput> for
+<computeroutput>unused</computeroutput> and
+n<computeroutput>Unused</computeroutput> respectively.</para>
+
+<para>For the meaning of parameters
+<computeroutput>small</computeroutput> and
+<computeroutput>verbosity</computeroutput>, see
+<computeroutput>BZ2_bzDecompressInit</computeroutput>.</para>
+
+<para>The amount of memory needed to decompress a file cannot be
+determined until the file's header has been read.  So it is
+possible that <computeroutput>BZ2_bzReadOpen</computeroutput>
+returns <computeroutput>BZ_OK</computeroutput> but a subsequent
+call of <computeroutput>BZ2_bzRead</computeroutput> will return
+<computeroutput>BZ_MEM_ERROR</computeroutput>.</para>
+
+<para>Possible assignments to
+<computeroutput>bzerror</computeroutput>:</para>
+
+<programlisting>
+BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if f is NULL
+  or small is neither 0 nor 1
+  or ( unused == NULL && nUnused != 0 )
+  or ( unused != NULL && !(0 <= nUnused <= BZ_MAX_UNUSED) )
+BZ_IO_ERROR
+  if ferror(f) is nonzero
+BZ_MEM_ERROR
+  if insufficient memory is available
+BZ_OK
+  otherwise.
+</programlisting>
+
+<para>Possible return values:</para>
+
+<programlisting>
+Pointer to an abstract BZFILE
+  if bzerror is BZ_OK
+NULL
+  otherwise
+</programlisting>
+
+<para>Allowable next actions:</para>
+
+<programlisting>
+BZ2_bzRead
+  if bzerror is BZ_OK
+BZ2_bzClose
+  otherwise
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzread" xreflabel="BZ2_bzRead">
+<title><computeroutput>BZ2_bzRead</computeroutput></title>
+
+<programlisting>
+int BZ2_bzRead ( int *bzerror, BZFILE *b, void *buf, int len );
+</programlisting>
+
+<para>Reads up to <computeroutput>len</computeroutput>
+(uncompressed) bytes from the compressed file
+<computeroutput>b</computeroutput> into the buffer
+<computeroutput>buf</computeroutput>.  If the read was
+successful, <computeroutput>bzerror</computeroutput> is set to
+<computeroutput>BZ_OK</computeroutput> and the number of bytes
+read is returned.  If the logical end-of-stream was detected,
+<computeroutput>bzerror</computeroutput> will be set to
+<computeroutput>BZ_STREAM_END</computeroutput>, and the number of
+bytes read is returned.  All other
+<computeroutput>bzerror</computeroutput> values denote an
+error.</para>
+
+<para><computeroutput>BZ2_bzRead</computeroutput> will supply
+<computeroutput>len</computeroutput> bytes, unless the logical
+stream end is detected or an error occurs.  Because of this, it
+is possible to detect the stream end by observing when the number
+of bytes returned is less than the number requested.
+Nevertheless, this is regarded as inadvisable; you should instead
+check <computeroutput>bzerror</computeroutput> after every call
+and watch out for
+<computeroutput>BZ_STREAM_END</computeroutput>.</para>
+
+<para>Internally, <computeroutput>BZ2_bzRead</computeroutput>
+copies data from the compressed file in chunks of size
+<computeroutput>BZ_MAX_UNUSED</computeroutput> bytes before
+decompressing it.  If the file contains more bytes than strictly
+needed to reach the logical end-of-stream,
+<computeroutput>BZ2_bzRead</computeroutput> will almost certainly
+read some of the trailing data before signalling
+<computeroutput>BZ_SEQUENCE_END</computeroutput>.  To collect the
+read but unused data once
+<computeroutput>BZ_SEQUENCE_END</computeroutput> has appeared,
+call <computeroutput>BZ2_bzReadGetUnused</computeroutput>
+immediately before
+<computeroutput>BZ2_bzReadClose</computeroutput>.</para>
+
+<para>Possible assignments to
+<computeroutput>bzerror</computeroutput>:</para>
+
+<programlisting>
+BZ_PARAM_ERROR
+  if b is NULL or buf is NULL or len < 0
+BZ_SEQUENCE_ERROR
+  if b was opened with BZ2_bzWriteOpen
+BZ_IO_ERROR
+  if there is an error reading from the compressed file
+BZ_UNEXPECTED_EOF
+  if the compressed file ended before 
+  the logical end-of-stream was detected
+BZ_DATA_ERROR
+  if a data integrity error was detected in the compressed stream
+BZ_DATA_ERROR_MAGIC
+  if the stream does not begin with the requisite header bytes 
+  (ie, is not a bzip2 data file).  This is really 
+  a special case of BZ_DATA_ERROR.
+BZ_MEM_ERROR
+  if insufficient memory was available
+BZ_STREAM_END
+  if the logical end of stream was detected.
+BZ_OK
+  otherwise.
+</programlisting>
+
+<para>Possible return values:</para>
+
+<programlisting>
+number of bytes read
+  if bzerror is BZ_OK or BZ_STREAM_END
+undefined
+  otherwise
+</programlisting>
+
+<para>Allowable next actions:</para>
+
+<programlisting>
+collect data from buf, then BZ2_bzRead or BZ2_bzReadClose
+  if bzerror is BZ_OK
+collect data from buf, then BZ2_bzReadClose or BZ2_bzReadGetUnused
+  if bzerror is BZ_SEQUENCE_END
+BZ2_bzReadClose
+  otherwise
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzreadgetunused" xreflabel="BZ2_bzReadGetUnused">
+<title><computeroutput>BZ2_bzReadGetUnused</computeroutput></title>
+
+<programlisting>
+void BZ2_bzReadGetUnused( int* bzerror, BZFILE *b, 
+                          void** unused, int* nUnused );
+</programlisting>
+
+<para>Returns data which was read from the compressed file but
+was not needed to get to the logical end-of-stream.
+<computeroutput>*unused</computeroutput> is set to the address of
+the data, and <computeroutput>*nUnused</computeroutput> to the
+number of bytes.  <computeroutput>*nUnused</computeroutput> will
+be set to a value between <computeroutput>0</computeroutput> and
+<computeroutput>BZ_MAX_UNUSED</computeroutput> inclusive.</para>
+
+<para>This function may only be called once
+<computeroutput>BZ2_bzRead</computeroutput> has signalled
+<computeroutput>BZ_STREAM_END</computeroutput> but before
+<computeroutput>BZ2_bzReadClose</computeroutput>.</para>
+
+<para>Possible assignments to
+<computeroutput>bzerror</computeroutput>:</para>
+
+<programlisting>
+BZ_PARAM_ERROR
+  if b is NULL
+  or unused is NULL or nUnused is NULL
+BZ_SEQUENCE_ERROR
+  if BZ_STREAM_END has not been signalled
+  or if b was opened with BZ2_bzWriteOpen
+BZ_OK
+  otherwise
+</programlisting>
+
+<para>Allowable next actions:</para>
+
+<programlisting>
+BZ2_bzReadClose
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzreadclose" xreflabel="BZ2_bzReadClose">
+<title><computeroutput>BZ2_bzReadClose</computeroutput></title>
+
+<programlisting>
+void BZ2_bzReadClose ( int *bzerror, BZFILE *b );
+</programlisting>
+
+<para>Releases all memory pertaining to the compressed file
+<computeroutput>b</computeroutput>.
+<computeroutput>BZ2_bzReadClose</computeroutput> does not call
+<computeroutput>fclose</computeroutput> on the underlying file
+handle, so you should do that yourself if appropriate.
+<computeroutput>BZ2_bzReadClose</computeroutput> should be called
+to clean up after all error situations.</para>
+
+<para>Possible assignments to
+<computeroutput>bzerror</computeroutput>:</para>
+
+<programlisting>
+BZ_SEQUENCE_ERROR
+  if b was opened with BZ2_bzOpenWrite
+BZ_OK
+  otherwise
+</programlisting>
+
+<para>Allowable next actions:</para>
+
+<programlisting>
+none
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzwriteopen" xreflabel="BZ2_bzWriteOpen">
+<title><computeroutput>BZ2_bzWriteOpen</computeroutput></title>
+
+<programlisting>
+BZFILE *BZ2_bzWriteOpen( int *bzerror, FILE *f, 
+                         int blockSize100k, int verbosity,
+                         int workFactor );
+</programlisting>
+
+<para>Prepare to write compressed data to file handle
+<computeroutput>f</computeroutput>.
+<computeroutput>f</computeroutput> should refer to a file which
+has been opened for writing, and for which the error indicator
+(<computeroutput>ferror(f)</computeroutput>)is not set.</para>
+
+<para>For the meaning of parameters
+<computeroutput>blockSize100k</computeroutput>,
+<computeroutput>verbosity</computeroutput> and
+<computeroutput>workFactor</computeroutput>, see
+<computeroutput>BZ2_bzCompressInit</computeroutput>.</para>
+
+<para>All required memory is allocated at this stage, so if the
+call completes successfully,
+<computeroutput>BZ_MEM_ERROR</computeroutput> cannot be signalled
+by a subsequent call to
+<computeroutput>BZ2_bzWrite</computeroutput>.</para>
+
+<para>Possible assignments to
+<computeroutput>bzerror</computeroutput>:</para>
+
+<programlisting>
+BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if f is NULL
+  or blockSize100k < 1 or blockSize100k > 9
+BZ_IO_ERROR
+  if ferror(f) is nonzero
+BZ_MEM_ERROR
+  if insufficient memory is available
+BZ_OK
+  otherwise
+</programlisting>
+
+<para>Possible return values:</para>
+
+<programlisting>
+Pointer to an abstract BZFILE
+  if bzerror is BZ_OK
+NULL
+  otherwise
+</programlisting>
+
+<para>Allowable next actions:</para>
+
+<programlisting>
+BZ2_bzWrite
+  if bzerror is BZ_OK
+  (you could go directly to BZ2_bzWriteClose, but this would be pretty pointless)
+BZ2_bzWriteClose
+  otherwise
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzwrite" xreflabel="BZ2_bzWrite">
+<title><computeroutput>BZ2_bzWrite</computeroutput></title>
+
+<programlisting>
+void BZ2_bzWrite ( int *bzerror, BZFILE *b, void *buf, int len );
+</programlisting>
+
+<para>Absorbs <computeroutput>len</computeroutput> bytes from the
+buffer <computeroutput>buf</computeroutput>, eventually to be
+compressed and written to the file.</para>
+
+<para>Possible assignments to
+<computeroutput>bzerror</computeroutput>:</para>
+
+<programlisting>
+BZ_PARAM_ERROR
+  if b is NULL or buf is NULL or len < 0
+BZ_SEQUENCE_ERROR
+  if b was opened with BZ2_bzReadOpen
+BZ_IO_ERROR
+  if there is an error writing the compressed file.
+BZ_OK
+  otherwise
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzwriteclose" xreflabel="BZ2_bzWriteClose">
+<title><computeroutput>BZ2_bzWriteClose</computeroutput></title>
+
+<programlisting>
+void BZ2_bzWriteClose( int *bzerror, BZFILE* f,
+                       int abandon,
+                       unsigned int* nbytes_in,
+                       unsigned int* nbytes_out );
+
+void BZ2_bzWriteClose64( int *bzerror, BZFILE* f,
+                         int abandon,
+                         unsigned int* nbytes_in_lo32,
+                         unsigned int* nbytes_in_hi32,
+                         unsigned int* nbytes_out_lo32,
+                         unsigned int* nbytes_out_hi32 );
+</programlisting>
+
+<para>Compresses and flushes to the compressed file all data so
+far supplied by <computeroutput>BZ2_bzWrite</computeroutput>.
+The logical end-of-stream markers are also written, so subsequent
+calls to <computeroutput>BZ2_bzWrite</computeroutput> are
+illegal.  All memory associated with the compressed file
+<computeroutput>b</computeroutput> is released.
+<computeroutput>fflush</computeroutput> is called on the
+compressed file, but it is not
+<computeroutput>fclose</computeroutput>'d.</para>
+
+<para>If <computeroutput>BZ2_bzWriteClose</computeroutput> is
+called to clean up after an error, the only action is to release
+the memory.  The library records the error codes issued by
+previous calls, so this situation will be detected automatically.
+There is no attempt to complete the compression operation, nor to
+<computeroutput>fflush</computeroutput> the compressed file.  You
+can force this behaviour to happen even in the case of no error,
+by passing a nonzero value to
+<computeroutput>abandon</computeroutput>.</para>
+
+<para>If <computeroutput>nbytes_in</computeroutput> is non-null,
+<computeroutput>*nbytes_in</computeroutput> will be set to be the
+total volume of uncompressed data handled.  Similarly,
+<computeroutput>nbytes_out</computeroutput> will be set to the
+total volume of compressed data written.  For compatibility with
+older versions of the library,
+<computeroutput>BZ2_bzWriteClose</computeroutput> only yields the
+lower 32 bits of these counts.  Use
+<computeroutput>BZ2_bzWriteClose64</computeroutput> if you want
+the full 64 bit counts.  These two functions are otherwise
+absolutely identical.</para>
+
+<para>Possible assignments to
+<computeroutput>bzerror</computeroutput>:</para>
+
+<programlisting>
+BZ_SEQUENCE_ERROR
+  if b was opened with BZ2_bzReadOpen
+BZ_IO_ERROR
+  if there is an error writing the compressed file
+BZ_OK
+  otherwise
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="embed" xreflabel="Handling embedded compressed data streams">
+<title>Handling embedded compressed data streams</title>
+
+<para>The high-level library facilitates use of
+<computeroutput>bzip2</computeroutput> data streams which form
+some part of a surrounding, larger data stream.</para>
+
+<itemizedlist mark='bullet'>
+
+ <listitem><para>For writing, the library takes an open file handle,
+  writes compressed data to it,
+  <computeroutput>fflush</computeroutput>es it but does not
+  <computeroutput>fclose</computeroutput> it.  The calling
+  application can write its own data before and after the
+  compressed data stream, using that same file handle.</para></listitem>
+
+ <listitem><para>Reading is more complex, and the facilities are not as
+  general as they could be since generality is hard to reconcile
+  with efficiency.  <computeroutput>BZ2_bzRead</computeroutput>
+  reads from the compressed file in blocks of size
+  <computeroutput>BZ_MAX_UNUSED</computeroutput> bytes, and in
+  doing so probably will overshoot the logical end of compressed
+  stream.  To recover this data once decompression has ended,
+  call <computeroutput>BZ2_bzReadGetUnused</computeroutput> after
+  the last call of <computeroutput>BZ2_bzRead</computeroutput>
+  (the one returning
+  <computeroutput>BZ_STREAM_END</computeroutput>) but before
+  calling
+  <computeroutput>BZ2_bzReadClose</computeroutput>.</para></listitem>
+
+</itemizedlist>
+
+<para>This mechanism makes it easy to decompress multiple
+<computeroutput>bzip2</computeroutput> streams placed end-to-end.
+As the end of one stream, when
+<computeroutput>BZ2_bzRead</computeroutput> returns
+<computeroutput>BZ_STREAM_END</computeroutput>, call
+<computeroutput>BZ2_bzReadGetUnused</computeroutput> to collect
+the unused data (copy it into your own buffer somewhere).  That
+data forms the start of the next compressed stream.  To start
+uncompressing that next stream, call
+<computeroutput>BZ2_bzReadOpen</computeroutput> again, feeding in
+the unused data via the <computeroutput>unused</computeroutput> /
+<computeroutput>nUnused</computeroutput> parameters.  Keep doing
+this until <computeroutput>BZ_STREAM_END</computeroutput> return
+coincides with the physical end of file
+(<computeroutput>feof(f)</computeroutput>).  In this situation
+<computeroutput>BZ2_bzReadGetUnused</computeroutput> will of
+course return no data.</para>
+
+<para>This should give some feel for how the high-level interface
+can be used.  If you require extra flexibility, you'll have to
+bite the bullet and get to grips with the low-level
+interface.</para>
+
+</sect2>
+
+
+<sect2 id="std-rdwr" xreflabel="Standard file-reading/writing code">
+<title>Standard file-reading/writing code</title>
+
+<para>Here's how you'd write data to a compressed file:</para>
+
+<programlisting>
+FILE*   f;
+BZFILE* b;
+int     nBuf;
+char    buf[ /* whatever size you like */ ];
+int     bzerror;
+int     nWritten;
+
+f = fopen ( "myfile.bz2", "w" );
+if ( !f ) {
+ /* handle error */
+}
+b = BZ2_bzWriteOpen( &bzerror, f, 9 );
+if (bzerror != BZ_OK) {
+ BZ2_bzWriteClose ( b );
+ /* handle error */
+}
+
+while ( /* condition */ ) {
+ /* get data to write into buf, and set nBuf appropriately */
+ nWritten = BZ2_bzWrite ( &bzerror, b, buf, nBuf );
+ if (bzerror == BZ_IO_ERROR) { 
+   BZ2_bzWriteClose ( &bzerror, b );
+   /* handle error */
+ }
+}
+
+BZ2_bzWriteClose( &bzerror, b );
+if (bzerror == BZ_IO_ERROR) {
+ /* handle error */
+}
+</programlisting>
+
+<para>And to read from a compressed file:</para>
+
+<programlisting>
+FILE*   f;
+BZFILE* b;
+int     nBuf;
+char    buf[ /* whatever size you like */ ];
+int     bzerror;
+int     nWritten;
+
+f = fopen ( "myfile.bz2", "r" );
+if ( !f ) {
+  /* handle error */
+}
+b = BZ2_bzReadOpen ( &bzerror, f, 0, NULL, 0 );
+if ( bzerror != BZ_OK ) {
+  BZ2_bzReadClose ( &bzerror, b );
+  /* handle error */
+}
+
+bzerror = BZ_OK;
+while ( bzerror == BZ_OK && /* arbitrary other conditions */) {
+  nBuf = BZ2_bzRead ( &bzerror, b, buf, /* size of buf */ );
+  if ( bzerror == BZ_OK ) {
+    /* do something with buf[0 .. nBuf-1] */
+  }
+}
+if ( bzerror != BZ_STREAM_END ) {
+   BZ2_bzReadClose ( &bzerror, b );
+   /* handle error */
+} else {
+   BZ2_bzReadClose ( &bzerror );
+}
+</programlisting>
+
+</sect2>
+
+</sect1>
+
+
+<sect1 id="util-fns" xreflabel="Utility functions">
+<title>Utility functions</title>
+
+
+<sect2 id="bzbufftobuffcompress" xreflabel="BZ2_bzBuffToBuffCompress">
+<title><computeroutput>BZ2_bzBuffToBuffCompress</computeroutput></title>
+
+<programlisting>
+int BZ2_bzBuffToBuffCompress( char*         dest,
+                              unsigned int* destLen,
+                              char*         source,
+                              unsigned int  sourceLen,
+                              int           blockSize100k,
+                              int           verbosity,
+                              int           workFactor );
+</programlisting>
+
+<para>Attempts to compress the data in <computeroutput>source[0
+.. sourceLen-1]</computeroutput> into the destination buffer,
+<computeroutput>dest[0 .. *destLen-1]</computeroutput>.  If the
+destination buffer is big enough,
+<computeroutput>*destLen</computeroutput> is set to the size of
+the compressed data, and <computeroutput>BZ_OK</computeroutput>
+is returned.  If the compressed data won't fit,
+<computeroutput>*destLen</computeroutput> is unchanged, and
+<computeroutput>BZ_OUTBUFF_FULL</computeroutput> is
+returned.</para>
+
+<para>Compression in this manner is a one-shot event, done with a
+single call to this function.  The resulting compressed data is a
+complete <computeroutput>bzip2</computeroutput> format data
+stream.  There is no mechanism for making additional calls to
+provide extra input data.  If you want that kind of mechanism,
+use the low-level interface.</para>
+
+<para>For the meaning of parameters
+<computeroutput>blockSize100k</computeroutput>,
+<computeroutput>verbosity</computeroutput> and
+<computeroutput>workFactor</computeroutput>, see
+<computeroutput>BZ2_bzCompressInit</computeroutput>.</para>
+
+<para>To guarantee that the compressed data will fit in its
+buffer, allocate an output buffer of size 1% larger than the
+uncompressed data, plus six hundred extra bytes.</para>
+
+<para><computeroutput>BZ2_bzBuffToBuffDecompress</computeroutput>
+will not write data at or beyond
+<computeroutput>dest[*destLen]</computeroutput>, even in case of
+buffer overflow.</para>
+
+<para>Possible return values:</para>
+
+<programlisting>
+BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if dest is NULL or destLen is NULL
+  or blockSize100k < 1 or blockSize100k > 9
+  or verbosity < 0 or verbosity > 4
+  or workFactor < 0 or workFactor > 250
+BZ_MEM_ERROR
+  if insufficient memory is available 
+BZ_OUTBUFF_FULL
+  if the size of the compressed data exceeds *destLen
+BZ_OK
+  otherwise
+</programlisting>
+
+</sect2>
+
+
+<sect2 id="bzbufftobuffdecompress" xreflabel="BZ2_bzBuffToBuffDecompress">
+<title><computeroutput>BZ2_bzBuffToBuffDecompress</computeroutput></title>
+
+<programlisting>
+int BZ2_bzBuffToBuffDecompress( char*         dest,
+                                unsigned int* destLen,
+                                char*         source,
+                                unsigned int  sourceLen,
+                                int           small,
+                                int           verbosity );
+</programlisting>
+
+<para>Attempts to decompress the data in <computeroutput>source[0
+.. sourceLen-1]</computeroutput> into the destination buffer,
+<computeroutput>dest[0 .. *destLen-1]</computeroutput>.  If the
+destination buffer is big enough,
+<computeroutput>*destLen</computeroutput> is set to the size of
+the uncompressed data, and <computeroutput>BZ_OK</computeroutput>
+is returned.  If the compressed data won't fit,
+<computeroutput>*destLen</computeroutput> is unchanged, and
+<computeroutput>BZ_OUTBUFF_FULL</computeroutput> is
+returned.</para>
+
+<para><computeroutput>source</computeroutput> is assumed to hold
+a complete <computeroutput>bzip2</computeroutput> format data
+stream.
+<computeroutput>BZ2_bzBuffToBuffDecompress</computeroutput> tries
+to decompress the entirety of the stream into the output
+buffer.</para>
+
+<para>For the meaning of parameters
+<computeroutput>small</computeroutput> and
+<computeroutput>verbosity</computeroutput>, see
+<computeroutput>BZ2_bzDecompressInit</computeroutput>.</para>
+
+<para>Because the compression ratio of the compressed data cannot
+be known in advance, there is no easy way to guarantee that the
+output buffer will be big enough.  You may of course make
+arrangements in your code to record the size of the uncompressed
+data, but such a mechanism is beyond the scope of this
+library.</para>
+
+<para><computeroutput>BZ2_bzBuffToBuffDecompress</computeroutput>
+will not write data at or beyond
+<computeroutput>dest[*destLen]</computeroutput>, even in case of
+buffer overflow.</para>
+
+<para>Possible return values:</para>
+
+<programlisting>
+BZ_CONFIG_ERROR
+  if the library has been mis-compiled
+BZ_PARAM_ERROR
+  if dest is NULL or destLen is NULL
+  or small != 0 && small != 1
+  or verbosity < 0 or verbosity > 4
+BZ_MEM_ERROR
+  if insufficient memory is available 
+BZ_OUTBUFF_FULL
+  if the size of the compressed data exceeds *destLen
+BZ_DATA_ERROR
+  if a data integrity error was detected in the compressed data
+BZ_DATA_ERROR_MAGIC
+  if the compressed data doesn't begin with the right magic bytes
+BZ_UNEXPECTED_EOF
+  if the compressed data ends unexpectedly
+BZ_OK
+  otherwise
+</programlisting>
+
+</sect2>
+
+</sect1>
+
+
+<sect1 id="zlib-compat" xreflabel="zlib compatibility functions">
+<title><computeroutput>zlib</computeroutput> compatibility functions</title>
+
+<para>Yoshioka Tsuneo has contributed some functions to give
+better <computeroutput>zlib</computeroutput> compatibility.
+These functions are <computeroutput>BZ2_bzopen</computeroutput>,
+<computeroutput>BZ2_bzread</computeroutput>,
+<computeroutput>BZ2_bzwrite</computeroutput>,
+<computeroutput>BZ2_bzflush</computeroutput>,
+<computeroutput>BZ2_bzclose</computeroutput>,
+<computeroutput>BZ2_bzerror</computeroutput> and
+<computeroutput>BZ2_bzlibVersion</computeroutput>.  These
+functions are not (yet) officially part of the library.  If they
+break, you get to keep all the pieces.  Nevertheless, I think
+they work ok.</para>
+
+<programlisting>
+typedef void BZFILE;
+
+const char * BZ2_bzlibVersion ( void );
+</programlisting>
+
+<para>Returns a string indicating the library version.</para>
+
+<programlisting>
+BZFILE * BZ2_bzopen  ( const char *path, const char *mode );
+BZFILE * BZ2_bzdopen ( int        fd,    const char *mode );
+</programlisting>
+
+<para>Opens a <computeroutput>.bz2</computeroutput> file for
+reading or writing, using either its name or a pre-existing file
+descriptor.  Analogous to <computeroutput>fopen</computeroutput>
+and <computeroutput>fdopen</computeroutput>.</para>
+
+<programlisting>
+int BZ2_bzread  ( BZFILE* b, void* buf, int len );
+int BZ2_bzwrite ( BZFILE* b, void* buf, int len );
+</programlisting>
+
+<para>Reads/writes data from/to a previously opened
+<computeroutput>BZFILE</computeroutput>.  Analogous to
+<computeroutput>fread</computeroutput> and
+<computeroutput>fwrite</computeroutput>.</para>
+
+<programlisting>
+int  BZ2_bzflush ( BZFILE* b );
+void BZ2_bzclose ( BZFILE* b );
+</programlisting>
+
+<para>Flushes/closes a <computeroutput>BZFILE</computeroutput>.
+<computeroutput>BZ2_bzflush</computeroutput> doesn't actually do
+anything.  Analogous to <computeroutput>fflush</computeroutput>
+and <computeroutput>fclose</computeroutput>.</para>
+
+<programlisting>
+const char * BZ2_bzerror ( BZFILE *b, int *errnum )
+</programlisting>
+
+<para>Returns a string describing the more recent error status of
+<computeroutput>b</computeroutput>, and also sets
+<computeroutput>*errnum</computeroutput> to its numerical
+value.</para>
+
+</sect1>
+
+
+<sect1 id="stdio-free" 
+       xreflabel="Using the library in a stdio-free environment">
+<title>Using the library in a <computeroutput>stdio</computeroutput>-free environment</title>
+
+
+<sect2 id="stdio-bye" xreflabel="Getting rid of stdio">
+<title>Getting rid of <computeroutput>stdio</computeroutput></title>
+
+<para>In a deeply embedded application, you might want to use
+just the memory-to-memory functions.  You can do this
+conveniently by compiling the library with preprocessor symbol
+<computeroutput>BZ_NO_STDIO</computeroutput> defined.  Doing this
+gives you a library containing only the following eight
+functions:</para>
+
+<para><computeroutput>BZ2_bzCompressInit</computeroutput>,
+<computeroutput>BZ2_bzCompress</computeroutput>,
+<computeroutput>BZ2_bzCompressEnd</computeroutput>
+<computeroutput>BZ2_bzDecompressInit</computeroutput>,
+<computeroutput>BZ2_bzDecompress</computeroutput>,
+<computeroutput>BZ2_bzDecompressEnd</computeroutput>
+<computeroutput>BZ2_bzBuffToBuffCompress</computeroutput>,
+<computeroutput>BZ2_bzBuffToBuffDecompress</computeroutput></para>
+
+<para>When compiled like this, all functions will ignore
+<computeroutput>verbosity</computeroutput> settings.</para>
+
+</sect2>
+
+
+<sect2 id="critical-error" xreflabel="Critical error handling">
+<title>Critical error handling</title>
+
+<para><computeroutput>libbzip2</computeroutput> contains a number
+of internal assertion checks which should, needless to say, never
+be activated.  Nevertheless, if an assertion should fail,
+behaviour depends on whether or not the library was compiled with
+<computeroutput>BZ_NO_STDIO</computeroutput> set.</para>
+
+<para>For a normal compile, an assertion failure yields the
+message:</para>
+
+<blockquote>
+<para>bzip2/libbzip2: internal error number N.</para>
+<para>This is a bug in bzip2/libbzip2, &bz-version; of &bz-date;.
+Please report it to me at: &bz-email;.  If this happened
+when you were using some program which uses libbzip2 as a
+component, you should also report this bug to the author(s)
+of that program.  Please make an effort to report this bug;
+timely and accurate bug reports eventually lead to higher
+quality software.  Thanks.  Julian Seward, &bz-date;.
+</para></blockquote>
+
+<para>where <computeroutput>N</computeroutput> is some error code
+number.  If <computeroutput>N == 1007</computeroutput>, it also
+prints some extra text advising the reader that unreliable memory
+is often associated with internal error 1007. (This is a
+frequently-observed-phenomenon with versions 1.0.0/1.0.1).</para>
+
+<para><computeroutput>exit(3)</computeroutput> is then
+called.</para>
+
+<para>For a <computeroutput>stdio</computeroutput>-free library,
+assertion failures result in a call to a function declared
+as:</para>
+
+<programlisting>
+extern void bz_internal_error ( int errcode );
+</programlisting>
+
+<para>The relevant code is passed as a parameter.  You should
+supply such a function.</para>
+
+<para>In either case, once an assertion failure has occurred, any
+<computeroutput>bz_stream</computeroutput> records involved can
+be regarded as invalid.  You should not attempt to resume normal
+operation with them.</para>
+
+<para>You may, of course, change critical error handling to suit
+your needs.  As I said above, critical errors indicate bugs in
+the library and should not occur.  All "normal" error situations
+are indicated via error return codes from functions, and can be
+recovered from.</para>
+
+</sect2>
+
+</sect1>
+
+
+<sect1 id="win-dll" xreflabel="Making a Windows DLL">
+<title>Making a Windows DLL</title>
+
+<para>Everything related to Windows has been contributed by
+Yoshioka Tsuneo
+(<computeroutput>QWF00133@niftyserve.or.jp</computeroutput> /
+<computeroutput>tsuneo-y@is.aist-nara.ac.jp</computeroutput>), so
+you should send your queries to him (but perhaps Cc: me,
+<computeroutput>&bz-email;</computeroutput>).</para>
+
+<para>My vague understanding of what to do is: using Visual C++
+5.0, open the project file
+<computeroutput>libbz2.dsp</computeroutput>, and build.  That's
+all.</para>
+
+<para>If you can't open the project file for some reason, make a
+new one, naming these files:
+<computeroutput>blocksort.c</computeroutput>,
+<computeroutput>bzlib.c</computeroutput>,
+<computeroutput>compress.c</computeroutput>,
+<computeroutput>crctable.c</computeroutput>,
+<computeroutput>decompress.c</computeroutput>,
+<computeroutput>huffman.c</computeroutput>,
+<computeroutput>randtable.c</computeroutput> and
+<computeroutput>libbz2.def</computeroutput>.  You will also need
+to name the header files <computeroutput>bzlib.h</computeroutput>
+and <computeroutput>bzlib_private.h</computeroutput>.</para>
+
+<para>If you don't use VC++, you may need to define the
+proprocessor symbol
+<computeroutput>_WIN32</computeroutput>.</para>
+
+<para>Finally, <computeroutput>dlltest.c</computeroutput> is a
+sample program using the DLL.  It has a project file,
+<computeroutput>dlltest.dsp</computeroutput>.</para>
+
+<para>If you just want a makefile for Visual C, have a look at
+<computeroutput>makefile.msc</computeroutput>.</para>
+
+<para>Be aware that if you compile
+<computeroutput>bzip2</computeroutput> itself on Win32, you must
+set <computeroutput>BZ_UNIX</computeroutput> to 0 and
+<computeroutput>BZ_LCCWIN32</computeroutput> to 1, in the file
+<computeroutput>bzip2.c</computeroutput>, before compiling.
+Otherwise the resulting binary won't work correctly.</para>
+
+<para>I haven't tried any of this stuff myself, but it all looks
+plausible.</para>
+
+</sect1>
+
+</chapter>
+
+
+
+<chapter id="misc" xreflabel="Miscellanea">
+<title>Miscellanea</title>
+
+<para>These are just some random thoughts of mine.  Your mileage
+may vary.</para>
+
+
+<sect1 id="limits" xreflabel="Limitations of the compressed file format">
+<title>Limitations of the compressed file format</title>
+
+<para><computeroutput>bzip2-1.0.X</computeroutput>,
+<computeroutput>0.9.5</computeroutput> and
+<computeroutput>0.9.0</computeroutput> use exactly the same file
+format as the original version,
+<computeroutput>bzip2-0.1</computeroutput>.  This decision was
+made in the interests of stability.  Creating yet another
+incompatible compressed file format would create further
+confusion and disruption for users.</para>
+
+<para>Nevertheless, this is not a painless decision.  Development
+work since the release of
+<computeroutput>bzip2-0.1</computeroutput> in August 1997 has
+shown complexities in the file format which slow down
+decompression and, in retrospect, are unnecessary.  These
+are:</para>
+
+<itemizedlist mark='bullet'>
+
+ <listitem><para>The run-length encoder, which is the first of the
+   compression transformations, is entirely irrelevant.  The
+   original purpose was to protect the sorting algorithm from the
+   very worst case input: a string of repeated symbols.  But
+   algorithm steps Q6a and Q6b in the original Burrows-Wheeler
+   technical report (SRC-124) show how repeats can be handled
+   without difficulty in block sorting.</para></listitem>
+
+ <listitem><para>The randomisation mechanism doesn't really need to be
+   there.  Udi Manber and Gene Myers published a suffix array
+   construction algorithm a few years back, which can be employed
+   to sort any block, no matter how repetitive, in O(N log N)
+   time.  Subsequent work by Kunihiko Sadakane has produced a
+   derivative O(N (log N)^2) algorithm which usually outperforms
+   the Manber-Myers algorithm.</para>
+
+   <para>I could have changed to Sadakane's algorithm, but I find
+   it to be slower than <computeroutput>bzip2</computeroutput>'s
+   existing algorithm for most inputs, and the randomisation
+   mechanism protects adequately against bad cases.  I didn't
+   think it was a good tradeoff to make.  Partly this is due to
+   the fact that I was not flooded with email complaints about
+   <computeroutput>bzip2-0.1</computeroutput>'s performance on
+   repetitive data, so perhaps it isn't a problem for real
+   inputs.</para>
+
+   <para>Probably the best long-term solution, and the one I have
+   incorporated into 0.9.5 and above, is to use the existing
+   sorting algorithm initially, and fall back to a O(N (log N)^2)
+   algorithm if the standard algorithm gets into
+   difficulties.</para></listitem>
+
+  <listitem><para>The compressed file format was never designed to be
+   handled by a library, and I have had to jump though some hoops
+   to produce an efficient implementation of decompression.  It's
+   a bit hairy.  Try passing
+   <computeroutput>decompress.c</computeroutput> through the C
+   preprocessor and you'll see what I mean.  Much of this
+   complexity could have been avoided if the compressed size of
+   each block of data was recorded in the data stream.</para></listitem>
+
+ <listitem><para>An Adler-32 checksum, rather than a CRC32 checksum,
+   would be faster to compute.</para></listitem>
+
+</itemizedlist>
+
+<para>It would be fair to say that the
+<computeroutput>bzip2</computeroutput> format was frozen before I
+properly and fully understood the performance consequences of
+doing so.</para>
+
+<para>Improvements which I was able to incorporate into 0.9.0,
+despite using the same file format, are:</para>
+
+<itemizedlist mark='bullet'>
+
+ <listitem><para>Single array implementation of the inverse BWT.  This
+  significantly speeds up decompression, presumably because it
+  reduces the number of cache misses.</para></listitem>
+
+ <listitem><para>Faster inverse MTF transform for large MTF values.
+  The new implementation is based on the notion of sliding blocks
+  of values.</para></listitem>
+
+ <listitem><para><computeroutput>bzip2-0.9.0</computeroutput> now reads
+  and writes files with <computeroutput>fread</computeroutput>
+  and <computeroutput>fwrite</computeroutput>; version 0.1 used
+  <computeroutput>putc</computeroutput> and
+  <computeroutput>getc</computeroutput>.  Duh!  Well, you live
+  and learn.</para></listitem>
+
+</itemizedlist>
+
+<para>Further ahead, it would be nice to be able to do random
+access into files.  This will require some careful design of
+compressed file formats.</para>
+
+</sect1>
+
+
+<sect1 id="port-issues" xreflabel="Portability issues">
+<title>Portability issues</title>
+
+<para>After some consideration, I have decided not to use GNU
+<computeroutput>autoconf</computeroutput> to configure 0.9.5 or
+1.0.</para>
+
+<para><computeroutput>autoconf</computeroutput>, admirable and
+wonderful though it is, mainly assists with portability problems
+between Unix-like platforms.  But
+<computeroutput>bzip2</computeroutput> doesn't have much in the
+way of portability problems on Unix; most of the difficulties
+appear when porting to the Mac, or to Microsoft's operating
+systems.  <computeroutput>autoconf</computeroutput> doesn't help
+in those cases, and brings in a whole load of new
+complexity.</para>
+
+<para>Most people should be able to compile the library and
+program under Unix straight out-of-the-box, so to speak,
+especially if you have a version of GNU C available.</para>
+
+<para>There are a couple of
+<computeroutput>__inline__</computeroutput> directives in the
+code.  GNU C (<computeroutput>gcc</computeroutput>) should be
+able to handle them.  If you're not using GNU C, your C compiler
+shouldn't see them at all.  If your compiler does, for some
+reason, see them and doesn't like them, just
+<computeroutput>#define</computeroutput>
+<computeroutput>__inline__</computeroutput> to be
+<computeroutput>/* */</computeroutput>.  One easy way to do this
+is to compile with the flag
+<computeroutput>-D__inline__=</computeroutput>, which should be
+understood by most Unix compilers.</para>
+
+<para>If you still have difficulties, try compiling with the
+macro <computeroutput>BZ_STRICT_ANSI</computeroutput> defined.
+This should enable you to build the library in a strictly ANSI
+compliant environment.  Building the program itself like this is
+dangerous and not supported, since you remove
+<computeroutput>bzip2</computeroutput>'s checks against
+compressing directories, symbolic links, devices, and other
+not-really-a-file entities.  This could cause filesystem
+corruption!</para>
+
+<para>One other thing: if you create a
+<computeroutput>bzip2</computeroutput> binary for public distribution,
+please consider linking it statically (<computeroutput>gcc
+-static</computeroutput>).  This avoids all sorts of library-version
+issues that others may encounter later on.</para>
+
+<para>If you build <computeroutput>bzip2</computeroutput> on
+Win32, you must set <computeroutput>BZ_UNIX</computeroutput> to 0
+and <computeroutput>BZ_LCCWIN32</computeroutput> to 1, in the
+file <computeroutput>bzip2.c</computeroutput>, before compiling.
+Otherwise the resulting binary won't work correctly.</para>
+
+</sect1>
+
+
+<sect1 id="bugs" xreflabel="Reporting bugs">
+<title>Reporting bugs</title>
+
+<para>I tried pretty hard to make sure
+<computeroutput>bzip2</computeroutput> is bug free, both by
+design and by testing.  Hopefully you'll never need to read this
+section for real.</para>
+
+<para>Nevertheless, if <computeroutput>bzip2</computeroutput> dies
+with a segmentation fault, a bus error or an internal assertion
+failure, it will ask you to email me a bug report.  Experience from
+years of feedback of bzip2 users indicates that almost all these
+problems can be traced to either compiler bugs or hardware
+problems.</para>
+
+<itemizedlist mark='bullet'>
+
+ <listitem><para>Recompile the program with no optimisation, and
+  see if it works.  And/or try a different compiler.  I heard all
+  sorts of stories about various flavours of GNU C (and other
+  compilers) generating bad code for
+  <computeroutput>bzip2</computeroutput>, and I've run across two
+  such examples myself.</para>
+
+  <para>2.7.X versions of GNU C are known to generate bad code
+  from time to time, at high optimisation levels.  If you get
+  problems, try using the flags
+  <computeroutput>-O2</computeroutput>
+  <computeroutput>-fomit-frame-pointer</computeroutput>
+  <computeroutput>-fno-strength-reduce</computeroutput>.  You
+  should specifically <emphasis>not</emphasis> use
+  <computeroutput>-funroll-loops</computeroutput>.</para>
+
+  <para>You may notice that the Makefile runs six tests as part
+  of the build process.  If the program passes all of these, it's
+  a pretty good (but not 100%) indication that the compiler has
+  done its job correctly.</para></listitem>
+
+ <listitem><para>If <computeroutput>bzip2</computeroutput>
+  crashes randomly, and the crashes are not repeatable, you may
+  have a flaky memory subsystem.
+  <computeroutput>bzip2</computeroutput> really hammers your
+  memory hierarchy, and if it's a bit marginal, you may get these
+  problems.  Ditto if your disk or I/O subsystem is slowly
+  failing.  Yup, this really does happen.</para>
+
+  <para>Try using a different machine of the same type, and see
+  if you can repeat the problem.</para></listitem>
+
+  <listitem><para>This isn't really a bug, but ... If
+  <computeroutput>bzip2</computeroutput> tells you your file is
+  corrupted on decompression, and you obtained the file via FTP,
+  there is a possibility that you forgot to tell FTP to do a
+  binary mode transfer.  That absolutely will cause the file to
+  be non-decompressible.  You'll have to transfer it
+  again.</para></listitem>
+
+</itemizedlist>
+
+<para>If you've incorporated
+<computeroutput>libbzip2</computeroutput> into your own program
+and are getting problems, please, please, please, check that the
+parameters you are passing in calls to the library, are correct,
+and in accordance with what the documentation says is allowable.
+I have tried to make the library robust against such problems,
+but I'm sure I haven't succeeded.</para>
+
+<para>Finally, if the above comments don't help, you'll have to
+send me a bug report.  Now, it's just amazing how many people
+will send me a bug report saying something like:</para>
+
+<programlisting>
+bzip2 crashed with segmentation fault on my machine
+</programlisting>
+
+<para>and absolutely nothing else.  Needless to say, a such a
+report is <emphasis>totally, utterly, completely and
+comprehensively 100% useless; a waste of your time, my time, and
+net bandwidth</emphasis>.  With no details at all, there's no way
+I can possibly begin to figure out what the problem is.</para>
+
+<para>The rules of the game are: facts, facts, facts.  Don't omit
+them because "oh, they won't be relevant".  At the bare
+minimum:</para>
+
+<programlisting>
+Machine type.  Operating system version.  
+Exact version of bzip2 (do bzip2 -V).  
+Exact version of the compiler used.  
+Flags passed to the compiler.
+</programlisting>
+
+<para>However, the most important single thing that will help me
+is the file that you were trying to compress or decompress at the
+time the problem happened.  Without that, my ability to do
+anything more than speculate about the cause, is limited.</para>
+
+</sect1>
+
+
+<sect1 id="package" xreflabel="Did you get the right package?">
+<title>Did you get the right package?</title>
+
+<para><computeroutput>bzip2</computeroutput> is a resource hog.
+It soaks up large amounts of CPU cycles and memory.  Also, it
+gives very large latencies.  In the worst case, you can feed many
+megabytes of uncompressed data into the library before getting
+any compressed output, so this probably rules out applications
+requiring interactive behaviour.</para>
+
+<para>These aren't faults of my implementation, I hope, but more
+an intrinsic property of the Burrows-Wheeler transform
+(unfortunately).  Maybe this isn't what you want.</para>
+
+<para>If you want a compressor and/or library which is faster,
+uses less memory but gets pretty good compression, and has
+minimal latency, consider Jean-loup Gailly's and Mark Adler's
+work, <computeroutput>zlib-1.2.1</computeroutput> and
+<computeroutput>gzip-1.2.4</computeroutput>.  Look for them at 
+<ulink url="http://www.zlib.org">http://www.zlib.org</ulink> and 
+<ulink url="http://www.gzip.org">http://www.gzip.org</ulink>
+respectively.</para>
+
+<para>For something faster and lighter still, you might try Markus F
+X J Oberhumer's <computeroutput>LZO</computeroutput> real-time
+compression/decompression library, at 
+<ulink url="http://www.oberhumer.com/opensource">http://www.oberhumer.com/opensource</ulink>.</para>
+
+</sect1>
+
+
+
+<sect1 id="reading" xreflabel="Further Reading">
+<title>Further Reading</title>
+
+<para><computeroutput>bzip2</computeroutput> is not research
+work, in the sense that it doesn't present any new ideas.
+Rather, it's an engineering exercise based on existing
+ideas.</para>
+
+<para>Four documents describe essentially all the ideas behind
+<computeroutput>bzip2</computeroutput>:</para>
+
+<literallayout>Michael Burrows and D. J. Wheeler:
+  "A block-sorting lossless data compression algorithm"
+   10th May 1994. 
+   Digital SRC Research Report 124.
+   ftp://ftp.digital.com/pub/DEC/SRC/research-reports/SRC-124.ps.gz
+   If you have trouble finding it, try searching at the
+   New Zealand Digital Library, http://www.nzdl.org.
+
+Daniel S. Hirschberg and Debra A. LeLewer
+  "Efficient Decoding of Prefix Codes"
+   Communications of the ACM, April 1990, Vol 33, Number 4.
+   You might be able to get an electronic copy of this
+   from the ACM Digital Library.
+
+David J. Wheeler
+   Program bred3.c and accompanying document bred3.ps.
+   This contains the idea behind the multi-table Huffman coding scheme.
+   ftp://ftp.cl.cam.ac.uk/users/djw3/
+
+Jon L. Bentley and Robert Sedgewick
+  "Fast Algorithms for Sorting and Searching Strings"
+   Available from Sedgewick's web page,
+   www.cs.princeton.edu/~rs
+</literallayout>
+
+<para>The following paper gives valuable additional insights into
+the algorithm, but is not immediately the basis of any code used
+in bzip2.</para>
+
+<literallayout>Peter Fenwick:
+   Block Sorting Text Compression
+   Proceedings of the 19th Australasian Computer Science Conference,
+     Melbourne, Australia.  Jan 31 - Feb 2, 1996.
+   ftp://ftp.cs.auckland.ac.nz/pub/peter-f/ACSC96paper.ps</literallayout>
+
+<para>Kunihiko Sadakane's sorting algorithm, mentioned above, is
+available from:</para>
+
+<literallayout>http://naomi.is.s.u-tokyo.ac.jp/~sada/papers/Sada98b.ps.gz
+</literallayout>
+
+<para>The Manber-Myers suffix array construction algorithm is
+described in a paper available from:</para>
+
+<literallayout>http://www.cs.arizona.edu/people/gene/PAPERS/suffix.ps
+</literallayout>
+
+<para>Finally, the following papers document some
+investigations I made into the performance of sorting
+and decompression algorithms:</para>
+
+<literallayout>Julian Seward
+   On the Performance of BWT Sorting Algorithms
+   Proceedings of the IEEE Data Compression Conference 2000
+     Snowbird, Utah.  28-30 March 2000.
+
+Julian Seward
+   Space-time Tradeoffs in the Inverse B-W Transform
+   Proceedings of the IEEE Data Compression Conference 2001
+     Snowbird, Utah.  27-29 March 2001.
+</literallayout>
+
+</sect1>
+
+</chapter>
+
+</book>
diff --git a/updater/bzip2-1.0.3/mk251.c b/updater/bzip2-1.0.3/mk251.c
new file mode 100644
index 0000000..205778a
--- /dev/null
+++ b/updater/bzip2-1.0.3/mk251.c
@@ -0,0 +1,16 @@
+
+/* Spew out a long sequence of the byte 251.  When fed to bzip2
+   versions 1.0.0 or 1.0.1, causes it to die with internal error
+   1007 in blocksort.c.  This assertion misses an extremely rare
+   case, which is fixed in this version (1.0.2) and above.
+*/
+
+#include <stdio.h>
+
+int main ()
+{
+   int i;
+   for (i = 0; i < 48500000 ; i++)
+     putchar(251);
+   return 0;
+}
diff --git a/updater/bzip2-1.0.3/randtable.c b/updater/bzip2-1.0.3/randtable.c
new file mode 100644
index 0000000..940462d
--- /dev/null
+++ b/updater/bzip2-1.0.3/randtable.c
@@ -0,0 +1,124 @@
+
+/*-------------------------------------------------------------*/
+/*--- Table for randomising repetitive blocks               ---*/
+/*---                                           randtable.c ---*/
+/*-------------------------------------------------------------*/
+
+/*--
+  This file is a part of bzip2 and/or libbzip2, a program and
+  library for lossless, block-sorting data compression.
+
+  Copyright (C) 1996-2005 Julian R Seward.  All rights reserved.
+
+  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. The origin of this software must not be misrepresented; you must 
+     not claim that you wrote the original software.  If you use this 
+     software in a product, an acknowledgment in the product 
+     documentation would be appreciated but is not required.
+
+  3. Altered source versions must be plainly marked as such, and must
+     not be misrepresented as being the original software.
+
+  4. 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 ``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 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.
+
+  Julian Seward, Cambridge, UK.
+  jseward@bzip.org
+  bzip2/libbzip2 version 1.0 of 21 March 2000
+
+  This program is based on (at least) the work of:
+     Mike Burrows
+     David Wheeler
+     Peter Fenwick
+     Alistair Moffat
+     Radford Neal
+     Ian H. Witten
+     Robert Sedgewick
+     Jon L. Bentley
+
+  For more information on these sources, see the manual.
+--*/
+
+
+#include "bzlib_private.h"
+
+
+/*---------------------------------------------*/
+Int32 BZ2_rNums[512] = { 
+   619, 720, 127, 481, 931, 816, 813, 233, 566, 247, 
+   985, 724, 205, 454, 863, 491, 741, 242, 949, 214, 
+   733, 859, 335, 708, 621, 574, 73, 654, 730, 472, 
+   419, 436, 278, 496, 867, 210, 399, 680, 480, 51, 
+   878, 465, 811, 169, 869, 675, 611, 697, 867, 561, 
+   862, 687, 507, 283, 482, 129, 807, 591, 733, 623, 
+   150, 238, 59, 379, 684, 877, 625, 169, 643, 105, 
+   170, 607, 520, 932, 727, 476, 693, 425, 174, 647, 
+   73, 122, 335, 530, 442, 853, 695, 249, 445, 515, 
+   909, 545, 703, 919, 874, 474, 882, 500, 594, 612, 
+   641, 801, 220, 162, 819, 984, 589, 513, 495, 799, 
+   161, 604, 958, 533, 221, 400, 386, 867, 600, 782, 
+   382, 596, 414, 171, 516, 375, 682, 485, 911, 276, 
+   98, 553, 163, 354, 666, 933, 424, 341, 533, 870, 
+   227, 730, 475, 186, 263, 647, 537, 686, 600, 224, 
+   469, 68, 770, 919, 190, 373, 294, 822, 808, 206, 
+   184, 943, 795, 384, 383, 461, 404, 758, 839, 887, 
+   715, 67, 618, 276, 204, 918, 873, 777, 604, 560, 
+   951, 160, 578, 722, 79, 804, 96, 409, 713, 940, 
+   652, 934, 970, 447, 318, 353, 859, 672, 112, 785, 
+   645, 863, 803, 350, 139, 93, 354, 99, 820, 908, 
+   609, 772, 154, 274, 580, 184, 79, 626, 630, 742, 
+   653, 282, 762, 623, 680, 81, 927, 626, 789, 125, 
+   411, 521, 938, 300, 821, 78, 343, 175, 128, 250, 
+   170, 774, 972, 275, 999, 639, 495, 78, 352, 126, 
+   857, 956, 358, 619, 580, 124, 737, 594, 701, 612, 
+   669, 112, 134, 694, 363, 992, 809, 743, 168, 974, 
+   944, 375, 748, 52, 600, 747, 642, 182, 862, 81, 
+   344, 805, 988, 739, 511, 655, 814, 334, 249, 515, 
+   897, 955, 664, 981, 649, 113, 974, 459, 893, 228, 
+   433, 837, 553, 268, 926, 240, 102, 654, 459, 51, 
+   686, 754, 806, 760, 493, 403, 415, 394, 687, 700, 
+   946, 670, 656, 610, 738, 392, 760, 799, 887, 653, 
+   978, 321, 576, 617, 626, 502, 894, 679, 243, 440, 
+   680, 879, 194, 572, 640, 724, 926, 56, 204, 700, 
+   707, 151, 457, 449, 797, 195, 791, 558, 945, 679, 
+   297, 59, 87, 824, 713, 663, 412, 693, 342, 606, 
+   134, 108, 571, 364, 631, 212, 174, 643, 304, 329, 
+   343, 97, 430, 751, 497, 314, 983, 374, 822, 928, 
+   140, 206, 73, 263, 980, 736, 876, 478, 430, 305, 
+   170, 514, 364, 692, 829, 82, 855, 953, 676, 246, 
+   369, 970, 294, 750, 807, 827, 150, 790, 288, 923, 
+   804, 378, 215, 828, 592, 281, 565, 555, 710, 82, 
+   896, 831, 547, 261, 524, 462, 293, 465, 502, 56, 
+   661, 821, 976, 991, 658, 869, 905, 758, 745, 193, 
+   768, 550, 608, 933, 378, 286, 215, 979, 792, 961, 
+   61, 688, 793, 644, 986, 403, 106, 366, 905, 644, 
+   372, 567, 466, 434, 645, 210, 389, 550, 919, 135, 
+   780, 773, 635, 389, 707, 100, 626, 958, 165, 504, 
+   920, 176, 193, 713, 857, 265, 203, 50, 668, 108, 
+   645, 990, 626, 197, 510, 357, 358, 850, 858, 364, 
+   936, 638
+};
+
+
+/*-------------------------------------------------------------*/
+/*--- end                                       randtable.c ---*/
+/*-------------------------------------------------------------*/
diff --git a/updater/bzip2-1.0.3/sample1.bz2 b/updater/bzip2-1.0.3/sample1.bz2
new file mode 100644
index 0000000..18dea60
--- /dev/null
+++ b/updater/bzip2-1.0.3/sample1.bz2
diff --git a/updater/bzip2-1.0.3/sample1.ref b/updater/bzip2-1.0.3/sample1.ref
new file mode 100644
index 0000000..a56e52b
--- /dev/null
+++ b/updater/bzip2-1.0.3/sample1.ref
diff --git a/updater/bzip2-1.0.3/sample2.bz2 b/updater/bzip2-1.0.3/sample2.bz2
new file mode 100644
index 0000000..d5a6160
--- /dev/null
+++ b/updater/bzip2-1.0.3/sample2.bz2
diff --git a/updater/bzip2-1.0.3/sample2.ref b/updater/bzip2-1.0.3/sample2.ref
new file mode 100644
index 0000000..34af958
--- /dev/null
+++ b/updater/bzip2-1.0.3/sample2.ref
diff --git a/updater/bzip2-1.0.3/sample3.bz2 b/updater/bzip2-1.0.3/sample3.bz2
new file mode 100644
index 0000000..d90cff9
--- /dev/null
+++ b/updater/bzip2-1.0.3/sample3.bz2
diff --git a/updater/bzip2-1.0.3/sample3.ref b/updater/bzip2-1.0.3/sample3.ref
new file mode 100644
index 0000000..775a2f6
--- /dev/null
+++ b/updater/bzip2-1.0.3/sample3.ref
@@ -0,0 +1,30007 @@
+This file is exceedingly boring.  If you find yourself
+reading it, please (1) take it from me that you can safely
+guess what the rest of the file says, and (2) seek professional
+help.
+
+ps.  there are no further sarcastic remarks in this file.
+
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
+ugh
diff --git a/updater/bzip2-1.0.3/spewG.c b/updater/bzip2-1.0.3/spewG.c
new file mode 100644
index 0000000..7934e76
--- /dev/null
+++ b/updater/bzip2-1.0.3/spewG.c
@@ -0,0 +1,39 @@
+
+/* spew out a thoroughly gigantic file designed so that bzip2
+   can compress it reasonably rapidly.  This is to help test
+   support for large files (> 2GB) in a reasonable amount of time.
+   I suggest you use the undocumented --exponential option to
+   bzip2 when compressing the resulting file; this saves a bit of
+   time.  Note: *don't* bother with --exponential when compressing 
+   Real Files; it'll just waste a lot of CPU time :-)
+   (but is otherwise harmless).
+*/
+
+#define _FILE_OFFSET_BITS 64
+
+#include <stdio.h>
+#include <stdlib.h>
+
+/* The number of megabytes of junk to spew out (roughly) */
+#define MEGABYTES 5000
+
+#define N_BUF 1000000
+char buf[N_BUF];
+
+int main ( int argc, char** argv )
+{
+   int ii, kk, p;
+   srandom(1);
+   setbuffer ( stdout, buf, N_BUF );
+   for (kk = 0; kk < MEGABYTES * 515; kk+=3) {
+      p = 25+random()%50;
+      for (ii = 0; ii < p; ii++)
+         printf ( "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa" );
+      for (ii = 0; ii < p-1; ii++)
+         printf ( "bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb" );
+      for (ii = 0; ii < p+1; ii++)
+         printf ( "ccccccccccccccccccccccccccccccccccccc" );
+   }
+   fflush(stdout);
+   return 0;
+}
diff --git a/updater/bzip2-1.0.3/unzcrash.c b/updater/bzip2-1.0.3/unzcrash.c
new file mode 100644
index 0000000..f0f17fc
--- /dev/null
+++ b/updater/bzip2-1.0.3/unzcrash.c
@@ -0,0 +1,126 @@
+
+/* A test program written to test robustness to decompression of
+   corrupted data.  Usage is 
+       unzcrash filename
+   and the program will read the specified file, compress it (in memory),
+   and then repeatedly decompress it, each time with a different bit of
+   the compressed data inverted, so as to test all possible one-bit errors.
+   This should not cause any invalid memory accesses.  If it does, 
+   I want to know about it!
+
+   p.s.  As you can see from the above description, the process is
+   incredibly slow.  A file of size eg 5KB will cause it to run for
+   many hours.
+*/
+
+#include <stdio.h>
+#include <assert.h>
+#include "bzlib.h"
+
+#define M_BLOCK 1000000
+
+typedef unsigned char uchar;
+
+#define M_BLOCK_OUT (M_BLOCK + 1000000)
+uchar inbuf[M_BLOCK];
+uchar outbuf[M_BLOCK_OUT];
+uchar zbuf[M_BLOCK + 600 + (M_BLOCK / 100)];
+
+int nIn, nOut, nZ;
+
+static char *bzerrorstrings[] = {
+       "OK"
+      ,"SEQUENCE_ERROR"
+      ,"PARAM_ERROR"
+      ,"MEM_ERROR"
+      ,"DATA_ERROR"
+      ,"DATA_ERROR_MAGIC"
+      ,"IO_ERROR"
+      ,"UNEXPECTED_EOF"
+      ,"OUTBUFF_FULL"
+      ,"???"   /* for future */
+      ,"???"   /* for future */
+      ,"???"   /* for future */
+      ,"???"   /* for future */
+      ,"???"   /* for future */
+      ,"???"   /* for future */
+};
+
+void flip_bit ( int bit )
+{
+   int byteno = bit / 8;
+   int bitno  = bit % 8;
+   uchar mask = 1 << bitno;
+   //fprintf ( stderr, "(byte %d  bit %d  mask %d)",
+   //          byteno, bitno, (int)mask );
+   zbuf[byteno] ^= mask;
+}
+
+int main ( int argc, char** argv )
+{
+   FILE* f;
+   int   r;
+   int   bit;
+   int   i;
+
+   if (argc != 2) {
+      fprintf ( stderr, "usage: unzcrash filename\n" );
+      return 1;
+   }
+
+   f = fopen ( argv[1], "r" );
+   if (!f) {
+      fprintf ( stderr, "unzcrash: can't open %s\n", argv[1] );
+      return 1;
+   }
+
+   nIn = fread ( inbuf, 1, M_BLOCK, f );
+   fprintf ( stderr, "%d bytes read\n", nIn );
+
+   nZ = M_BLOCK;
+   r = BZ2_bzBuffToBuffCompress (
+         zbuf, &nZ, inbuf, nIn, 9, 0, 30 );
+
+   assert (r == BZ_OK);
+   fprintf ( stderr, "%d after compression\n", nZ );
+
+   for (bit = 0; bit < nZ*8; bit++) {
+      fprintf ( stderr, "bit %d  ", bit );
+      flip_bit ( bit );
+      nOut = M_BLOCK_OUT;
+      r = BZ2_bzBuffToBuffDecompress (
+            outbuf, &nOut, zbuf, nZ, 0, 0 );
+      fprintf ( stderr, " %d  %s ", r, bzerrorstrings[-r] );
+
+      if (r != BZ_OK) {
+         fprintf ( stderr, "\n" );
+      } else {
+         if (nOut != nIn) {
+           fprintf(stderr, "nIn/nOut mismatch %d %d\n", nIn, nOut );
+           return 1;
+         } else {
+           for (i = 0; i < nOut; i++)
+             if (inbuf[i] != outbuf[i]) { 
+                fprintf(stderr, "mismatch at %d\n", i ); 
+                return 1; 
+           }
+           if (i == nOut) fprintf(stderr, "really ok!\n" );
+         }
+      }
+
+      flip_bit ( bit );
+   }
+
+#if 0
+   assert (nOut == nIn);
+   for (i = 0; i < nOut; i++) {
+     if (inbuf[i] != outbuf[i]) {
+        fprintf ( stderr, "difference at %d !\n", i );
+        return 1;
+     }
+   }
+#endif
+
+   fprintf ( stderr, "all ok\n" );
+   return 0;
+}
diff --git a/updater/bzip2-1.0.3/words0 b/updater/bzip2-1.0.3/words0
new file mode 100644
index 0000000..164a8ed
--- /dev/null
+++ b/updater/bzip2-1.0.3/words0
@@ -0,0 +1,5 @@
+
+If compilation produces errors, or a large number of warnings, 
+please read README.COMPILATION.PROBLEMS -- you might be able to
+adjust the flags in this Makefile to improve matters.
+
diff --git a/updater/bzip2-1.0.3/words1 b/updater/bzip2-1.0.3/words1
new file mode 100644
index 0000000..2e83de9
--- /dev/null
+++ b/updater/bzip2-1.0.3/words1
@@ -0,0 +1,4 @@
+
+Doing 6 tests (3 compress, 3 uncompress) ...
+If there's a problem, things might stop at this point.
+ 
diff --git a/updater/bzip2-1.0.3/words2 b/updater/bzip2-1.0.3/words2
new file mode 100644
index 0000000..203ee39
--- /dev/null
+++ b/updater/bzip2-1.0.3/words2
@@ -0,0 +1,5 @@
+
+Checking test results.  If any of the four "cmp"s which follow
+report any differences, something is wrong.  If you can't easily
+figure out what, please let me know (jseward@acm.org).
+
diff --git a/updater/bzip2-1.0.3/words3 b/updater/bzip2-1.0.3/words3
new file mode 100644
index 0000000..7a6b462
--- /dev/null
+++ b/updater/bzip2-1.0.3/words3
@@ -0,0 +1,23 @@
+
+If you got this far and the "cmp"s didn't complain, it looks
+like you're in business.  
+
+To install in /usr/bin, /usr/lib, /usr/man and /usr/include, type
+   make install
+To install somewhere else, eg, /xxx/yyy/{bin,lib,man,include}, type 
+   make install PREFIX=/xxx/yyy
+If you are (justifiably) paranoid and want to see what 'make install'
+is going to do, you can first do
+   make -n install                      or
+   make -n install PREFIX=/xxx/yyy      respectively.
+The -n instructs make to show the commands it would execute, but
+not actually execute them.
+
+Instructions for use are in the preformatted manual page, in the file
+bzip2.txt.  For more detailed documentation, read the full manual.  
+It is available in Postscript form (manual.ps), PDF form (manual.pdf),
+and HTML form (manual_toc.html).
+
+You can also do "bzip2 --help" to see some helpful information. 
+"bzip2 -L" displays the software license.
+
diff --git a/updater/bzip2-1.0.3/xmlproc.sh b/updater/bzip2-1.0.3/xmlproc.sh
new file mode 100644
index 0000000..6fe4d57
--- /dev/null
+++ b/updater/bzip2-1.0.3/xmlproc.sh
@@ -0,0 +1,99 @@
+#!/bin/bash
+# see the README in this directory for usage etc.
+
+usage() {
+  echo '';
+  echo 'Usage: xmlproc.sh -[option] <filename.xml>';
+  echo 'Specify a target from:';
+  echo '-v      verify xml file conforms to dtd';
+  echo '-html   output in html format (single file)';
+  echo '-ps     output in postscript format';
+  echo '-pdf    output in pdf format';
+  exit;
+}
+
+if test $# -ne 2; then
+  usage
+fi
+# assign the variable for the output type
+action=$1; shift
+# assign the output filename
+xmlfile=$1; shift
+# and check user input it correct
+if !(test -f $xmlfile); then
+  echo "No such file: $xmlfile";
+  exit;
+fi
+# some other stuff we will use
+OUT=output
+xsl_fo=bz-fo.xsl
+xsl_html=bz-html.xsl
+
+basename=$xmlfile
+basename=${basename//'.xml'/''}
+
+fofile="${basename}.fo"
+htmlfile="${basename}.html"
+pdffile="${basename}.pdf"
+psfile="${basename}.ps"
+xmlfmtfile="${basename}.fmt"
+
+# first process the xmlfile with CDATA tags
+./format.pl $xmlfile $xmlfmtfile
+# so the shell knows where the catalogs live
+export XML_CATALOG_FILES=/etc/xml/catalog
+
+# post-processing tidy up
+cleanup() {
+  echo "Cleaning up: # $@" 
+  while [ $# != 0 ]
+  do
+    arg=$1; shift;
+    echo "  deleting $arg";
+    rm $arg
+  done
+}
+
+case $action in
+  -v)
+   flags='--noout --xinclude --noblanks --postvalid'
+   dtd='--dtdvalid http://www.oasis-open.org/docbook/xml/4.2/docbookx.dtd'
+   xmllint $flags $dtd $xmlfmtfile 2> $OUT 
+   egrep 'error' $OUT 
+   rm $OUT
+  ;;
+
+  -html)
+   echo "Creating $htmlfile ..."
+   xsltproc --nonet --xinclude  -o $htmlfile $xsl_html $xmlfmtfile
+   cleanup $xmlfmtfile
+  ;;
+
+  -pdf)
+   echo "Creating $pdffile ..."
+   xsltproc --nonet --xinclude -o $fofile $xsl_fo $xmlfmtfile
+   pdfxmltex $fofile >$OUT </dev/null
+   pdfxmltex $fofile >$OUT </dev/null
+   pdfxmltex $fofile >$OUT </dev/null
+   cleanup $OUT $xmlfmtfile *.aux *.fo *.log *.out
+  ;;
+
+  -ps)
+   echo "Creating $psfile ..."
+   xsltproc --nonet --xinclude -o $fofile $xsl_fo $xmlfmtfile
+   pdfxmltex $fofile >$OUT </dev/null
+   pdfxmltex $fofile >$OUT </dev/null
+   pdfxmltex $fofile >$OUT </dev/null
+   pdftops $pdffile $psfile
+   cleanup $OUT $xmlfmtfile $pdffile *.aux *.fo *.log *.out
+#  passivetex is broken, so we can't go this route yet.
+#   xmltex $fofile >$OUT </dev/null
+#   xmltex $fofile >$OUT </dev/null
+#   xmltex $fofile >$OUT </dev/null
+#   dvips -R -q -o bzip-manual.ps *.dvi
+  ;;
+
+  *)
+  usage
+  ;;
+esac
diff --git a/updater/common.cpp b/updater/common.cpp
new file mode 100644
index 0000000..f7b240b
--- /dev/null
+++ b/updater/common.cpp
@@ -0,0 +1,72 @@
+#include "common.h"
+
+UpdateList::UpdateList(): count(0), head(0), tail(0) {
+}
+
+UpdateList::~UpdateList() {
+	clear();
+}
+
+UpdateList::UpdateList(UpdateList &source): count(0), head(0), tail(0) {
+	for(source.reset(); source.current(); source.next()) 
+		push_back(*source.current());
+}
+
+void UpdateList::clear() {
+	Node *current;
+	while(head) {
+		current = head;
+		head = head->next;
+		delete current;
+	}
+
+	count = 0;
+	head = tail = 0;
+	reset();
+}
+
+int UpdateList::size() {
+	return count;
+}
+
+void UpdateList::reset() {
+	it_current = head;
+}
+
+void UpdateList::erase() {
+	if(it_current) {
+		if(head == it_current) head = head->next;
+		if(tail == it_current) tail = tail->prev;
+
+		if(it_current->next) it_current->next->prev = it_current->prev;
+		if(it_current->prev) it_current->prev->next = it_current->next;
+
+		delete it_current;
+		count--;
+		reset();
+	}
+}
+
+void UpdateList::next() {
+	if(it_current) it_current = (Node *)it_current->next;
+}
+
+UpdateInternal *UpdateList::current() {
+	return (it_current ? &it_current->ui : 0);
+}
+
+void UpdateList::push_back(UpdateInternal &update) {
+	if(tail) {
+		tail->next = new Node;
+		tail->next->prev = tail;
+		tail = tail->next;
+	} else {
+		head = tail = new Node;
+	}
+	tail->ui = update;
+	count++;
+}
+
+UpdateInternal &UpdateList::back() {
+	return tail->ui;
+}
diff --git a/updater/common.h b/updater/common.h
new file mode 100644
index 0000000..460bdc8
--- /dev/null
+++ b/updater/common.h
@@ -0,0 +1,185 @@
+#ifndef _COMMON_INC
+#define _COMMON_INC
+
+#define _CRT_SECURE_NO_DEPRECATE
+
+#define _WIN32_WINNT	0x0400
+#define WINVER			0x0400
+#define _WIN32_IE		0x0400
+
+#ifdef _UNICODE
+//#define _GLIBCXX_USE_WCHAR_T	1
+//#define _GLIBCXX_USE_WSTRING	1
+#endif
+
+// uses mim 0.6 options pages if available
+#define MIRANDA_VER 0x0600
+
+#include <windows.h>
+#include <commctrl.h>
+
+#include "tinyxml.h"
+#ifdef _MSC_VER
+#pragma warning( disable : 4786 )
+#endif
+
+#include <process.h>
+#include <shlobj.h>
+#include <stdio.h>
+
+#include <newpluginapi.h>
+#include <m_database.h>
+#include <m_langpack.h>
+#include <m_options.h>
+#include <m_system.h>
+#include <m_idle.h>
+#include <m_clui.h>
+#include <m_netlib.h>
+#include <m_utils.h>
+#include <m_clist.h>
+//#include "../mwclist/m_clist.h"
+#include <m_genmenu.h>
+#include <m_updater.h>
+
+#include <m_trigger.h>
+#include "IcoLib.h"
+
+#include <m_folders.h>
+
+//#define TESTING		// causes version to be 0.0.0.1
+//#define USE_MY_SERVER	// uses URLS for scottellis.com.au test site for non-beta
+//#define PLUGDIR		// expect the zip archive to contain plugins/updater.dll rather than just updater.dll
+#define REGISTER_BETA	// register beta urls for beta site
+//#define DEBUG_POPUPS	// define to show some popups (restoring status, etc)
+//#define _UD_LOGGING		// define to log some stuff, from inside the external process, overwriting the data file
+//#define DEBUG_HTTP_POPUPS	// define to show popups re http
+#define REGISTER_AUTO	// get updater to automatically collect file listing URL's from backend xml data
+
+#define BETA_HOST_URL_PREFIX	"http://www.scottellis.com.au/miranda_plugins" //(thanks Omniwolf for old twosx webspace, thx Koobs for hosting my domain)
+
+typedef enum Category {MC_PLUGINS, MC_LOCALIZATION, MC_UNKNOWN, NUM_CATEGORIES};
+
+typedef struct UpdateOptions_tag {
+	bool enabled;			// user has enabled updates for this plugin
+	bool use_beta;			// use the beta update data
+	bool fixed;				// use_beta flag is fixed - cannot be changed by user (e.g. szUpdateURL is null, szBetaUpdateURL is not)
+} UpdateOptions;
+
+typedef struct UpdateInternal_tag {
+	Update update;
+	UpdateOptions update_options;
+	int file_id;			// miranda file listing id
+	bool auto_register;
+	char *newVersion;
+
+	Category cat;
+
+	char *shortName;
+} UpdateInternal;
+
+class UpdateList {
+public:
+	UpdateList();
+	virtual ~UpdateList();
+	UpdateList(UpdateList &source);
+
+	int size();
+
+	void push_back(UpdateInternal &update);
+
+	UpdateInternal &back();
+
+	void clear();
+	void reset();
+	void next();
+	UpdateInternal *current();
+	void erase();
+
+protected:
+	class Node {
+	public:
+		Node(): next(0), prev(0) {}
+		UpdateInternal ui;
+		Node *next, *prev;
+	};
+
+	int count;
+	Node *head, *tail, *it_current;
+};
+
+class StringList {
+public:
+	StringList(): head(0), count(0) {}
+	virtual ~StringList() {clear();}
+
+	int size() {return count;}
+
+	void push_back(TCHAR *str) { Node *n = new Node; n->next = head; head = n; n->val = _tcsdup(str); }
+
+	void clear() {
+		Node *current;
+		while(head) {
+			current = head;
+			head = head->next;
+			free(current->val);
+			delete current;
+		}
+		count = 0;
+		reset();
+	}
+	void reset() {it_current = head;}
+	void next() {if(it_current) it_current = it_current->next;}
+	TCHAR *current() {return (it_current ? it_current->val : 0);}
+
+protected:
+	class Node {
+	public:
+		Node(): next(0) {}
+		TCHAR *val;
+		Node *next;
+	};
+
+	Node *head, *it_current;
+	int count;
+};
+
+#include <map>
+#include <list>
+#include <string>
+
+#ifdef _UNICODE
+typedef std::wstring STDString;
+#else
+typedef std::string STDString;
+#endif
+
+typedef std::list< STDString > STDStringList;
+typedef std::map<int, STDStringList > FilenameMap;
+
+#include "resource.h"
+
+#define MODULE			"Updater"
+
+extern HINSTANCE hInst;
+extern PLUGINLINK *pluginLink;
+extern PLUGININFO pluginInfo;
+
+extern bool is_idle;
+
+extern HANDLE hNetlibUser;
+
+extern HANDLE mainThread;
+extern DWORD mainThreadId;
+
+static int __inline NLog(char *msg) {
+	return CallService(MS_NETLIB_LOG, (WPARAM)hNetlibUser, (LPARAM)msg);
+}
+
+// clist 'exit' menu item command id
+#define ID_ICQ_EXIT		40001
+
+// maximum number of redirects when getting xml data or download files via HTTP
+#define MAX_REDIRECT_RECURSE		4
+
+#endif
+
diff --git a/updater/conf_comp_dialog.cpp b/updater/conf_comp_dialog.cpp
new file mode 100644
index 0000000..e6c3445
--- /dev/null
+++ b/updater/conf_comp_dialog.cpp
@@ -0,0 +1,205 @@
+#include "common.h"
+#include "conf_comp_dialog.h"
+
+void FillFolder(TCHAR *folder_name, StringList *filenames) {
+	TCHAR mask[MAX_PATH], filename[MAX_PATH], *p;
+
+	_tcscpy(mask, folder_name);
+	_tcscat(mask, _T("\\*.*"));
+
+	_tcscpy(filename, folder_name);
+	_tcscat(filename, _T("\\"));
+	p = (filename + _tcslen(filename));
+
+	WIN32_FIND_DATA findData;
+	HANDLE hFileSearch = FindFirstFile(mask, &findData);
+	if(hFileSearch != INVALID_HANDLE_VALUE) {
+		do {
+			if(p)
+				_tcscpy(p, findData.cFileName);
+
+			if(findData.cFileName[0] != '.') {
+				if(findData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {
+					FillFolder(filename, filenames);
+				} else {
+					filenames->push_back(filename);
+				}
+			}
+		} while(FindNextFile(hFileSearch, &findData));
+		FindClose(hFileSearch);
+	}
+}
+
+BOOL CALLBACK DlgProcConfirmComponents(HWND hwndDlg, UINT msg, WPARAM wParam, LPARAM lParam) {
+	switch ( msg ) {
+	case WM_INITDIALOG:
+		TranslateDialogDefault( hwndDlg );
+		SetWindowLong(hwndDlg, GWL_USERDATA, 0);
+		SendMessage(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS),LVM_SETEXTENDEDLISTVIEWSTYLE, 0,LVS_EX_FULLROWSELECT | LVS_EX_CHECKBOXES);
+
+		{
+			LVCOLUMN lvc; 
+			// Initialize the LVCOLUMN structure.
+			// The mask specifies that the format, width, text, and
+			// subitem members of the structure are valid. 
+			lvc.mask = LVCF_FMT | LVCF_WIDTH | LVCF_TEXT | LVCF_SUBITEM; 
+			lvc.fmt = LVCFMT_LEFT;
+	  
+			lvc.iSubItem = 0;
+			lvc.pszText = TranslateT("Component Name");	
+			lvc.cx = 180;     // width of column in pixels
+			ListView_InsertColumn(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), 0, &lvc);
+
+		}
+
+		//enumerate plugins, fill in list
+		{
+			StringList filenames;
+	
+			ListView_DeleteAllItems(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS));
+
+			LVITEM lvI;
+
+			// Some code to create the list-view control.
+			// Initialize LVITEM members that are common to all
+			// items. 
+			lvI.mask = LVIF_TEXT | LVIF_NORECOMPUTE;// | LVIF_IMAGE; 
+
+
+			unsigned int temp_folder_name_len = _tcslen(options.temp_folder);
+			TCHAR *p;
+
+			FillFolder(options.temp_folder, &filenames);
+			for(filenames.reset(); filenames.current(); filenames.next()) {
+				if(_tcslen(filenames.current()) > temp_folder_name_len) {
+					p = filenames.current() + temp_folder_name_len + 1;
+
+					lvI.iSubItem = 0;
+					lvI.pszText = p;
+					lvI.iItem = ListView_InsertItem(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), &lvI);
+
+					ListView_SetCheckState(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), lvI.iItem, TRUE);
+				}
+			}
+
+			// do this after filling list - enables 'ITEMCHANGED' below
+			SetWindowLong(hwndDlg, GWL_USERDATA, 1L);
+		}
+
+		Utils_RestoreWindowPositionNoSize(hwndDlg,0,MODULE,"ConfirmCompWindow");
+
+		return TRUE;
+
+	case WM_NOTIFY:
+		if(((LPNMHDR) lParam)->hwndFrom == GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS)) {
+			switch (((LPNMHDR) lParam)->code) {
+				
+			case LVN_ITEMCHANGED:
+				if(GetWindowLong(hwndDlg, GWL_USERDATA)) {
+					NMLISTVIEW *nmlv = (NMLISTVIEW *)lParam;
+
+					if((nmlv->uNewState ^ nmlv->uOldState) & LVIS_STATEIMAGEMASK) {
+
+						int size = ListView_GetItemCount(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS));
+						bool enableOk = false;
+						for(int i = 0; i < size; i++) {
+							if(ListView_GetCheckState(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), i)) {
+								enableOk = true;
+								break;
+							}
+						}
+						HWND hwOk = GetDlgItem(hwndDlg, IDOK);
+						EnableWindow(hwOk, enableOk ? TRUE : FALSE);
+					}
+				}
+				break;
+			}				
+		}
+		break;
+	case WM_COMMAND:
+		if ( HIWORD( wParam ) == BN_CLICKED ) {
+			switch( LOWORD( wParam )) {
+			case IDC_BTN_SELECTALL:
+				{
+					int size = ListView_GetItemCount(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS));
+					bool enableOk = false;
+					for(int i = 0; i < size; i++) {
+						ListView_SetCheckState(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), i, TRUE);
+						enableOk = true;
+					}
+					HWND hwOk = GetDlgItem(hwndDlg, IDOK);
+					EnableWindow(hwOk, enableOk ? TRUE : FALSE);
+				}
+				return TRUE;
+			case IDC_BTN_SELECTINV:
+				{
+					int size = ListView_GetItemCount(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS));
+					bool enableOk = false, flag;
+					for(int i = 0; i < size; i++) {
+						flag = !ListView_GetCheckState(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), i);
+						ListView_SetCheckState(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), i, flag);
+						enableOk |= flag;
+					}
+					HWND hwOk = GetDlgItem(hwndDlg, IDOK);
+					EnableWindow(hwOk, enableOk ? TRUE : FALSE);
+				}
+				return TRUE;
+			case IDC_BTN_SELECTDLLS:
+				{
+					int size = ListView_GetItemCount(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS));
+					TCHAR fname_buff[MAX_PATH];
+					bool enableOk = false, flag;
+					for(int i = 0; i < size; i++) {
+						ListView_GetItemText(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), i, 0, fname_buff, MAX_PATH);
+						flag = _tcsstr(fname_buff, _T(".dll")) != 0;
+						ListView_SetCheckState(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), i, flag);
+						enableOk |= flag;
+					}
+					HWND hwOk = GetDlgItem(hwndDlg, IDOK);
+					EnableWindow(hwOk, enableOk ? TRUE : FALSE);
+				}
+				return TRUE;
+			case IDOK:
+				SetWindowLong(hwndDlg, GWL_USERDATA, 0);
+				Utils_SaveWindowPosition(hwndDlg,0,MODULE,"ConfirmCompWindow");
+
+				{
+					TCHAR fname_buff[MAX_PATH];
+					_tcscpy(fname_buff, options.temp_folder);
+					_tcscat(fname_buff, _T("\\"));
+					int path_len = _tcslen(fname_buff);
+					TCHAR *p = fname_buff + path_len;
+
+					int size = ListView_GetItemCount(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS));
+					//bool enableOk = false;
+					for(int i = 0; i < size; i++) {
+						if(!ListView_GetCheckState(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), i)) {
+							// delete file
+							ListView_GetItemText(GetDlgItem(hwndDlg, IDC_LIST_COMPONENTS), i, 0, p, MAX_PATH - path_len);
+							DeleteFile(fname_buff);
+
+							// attempt to remove parent folder, if any, in case it's now empty
+							TCHAR *last_slash = _tcsrchr(fname_buff, _T('\\'));
+							if(last_slash != p - 1) {
+								*last_slash = 0;
+								RemoveDirectory(fname_buff);
+							}
+						}
+					}
+				}
+
+				EndDialog(hwndDlg, IDOK);
+				return TRUE;
+			case IDCANCEL:
+				SetWindowLong(hwndDlg, GWL_USERDATA, 0);
+				Utils_SaveWindowPosition(hwndDlg,0,MODULE,"ConfirmCompWindow");
+				EndDialog(hwndDlg, IDCANCEL);
+				return TRUE;
+			}
+		}
+		break;
+	}
+
+	return FALSE;
+
+}
diff --git a/updater/conf_comp_dialog.h b/updater/conf_comp_dialog.h
new file mode 100644
index 0000000..fb4a272
--- /dev/null
+++ b/updater/conf_comp_dialog.h
@@ -0,0 +1,8 @@
+#ifndef _CONF_COMP_DIALOG_INC
+#define _CONF_COMP_DIALOG_INC
+
+#include "options.h"
+
+BOOL CALLBACK DlgProcConfirmComponents(HWND hwndDlg, UINT msg, WPARAM wParam, LPARAM lParam);
+
+#endif
diff --git a/updater/conf_dialog.cpp b/updater/conf_dialog.cpp
new file mode 100644
index 0000000..b12d8b0
--- /dev/null
+++ b/updater/conf_dialog.cpp
@@ -0,0 +1,250 @@
+#include "common.h"
+#include "conf_dialog.h"
+
+BOOL CALLBACK DlgProcConfirm(HWND hwndDlg, UINT msg, WPARAM wParam, LPARAM lParam) {
+
+	switch ( msg ) {
+	case WM_INITDIALOG:
+		TranslateDialogDefault( hwndDlg );
+		SetWindowLong(hwndDlg, GWL_USERDATA, 0);
+		SendMessage(GetDlgItem(hwndDlg, IDC_LIST_UPDATES),LVM_SETEXTENDEDLISTVIEWSTYLE, 0,LVS_EX_FULLROWSELECT | LVS_EX_CHECKBOXES);
+
+		if(DBGetContactSettingByte(0, "Updater", "DefaultConfAll", 0)) {
+			CheckDlgButton(hwndDlg, IDC_CHK_CONFALL, TRUE);
+			HWND hw = GetDlgItem(hwndDlg, IDC_CHK_NOINSTALL);
+			EnableWindow(hw, FALSE);
+		} else if(DBGetContactSettingByte(0, "Updater", "NoInstall", 0)) {
+			CheckDlgButton(hwndDlg, IDC_CHK_NOINSTALL, TRUE);
+			SetWindowText(GetDlgItem(hwndDlg, IDOK), TranslateT("Download"));
+		}
+
+		{
+			LVCOLUMN lvc = {0}; 
+			// Initialize the LVCOLUMN structure.
+			// The mask specifies that the format, width, text, and
+			// subitem members of the structure are valid. 
+			lvc.mask = LVCF_FMT | LVCF_WIDTH | LVCF_TEXT | LVCF_SUBITEM; 
+			lvc.fmt = LVCFMT_LEFT;
+	  
+			lvc.iSubItem = 0;
+			lvc.pszText = TranslateT("Component Name");	
+			lvc.cx = 145;     // width of column in pixels
+			ListView_InsertColumn(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), 0, &lvc);
+
+			lvc.iSubItem = 1;
+			lvc.pszText = TranslateT("New Version");	
+			lvc.cx = 80;     // width of column in pixels
+			ListView_InsertColumn(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), 1, &lvc);
+
+			lvc.iSubItem = 2;
+			lvc.pszText = TranslateT("Current Version");	
+			lvc.cx = 90;     // width of column in pixels
+			ListView_InsertColumn(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), 2, &lvc);
+		}
+
+		//enumerate plugins, fill in list
+		{
+			bool one_enabled = false;
+			ListView_DeleteAllItems(GetDlgItem(hwndDlg, IDC_LIST_UPDATES));
+
+			LVITEM lvI = {0};
+			TCHAR *temp_str;
+
+			// Some code to create the list-view control.
+			// Initialize LVITEM members that are common to all
+			// items. 
+			lvI.mask = LVIF_TEXT | LVIF_PARAM | LVIF_NORECOMPUTE;// | LVIF_IMAGE; 
+
+			UpdateList *todo = (UpdateList *)lParam;
+			for(todo->reset(); todo->current(); todo->next()) {
+				lvI.mask = LVIF_TEXT | LVIF_PARAM;// | LVIF_IMAGE; 
+				lvI.iSubItem = 0;
+				lvI.lParam = (LPARAM)todo->current();
+				lvI.pszText = TranslateTS(temp_str = GetTString(todo->current()->update.szComponentName));
+				lvI.iItem = ListView_InsertItem(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), &lvI);
+				free(temp_str);
+
+				lvI.mask = LVIF_TEXT;// | LVIF_IMAGE; 
+
+				lvI.iSubItem = 1;
+				//lvI.pszText = LPSTR_TEXTCALLBACK; //i->newVersion;
+				lvI.pszText = TranslateTS(temp_str = GetTString(((UpdateInternal *)lvI.lParam)->newVersion));
+				ListView_SetItem(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), &lvI);
+				free(temp_str);
+
+				lvI.iSubItem = 2;
+				//lvI.pszText = LPSTR_TEXTCALLBACK; //i->newVersion;
+				lvI.pszText = TranslateTS(temp_str = GetTString((char *)((UpdateInternal *)lvI.lParam)->update.pbVersion));
+				ListView_SetItem(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), &lvI);
+				free(temp_str);
+				//MessageBox(0, i->newVersion, 
+					//"Version", MB_OK);
+					//i->update.szComponentName, MB_OK);
+
+				// remember whether the user has decided not to update this component with this particular new version
+				char stored_setting[256];
+				mir_snprintf(stored_setting, 256, "DisabledVer%s", todo->current()->update.szComponentName);
+				DBVARIANT dbv;
+				bool check = todo->current()->update_options.enabled;
+				if(!DBGetContactSetting(0, "Updater", stored_setting, &dbv)) {
+					if(dbv.pszVal && strcmp(dbv.pszVal, ((UpdateInternal *)lvI.lParam)->newVersion) == 0)
+						check = false;
+					else
+						DBDeleteContactSetting(0, "Updater", stored_setting);
+					DBFreeVariant(&dbv);
+				}
+				one_enabled |= check;
+				ListView_SetCheckState(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), lvI.iItem, check);
+			}
+
+			HWND hwOk = GetDlgItem(hwndDlg, IDOK);
+			EnableWindow(hwOk, one_enabled ? TRUE : FALSE);
+		}
+		// do this after filling list - enables 'ITEMCHANGED' below
+		SetWindowLong(hwndDlg, GWL_USERDATA, lParam);
+
+		Utils_RestoreWindowPositionNoSize(hwndDlg,0,MODULE,"ConfirmWindow");
+
+		return TRUE;
+
+	case WM_NOTIFY:
+		if(((LPNMHDR) lParam)->hwndFrom == GetDlgItem(hwndDlg, IDC_LIST_UPDATES)) {
+			switch (((LPNMHDR) lParam)->code) {
+				
+			case LVN_ITEMCHANGED:
+				if(GetWindowLong(hwndDlg, GWL_USERDATA)) {
+					NMLISTVIEW *nmlv = (NMLISTVIEW *)lParam;
+
+					LVITEM lvI = {0};
+					
+					lvI.iItem = nmlv->iItem;
+					lvI.iSubItem = 0;
+					lvI.mask = LVIF_PARAM;
+					ListView_GetItem(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), &lvI);
+
+					//if(IsWindowVisible(GetDlgItem(hwndDlg, IDC_LIST_UPDATES)) && ((nmlv->uNewState ^ nmlv->uOldState) & LVIS_STATEIMAGEMASK)) {
+					if((nmlv->uNewState ^ nmlv->uOldState) & LVIS_STATEIMAGEMASK) {
+						((UpdateInternal *)lvI.lParam)->update_options.enabled = ListView_GetCheckState(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), nmlv->iItem) ? true : false;
+
+						char stored_setting[256];
+						mir_snprintf(stored_setting, 256, "DisabledVer%s", ((UpdateInternal *)lvI.lParam)->update.szComponentName);
+
+						if(((UpdateInternal *)lvI.lParam)->update_options.enabled)
+							DBDeleteContactSetting(0, "Updater", stored_setting); // user has re-enabled update to this version - remove setting from db
+						else
+							DBWriteContactSettingString(0, "Updater", stored_setting, ((UpdateInternal *)lvI.lParam)->newVersion);
+						//ListView_SetItem(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), &lvI);
+						
+
+						UpdateList *todo = (UpdateList *)GetWindowLong(hwndDlg, GWL_USERDATA);
+						bool enableOk = false;
+						for(todo->reset(); todo->current(); todo->next()) {
+							if(todo->current()->update_options.enabled) {
+								enableOk = true;
+								break;
+							}
+						}
+						HWND hwOk = GetDlgItem(hwndDlg, IDOK);
+						EnableWindow(hwOk, enableOk ? TRUE : FALSE);
+					}
+					if(nmlv->uNewState & LVIS_SELECTED) {
+						if((!((UpdateInternal *)lvI.lParam)->update_options.use_beta && ((UpdateInternal *)lvI.lParam)->file_id != -1) 
+							|| (((UpdateInternal *)lvI.lParam)->update_options.use_beta && ((UpdateInternal *)lvI.lParam)->update.szBetaChangelogURL)) 
+						{
+							EnableWindow(GetDlgItem(hwndDlg, IDC_BTN_CHANGELOG), TRUE);
+						} else {
+							EnableWindow(GetDlgItem(hwndDlg, IDC_BTN_CHANGELOG), FALSE);
+						}
+					}
+				}
+				break;
+				
+			case LVN_GETDISPINFO:
+				{
+					LVITEM lvi;
+					lvi.mask = LVIF_PARAM;
+					lvi.iItem = ((NMLVDISPINFO *)lParam)->item.iItem;
+					lvi.iSubItem = 0;
+					SendMessage(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), LVM_GETITEM, 0, (LPARAM)&lvi);
+					switch (((NMLVDISPINFO *)lParam)->item.iSubItem) {
+					case 0:
+						MessageBox(0, _T("LVN_GETDISPINFO (0)"), _T("msg"), MB_OK);
+						break;
+					case 1:
+						((NMLVDISPINFO *)lParam)->item.pszText = TranslateTS(((UpdateInternal *)lvi.lParam)->newVersion);
+						break;
+					case 2:
+						((NMLVDISPINFO *)lParam)->item.pszText = TranslateTS((char *)((UpdateInternal *)lvi.lParam)->update.pbVersion);
+						break;
+					}
+				}
+				return 0;
+			}
+
+		}
+		break;
+	case WM_COMMAND:
+		if ( HIWORD( wParam ) == BN_CLICKED ) {
+			switch( LOWORD( wParam )) {
+			case IDC_BTN_CHANGELOG:
+				{
+					char url[256];
+					int sel = ListView_GetSelectionMark(GetDlgItem(hwndDlg, IDC_LIST_UPDATES));
+					LVITEM lvI = {0};
+					
+					lvI.iItem = sel;
+					lvI.iSubItem = 0;
+					lvI.mask = LVIF_PARAM;
+					ListView_GetItem(GetDlgItem(hwndDlg, IDC_LIST_UPDATES), &lvI);
+
+					if(!((UpdateInternal *)lvI.lParam)->update_options.use_beta && ((UpdateInternal *)lvI.lParam)->file_id != -1) {
+						sprintf(url, MIM_CHANGELOG_URL_PREFIX "%d", ((UpdateInternal *)lvI.lParam)->file_id);
+						CallService(MS_UTILS_OPENURL, (WPARAM)TRUE, (LPARAM)url);
+					} else if(((UpdateInternal *)lvI.lParam)->update_options.use_beta && ((UpdateInternal *)lvI.lParam)->update.szBetaChangelogURL) {
+						CallService(MS_UTILS_OPENURL, (WPARAM)TRUE, (LPARAM)((UpdateInternal *)lvI.lParam)->update.szBetaChangelogURL);
+					}
+
+				}
+				return TRUE;
+			case IDC_CHK_CONFALL:
+				{
+					HWND hw = GetDlgItem(hwndDlg, IDC_CHK_NOINSTALL);
+					EnableWindow(hw, !IsDlgButtonChecked(hwndDlg, IDC_CHK_CONFALL));
+				}
+				return TRUE;
+			case IDC_CHK_NOINSTALL:
+				{
+					HWND hw = GetDlgItem(hwndDlg, IDC_CHK_CONFALL);
+					EnableWindow(hw, !IsDlgButtonChecked(hwndDlg, IDC_CHK_NOINSTALL));
+
+					if(IsDlgButtonChecked(hwndDlg, IDC_CHK_NOINSTALL))
+						SetWindowText(GetDlgItem(hwndDlg, IDOK), TranslateT("Download"));
+					else
+						SetWindowText(GetDlgItem(hwndDlg, IDOK), TranslateT("Update"));
+				}
+				return TRUE;
+			case IDOK:
+				SetWindowLong(hwndDlg, GWL_USERDATA, 0);
+				Utils_SaveWindowPosition(hwndDlg,0,MODULE,"ConfirmWindow");
+				DBWriteContactSettingByte(0, "Updater", "DefaultConfAll", IsDlgButtonChecked(hwndDlg, IDC_CHK_CONFALL) ? 1 : 0);
+				DBWriteContactSettingByte(0, "Updater", "NoInstall", IsDlgButtonChecked(hwndDlg, IDC_CHK_NOINSTALL) ? 1 : 0);
+				if(IsDlgButtonChecked(hwndDlg, IDC_CHK_CONFALL))
+					EndDialog(hwndDlg, CD_CONFALL);
+				else if(IsDlgButtonChecked(hwndDlg, IDC_CHK_NOINSTALL))
+					EndDialog(hwndDlg, CD_NOINSTALL);
+				else
+					EndDialog(hwndDlg, CD_OK);
+				return TRUE;
+			case IDCANCEL:
+				SetWindowLong(hwndDlg, GWL_USERDATA, 0);
+				Utils_SaveWindowPosition(hwndDlg,0,MODULE,"ConfirmWindow");
+				EndDialog(hwndDlg, CD_CANCEL);
+				return TRUE;
+			}
+		}
+		break;
+	}
+
+	return FALSE;
+}
+
diff --git a/updater/conf_dialog.h b/updater/conf_dialog.h
new file mode 100644
index 0000000..d4ebdf9
--- /dev/null
+++ b/updater/conf_dialog.h
@@ -0,0 +1,14 @@
+#ifndef _CONF_DIALOG_INC
+#define _CONF_DIALOG_INC
+
+#include "utils.h"
+
+// return values
+#define CD_CANCEL			1
+#define CD_NOINSTALL		2
+#define CD_CONFALL			3
+#define CD_OK				4
+
+BOOL CALLBACK DlgProcConfirm(HWND hwndDlg, UINT msg, WPARAM wParam, LPARAM lParam);
+
+#endif
diff --git a/updater/extern.cpp b/updater/extern.cpp
new file mode 100644
index 0000000..2d220df
--- /dev/null
+++ b/updater/extern.cpp
@@ -0,0 +1,440 @@
+#include "common.h"
+#include "extern.h"
+
+// write data needed by the external process, and restart miranda
+// returns 1 if any error, 0 if shutdown is imminent
+int ExternProcess(bool restart) {
+	//HWND hWndMiranda = (HWND)CallService(MS_CLUI_GETHWND, 0, 0);
+
+	// spawn a process that will:
+	//		-- wait for miranda to exit
+	//		-- move downloaded plugins from the temp folder to the Plugins folder, possibly backing up old ones
+	//		-- restart miranda
+
+	char msg[1024];
+	mir_snprintf(msg, 1024, "spawning external process, restart = %s", restart ? "true" : "false");
+	NLog(msg);
+
+	TCHAR data_filename[MAX_PATH];
+
+	_tcscpy(data_filename, options.data_folder);
+	_tcscat(data_filename, _T("\\ud_data.txt"));
+
+	// write data to file for external process to use
+	HANDLE hDatFile = CreateFile(data_filename, GENERIC_WRITE, FILE_SHARE_WRITE, 0, CREATE_ALWAYS, 0, 0);
+	if(hDatFile == INVALID_HANDLE_VALUE) {
+		//MessageBox(0, Translate("Could not create data file for restart."), Translate("Error"), MB_OK | MB_ICONERROR);
+		ShowError(TranslateT("Could not create data file for restart"));
+		return 1;
+	}
+
+	TCHAR *mir_exe = (TCHAR *)malloc(MAX_PATH * sizeof(TCHAR)), 
+		*plugins_folder = (TCHAR *)malloc(MAX_PATH * sizeof(TCHAR));
+	char *db_name = (char *)malloc(MAX_PATH), 
+		*db_path = (char *)malloc(MAX_PATH);
+
+	// Get Miranda exe path and profile
+	CallService(MS_DB_GETPROFILENAME, MAX_PATH, (WPARAM)(char*) db_name);
+	CallService(MS_DB_GETPROFILEPATH, MAX_PATH, (WPARAM)(char*) db_path);
+	strcat(db_path, "\\");
+	strcat(db_path, db_name);
+	//lstrcpyn(db_path+lstrlen(db_path), db_name, lstrlen(db_name)-3); // Pointer arithmetic	
+	//*(db_path + lstrlen(db_name) - 3) = 0;
+
+	// get plugin folder
+	GetModuleFileName(0, mir_exe, MAX_PATH);
+	_tcscpy(plugins_folder, mir_exe);
+	TCHAR *p = _tcsrchr(plugins_folder, _T('\\'));
+	if(p) *p = 0;
+	_tcscat(plugins_folder, _T("\\Plugins"));
+
+	unsigned long bytes_written;
+	char *nl = "\r\n";
+	TCHAR *tnl = _T("\r\n");
+	char buf[64];
+	WriteFile(hDatFile, mir_exe, _tcslen(mir_exe) * sizeof(TCHAR), &bytes_written, FALSE); 
+	WriteFile(hDatFile, tnl, 2 * sizeof(TCHAR), &bytes_written, FALSE);
+	WriteFile(hDatFile, plugins_folder, _tcslen(plugins_folder) * sizeof(TCHAR), &bytes_written, FALSE);
+	WriteFile(hDatFile, tnl, 2 * sizeof(TCHAR), &bytes_written, FALSE);
+	WriteFile(hDatFile, db_name, strlen(db_name), &bytes_written, FALSE);
+	WriteFile(hDatFile, nl, 2, &bytes_written, FALSE);
+	WriteFile(hDatFile, db_path, strlen(db_path), &bytes_written, FALSE);
+	WriteFile(hDatFile, nl, 2, &bytes_written, FALSE);
+	WriteFile(hDatFile, options.temp_folder, _tcslen(options.temp_folder) * sizeof(TCHAR), &bytes_written, FALSE);
+	WriteFile(hDatFile, tnl, 2 * sizeof(TCHAR), &bytes_written, FALSE);
+	if(options.backup) {
+		WriteFile(hDatFile, options.backup_folder, _tcslen(options.backup_folder) * sizeof(TCHAR), &bytes_written, FALSE);
+		WriteFile(hDatFile, tnl, 2 * sizeof(TCHAR), &bytes_written, FALSE);
+	} else {
+		WriteFile(hDatFile, _T("no backups"), _tcslen(_T("no backups")) * sizeof(TCHAR), &bytes_written, FALSE);
+		WriteFile(hDatFile, tnl, 2 * sizeof(TCHAR), &bytes_written, FALSE);
+	}
+	sprintf(buf, "%d", (unsigned int)GetCurrentProcessId());
+	//MessageBox(0, buf, "Writing process id", MB_OK);
+	WriteFile(hDatFile, buf, strlen(buf), &bytes_written, FALSE);
+	WriteFile(hDatFile, nl, 2, &bytes_written, FALSE);
+	
+	sprintf(buf, (restart ? "restart" : "no_restart"));
+	WriteFile(hDatFile, buf, strlen(buf), &bytes_written, FALSE);
+	WriteFile(hDatFile, nl, 2, &bytes_written, FALSE);
+
+	CloseHandle(hDatFile);
+
+	free(mir_exe);
+	free(plugins_folder);
+	free(db_name);
+	free(db_path);
+
+	/*
+	if(!CallService(MS_SYSTEM_OKTOEXIT,0,0)) {
+		DeleteFile(data_filename);
+		MessageBox(0, Translate("Miranda's not 'OK TO EXIT'."), Translate("Error"), MB_OK | MB_ICONERROR);
+		return;
+	}
+	*/
+
+	TCHAR szParams[MAX_PATH], szBuf[MAX_PATH];
+
+	// try to fire up external process from new dll (if present), so we can overwrite the old one
+	_tcscpy(szBuf, options.temp_folder);
+#ifdef PLUGDIR
+	_tcscat(szBuf, _T("\\plugins\\updater.dll"));
+#else
+	_tcscat(szBuf, _T("\\updater.dll"));
+#endif
+	
+	HANDLE hFile = CreateFile(szBuf, 0, 0, 0, OPEN_EXISTING, 0, 0);
+	if(hFile == INVALID_HANDLE_VALUE) {
+		// try with short path name...(for win98)
+		TCHAR szShortBuf[MAX_PATH];
+		GetShortPathName(szBuf, szShortBuf, MAX_PATH);
+		hFile = CreateFile(szShortBuf, 0, 0, 0, OPEN_EXISTING, 0, 0);
+	}
+
+	if(hFile != INVALID_HANDLE_VALUE) {
+		// new dll exists
+		CloseHandle(hFile);
+	} else {		
+		// can't find new updater dll - restart using this dll
+		GetModuleFileName(hInst, szBuf, MAX_PATH);
+	}
+
+	p = _tcsrchr(szBuf, _T('\\'));
+	if(p) *p = 0;
+
+	// rundll32 hates spaces in the <dll name> arg, but quotes aren't allowed in earlier versions...
+	// GetShortPath can return paths with spaces (at least on XP with 8.3 filenames disabled)...
+	// so we must 'CreateProcess' with the updater.dll location as the startup directory and pass only updater.dll as the arg
+
+#ifdef _MSC_VER
+	// MSVC exports differently than gcc/mingw
+	_stprintf(szParams, _T("RUNDLL32.EXE .\\updater.dll,_ExternalUpdate@16 %s"), data_filename);
+#else
+	_stprintf(szParams, _T("RUNDLL32.EXE .\\updater.dll,ExternalUpdate@16 %s"), data_filename);
+#endif
+
+	PROCESS_INFORMATION pi = {0};
+	STARTUPINFO si = {0};
+	si.cb = sizeof(si);
+
+	if(!CreateProcess(0, szParams, 0, 0, 0, 
+		CREATE_NO_WINDOW|DETACHED_PROCESS|NORMAL_PRIORITY_CLASS, 
+		0, szBuf, &si, &pi)) 
+	{
+		int err = GetLastError();
+		TCHAR msg[256];
+		_stprintf(msg, _T("Error code: %d"), err);
+		MessageBox(0, msg, TranslateT("CreateProcess"), MB_OK | MB_ICONERROR);
+
+		return 1;
+	} else {
+		//PostMessage(hWndMiranda, WM_DESTROY, 0, 0);
+		//PostThreadMessage(mainThreadId, WM_QUIT, 0, 0);
+		//PostThreadMessage(mainThreadId, WM_COMMAND, ID_ICQ_EXIT, 0);
+		PostMessage((HWND)CallService(MS_CLUI_GETHWND, 0, 0), WM_COMMAND, ID_ICQ_EXIT, 0);
+		return 0;
+	}
+
+	return 1;
+}
+
+#ifdef _UD_LOGGING
+void mWriteFile(HANDLE hFile, char *line) {
+	unsigned long bytes_written;
+	char *nl = "\r\n";
+
+	WriteFile(hFile, line, strlen(line), &bytes_written, FALSE);
+	WriteFile(hFile, nl, 2, &bytes_written, FALSE);
+}
+#endif
+
+// move all files in src_folder to dst_folder - put replaced files in backup folder
+// if a file in src_folder is a directory, copy it's contents to the same dir in the root folder and
+// set that dir as the new root (so that dirs in dirs go in the right place)
+void MoveFiles(HANDLE hLogFile, TCHAR *src_folder, TCHAR *dst_folder, TCHAR *backup_folder, TCHAR *root_folder) {
+	// move files from src_folder to dst_folder
+
+	if(!src_folder || _tcslen(src_folder) == 0) {
+		MessageBox(0, _T("Your 'temporary files' folder is set to NULL. Install aborted."), _T("Updater Error"), MB_OK | MB_ICONERROR);
+		return;
+	}
+
+	TCHAR szFilesPath[MAX_PATH], szOldFileName[MAX_PATH], szNewFileName[MAX_PATH], szBackupFileName[MAX_PATH];
+
+	bool do_backups = backup_folder ? (_tcscmp(backup_folder, _T("no backups")) != 0) : false;
+
+	// ensure the destination folder exists
+	if(!CreatePath(dst_folder)) {
+		return;
+	}
+
+	_tcscpy(szFilesPath, src_folder);
+	_tcscat(szFilesPath, _T("\\*.*"));
+
+	bool move_file;
+
+	WIN32_FIND_DATA findData;
+	HANDLE hFileSearch = FindFirstFile(szFilesPath, &findData);
+	if(hFileSearch != INVALID_HANDLE_VALUE) {
+		do {
+			if(findData.cFileName[0] != _T('.')) {
+				_tcslwr(findData.cFileName);
+
+				_tcscpy(szOldFileName, src_folder);
+				_tcscat(szOldFileName, _T("\\"));
+				_tcscat(szOldFileName, findData.cFileName);
+
+				if(findData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {
+					// use szNewFileName as destination and new root folder
+					_tcscpy(szNewFileName, root_folder);
+					if(_tcslen(findData.cFileName) < _tcslen(ROOT_FILES_FOLDER) || _tcscmp(findData.cFileName, ROOT_FILES_FOLDER)) {
+						_tcscat(szNewFileName, _T("\\"));
+						_tcscat(szNewFileName, findData.cFileName);
+					}
+
+					// recurse
+					MoveFiles(hLogFile, szOldFileName, szNewFileName, backup_folder, szNewFileName);
+
+				} else {
+					_tcscpy(szNewFileName, dst_folder);
+
+					// exception for langpack files - move to root_folder
+					// exception for dbtool.exe (e.g. translated) - move to root_folder
+					if((_tcsncmp(findData.cFileName, _T("dbtool.exe"), _tcslen(_T("dbtool.exe"))) == 0)
+						|| (_tcsncmp(findData.cFileName, _T("langpack_"), _tcslen(_T("langpack_"))) == 0))
+					{
+						_tcscpy(szNewFileName, root_folder);
+					}
+
+					_tcscat(szNewFileName, _T("\\"));
+					_tcscat(szNewFileName, findData.cFileName);
+
+					move_file = false;
+					if(do_backups) {
+						_tcscpy(szBackupFileName, backup_folder);
+						_tcscat(szBackupFileName, _T("\\"));
+						_tcscat(szBackupFileName, findData.cFileName);
+
+						move_file = true;
+						DeleteFile(szBackupFileName);
+						if(!MoveFile(szNewFileName, szBackupFileName)) {
+						//	MessageBox(0, szNewFileName, "Could not backup!", MB_OK | MB_ICONWARNING);
+						}
+					} else {
+						move_file = true;
+						if(!DeleteFile(szNewFileName)) {
+						//	MessageBox(0, szNewFileName, "Could not delete!", MB_OK | MB_ICONWARNING);
+						}
+					}
+
+					if(move_file) {
+						if(!MoveFile(szOldFileName, szNewFileName)) {
+							//MessageBox(0, szOldFileName, "Could not move!", MB_OK | MB_ICONWARNING);
+
+							// try a copy - possibly win98 etc. will not move the updater.dll when it is being used by this process
+							CopyFile(szOldFileName, szNewFileName, TRUE);
+							DeleteFile(szOldFileName); // docs say it is marked for delete and actually removed when the last handle is closed...hmm
+						}
+					} else {
+						DeleteFile(szOldFileName);
+					}
+				}
+			}
+		} while(FindNextFile(hFileSearch, &findData));
+		FindClose(hFileSearch);
+	}
+
+	RemoveDirectory(src_folder);
+}
+
+extern "C" void __declspec(dllexport) CALLBACK ExternalUpdate(HWND hwnd, HINSTANCE hInstance, LPSTR lpszCmdLine, int nCmdShow) {
+	HANDLE hDatFile = CreateFileA(lpszCmdLine, GENERIC_READ, FILE_SHARE_READ, 0, OPEN_EXISTING, 0, 0);
+	if(hDatFile == INVALID_HANDLE_VALUE) {
+		char msg[1024];
+		sprintf(msg, "Could not read data file:\n%s", lpszCmdLine);
+		MessageBoxA(0, msg, "Updater Error", MB_OK | MB_ICONERROR);
+	} else {
+
+		TCHAR *mir_exe = (TCHAR *)malloc(MAX_PATH * sizeof(TCHAR)),
+			*plugins_folder = (TCHAR *)malloc(MAX_PATH * sizeof(TCHAR)), 
+			*temp_folder = (TCHAR *)malloc(MAX_PATH * sizeof(TCHAR)),
+			*backup_folder = (TCHAR *)malloc(MAX_PATH * sizeof(TCHAR)),
+			*root_folder = (TCHAR *)malloc(MAX_PATH * sizeof(TCHAR));
+		char *db_name = (char *)malloc(MAX_PATH), 
+			*db_path = (char *)malloc(MAX_PATH), 
+			*pid = (char *)malloc(64);
+	
+		bool restart = true;
+
+		{
+			int i = 0, offset;
+			unsigned long bytes_read;
+			char ans_line[MAX_PATH];
+			TCHAR line[MAX_PATH];
+			BOOL bResult = TRUE;
+			do {
+				offset = 0;
+				if(i == 2 || i == 3 || i == 6 || i == 7) {
+					while((bResult = ReadFile(hDatFile, ans_line + offset, 1, &bytes_read, 0)) && offset < MAX_PATH && bytes_read == 1 && offset < MAX_PATH && ans_line[offset] && (ans_line[offset] != '\n' || (offset > 0 && ans_line[offset - 1] != '\r'))) offset++;
+					if(offset > 0) ans_line[offset - 1] = 0; // cut off /r/n
+					//MessageBoxA(0, ans_line, "Read ANSI text line", MB_OK);
+				} else {
+					while((bResult = ReadFile(hDatFile, line + offset, sizeof(TCHAR), &bytes_read, 0)) && offset < MAX_PATH && bytes_read == sizeof(TCHAR) && offset < MAX_PATH && line[offset] && (line[offset] != _T('\n') || (offset > 0 && line[offset - 1] != _T('\r')))) offset++;
+					if(offset > 0) line[offset - 1] = 0; // cut off /r/n
+					//MessageBox(0, line, _T("Read Unicode text line"), MB_OK);
+				}
+				switch(i) {
+					case 0: _tcsncpy(mir_exe, line, MAX_PATH); break;
+					case 1: _tcsncpy(plugins_folder, line, MAX_PATH); break;
+					case 2: strncpy(db_name, ans_line, MAX_PATH); break;
+					case 3: strncpy(db_path, ans_line, MAX_PATH); break;
+					case 4: _tcsncpy(temp_folder, line, MAX_PATH); break;
+					case 5: _tcsncpy(backup_folder, line, MAX_PATH); break;
+					case 6: strncpy(pid, ans_line, 64); break;
+					case 7: 
+						restart = (strncmp(ans_line, "restart", strlen("restart")) == 0); 
+						offset = 0; // end loop
+						break;
+					default:
+						offset = 0; // end loop
+				}
+				i++;
+			} while(offset > 0);
+		}
+		CloseHandle(hDatFile);
+// use data file to log to
+#ifndef _UD_LOGGING
+		DeleteFileA(lpszCmdLine);
+#else
+		HANDLE hDatFile = CreateFileA(lpszCmdLine, GENERIC_WRITE, FILE_SHARE_WRITE, 0, CREATE_ALWAYS, 0, 0);
+#endif
+
+#ifdef _UD_LOGGING
+		mWriteFile(hDatFile, "Inside external process..."); 
+#endif
+
+		_tcscpy(root_folder, mir_exe);
+		TCHAR *p = _tcsrchr(root_folder, _T('\\'));
+		if(p) *p = 0;
+
+		// ensure miranda has exited
+		DWORD mpi = (DWORD)atol(pid);
+
+		bool exited = false;
+
+#ifdef _UD_LOGGING
+		char logmsg[1024];
+		sprintf(logmsg, "Opening process #%d...", mpi);
+		mWriteFile(hDatFile, logmsg); 
+#endif
+
+		HANDLE hMiranda = OpenProcess(SYNCHRONIZE | PROCESS_TERMINATE, FALSE, mpi);
+		if(hMiranda) {
+			if(WaitForSingleObjectEx(hMiranda, 20 * 1000, FALSE) == WAIT_TIMEOUT) {
+
+				if(MessageBox(0, _T("Miranda did not exit - cannot install or restart.\n")
+					_T("Press OK to kill the process, ")
+					_T("or press Cancel to abort."), _T("Updater Error"), MB_OKCANCEL | MB_ICONERROR) == IDOK)
+				{
+					TerminateProcess(hMiranda, 1);
+
+					if(WaitForSingleObjectEx(hMiranda, 5 * 1000, FALSE) == WAIT_TIMEOUT) {
+						//hMiranda = OpenProcess(SYNCHRONIZE, FALSE, mpi);
+						//if(hMiranda) {
+						//CloseHandle(hMiranda);
+						MessageBox(0, _T("It seems Miranda is still running. Aborting update."), _T("Updater Error"), MB_OK | MB_ICONERROR);
+					} else {
+#ifdef _UD_LOGGING
+						mWriteFile(hDatFile, "Wait for miranda processs to 'Terminate' interrupted - assuming it exited"); 
+#endif
+						exited = true;
+					}
+				}
+				CloseHandle(hMiranda);
+			} else {
+#ifdef _UD_LOGGING
+				mWriteFile(hDatFile, "Wait for miranda processs interrupted - assuming it exited"); 
+#endif
+				exited = true;
+				CloseHandle(hMiranda);
+			}
+		} else {
+#ifdef _UD_LOGGING
+			mWriteFile(hDatFile, "Could not open miranda processs - assuming it exited"); 
+#endif
+			//MessageBox(0, "Could not open Miranda process", "Update Error", MB_OK | MB_ICONERROR);
+			exited = true;
+		}
+
+		if(exited) {
+#ifdef _UD_LOGGING
+			mWriteFile(hDatFile, "Miranda exited - moving files"); 
+			MoveFiles(hDatFile, temp_folder, plugins_folder, backup_folder, root_folder);
+#else
+			MoveFiles(0, temp_folder, plugins_folder, backup_folder, root_folder);
+			RemoveDirectory(temp_folder);
+#endif
+			// move files
+
+			// restart miranda
+			if(restart) {
+#ifdef _UD_LOGGING
+				mWriteFile(hDatFile, "Restarting"); 
+#endif
+				TCHAR szArgs[MAX_PATH], *temp_str;
+				//wsprintf(szArgs, "\"%s\" \"%s\"", db_path, db_name);
+				_stprintf(szArgs, _T("\"%s\" \"%s\""), mir_exe, temp_str = GetTStringACP(db_path)); // includes name, dummy instead of executable?
+				free(temp_str);
+				//wsprintf(szArgs, "\"%s\"", db_name);
+
+
+				PROCESS_INFORMATION pi = {0};
+				STARTUPINFO si = {0};
+				si.cb = sizeof(si);
+
+				if(!CreateProcess(mir_exe, szArgs, 0, 0, 0, DETACHED_PROCESS|NORMAL_PRIORITY_CLASS, 0, 0, &si, &pi)) {
+					MessageBox(0, _T("Failed to restart Miranda"), _T("Updater Error"), MB_OK | MB_ICONERROR);
+					//MessageBox(0, szArgs, mir_exe, MB_OK);
+				}
+				//ShellExecute(0, 0, mir_exe, szArgs, 0, SW_NORMAL);
+			}
+		}
+#ifdef _UD_LOGGING
+		else mWriteFile(hDatFile, "Miranda did not exit"); 
+#endif
+
+		free(plugins_folder);
+		free(db_name);
+		free(db_path);
+		free(temp_folder);
+		free(backup_folder);
+		free(root_folder);
+		free(mir_exe);
+
+#ifdef _UD_LOGGING
+		CloseHandle(hDatFile);
+#endif
+	}
+
+	FreeLibraryAndExitThread(hInstance, TRUE);
+}
diff --git a/updater/extern.h b/updater/extern.h
new file mode 100644
index 0000000..650f2bd
--- /dev/null
+++ b/updater/extern.h
@@ -0,0 +1,20 @@
+#ifndef _EXTERN_INC
+#define _EXTERN_INC
+
+#include "options.h"
+
+
+#define ROOT_FILES_FOLDER		_T("root_files")
+
+// returns 1 if any error, 0 if shutdown is imminent
+int ExternProcess(bool restart);
+
+// move all files in src_folder to backup_folder - put replaced files in backup folder
+// if a file in src_folder is a directory, copy it's contents to the same dir in the root folder and
+// set that dir as the new root (so that dirs in dirs go in the right place)
+void MoveFiles(HANDLE hLogFile, TCHAR *src_folder, TCHAR *dst_folder, TCHAR *backup_folder, TCHAR *root_folder);
+
+
+extern "C" void __declspec(dllexport) CALLBACK ExternalUpdate(HWND hwnd, HINSTANCE hInstance, LPSTR lpszCmdLine, int nCmdShow);
+
+#endif
diff --git a/updater/icons.cpp b/updater/icons.cpp
new file mode 100644
index 0000000..345e948
--- /dev/null
+++ b/updater/icons.cpp
@@ -0,0 +1,61 @@
+#include "common.h"
+#include "icons.h"
+
+HICON hIconCheck, hIconRestart, hIconCheckExit;
+HANDLE hIcoLibIconsChanged = 0;
+
+int ReloadIcons(WPARAM wParam, LPARAM lParam) {
+	hIconCheck = (HICON)CallService(MS_SKIN2_GETICON, 0, (LPARAM)"updater_check");
+	hIconRestart = (HICON)CallService(MS_SKIN2_GETICON, 0, (LPARAM)"updater_restart");
+	hIconCheckExit = (HICON)CallService(MS_SKIN2_GETICON, 0, (LPARAM)"updater_checkexit");
+
+	return 0;
+}
+
+void InitIcons() {
+	if(ServiceExists(MS_SKIN2_ADDICON)) {
+		SKINICONDESC2 sid;
+
+		sid.cbSize = sizeof(SKINICONDESC2);
+		sid.pszSection = "Updater";
+
+		sid.pszDescription = Translate("Check for Updates");
+		sid.pszName = "updater_check";
+		sid.pszDefaultFile = "updater.dll";
+		sid.iDefaultIndex = 0;
+		sid.hDefaultIcon = (HICON)LoadImage(hInst, MAKEINTRESOURCE(IDI_MAINMENU), IMAGE_ICON, 0, 0, 0);
+		CallService(MS_SKIN2_ADDICON, 0, (LPARAM)&sid);
+
+		sid.pszDescription = Translate("Restart");
+		sid.pszName = "updater_restart";
+		sid.pszDefaultFile = "updater.dll";
+		sid.iDefaultIndex = 1;
+		sid.hDefaultIcon = (HICON)LoadImage(hInst, MAKEINTRESOURCE(IDI_RESTART), IMAGE_ICON, 0, 0, 0);//LR_LOADTRANSPARENT | LR_LOADMAP3DCOLORS );
+		CallService(MS_SKIN2_ADDICON, 0, (LPARAM)&sid);
+
+		sid.pszDescription = Translate("Update and Exit");
+		sid.pszName = "updater_checkexit";
+		sid.pszDefaultFile = "updater.dll";
+		sid.iDefaultIndex = 2;
+		sid.hDefaultIcon = (HICON)LoadImage(hInst, MAKEINTRESOURCE(IDI_UPDATEANDEXIT), IMAGE_ICON, 0, 0, 0);//LR_LOADTRANSPARENT | LR_LOADMAP3DCOLORS );
+		CallService(MS_SKIN2_ADDICON, 0, (LPARAM)&sid);
+
+		ReloadIcons(0, 0);
+
+		hIcoLibIconsChanged = HookEvent(ME_SKIN2_ICONSCHANGED, ReloadIcons);
+	} else {
+		hIconCheck = (HICON)LoadImage(hInst, MAKEINTRESOURCE(IDI_MAINMENU), IMAGE_ICON, 0, 0, 0);//LR_LOADTRANSPARENT | LR_LOADMAP3DCOLORS );
+		hIconRestart = (HICON)LoadImage(hInst, MAKEINTRESOURCE(IDI_RESTART), IMAGE_ICON, 0, 0, 0);//LR_LOADTRANSPARENT | LR_LOADMAP3DCOLORS );
+		hIconCheckExit = (HICON)LoadImage(hInst, MAKEINTRESOURCE(IDI_UPDATEANDEXIT), IMAGE_ICON, 0, 0, 0);//LR_LOADTRANSPARENT | LR_LOADMAP3DCOLORS );
+	}
+
+}
+
+void DeinitIcons() {
+	if(hIcoLibIconsChanged) UnhookEvent(hIcoLibIconsChanged);
+	else {
+		DestroyIcon(hIconCheck);
+		DestroyIcon(hIconRestart);
+		DestroyIcon(hIconCheckExit);
+	}
+}
diff --git a/updater/icons.h b/updater/icons.h
new file mode 100644
index 0000000..79d2f3a
--- /dev/null
+++ b/updater/icons.h
@@ -0,0 +1,9 @@
+#ifndef _ICONS_INC
+#define _ICONS_INC
+
+extern HICON hIconCheck, hIconRestart, hIconCheckExit;
+
+void InitIcons();
+void DeinitIcons();
+
+#endif
diff --git a/updater/m_updater.h b/updater/m_updater.h
new file mode 100644
index 0000000..371b743
--- /dev/null
+++ b/updater/m_updater.h
@@ -0,0 +1,146 @@
+#ifndef _M_UPDATER_H
+#define _M_UPDATER_H
+
+// NOTES:
+// - For langpack updates, include a string of the following format in the langpack text file:
+//    ";FLID: <file listing name> <version>"
+//    version must be four numbers seperated by '.', in the range 0-255 inclusive
+// - Updater will disable plugins that are downloaded but were not active prior to the update (this is so that, if an archive contains e.g. ansi and 
+//    unicode versions, the correct plugin will be the only one active after the new version is installed)...so if you add a support plugin, you may need 
+//    to install an ini file to make the plugin activate when miranda restarts after the update
+// - Updater will replace all dlls that have the same internal shortName as a downloaded update dll (this is so that msn1.dll and msn2.dll, for example,
+//    will both be updated) - so if you have a unicode and a non-unicode version of a plugin in your archive, you should make the internal names different (which will break automatic 
+//    updates from the file listing if there is only one file listing entry for both versions, unless you use the 'MS_UPDATE_REGISTER' service below)
+// - Updater will install all files in the root of the archive into the plugins folder, except for langpack files that contain the FLID string which go into the root folder (same
+//    folder as miranda32.exe)...all folders in the archive will also be copied to miranda's root folder, and their contents transferred into the new folders. The only exception is a 
+//    special folder called 'root_files' - if there is a folder by that name in the archive, it's contents will also be copied into miranda's root folder - this is intended to be used 
+//    to install additional dlls etc that a plugin may require)
+
+// if you set Update.szUpdateURL to the following value when registering, as well as setting your beta site and version data,
+// Updater will ignore szVersionURL and pbVersionPrefix, and attempt to find the file listing URL's from the backend XML data.
+// for this to work, the plugin name in pluginInfo.shortName must match the file listing exactly (except for case)
+#define UPDATER_AUTOREGISTER		"UpdaterAUTOREGISTER"
+// Updater will also use the backend xml data if you provide URL's that reference the miranda file listing for updates (so you can use that method 
+// if e.g. your plugin shortName does not match the file listing) - it will grab the file listing id from the end of these URLs
+
+typedef struct Update_tag {
+  int cbSize;     
+  char *szComponentName;		// component name as it will appear in the UI (will be translated before displaying)
+
+  char *szVersionURL;			// URL where the current version can be found (NULL to disable)
+  BYTE *pbVersionPrefix;		// bytes occuring in VersionURL before the version, used to locate the version information within the URL data
+								// (note that this URL could point at a binary file - dunno why, but it could :)
+  int cpbVersionPrefix;			// number of bytes pointed to by pbVersionPrefix
+  char *szUpdateURL;			// URL where dll/zip is located
+								// set to UPDATER_AUTOREGISTER if you want Updater to find the file listing URLs (ensure plugin shortName matches file listing!)
+
+  char *szBetaVersionURL;		// URL where the beta version can be found (NULL to disable betas)
+  BYTE *pbBetaVersionPrefix;	// bytes occuring in VersionURL before the version, used to locate the version information within the URL data
+  int cpbBetaVersionPrefix;		// number of bytes pointed to by pbVersionPrefix
+  char *szBetaUpdateURL;		// URL where dll/zip is located
+
+  BYTE *pbVersion;				// bytes of current version, used for comparison with those in VersionURL
+  int cpbVersion;				// number of bytes pointed to by pbVersion
+
+  char *szBetaChangelogURL;		// url for displaying changelog for beta versions
+} Update;
+
+// register a comonent with Updater
+//
+// wparam = 0
+// lparam = (LPARAM)&Update
+#define MS_UPDATE_REGISTER      "Update/Register"
+
+// utility functions to create a version string from a DWORD or from pluginInfo
+// point buf at a buffer at least 16 chars wide - but note the version string returned may be shorter
+//
+__inline static char *CreateVersionString(DWORD version, char *buf) {
+	mir_snprintf(buf, 16, "%d.%d.%d.%d", (version >> 24) & 0xFF, (version >> 16) & 0xFF, (version >> 8) & 0xFF, version & 0xFF);
+	return buf;
+}
+
+__inline static char *CreateVersionStringPlugin(PLUGININFO *pluginInfo, char *buf) {
+	return CreateVersionString(pluginInfo->version, buf);
+}
+
+
+// register the 'easy' way - use this method if you have no beta URL and the plugin is on the miranda file listing
+// NOTE: the plugin version string on the file listing must be the string version of the version in pluginInfo (i.e. 0.0.0.1,
+// four numbers between 0 and 255 inclusivem, so no letters, brackets, etc.)
+//
+// wParam = (int)fileID				- this is the file ID from the file listing (i.e. the number at the end of the download link)
+// lParam = (PLUGININFO*)&pluginInfo
+#define MS_UPDATE_REGISTERFL	"Update/RegisterFL"
+
+// this function can be used to 'unregister' components - useful for plugins that register non-plugin/langpack components and
+// may need to change those components on the fly
+// lParam = (char *)szComponentName
+#define MS_UPDATE_UNREGISTER	"Update/Unregister"
+
+// this event is fired when the startup process is complete, but NOT if a restart is imminent
+// it is designed for status managment plugins to use as a trigger for beggining their own startup process
+// wParam = lParam = 0 (unused)
+// (added in version 0.1.6.0)
+#define ME_UPDATE_STARTUPDONE	"Update/StartupDone"
+
+// this service can be used to enable/disable Updater's global status control
+// it can be called from the StartupDone event handler
+// wParam = (BOOL)enable
+// lParam = 0
+// (added in version 0.1.6.0)
+#define MS_UPDATE_ENABLESTATUSCONTROL	"Update/EnableStatusControl"
+
+// An description of usage of the above service and event:
+// Say you are a status control plugin that normally sets protocol or global statuses in your ModulesLoaded event handler.
+// In order to make yourself 'Updater compatible', you would move the status control code from ModulesLoaded to another function, 
+// say DoStartup. Then, in ModulesLoaded you would check for the existence of the MS_UPDATE_ENABLESTATUSCONTROL service.
+// If it does not exist, call DoStartup. If it does exist, hook the ME_UPDATE_STARTUPDONE event and call DoStartup from there. You may
+// also wish to call MS_UPDATE_ENABLESTATUSCONTROL with wParam == FALSE at this time, to disable Updater's own status control feature.
+
+// this service can be used to determine whether updates are possible for a component with the given name
+// wParam = 0
+// lParam = (char *)szComponentName
+// returns TRUE if updates are supported, FALSE otherwise
+#define MS_UPDATE_ISUPDATESUPPORTED		"Update/IsUpdateSupported"
+
+#endif
+
+
+/////////////// Usage Example ///////////////
+
+#ifdef EXAMPLE_CODE
+
+// you need to #include "m_updater.h" and HookEvent(ME_SYSTEM_MODULESLOADED, OnModulesLoaded) in your Load function...
+
+int OnModulesLoaded(WPARAM wParam, LPARAM lParam) {
+
+	Update update = {0}; // for c you'd use memset or ZeroMemory...
+	char szVersion[16];
+
+	update.cbSize = sizeof(Update);
+
+	update.szComponentName = pluginInfo.shortName;
+	update.pbVersion = (BYTE *)CreateVersionString(&pluginInfo, szVersion);
+	update.cpbVersion = strlen((char *)update.pbVersion);
+
+	// these are the three lines that matter - the archive, the page containing the version string, and the text (or data) 
+	// before the version that we use to locate it on the page
+	// (note that if the update URL and the version URL point to standard file listing entries, the backend xml
+	// data will be used to check for updates rather than the actual web page - this is not true for beta urls)
+	update.szUpdateURL = "http://scottellis.com.au:81/test/updater.zip";
+	update.szVersionURL = "http://scottellis.com.au:81/test/updater_test.html";
+	update.pbVersionPrefix = (BYTE *)"Updater version ";
+	
+	update.cpbVersionPrefix = strlen((char *)update.pbVersionPrefix);
+
+	// do the same for the beta versions of the above struct members if you wish to allow beta updates from another URL
+
+	CallService(MS_UPDATE_REGISTER, 0, (WPARAM)&update);
+
+	// Alternatively, to register a plugin with e.g. file ID 2254 on the file listing...
+	// CallService(MS_UPDATE_REGISTERFL, (WPARAM)2254, (LPARAM)&pluginInfo);
+
+	return 0;
+}
+
+#endif
diff --git a/updater/options.cpp b/updater/options.cpp
new file mode 100644
index 0000000..87b3fb6
--- /dev/null
+++ b/updater/options.cpp
@@ -0,0 +1,714 @@
+#include "common.h"
+#include "options.h"
+#include "icons.h"
+
+Options options;
+
+HWND hwndOptions = 0;
+
+HANDLE hMainMenuItemRestart, hMainMenuItemUpdateAndExit;
+
+HANDLE hTempPath = 0, hBackupPath = 0, hDataPath = 0, hArchivePath = 0;
+
+void add_restart_menu_item() {
+	CLISTMENUITEM menu = {0};
+
+	menu.cbSize=sizeof(menu);
+	menu.flags = CMIM_ALL;
+	menu.hIcon = hIconRestart;
+
+	menu.pszName = Translate("Restart");
+	menu.pszService= MS_UPDATE_MENURESTART;
+	menu.position = 2000099900;
+	hMainMenuItemRestart = (HANDLE)CallService(MS_CLIST_ADDMAINMENUITEM,0,(LPARAM)&menu);
+}
+
+void add_update_and_exit_menu_item() {
+	CLISTMENUITEM menu = {0};
+
+	menu.cbSize=sizeof(menu);
+	menu.flags = CMIM_ALL;
+	menu.hIcon = hIconCheckExit;
+
+	menu.pszName = Translate("Update and Exit");
+	menu.pszService= MS_UPDATE_MENUUPDATEANDEXIT;
+	menu.position = 2000099901;
+	hMainMenuItemUpdateAndExit = (HANDLE)CallService(MS_CLIST_ADDMAINMENUITEM,0,(LPARAM)&menu);
+}
+
+void remove_restart_menu_item() {
+#ifdef MS_CLIST_REMOVEMAINMENUITEM
+	CallService(MS_CLIST_REMOVEMAINMENUITEM, (WPARAM)hMainMenuItemRestart, 0);
+#endif
+}
+
+void remove_update_and_exit_menu_item() {
+#ifdef MS_CLIST_REMOVEMAINMENUITEM
+	CallService(MS_CLIST_REMOVEMAINMENUITEM, (WPARAM)hMainMenuItemUpdateAndExit, 0);
+#endif
+}
+
+static int EnumerateFuncFillList(char *szComponentName, UpdateOptions *update_options, LPARAM lParam) {
+	LVITEM lvI = {0};
+	HWND hwndDlg = (HWND)lParam;
+	TCHAR *temp_str;
+
+	// Some code to create the list-view control.
+	// Initialize LVITEM members that are common to all
+	// items. 
+	lvI.mask = LVIF_TEXT | LVIF_PARAM;
+	lvI.lParam = (update_options->enabled ? 1 : 0) + (update_options->use_beta ? 2 : 0) + (update_options->fixed ? 4 : 0);
+
+	lvI.iSubItem = 0;
+	lvI.pszText = TranslateTS(temp_str = GetTString(szComponentName));
+	lvI.iItem = ListView_InsertItem(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), &lvI);
+	free(temp_str);
+
+	lvI.mask = LVIF_TEXT;
+	lvI.iSubItem = 1;
+	//lvI.pszText = LPSTR_TEXTCALLBACK;
+	if(((int)lvI.lParam & 4) == 4) {
+		lvI.pszText = (((int)lvI.lParam & 2) == 2 ? TranslateT("FORCED") : TranslateT("N/A"));
+	} else {
+		lvI.pszText = (((int)lvI.lParam & 2) == 2 ? TranslateT("TRUE") : TranslateT("FALSE"));
+	}
+	
+	ListView_SetItem(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), &lvI);
+
+	ListView_SetCheckState(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), lvI.iItem, update_options->enabled);
+
+	return 0;
+}
+
+static BOOL CALLBACK DlgProcOpts1(HWND hwndDlg, UINT msg, WPARAM wParam, LPARAM lParam) {
+
+	switch ( msg ) {
+	case WM_INITDIALOG:
+		hwndOptions = hwndDlg;
+		TranslateDialogDefault( hwndDlg );
+
+		CheckDlgButton(hwndDlg, IDC_CHK_ONSTART, options.check_on_startup);
+		{
+			HWND hw = GetDlgItem(hwndDlg, IDC_CHK_ONCE);
+			EnableWindow(hw, (IsDlgButtonChecked(hwndDlg, IDC_CHK_ONSTART) ? TRUE : FALSE));
+		}
+		CheckDlgButton(hwndDlg, IDC_CHK_ONCE, options.check_once);
+		CheckDlgButton(hwndDlg, IDC_CHK_DAILY, options.check_daily);
+		if(!ServiceExists(MS_TRIGGER_REGISTERACTION)) {
+			HWND hw = GetDlgItem(hwndDlg, IDC_CHK_NOCONFIDLE);
+			EnableWindow(hw, (IsDlgButtonChecked(hwndDlg, IDC_CHK_DAILY) ? TRUE : FALSE));
+		}
+		CheckDlgButton(hwndDlg, IDC_CHK_NOCONFIDLE, options.no_conf_idle);
+		CheckDlgButton(hwndDlg, IDC_CHK_BACKUP, options.backup);
+		CheckDlgButton(hwndDlg, IDC_CHK_STARTOFFLINE, options.start_offline);
+		CheckDlgButton(hwndDlg, IDC_CHK_POPUP, options.popup_notify);
+		CheckDlgButton(hwndDlg, IDC_CHK_RESTART, options.restart_menu_item);
+		CheckDlgButton(hwndDlg, IDC_CHK_UPDATEANDEXIT, options.update_and_exit_menu_item);
+		CheckDlgButton(hwndDlg, IDC_CHK_SAVEZIPS, options.save_zips);
+		{
+			HWND hw = GetDlgItem(hwndDlg, IDC_CHK_POPUP);
+			EnableWindow(hw, ArePopupsEnabled() ? TRUE : FALSE);
+		}
+		CheckDlgButton(hwndDlg, IDC_CHK_DLLSONLY, options.auto_dll_only);
+
+		// set up Version Requirement slider
+		SendDlgItemMessage(hwndDlg, IDC_SLID_VERREQ, TBM_SETRANGE, 0, MAKELONG(0, 3));
+
+		SendDlgItemMessage(hwndDlg, IDC_SLID_VERREQ, TBM_SETPOS, TRUE, (int)options.ver_req);
+		switch(options.ver_req) {
+		case VR_MAJOR:
+			SetDlgItemText(hwndDlg, IDC_ST_VERREQ, TranslateT("Update on major version change."));
+			break;
+		case VR_MINOR:
+			SetDlgItemText(hwndDlg, IDC_ST_VERREQ, TranslateT("Update on minor version change."));
+			break;
+		case VR_RELEASE:
+			SetDlgItemText(hwndDlg, IDC_ST_VERREQ, TranslateT("Update on release number change."));
+			break;
+		case VR_BUILD:
+			SetDlgItemText(hwndDlg, IDC_ST_VERREQ, TranslateT("Update on build number change."));
+			break;
+		}
+
+
+		SendMessage(GetDlgItem(hwndDlg, IDC_LST_REGISTERED),LVM_SETEXTENDEDLISTVIEWSTYLE, 0,LVS_EX_FULLROWSELECT | LVS_EX_CHECKBOXES);
+
+		{
+			LVCOLUMN lvc; 
+			// Initialize the LVCOLUMN structure.
+			// The mask specifies that the format, width, text, and
+			// subitem members of the structure are valid. 
+			lvc.mask = LVCF_FMT | LVCF_WIDTH | LVCF_TEXT | LVCF_SUBITEM; 
+			lvc.fmt = LVCFMT_LEFT;
+	  
+			lvc.iSubItem = 0;
+			lvc.pszText = TranslateT("Component Name");	
+			lvc.cx = 260;     // width of column in pixels
+			ListView_InsertColumn(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), 0, &lvc);
+
+			lvc.iSubItem = 1;
+			lvc.pszText = TranslateT("Use Beta?");	
+			lvc.cx = 80;     // width of column in pixels
+			ListView_InsertColumn(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), 1, &lvc);
+		}
+
+		ListView_DeleteAllItems(GetDlgItem(hwndDlg, IDC_LST_REGISTERED));
+		CallService(MS_UPDATE_ENUMERATE, (WPARAM)EnumerateFuncFillList, (LPARAM)hwndDlg);
+		
+		//SendDlgItemMessage(hwndDlg, IDC_BTN_CHECK, WM_SETICON, ICON_SMALL, (LPARAM)hIconCheck);
+		//SendDlgItemMessage(hwndDlg, IDC_BTN_CHECKNORESTART, WM_SETICON, ICON_SMALL, (LPARAM)hIconCheckExit);
+		SendDlgItemMessage(hwndDlg, IDC_BTN_CHECK, BM_SETIMAGE, IMAGE_ICON, (LPARAM)hIconCheck);
+		SendDlgItemMessage(hwndDlg, IDC_BTN_CHECKNORESTART, BM_SETIMAGE, IMAGE_ICON, (LPARAM)hIconCheckExit);
+
+		return FALSE;
+
+	case WMU_CHECKING:
+		{
+			HWND hw = GetDlgItem(hwndDlg, IDC_BTN_CHECK);
+			EnableWindow(hw, FALSE);
+			hw = GetDlgItem(hwndDlg, IDC_BTN_CHECKNORESTART);
+			EnableWindow(hw, FALSE);
+		}
+		return TRUE;
+
+	case WMU_DONECHECKING:
+		{
+			HWND hw = GetDlgItem(hwndDlg, IDC_BTN_CHECK);
+			EnableWindow(hw, TRUE);
+			hw = GetDlgItem(hwndDlg, IDC_BTN_CHECKNORESTART);
+			EnableWindow(hw, TRUE);
+		}
+		return TRUE;
+
+	case WM_HSCROLL:
+		//if (LOWORD(wParam) == TB_PAGEUP || LOWORD(wParam) == TB_PAGEDOWN) 
+		{
+			VersionRequirement vr = (VersionRequirement)SendDlgItemMessage(hwndDlg, IDC_SLID_VERREQ, TBM_GETPOS, 0, 0);
+			switch(vr) {
+			case VR_MAJOR:
+				SetDlgItemText(hwndDlg, IDC_ST_VERREQ, TranslateT("Update on major version change."));
+				break;
+			case VR_MINOR:
+				SetDlgItemText(hwndDlg, IDC_ST_VERREQ, TranslateT("Update on minor version change."));
+				break;
+			case VR_RELEASE:
+				SetDlgItemText(hwndDlg, IDC_ST_VERREQ, TranslateT("Update on release number change."));
+				break;
+			case VR_BUILD:
+				SetDlgItemText(hwndDlg, IDC_ST_VERREQ, TranslateT("Update on build number change."));
+				break;
+			}
+			SendMessage(GetParent(hwndDlg), PSM_CHANGED, 0, 0);
+			return TRUE;
+		}
+		break;
+	case WM_COMMAND:
+		if ( HIWORD( wParam ) == BN_CLICKED ) {
+			switch( LOWORD( wParam )) {
+				case IDC_CHK_ONSTART:
+					{
+						HWND hw = GetDlgItem(hwndDlg, IDC_CHK_ONCE);
+						EnableWindow(hw, (IsDlgButtonChecked(hwndDlg, IDC_CHK_ONSTART) ? TRUE : FALSE));
+					}
+					SendMessage(GetParent(hwndDlg), PSM_CHANGED, 0, 0);
+					return TRUE;
+				case IDC_CHK_ONCE:
+					SendMessage(GetParent(hwndDlg), PSM_CHANGED, 0, 0);
+					return TRUE;
+				case IDC_CHK_DAILY:
+					if(!ServiceExists(MS_TRIGGER_REGISTERACTION)) {
+						HWND hw = GetDlgItem(hwndDlg, IDC_CHK_NOCONFIDLE);
+						EnableWindow(hw, (IsDlgButtonChecked(hwndDlg, IDC_CHK_DAILY) ? TRUE : FALSE));
+					}
+					SendMessage(GetParent(hwndDlg), PSM_CHANGED, 0, 0);
+					return TRUE;
+				case IDC_CHK_NOCONFIDLE:
+				case IDC_CHK_BACKUP:
+				case IDC_CHK_STARTOFFLINE:
+				case IDC_CHK_POPUP:
+				case IDC_CHK_RESTART:
+				case IDC_CHK_UPDATEANDEXIT:
+				case IDC_CHK_SAVEZIPS:
+				case IDC_CHK_DLLSONLY:
+					SendMessage(GetParent(hwndDlg), PSM_CHANGED, 0, 0);
+					return TRUE;
+				case IDC_BTN_CHECK:
+					CallService(MS_UPDATE_CHECKFORUPDATES, 0, 0);
+					return TRUE;
+				case IDC_BTN_CHECKNORESTART:
+					CallService(MS_UPDATE_CHECKFORUPDATES, 0, 1);
+					return TRUE;
+			}
+		}
+		break;
+
+	case WM_NOTIFY:
+		if(((LPNMHDR) lParam)->hwndFrom == GetDlgItem(hwndDlg, IDC_LST_REGISTERED)) {
+			switch (((LPNMHDR) lParam)->code) {
+			case NM_CLICK:
+				if (((LPNMLISTVIEW)lParam)->iSubItem == 1) {
+					LVITEM lvi = {0};
+					lvi.mask = LVIF_PARAM;
+					lvi.iItem = ((LPNMLISTVIEW)lParam)->iItem;
+					lvi.iSubItem = 0;
+					SendMessage(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), LVM_GETITEM, 0, (LPARAM)&lvi);
+					if(((int)lvi.lParam & 4) == 0) {
+						lvi.lParam ^= 2;
+						ListView_SetItem(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), &lvi);
+
+						lvi.iSubItem = 1;
+						lvi.mask = LVIF_TEXT;
+						if(((int)lvi.lParam & 4) == 4) {
+							lvi.pszText = (((int)lvi.lParam & 2) == 2 ? TranslateT("FORCED") : TranslateT("N/A"));
+						} else {
+							lvi.pszText = (((int)lvi.lParam & 2) == 2 ? TranslateT("TRUE") : TranslateT("FALSE"));
+						}
+						ListView_SetItem(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), &lvi);
+
+						ListView_RedrawItems(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), lvi.iItem, lvi.iItem);
+						SendMessage(GetParent(hwndDlg), PSM_CHANGED, 0, 0);
+					}
+				}
+				return 0;
+			case LVN_ITEMCHANGED:
+				{
+					NMLISTVIEW *nmlv = (NMLISTVIEW *)lParam;
+
+					if(IsWindowVisible(GetDlgItem(hwndDlg, IDC_LST_REGISTERED)) && ((nmlv->uNewState ^ nmlv->uOldState) & LVIS_STATEIMAGEMASK))
+						SendMessage(GetParent(hwndDlg), PSM_CHANGED, 0, 0);
+				}
+				break;
+			case LVN_GETDISPINFO:
+				{
+					LVITEM lvi = {0};
+					lvi.mask = LVIF_PARAM;
+					lvi.iItem = ((NMLVDISPINFO *)lParam)->item.iItem;
+					lvi.iSubItem = 0;
+					SendMessage(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), LVM_GETITEM, 0, (LPARAM)&lvi);
+					switch (((NMLVDISPINFO *)lParam)->item.iSubItem) {
+					case 0:
+						MessageBox(0, _T("LVN_GETDISPINFO (0)"), _T("msg"), MB_OK);
+						break;
+					case 1:
+						if(((int)lvi.lParam & 4) == 4) {
+							((NMLVDISPINFO *)lParam)->item.pszText = (((int)lvi.lParam & 2) == 2 ? TranslateT("FORCED") : TranslateT("N/A"));
+							((NMLVDISPINFO *)lParam)->item.cchTextMax = _tcslen(((NMLVDISPINFO *)lParam)->item.pszText);
+						} else {
+							((NMLVDISPINFO *)lParam)->item.pszText = (((int)lvi.lParam & 2) == 2 ? TranslateT("TRUE") : TranslateT("FALSE"));
+							((NMLVDISPINFO *)lParam)->item.cchTextMax = _tcslen(((NMLVDISPINFO *)lParam)->item.pszText);
+						}
+						break;
+					}
+				}
+				return 0;
+			}
+		} else 
+			if (((LPNMHDR)lParam)->code == (unsigned)PSN_APPLY ) {
+				options.check_on_startup = (IsDlgButtonChecked(hwndDlg, IDC_CHK_ONSTART) ? true : false);
+				options.check_once = (IsDlgButtonChecked(hwndDlg, IDC_CHK_ONCE) ? true : false);
+				options.check_daily = (IsDlgButtonChecked(hwndDlg, IDC_CHK_DAILY) ? true : false);
+				options.no_conf_idle = (IsDlgButtonChecked(hwndDlg, IDC_CHK_NOCONFIDLE) ? true : false);
+				options.backup = (IsDlgButtonChecked(hwndDlg, IDC_CHK_BACKUP) ? true : false);
+				options.start_offline = (IsDlgButtonChecked(hwndDlg, IDC_CHK_STARTOFFLINE) ? true : false);
+				options.popup_notify = (IsDlgButtonChecked(hwndDlg, IDC_CHK_POPUP) ? true : false);
+				options.ver_req = (VersionRequirement)SendDlgItemMessage(hwndDlg, IDC_SLID_VERREQ, TBM_GETPOS, 0, 0);
+				options.save_zips = (IsDlgButtonChecked(hwndDlg, IDC_CHK_SAVEZIPS) ? true : false);
+				options.auto_dll_only = (IsDlgButtonChecked(hwndDlg, IDC_CHK_DLLSONLY) ? true : false);
+
+				bool restart_menu_item = (IsDlgButtonChecked(hwndDlg, IDC_CHK_RESTART) ? true : false);
+				if(options.restart_menu_item != restart_menu_item) {
+					options.restart_menu_item = restart_menu_item;
+					if(options.restart_menu_item) add_restart_menu_item();
+					else remove_restart_menu_item();
+				}
+
+				bool update_and_exit_menu_item = (IsDlgButtonChecked(hwndDlg, IDC_CHK_UPDATEANDEXIT) ? true : false);
+				if(options.update_and_exit_menu_item != update_and_exit_menu_item) {
+					options.update_and_exit_menu_item = update_and_exit_menu_item;
+					if(options.update_and_exit_menu_item) add_update_and_exit_menu_item();
+					else remove_update_and_exit_menu_item();
+				}
+
+				int count = ListView_GetItemCount(GetDlgItem(hwndDlg, IDC_LST_REGISTERED));
+				UpdateOptions uo;
+				LVITEM lvi;
+				lvi.mask = LVIF_TEXT | LVIF_PARAM;
+				TCHAR buff[256];
+				lvi.pszText = buff;
+				lvi.cchTextMax = 256;
+				lvi.iSubItem = 0;
+				for(int i = 0; i < count; i++) {
+					lvi.iItem = i;
+					SendMessage(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), LVM_GETITEM, 0, (LPARAM)&lvi);
+
+					uo.enabled = (ListView_GetCheckState(GetDlgItem(hwndDlg, IDC_LST_REGISTERED), lvi.iItem) == TRUE);
+					uo.use_beta = (((int)lvi.lParam & 2) == 2);
+					uo.fixed = (((int)lvi.lParam & 4) == 4);
+					
+					CallService(MS_UPDATE_SETUPDATEOPTIONS, (WPARAM)lvi.pszText, (LPARAM)&uo);
+				}
+
+				SaveOptions();
+				return TRUE;
+			}
+		break;
+	case WM_DESTROY:
+		hwndOptions = 0;
+		break;
+	}
+
+	return FALSE;
+}
+
+static BOOL CALLBACK DlgProcOpts2(HWND hwndDlg, UINT msg, WPARAM wParam, LPARAM lParam) {
+
+	switch ( msg ) {
+	case WM_INITDIALOG:
+		TranslateDialogDefault( hwndDlg );
+
+		SetDlgItemText(hwndDlg, IDC_ED_UPDATES, options.temp_folder);
+		SetDlgItemText(hwndDlg, IDC_ED_DATA, options.data_folder);
+		SetDlgItemText(hwndDlg, IDC_ED_BACKUPS, options.backup_folder);
+		SetDlgItemText(hwndDlg, IDC_ED_ZIPS, options.zip_folder);
+
+		return FALSE;
+	case WM_COMMAND:
+		if ( HIWORD( wParam ) == EN_CHANGE && ( HWND )lParam == GetFocus()) {
+			switch( LOWORD( wParam )) {
+			case IDC_ED_UPDATES:
+			case IDC_ED_DATA:
+			case IDC_ED_BACKUPS:
+			case IDC_ED_ZIPS:
+				SendMessage(GetParent(hwndDlg), PSM_CHANGED, 0, 0);
+			}	
+		}
+		if ( HIWORD( wParam ) == BN_CLICKED ) {
+
+			TCHAR folder_buff[MAX_PATH];
+			BROWSEINFO bi = {0};
+			LPCITEMIDLIST pidl;
+
+			bi.hwndOwner = hwndDlg;
+			bi.pidlRoot = 0;
+			bi.pszDisplayName = folder_buff;
+			bi.lpszTitle = TranslateT("Select Updates Folder");
+			bi.ulFlags = 0;
+			bi.lpfn = 0;
+			bi.lParam = 0;
+			bi.iImage = 0;
+
+			if((pidl = SHBrowseForFolder(&bi)) != 0) {
+				SHGetPathFromIDList(pidl, folder_buff);
+				CoTaskMemFree((void *)pidl);
+
+				switch( LOWORD( wParam )) {
+					case IDC_BTN_BRUPDATES:
+						SetDlgItemText(hwndDlg, IDC_ED_UPDATES, folder_buff);
+						SendMessage( GetParent( hwndDlg ), PSM_CHANGED, 0, 0 );
+						break;
+					case IDC_BTN_BRDATA:
+						SetDlgItemText(hwndDlg, IDC_ED_DATA, folder_buff);
+						SendMessage( GetParent( hwndDlg ), PSM_CHANGED, 0, 0 );
+						break;
+					case IDC_BTN_BRBACKUPS:
+						SetDlgItemText(hwndDlg, IDC_ED_BACKUPS, folder_buff);
+						SendMessage( GetParent( hwndDlg ), PSM_CHANGED, 0, 0 );
+						break;
+					case IDC_BTN_BRZIPS:
+						SetDlgItemText(hwndDlg, IDC_ED_ZIPS, folder_buff);
+						SendMessage( GetParent( hwndDlg ), PSM_CHANGED, 0, 0 );
+						break;
+				}
+
+
+				return TRUE;
+			}
+		}
+		return FALSE;
+	case WM_NOTIFY:
+		if (((LPNMHDR)lParam)->code == (unsigned)PSN_APPLY ) {
+			GetDlgItemText(hwndDlg, IDC_ED_UPDATES, options.temp_folder, MAX_PATH);
+			
+			
+			if(!FolderIsEmpty(options.temp_folder)) {
+				MessageBox(hwndDlg, TranslateT("The folder you have chosen for temporary files is not empty.\nALL FILES in this folder will be REMOVED during the update process."), TranslateT("Updater Warning"), MB_ICONWARNING | MB_OK);
+			}
+
+			GetDlgItemText(hwndDlg, IDC_ED_DATA, options.data_folder, MAX_PATH);
+			GetDlgItemText(hwndDlg, IDC_ED_BACKUPS, options.backup_folder, MAX_PATH);
+			GetDlgItemText(hwndDlg, IDC_ED_ZIPS, options.zip_folder, MAX_PATH);
+
+			SaveOptions();
+
+			return TRUE;
+		}
+		break;
+	}
+	return FALSE;
+}
+
+int OptInit(WPARAM wParam,LPARAM lParam)
+{
+#define OPTIONPAGE_OLD_SIZE2 60
+	DWORD mirVir = (DWORD)CallService(MS_SYSTEM_GETVERSION, 0, 0);
+
+	OPTIONSDIALOGPAGE odp = { 0 };
+	odp.cbSize						= (mirVir >= 0x00060000 ? sizeof(odp) : OPTIONPAGE_OLD_SIZE2);
+	odp.flags						= ODPF_BOLDGROUPS | ODPF_TCHAR;
+	odp.position					= -790000000;
+	odp.hInstance					= hInst;
+
+	if(ServiceExists(MS_FOLDERS_GET_PATH)) {
+		odp.pszTemplate					= MAKEINTRESOURCEA(IDD_OPT1);
+		//odp.pszTitle					= Translate("Settings");
+		//odp.pszGroup					= Translate("Updates");
+		odp.ptszTitle					= TranslateT("Updater");
+		odp.ptszGroup					= TranslateT("Services");
+		odp.nIDBottomSimpleControl		= 0;
+		odp.pfnDlgProc					= DlgProcOpts1;
+		CallService( MS_OPT_ADDPAGE, wParam,( LPARAM )&odp );
+	} else {
+		odp.pszTemplate					= MAKEINTRESOURCEA(IDD_OPT1);
+		//odp.pszTitle					= Translate("Settings");
+		//odp.pszGroup					= Translate("Updates");
+		odp.ptszTitle					= (mirVir >= 0x00060000 ? TranslateT("Updater") : TranslateT("Settings"));
+		odp.ptszGroup					= (mirVir >= 0x00060000 ? TranslateT("Services") : TranslateT("Updates"));
+		odp.nIDBottomSimpleControl		= 0;
+		odp.pfnDlgProc					= DlgProcOpts1;
+		odp.ptszTab						= TranslateT("Settings");
+		CallService( MS_OPT_ADDPAGE, wParam,( LPARAM )&odp );
+
+		odp.pszTemplate					= MAKEINTRESOURCEA(IDD_OPT2);
+		//odp.pszTitle					= Translate("Folders");
+		//odp.pszGroup					= Translate("Updates");
+		odp.ptszTitle					= (mirVir >= 0x00060000 ? TranslateT("Updater") : TranslateT("Folders"));
+		odp.ptszGroup					= (mirVir >= 0x00060000 ? TranslateT("Services") : TranslateT("Updates"));
+		odp.nIDBottomSimpleControl		= 0;
+		odp.pfnDlgProc					= DlgProcOpts2;
+		odp.ptszTab						= TranslateT("Folders");
+		CallService( MS_OPT_ADDPAGE, wParam,( LPARAM )&odp );
+	}
+
+	return 0;
+}
+
+#ifdef _UNICODE
+#define DBGetString			DBGetContactSettingTString
+#define DBWriteString		DBWriteContactSettingTString
+#else
+#define DBGetString			DBGetContactSetting
+#define DBWriteString		DBWriteContactSettingString
+#endif
+
+void InitOptionsMenuItems() {
+	if(options.restart_menu_item)
+		add_restart_menu_item();
+	if(options.update_and_exit_menu_item)
+		add_update_and_exit_menu_item();
+}
+
+int FoldersPathChanged(WPARAM wParam, LPARAM lParam) {
+	FOLDERSGETDATA fgd = {0};
+	fgd.cbSize = sizeof(fgd);
+	fgd.nMaxPathSize = MAX_PATH;
+
+	fgd.szPathT = options.temp_folder;
+	CallService(MS_FOLDERS_GET_PATH, (WPARAM)hTempPath, (WPARAM)&fgd);
+
+	if(!FolderIsEmpty(options.temp_folder)) {
+		MessageBox(0, TranslateT("The folder you have chosen for temporary files is not empty.\nALL FILES in this folder will be REMOVED during the update process."), TranslateT("Updater Warning"), MB_ICONWARNING | MB_OK);
+	}
+
+	fgd.szPathT = options.backup_folder;
+	CallService(MS_FOLDERS_GET_PATH, (WPARAM)hBackupPath, (WPARAM)&fgd);
+
+	fgd.szPathT = options.data_folder;
+	CallService(MS_FOLDERS_GET_PATH, (WPARAM)hDataPath, (WPARAM)&fgd);
+
+	fgd.szPathT = options.zip_folder;
+	CallService(MS_FOLDERS_GET_PATH, (WPARAM)hArchivePath, (WPARAM)&fgd);
+
+	return 0;
+}
+
+void LoadOptions() {
+	options.check_on_startup = (DBGetContactSettingByte(0, MODULE, "CheckOnStartup", 1) == 1);
+	options.check_once = (DBGetContactSettingByte(0, MODULE, "CheckOnce", 1) == 1);
+	options.check_daily = (DBGetContactSettingByte(0, MODULE, "CheckDaily", 1) == 1);
+	options.no_conf_idle = (DBGetContactSettingByte(0, MODULE, "NoConfIdle", 0) == 1);
+	options.backup = (DBGetContactSettingByte(0, MODULE, "Backup", 1) == 1);
+	//options.use_xml_backend = (DBGetContactSettingByte(0, MODULE, "UseXML", 1) == 1);
+	options.use_xml_backend = true;
+	options.start_offline = (DBGetContactSettingByte(0, MODULE, "StartOffline", 1) == 1);
+	options.popup_notify = (DBGetContactSettingByte(0, MODULE, "PopupNotify", 0) == 1);
+	options.restart_menu_item = (DBGetContactSettingByte(0, MODULE, "RestartMenuItem", 0) == 1);
+	options.update_and_exit_menu_item = (DBGetContactSettingByte(0, MODULE, "UpdateAndExitMenuItem", 0) == 1);
+	options.save_zips = (DBGetContactSettingByte(0, MODULE, "SaveZips", 0) == 1);
+
+	options.set_colours = false; // = (DBGetContactSettingByte(0, MODULE, "PopupSetColours", 0) == 1); // popup colours - not implemented
+	options.bkCol = DBGetContactSettingDword(0, MODULE, "PopupBkCol", 0);
+	options.textCol = DBGetContactSettingDword(0, MODULE, "PopupTextCol", 0x00FFFFFF);
+
+	options.ver_req = (VersionRequirement)DBGetContactSettingByte(0, MODULE, "VersionRequirement", VR_BUILD);
+	options.auto_dll_only = (DBGetContactSettingByte(0, MODULE, "AutoDLLOnly", 0) == 1);
+
+	if(ServiceExists(MS_FOLDERS_GET_PATH)) {
+		FOLDERSDATA fd = {0};
+		fd.cbSize = sizeof(fd);
+#ifdef _UNICODE
+		fd.flags = FF_UNICODE;
+#endif
+		strncpy(fd.szSection, Translate("Updates"), 64);
+
+		strncpy(fd.szName, Translate("Temporary Files"), 64);
+		fd.szFormatT = _T(MIRANDA_PATH) _T("\\updater\\temp");
+		hTempPath = (HANDLE)CallService(MS_FOLDERS_REGISTER_PATH, 0, (LPARAM)&fd);
+
+		if(hTempPath) {
+			strncpy(fd.szName, Translate("Backups"), 64);
+			fd.szFormatT = _T(MIRANDA_PATH) _T("\\updater\\backups");
+			hBackupPath = (HANDLE)CallService(MS_FOLDERS_REGISTER_PATH, 0, (LPARAM)&fd);
+
+			strncpy(fd.szName, Translate("Data"), 64);
+			fd.szFormatT = _T(MIRANDA_PATH) _T("\\updater\\data");
+			hDataPath = (HANDLE)CallService(MS_FOLDERS_REGISTER_PATH, 0, (LPARAM)&fd);
+
+			strncpy(fd.szName, Translate("Saved Archives"), 64);
+			fd.szFormatT = _T(MIRANDA_PATH) _T("\\updater\\archives");
+			hArchivePath = (HANDLE)CallService(MS_FOLDERS_REGISTER_PATH, 0, (LPARAM)&fd);
+
+			HookEvent(ME_FOLDERS_PATH_CHANGED, FoldersPathChanged);
+			FoldersPathChanged(0, 0);
+
+			return;
+		}
+	}
+
+	TCHAR mir_path[MAX_PATH];
+	GetModuleFileName(0, mir_path, MAX_PATH);
+	TCHAR *p = _tcsrchr(mir_path, _T('\\'));
+	if(p) *p = 0;
+	else {
+		p = _tcsrchr(mir_path, _T('/'));
+		if(p) *p = 0;
+	}
+
+	DBVARIANT dbv;
+	if(!DBGetString(0, MODULE, "TempFolder", &dbv)) {
+		if(_tcslen(dbv.ptszVal) >= 2 && dbv.ptszVal[1] == _T(':'))		// detect an absolute path?
+			_tcsncpy(options.temp_folder, dbv.ptszVal, MAX_PATH);
+		else {
+			_tcscpy(options.temp_folder, mir_path);
+			_tcscat(options.temp_folder, dbv.ptszVal);
+		}
+		DBFreeVariant(&dbv);
+	} else {
+
+		_tcscpy(options.temp_folder, mir_path);
+		_tcscat(options.temp_folder, _T("\\Updater"));
+		_tcscat(options.temp_folder, _T("\\Temp"));
+	}
+
+	if(!DBGetString(0, MODULE, "BackupFolder", &dbv)) {
+		if(_tcslen(dbv.ptszVal) >= 2 && dbv.ptszVal[1] == _T(':'))		// detect an absolute path?
+			_tcsncpy(options.backup_folder, dbv.ptszVal, MAX_PATH);
+		else {
+			_tcscpy(options.backup_folder, mir_path);
+			_tcscat(options.backup_folder, dbv.ptszVal);
+		}
+		DBFreeVariant(&dbv);
+	} else {
+
+		_tcscpy(options.backup_folder, mir_path);
+		_tcscat(options.backup_folder, _T("\\Updater"));
+		_tcscat(options.backup_folder, _T("\\Backups"));
+	}
+
+	if(!DBGetString(0, MODULE, "DataFolder", &dbv)) {
+		if(_tcslen(dbv.ptszVal) >= 2 && dbv.ptszVal[1] == _T(':'))		// detect an absolute path?
+			_tcsncpy(options.data_folder, dbv.ptszVal, MAX_PATH);
+		else {
+			_tcscpy(options.data_folder, mir_path);
+			_tcscat(options.data_folder, dbv.ptszVal);
+		}
+		DBFreeVariant(&dbv);
+	} else {
+
+		_tcscpy(options.data_folder, mir_path);
+		_tcscat(options.data_folder, _T("\\Updater"));
+		_tcscat(options.data_folder, _T("\\Data"));
+	}
+
+	if(!DBGetString(0, MODULE, "ZipFolder", &dbv)) {
+		if(_tcslen(dbv.ptszVal) >= 2 && dbv.ptszVal[1] == _T(':'))		// detect an absolute path?
+			_tcsncpy(options.zip_folder, dbv.ptszVal, MAX_PATH);
+		else {
+			_tcscpy(options.zip_folder, mir_path);
+			_tcscat(options.zip_folder, dbv.ptszVal);
+		}
+		DBFreeVariant(&dbv);
+	} else {
+
+		_tcscpy(options.zip_folder, mir_path);
+		_tcscat(options.zip_folder, _T("\\Updater"));
+		_tcscat(options.zip_folder, _T("\\Archives"));
+	}
+}
+
+void SaveOptions() {
+	DBWriteContactSettingByte(0, MODULE, "CheckOnStartup", options.check_on_startup ? 1 : 0);
+	DBWriteContactSettingByte(0, MODULE, "CheckOnce", options.check_once ? 1 : 0);
+	DBWriteContactSettingByte(0, MODULE, "CheckDaily", options.check_daily ? 1 : 0);
+	DBWriteContactSettingByte(0, MODULE, "NoConfIdle", options.no_conf_idle ? 1 : 0);
+	DBWriteContactSettingByte(0, MODULE, "Backup", options.backup ? 1 : 0);
+	DBWriteContactSettingByte(0, MODULE, "UseXML", options.use_xml_backend ? 1 : 0);
+	DBWriteContactSettingByte(0, MODULE, "StartOffline", options.start_offline ? 1 : 0);
+	DBWriteContactSettingByte(0, MODULE, "PopupNotify", options.popup_notify ? 1 : 0);
+	DBWriteContactSettingByte(0, MODULE, "RestartMenuItem", options.restart_menu_item ? 1 : 0);
+	DBWriteContactSettingByte(0, MODULE, "UpdateAndExitMenuItem", options.update_and_exit_menu_item ? 1 : 0);
+	DBWriteContactSettingByte(0, MODULE, "VersionRequirement", (int)options.ver_req);
+	DBWriteContactSettingByte(0, MODULE, "SaveZips", (int)options.save_zips);
+	DBWriteContactSettingByte(0, MODULE, "AutoDLLOnly", options.auto_dll_only ? 1 : 0);
+
+	TCHAR mir_path[MAX_PATH];
+	GetModuleFileName(0, mir_path, MAX_PATH);
+	TCHAR *p = _tcsrchr(mir_path, _T('\\'));
+	if(p) *p = 0;
+	else {
+		p = _tcsrchr(mir_path, _T('/'));
+		if(p) *p = 0;
+	}
+
+	unsigned int mp_len = _tcslen(mir_path);
+
+	// remove mir_path from the front of folder names, so that profile can be moved
+	if(_tcslen(options.temp_folder) > mp_len && _tcsncmp(options.temp_folder, mir_path, mp_len) == 0) {
+		p = options.temp_folder + mp_len;
+		DBWriteString(0, MODULE, "TempFolder", p);
+	} else {
+		DBWriteString(0, MODULE, "TempFolder", options.temp_folder);
+	}
+
+	if(_tcslen(options.backup_folder) > mp_len && _tcsncmp(options.backup_folder, mir_path, mp_len) == 0) {
+		p = options.backup_folder + mp_len;
+		DBWriteString(0, MODULE, "BackupFolder", p);
+	} else {
+		DBWriteString(0, MODULE, "BackupFolder", options.backup_folder);
+	}
+
+	if(_tcslen(options.data_folder) > mp_len && _tcsncmp(options.data_folder, mir_path, mp_len) == 0) {
+		p = options.data_folder + mp_len;
+		DBWriteString(0, MODULE, "DataFolder", p);
+	} else {
+		DBWriteString(0, MODULE, "DataFolder", options.data_folder);
+	}
+
+	if(_tcslen(options.zip_folder) > mp_len && _tcsncmp(options.zip_folder, mir_path, mp_len) == 0) {
+		p = options.zip_folder + mp_len;
+		DBWriteString(0, MODULE, "ZipFolder", p);
+	} else {
+		DBWriteString(0, MODULE, "ZipFolder", options.zip_folder);
+	}
+}
+
+
diff --git a/updater/options.h b/updater/options.h
new file mode 100644
index 0000000..be6ef6a
--- /dev/null
+++ b/updater/options.h
@@ -0,0 +1,48 @@
+#ifndef _OPTIONS_INC
+#define _OPTIONS_INC
+
+#include "services.h"
+#include "icons.h"
+
+typedef enum {VR_MAJOR, VR_MINOR, VR_RELEASE, VR_BUILD} VersionRequirement;
+
+typedef struct Options_tag {
+	bool check_on_startup;
+	bool check_once;
+	bool check_daily;
+	bool no_conf_idle;
+	bool backup;
+	TCHAR temp_folder[MAX_PATH];
+	TCHAR backup_folder[MAX_PATH];
+	TCHAR data_folder[MAX_PATH];
+	bool use_xml_backend;
+	bool start_offline;
+	bool popup_notify;
+	bool set_colours;
+	bool restart_menu_item;
+	bool update_and_exit_menu_item;
+	COLORREF bkCol;
+	COLORREF textCol;
+	VersionRequirement ver_req;
+	bool save_zips;
+	bool auto_dll_only;
+	TCHAR zip_folder[MAX_PATH];
+} Options;
+
+extern Options options;
+
+extern HWND hwndOptions;
+
+#define WMU_CHECKING		(WM_USER + 41)
+#define WMU_DONECHECKING	(WM_USER + 42)
+
+
+int OptInit(WPARAM wParam, LPARAM lParam);
+
+void LoadOptions();
+void SaveOptions();
+
+// do this after icolib support has been handled
+void InitOptionsMenuItems();
+
+#endif
diff --git a/updater/popups.cpp b/updater/popups.cpp
new file mode 100644
index 0000000..cbf1529
--- /dev/null
+++ b/updater/popups.cpp
@@ -0,0 +1,281 @@
+#include "common.h"
+#include "popups.h"
+
+bool bPopupsEnabled = false;
+
+HWND hwndPop = 0;
+
+HANDLE hEventPop;
+bool pop_cancelled;
+
+LRESULT CALLBACK NullWindowProc( HWND hWnd, UINT message, WPARAM wParam, LPARAM lParam )
+{
+	switch( message ) {
+		case UM_INITPOPUP:
+			{
+				int flags = CallService(MS_POPUP_GETPLUGINDATA, (WPARAM)hWnd,0);
+				if(flags & POPFLAG_SAVEHWND) hwndPop = hWnd;
+			}
+			return 0;
+		case WMU_CLOSEPOP:
+			SetEvent(hEventPop);
+			PUDeletePopUp( hWnd );
+			return TRUE;
+
+		case WM_COMMAND:
+			{
+				int flags = CallService(MS_POPUP_GETPLUGINDATA, (WPARAM)hWnd,0);
+				if(flags & POPFLAG_SAVEHWND) pop_cancelled = false;
+			}
+			SetEvent(hEventPop);
+			PUDeletePopUp( hWnd );
+			return TRUE;
+
+		case WM_CONTEXTMENU:
+			{
+				int flags = CallService(MS_POPUP_GETPLUGINDATA, (WPARAM)hWnd,0);
+				if(flags & POPFLAG_SAVEHWND) pop_cancelled = true;
+			}
+			SetEvent(hEventPop);
+			PUDeletePopUp( hWnd );
+			return TRUE;
+
+		case UM_FREEPLUGINDATA: {
+			int flags = CallService(MS_POPUP_GETPLUGINDATA, (WPARAM)hWnd, 0);
+			if(flags & POPFLAG_SAVEHWND) hwndPop = 0;
+			return TRUE;
+		}
+	}
+
+	return DefWindowProc(hWnd, message, wParam, lParam);
+}
+
+void __stdcall sttPopupProcA( ULONG dwParam )
+{
+	POPUPDATAEX* ppd = ( POPUPDATAEX* )dwParam;
+
+	if ( ServiceExists(MS_POPUP_ADDPOPUPEX) )
+		CallService( MS_POPUP_ADDPOPUPEX, ( WPARAM )ppd, 0 );
+	else 
+		if ( ServiceExists(MS_POPUP_ADDPOPUP) )
+			CallService( MS_POPUP_ADDPOPUP, ( WPARAM )ppd, 0 );
+
+	free( ppd );
+}
+
+void __stdcall sttPopupProcW( ULONG dwParam )
+{
+	POPUPDATAW* ppd = ( POPUPDATAW* )dwParam;
+
+	if ( ServiceExists(MS_POPUP_ADDPOPUPW) )
+		CallService( MS_POPUP_ADDPOPUPW, ( WPARAM )ppd, 0 );
+
+	free( ppd );
+}
+
+void ShowPopupA( HANDLE hContact, const char* line1, const char* line2, int flags, int timeout )
+{
+	if(CallService(MS_SYSTEM_TERMINATED, 0, 0)) return;
+
+	if ( !ServiceExists( MS_POPUP_ADDPOPUP )) {	
+		char title[256];
+		sprintf(title, "%s Message", MODULE);
+
+		if(line1 && line2) {
+			char *message = new char[strlen(line1) + strlen(line2) + 2]; // newline and null terminator
+			sprintf(message, "%s\n%s", line1, line2);
+			MessageBoxA( NULL, message, title, MB_OK | MB_ICONINFORMATION );
+			delete message;
+		} else if(line1) {
+			MessageBoxA( NULL, line1, title, MB_OK | MB_ICONINFORMATION );
+		} else if(line2) {
+			MessageBoxA( NULL, line2, title, MB_OK | MB_ICONINFORMATION );
+		}
+		return;
+	}
+
+	SetEvent(hEventPop);
+	ResetEvent(hEventPop);
+
+	POPUPDATAEX* ppd = ( POPUPDATAEX* )malloc( sizeof( POPUPDATAEX ));
+	memset((void *)ppd, 0, sizeof(POPUPDATAEX));
+
+	ppd->lchContact = hContact;
+	ppd->lchIcon = hIconCheck;
+
+	if(line1 && line2) {
+		strcpy( ppd->lpzContactName, line1 );
+		strcpy( ppd->lpzText, line2 );
+	} else {
+		if(line1) {
+			strcpy( ppd->lpzText, line1 );
+		} else {
+			if(line2) 
+				strcpy( ppd->lpzText, line2 );
+		}
+	}
+
+	if(options.set_colours) {
+		ppd->colorBack = options.bkCol;
+		ppd->colorText = options.textCol;
+	} else {
+		//ppd->colorText = 0x00FFFFFF; // otherwise old popups are black on black
+		ppd->colorText = 0;
+		//ppd->colorBack = POPUP_USE_SKINNED_BG;
+		ppd->colorBack = 0;
+	}
+
+	ppd->iSeconds = timeout;
+
+	ppd->PluginWindowProc = ( WNDPROC )NullWindowProc;
+	ppd->PluginData = (void *)flags;
+
+	QueueUserAPC( sttPopupProcA , mainThread, ( ULONG )ppd );
+}
+
+void ShowPopupW( HANDLE hContact, const wchar_t* line1, const wchar_t* line2, int flags, int timeout )
+{
+	if(CallService(MS_SYSTEM_TERMINATED, 0, 0)) return;
+
+	if ( !ServiceExists( MS_POPUP_ADDPOPUPW )) {	
+		wchar_t title[256];
+		swprintf(title, L"%s Message", _T(MODULE));
+
+		if(line1 && line2) {
+			wchar_t *message = new wchar_t[wcslen(line1) + wcslen(line2) + 2]; // newline and null terminator
+			swprintf(message, L"%s\n%s", line1, line2);
+			MessageBoxW( NULL, message, title, MB_OK | MB_ICONINFORMATION );
+			delete message;
+		} else if(line1) {
+			MessageBoxW( NULL, line1, title, MB_OK | MB_ICONINFORMATION );
+		} else if(line2) {
+			MessageBoxW( NULL, line2, title, MB_OK | MB_ICONINFORMATION );
+		}
+		return;
+	}
+
+	SetEvent(hEventPop);
+	ResetEvent(hEventPop);
+
+	POPUPDATAW* ppd = ( POPUPDATAW* )malloc( sizeof( POPUPDATAW ));
+	memset((void *)ppd, 0, sizeof(POPUPDATAW));
+
+	ppd->lchContact = hContact;
+	ppd->lchIcon = hIconCheck;
+
+	if(line1 && line2) {
+		wcscpy( ppd->lpwzContactName, line1 );
+		wcscpy( ppd->lpwzText, line2 );
+	} else {
+		if(line1) {
+			wcscpy( ppd->lpwzText, line1 );
+		} else {
+			if(line2) 
+				wcscpy( ppd->lpwzText, line2 );
+		}
+	}
+
+	if(options.set_colours) {
+		ppd->colorBack = options.bkCol;
+		ppd->colorText = options.textCol;
+	} else {
+		//ppd->colorText = 0x00FFFFFF;
+		ppd->colorText = 0;
+		//ppd->colorBack = POPUP_USE_SKINNED_BG;
+		ppd->colorBack = 0;
+	}
+
+	ppd->iSeconds = timeout;
+
+	ppd->PluginWindowProc = ( WNDPROC )NullWindowProc;
+	ppd->PluginData = (void *)flags;
+
+	QueueUserAPC( sttPopupProcW , mainThread, ( ULONG )ppd );
+
+}
+
+void ShowWarning(TCHAR *msg) {
+	if(ServiceExists(MS_POPUP_SHOWMESSAGE)) {
+		TCHAR title[512];
+		_stprintf(title, _T("%s Warning"), _T(MODULE));
+		TCHAR message[1024];
+		_stprintf(message, _T("%s: %s"), _T(MODULE), msg);
+		ShowPopup(0, title, message, 0, 10);
+		//PUShowMessage(message, SM_WARNING);
+	} else {
+		TCHAR title[512];
+		_stprintf(title, _T("%s Warning"), MODULE);
+		MessageBox(0, msg, title, MB_OK | MB_ICONWARNING);
+	}
+}
+
+void ShowPopup(HANDLE hContact, const TCHAR *line1, const TCHAR *line2, int flags, int timeout) {
+#ifdef _UNICODE
+	if(ServiceExists(MS_POPUP_ADDPOPUPW))
+		ShowPopupW(hContact, line1, line2, flags, timeout);
+	else {
+		char *al1 = w2a(line1), *al2 = w2a(line2);
+		ShowPopupA(hContact, al1, al2, flags, timeout);
+		free(al1); free(al2);
+	}
+#else
+	if(ServiceExists(MS_POPUP_ADDPOPUP))
+		ShowPopupA(hContact, line1, line2, flags, timeout);
+	else {
+		wchar_t *wl1 = a2w(line1), *wl2 = a2w(line2);
+		ShowPopupW(hContact, wl1, wl2, flags, timeout);
+		free(wl1); free(wl2);
+	}
+#endif
+
+}
+
+void ShowError(TCHAR *msg) {
+	if(ServiceExists(MS_POPUP_SHOWMESSAGE)) {
+		TCHAR title[512];
+		_stprintf(title, _T("%s Error"), _T(MODULE));
+		TCHAR message[1024];
+		_stprintf(message, _T("%s: %s"), _T(MODULE), msg);
+		//PUShowMessage(message, SM_WARNING);
+		ShowPopup(0, title, message, 0, 10);
+	} else {
+		TCHAR title[512];
+		_stprintf(title, _T("%s Error"), _T(MODULE));
+		MessageBox(0, msg, title, MB_OK | MB_ICONERROR);
+	}
+}
+
+void ChangePopupText(HWND hwnd, TCHAR *text) {
+#ifdef _UNICODE
+	if(ServiceExists(MS_POPUP_CHANGETEXTW))
+		CallService(MS_POPUP_CHANGETEXTW, (WPARAM)hwnd, (LPARAM)text);
+	else {
+		char *atext = w2a(text);
+		CallService(MS_POPUP_CHANGETEXT, (WPARAM)hwnd, (LPARAM)atext);
+		free(atext);
+	}
+#else
+	if(ServiceExists(MS_POPUP_CHANGETEXT))
+		CallService(MS_POPUP_CHANGETEXT, (WPARAM)hwnd, (LPARAM)text);
+	else {
+		wchar_t *wtext = a2w(text);
+		CallService(MS_POPUP_CHANGETEXTW, (WPARAM)hwnd, (LPARAM)wtext);
+		free(wtext);
+	}
+#endif
+}
+
+bool ArePopupsEnabled() {
+	return bPopupsEnabled;
+}
+
+void InitPopups() {
+	bPopupsEnabled = (ServiceExists(MS_POPUP_ADDPOPUP) == 0 && ServiceExists(MS_POPUP_ADDPOPUPW) == 0 ? false : true);
+
+	hEventPop = CreateEvent( NULL, TRUE, FALSE, NULL );
+}
+
+void DeinitPopups() {
+	CloseHandle(hEventPop);
+}
+
diff --git a/updater/popups.h b/updater/popups.h
new file mode 100644
index 0000000..c389897
--- /dev/null
+++ b/updater/popups.h
@@ -0,0 +1,36 @@
+#ifndef _POPUPS_INC
+#define _POPUPS_INC
+
+#include <m_popup.h>
+//#include <m_popupw.h>
+
+#include "options.h"
+
+#include "str_utils.h"
+
+#include "icons.h"
+
+void InitPopups();
+void DeinitPopups();
+
+bool ArePopupsEnabled();
+
+void ShowPopupA(HANDLE hContact, const char* line1, const char* line2, int flags = 0, int timeout = 0);
+void ShowPopupW(HANDLE hContact, const wchar_t* line1, const wchar_t* line2, int flags = 0, int timeout = 0);
+
+void ShowPopup(HANDLE hContact, const TCHAR *line1, const TCHAR *line2, int flags = 0, int timeout = 0);
+
+void ShowWarning(TCHAR *msg);
+void ShowError(TCHAR *msg);
+
+void ChangePopupText(HWND hwnd, TCHAR *msg);
+
+extern HWND hwndPop;
+extern HANDLE hEventPop;
+extern bool pop_cancelled;
+
+#define WMU_CLOSEPOP	(WM_USER + 0x191)
+
+#define POPFLAG_SAVEHWND		0x01
+
+#endif
diff --git a/updater/progress_dialog.cpp b/updater/progress_dialog.cpp
new file mode 100644
index 0000000..bdcb922
--- /dev/null
+++ b/updater/progress_dialog.cpp
@@ -0,0 +1,140 @@
+#include "common.h"
+#include "progress_dialog.h"
+
+#define ID_PROGTIMER	101
+
+// message loop messages
+#define WMU_NEWPROGRESSWINDOW			(WM_USER + 0x200)
+#define WMU_KILLPROGRESSWINDOW			(WM_USER + 0x201)
+
+HWND hwndProgress = 0;
+//DWORD dwProgressThreadId = 0;
+unsigned int dwProgressThreadId = 0;
+HANDLE hProgSyncEvent = 0;
+
+BOOL CALLBACK DlgProcProgress(HWND hwndDlg, UINT msg, WPARAM wParam, LPARAM lParam) {
+	switch ( msg ) {
+	case WM_INITDIALOG:
+		TranslateDialogDefault( hwndDlg );
+		SetWindowLong(hwndDlg, GWL_USERDATA, 0);
+		// these change icons for all system dialogs!
+		//SetClassLong(hwndDlg, GCL_HICON, (LONG)hIconCheck);
+		//SetClassLong(hwndDlg, GCL_HICONSM, (LONG)hIconCheck);
+		SendMessage(hwndDlg, WM_SETICON, ICON_SMALL, (LPARAM)hIconCheck);
+		SendMessage(hwndDlg, WM_SETICON, ICON_BIG, (LPARAM)hIconCheck);
+
+		SAVEWINDOWPOS swp;
+		swp.hwnd=hwndDlg; swp.hContact=0; swp.szModule=MODULE; swp.szNamePrefix="ProgressWindow";
+		CallService(MS_UTILS_RESTOREWINDOWPOSITION, RWPF_NOSIZE | RWPF_NOACTIVATE, (LPARAM)&swp);
+
+		PostMessage(hwndDlg, WMU_SETPROGRESS, 0, 0);
+		return FALSE;
+	case WM_TIMER:
+		if(wParam == ID_PROGTIMER) {
+			TCHAR text[512];
+			GetDlgItemText(hwndDlg, IDC_PROGMSG, text, 512);
+			int len = _tcslen(text);
+			int pos = (int)GetWindowLong(hwndDlg, GWL_USERDATA);
+			if(len >= 3 && len < 511) {
+				pos = (pos + 1) % 4;
+				if(pos == 0)
+					text[len - 3] = 0;
+				else
+					_tcscat(text, _T("."));
+				SetDlgItemText(hwndDlg, IDC_PROGMSG, text);
+				SetWindowLong(hwndDlg, GWL_USERDATA, pos);
+			}
+			return TRUE;
+		}
+		break;
+	case WMU_SETMESSAGE:
+		KillTimer(hwndDlg, ID_PROGTIMER);
+		SetDlgItemText(hwndDlg, IDC_PROGMSG, (TCHAR *)wParam);
+		SetWindowLong(hwndDlg, GWL_USERDATA, 0);
+		SetTimer(hwndDlg, ID_PROGTIMER, (WPARAM)500, 0);
+		return TRUE;
+	case WMU_SETPROGRESS:
+		SendDlgItemMessage(hwndDlg, IDC_PROGRESS, PBM_SETPOS, wParam, 0);
+		{
+			TCHAR buff[512];
+			
+			_stprintf(buff, TranslateT("Progress - %d%%"), wParam);
+			SetWindowText(hwndDlg, buff);
+		}
+		return TRUE;
+
+	case WM_COMMAND:
+		return TRUE;	// disable esc, enter, etc
+
+	case WM_CLOSE:
+		PostThreadMessage(dwProgressThreadId, WMU_KILLPROGRESSWINDOW, 0, 0);
+		break;
+
+	case WM_DESTROY:
+		KillTimer(hwndDlg, ID_PROGTIMER);
+		Utils_SaveWindowPosition(hwndDlg,0,MODULE,"ProgressWindow");
+		break;
+	}
+	return FALSE;
+}
+
+//DWORD CALLBACK ProgressWindowThread(LPVOID param) {
+unsigned int CALLBACK ProgressWindowThread(void *param) {
+	CallService(MS_SYSTEM_THREAD_PUSH, 0, 0);
+
+	if(param) SetEvent((HANDLE)param);
+
+	MSG hwndMsg = {0};
+	while(GetMessage(&hwndMsg, 0, 0, 0) > 0 && !Miranda_Terminated()) {
+		switch(hwndMsg.message) {
+			case WMU_NEWPROGRESSWINDOW:
+				if(hwndProgress) DestroyWindow(hwndProgress);
+				hwndProgress = CreateDialog(hInst, MAKEINTRESOURCE(IDD_PROGRESS), 0, DlgProcProgress);	
+				SetWindowPos(hwndProgress, HWND_TOPMOST, 0, 0, 0, 0, SWP_NOMOVE | SWP_NOSIZE | SWP_NOACTIVATE | SWP_SHOWWINDOW);
+				//ShowWindow(hwndProgress, SW_SHOWNOACTIVATE);
+				UpdateWindow(hwndProgress);
+				if(param) SetEvent((HANDLE)param);
+				break;
+			case WMU_KILLPROGRESSWINDOW:
+				if(hwndProgress) {
+					DestroyWindow(hwndProgress);
+					hwndProgress = 0;
+				}
+				break;
+			default:
+				if(!IsDialogMessage(hwndProgress, &hwndMsg)) {
+					TranslateMessage(&hwndMsg);
+					DispatchMessage(&hwndMsg);
+				}
+				break;
+		}
+	}
+
+	if(hwndProgress) DestroyWindow(hwndProgress);
+	hwndProgress = 0;
+
+	CallService(MS_SYSTEM_THREAD_POP, 0, 0);
+	return 0;
+}
+
+void MakeProgressWindowThread() {
+	hProgSyncEvent = CreateEvent(0, 0, 0, 0);
+	CloseHandle((HANDLE)_beginthreadex(0, 0, ProgressWindowThread, hProgSyncEvent, 0, &dwProgressThreadId));
+	WaitForSingleObject(hProgSyncEvent, INFINITE);
+}
+
+
+void KillProgressWindowThread() {
+	PostThreadMessage(dwProgressThreadId, WM_QUIT, 0, 0);
+	CloseHandle(hProgSyncEvent);
+}
+
+void CreateProgressWindow() {
+	ResetEvent(hProgSyncEvent);
+	PostThreadMessage(dwProgressThreadId, WMU_NEWPROGRESSWINDOW, 0, 0);
+	WaitForSingleObject(hProgSyncEvent, INFINITE);
+}
+
+void ProgressWindowDone() {
+	PostThreadMessage(dwProgressThreadId, WMU_KILLPROGRESSWINDOW, 0, 0);
+}
diff --git a/updater/progress_dialog.h b/updater/progress_dialog.h
new file mode 100644
index 0000000..3081c52
--- /dev/null
+++ b/updater/progress_dialog.h
@@ -0,0 +1,16 @@
+#ifndef _PROGRESS_DIALOG_INC
+#define _PROGRESS_DIALOG_INC
+
+#include "icons.h"
+
+#define WMU_SETMESSAGE			(WM_USER + 0x140)		// wParam = char *msg
+#define WMU_SETPROGRESS			(WM_USER + 0x141)		// wParam = [1 to 100]
+
+extern HWND hwndProgress;
+void CreateProgressWindow();
+void ProgressWindowDone();
+
+void MakeProgressWindowThread();
+void KillProgressWindowThread();
+
+#endif
diff --git a/updater/resource.h b/updater/resource.h
new file mode 100644
index 0000000..d746d0c
--- /dev/null
+++ b/updater/resource.h
@@ -0,0 +1,61 @@
+//{{NO_DEPENDENCIES}}
+// Microsoft Visual C++ generated include file.
+// Used by updater.rc
+//
+#define IDD_DIALOG1                     101
+#define IDD_OPT1                        102
+#define IDI_MAINMENU                    104
+#define IDI_RESTART                     105
+#define IDD_CONFIRMUPDATES              106
+#define IDD_PROGRESS                    107
+#define IDD_CONFIRMCOMPONENTS           108
+#define IDD_OPT2                        109
+#define IDI_UPDATEANDEXIT               128
+#define IDC_BTN_RESTART                 1000
+#define IDC_CHK_ONSTART                 1001
+#define IDC_BTN_CHECK                   1002
+#define IDC_LIST_UPDATES                1002
+#define IDC_LST_REGISTERED              1003
+#define IDC_PROGRESS                    1004
+#define IDC_BTN_CHECKNORESTART          1004
+#define IDC_PROGMSG                     1005
+#define IDC_CHK_ONCE                    1006
+#define IDC_CHK_DAILY                   1007
+#define IDC_CHK_NOCONFIDLE              1008
+#define IDC_CHK_BACKUP                  1009
+#define IDC_CHK_DLLSONLY                1010
+#define IDC_CHK_CONFALL                 1012
+#define IDC_CHK_NOINSTALL               1013
+#define IDC_CHK_STARTOFFLINE            1013
+#define IDC_LIST_COMPONENTS             1014
+#define IDC_ED_UPDATES                  1016
+#define IDC_ED_DATA                     1017
+#define IDC_ED_BACKUPS                  1018
+#define IDC_BTN_BRUPDATES               1019
+#define IDC_BTN_BRDATA                  1020
+#define IDC_BTN_BRBACKUPS               1021
+#define IDC_CHK_POPUP                   1021
+#define IDC_CHK_RESTART                 1022
+#define IDC_ED_ZIPS                     1022
+#define IDC_CHK_UPDATEANDEXIT           1023
+#define IDC_BTN_BRZIPS                  1023
+#define IDC_SLID_VERREQ                 1024
+#define IDC_ST_VERREQ                   1025
+#define IDC_CHK_SAVEZIPS                1026
+#define IDC_ANIMATE1                    1027
+#define IDC_BTN_CHANGELOG               1028
+#define IDC_BTN_SELECTDLLS              1029
+#define IDC_BTN_SELECTDLLS2             1030
+#define IDC_BTN_SELECTINV               1030
+#define IDC_BTN_SELECTALL               1031
+
+// Next default values for new objects
+// 
+#ifdef APSTUDIO_INVOKED
+#ifndef APSTUDIO_READONLY_SYMBOLS
+#define _APS_NEXT_RESOURCE_VALUE        129
+#define _APS_NEXT_COMMAND_VALUE         40001
+#define _APS_NEXT_CONTROL_VALUE         1030
+#define _APS_NEXT_SYMED_VALUE           101
+#endif
+#endif
diff --git a/updater/resource.rc b/updater/resource.rc
new file mode 100644
index 0000000..e8b4ca6
--- /dev/null
+++ b/updater/resource.rc
@@ -0,0 +1,6 @@
+
+// this makes our dependencies work better
+#include "version.h"
+
+#include "updater.rc"
+#include "version.rc"
diff --git a/updater/restart.ico b/updater/restart.ico
new file mode 100644
index 0000000..d6a6a7b
--- /dev/null
+++ b/updater/restart.ico
diff --git a/updater/scan.cpp b/updater/scan.cpp
new file mode 100644
index 0000000..cab6cbc
--- /dev/null
+++ b/updater/scan.cpp
@@ -0,0 +1,388 @@
+#include "common.h"
+#include "scan.h"
+
+typedef PLUGININFO * (__cdecl * Miranda_Plugin_Info) ( DWORD mirandaVersion );
+
+typedef std::map<std::string, std::string> AlternateShortNameMap;
+
+AlternateShortNameMap alternate_shortname_map;
+
+void InitAlternateShortNameMap() {
+	alternate_shortname_map["Version Informations"] = "Version Information";
+	alternate_shortname_map["Jabber Protocol"] = "JabberG Protocol";
+	alternate_shortname_map["Jabber Protocol (Unicode)"] = "JabberG Protocol (Unicode)";
+	//alternate_shortname_map["PopUp Interoperability"] = "PopUp Plus"; - disabled since popup plus archive structure is incompatible
+	//alternate_shortname_map["Messaging Style Conversation"] = "nConvers++"; // will this conflict with other nConvers'?
+	alternate_shortname_map["MimQQ-libeva"] = "MirandaQQ (libeva Version)";
+	alternate_shortname_map["Icons Library Manager (Unicode)"] = "Icons library manager";
+}
+
+void ScanPlugins(FilenameMap *fn_map, UpdateList *update_list) {
+	if(!XMLDataAvailable(MC_PLUGINS)) return;
+
+	TCHAR mir_exe[MAX_PATH], plugins_folder[MAX_PATH],
+		dll_path[MAX_PATH];
+	TCHAR *dll_name;
+	Miranda_Plugin_Info dll_info_func;
+	DWORD mirandaVersion = (DWORD)CallService(MS_SYSTEM_GETVERSION, 0, 0);
+	PLUGININFO *pluginInfo;
+	HMODULE hModule;
+
+	GetModuleFileName(0, mir_exe, MAX_PATH);
+
+	// get plugin folder
+	_tcscpy(plugins_folder, mir_exe);
+	TCHAR *p = _tcsrchr(plugins_folder, _T('\\'));
+	if(p) *p = 0;
+	_tcscat(plugins_folder, _T("\\Plugins"));
+
+	_tcscpy(dll_path, plugins_folder);
+	_tcscat(dll_path, _T("\\"));
+	// set dll_name to point into the dll_path string, at the point where we can write the plugin name
+	// to end up with the full dll path
+	dll_name = dll_path + _tcslen(dll_path);
+
+	// add filemask
+	_tcscat(plugins_folder, _T("\\*.dll"));
+
+	WIN32_FIND_DATA findData;
+	HANDLE hFileSearch = FindFirstFile(plugins_folder, &findData);
+	int file_id;
+	if(hFileSearch != INVALID_HANDLE_VALUE) {
+		do {
+			_tcscpy(dll_name, findData.cFileName);
+			if(hModule = LoadLibrary(dll_path)) {
+				dll_info_func = (Miranda_Plugin_Info)GetProcAddress(hModule, "MirandaPluginInfo");
+				if(dll_info_func && (pluginInfo = dll_info_func(mirandaVersion))) {
+					
+					// *** This is a dodgy and unfair hack...
+					// In order to disable new plugins that may be unintentionally installed whith an update,
+					// updater will check for the 'plugindisabled' setting for each dll. The problem is that
+					// this setting may not be there for running plugins - and isn't there for new ones. So,
+					// we'll disable anything new when the setting isn't found anyway - but we write the
+					// value below for all plugins so that we can expect to find it
+					char *lowname = GetAString(findData.cFileName); strlwr(lowname);
+					if(DBGetContactSettingByte(0, "PluginDisable", lowname, 255) == 255) // setting not present
+						DBWriteContactSettingByte(0, "PluginDisable", lowname, 0);
+					free(lowname);
+
+					std::string shortName(pluginInfo->shortName);
+					AlternateShortNameMap::iterator i = alternate_shortname_map.find(shortName);
+					if(i != alternate_shortname_map.end()) {
+						if((file_id = FindFileID(i->second.c_str(), MC_PLUGINS, update_list)) != -1) {
+							RegisterForFileListing(file_id, i->second.c_str(), pluginInfo->version, true, MC_PLUGINS);
+							if(fn_map) (*fn_map)[file_id].push_back(findData.cFileName);
+						}
+					} else {
+						if((file_id = FindFileID(pluginInfo->shortName, MC_PLUGINS, update_list)) != -1) {
+							RegisterForFileListing(file_id, pluginInfo, true);
+							if(fn_map) (*fn_map)[file_id].push_back(findData.cFileName);
+						}
+					}
+				}
+				FreeLibrary(hModule);
+			}
+		} while(FindNextFile(hFileSearch, &findData));
+		FindClose(hFileSearch);
+	}
+}
+
+typedef struct LangpackData_tag {
+	DWORD version;
+	char *fl_name;
+} LangpackData;
+
+
+bool GetLangpackData(const TCHAR *filename, LangpackData *ld) {
+	
+#ifdef _UNICODE
+	char *temp_str = GetAString(filename);
+	//typedef std::char_traits<wchar_t> wchar_traits;
+	//typedef std::basic_ifstream<wchar_t, wchar_traits> wifstream;
+	//wifstream lp_file(temp_str);
+	std::wifstream lp_file(temp_str);
+	
+	free(temp_str);
+#else
+	std::ifstream lp_file(filename);
+#endif
+	char *conv;
+	if(lp_file.is_open()) {
+		STDString line;
+		while(!lp_file.eof()) {
+			std::getline(lp_file, line);
+			if(line.length() > 14 && _tcscmp(line.substr(0, 7).c_str(), _T("; FLID:")) == 0) {
+				size_t verpos = line.find_last_of(_T(' '));
+				conv = GetAString(line.substr(verpos + 1).c_str());
+				if(line.length() - verpos >= 7 && VersionFromString(conv, &ld->version)) {
+					free(conv);
+					// got valid version string, now get fl name
+					ld->fl_name = (char *)malloc(verpos - 8 + 1); // +1 for sz
+					conv = GetAString(line.substr(8).c_str());
+					strncpy(ld->fl_name, conv, verpos-8);
+					free(conv);
+					ld->fl_name[verpos - 8] = 0;
+					lp_file.close();
+					return true;
+				}
+				free(conv);
+			}
+		}
+
+		lp_file.close();
+		return false;
+	} else
+		return false;
+}
+
+void ScanLangpacks(FilenameMap *fn_map, UpdateList *update_list) {
+	if(!XMLDataAvailable(MC_LOCALIZATION)) return;
+
+	TCHAR mir_folder[MAX_PATH], langpack_path[MAX_PATH], *langpack_name;
+
+	GetModuleFileName(0, mir_folder, MAX_PATH);
+
+	// get program folder
+	TCHAR *p = _tcsrchr(mir_folder, _T('\\'));
+	if(p) *p = 0;
+	_tcscat(mir_folder, _T("\\"));
+
+	_tcscpy(langpack_path, mir_folder);
+
+	// set langpack_name to point into the langpack_name string, at the point where we can write the file name
+	// to end up with the full path
+	langpack_name = langpack_path + _tcslen(langpack_path);
+
+	// add filemask
+	_tcscat(mir_folder, _T("\\langpack_*.txt"));
+
+	WIN32_FIND_DATA findData;
+	HANDLE hFileSearch = FindFirstFile(mir_folder, &findData);
+	int file_id;
+	if(hFileSearch != INVALID_HANDLE_VALUE) {
+		do {
+			_tcscpy(langpack_name, findData.cFileName);
+			LangpackData ld = {0};
+			if(GetLangpackData(langpack_path, &ld)) {
+				if((file_id = FindFileID(ld.fl_name, MC_LOCALIZATION, update_list)) != -1) {
+					RegisterForFileListing(file_id, ld.fl_name, ld.version, true, MC_LOCALIZATION);
+					if(fn_map) (*fn_map)[file_id].push_back(findData.cFileName);
+				}
+
+				if(ld.fl_name) free(ld.fl_name);
+			}
+		} while(FindNextFile(hFileSearch, &findData));
+		FindClose(hFileSearch);
+	}
+}
+
+
+
+bool RearrangeDlls(char *shortName, STDStringList &filenames) {
+	bool dll_enabled = false;
+
+	char *lowname = _strdup(shortName); strlwr(lowname);
+	
+	TCHAR file_path[MAX_PATH], updates_folder[MAX_PATH], new_filename[MAX_PATH];
+	TCHAR *dll_name;
+	BYTE disabled_val;
+
+	Miranda_Plugin_Info dll_info_func;
+	DWORD mirandaVersion = (DWORD)CallService(MS_SYSTEM_GETVERSION, 0, 0);
+	PLUGININFO *pluginInfo;
+	HMODULE hModule;
+
+	_tcscpy(file_path, options.temp_folder);
+	_tcscat(file_path, _T("\\"));
+	// set dll_name to point into the file_path string, at the point where we can write the plugin name
+	// to end up with the full dll path
+	dll_name = file_path + _tcslen(file_path);
+
+	// add filemask
+	_tcscpy(updates_folder, options.temp_folder);
+	_tcscat(updates_folder, _T("\\*.dll"));
+
+	WIN32_FIND_DATA findData;
+	HANDLE hFileSearch = FindFirstFile(updates_folder, &findData);
+	if(hFileSearch != INVALID_HANDLE_VALUE) {
+		do {
+			_tcscpy(dll_name, findData.cFileName);
+			_tcslwr(findData.cFileName);
+
+			if(hModule = LoadLibrary(file_path)) {
+				dll_info_func = (Miranda_Plugin_Info)GetProcAddress(hModule, "MirandaPluginInfo");
+				if(dll_info_func && (pluginInfo = dll_info_func(mirandaVersion))) {
+					std::string strShortName(pluginInfo->shortName);
+					AlternateShortNameMap::iterator i = alternate_shortname_map.find(strShortName);
+					if(i != alternate_shortname_map.end())
+						strShortName = i->second;
+					//transform (strShortName.begin(),strShortName.end(), strShortName.begin(), tolower);
+					for(unsigned int st = 0; st < strShortName.length(); st++) strShortName[st] = tolower(strShortName[st]);
+					if(strShortName == lowname) {
+						bool moved = false;
+						STDString newname;
+						for(STDStringList::iterator j = filenames.begin(); j != filenames.end(); j++) {
+							_tcscpy(new_filename, options.temp_folder);
+							_tcscat(new_filename, _T("\\"));
+							_tcscat(new_filename, j->c_str());
+
+							for(unsigned int st = 0; st < j->length(); st++) j->operator[](st) = tolower(j->operator[](st));
+
+							// disable any new plugins (i.e. not installed before) that somehome got into the
+							// dowloaded archives (e.g. loadavatars comes with loadavatarsw - installing both is not good!)
+							char *temp_str = GetAString(j->c_str());
+							disabled_val = DBGetContactSettingByte(0, "PluginDisable", temp_str, 255);
+							if(disabled_val == 255) { // assume this means setting not in db (should be 1 or 0)
+								DBWriteContactSettingByte(0, "PluginDisable", temp_str, 1);
+								disabled_val = 1;
+							}
+							free(temp_str);
+
+							dll_enabled |= (disabled_val == 0);						
+
+							//MessageBox(0, new_filename, "New Filename", MB_OK);
+							if(!moved) {
+								if(_tcscmp(findData.cFileName, j->c_str()) != 0)
+									MoveFile(file_path, new_filename);
+								newname = new_filename;
+								moved = true;
+							} else {
+								//char msg[2048];
+								//sprintf(msg, "Copying %s to %s", newname.c_str(), new_filename);
+								//MessageBox(0, msg, "msg", MB_OK);
+								CopyFile(newname.c_str(), new_filename, FALSE);
+							}
+						}
+						FreeLibrary(hModule);
+						break;
+					}
+				} //else
+					//MessageBox(0, _T("Library does not contain Miranda PluginInfo function"), findData.cFileName, MB_OK);
+				FreeLibrary(hModule);
+			} //else
+				//MessageBox(0, _T("File not loadable as library"), findData.cFileName, MB_OK);
+		} while(FindNextFile(hFileSearch, &findData));
+		FindClose(hFileSearch);
+	}
+
+	// do exactly the same thing again, for the updates/plugins folder... :(
+
+	_tcscpy(file_path, options.temp_folder);
+	_tcscat(file_path, _T("\\Plugins\\"));
+	dll_name = file_path + _tcslen(file_path);
+
+	// add filemask
+	_tcscpy(updates_folder, options.temp_folder);
+	_tcscat(updates_folder, _T("\\Plugins\\*.dll"));
+
+	hFileSearch = FindFirstFile(updates_folder, &findData);
+	if(hFileSearch != INVALID_HANDLE_VALUE) {
+		do {
+			_tcscpy(dll_name, findData.cFileName);
+			_tcslwr(findData.cFileName);
+
+			if(hModule = LoadLibrary(file_path)) {
+				dll_info_func = (Miranda_Plugin_Info)GetProcAddress(hModule, "MirandaPluginInfo");
+				if(dll_info_func && (pluginInfo = dll_info_func(mirandaVersion))) {
+					std::string strShortName(pluginInfo->shortName);
+					AlternateShortNameMap::iterator i = alternate_shortname_map.find(strShortName);
+					if(i != alternate_shortname_map.end())
+						strShortName = i->second;
+					//transform (strShortName.begin(),strShortName.end(), strShortName.begin(), tolower);
+					for(unsigned int st = 0; st < strShortName.length(); st++) strShortName[st] = tolower(strShortName[st]);
+					if(strShortName == lowname) {
+						bool moved = false;
+						STDString newname;
+						for(STDStringList::iterator j = filenames.begin(); j != filenames.end(); j++) {
+							_tcscpy(new_filename, options.temp_folder);
+							_tcscat(new_filename, _T("\\Plugins\\"));
+							_tcscat(new_filename, j->c_str());
+
+							for(unsigned int st = 0; st < j->length(); st++) j->operator[](st) = tolower(j->operator[](st));
+
+							// disable any new plugins (i.e. not installed before) that somehome got into the
+							// dowloaded archives (e.g. loadavatars comes with loadavatarsw - installing both is not good!)
+							char *temp_str = GetAString(j->c_str());
+							disabled_val = DBGetContactSettingByte(0, "PluginDisable", temp_str, 255);
+							if(disabled_val == 255) { // assume this means setting not in db (should be 1 or 0)
+								DBWriteContactSettingByte(0, "PluginDisable", temp_str, 1);
+								disabled_val = 1;
+							}
+							free(temp_str);
+
+							dll_enabled |= (disabled_val == 0);						
+							
+							if(!moved) {
+								if(_tcscmp(findData.cFileName, j->c_str()) != 0)
+									MoveFile(file_path, new_filename);
+								newname = new_filename;
+								moved = true;
+							} else
+								CopyFile(newname.c_str(), new_filename, FALSE);
+						}
+						FreeLibrary(hModule);
+						break;
+					}
+				}
+				FreeLibrary(hModule);
+			}
+		} while(FindNextFile(hFileSearch, &findData));
+		FindClose(hFileSearch);
+	}
+
+	free(lowname);
+	return dll_enabled;
+}
+
+bool RearrangeLangpacks(char *shortName, STDStringList &filenames) {
+	char *lowname = _strdup(shortName); strlwr(lowname);
+	
+	TCHAR file_path[MAX_PATH], updates_folder[MAX_PATH], new_filename[MAX_PATH], *langpack_name;
+	// do exactly the same thing again, for the updates/plugins folder... :(
+
+	_tcscpy(file_path, options.temp_folder);
+	_tcscat(file_path, _T("\\"));
+	langpack_name = file_path + _tcslen(file_path);
+
+	// add filemask
+	_tcscpy(updates_folder, options.temp_folder);
+	_tcscat(updates_folder, _T("\\langpack_*.txt"));
+
+	WIN32_FIND_DATA findData;
+	HANDLE hFileSearch = FindFirstFile(updates_folder, &findData);
+	hFileSearch = FindFirstFile(updates_folder, &findData);
+	if(hFileSearch != INVALID_HANDLE_VALUE) {
+		do {
+			_tcscpy(langpack_name, findData.cFileName);
+
+			LangpackData ld = {0};
+			if(GetLangpackData(file_path, &ld)) {
+
+				std::string strShortName(ld.fl_name);
+				//transform (strShortName.begin(),strShortName.end(), strShortName.begin(), tolower);
+				for(unsigned int st = 0; st < strShortName.length(); st++) strShortName[st] = tolower(strShortName[st]);
+				if(strShortName == lowname) {
+					bool moved = false;
+					STDString newname;
+					for(STDStringList::iterator j = filenames.begin(); j != filenames.end(); j++) {
+						_tcscpy(new_filename, options.temp_folder);
+						_tcscat(new_filename, _T("\\"));
+						_tcscat(new_filename, j->c_str());
+						if(!moved) {
+							if(_tcscmp(findData.cFileName, j->c_str()) != 0)
+								MoveFile(file_path, new_filename);
+							newname = new_filename;
+							moved = true;
+						} else
+							CopyFile(newname.c_str(), new_filename, FALSE);
+					}
+					break;
+				}
+			}
+		} while(FindNextFile(hFileSearch, &findData));
+		FindClose(hFileSearch);
+	}
+
+	free(lowname);
+	return true;
+}
diff --git a/updater/scan.h b/updater/scan.h
new file mode 100644
index 0000000..0fc66ca
--- /dev/null
+++ b/updater/scan.h
@@ -0,0 +1,23 @@
+#ifndef _SCAN_INC
+#define _SCAN_INC
+
+#include "xmldata.h"
+#include "services.h"
+#include "utils.h"
+#include "allocations.h"
+#include "options.h"
+
+#include <fstream>
+
+void ScanPlugins(FilenameMap *fn_map, UpdateList *update_list);
+void ScanLangpacks(FilenameMap *fn_map, UpdateList *update_list);
+
+// returns true if any dll is not 'disabled' in db
+bool RearrangeDlls(char *shortName, STDStringList &filenames);
+
+bool RearrangeLangpacks(char *shortName, STDStringList &filenames);
+
+void InitAlternateShortNameMap();
+
+
+#endif
diff --git a/updater/services.cpp b/updater/services.cpp
new file mode 100644
index 0000000..8ba9de3
--- /dev/null
+++ b/updater/services.cpp
@@ -0,0 +1,842 @@
+#include "common.h"
+#include "services.h"
+
+UpdateList update_list;
+CRITICAL_SECTION list_cs;
+
+DWORD daily_timer_id = 0, startup_timer_id = 0;
+
+HANDLE hMainMenuItem, hGroupMenuItem;
+
+HANDLE hStartupDone = 0;
+
+bool checking = false;
+
+HANDLE hUpdateThread = 0;
+
+#define NUM_SERVICES		13
+HANDLE hService[NUM_SERVICES] = {0};
+
+VOID CALLBACK CheckTimerProcDaily(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime) {
+	if(options.check_daily)
+		CallService(MS_UPDATE_CHECKFORUPDATES, (WPARAM)(is_idle && options.no_conf_idle), 0);
+}
+
+
+// returns true if any downloaded dll is active
+bool DownloadUpdates(UpdateList *todo, FilenameMap *map, bool dlls_only) {
+
+	bool dll_enabled_or_langpack = false;
+
+	bool use_popup = options.popup_notify && ArePopupsEnabled();
+	
+	// iterate through the updates we need to check
+
+	if(use_popup) {
+		ShowPopup(0, TranslateT("Downloading Updates"), _T(""), POPFLAG_SAVEHWND, -1);
+	} else {
+		CreateProgressWindow();
+
+		PostMessage(hwndProgress, WM_SETTEXT, 0, (LPARAM)TranslateT("Progress - Downloading updates..."));
+		PostMessage(hwndProgress, WMU_SETMESSAGE, (WPARAM)TranslateT("Downloading"), 0);
+ 
+	}
+
+	int count = todo->size(), index = 0;
+	TCHAR msg[512];
+	TCHAR *temp_str;
+	bool a_download_succeeded = false;
+
+	for(todo->reset(); todo->current(); todo->next(), index++) {
+		// remember if the user has decided not to install this version
+		char stored_setting[256];
+		mir_snprintf(stored_setting, 256, "DisabledVer%s", todo->current()->update.szComponentName);
+		DBVARIANT dbv;
+		bool download = todo->current()->update_options.enabled;
+		if(!DBGetContactSetting(0, "Updater", stored_setting, &dbv)) {
+			if(dbv.pszVal && strcmp(dbv.pszVal, todo->current()->newVersion) == 0)
+				download = false;
+			else
+				DBDeleteContactSetting(0, "Updater", stored_setting);
+			DBFreeVariant(&dbv);
+		}
+
+		if(download) {
+			_stprintf(msg, TranslateT("Downloading plugin: %s"), TranslateTS(temp_str = GetTString(todo->current()->update.szComponentName)));
+			free(temp_str);
+		} else {
+			_stprintf(msg, TranslateT("Skipping plugin: %s"), TranslateTS(temp_str = GetTString(todo->current()->update.szComponentName)));
+			free(temp_str);
+		}
+
+		if(!use_popup) {
+			PostMessage(hwndProgress, WMU_SETMESSAGE, (WPARAM)msg, 0);
+			PostMessage(hwndProgress, WMU_SETPROGRESS, (WPARAM)(int)(index * 100.0 / count), 0);
+		} //else if(hwndPop) // disabled - just annoying
+			//ChangePopupText(hwndPop, msg);
+
+
+		if(download) {
+			bool got_file = false;
+			if(todo->current()->update_options.use_beta) {
+				// download from i->update.szBetaUpdateURL to temp folder
+				got_file = GetFile(todo->current()->update.szBetaUpdateURL, options.temp_folder, todo->current()->update.szComponentName, todo->current()->newVersion, dlls_only);
+			} else {
+				got_file = GetFile(todo->current()->update.szUpdateURL, options.temp_folder, todo->current()->update.szComponentName, todo->current()->newVersion, dlls_only);
+			}
+
+			if(got_file) {
+				a_download_succeeded = true;
+				if(todo->current()->file_id != -1) {
+					if(todo->current()->cat == MC_PLUGINS)
+						dll_enabled_or_langpack |= RearrangeDlls(todo->current()->shortName, (*map)[todo->current()->file_id]);
+					else if(todo->current()->cat == MC_LOCALIZATION) {
+						RearrangeLangpacks(todo->current()->shortName, (*map)[todo->current()->file_id]);
+						dll_enabled_or_langpack = true;
+					}
+				} else {
+					dll_enabled_or_langpack = true;
+				}
+			}
+		}
+
+		if(use_popup == false && hwndProgress == 0) {
+			RemoveFolder(options.temp_folder);
+			break; // user closed progress window - cancel
+		}
+	}
+	
+
+	if(!use_popup && hwndProgress) ProgressWindowDone();
+	// postmessage here causes a lockup on exit! bah popups!!
+	//if(hwndPop) PostMessage(hwndPop, WMU_CLOSEPOP, 0, 0);
+	if(hwndPop) SendMessage(hwndPop, WMU_CLOSEPOP, 0, 0);
+
+	if(!a_download_succeeded) {
+		for(todo->reset(); todo->current(); todo->next())
+			free(todo->current()->newVersion);
+		todo->clear();
+	}
+
+	return dll_enabled_or_langpack;
+}
+
+void __stdcall sttNotifyStartup( ULONG dwParam ) {
+	NotifyEventHooks(hStartupDone, 0, 0);
+}
+
+void RestoreStatus() {
+	//NotifyEventHooks(hStartupDone, 0, 0);
+	// do this in a seperate thread, in case we're called from an event hook to prevent double-lock on core hook critical section (csHooks)
+	QueueUserAPC(sttNotifyStartup, mainThread, 0);
+
+	if(options.start_offline) {
+		// restore global status - only works on startup since we remove the SavedGlobalStatus parameter
+		WORD clist_status = DBGetContactSettingWord(0, "CList", "Status", ID_STATUS_OFFLINE),
+			saved_global_status = DBGetContactSettingWord(0, MODULE, "SavedGlobalStatus", clist_status);
+		if(clist_status == ID_STATUS_OFFLINE && saved_global_status != clist_status) {
+#ifdef DEBUG_POPUPS
+			PUShowMessage("Updater: restoring status", SM_NOTIFY);
+#endif
+			CallService(MS_CLIST_SETSTATUSMODE, (WPARAM)saved_global_status, 0);		
+		}
+	}
+	DBDeleteContactSetting(0, MODULE, "SavedGlobalStatus");
+}
+
+bool WriteLastCheckTime() {
+	SYSTEMTIME now;
+	GetSystemTime(&now);
+
+	DBWriteContactSettingWord(0, MODULE, "LastUpdateDay", now.wDay);
+	DBWriteContactSettingWord(0, MODULE, "LastUpdateMonth", now.wMonth);
+	DBWriteContactSettingWord(0, MODULE, "LastUpdateYear", now.wYear);
+
+	return true;
+}
+
+//DWORD CALLBACK CheckForUpdatesWorker(LPVOID param) {
+unsigned int CALLBACK CheckForUpdatesWorker(void *param) {
+
+	if(checking) return 1;
+	if(!(GetSystemMetrics(SM_NETWORK) & 1)) {
+		ShowError(TranslateT("No network - aborting update check"));
+		NLog("worker thread aborting - no network");
+		return 1; // no network
+	}
+
+	NLog("CheckForUpdatesWorker thread starting");
+
+	checking = true;
+
+	WriteLastCheckTime();
+
+	bool confirm = !(((DWORD)param & 1) == 1);
+	bool restart = !(((DWORD)param & 2) == 2); // if restart is false, then we're doing an 'update and shutdown'
+
+	if(hwndOptions) PostMessage(hwndOptions, WMU_CHECKING, 0, 0);
+
+	bool use_popup = options.popup_notify && ArePopupsEnabled();
+	
+	FilenameMap fn_map;
+	
+	if(use_popup) {
+		ShowPopup(0, TranslateT("Checking for Updates"), _T(""), POPFLAG_SAVEHWND, -1);
+	} else {
+		CreateProgressWindow();
+
+		PostMessage(hwndProgress, WM_SETTEXT, 0, (LPARAM)TranslateT("Progress - Checking for updates..."));
+		if(options.use_xml_backend) PostMessage(hwndProgress, WMU_SETMESSAGE, (WPARAM)TranslateT("Downloading XML data"), 0);
+		else PostMessage(hwndProgress, WMU_SETMESSAGE, (WPARAM)TranslateT("Checking for updates"), 0);
+
+	}
+	
+	EnterCriticalSection(&list_cs);
+
+	if(options.use_xml_backend)	{
+		if(UpdateXMLData(MC_PLUGINS)) {// prevent double error messages (in some cases)
+			// iterate through the registered plugins
+			if(!use_popup) PostMessage(hwndProgress, WMU_SETMESSAGE, (WPARAM)TranslateT("Scanning plugins folder"), 0);
+			ScanPlugins(&fn_map, &update_list);
+
+			if(UpdateXMLData(MC_LOCALIZATION)) {
+				if(!use_popup) PostMessage(hwndProgress, WMU_SETMESSAGE, (WPARAM)TranslateT("Scanning language packs"), 0);
+				ScanLangpacks(&fn_map, &update_list);
+			}
+
+			if(!use_popup) PostMessage(hwndProgress, WMU_SETMESSAGE, (WPARAM)TranslateT("Updating component file listing ids"), 0);
+			UpdateFLIDs(update_list);
+		}
+
+		if(!use_popup) PostMessage(hwndProgress, WMU_SETMESSAGE, (WPARAM)TranslateT("Checking for updates"), 0);
+	}
+
+	UpdateList update_list2(update_list);
+	LeaveCriticalSection(&list_cs);
+
+	int count = update_list2.size(), index = 0;
+	TCHAR msg[512];
+	TCHAR *temp_str;
+
+	UpdateList todo;
+
+	for(update_list2.reset(); update_list2.current(); update_list2.next(), index++) {
+		if(update_list2.current()->update_options.enabled) {
+			_stprintf(msg, TranslateT("Checking plugin: %s"), TranslateTS(temp_str = GetTString(update_list2.current()->update.szComponentName)));
+			free(temp_str);
+		} else {
+			_stprintf(msg, TranslateT("Skipping plugin: %s"), TranslateTS(temp_str = GetTString(update_list2.current()->update.szComponentName)));
+			free(temp_str);
+		}
+
+		if(!use_popup) {
+			PostMessage(hwndProgress, WMU_SETMESSAGE, (WPARAM)msg, 0);
+			PostMessage(hwndProgress, WMU_SETPROGRESS, (WPARAM)(int)(index * 100.0 / count), 0);
+		} //else if(hwndPop) // disabled - just annoying
+			//ChangePopupText(hwndPop, msg);
+
+		if(update_list2.current()->update_options.enabled) {
+			char *nv;
+			bool beta;
+			if(nv = UpdateRequired(update_list2.current(), &beta)) {
+				todo.push_back(*update_list2.current());			
+				todo.back().newVersion = nv;
+				todo.back().update_options.use_beta = beta;
+			}
+		}
+		if(use_popup == false && hwndProgress == 0) {
+			RemoveFolder(options.temp_folder);
+			break; // user closed progress window - cancel
+		}
+	}
+
+	if(!use_popup && hwndProgress) ProgressWindowDone();
+	if(hwndPop) PostMessage(hwndPop, WMU_CLOSEPOP, 0, 0);
+	
+	if(options.use_xml_backend) {
+		FreeXMLData(MC_PLUGINS);
+		FreeXMLData(MC_LOCALIZATION);
+	}
+
+	bool restore_status = true;
+
+	if(todo.size()) {
+		int cd_ret = CD_OK;
+		if(confirm) {
+			if(use_popup) {
+				ShowPopup(0, TranslateT("Updates Available"), TranslateT("Click here to install"), POPFLAG_SAVEHWND, -1);
+				DWORD ret;
+				while((ret = WaitForSingleObject(hEventPop, 200)) == WAIT_TIMEOUT && !Miranda_Terminated());
+				if(!pop_cancelled && ret == WAIT_OBJECT_0 && !Miranda_Terminated()) {
+					cd_ret = DialogBoxParam(hInst, MAKEINTRESOURCE(IDD_CONFIRMUPDATES), GetDesktopWindow(), DlgProcConfirm, (LPARAM)&todo);
+				} else {
+					if(hwndOptions) PostMessage(hwndOptions, WMU_DONECHECKING, 0, 0);
+					RestoreStatus();
+					for(todo.reset(); todo.current(); todo.next())
+						free(todo.current()->newVersion);
+					checking = false;
+					return 1;
+				}
+			} else
+				cd_ret = DialogBoxParam(hInst, MAKEINTRESOURCE(IDD_CONFIRMUPDATES), GetDesktopWindow(), DlgProcConfirm, (LPARAM)&todo);
+		}
+
+
+
+		if(!confirm || cd_ret == CD_CONFALL || cd_ret == CD_NOINSTALL || cd_ret == CD_OK) {	
+
+			bool conf_all = (cd_ret == CD_CONFALL), no_install = (cd_ret == CD_NOINSTALL);
+
+			// ensure the backup folder exists (either create it or return non-zero signifying error)
+			if(options.backup && !CreatePath(options.backup_folder)) {
+				//MessageBox(0, Translate("Could not create backup folder"), Translate("Error"), MB_OK | MB_ICONERROR);
+				ShowError(TranslateT("Could not create backup folder"));
+				if(hwndOptions) PostMessage(hwndOptions, WMU_DONECHECKING, 0, 0);
+				RestoreStatus();
+				for(todo.reset(); todo.current(); todo.next())
+					free(todo.current()->newVersion);
+				checking = false;
+				return 1;
+			}
+
+			bool dll_enabled_or_langpack = DownloadUpdates(&todo, &fn_map, confirm ? false : options.auto_dll_only);
+			if(todo.size() && !no_install) {
+				if(!conf_all || DialogBox(hInst, MAKEINTRESOURCE(IDD_CONFIRMCOMPONENTS), GetDesktopWindow(), DlgProcConfirmComponents) == IDOK) {
+					if(!dll_enabled_or_langpack && restart) { 
+						// we're not doing an 'update and shutdown', and we're not updating any active dlls...so just install
+
+						// get folders
+						TCHAR root_folder[MAX_PATH], plugins_folder[MAX_PATH], *p;
+
+						GetModuleFileName(0, root_folder, MAX_PATH);
+						_tcscpy(plugins_folder, root_folder);
+						p = _tcsrchr(plugins_folder, '\\');
+						if(p) *p = 0;
+						_tcscat(plugins_folder, _T("\\Plugins"));
+
+						p = _tcsrchr(root_folder, _T('\\'));
+						if(p) *p = 0;
+						
+						// move files
+						MoveFiles(0, options.temp_folder, plugins_folder, options.backup_folder, root_folder);
+						
+						// rescan to get correct version numbers
+						ScanPlugins(0, 0);	
+					} else {
+						if(ExternProcess(restart) == 0) // if restarting, don't restore status
+							restore_status = false;
+					}
+				}
+			}
+		}
+
+		for(todo.reset(); todo.current(); todo.next())
+			free(todo.current()->newVersion);
+
+	} else if(!restart) {
+		HWND hWndMiranda = (HWND)CallService(MS_CLUI_GETHWND, 0, 0);
+		PostMessage(hWndMiranda, WM_COMMAND, ID_ICQ_EXIT, 0);
+	}	
+
+	if(restore_status && restart) { // restore status if we're not doing an 'update and shutdown', and the update was unsuccessful (or there was nothing to update, or no need to shutdown)
+		checking = false;
+		if(hwndOptions) PostMessage(hwndOptions, WMU_DONECHECKING, 0, 0);
+		RestoreStatus();
+	}
+	
+	return 0;
+}
+
+int Restart(WPARAM wParam, LPARAM lParam) {
+	ExternProcess(true);
+	return 0;
+}
+
+int UpdateAndExit(WPARAM wParam, LPARAM lParam) {
+	return CallService(MS_UPDATE_CHECKFORUPDATES, 0, 1);
+}
+
+// if wParam, don't confirm
+// if lParam, install and shutdown but don't restart
+int CheckForUpdates(WPARAM wParam, LPARAM lParam) {
+	if(daily_timer_id) KillTimer(0, daily_timer_id);
+	daily_timer_id = SetTimer(0, 0, 24 * 60 * 60 * 1000, CheckTimerProcDaily);
+
+	DWORD param = ((wParam ? 1 : 0) | (lParam ? 2 : 0));
+
+	if(hUpdateThread) CloseHandle(hUpdateThread);
+	//hUpdateThread = CreateThread(0, 0, CheckForUpdatesWorker, (void *)param, 0, 0);		
+	hUpdateThread = (HANDLE)_beginthreadex(0, 0, CheckForUpdatesWorker, (void *)param, 0, 0);		
+	NLog("CheckForUpdates service called");
+
+	return 0;
+}
+
+int EnumerateUpdates(WPARAM wParam, LPARAM lParam) {
+	UpdateEnumerateFunc func = (UpdateEnumerateFunc)wParam;
+
+	EnterCriticalSection(&list_cs);
+	for(update_list.reset(); update_list.current(); update_list.next()) {
+		func(update_list.current()->update.szComponentName, &(update_list.current()->update_options), lParam);
+	}
+	LeaveCriticalSection(&list_cs);
+
+	return 0;
+}
+
+void LoadUpdateOptions(char *szComponentName, UpdateOptions *update_options) {
+	char buff[256];
+	sprintf(buff, "Enable%s", szComponentName);
+	update_options->enabled = (DBGetContactSettingByte(0, MODULE, buff, 1) == 1);
+	if(!update_options->fixed) {
+		sprintf(buff, "UseBeta%s", szComponentName);
+		update_options->use_beta = (DBGetContactSettingByte(0, MODULE, buff, 0) == 1);
+	}
+}
+
+void SaveUpdateOptions(char *szComponentName, UpdateOptions *update_options) {
+	char buff[256];
+	sprintf(buff, "Enable%s", szComponentName);
+	DBWriteContactSettingByte(0, MODULE, buff, update_options->enabled ? 1 : 0);
+	if(!update_options->fixed) {
+		sprintf(buff, "UseBeta%s", szComponentName);
+		DBWriteContactSettingByte(0, MODULE, buff, update_options->use_beta ? 1 : 0);
+	}
+}
+
+int SetUpdateOptions(WPARAM wParam, LPARAM lParam) {
+	char *szComponentName = (char *)wParam;
+	UpdateOptions *uo = (UpdateOptions *)lParam;
+	TCHAR *temp1 = 0, *temp2 = 0;
+
+	bool found = false;
+	EnterCriticalSection(&list_cs);
+	for(update_list.reset(); update_list.current(); update_list.next()) {
+		if(strcmp(update_list.current()->update.szComponentName, szComponentName) == 0
+			|| _tcscmp(TranslateTS(temp1 = GetTString(update_list.current()->update.szComponentName)), (TCHAR *)szComponentName) == 0) // when set via options, szComponentName is translated and potentially already converted to unicode
+		{
+			found = true;
+			update_list.current()->update_options = *uo;
+			SaveUpdateOptions(update_list.current()->update.szComponentName, &update_list.current()->update_options);
+			if(update_list.current()->file_id == -1 && !uo->use_beta) {
+				update_list.current()->file_id = CheckForFileID(update_list.current()->update.szUpdateURL, update_list.current()->update.szVersionURL, update_list.current()->update.szComponentName);
+			}
+			break;
+		}
+	}
+	LeaveCriticalSection(&list_cs);
+	if(temp1) free(temp1);
+	if(temp2) free(temp2);
+
+	return found ? 0 : 1;
+}
+
+int GetUpdateOptions(WPARAM wParam, LPARAM lParam) {
+	char *szComponentName = (char *)wParam;
+	UpdateOptions *uo = (UpdateOptions *)lParam;
+	TCHAR *temp1 = 0, *temp2 = 0;
+
+	bool found = false;
+	EnterCriticalSection(&list_cs);
+	for(update_list.reset(); update_list.current(); update_list.next()) {
+		if(strcmp(update_list.current()->update.szComponentName, szComponentName) == 0
+			|| _tcscmp(TranslateTS(temp1 = GetTString(update_list.current()->update.szComponentName)), (TCHAR *)szComponentName) == 0) // when set via options, szComponentName is translated and potentially already converted to unicode
+		{
+			found = true;
+			*uo = update_list.current()->update_options;
+			break;
+		}
+	}
+	LeaveCriticalSection(&list_cs);
+	if(temp1) free(temp1);
+	if(temp2) free(temp2);
+
+	return found ? 0 : 1;
+}
+
+bool RegisterForFileListing(int file_id, PLUGININFO *pluginInfo, bool auto_register) {
+	return RegisterForFileListing(file_id, pluginInfo->shortName, pluginInfo->version, auto_register, MC_PLUGINS);
+}
+
+bool IsRegistered(int file_id) {
+	EnterCriticalSection(&list_cs);
+	for(update_list.reset(); update_list.current(); update_list.next()) {
+		if(update_list.current()->file_id == file_id) {
+			LeaveCriticalSection(&list_cs);
+			return true; // plugin already registered
+		}
+	}
+	LeaveCriticalSection(&list_cs);
+
+	return false;
+}
+
+bool RegisterForFileListing(int file_id, const char *fl_name, DWORD version, bool auto_register, const Category cat) {
+	// allow multiple registration of same plugin only if new plugin not automatically registered
+	// if multiple registration of an auto registered plugin occurs, use newest file id and version
+	EnterCriticalSection(&list_cs);
+	for(update_list.reset(); update_list.current(); update_list.next()) {
+		if(strcmp(update_list.current()->update.szComponentName, fl_name) == 0) {
+			if(!auto_register) {
+				update_list.erase();
+				break;
+			}
+			if(update_list.current()->auto_register) {
+				update_list.current()->file_id = file_id;		// in case plugin file id changes (i.e. scan from xml data will overwrite settings read from db on startup)
+				char version_str[16];
+				update_list.current()->update.pbVersion = (BYTE *)safe_strdup(CreateVersionString(version, version_str));
+				update_list.current()->update.cpbVersion = strlen(version_str);
+			}
+			LeaveCriticalSection(&list_cs);
+			
+			// plugin already registered - set file id if AUTOREGISTER
+			if(update_list.current()->update.szUpdateURL && strcmp(update_list.current()->update.szUpdateURL, UPDATER_AUTOREGISTER) == 0) {
+				update_list.current()->file_id = file_id;
+				char *buff = (char *)safe_alloc(strlen(MIM_DOWNLOAD_URL_PREFIX) + 9);
+				sprintf(buff, MIM_DOWNLOAD_URL_PREFIX "%d", file_id);
+				update_list.current()->update.szUpdateURL = buff;
+				update_list.current()->shortName = safe_strdup(update_list.current()->update.szComponentName);
+
+				if(update_list.current()->update.szBetaVersionURL) {
+					update_list.current()->update_options.fixed = false;
+					LoadUpdateOptions(update_list.current()->update.szComponentName, &update_list.current()->update_options);
+				}
+			}
+			return false;
+		}
+	}
+	LeaveCriticalSection(&list_cs);
+
+	UpdateInternal update_internal = {0};
+	char version_str[16];
+	char *buff;
+
+	update_internal.cat = cat;
+	update_internal.shortName = safe_strdup(fl_name);
+
+	update_internal.update.szComponentName = safe_strdup(fl_name);
+	update_internal.update.pbVersion = (BYTE *)safe_strdup(CreateVersionString(version, version_str));
+	update_internal.update.cpbVersion = strlen(version_str);
+
+	buff = (char *)safe_alloc(strlen(MIM_DOWNLOAD_URL_PREFIX) + 9);
+	sprintf(buff, MIM_DOWNLOAD_URL_PREFIX "%d", file_id);
+	update_internal.update.szUpdateURL = buff;
+
+	///////// only used when not using the xml backend ////////////	
+	buff = (char *)safe_alloc(strlen("class=\"fileNameHeader\">") + strlen(fl_name) + 2);
+	sprintf(buff, "class=\"fileNameHeader\">%s ", fl_name);
+	update_internal.update.pbVersionPrefix = (BYTE *)buff;
+	update_internal.update.cpbVersionPrefix = strlen(buff);
+
+	buff = (char *)safe_alloc(strlen(MIM_VIEW_URL_PREFIX) + 9);
+	sprintf(buff, MIM_VIEW_URL_PREFIX "%d", file_id);
+	update_internal.update.szVersionURL = buff;
+	///////////////////////////////////////////////////////////////
+
+	// same as register, except for fileID
+	update_internal.file_id = file_id;
+	update_internal.auto_register = auto_register;
+	update_internal.update_options.fixed = true;
+	update_internal.update_options.use_beta = false;
+
+	LoadUpdateOptions(update_internal.update.szComponentName, &update_internal.update_options);
+
+	EnterCriticalSection(&list_cs);
+	update_list.push_back(update_internal);
+	LeaveCriticalSection(&list_cs);
+
+	return true;
+}
+
+void DoStartupProcess() {
+	if(checking) return;
+
+	if(OldXMLDataExists(MC_PLUGINS) && OldXMLDataExists(MC_LOCALIZATION)) {
+		if(options.check_on_startup) {
+			SYSTEMTIME now;
+			GetSystemTime(&now);
+
+			if(options.check_once) {
+				if(DBGetContactSettingWord(0, MODULE, "LastUpdateDay", 32) == 32) {
+					CallService(MS_UPDATE_CHECKFORUPDATES, 0, 0);
+				} else {
+					if(now.wDay != DBGetContactSettingWord(0, MODULE, "LastUpdateDay", now.wDay)
+						|| now.wMonth != DBGetContactSettingWord(0, MODULE, "LastUpdateMonth", now.wMonth)
+						|| now.wYear != DBGetContactSettingWord(0, MODULE, "LastUpdateYear", now.wYear))
+					{
+						CallService(MS_UPDATE_CHECKFORUPDATES, 0, 0);
+					} else {
+						if(LoadOldXMLData(MC_PLUGINS, false)) {
+							ScanPlugins(0, 0);
+							FreeXMLData(MC_PLUGINS);
+						}
+						if(LoadOldXMLData(MC_LOCALIZATION, false)) {
+							ScanLangpacks(0, 0);
+							FreeXMLData(MC_LOCALIZATION);
+						}
+
+						RestoreStatus();
+					}
+				}
+			} else {
+				CallService(MS_UPDATE_CHECKFORUPDATES, 0, 0);
+			}
+		} else {
+			if(LoadOldXMLData(MC_PLUGINS, false)) {
+				ScanPlugins(0, 0);
+				FreeXMLData(MC_PLUGINS);
+			}
+			if(LoadOldXMLData(MC_LOCALIZATION, false)) {
+				ScanLangpacks(0, 0);
+				FreeXMLData(MC_LOCALIZATION);
+			}
+
+			RestoreStatus();
+		}
+	} else {
+		if(options.check_on_startup) CallService(MS_UPDATE_CHECKFORUPDATES, 0, 0);
+		else RestoreStatus();
+	}
+
+}
+
+
+int Register(WPARAM wParam, LPARAM lParam) {
+
+	Update *update = (Update *)lParam;
+	UpdateInternal update_internal = {0};
+
+	// remove registered plugin if already there
+	EnterCriticalSection(&list_cs);
+	for(update_list.reset(); update_list.current(); update_list.next()) {
+		if(strcmp(update_list.current()->update.szComponentName, update->szComponentName) == 0) {
+			update_list.erase();
+			break;
+		}
+	}
+	LeaveCriticalSection(&list_cs);
+
+	if(update->szComponentName == 0 || update->pbVersion == 0)
+		return 1;
+	if(update->szVersionURL == 0 && (update->szUpdateURL == 0 || strcmp(update->szUpdateURL, UPDATER_AUTOREGISTER) != 0) && update->szBetaVersionURL == 0) // both betas and normal updates disabled - complain
+		return 1;
+
+	update_internal.cat = MC_UNKNOWN;
+
+	// duplicate all the data...sigh
+	update_internal.update.szComponentName = safe_strdup(update->szComponentName);
+
+	if(update->szVersionURL) update_internal.update.szVersionURL = safe_strdup(update->szVersionURL);
+	if(update->szUpdateURL) update_internal.update.szUpdateURL = safe_strdup(update->szUpdateURL);
+
+	// if revision update url is from the fl, and we can find the file_id, use xml data if available
+	// otherwise set this to -1 to check url's specified
+	if(update_internal.update.szUpdateURL)
+		update_internal.file_id = CheckForFileID(update_internal.update.szUpdateURL, update_internal.update.szVersionURL, update_internal.update.szComponentName);
+	else
+		update_internal.file_id = -1;
+	
+	if(update_internal.file_id != -1) { // ensure correct format for file listing version string search data
+		char *buff = (char *)safe_alloc(strlen("class=\"fileNameHeader\">") + strlen(update->szComponentName) + 2);
+		sprintf(buff, "class=\"fileNameHeader\">%s ", update->szComponentName);
+		update_internal.update.pbVersionPrefix = (BYTE *)buff;
+		update_internal.update.cpbVersionPrefix = strlen(buff);
+
+		update_internal.shortName = safe_strdup(update->szComponentName);
+	} else {
+		if(update->pbVersionPrefix) update_internal.update.pbVersionPrefix = safe_bytedup(update->pbVersionPrefix, update->cpbVersionPrefix);
+		update_internal.update.cpbVersionPrefix = update->cpbVersionPrefix;
+	}
+
+	// leave beta alone
+	if(update->szBetaVersionURL) update_internal.update.szBetaVersionURL = safe_strdup(update->szBetaVersionURL);
+	if(update->pbBetaVersionPrefix) update_internal.update.pbBetaVersionPrefix = safe_bytedup(update->pbBetaVersionPrefix, update->cpbBetaVersionPrefix);
+	update_internal.update.cpbBetaVersionPrefix = update->cpbBetaVersionPrefix;
+	if(update->szBetaUpdateURL) update_internal.update.szBetaUpdateURL = safe_strdup(update->szBetaUpdateURL);
+
+	update_internal.update.pbVersion = safe_bytedup(update->pbVersion, update->cpbVersion);
+	update_internal.update.cpbVersion = update->cpbVersion;
+
+	if(update->cbSize > UPDATE_V1_SIZE && update->szBetaChangelogURL) 
+		update_internal.update.szBetaChangelogURL = safe_strdup(update->szBetaChangelogURL);
+
+	update_internal.update_options.fixed = (update->szVersionURL == 0 || strcmp(update->szUpdateURL, UPDATER_AUTOREGISTER) == 0 || update->szBetaVersionURL == 0); // set 'fixed' flag
+	update_internal.update_options.use_beta = (update->szVersionURL == 0 || strcmp(update->szUpdateURL, UPDATER_AUTOREGISTER) == 0);
+	LoadUpdateOptions(update_internal.update.szComponentName, &update_internal.update_options);
+
+	EnterCriticalSection(&list_cs);
+	update_list.push_back(update_internal);
+	LeaveCriticalSection(&list_cs);
+
+	//if(strcmp(update_internal.update.szComponentName, "My Details") == 0) {
+	//	MessageBox(0, "My Details registered", "msg", MB_OK);
+	//}
+
+	return 0;
+}
+
+int RegisterFL(WPARAM wParam, LPARAM lParam) {
+	int file_id = (int)wParam;
+	PLUGININFO *pluginInfo  = (PLUGININFO *)lParam;
+
+	// remove registered plugin if already there
+	EnterCriticalSection(&list_cs);
+	for(update_list.reset(); update_list.current(); update_list.next()) {
+		if(strcmp(update_list.current()->update.szComponentName, pluginInfo->shortName) == 0) {
+			update_list.erase();
+			break;
+		}
+	}
+	LeaveCriticalSection(&list_cs);
+
+	RegisterForFileListing(file_id, pluginInfo, false);
+
+	return 0;
+}
+
+int Unregister(WPARAM wParam, LPARAM lParam) {
+	char *szComponentName = (char *)lParam;
+
+	// remove registered plugin if found
+	EnterCriticalSection(&list_cs);
+	for(update_list.reset(); update_list.current(); update_list.next()) {
+		if(strcmp(update_list.current()->update.szComponentName, szComponentName) == 0) {
+			update_list.erase();
+			break;
+		}
+	}
+	LeaveCriticalSection(&list_cs);
+
+	return 0;
+}
+
+int CheckForUpdatesTrgr(WPARAM wParam, LPARAM lParam) {
+	if(wParam & ACT_PERFORM) {
+#ifdef DEBUG_POPUPS
+		PUShowMessage("Updater: triggered check", SM_NOTIFY);
+#endif
+		CallService(MS_UPDATE_CHECKFORUPDATES, (WPARAM)(is_idle && options.no_conf_idle), 0);
+	}
+	return 0;
+}
+
+int ServicesModulesLoaded2(WPARAM wParam, LPARAM lParam) {
+	// do initial update etc. depending on options and time
+	KillTimer(0, startup_timer_id);
+	DoStartupProcess();
+	return 0;
+}
+
+VOID CALLBACK StartupTimerProc(HWND hwnd, UINT uMsg, UINT_PTR idEvent, DWORD dwTime) {
+	KillTimer(0, startup_timer_id);
+	ServicesModulesLoaded2(0, 0);
+}
+
+HANDLE hEventServicesModulesLoaded2;
+
+int ServicesModulesLoaded(WPARAM wParam, LPARAM lParam) {
+	// add main menu item
+
+	CLISTMENUITEM menu = {0};
+
+	menu.cbSize=sizeof(menu);
+	menu.flags = CMIM_ALL;
+	menu.hIcon = hIconCheck;
+
+	menu.pszName = Translate("Check for updates");
+	menu.pszService= MS_UPDATE_CHECKFORUPDATES;
+	menu.position = 500010000;
+#ifdef MS_CLIST_ADDGROUPMENUITEM
+	if (ServiceExists(MS_CLIST_ADDGROUPMENUITEM)) {
+		GroupMenuParam gmp = {0};
+		hGroupMenuItem = (HANDLE)CallService(MS_CLIST_ADDGROUPMENUITEM,(WPARAM)&gmp,(LPARAM)&menu);
+	}
+#endif
+	hMainMenuItem = (HANDLE)CallService(MS_CLIST_ADDMAINMENUITEM,0,(LPARAM)&menu);
+
+	hEventServicesModulesLoaded2 = HookEvent(ME_SYSTEM_MODULESLOADED, ServicesModulesLoaded2);
+	startup_timer_id = SetTimer(0, 0, 5000, StartupTimerProc);
+
+	return 0;
+}
+
+int EnableStatusControl(WPARAM wParam, LPARAM lParam) {
+	BOOL enable = (BOOL)wParam;
+
+	options.start_offline = (enable == TRUE);
+
+	return 0;
+}
+
+int IsUpdateSupported(WPARAM wParam, LPARAM lParam) {
+	char *szComponentName = (char *)lParam;
+	EnterCriticalSection(&list_cs);
+	for(update_list.reset(); update_list.current(); update_list.next()) {
+		if(strcmp(update_list.current()->update.szComponentName, szComponentName) == 0) {
+			return TRUE;
+		}
+	}
+	LeaveCriticalSection(&list_cs);
+
+	return FALSE;
+}
+
+int ServicesPreShutdown(WPARAM wParam, LPARAM lParam) {
+	KillProgressWindowThread();
+	return 0;
+}
+
+HANDLE hEventPreShutDown, hEventServicesModulesLoaded;
+void InitServices() {
+	InitAlternateShortNameMap();
+	
+	InitializeCriticalSection(&list_cs);
+
+	int i = 0;
+	hService[i++] = CreateServiceFunction(MS_UPDATE_REGISTER, Register);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_REGISTERFL, RegisterFL);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_UNREGISTER, Unregister);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_CHECKFORUPDATESTRGR, CheckForUpdatesTrgr);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_CHECKFORUPDATES, CheckForUpdates);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_SETUPDATEOPTIONS, SetUpdateOptions);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_GETUPDATEOPTIONS, GetUpdateOptions);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_ENUMERATE, EnumerateUpdates);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_ENABLESTATUSCONTROL, EnableStatusControl);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_MENURESTART, Restart);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_MENUUPDATEANDEXIT, UpdateAndExit);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_MENUCHECKFORUPDATES, CheckForUpdates);
+	hService[i++] = CreateServiceFunction(MS_UPDATE_ISUPDATESUPPORTED, IsUpdateSupported);
+
+	hStartupDone = CreateHookableEvent(ME_UPDATE_STARTUPDONE);
+
+	hEventPreShutDown = HookEvent(ME_SYSTEM_PRESHUTDOWN, ServicesPreShutdown);
+
+	daily_timer_id = SetTimer(0, 0, 24 * 60 * 60 * 1000, CheckTimerProcDaily);
+
+	MakeProgressWindowThread();
+
+	hEventServicesModulesLoaded = HookEvent(ME_SYSTEM_MODULESLOADED, ServicesModulesLoaded);
+}
+
+void DeinitServices() {
+	UnhookEvent(hEventPreShutDown);
+	UnhookEvent(hEventServicesModulesLoaded);
+	UnhookEvent(hEventServicesModulesLoaded2);
+
+	if(daily_timer_id) KillTimer(0, daily_timer_id);
+
+	if(hUpdateThread) {
+		WaitForSingleObject(hUpdateThread, INFINITE);
+		CloseHandle(hUpdateThread);
+	}
+
+	DestroyHookableEvent(hStartupDone);
+
+	for(int i = 0; i < NUM_SERVICES; i++)
+		if(hService[i])
+			DestroyServiceFunction(hService[i]);
+
+	DeleteCriticalSection(&list_cs);
+	update_list.clear();
+}
+
diff --git a/updater/services.h b/updater/services.h
new file mode 100644
index 0000000..b239b89
--- /dev/null
+++ b/updater/services.h
@@ -0,0 +1,78 @@
+#ifndef _SERVICES_INC
+#define _SERVICES_INC
+
+#include "m_updater.h"
+#include "options.h"
+#include "xmldata.h"
+#include "conf_dialog.h"
+#include "conf_comp_dialog.h"
+#include "progress_dialog.h"
+#include "extern.h"
+#include "scan.h"
+#include "popups.h"
+
+#include "socket.h"
+#include "allocations.h"
+#include "utils.h"
+#include "updater.h"
+
+
+void RestoreStatus();
+
+int Register(WPARAM wParam, LPARAM lParam);
+
+////////////////////////////
+// used internally
+/////////////////////
+
+// used to create the 'Check for Updates' trigger action in triggerplugin
+#define MS_UPDATE_CHECKFORUPDATESTRGR			"Update/CheckForUpdatesTrigger"
+
+
+#define MS_UPDATE_CHECKFORUPDATES			"Update/CheckForUpdates"
+// wParam = (BOOL)don't confirm
+// lParam = (BOOL)don't restart after update
+// returns 1 if user cancels or there are no plugins to update, 0 otherwise (implies impending restart)
+int CheckForUpdates(WPARAM wParam, LPARAM lParam);
+
+#define MS_UPDATE_MENUCHECKFORUPDATES	"Update/MenuCheckForUpdates"
+__inline int MenuCheckForUpdates(WPARAM wParam, LPARAM lParam) {
+	return CheckForUpdates(0,0);
+}
+
+#define MS_UPDATE_MENURESTART			"Update/MenuRestart"
+int Restart(WPARAM wParam, LPARAM lParam);
+
+#define MS_UPDATE_MENUUPDATEANDEXIT		"Update/MenuUpdateAndExit"
+int UpdateAndExit(WPARAM wParam, LPARAM lParam);
+
+#define MS_UPDATE_SETUPDATEOPTIONS			"Update/SetUpdateOptions"
+// wParam = (char *)szComponentName
+// lParam = (UpdateOptions *)&update_options
+int SetUpdateOptions(WPARAM wParam, LPARAM lParam);
+
+#define MS_UPDATE_GETUPDATEOPTIONS			"Update/GetUpdateOptions"
+// wParam = (char *)szComponentName
+// lParam = (UpdateOptions *)&update_options
+int GetUpdateOptions(WPARAM wParam, LPARAM lParam);
+
+void LoadUpdateOptions(char *szComponentName, UpdateOptions *update_options);
+
+// callback function typedef for enumerating installed plugins with their associated options
+// (warning - critical section locked during this function call - so don't call other services or functions from this plugin that use the update list)
+typedef int (*UpdateEnumerateFunc)(char *szComonentName, UpdateOptions *update_options, LPARAM lParam);
+#define MS_UPDATE_ENUMERATE					"Update/EnumerateUpdates"
+// wParam = (UpdateEnumerateFunc)enum_func
+// lParam = lParam
+int EnumerateUpdates(WPARAM wParam, LPARAM lParam);
+////////////////////////////
+
+bool IsRegistered(int file_id);
+bool RegisterForFileListing(int file_id, PLUGININFO *pluginInfo, bool auto_register);
+bool RegisterForFileListing(int file_id, const char *fl_name, DWORD version, bool auto_register, const Category cat);
+
+void InitServices();
+void PreDeinitServices();
+void DeinitServices();
+
+#endif
diff --git a/updater/socket.cpp b/updater/socket.cpp
new file mode 100644
index 0000000..9a609e6
--- /dev/null
+++ b/updater/socket.cpp
@@ -0,0 +1,397 @@
+#include "common.h"
+#include "socket.h"
+
+/*
+#include <string>
+
+typedef struct SettingsProcEnumParam_tag {
+	int file_id;
+	std::list<std::string> *list;
+	char *current_filename;
+	char *temp_folder;
+} SettingsProcEnumParam;
+
+int SettingsEnumProc(const char *szSetting,LPARAM lParam) {
+	SettingsProcEnumParam *param = (SettingsProcEnumParam *)lParam;
+
+	if(strcmp(szSetting, param->current_filename) != 0) {
+		int file_id = DBGetContactSettingDword(0, MODULE, szSetting, -1);
+		if(file_id == param->file_id) {
+			std::string new_file_name(param->temp_folder);
+			new_file_name += "\\";
+			new_file_name += szSetting;
+			param->list->push_back(new_file_name);
+		}
+	}
+
+	return 0;
+}
+*/
+
+
+void ShowAndLogError(TCHAR *message) {
+}
+
+bool GetFile(char *url, TCHAR *temp_folder, char *plugin_name, char *version, bool dlls_only, int recurse_count /*=0*/) {
+	if(recurse_count > MAX_REDIRECT_RECURSE) {
+		NLog("GetFile: error, too many redirects");
+		return false;
+	}
+
+	TCHAR save_file[MAX_PATH];
+
+	if(url == 0 || temp_folder == 0 || plugin_name == 0)
+		return false;
+
+	// ensure temp_folder exists
+	if(!CreatePath(options.temp_folder)) {
+		DWORD err = GetLastError();
+		char buff[128];
+		sprintf(buff, "GetFile: error creating temp folder, code %d", (unsigned)err);
+		NLog(buff);
+		return false;
+	}
+
+	// ensure zip_folder exists, if necessary
+	if(options.save_zips && !CreatePath(options.zip_folder)) {
+		DWORD err = GetLastError();
+		char buff[128];
+		sprintf(buff, "GetFile: error creating zip folder, code %d", (unsigned)err);
+		NLog(buff);
+		return false;
+	}
+
+	_tcscpy(save_file, temp_folder);
+	_tcscat(save_file, _T("\\"));
+	TCHAR *temp_str = GetTString(plugin_name);
+	_tcscat(save_file, temp_str);
+	free(temp_str);
+	if(version) {
+		temp_str = GetTString(version);
+		_tcscat(save_file, _T("_"));
+		_tcscat(save_file, temp_str);
+		free(temp_str);
+	}
+	// copt extension from url
+	char *ext = strrchr(url, '.');
+	if(ext && *ext && strcmp(ext, ".dll") == 0) {
+		_tcscat(save_file, _T(".dll"));
+	} else { // default to zip extension (e.g. miranda fl)
+		_tcscat(save_file, _T(".zip"));
+		ext = ".zip";
+	}
+
+	NETLIBHTTPREQUEST req = {0};
+
+	req.cbSize = sizeof(req);
+	req.requestType = REQUEST_GET;
+	req.szUrl = url;
+	req.flags = 0;
+
+	NETLIBHTTPREQUEST *resp = (NETLIBHTTPREQUEST *)CallService(MS_NETLIB_HTTPTRANSACTION, (WPARAM)hNetlibUser, (LPARAM)&req);
+
+	if(resp) {
+		if(resp->resultCode == 200) {
+			HANDLE hSaveFile = CreateFile(save_file, GENERIC_WRITE, FILE_SHARE_WRITE, 0, CREATE_ALWAYS, FILE_ATTRIBUTE_NORMAL, 0);
+			if(hSaveFile != INVALID_HANDLE_VALUE) {
+				unsigned long bytes_written = 0;
+				if(WriteFile(hSaveFile, resp->pData, resp->dataLength, &bytes_written, NULL) == TRUE) {
+					CloseHandle(hSaveFile);
+					CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+					resp = 0;
+
+					if(ext && *ext && strcmp(ext, ".zip") == 0) {
+
+						char *ans_save_file = GetAString(save_file), *ans_temp_folder = GetAString(temp_folder);
+						//MessageBoxA(0, ans_temp_folder, ans_save_file, MB_OK);
+						unzip_file(ans_save_file, ans_temp_folder); 
+						free(ans_save_file);
+						free(ans_temp_folder);
+												
+						if(options.save_zips) {
+							TCHAR save_archive[MAX_PATH];
+							_tcscpy(save_archive, options.zip_folder);
+							_tcscat(save_archive, _T("\\"));
+							_tcscat(save_archive, save_file + _tcslen(temp_folder) + 1);
+
+							DeleteFile(save_archive);
+							if(!MoveFile(save_file, save_archive)) {
+								char buff[128];
+								sprintf(buff, "GetFile: could not move file, code: %d", (unsigned)GetLastError());
+								NLog(buff);
+								if(!DeleteFile(save_file)) {
+									char buff[128];
+									sprintf(buff, "GetFile: error deleting file, code: %d", (unsigned)GetLastError());
+									NLog(buff);
+								}
+							}
+
+						} else {
+							if(!DeleteFile(save_file)) {
+								char buff[128];
+								sprintf(buff, "GetFile: error deleting file, code: %d", (unsigned)GetLastError());
+								NLog(buff);
+							}
+						}
+						
+						if(dlls_only) {
+							NLog("Deleting non-dlls");
+							DeleteNonDlls(temp_folder);
+						}
+
+					}
+					return true;
+
+				} else {
+					char buff[128];
+					sprintf(buff, "GetFile: error writing file, code %d", (unsigned)GetLastError());
+					NLog(buff);
+				}
+				CloseHandle(hSaveFile);
+			} else {
+				char buff[128];
+				sprintf(buff, "GetFile: error creating file, code %d", (unsigned)GetLastError());
+				NLog(buff);
+			}
+		} else if(resp->resultCode >= 300 && resp->resultCode < 400) {
+			// get new location
+			bool ret = false;
+			for(int i = 0; i < resp->headersCount; i++) {
+				//MessageBox(0, resp->headers[i].szValue, resp->headers[i].szName, MB_OK);
+				if(strcmp(resp->headers[i].szName, "Location") == 0) {
+					ret = GetFile(resp->headers[i].szValue, temp_folder, plugin_name, version, dlls_only, recurse_count + 1);
+					break;
+				}
+			}
+			CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+			resp = 0;
+			return ret;
+		} else {
+			TCHAR buff[1024];
+			_stprintf(buff, TranslateT("Failed to download \"%s\" - Invalid response, code %d"), plugin_name, resp->resultCode);
+
+			ShowError(buff);
+			char *ts = GetAString(buff);
+			NLog(ts);
+			free(ts);
+
+		}
+		CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+		resp = 0;
+	} else {
+		int err = GetLastError();
+		if(err) {
+			TCHAR buff[1024];
+			_stprintf(buff, TranslateT("Failed to download \"%s\": "), plugin_name);
+			int len = _tcslen(buff);
+			FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM, 0, err, 0, buff + len, 512 - len, 0);
+
+			ShowError(buff);
+			char *ts = GetAString(buff);
+			NLog(ts);
+			free(ts);
+		}
+	}
+
+	return false;
+}
+
+char *CheckVersionURL(char *url, BYTE *pbPrefixBytes, int cpbPrefixBytes, BYTE *pbVersionBytes, int cpbVersionBytes) {
+
+	/*
+	bool check = false;
+
+	if(strncmp((char *)pbPrefixBytes, "My Details ", cpbPrefixBytes) == 0) {
+		//MessageBox(0, "Checking version URL", "Updater -> My Details", MB_OK);
+		check = true;
+	}
+	*/
+
+	if(url == 0 || pbPrefixBytes == 0 || cpbPrefixBytes == 0 || pbVersionBytes == 0 || cpbVersionBytes == 0)
+		return 0;
+
+	/*
+	if(check) {
+		MessageBox(0, "Real URL check", "CheckVersionURL", MB_OK);
+		MessageBox(0, url, "URL", MB_OK);
+		MessageBox(0, (char *)pbPrefixBytes, "Prefix", MB_OK);
+		MessageBox(0, (char *)pbVersionBytes, "Version", MB_OK);
+	}
+	*/
+
+	NETLIBHTTPREQUEST req = {0};
+
+	req.cbSize = sizeof(req);
+	req.requestType = REQUEST_GET;
+	req.szUrl = url;
+	req.flags = NLHRF_DUMPASTEXT; //NLHRF_SMARTREMOVEHOST | NLHRF_SMARTAUTHHEADER;
+
+	NETLIBHTTPREQUEST *resp = (NETLIBHTTPREQUEST_tag *)CallService(MS_NETLIB_HTTPTRANSACTION, (WPARAM)hNetlibUser, (LPARAM)&req);
+
+	if(resp) {
+		if(resp->resultCode == 200) {
+			// find the location of the prefix
+			int index, index2;
+			for(int i = 0; i < resp->dataLength; i++) {
+				index =  0;
+				while(index < cpbPrefixBytes && i + index < resp->dataLength && (BYTE)resp->pData[i + index] == pbPrefixBytes[index]) index++;
+				if(index == cpbPrefixBytes) {
+					// we found the prefix - now compare the following bytes
+					// i + index the first byte after the prefix
+					index2 = 0;
+					while(index2 + i + index < resp->dataLength && index2 < cpbVersionBytes && resp->pData[i + index + index2] == pbVersionBytes[index2]) index2++;
+					if(index2 == cpbVersionBytes) {
+						// same version as current
+						//if(check)
+							//MessageBox(0, "same version", "check url", MB_OK);
+						CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+						resp = 0;
+						return 0;
+					} else {
+						DWORD ver_current, ver_potential;
+						char *buff = (char *)malloc(cpbVersionBytes + 1);
+						strncpy(buff, (char *)pbVersionBytes, cpbVersionBytes);
+						buff[cpbVersionBytes] = 0;
+
+						// this is safe because pData finishes with a zero always (according to m_netlib.h docs)
+						if(VersionFromString(buff, &ver_current) && VersionFromString(&resp->pData[i + index], &ver_potential)) 
+						{
+							switch(options.ver_req) {
+							case VR_MAJOR:
+								ver_current &= 0xFF000000;
+								ver_potential &= 0xFF000000;
+								break;
+							case VR_MINOR:
+								ver_current &= 0xFFFF0000;
+								ver_potential &= 0xFFFF0000;
+								break;
+							case VR_RELEASE:
+								ver_current &= 0xFFFFFF00;
+								ver_potential &= 0xFFFFFF00;
+								break;
+							case VR_BUILD:
+								break;
+							}
+							//if(check) MessageBox(0, (char *)resp->pData[i + index], buff, MB_OK);
+							free(buff);
+							CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+							resp = 0;
+							// we can covert the versions to DWORDS, so compare...
+							if(ver_current < ver_potential) {
+								char buff2[16];
+								CreateVersionString(ver_potential, buff2);
+								return _strdup(buff2);
+							} else
+								return 0;
+						} else { // invalid version(s), but different from current - assume it's an update
+							free(buff);
+							CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+							resp = 0;
+							return _strdup(Translate("Yes"));
+						}
+					}
+				}
+			}
+		} else if(resp->resultCode == 302) { // redirect
+			char *ret = 0;
+			// get new location
+			for(int i = 0; i < resp->headersCount; i++) {
+				//MessageBox(0, resp->headers[i].szValue, resp->headers[i].szName, MB_OK);
+				if(strcmp(resp->headers[i].szName, "Location") == 0) {
+					ret = CheckVersionURL(resp->headers[i].szValue, pbPrefixBytes, cpbPrefixBytes, pbVersionBytes, cpbVersionBytes);
+					break;
+				}
+			}
+			CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+			resp = 0;
+
+			return ret;
+		} else {
+			char buff[128];
+			sprintf(buff, "CheckVersionURL: error, http result code %d", resp->resultCode);
+			NLog(buff);
+		}
+		CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+		resp = 0;
+	} else {
+		int err = GetLastError();
+		if(err) {
+			char buff[128];
+			sprintf(buff, "CheckVersionURL: error code %d", err);
+			NLog(buff);
+			return 0;
+		}
+	}
+
+	return 0;
+}
+
+char *UpdateRequired(UpdateInternal *update_internal, bool *beta) {
+	// determine whether update is required
+
+	char *ret = 0, *ret_beta = 0;
+
+	if(options.use_xml_backend && update_internal->file_id != -1) {
+		if(update_internal->cat == MC_UNKNOWN) {
+			if(XMLDataAvailable(MC_PLUGINS) 
+				&& (ret = FindVersion(update_internal->file_id, update_internal->update.pbVersion, update_internal->update.cpbVersion, MC_PLUGINS)))
+			{
+				update_internal->cat = MC_PLUGINS;
+				if(strcmp(ret, "same") == 0) {
+					free(ret);
+					ret = 0;
+				}
+			} else if(XMLDataAvailable(MC_LOCALIZATION) 
+				&& (ret = FindVersion(update_internal->file_id, update_internal->update.pbVersion, update_internal->update.cpbVersion, MC_LOCALIZATION)))
+			{
+				update_internal->cat = MC_LOCALIZATION;
+				if(strcmp(ret, "same") == 0) {
+					free(ret);
+					ret =  0;
+				}
+			}
+		} else {
+			ret = FindVersion(update_internal->file_id, update_internal->update.pbVersion, update_internal->update.cpbVersion, update_internal->cat);
+			if(ret && strcmp(ret, "same") == 0) {
+				free(ret);
+				ret = 0;
+			}
+		}
+	} else {
+		ret = CheckVersionURL(update_internal->update.szVersionURL, update_internal->update.pbVersionPrefix,
+			update_internal->update.cpbVersionPrefix, update_internal->update.pbVersion, update_internal->update.cpbVersion);
+	}
+
+	if(update_internal->update_options.use_beta) {
+		ret_beta = CheckVersionURL(update_internal->update.szBetaVersionURL, update_internal->update.pbBetaVersionPrefix,
+			update_internal->update.cpbBetaVersionPrefix, update_internal->update.pbVersion, update_internal->update.cpbVersion);
+	}
+
+	if(ret && !ret_beta) {
+		if(beta) *beta = false;
+		return ret;
+	} else if(!ret && ret_beta) {
+		if(beta) *beta = true;
+		return ret_beta;
+	} else if(ret && ret_beta) {
+		// find highest version of ret and ret_beta
+
+		//MessageBox(0, ret, ret_beta, MB_OK);
+
+		DWORD vRet, vRetBeta;
+		VersionFromString(ret, &vRet);
+		VersionFromString(ret_beta, &vRetBeta);
+
+		if(vRetBeta > vRet) {
+			free(ret);
+			if(beta) *beta = true;
+			return ret_beta;
+		} else {
+			free(ret_beta);
+			if(beta) *beta = false;
+			return ret;
+		}
+	}
+
+	return 0;
+}
diff --git a/updater/socket.h b/updater/socket.h
new file mode 100644
index 0000000..7c5aadb
--- /dev/null
+++ b/updater/socket.h
@@ -0,0 +1,22 @@
+#ifndef _SOCKET_INC
+#define _SOCKET_INC
+
+#include "services.h"
+#include "options.h"
+#include "xmldata.h"
+#include "popups.h"
+
+
+#include "zlib123/contrib/minizip/munzip.h"
+
+// gets a file from a url, puts in in the temp_folder and names it after the plugin_name (same extension as url)
+// it will automatically unzip a zip file, putting the contents in the temp_folder and using the names from the archive
+// if it unzips the file, the zip archive is removed afterward
+bool GetFile(char *url, TCHAR *temp_folder, char *plugin_name, char *version, bool dlls_only, int recurse_count = 0);
+
+// check the xml backend data or version URL (depending on whether the plugin is on the file listing) to see if we need an update
+// returns new version string (which you must free) and sets beta to indicate where update should be retreived from (i.e. if
+// beta url is enabled, will return true in beta unless the non-beta version is higher)
+char *UpdateRequired(UpdateInternal *update_internal, bool *beta);
+
+#endif
diff --git a/updater/str_utils.cpp b/updater/str_utils.cpp
new file mode 100644
index 0000000..cadb7b8
--- /dev/null
+++ b/updater/str_utils.cpp
@@ -0,0 +1,99 @@
+#include "common.h"
+#include "str_utils.h"
+
+int code_page = CP_ACP;
+
+void set_codepage() {
+	if(ServiceExists(MS_LANGPACK_GETCODEPAGE))
+		code_page = CallService(MS_LANGPACK_GETCODEPAGE, 0, 0);
+}
+
+char *w2u(const wchar_t *ws) {
+	if(ws) {
+		int size = WideCharToMultiByte(CP_UTF8, 0, ws, -1, 0, 0, 0, 0);
+		char *buff = (char *)malloc(size);
+		WideCharToMultiByte(CP_UTF8, 0, ws, -1, buff, 2048, 0, 0);
+		return buff;
+	} else 
+		return 0;
+}
+
+wchar_t *u2w(const char *utfs) {
+	if(utfs) {
+		int size = MultiByteToWideChar(CP_UTF8, 0, utfs, -1, 0, 0);
+		wchar_t *buff = (wchar_t *)malloc(size * sizeof(wchar_t));
+		MultiByteToWideChar(CP_UTF8, 0, utfs, -1, buff, size);
+		return buff;
+	} else
+		return 0;
+}
+
+wchar_t *a2w(const char *as) {
+	int code_page = CP_ACP;
+	if(ServiceExists(MS_LANGPACK_GETCODEPAGE)) code_page = CallService(MS_LANGPACK_GETCODEPAGE, 0, 0);
+	int size = MultiByteToWideChar(code_page, 0, as, -1, 0, 0);
+	wchar_t *buff = (wchar_t *)malloc(size * sizeof(wchar_t));
+	MultiByteToWideChar(code_page, 0, as, -1, buff, size);
+	return buff;
+}
+
+char *w2a(const wchar_t *ws) {
+	int code_page = CP_ACP;
+	if(ServiceExists(MS_LANGPACK_GETCODEPAGE)) code_page = CallService(MS_LANGPACK_GETCODEPAGE, 0, 0);
+	int size = WideCharToMultiByte(code_page, 0, ws, -1, 0, 0, 0, 0);
+	char *buff = (char *)malloc(size);
+	WideCharToMultiByte(code_page, 0, ws, -1, buff, 2048, 0, 0);
+	return buff;
+}
+
+char *t2a(const TCHAR *ts) {
+#ifdef _UNICODE
+	return w2a(ts);
+#else
+	return _strdup(ts);
+#endif
+}
+
+TCHAR *a2t(const char *as) {
+#ifdef _UNICODE
+	return a2w(as);
+#else
+	return _strdup(as);
+#endif
+}
+
+TCHAR *u2t(const char *utfs) {
+#ifdef _UNICODE
+	return u2w(utfs);
+#else
+	wchar_t *ws = u2w(utfs);
+	char *ret = w2a(ws);
+	free(ws);
+	return ret;
+#endif
+}
+
+char *t2u(const TCHAR *ts) {
+#ifdef _UNICODE
+	return w2u(ts);
+#else
+	wchar_t *ws = a2w(ts);
+	char *ret = w2u(ws);
+	free(ws);
+	return ret;
+#endif
+}
+
+char *u2a(const char *utfs) {
+	wchar_t *ws = u2w(utfs);
+	char *ret = w2a(ws);
+	free(ws);
+	return ret;
+}
+
+char *a2u(const char *as) {
+	wchar_t *ws = a2w(as);
+	char *ret = w2u(ws);
+	free(ws);
+	return ret;
+}
diff --git a/updater/str_utils.h b/updater/str_utils.h
new file mode 100644
index 0000000..efa43a5
--- /dev/null
+++ b/updater/str_utils.h
@@ -0,0 +1,23 @@
+#ifndef _STR_UTILS_INC
+#define _STR_UTILS_INC
+
+void set_codepage();
+
+wchar_t *a2w(const char *as);
+char *w2a(const wchar_t *ws);
+
+char *w2u(const wchar_t *ws);
+wchar_t *u2w(const char *ws);
+
+TCHAR *u2t(const char *utfs);
+char *t2u(const TCHAR *ts);
+
+char *t2a(const TCHAR *ts);
+TCHAR *a2t(const char *as);
+
+char *u2a(const char *utfs);
+char *a2u(const char *as);
+
+
+#endif
+
diff --git a/updater/tinystr.cpp b/updater/tinystr.cpp
new file mode 100644
index 0000000..413f5c3
--- /dev/null
+++ b/updater/tinystr.cpp
@@ -0,0 +1,318 @@
+/*
+www.sourceforge.net/projects/tinyxml
+Original file by Yves Berquin.
+
+This software is provided 'as-is', without any express or implied 
+warranty. In no event will the authors be held liable for any 
+damages arising from the use of this software.
+
+Permission is granted to anyone to use this software for any 
+purpose, including commercial applications, and to alter it and 
+redistribute it freely, subject to the following restrictions:
+
+1. The origin of this software must not be misrepresented; you must 
+not claim that you wrote the original software. If you use this 
+software in a product, an acknowledgment in the product documentation 
+would be appreciated but is not required.
+
+2. Altered source versions must be plainly marked as such, and
+must not be misrepresented as being the original software.
+
+3. This notice may not be removed or altered from any source 
+distribution.
+*/
+
+#include "tinyxml.h"
+
+#ifndef TIXML_USE_STL
+
+
+#include <stdlib.h>
+#include <string.h>
+#include <ctype.h>
+
+#include "tinystr.h"
+
+// TiXmlString constructor, based on a C string
+TiXmlString::TiXmlString (const char* instring)
+{
+    size_t newlen;
+    char * newstring;
+
+    if (!instring)
+    {
+        allocated = 0;
+        cstring = NULL;
+        current_length = 0;
+        return;
+    }
+    newlen = strlen (instring) + 1;
+    newstring = new char [newlen];
+    memcpy (newstring, instring, newlen);
+    // strcpy (newstring, instring);
+    allocated = newlen;
+    cstring = newstring;
+    current_length = newlen - 1;
+}
+
+// TiXmlString copy constructor
+TiXmlString::TiXmlString (const TiXmlString& copy)
+{
+    size_t newlen;
+    char * newstring;
+
+	// Prevent copy to self!
+	if ( &copy == this )
+		return;
+
+    if (! copy . allocated)
+    {
+        allocated = 0;
+        cstring = NULL;
+        current_length = 0;
+        return;
+    }
+    newlen = copy . length () + 1;
+    newstring = new char [newlen];
+    // strcpy (newstring, copy . cstring);
+    memcpy (newstring, copy . cstring, newlen);
+    allocated = newlen;
+    cstring = newstring;
+    current_length = newlen - 1;
+}
+
+// TiXmlString = operator. Safe when assign own content
+void TiXmlString ::operator = (const char * content)
+{
+    size_t newlen;
+    char * newstring;
+
+    if (! content)
+    {
+        empty_it ();
+        return;
+    }
+    newlen = strlen (content) + 1;
+    newstring = new char [newlen];
+    // strcpy (newstring, content);
+    memcpy (newstring, content, newlen);
+    empty_it ();
+    allocated = newlen;
+    cstring = newstring;
+    current_length = newlen - 1;
+}
+
+// = operator. Safe when assign own content
+void TiXmlString ::operator = (const TiXmlString & copy)
+{
+    size_t newlen;
+    char * newstring;
+
+    if (! copy . length ())
+    {
+        empty_it ();
+        return;
+    }
+    newlen = copy . length () + 1;
+    newstring = new char [newlen];
+    // strcpy (newstring, copy . c_str ());
+    memcpy (newstring, copy . c_str (), newlen);
+    empty_it ();
+    allocated = newlen;
+    cstring = newstring;
+    current_length = newlen - 1;
+}
+
+
+// append a const char * to an existing TiXmlString
+void TiXmlString::append( const char* str, size_t len )
+{
+    char * new_string;
+    size_t new_alloc, new_size, size_suffix;
+	
+	// don't use strlen - it can overrun the len passed in!
+	const char* p = str;
+	size_suffix = 0;
+
+	while ( *p && size_suffix < (unsigned)len )
+	{
+		++p;
+		++size_suffix;
+	}
+    if ( !size_suffix)
+        return;
+
+    new_size = length () + size_suffix + 1;
+    // check if we need to expand
+    if (new_size > allocated)
+    {
+        // compute new size
+        new_alloc = assign_new_size (new_size);
+
+        // allocate new buffer
+        new_string = new char [new_alloc];        
+        new_string [0] = 0;
+
+        // copy the previous allocated buffer into this one
+        if (allocated && cstring)
+            // strcpy (new_string, cstring);
+            memcpy (new_string, cstring, length ());
+
+        // append the suffix. It does exist, otherwize we wouldn't be expanding 
+        // strncat (new_string, str, len);
+        memcpy (new_string + length (), 
+                str,
+                size_suffix);
+
+        // return previsously allocated buffer if any
+        if (allocated && cstring)
+            delete [] cstring;
+
+        // update member variables
+        cstring = new_string;
+        allocated = new_alloc;
+    }
+    else
+    {
+        // we know we can safely append the new string
+        // strncat (cstring, str, len);
+        memcpy (cstring + length (), 
+                str,
+                size_suffix);
+    }
+    current_length = new_size - 1;
+    cstring [current_length] = 0;
+}
+
+
+// append a const char * to an existing TiXmlString
+void TiXmlString::append( const char * suffix )
+{
+    char * new_string;
+    size_t new_alloc, new_size;
+
+    new_size = length () + strlen (suffix) + 1;
+    // check if we need to expand
+    if (new_size > allocated)
+    {
+        // compute new size
+        new_alloc = assign_new_size (new_size);
+
+        // allocate new buffer
+        new_string = new char [new_alloc];        
+        new_string [0] = 0;
+
+        // copy the previous allocated buffer into this one
+        if (allocated && cstring)
+            memcpy (new_string, cstring, 1 + length ());
+            // strcpy (new_string, cstring);
+
+        // append the suffix. It does exist, otherwize we wouldn't be expanding 
+        // strcat (new_string, suffix);
+        memcpy (new_string + length (), 
+                suffix,
+                strlen (suffix) + 1);
+
+        // return previsously allocated buffer if any
+        if (allocated && cstring)
+            delete [] cstring;
+
+        // update member variables
+        cstring = new_string;
+        allocated = new_alloc;
+    }
+    else
+    {
+        // we know we can safely append the new string
+        // strcat (cstring, suffix);
+        memcpy (cstring + length (), 
+                suffix, 
+                strlen (suffix) + 1);
+    }
+    current_length = new_size - 1;
+}
+
+// Check for TiXmlString equuivalence
+//bool TiXmlString::operator == (const TiXmlString & compare) const
+//{
+//    return (! strcmp (c_str (), compare . c_str ()));
+//}
+
+//unsigned TiXmlString::length () const
+//{
+//    if (allocated)
+//        // return strlen (cstring);
+//        return current_length;
+//    return 0;
+//}
+
+
+unsigned TiXmlString::find (char tofind, unsigned offset) const
+{
+    char * lookup;
+
+    if (offset >= length ())
+        return (unsigned) notfound;
+    for (lookup = cstring + offset; * lookup; lookup++)
+        if (* lookup == tofind)
+            return (unsigned)(lookup - cstring);
+    return (unsigned) notfound;
+}
+
+
+bool TiXmlString::operator == (const TiXmlString & compare) const
+{
+	if ( allocated && compare.allocated )
+	{
+		assert( cstring );
+		assert( compare.cstring );
+		return ( strcmp( cstring, compare.cstring ) == 0 );
+ 	}
+	else if ( length() == 0 && compare.length() == 0 )
+	{
+		return true;
+	}
+	return false;
+}
+
+
+bool TiXmlString::operator == (const char* compare) const
+{
+	if ( allocated && compare && *compare )
+	{
+		assert( cstring );
+		return ( strcmp( cstring, compare ) == 0 );
+ 	}
+	else if ( length() == 0 && (!compare || !*compare ) )	// this is a little dubious, but try to duplicate behavior in other operator==
+	{
+		return true;
+	}
+	return false;	
+}
+
+
+bool TiXmlString::operator < (const TiXmlString & compare) const
+{
+	if ( allocated && compare.allocated )
+	{
+		assert( cstring );
+		assert( compare.cstring );
+		return ( strcmp( cstring, compare.cstring ) > 0 );
+ 	}
+	return false;
+}
+
+
+bool TiXmlString::operator > (const TiXmlString & compare) const
+{
+	if ( allocated && compare.allocated )
+	{
+		assert( cstring );
+		assert( compare.cstring );
+		return ( strcmp( cstring, compare.cstring ) < 0 );
+ 	}
+	return false;
+}
+
+
+#endif	// TIXML_USE_STL
diff --git a/updater/tinystr.h b/updater/tinystr.h
new file mode 100644
index 0000000..3960502
--- /dev/null
+++ b/updater/tinystr.h
@@ -0,0 +1,250 @@
+/*
+www.sourceforge.net/projects/tinyxml
+Original file by Yves Berquin.
+
+This software is provided 'as-is', without any express or implied 
+warranty. In no event will the authors be held liable for any 
+damages arising from the use of this software.
+
+Permission is granted to anyone to use this software for any 
+purpose, including commercial applications, and to alter it and 
+redistribute it freely, subject to the following restrictions:
+
+1. The origin of this software must not be misrepresented; you must 
+not claim that you wrote the original software. If you use this 
+software in a product, an acknowledgment in the product documentation 
+would be appreciated but is not required.
+
+2. Altered source versions must be plainly marked as such, and
+must not be misrepresented as being the original software.
+
+3. This notice may not be removed or altered from any source 
+distribution.
+*/
+
+#include "tinyxml.h"
+
+
+#ifndef TIXML_USE_STL
+
+#ifndef TIXML_STRING_INCLUDED
+#define TIXML_STRING_INCLUDED
+
+#ifdef _MSC_VER
+#pragma warning( disable : 4530 )
+#pragma warning( disable : 4786 )
+#endif
+
+#include <assert.h>
+
+/*
+   TiXmlString is an emulation of the std::string template.
+   Its purpose is to allow compiling TinyXML on compilers with no or poor STL support.
+   Only the member functions relevant to the TinyXML project have been implemented.
+   The buffer allocation is made by a simplistic power of 2 like mechanism : if we increase
+   a string and there's no more room, we allocate a buffer twice as big as we need.
+*/
+class TiXmlString
+{
+  public :
+    // TiXmlString constructor, based on a string, mark explicit to force
+	// us to find unnecessary casting.
+    explicit TiXmlString (const char * instring);
+
+    // TiXmlString empty constructor
+    TiXmlString ()
+    {
+        allocated = 0;
+        cstring = NULL;
+        current_length = 0;
+    }
+
+    // TiXmlString copy constructor
+    explicit TiXmlString (const TiXmlString& copy);
+
+    // TiXmlString destructor
+    ~ TiXmlString ()
+    {
+        empty_it ();
+    }
+
+    // Convert a TiXmlString into a classical char *
+    const char * c_str () const
+    {
+        if (allocated)
+            return cstring;
+        return "";
+    }
+
+    // Return the length of a TiXmlString
+    size_t length () const
+	{
+		return ( allocated ) ? current_length : 0;
+	}
+
+    // TiXmlString = operator
+    void operator = (const char * content);
+
+    // = operator
+    void operator = (const TiXmlString & copy);
+
+    // += operator. Maps to append
+    TiXmlString& operator += (const char * suffix)
+    {
+        append (suffix);
+		return *this;
+    }
+
+    // += operator. Maps to append
+    TiXmlString& operator += (char single)
+    {
+        append (single);
+		return *this;
+    }
+
+    // += operator. Maps to append
+    TiXmlString& operator += (TiXmlString & suffix)
+    {
+        append (suffix);
+		return *this;
+    }
+    bool operator == (const TiXmlString & compare) const;
+    bool operator == (const char* compare) const;
+    bool operator < (const TiXmlString & compare) const;
+    bool operator > (const TiXmlString & compare) const;
+
+    // Checks if a TiXmlString is empty
+    bool empty () const
+    {
+        return length () ? false : true;
+    }
+
+    // single char extraction
+    const char& at (unsigned index) const
+    {
+        assert( index < length ());
+        return cstring [index];
+    }
+
+    // find a char in a string. Return TiXmlString::notfound if not found
+    unsigned find (char lookup) const
+    {
+        return find (lookup, 0);
+    }
+
+    // find a char in a string from an offset. Return TiXmlString::notfound if not found
+    unsigned find (char tofind, unsigned offset) const;
+
+    /*	Function to reserve a big amount of data when we know we'll need it. Be aware that this
+		function clears the content of the TiXmlString if any exists.
+    */
+    void reserve (unsigned size)
+    {
+        empty_it ();
+        if (size)
+        {
+            allocated = size;
+            cstring = new char [size];
+            cstring [0] = 0;
+            current_length = 0;
+        }
+    }
+
+    // [] operator 
+    char& operator [] (unsigned index) const
+    {
+        assert( index < length ());
+        return cstring [index];
+    }
+
+    // Error value for find primitive 
+    enum {	notfound = 0xffffffff,
+            npos = notfound };
+
+    void append (const char *str, size_t len );
+
+  protected :
+
+    // The base string
+    char * cstring;
+    // Number of chars allocated
+    size_t allocated;
+    // Current string size
+    size_t current_length;
+
+    // New size computation. It is simplistic right now : it returns twice the amount
+    // we need
+    size_t assign_new_size (size_t minimum_to_allocate)
+    {
+        return minimum_to_allocate * 2;
+    }
+
+    // Internal function that clears the content of a TiXmlString
+    void empty_it ()
+    {
+        if (cstring)
+            delete [] cstring;
+        cstring = NULL;
+        allocated = 0;
+        current_length = 0;
+    }
+
+    void append (const char *suffix );
+
+    // append function for another TiXmlString
+    void append (const TiXmlString & suffix)
+    {
+        append (suffix . c_str ());
+    }
+
+    // append for a single char.
+    void append (char single)
+    {
+        if ( cstring && current_length < (allocated-1) )
+		{
+			cstring[ current_length ] = single;
+			++current_length;
+			cstring[ current_length ] = 0;
+		}
+		else
+		{
+			char smallstr [2];
+			smallstr [0] = single;
+			smallstr [1] = 0;
+			append (smallstr);
+		}
+    }
+
+} ;
+
+/* 
+   TiXmlOutStream is an emulation of std::ostream. It is based on TiXmlString.
+   Only the operators that we need for TinyXML have been developped.
+*/
+class TiXmlOutStream : public TiXmlString
+{
+public :
+    TiXmlOutStream () : TiXmlString () {}
+
+    // TiXmlOutStream << operator. Maps to TiXmlString::append
+    TiXmlOutStream & operator << (const char * in)
+    {
+        append (in);
+        return (* this);
+    }
+
+    // TiXmlOutStream << operator. Maps to TiXmlString::append
+    TiXmlOutStream & operator << (const TiXmlString & in)
+    {
+        append (in . c_str ());
+        return (* this);
+    }
+} ;
+
+#ifdef _MSC_VER
+#pragma warning( default : 4530 )
+#pragma warning( default : 4786 )
+#endif
+
+#endif	// TIXML_STRING_INCLUDED
+#endif	// TIXML_USE_STL
diff --git a/updater/tinyxml.cpp b/updater/tinyxml.cpp
new file mode 100644
index 0000000..c652cc1
--- /dev/null
+++ b/updater/tinyxml.cpp
@@ -0,0 +1,1592 @@
+/*
+www.sourceforge.net/projects/tinyxml
+Original code (2.0 and earlier )copyright (c) 2000-2002 Lee Thomason (www.grinninglizard.com)
+
+This software is provided 'as-is', without any express or implied
+warranty. In no event will the authors be held liable for any
+damages arising from the use of this software.
+
+Permission is granted to anyone to use this software for any
+purpose, including commercial applications, and to alter it and
+redistribute it freely, subject to the following restrictions:
+
+1. The origin of this software must not be misrepresented; you must
+not claim that you wrote the original software. If you use this
+software in a product, an acknowledgment in the product documentation
+would be appreciated but is not required.
+
+2. Altered source versions must be plainly marked as such, and
+must not be misrepresented as being the original software.
+
+3. This notice may not be removed or altered from any source
+distribution.
+*/
+
+#include <ctype.h>
+#include "tinyxml.h"
+
+#ifdef TIXML_USE_STL
+#include <sstream>
+#endif
+
+
+bool TiXmlBase::condenseWhiteSpace = true;
+
+void TiXmlBase::PutString( const TIXML_STRING& str, TIXML_OSTREAM* stream )
+{
+	TIXML_STRING buffer;
+	PutString( str, &buffer );
+	(*stream) << buffer;
+}
+
+void TiXmlBase::PutString( const TIXML_STRING& str, TIXML_STRING* outString )
+{
+	int i=0;
+
+	while( i<(int)str.length() )
+	{
+		unsigned char c = (unsigned char) str[i];
+
+		if (    c == '&' 
+		     && i < ( (int)str.length() - 2 )
+			 && str[i+1] == '#'
+			 && str[i+2] == 'x' )
+		{
+			// Hexadecimal character reference.
+			// Pass through unchanged.
+			// &#xA9;	-- copyright symbol, for example.
+			//
+			// The -1 is a bug fix from Rob Laveaux. It keeps
+			// an overflow from happening if there is no ';'.
+			// There are actually 2 ways to exit this loop -
+			// while fails (error case) and break (semicolon found).
+			// However, there is no mechanism (currently) for
+			// this function to return an error.
+			while ( i<(int)str.length()-1 )
+			{
+				outString->append( str.c_str() + i, 1 );
+				++i;
+				if ( str[i] == ';' )
+					break;
+			}
+		}
+		else if ( c == '&' )
+		{
+			outString->append( entity[0].str, entity[0].strLength );
+			++i;
+		}
+		else if ( c == '<' )
+		{
+			outString->append( entity[1].str, entity[1].strLength );
+			++i;
+		}
+		else if ( c == '>' )
+		{
+			outString->append( entity[2].str, entity[2].strLength );
+			++i;
+		}
+		else if ( c == '\"' )
+		{
+			outString->append( entity[3].str, entity[3].strLength );
+			++i;
+		}
+		else if ( c == '\'' )
+		{
+			outString->append( entity[4].str, entity[4].strLength );
+			++i;
+		}
+		else if ( c < 32 )
+		{
+			// Easy pass at non-alpha/numeric/symbol
+			// Below 32 is symbolic.
+			char buf[ 32 ];
+			sprintf( buf, "&#x%02X;", (unsigned) ( c & 0xff ) );
+			//*ME:	warning C4267: convert 'size_t' to 'int'
+			//*ME:	Int-Cast to make compiler happy ...
+			outString->append( buf, (int)strlen( buf ) );
+			++i;
+		}
+		else
+		{
+			//char realc = (char) c;
+			//outString->append( &realc, 1 );
+			*outString += (char) c;	// somewhat more efficient function call.
+			++i;
+		}
+	}
+}
+
+
+// <-- Strange class for a bug fix. Search for STL_STRING_BUG
+TiXmlBase::StringToBuffer::StringToBuffer( const TIXML_STRING& str )
+{
+	buffer = new char[ str.length()+1 ];
+	if ( buffer )
+	{
+		strcpy( buffer, str.c_str() );
+	}
+}
+
+
+TiXmlBase::StringToBuffer::~StringToBuffer()
+{
+	delete [] buffer;
+}
+// End strange bug fix. -->
+
+
+TiXmlNode::TiXmlNode( NodeType _type ) : TiXmlBase()
+{
+	parent = 0;
+	type = _type;
+	firstChild = 0;
+	lastChild = 0;
+	prev = 0;
+	next = 0;
+}
+
+
+TiXmlNode::~TiXmlNode()
+{
+	TiXmlNode* node = firstChild;
+	TiXmlNode* temp = 0;
+
+	while ( node )
+	{
+		temp = node;
+		node = node->next;
+		delete temp;
+	}	
+}
+
+
+void TiXmlNode::CopyTo( TiXmlNode* target ) const
+{
+	target->SetValue (value.c_str() );
+	target->userData = userData; 
+}
+
+
+void TiXmlNode::Clear()
+{
+	TiXmlNode* node = firstChild;
+	TiXmlNode* temp = 0;
+
+	while ( node )
+	{
+		temp = node;
+		node = node->next;
+		delete temp;
+	}	
+
+	firstChild = 0;
+	lastChild = 0;
+}
+
+
+TiXmlNode* TiXmlNode::LinkEndChild( TiXmlNode* node )
+{
+	node->parent = this;
+
+	node->prev = lastChild;
+	node->next = 0;
+
+	if ( lastChild )
+		lastChild->next = node;
+	else
+		firstChild = node;			// it was an empty list.
+
+	lastChild = node;
+	return node;
+}
+
+
+TiXmlNode* TiXmlNode::InsertEndChild( const TiXmlNode& addThis )
+{
+	TiXmlNode* node = addThis.Clone();
+	if ( !node )
+		return 0;
+
+	return LinkEndChild( node );
+}
+
+
+TiXmlNode* TiXmlNode::InsertBeforeChild( TiXmlNode* beforeThis, const TiXmlNode& addThis )
+{	
+	if ( !beforeThis || beforeThis->parent != this )
+		return 0;
+
+	TiXmlNode* node = addThis.Clone();
+	if ( !node )
+		return 0;
+	node->parent = this;
+
+	node->next = beforeThis;
+	node->prev = beforeThis->prev;
+	if ( beforeThis->prev )
+	{
+		beforeThis->prev->next = node;
+	}
+	else
+	{
+		assert( firstChild == beforeThis );
+		firstChild = node;
+	}
+	beforeThis->prev = node;
+	return node;
+}
+
+
+TiXmlNode* TiXmlNode::InsertAfterChild( TiXmlNode* afterThis, const TiXmlNode& addThis )
+{
+	if ( !afterThis || afterThis->parent != this )
+		return 0;
+
+	TiXmlNode* node = addThis.Clone();
+	if ( !node )
+		return 0;
+	node->parent = this;
+
+	node->prev = afterThis;
+	node->next = afterThis->next;
+	if ( afterThis->next )
+	{
+		afterThis->next->prev = node;
+	}
+	else
+	{
+		assert( lastChild == afterThis );
+		lastChild = node;
+	}
+	afterThis->next = node;
+	return node;
+}
+
+
+TiXmlNode* TiXmlNode::ReplaceChild( TiXmlNode* replaceThis, const TiXmlNode& withThis )
+{
+	if ( replaceThis->parent != this )
+		return 0;
+
+	TiXmlNode* node = withThis.Clone();
+	if ( !node )
+		return 0;
+
+	node->next = replaceThis->next;
+	node->prev = replaceThis->prev;
+
+	if ( replaceThis->next )
+		replaceThis->next->prev = node;
+	else
+		lastChild = node;
+
+	if ( replaceThis->prev )
+		replaceThis->prev->next = node;
+	else
+		firstChild = node;
+
+	delete replaceThis;
+	node->parent = this;
+	return node;
+}
+
+
+bool TiXmlNode::RemoveChild( TiXmlNode* removeThis )
+{
+	if ( removeThis->parent != this )
+	{	
+		assert( 0 );
+		return false;
+	}
+
+	if ( removeThis->next )
+		removeThis->next->prev = removeThis->prev;
+	else
+		lastChild = removeThis->prev;
+
+	if ( removeThis->prev )
+		removeThis->prev->next = removeThis->next;
+	else
+		firstChild = removeThis->next;
+
+	delete removeThis;
+	return true;
+}
+
+const TiXmlNode* TiXmlNode::FirstChild( const char * _value ) const
+{
+	const TiXmlNode* node;
+	for ( node = firstChild; node; node = node->next )
+	{
+		if ( node->SValue() == _value )
+			return node;
+	}
+	return 0;
+}
+
+
+TiXmlNode* TiXmlNode::FirstChild( const char * _value )
+{
+	TiXmlNode* node;
+	for ( node = firstChild; node; node = node->next )
+	{
+		if ( node->SValue() == _value )
+			return node;
+	}
+	return 0;
+}
+
+
+const TiXmlNode* TiXmlNode::LastChild( const char * _value ) const
+{
+	const TiXmlNode* node;
+	for ( node = lastChild; node; node = node->prev )
+	{
+		if ( node->SValue() == _value )
+			return node;
+	}
+	return 0;
+}
+
+TiXmlNode* TiXmlNode::LastChild( const char * _value )
+{
+	TiXmlNode* node;
+	for ( node = lastChild; node; node = node->prev )
+	{
+		if ( node->SValue() == _value )
+			return node;
+	}
+	return 0;
+}
+
+const TiXmlNode* TiXmlNode::IterateChildren( const TiXmlNode* previous ) const
+{
+	if ( !previous )
+	{
+		return FirstChild();
+	}
+	else
+	{
+		assert( previous->parent == this );
+		return previous->NextSibling();
+	}
+}
+
+TiXmlNode* TiXmlNode::IterateChildren( TiXmlNode* previous )
+{
+	if ( !previous )
+	{
+		return FirstChild();
+	}
+	else
+	{
+		assert( previous->parent == this );
+		return previous->NextSibling();
+	}
+}
+
+const TiXmlNode* TiXmlNode::IterateChildren( const char * val, const TiXmlNode* previous ) const
+{
+	if ( !previous )
+	{
+		return FirstChild( val );
+	}
+	else
+	{
+		assert( previous->parent == this );
+		return previous->NextSibling( val );
+	}
+}
+
+TiXmlNode* TiXmlNode::IterateChildren( const char * val, TiXmlNode* previous )
+{
+	if ( !previous )
+	{
+		return FirstChild( val );
+	}
+	else
+	{
+		assert( previous->parent == this );
+		return previous->NextSibling( val );
+	}
+}
+
+const TiXmlNode* TiXmlNode::NextSibling( const char * _value ) const 
+{
+	const TiXmlNode* node;
+	for ( node = next; node; node = node->next )
+	{
+		if ( node->SValue() == _value )
+			return node;
+	}
+	return 0;
+}
+
+TiXmlNode* TiXmlNode::NextSibling( const char * _value )
+{
+	TiXmlNode* node;
+	for ( node = next; node; node = node->next )
+	{
+		if ( node->SValue() == _value )
+			return node;
+	}
+	return 0;
+}
+
+const TiXmlNode* TiXmlNode::PreviousSibling( const char * _value ) const
+{
+	const TiXmlNode* node;
+	for ( node = prev; node; node = node->prev )
+	{
+		if ( node->SValue() == _value )
+			return node;
+	}
+	return 0;
+}
+
+TiXmlNode* TiXmlNode::PreviousSibling( const char * _value )
+{
+	TiXmlNode* node;
+	for ( node = prev; node; node = node->prev )
+	{
+		if ( node->SValue() == _value )
+			return node;
+	}
+	return 0;
+}
+
+void TiXmlElement::RemoveAttribute( const char * name )
+{
+	TiXmlAttribute* node = attributeSet.Find( name );
+	if ( node )
+	{
+		attributeSet.Remove( node );
+		delete node;
+	}
+}
+
+const TiXmlElement* TiXmlNode::FirstChildElement() const
+{
+	const TiXmlNode* node;
+
+	for (	node = FirstChild();
+			node;
+			node = node->NextSibling() )
+	{
+		if ( node->ToElement() )
+			return node->ToElement();
+	}
+	return 0;
+}
+
+TiXmlElement* TiXmlNode::FirstChildElement()
+{
+	TiXmlNode* node;
+
+	for (	node = FirstChild();
+			node;
+			node = node->NextSibling() )
+	{
+		if ( node->ToElement() )
+			return node->ToElement();
+	}
+	return 0;
+}
+
+const TiXmlElement* TiXmlNode::FirstChildElement( const char * _value ) const
+{
+	const TiXmlNode* node;
+
+	for (	node = FirstChild( _value );
+			node;
+			node = node->NextSibling( _value ) )
+	{
+		if ( node->ToElement() )
+			return node->ToElement();
+	}
+	return 0;
+}
+
+TiXmlElement* TiXmlNode::FirstChildElement( const char * _value )
+{
+	TiXmlNode* node;
+
+	for (	node = FirstChild( _value );
+			node;
+			node = node->NextSibling( _value ) )
+	{
+		if ( node->ToElement() )
+			return node->ToElement();
+	}
+	return 0;
+}
+
+const TiXmlElement* TiXmlNode::NextSiblingElement() const
+{
+	const TiXmlNode* node;
+
+	for (	node = NextSibling();
+	node;
+	node = node->NextSibling() )
+	{
+		if ( node->ToElement() )
+			return node->ToElement();
+	}
+	return 0;
+}
+
+TiXmlElement* TiXmlNode::NextSiblingElement()
+{
+	TiXmlNode* node;
+
+	for (	node = NextSibling();
+	node;
+	node = node->NextSibling() )
+	{
+		if ( node->ToElement() )
+			return node->ToElement();
+	}
+	return 0;
+}
+
+const TiXmlElement* TiXmlNode::NextSiblingElement( const char * _value ) const
+{
+	const TiXmlNode* node;
+
+	for (	node = NextSibling( _value );
+	node;
+	node = node->NextSibling( _value ) )
+	{
+		if ( node->ToElement() )
+			return node->ToElement();
+	}
+	return 0;
+}
+
+TiXmlElement* TiXmlNode::NextSiblingElement( const char * _value )
+{
+	TiXmlNode* node;
+
+	for (	node = NextSibling( _value );
+	node;
+	node = node->NextSibling( _value ) )
+	{
+		if ( node->ToElement() )
+			return node->ToElement();
+	}
+	return 0;
+}
+
+
+const TiXmlDocument* TiXmlNode::GetDocument() const
+{
+	const TiXmlNode* node;
+
+	for( node = this; node; node = node->parent )
+	{
+		if ( node->ToDocument() )
+			return node->ToDocument();
+	}
+	return 0;
+}
+
+TiXmlDocument* TiXmlNode::GetDocument()
+{
+	TiXmlNode* node;
+
+	for( node = this; node; node = node->parent )
+	{
+		if ( node->ToDocument() )
+			return node->ToDocument();
+	}
+	return 0;
+}
+
+TiXmlElement::TiXmlElement (const char * _value)
+	: TiXmlNode( TiXmlNode::ELEMENT )
+{
+	firstChild = lastChild = 0;
+	value = _value;
+}
+
+
+#ifdef TIXML_USE_STL
+TiXmlElement::TiXmlElement( const std::string& _value ) 
+	: TiXmlNode( TiXmlNode::ELEMENT )
+{
+	firstChild = lastChild = 0;
+	value = _value;
+}
+#endif
+
+
+TiXmlElement::TiXmlElement( const TiXmlElement& copy)
+	: TiXmlNode( TiXmlNode::ELEMENT )
+{
+	firstChild = lastChild = 0;
+	copy.CopyTo( this );	
+}
+
+
+void TiXmlElement::operator=( const TiXmlElement& base )
+{
+	ClearThis();
+	base.CopyTo( this );
+}
+
+
+TiXmlElement::~TiXmlElement()
+{
+	ClearThis();
+}
+
+
+void TiXmlElement::ClearThis()
+{
+	Clear();
+	while( attributeSet.First() )
+	{
+		TiXmlAttribute* node = attributeSet.First();
+		attributeSet.Remove( node );
+		delete node;
+	}
+}
+
+
+const char * TiXmlElement::Attribute( const char * name ) const
+{
+	const TiXmlAttribute* node = attributeSet.Find( name );
+
+	if ( node )
+		return node->Value();
+
+	return 0;
+}
+
+
+const char * TiXmlElement::Attribute( const char * name, int* i ) const
+{
+	const char * s = Attribute( name );
+	if ( i )
+	{
+		if ( s )
+			*i = atoi( s );
+		else
+			*i = 0;
+	}
+	return s;
+}
+
+
+const char * TiXmlElement::Attribute( const char * name, double* d ) const
+{
+	const char * s = Attribute( name );
+	if ( d )
+	{
+		if ( s )
+			*d = atof( s );
+		else
+			*d = 0;
+	}
+	return s;
+}
+
+
+int TiXmlElement::QueryIntAttribute( const char* name, int* ival ) const
+{
+	const TiXmlAttribute* node = attributeSet.Find( name );
+	if ( !node )
+		return TIXML_NO_ATTRIBUTE;
+
+	return node->QueryIntValue( ival );
+}
+
+
+int TiXmlElement::QueryDoubleAttribute( const char* name, double* dval ) const
+{
+	const TiXmlAttribute* node = attributeSet.Find( name );
+	if ( !node )
+		return TIXML_NO_ATTRIBUTE;
+
+	return node->QueryDoubleValue( dval );
+}
+
+
+void TiXmlElement::SetAttribute( const char * name, int val )
+{	
+	char buf[64];
+	sprintf( buf, "%d", val );
+	SetAttribute( name, buf );
+}
+
+
+void TiXmlElement::SetDoubleAttribute( const char * name, double val )
+{	
+	char buf[256];
+	sprintf( buf, "%f", val );
+	SetAttribute( name, buf );
+}
+
+
+void TiXmlElement::SetAttribute( const char * name, const char * _value )
+{
+	TiXmlAttribute* node = attributeSet.Find( name );
+	if ( node )
+	{
+		node->SetValue( _value );
+		return;
+	}
+
+	TiXmlAttribute* attrib = new TiXmlAttribute( name, _value );
+	if ( attrib )
+	{
+		attributeSet.Add( attrib );
+	}
+	else
+	{
+		TiXmlDocument* document = GetDocument();
+		if ( document ) document->SetError( TIXML_ERROR_OUT_OF_MEMORY, 0, 0, TIXML_ENCODING_UNKNOWN );
+	}
+}
+
+void TiXmlElement::Print( FILE* cfile, int depth ) const
+{
+	int i;
+	for ( i=0; i<depth; i++ )
+	{
+		fprintf( cfile, "    " );
+	}
+
+	fprintf( cfile, "<%s", value.c_str() );
+
+	const TiXmlAttribute* attrib;
+	for ( attrib = attributeSet.First(); attrib; attrib = attrib->Next() )
+	{
+		fprintf( cfile, " " );
+		attrib->Print( cfile, depth );
+	}
+
+	// There are 3 different formatting approaches:
+	// 1) An element without children is printed as a <foo /> node
+	// 2) An element with only a text child is printed as <foo> text </foo>
+	// 3) An element with children is printed on multiple lines.
+	TiXmlNode* node;
+	if ( !firstChild )
+	{
+		fprintf( cfile, " />" );
+	}
+	else if ( firstChild == lastChild && firstChild->ToText() )
+	{
+		fprintf( cfile, ">" );
+		firstChild->Print( cfile, depth + 1 );
+		fprintf( cfile, "</%s>", value.c_str() );
+	}
+	else
+	{
+		fprintf( cfile, ">" );
+
+		for ( node = firstChild; node; node=node->NextSibling() )
+		{
+			if ( !node->ToText() )
+			{
+				fprintf( cfile, "\n" );
+			}
+			node->Print( cfile, depth+1 );
+		}
+		fprintf( cfile, "\n" );
+		for( i=0; i<depth; ++i )
+		fprintf( cfile, "    " );
+		fprintf( cfile, "</%s>", value.c_str() );
+	}
+}
+
+void TiXmlElement::StreamOut( TIXML_OSTREAM * stream ) const
+{
+	(*stream) << "<" << value;
+
+	const TiXmlAttribute* attrib;
+	for ( attrib = attributeSet.First(); attrib; attrib = attrib->Next() )
+	{	
+		(*stream) << " ";
+		attrib->StreamOut( stream );
+	}
+
+	// If this node has children, give it a closing tag. Else
+	// make it an empty tag.
+	TiXmlNode* node;
+	if ( firstChild )
+	{ 		
+		(*stream) << ">";
+
+		for ( node = firstChild; node; node=node->NextSibling() )
+		{
+			node->StreamOut( stream );
+		}
+		(*stream) << "</" << value << ">";
+	}
+	else
+	{
+		(*stream) << " />";
+	}
+}
+
+
+void TiXmlElement::CopyTo( TiXmlElement* target ) const
+{
+	// superclass:
+	TiXmlNode::CopyTo( target );
+
+	// Element class: 
+	// Clone the attributes, then clone the children.
+	const TiXmlAttribute* attribute = 0;
+	for(	attribute = attributeSet.First();
+	attribute;
+	attribute = attribute->Next() )
+	{
+		target->SetAttribute( attribute->Name(), attribute->Value() );
+	}
+
+	TiXmlNode* node = 0;
+	for ( node = firstChild; node; node = node->NextSibling() )
+	{
+		target->LinkEndChild( node->Clone() );
+	}
+}
+
+
+TiXmlNode* TiXmlElement::Clone() const
+{
+	TiXmlElement* clone = new TiXmlElement( Value() );
+	if ( !clone )
+		return 0;
+
+	CopyTo( clone );
+	return clone;
+}
+
+
+TiXmlDocument::TiXmlDocument() : TiXmlNode( TiXmlNode::DOCUMENT )
+{
+	tabsize = 4;
+	ClearError();
+}
+
+TiXmlDocument::TiXmlDocument( const char * documentName ) : TiXmlNode( TiXmlNode::DOCUMENT )
+{
+	tabsize = 4;
+	value = documentName;
+	ClearError();
+}
+
+
+#ifdef TIXML_USE_STL
+TiXmlDocument::TiXmlDocument( const std::string& documentName ) : TiXmlNode( TiXmlNode::DOCUMENT )
+{
+	tabsize = 4;
+    value = documentName;
+	ClearError();
+}
+#endif
+
+
+TiXmlDocument::TiXmlDocument( const TiXmlDocument& copy ) : TiXmlNode( TiXmlNode::DOCUMENT )
+{
+	copy.CopyTo( this );
+}
+
+
+void TiXmlDocument::operator=( const TiXmlDocument& copy )
+{
+	Clear();
+	copy.CopyTo( this );
+}
+
+
+bool TiXmlDocument::LoadFile( TiXmlEncoding encoding )
+{
+	// See STL_STRING_BUG below.
+	StringToBuffer buf( value );
+
+	if ( buf.buffer && LoadFile( buf.buffer, encoding ) )
+		return true;
+
+	return false;
+}
+
+
+bool TiXmlDocument::SaveFile() const
+{
+	// See STL_STRING_BUG below.
+	StringToBuffer buf( value );
+
+	if ( buf.buffer && SaveFile( buf.buffer ) )
+		return true;
+
+	return false;
+}
+
+bool TiXmlDocument::LoadFile( const char* filename, TiXmlEncoding encoding )
+{
+	// Delete the existing data:
+	Clear();
+	location.Clear();
+
+	// There was a really terrifying little bug here. The code:
+	//		value = filename
+	// in the STL case, cause the assignment method of the std::string to
+	// be called. What is strange, is that the std::string had the same
+	// address as it's c_str() method, and so bad things happen. Looks
+	// like a bug in the Microsoft STL implementation.
+	// See STL_STRING_BUG above.
+	// Fixed with the StringToBuffer class.
+	value = filename;
+
+	FILE* file = fopen( value.c_str (), "r" );
+
+	if ( file )
+	{
+		// Get the file size, so we can pre-allocate the string. HUGE speed impact.
+		long length = 0;
+		fseek( file, 0, SEEK_END );
+		length = ftell( file );
+		fseek( file, 0, SEEK_SET );
+
+		// Strange case, but good to handle up front.
+		if ( length == 0 )
+		{
+			fclose( file );
+			return false;
+		}
+
+		// If we have a file, assume it is all one big XML file, and read it in.
+		// The document parser may decide the document ends sooner than the entire file, however.
+		TIXML_STRING data;
+		data.reserve( length );
+
+		const int BUF_SIZE = 2048;
+		char buf[BUF_SIZE];
+
+		while( fgets( buf, BUF_SIZE, file ) )
+		{
+			data += buf;
+		}
+		fclose( file );
+
+		Parse( data.c_str(), 0, encoding );
+
+		if (  Error() )
+            return false;
+        else
+			return true;
+	}
+	SetError( TIXML_ERROR_OPENING_FILE, 0, 0, TIXML_ENCODING_UNKNOWN );
+	return false;
+}
+
+bool TiXmlDocument::SaveFile( const char * filename ) const
+{
+	// The old c stuff lives on...
+	FILE* fp = fopen( filename, "w" );
+	if ( fp )
+	{
+		Print( fp, 0 );
+		fclose( fp );
+		return true;
+	}
+	return false;
+}
+
+
+void TiXmlDocument::CopyTo( TiXmlDocument* target ) const
+{
+	TiXmlNode::CopyTo( target );
+
+	target->error = error;
+	target->errorDesc = errorDesc.c_str ();
+
+	TiXmlNode* node = 0;
+	for ( node = firstChild; node; node = node->NextSibling() )
+	{
+		target->LinkEndChild( node->Clone() );
+	}	
+}
+
+
+TiXmlNode* TiXmlDocument::Clone() const
+{
+	TiXmlDocument* clone = new TiXmlDocument();
+	if ( !clone )
+		return 0;
+
+	CopyTo( clone );
+	return clone;
+}
+
+
+void TiXmlDocument::Print( FILE* cfile, int depth ) const
+{
+	const TiXmlNode* node;
+	for ( node=FirstChild(); node; node=node->NextSibling() )
+	{
+		node->Print( cfile, depth );
+		fprintf( cfile, "\n" );
+	}
+}
+
+void TiXmlDocument::StreamOut( TIXML_OSTREAM * out ) const
+{
+	const TiXmlNode* node;
+	for ( node=FirstChild(); node; node=node->NextSibling() )
+	{
+		node->StreamOut( out );
+
+		// Special rule for streams: stop after the root element.
+		// The stream in code will only read one element, so don't
+		// write more than one.
+		if ( node->ToElement() )
+			break;
+	}
+}
+
+
+const TiXmlAttribute* TiXmlAttribute::Next() const
+{
+	// We are using knowledge of the sentinel. The sentinel
+	// have a value or name.
+	if ( next->value.empty() && next->name.empty() )
+		return 0;
+	return next;
+}
+
+TiXmlAttribute* TiXmlAttribute::Next()
+{
+	// We are using knowledge of the sentinel. The sentinel
+	// have a value or name.
+	if ( next->value.empty() && next->name.empty() )
+		return 0;
+	return next;
+}
+
+const TiXmlAttribute* TiXmlAttribute::Previous() const
+{
+	// We are using knowledge of the sentinel. The sentinel
+	// have a value or name.
+	if ( prev->value.empty() && prev->name.empty() )
+		return 0;
+	return prev;
+}
+
+TiXmlAttribute* TiXmlAttribute::Previous()
+{
+	// We are using knowledge of the sentinel. The sentinel
+	// have a value or name.
+	if ( prev->value.empty() && prev->name.empty() )
+		return 0;
+	return prev;
+}
+
+void TiXmlAttribute::Print( FILE* cfile, int /*depth*/ ) const
+{
+	TIXML_STRING n, v;
+
+	PutString( name, &n );
+	PutString( value, &v );
+
+	if (value.find ('\"') == TIXML_STRING::npos)
+		fprintf (cfile, "%s=\"%s\"", n.c_str(), v.c_str() );
+	else
+		fprintf (cfile, "%s='%s'", n.c_str(), v.c_str() );
+}
+
+
+void TiXmlAttribute::StreamOut( TIXML_OSTREAM * stream ) const
+{
+	if (value.find( '\"' ) != TIXML_STRING::npos)
+	{
+		PutString( name, stream );
+		(*stream) << "=" << "'";
+		PutString( value, stream );
+		(*stream) << "'";
+	}
+	else
+	{
+		PutString( name, stream );
+		(*stream) << "=" << "\"";
+		PutString( value, stream );
+		(*stream) << "\"";
+	}
+}
+
+int TiXmlAttribute::QueryIntValue( int* ival ) const
+{
+	if ( sscanf( value.c_str(), "%d", ival ) == 1 )
+		return TIXML_SUCCESS;
+	return TIXML_WRONG_TYPE;
+}
+
+int TiXmlAttribute::QueryDoubleValue( double* dval ) const
+{
+	if ( sscanf( value.c_str(), "%lf", dval ) == 1 )
+		return TIXML_SUCCESS;
+	return TIXML_WRONG_TYPE;
+}
+
+void TiXmlAttribute::SetIntValue( int _value )
+{
+	char buf [64];
+	sprintf (buf, "%d", _value);
+	SetValue (buf);
+}
+
+void TiXmlAttribute::SetDoubleValue( double _value )
+{
+	char buf [256];
+	sprintf (buf, "%lf", _value);
+	SetValue (buf);
+}
+
+const int TiXmlAttribute::IntValue() const
+{
+	return atoi (value.c_str ());
+}
+
+const double  TiXmlAttribute::DoubleValue() const
+{
+	return atof (value.c_str ());
+}
+
+
+TiXmlComment::TiXmlComment( const TiXmlComment& copy ) : TiXmlNode( TiXmlNode::COMMENT )
+{
+	copy.CopyTo( this );
+}
+
+
+void TiXmlComment::operator=( const TiXmlComment& base )
+{
+	Clear();
+	base.CopyTo( this );
+}
+
+
+void TiXmlComment::Print( FILE* cfile, int depth ) const
+{
+	for ( int i=0; i<depth; i++ )
+	{
+		fputs( "    ", cfile );
+	}
+	fprintf( cfile, "<!--%s-->", value.c_str() );
+}
+
+void TiXmlComment::StreamOut( TIXML_OSTREAM * stream ) const
+{
+	(*stream) << "<!--";
+	//PutString( value, stream );
+	(*stream) << value;
+	(*stream) << "-->";
+}
+
+
+void TiXmlComment::CopyTo( TiXmlComment* target ) const
+{
+	TiXmlNode::CopyTo( target );
+}
+
+
+TiXmlNode* TiXmlComment::Clone() const
+{
+	TiXmlComment* clone = new TiXmlComment();
+
+	if ( !clone )
+		return 0;
+
+	CopyTo( clone );
+	return clone;
+}
+
+
+void TiXmlText::Print( FILE* cfile, int /*depth*/ ) const
+{
+	TIXML_STRING buffer;
+	PutString( value, &buffer );
+	fprintf( cfile, "%s", buffer.c_str() );
+}
+
+
+void TiXmlText::StreamOut( TIXML_OSTREAM * stream ) const
+{
+	PutString( value, stream );
+}
+
+
+void TiXmlText::CopyTo( TiXmlText* target ) const
+{
+	TiXmlNode::CopyTo( target );
+}
+
+
+TiXmlNode* TiXmlText::Clone() const
+{	
+	TiXmlText* clone = 0;
+	clone = new TiXmlText( "" );
+
+	if ( !clone )
+		return 0;
+
+	CopyTo( clone );
+	return clone;
+}
+
+
+TiXmlDeclaration::TiXmlDeclaration( const char * _version,
+									const char * _encoding,
+									const char * _standalone )
+	: TiXmlNode( TiXmlNode::DECLARATION )
+{
+	version = _version;
+	encoding = _encoding;
+	standalone = _standalone;
+}
+
+
+#ifdef TIXML_USE_STL
+TiXmlDeclaration::TiXmlDeclaration(	const std::string& _version,
+									const std::string& _encoding,
+									const std::string& _standalone )
+	: TiXmlNode( TiXmlNode::DECLARATION )
+{
+	version = _version;
+	encoding = _encoding;
+	standalone = _standalone;
+}
+#endif
+
+
+TiXmlDeclaration::TiXmlDeclaration( const TiXmlDeclaration& copy )
+	: TiXmlNode( TiXmlNode::DECLARATION )
+{
+	copy.CopyTo( this );	
+}
+
+
+void TiXmlDeclaration::operator=( const TiXmlDeclaration& copy )
+{
+	Clear();
+	copy.CopyTo( this );
+}
+
+
+void TiXmlDeclaration::Print( FILE* cfile, int /*depth*/ ) const
+{
+	fprintf (cfile, "<?xml ");
+
+	if ( !version.empty() )
+		fprintf (cfile, "version=\"%s\" ", version.c_str ());
+	if ( !encoding.empty() )
+		fprintf (cfile, "encoding=\"%s\" ", encoding.c_str ());
+	if ( !standalone.empty() )
+		fprintf (cfile, "standalone=\"%s\" ", standalone.c_str ());
+	fprintf (cfile, "?>");
+}
+
+void TiXmlDeclaration::StreamOut( TIXML_OSTREAM * stream ) const
+{
+	(*stream) << "<?xml ";
+
+	if ( !version.empty() )
+	{
+		(*stream) << "version=\"";
+		PutString( version, stream );
+		(*stream) << "\" ";
+	}
+	if ( !encoding.empty() )
+	{
+		(*stream) << "encoding=\"";
+		PutString( encoding, stream );
+		(*stream ) << "\" ";
+	}
+	if ( !standalone.empty() )
+	{
+		(*stream) << "standalone=\"";
+		PutString( standalone, stream );
+		(*stream) << "\" ";
+	}
+	(*stream) << "?>";
+}
+
+
+void TiXmlDeclaration::CopyTo( TiXmlDeclaration* target ) const
+{
+	TiXmlNode::CopyTo( target );
+
+	target->version = version;
+	target->encoding = encoding;
+	target->standalone = standalone;
+}
+
+
+TiXmlNode* TiXmlDeclaration::Clone() const
+{	
+	TiXmlDeclaration* clone = new TiXmlDeclaration();
+
+	if ( !clone )
+		return 0;
+
+	CopyTo( clone );
+	return clone;
+}
+
+
+void TiXmlUnknown::Print( FILE* cfile, int depth ) const
+{
+	for ( int i=0; i<depth; i++ )
+		fprintf( cfile, "    " );
+	fprintf( cfile, "<%s>", value.c_str() );
+}
+
+
+void TiXmlUnknown::StreamOut( TIXML_OSTREAM * stream ) const
+{
+	(*stream) << "<" << value << ">";		// Don't use entities here! It is unknown.
+}
+
+
+void TiXmlUnknown::CopyTo( TiXmlUnknown* target ) const
+{
+	TiXmlNode::CopyTo( target );
+}
+
+
+TiXmlNode* TiXmlUnknown::Clone() const
+{
+	TiXmlUnknown* clone = new TiXmlUnknown();
+
+	if ( !clone )
+		return 0;
+
+	CopyTo( clone );
+	return clone;
+}
+
+
+TiXmlAttributeSet::TiXmlAttributeSet()
+{
+	sentinel.next = &sentinel;
+	sentinel.prev = &sentinel;
+}
+
+
+TiXmlAttributeSet::~TiXmlAttributeSet()
+{
+	assert( sentinel.next == &sentinel );
+	assert( sentinel.prev == &sentinel );
+}
+
+
+void TiXmlAttributeSet::Add( TiXmlAttribute* addMe )
+{
+	assert( !Find( addMe->Name() ) );	// Shouldn't be multiply adding to the set.
+
+	addMe->next = &sentinel;
+	addMe->prev = sentinel.prev;
+
+	sentinel.prev->next = addMe;
+	sentinel.prev      = addMe;
+}
+
+void TiXmlAttributeSet::Remove( TiXmlAttribute* removeMe )
+{
+	TiXmlAttribute* node;
+
+	for( node = sentinel.next; node != &sentinel; node = node->next )
+	{
+		if ( node == removeMe )
+		{
+			node->prev->next = node->next;
+			node->next->prev = node->prev;
+			node->next = 0;
+			node->prev = 0;
+			return;
+		}
+	}
+	assert( 0 );		// we tried to remove a non-linked attribute.
+}
+
+const TiXmlAttribute* TiXmlAttributeSet::Find( const char * name ) const
+{
+	const TiXmlAttribute* node;
+
+	for( node = sentinel.next; node != &sentinel; node = node->next )
+	{
+		if ( node->name == name )
+			return node;
+	}
+	return 0;
+}
+
+TiXmlAttribute*	TiXmlAttributeSet::Find( const char * name )
+{
+	TiXmlAttribute* node;
+
+	for( node = sentinel.next; node != &sentinel; node = node->next )
+	{
+		if ( node->name == name )
+			return node;
+	}
+	return 0;
+}
+
+#ifdef TIXML_USE_STL	
+TIXML_ISTREAM & operator >> (TIXML_ISTREAM & in, TiXmlNode & base)
+{
+	TIXML_STRING tag;
+	tag.reserve( 8 * 1000 );
+	base.StreamIn( &in, &tag );
+
+	base.Parse( tag.c_str(), 0, TIXML_DEFAULT_ENCODING );
+	return in;
+}
+#endif
+
+
+TIXML_OSTREAM & operator<< (TIXML_OSTREAM & out, const TiXmlNode & base)
+{
+	base.StreamOut (& out);
+	return out;
+}
+
+
+#ifdef TIXML_USE_STL	
+std::string & operator<< (std::string& out, const TiXmlNode& base )
+{
+   std::ostringstream os_stream( std::ostringstream::out );
+   base.StreamOut( &os_stream );
+   
+   out.append( os_stream.str() );
+   return out;
+}
+#endif
+
+
+TiXmlHandle TiXmlHandle::FirstChild() const
+{
+	if ( node )
+	{
+		TiXmlNode* child = node->FirstChild();
+		if ( child )
+			return TiXmlHandle( child );
+	}
+	return TiXmlHandle( 0 );
+}
+
+
+TiXmlHandle TiXmlHandle::FirstChild( const char * value ) const
+{
+	if ( node )
+	{
+		TiXmlNode* child = node->FirstChild( value );
+		if ( child )
+			return TiXmlHandle( child );
+	}
+	return TiXmlHandle( 0 );
+}
+
+
+TiXmlHandle TiXmlHandle::FirstChildElement() const
+{
+	if ( node )
+	{
+		TiXmlElement* child = node->FirstChildElement();
+		if ( child )
+			return TiXmlHandle( child );
+	}
+	return TiXmlHandle( 0 );
+}
+
+
+TiXmlHandle TiXmlHandle::FirstChildElement( const char * value ) const
+{
+	if ( node )
+	{
+		TiXmlElement* child = node->FirstChildElement( value );
+		if ( child )
+			return TiXmlHandle( child );
+	}
+	return TiXmlHandle( 0 );
+}
+
+
+TiXmlHandle TiXmlHandle::Child( int count ) const
+{
+	if ( node )
+	{
+		int i;
+		TiXmlNode* child = node->FirstChild();
+		for (	i=0;
+				child && i<count;
+				child = child->NextSibling(), ++i )
+		{
+			// nothing
+		}
+		if ( child )
+			return TiXmlHandle( child );
+	}
+	return TiXmlHandle( 0 );
+}
+
+
+TiXmlHandle TiXmlHandle::Child( const char* value, int count ) const
+{
+	if ( node )
+	{
+		int i;
+		TiXmlNode* child = node->FirstChild( value );
+		for (	i=0;
+				child && i<count;
+				child = child->NextSibling( value ), ++i )
+		{
+			// nothing
+		}
+		if ( child )
+			return TiXmlHandle( child );
+	}
+	return TiXmlHandle( 0 );
+}
+
+
+TiXmlHandle TiXmlHandle::ChildElement( int count ) const
+{
+	if ( node )
+	{
+		int i;
+		TiXmlElement* child = node->FirstChildElement();
+		for (	i=0;
+				child && i<count;
+				child = child->NextSiblingElement(), ++i )
+		{
+			// nothing
+		}
+		if ( child )
+			return TiXmlHandle( child );
+	}
+	return TiXmlHandle( 0 );
+}
+
+
+TiXmlHandle TiXmlHandle::ChildElement( const char* value, int count ) const
+{
+	if ( node )
+	{
+		int i;
+		TiXmlElement* child = node->FirstChildElement( value );
+		for (	i=0;
+				child && i<count;
+				child = child->NextSiblingElement( value ), ++i )
+		{
+			// nothing
+		}
+		if ( child )
+			return TiXmlHandle( child );
+	}
+	return TiXmlHandle( 0 );
+}
diff --git a/updater/tinyxml.h b/updater/tinyxml.h
new file mode 100644
index 0000000..3b50268
--- /dev/null
+++ b/updater/tinyxml.h
@@ -0,0 +1,1426 @@
+/*
+www.sourceforge.net/projects/tinyxml
+Original code (2.0 and earlier )copyright (c) 2000-2002 Lee Thomason (www.grinninglizard.com)
+
+This software is provided 'as-is', without any express or implied
+warranty. In no event will the authors be held liable for any
+damages arising from the use of this software.
+
+Permission is granted to anyone to use this software for any
+purpose, including commercial applications, and to alter it and
+redistribute it freely, subject to the following restrictions:
+
+1. The origin of this software must not be misrepresented; you must
+not claim that you wrote the original software. If you use this
+software in a product, an acknowledgment in the product documentation
+would be appreciated but is not required.
+
+2. Altered source versions must be plainly marked as such, and
+must not be misrepresented as being the original software.
+
+3. This notice may not be removed or altered from any source
+distribution.
+*/
+
+
+#ifndef TINYXML_INCLUDED
+#define TINYXML_INCLUDED
+
+#ifdef _MSC_VER
+#pragma warning( disable : 4530 )
+#pragma warning( disable : 4786 )
+#endif
+
+#include <ctype.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <assert.h>
+
+// Help out windows:
+#if defined( _DEBUG ) && !defined( DEBUG )
+#define DEBUG
+#endif
+
+#if defined( DEBUG ) && defined( _MSC_VER )
+#include <windows.h>
+#define TIXML_LOG OutputDebugString
+#else
+#define TIXML_LOG printf
+#endif
+
+#ifdef TIXML_USE_STL
+	#include <string>
+ 	#include <iostream>
+	#define TIXML_STRING	std::string
+	#define TIXML_ISTREAM	std::istream
+	#define TIXML_OSTREAM	std::ostream
+#else
+	#include "tinystr.h"
+	#define TIXML_STRING	TiXmlString
+	#define TIXML_OSTREAM	TiXmlOutStream
+#endif
+
+class TiXmlDocument;
+class TiXmlElement;
+class TiXmlComment;
+class TiXmlUnknown;
+class TiXmlAttribute;
+class TiXmlText;
+class TiXmlDeclaration;
+class TiXmlParsingData;
+
+const int TIXML_MAJOR_VERSION = 2;
+const int TIXML_MINOR_VERSION = 3;
+const int TIXML_PATCH_VERSION = 4;
+
+/*	Internal structure for tracking location of items 
+	in the XML file.
+*/
+struct TiXmlCursor
+{
+	TiXmlCursor()		{ Clear(); }
+	void Clear()		{ row = col = -1; }
+
+	int row;	// 0 based.
+	int col;	// 0 based.
+};
+
+
+// Only used by Attribute::Query functions
+enum 
+{ 
+	TIXML_SUCCESS,
+	TIXML_NO_ATTRIBUTE,
+	TIXML_WRONG_TYPE
+};
+
+
+// Used by the parsing routines.
+enum TiXmlEncoding
+{
+	TIXML_ENCODING_UNKNOWN,
+	TIXML_ENCODING_UTF8,
+	TIXML_ENCODING_LEGACY
+};
+
+const TiXmlEncoding TIXML_DEFAULT_ENCODING = TIXML_ENCODING_UNKNOWN;
+
+/** TiXmlBase is a base class for every class in TinyXml.
+	It does little except to establish that TinyXml classes
+	can be printed and provide some utility functions.
+
+	In XML, the document and elements can contain
+	other elements and other types of nodes.
+
+	@verbatim
+	A Document can contain:	Element	(container or leaf)
+							Comment (leaf)
+							Unknown (leaf)
+							Declaration( leaf )
+
+	An Element can contain:	Element (container or leaf)
+							Text	(leaf)
+							Attributes (not on tree)
+							Comment (leaf)
+							Unknown (leaf)
+
+	A Decleration contains: Attributes (not on tree)
+	@endverbatim
+*/
+class TiXmlBase
+{
+	friend class TiXmlNode;
+	friend class TiXmlElement;
+	friend class TiXmlDocument;
+
+public:
+	TiXmlBase()	:	userData(0) {}
+	virtual ~TiXmlBase()					{}
+
+	/**	All TinyXml classes can print themselves to a filestream.
+		This is a formatted print, and will insert tabs and newlines.
+		
+		(For an unformatted stream, use the << operator.)
+	*/
+	virtual void Print( FILE* cfile, int depth ) const = 0;
+
+	/**	The world does not agree on whether white space should be kept or
+		not. In order to make everyone happy, these global, static functions
+		are provided to set whether or not TinyXml will condense all white space
+		into a single space or not. The default is to condense. Note changing this
+		values is not thread safe.
+	*/
+	static void SetCondenseWhiteSpace( bool condense )		{ condenseWhiteSpace = condense; }
+
+	/// Return the current white space setting.
+	static bool IsWhiteSpaceCondensed()						{ return condenseWhiteSpace; }
+
+	/** Return the position, in the original source file, of this node or attribute.
+		The row and column are 1-based. (That is the first row and first column is
+		1,1). If the returns values are 0 or less, then the parser does not have
+		a row and column value.
+
+		Generally, the row and column value will be set when the TiXmlDocument::Load(),
+		TiXmlDocument::LoadFile(), or any TiXmlNode::Parse() is called. It will NOT be set
+		when the DOM was created from operator>>.
+
+		The values reflect the initial load. Once the DOM is modified programmatically
+		(by adding or changing nodes and attributes) the new values will NOT update to
+		reflect changes in the document.
+
+		There is a minor performance cost to computing the row and column. Computation
+		can be disabled if TiXmlDocument::SetTabSize() is called with 0 as the value.
+
+		@sa TiXmlDocument::SetTabSize()
+	*/
+	int Row() const			{ return location.row + 1; }
+	int Column() const		{ return location.col + 1; }	///< See Row()
+
+	void  SetUserData( void* user )			{ userData = user; }
+	void* GetUserData()						{ return userData; }
+
+	// Table that returs, for a given lead byte, the total number of bytes
+	// in the UTF-8 sequence.
+	static const int utf8ByteTable[256];
+
+	virtual const char* Parse(	const char* p, 
+								TiXmlParsingData* data, 
+								TiXmlEncoding encoding /*= TIXML_ENCODING_UNKNOWN */ ) = 0;
+
+	enum
+	{
+		TIXML_NO_ERROR = 0,
+		TIXML_ERROR,
+		TIXML_ERROR_OPENING_FILE,
+		TIXML_ERROR_OUT_OF_MEMORY,
+		TIXML_ERROR_PARSING_ELEMENT,
+		TIXML_ERROR_FAILED_TO_READ_ELEMENT_NAME,
+		TIXML_ERROR_READING_ELEMENT_VALUE,
+		TIXML_ERROR_READING_ATTRIBUTES,
+		TIXML_ERROR_PARSING_EMPTY,
+		TIXML_ERROR_READING_END_TAG,
+		TIXML_ERROR_PARSING_UNKNOWN,
+		TIXML_ERROR_PARSING_COMMENT,
+		TIXML_ERROR_PARSING_DECLARATION,
+		TIXML_ERROR_DOCUMENT_EMPTY,
+		TIXML_ERROR_EMBEDDED_NULL,
+
+		TIXML_ERROR_STRING_COUNT
+	};
+
+protected:
+
+	// See STL_STRING_BUG
+	// Utility class to overcome a bug.
+	class StringToBuffer
+	{
+	  public:
+		StringToBuffer( const TIXML_STRING& str );
+		~StringToBuffer();
+		char* buffer;
+	};
+
+	static const char*	SkipWhiteSpace( const char*, TiXmlEncoding encoding );
+	inline static bool	IsWhiteSpace( char c )		
+	{ 
+		return ( isspace( (unsigned char) c ) || c == '\n' || c == '\r' ); 
+	}
+
+	virtual void StreamOut (TIXML_OSTREAM *) const = 0;
+
+	#ifdef TIXML_USE_STL
+	    static bool	StreamWhiteSpace( TIXML_ISTREAM * in, TIXML_STRING * tag );
+	    static bool StreamTo( TIXML_ISTREAM * in, int character, TIXML_STRING * tag );
+	#endif
+
+	/*	Reads an XML name into the string provided. Returns
+		a pointer just past the last character of the name,
+		or 0 if the function has an error.
+	*/
+	static const char* ReadName( const char* p, TIXML_STRING* name, TiXmlEncoding encoding );
+
+	/*	Reads text. Returns a pointer past the given end tag.
+		Wickedly complex options, but it keeps the (sensitive) code in one place.
+	*/
+	static const char* ReadText(	const char* in,				// where to start
+									TIXML_STRING* text,			// the string read
+									bool ignoreWhiteSpace,		// whether to keep the white space
+									const char* endTag,			// what ends this text
+									bool ignoreCase,			// whether to ignore case in the end tag
+									TiXmlEncoding encoding );	// the current encoding
+
+	// If an entity has been found, transform it into a character.
+	static const char* GetEntity( const char* in, char* value, int* length, TiXmlEncoding encoding );
+
+	// Get a character, while interpreting entities.
+	// The length can be from 0 to 4 bytes.
+	inline static const char* GetChar( const char* p, char* _value, int* length, TiXmlEncoding encoding )
+	{
+		assert( p );
+		if ( encoding == TIXML_ENCODING_UTF8 )
+		{
+			*length = utf8ByteTable[ *((unsigned char*)p) ];
+			assert( *length >= 0 && *length < 5 );
+		}
+		else
+		{
+			*length = 1;
+		}
+
+		if ( *length == 1 )
+		{
+			if ( *p == '&' )
+				return GetEntity( p, _value, length, encoding );
+			*_value = *p;
+			return p+1;
+		}
+		else if ( *length )
+		{
+			strncpy( _value, p, *length );
+			return p + (*length);
+		}
+		else
+		{
+			// Not valid text.
+			return 0;
+		}
+	}
+
+	// Puts a string to a stream, expanding entities as it goes.
+	// Note this should not contian the '<', '>', etc, or they will be transformed into entities!
+	static void PutString( const TIXML_STRING& str, TIXML_OSTREAM* out );
+
+	static void PutString( const TIXML_STRING& str, TIXML_STRING* out );
+
+	// Return true if the next characters in the stream are any of the endTag sequences.
+	// Ignore case only works for english, and should only be relied on when comparing
+	// to Engilish words: StringEqual( p, "version", true ) is fine.
+	static bool StringEqual(	const char* p,
+								const char* endTag,
+								bool ignoreCase,
+								TiXmlEncoding encoding );
+
+	static const char* errorString[ TIXML_ERROR_STRING_COUNT ];
+
+	TiXmlCursor location;
+
+    /// Field containing a generic user pointer
+	void*			userData;
+	
+	// None of these methods are reliable for any language except English.
+	// Good for approximation, not great for accuracy.
+	static int IsAlpha( unsigned char anyByte, TiXmlEncoding encoding );
+	static int IsAlphaNum( unsigned char anyByte, TiXmlEncoding encoding );
+	inline static int ToLower( int v, TiXmlEncoding encoding )
+	{
+		if ( encoding == TIXML_ENCODING_UTF8 )
+		{
+			if ( v < 128 ) return tolower( v );
+			return v;
+		}
+		else
+		{
+			return tolower( v );
+		}
+	}
+	static void ConvertUTF32ToUTF8( unsigned long input, char* output, int* length );
+
+private:
+	TiXmlBase( const TiXmlBase& );				// not implemented.
+	void operator=( const TiXmlBase& base );	// not allowed.
+
+	struct Entity
+	{
+		const char*     str;
+		unsigned int	strLength;
+		char		    chr;
+	};
+	enum
+	{
+		NUM_ENTITY = 5,
+		MAX_ENTITY_LENGTH = 6
+
+	};
+	static Entity entity[ NUM_ENTITY ];
+	static bool condenseWhiteSpace;
+};
+
+
+/** The parent class for everything in the Document Object Model.
+	(Except for attributes).
+	Nodes have siblings, a parent, and children. A node can be
+	in a document, or stand on its own. The type of a TiXmlNode
+	can be queried, and it can be cast to its more defined type.
+*/
+class TiXmlNode : public TiXmlBase
+{
+	friend class TiXmlDocument;
+	friend class TiXmlElement;
+
+public:
+	#ifdef TIXML_USE_STL	
+
+	    /** An input stream operator, for every class. Tolerant of newlines and
+		    formatting, but doesn't expect them.
+	    */
+	    friend std::istream& operator >> (std::istream& in, TiXmlNode& base);
+
+	    /** An output stream operator, for every class. Note that this outputs
+		    without any newlines or formatting, as opposed to Print(), which
+		    includes tabs and new lines.
+
+		    The operator<< and operator>> are not completely symmetric. Writing
+		    a node to a stream is very well defined. You'll get a nice stream
+		    of output, without any extra whitespace or newlines.
+		    
+		    But reading is not as well defined. (As it always is.) If you create
+		    a TiXmlElement (for example) and read that from an input stream,
+		    the text needs to define an element or junk will result. This is
+		    true of all input streams, but it's worth keeping in mind.
+
+		    A TiXmlDocument will read nodes until it reads a root element, and
+			all the children of that root element.
+	    */	
+	    friend std::ostream& operator<< (std::ostream& out, const TiXmlNode& base);
+
+		/// Appends the XML node or attribute to a std::string.
+		friend std::string& operator<< (std::string& out, const TiXmlNode& base );
+
+	#else
+	    // Used internally, not part of the public API.
+	    friend TIXML_OSTREAM& operator<< (TIXML_OSTREAM& out, const TiXmlNode& base);
+	#endif
+
+	/** The types of XML nodes supported by TinyXml. (All the
+			unsupported types are picked up by UNKNOWN.)
+	*/
+	enum NodeType
+	{
+		DOCUMENT,
+		ELEMENT,
+		COMMENT,
+		UNKNOWN,
+		TEXT,
+		DECLARATION,
+		TYPECOUNT
+	};
+
+	virtual ~TiXmlNode();
+
+	/** The meaning of 'value' changes for the specific type of
+		TiXmlNode.
+		@verbatim
+		Document:	filename of the xml file
+		Element:	name of the element
+		Comment:	the comment text
+		Unknown:	the tag contents
+		Text:		the text string
+		@endverbatim
+
+		The subclasses will wrap this function.
+	*/
+	const char * Value() const { return value.c_str (); }
+
+	/** Changes the value of the node. Defined as:
+		@verbatim
+		Document:	filename of the xml file
+		Element:	name of the element
+		Comment:	the comment text
+		Unknown:	the tag contents
+		Text:		the text string
+		@endverbatim
+	*/
+	void SetValue(const char * _value) { value = _value;}
+
+    #ifdef TIXML_USE_STL
+	/// STL std::string form.
+	void SetValue( const std::string& _value )    
+	{	  
+		StringToBuffer buf( _value );
+		SetValue( buf.buffer ? buf.buffer : "" );    	
+	}	
+	#endif
+
+	/// Delete all the children of this node. Does not affect 'this'.
+	void Clear();
+
+	/// One step up the DOM.
+	TiXmlNode* Parent()							{ return parent; }
+	const TiXmlNode* Parent() const				{ return parent; }
+
+	const TiXmlNode* FirstChild()	const	{ return firstChild; }		///< The first child of this node. Will be null if there are no children.
+	TiXmlNode* FirstChild()					{ return firstChild; }
+	const TiXmlNode* FirstChild( const char * value ) const;			///< The first child of this node with the matching 'value'. Will be null if none found.
+	TiXmlNode* FirstChild( const char * value );						///< The first child of this node with the matching 'value'. Will be null if none found.
+
+	const TiXmlNode* LastChild() const	{ return lastChild; }		/// The last child of this node. Will be null if there are no children.
+	TiXmlNode* LastChild()	{ return lastChild; }
+	const TiXmlNode* LastChild( const char * value ) const;			/// The last child of this node matching 'value'. Will be null if there are no children.
+	TiXmlNode* LastChild( const char * value );	
+
+    #ifdef TIXML_USE_STL
+	const TiXmlNode* FirstChild( const std::string& _value ) const	{	return FirstChild (_value.c_str ());	}	///< STL std::string form.
+	TiXmlNode* FirstChild( const std::string& _value )				{	return FirstChild (_value.c_str ());	}	///< STL std::string form.
+	const TiXmlNode* LastChild( const std::string& _value ) const	{	return LastChild (_value.c_str ());	}	///< STL std::string form.
+	TiXmlNode* LastChild( const std::string& _value )				{	return LastChild (_value.c_str ());	}	///< STL std::string form.
+	#endif
+
+	/** An alternate way to walk the children of a node.
+		One way to iterate over nodes is:
+		@verbatim
+			for( child = parent->FirstChild(); child; child = child->NextSibling() )
+		@endverbatim
+
+		IterateChildren does the same thing with the syntax:
+		@verbatim
+			child = 0;
+			while( child = parent->IterateChildren( child ) )
+		@endverbatim
+
+		IterateChildren takes the previous child as input and finds
+		the next one. If the previous child is null, it returns the
+		first. IterateChildren will return null when done.
+	*/
+	const TiXmlNode* IterateChildren( const TiXmlNode* previous ) const;
+	TiXmlNode* IterateChildren( TiXmlNode* previous );
+
+	/// This flavor of IterateChildren searches for children with a particular 'value'
+	const TiXmlNode* IterateChildren( const char * value, const TiXmlNode* previous ) const;
+	TiXmlNode* IterateChildren( const char * value, TiXmlNode* previous );
+
+    #ifdef TIXML_USE_STL
+	const TiXmlNode* IterateChildren( const std::string& _value, const TiXmlNode* previous ) const	{	return IterateChildren (_value.c_str (), previous);	}	///< STL std::string form.
+	TiXmlNode* IterateChildren( const std::string& _value, TiXmlNode* previous ) {	return IterateChildren (_value.c_str (), previous);	}	///< STL std::string form.
+	#endif
+
+	/** Add a new node related to this. Adds a child past the LastChild.
+		Returns a pointer to the new object or NULL if an error occured.
+	*/
+	TiXmlNode* InsertEndChild( const TiXmlNode& addThis );
+
+
+	/** Add a new node related to this. Adds a child past the LastChild.
+
+		NOTE: the node to be added is passed by pointer, and will be
+		henceforth owned (and deleted) by tinyXml. This method is efficient
+		and avoids an extra copy, but should be used with care as it
+		uses a different memory model than the other insert functions.
+
+		@sa InsertEndChild
+	*/
+	TiXmlNode* LinkEndChild( TiXmlNode* addThis );
+
+	/** Add a new node related to this. Adds a child before the specified child.
+		Returns a pointer to the new object or NULL if an error occured.
+	*/
+	TiXmlNode* InsertBeforeChild( TiXmlNode* beforeThis, const TiXmlNode& addThis );
+
+	/** Add a new node related to this. Adds a child after the specified child.
+		Returns a pointer to the new object or NULL if an error occured.
+	*/
+	TiXmlNode* InsertAfterChild(  TiXmlNode* afterThis, const TiXmlNode& addThis );
+
+	/** Replace a child of this node.
+		Returns a pointer to the new object or NULL if an error occured.
+	*/
+	TiXmlNode* ReplaceChild( TiXmlNode* replaceThis, const TiXmlNode& withThis );
+
+	/// Delete a child of this node.
+	bool RemoveChild( TiXmlNode* removeThis );
+
+	/// Navigate to a sibling node.
+	const TiXmlNode* PreviousSibling() const			{ return prev; }
+	TiXmlNode* PreviousSibling()						{ return prev; }
+
+	/// Navigate to a sibling node.
+	const TiXmlNode* PreviousSibling( const char * ) const;
+	TiXmlNode* PreviousSibling( const char * );
+
+    #ifdef TIXML_USE_STL
+	const TiXmlNode* PreviousSibling( const std::string& _value ) const	{	return PreviousSibling (_value.c_str ());	}	///< STL std::string form.
+	TiXmlNode* PreviousSibling( const std::string& _value ) 			{	return PreviousSibling (_value.c_str ());	}	///< STL std::string form.
+	const TiXmlNode* NextSibling( const std::string& _value) const		{	return NextSibling (_value.c_str ());	}	///< STL std::string form.
+	TiXmlNode* NextSibling( const std::string& _value) 					{	return NextSibling (_value.c_str ());	}	///< STL std::string form.
+	#endif
+
+	/// Navigate to a sibling node.
+	const TiXmlNode* NextSibling() const				{ return next; }
+	TiXmlNode* NextSibling()							{ return next; }
+
+	/// Navigate to a sibling node with the given 'value'.
+	const TiXmlNode* NextSibling( const char * ) const;
+	TiXmlNode* NextSibling( const char * );
+
+	/** Convenience function to get through elements.
+		Calls NextSibling and ToElement. Will skip all non-Element
+		nodes. Returns 0 if there is not another element.
+	*/
+	const TiXmlElement* NextSiblingElement() const;
+	TiXmlElement* NextSiblingElement();
+
+	/** Convenience function to get through elements.
+		Calls NextSibling and ToElement. Will skip all non-Element
+		nodes. Returns 0 if there is not another element.
+	*/
+	const TiXmlElement* NextSiblingElement( const char * ) const;
+	TiXmlElement* NextSiblingElement( const char * );
+
+    #ifdef TIXML_USE_STL
+	const TiXmlElement* NextSiblingElement( const std::string& _value) const	{	return NextSiblingElement (_value.c_str ());	}	///< STL std::string form.
+	TiXmlElement* NextSiblingElement( const std::string& _value)				{	return NextSiblingElement (_value.c_str ());	}	///< STL std::string form.
+	#endif
+
+	/// Convenience function to get through elements.
+	const TiXmlElement* FirstChildElement()	const;
+	TiXmlElement* FirstChildElement();
+
+	/// Convenience function to get through elements.
+	const TiXmlElement* FirstChildElement( const char * value ) const;
+	TiXmlElement* FirstChildElement( const char * value );
+
+    #ifdef TIXML_USE_STL
+	const TiXmlElement* FirstChildElement( const std::string& _value ) const	{	return FirstChildElement (_value.c_str ());	}	///< STL std::string form.
+	TiXmlElement* FirstChildElement( const std::string& _value )				{	return FirstChildElement (_value.c_str ());	}	///< STL std::string form.
+	#endif
+
+	/** Query the type (as an enumerated value, above) of this node.
+		The possible types are: DOCUMENT, ELEMENT, COMMENT,
+								UNKNOWN, TEXT, and DECLARATION.
+	*/
+	virtual int Type() const	{ return type; }
+
+	/** Return a pointer to the Document this node lives in.
+		Returns null if not in a document.
+	*/
+	const TiXmlDocument* GetDocument() const;
+	TiXmlDocument* GetDocument();
+
+	/// Returns true if this node has no children.
+	bool NoChildren() const						{ return !firstChild; }
+
+	const TiXmlDocument* ToDocument()	const		{ return ( this && type == DOCUMENT ) ? (const TiXmlDocument*) this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+	const TiXmlElement*  ToElement() const			{ return ( this && type == ELEMENT  ) ? (const TiXmlElement*)  this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+	const TiXmlComment*  ToComment() const			{ return ( this && type == COMMENT  ) ? (const TiXmlComment*)  this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+	const TiXmlUnknown*  ToUnknown() const			{ return ( this && type == UNKNOWN  ) ? (const TiXmlUnknown*)  this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+	const TiXmlText*	   ToText()    const		{ return ( this && type == TEXT     ) ? (const TiXmlText*)     this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+	const TiXmlDeclaration* ToDeclaration() const	{ return ( this && type == DECLARATION ) ? (const TiXmlDeclaration*) this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+
+	TiXmlDocument* ToDocument()			{ return ( this && type == DOCUMENT ) ? (TiXmlDocument*) this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+	TiXmlElement*  ToElement()			{ return ( this && type == ELEMENT  ) ? (TiXmlElement*)  this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+	TiXmlComment*  ToComment()			{ return ( this && type == COMMENT  ) ? (TiXmlComment*)  this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+	TiXmlUnknown*  ToUnknown()			{ return ( this && type == UNKNOWN  ) ? (TiXmlUnknown*)  this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+	TiXmlText*	   ToText()   			{ return ( this && type == TEXT     ) ? (TiXmlText*)     this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+	TiXmlDeclaration* ToDeclaration()	{ return ( this && type == DECLARATION ) ? (TiXmlDeclaration*) this : 0; } ///< Cast to a more defined type. Will return null not of the requested type.
+
+	/** Create an exact duplicate of this node and return it. The memory must be deleted
+		by the caller. 
+	*/
+	virtual TiXmlNode* Clone() const = 0;
+
+protected:
+	TiXmlNode( NodeType _type );
+
+	// Copy to the allocated object. Shared functionality between Clone, Copy constructor,
+	// and the assignment operator.
+	void CopyTo( TiXmlNode* target ) const;
+
+	#ifdef TIXML_USE_STL
+	    // The real work of the input operator.
+	    virtual void StreamIn( TIXML_ISTREAM* in, TIXML_STRING* tag ) = 0;
+	#endif
+
+	// Figure out what is at *p, and parse it. Returns null if it is not an xml node.
+	TiXmlNode* Identify( const char* start, TiXmlEncoding encoding );
+
+	// Internal Value function returning a TIXML_STRING
+	const TIXML_STRING& SValue() const	{ return value ; }
+
+	TiXmlNode*		parent;
+	NodeType		type;
+
+	TiXmlNode*		firstChild;
+	TiXmlNode*		lastChild;
+
+	TIXML_STRING	value;
+
+	TiXmlNode*		prev;
+	TiXmlNode*		next;
+
+private:
+	TiXmlNode( const TiXmlNode& );				// not implemented.
+	void operator=( const TiXmlNode& base );	// not allowed.
+};
+
+
+/** An attribute is a name-value pair. Elements have an arbitrary
+	number of attributes, each with a unique name.
+
+	@note The attributes are not TiXmlNodes, since they are not
+		  part of the tinyXML document object model. There are other
+		  suggested ways to look at this problem.
+*/
+class TiXmlAttribute : public TiXmlBase
+{
+	friend class TiXmlAttributeSet;
+
+public:
+	/// Construct an empty attribute.
+	TiXmlAttribute() : TiXmlBase()
+	{
+		document = 0;
+		prev = next = 0;
+	}
+
+	#ifdef TIXML_USE_STL
+	/// std::string constructor.
+	TiXmlAttribute( const std::string& _name, const std::string& _value )
+	{
+		name = _name;
+		value = _value;
+		document = 0;
+		prev = next = 0;
+	}
+	#endif
+
+	/// Construct an attribute with a name and value.
+	TiXmlAttribute( const char * _name, const char * _value )
+	{
+		name = _name;
+		value = _value;
+		document = 0;
+		prev = next = 0;
+	}
+
+	const char*		Name()  const		{ return name.c_str (); }		///< Return the name of this attribute.
+	const char*		Value() const		{ return value.c_str (); }		///< Return the value of this attribute.
+	const int       IntValue() const;									///< Return the value of this attribute, converted to an integer.
+	const double	DoubleValue() const;								///< Return the value of this attribute, converted to a double.
+
+	/** QueryIntValue examines the value string. It is an alternative to the
+		IntValue() method with richer error checking.
+		If the value is an integer, it is stored in 'value' and 
+		the call returns TIXML_SUCCESS. If it is not
+		an integer, it returns TIXML_WRONG_TYPE.
+
+		A specialized but useful call. Note that for success it returns 0,
+		which is the opposite of almost all other TinyXml calls.
+	*/
+	int QueryIntValue( int* value ) const;
+	/// QueryDoubleValue examines the value string. See QueryIntValue().
+	int QueryDoubleValue( double* value ) const;
+
+	void SetName( const char* _name )	{ name = _name; }				///< Set the name of this attribute.
+	void SetValue( const char* _value )	{ value = _value; }				///< Set the value.
+
+	void SetIntValue( int value );										///< Set the value from an integer.
+	void SetDoubleValue( double value );								///< Set the value from a double.
+
+    #ifdef TIXML_USE_STL
+	/// STL std::string form.
+	void SetName( const std::string& _name )	
+	{	
+		StringToBuffer buf( _name );
+		SetName ( buf.buffer ? buf.buffer : "error" );	
+	}
+	/// STL std::string form.	
+	void SetValue( const std::string& _value )	
+	{	
+		StringToBuffer buf( _value );
+		SetValue( buf.buffer ? buf.buffer : "error" );	
+	}
+	#endif
+
+	/// Get the next sibling attribute in the DOM. Returns null at end.
+	const TiXmlAttribute* Next() const;
+	TiXmlAttribute* Next();
+	/// Get the previous sibling attribute in the DOM. Returns null at beginning.
+	const TiXmlAttribute* Previous() const;
+	TiXmlAttribute* Previous();
+
+	bool operator==( const TiXmlAttribute& rhs ) const { return rhs.name == name; }
+	bool operator<( const TiXmlAttribute& rhs )	 const { return name < rhs.name; }
+	bool operator>( const TiXmlAttribute& rhs )  const { return name > rhs.name; }
+
+	/*	Attribute parsing starts: first letter of the name
+						 returns: the next char after the value end quote
+	*/
+	virtual const char* Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding );
+
+	// Prints this Attribute to a FILE stream.
+	virtual void Print( FILE* cfile, int depth ) const;
+
+	virtual void StreamOut( TIXML_OSTREAM * out ) const;
+	// [internal use]
+	// Set the document pointer so the attribute can report errors.
+	void SetDocument( TiXmlDocument* doc )	{ document = doc; }
+
+private:
+	TiXmlAttribute( const TiXmlAttribute& );				// not implemented.
+	void operator=( const TiXmlAttribute& base );	// not allowed.
+
+	TiXmlDocument*	document;	// A pointer back to a document, for error reporting.
+	TIXML_STRING name;
+	TIXML_STRING value;
+	TiXmlAttribute*	prev;
+	TiXmlAttribute*	next;
+};
+
+
+/*	A class used to manage a group of attributes.
+	It is only used internally, both by the ELEMENT and the DECLARATION.
+	
+	The set can be changed transparent to the Element and Declaration
+	classes that use it, but NOT transparent to the Attribute
+	which has to implement a next() and previous() method. Which makes
+	it a bit problematic and prevents the use of STL.
+
+	This version is implemented with circular lists because:
+		- I like circular lists
+		- it demonstrates some independence from the (typical) doubly linked list.
+*/
+class TiXmlAttributeSet
+{
+public:
+	TiXmlAttributeSet();
+	~TiXmlAttributeSet();
+
+	void Add( TiXmlAttribute* attribute );
+	void Remove( TiXmlAttribute* attribute );
+
+	const TiXmlAttribute* First()	const	{ return ( sentinel.next == &sentinel ) ? 0 : sentinel.next; }
+	TiXmlAttribute* First()					{ return ( sentinel.next == &sentinel ) ? 0 : sentinel.next; }
+	const TiXmlAttribute* Last() const		{ return ( sentinel.prev == &sentinel ) ? 0 : sentinel.prev; }
+	TiXmlAttribute* Last()					{ return ( sentinel.prev == &sentinel ) ? 0 : sentinel.prev; }
+
+	const TiXmlAttribute*	Find( const char * name ) const;
+	TiXmlAttribute*	Find( const char * name );
+
+private:
+	//*ME:	Because of hidden/disabled copy-construktor in TiXmlAttribute (sentinel-element),
+	//*ME:	this class must be also use a hidden/disabled copy-constructor !!!
+	TiXmlAttributeSet( const TiXmlAttributeSet& );	// not allowed
+	void operator=( const TiXmlAttributeSet& );	// not allowed (as TiXmlAttribute)
+
+	TiXmlAttribute sentinel;
+};
+
+
+/** The element is a container class. It has a value, the element name,
+	and can contain other elements, text, comments, and unknowns.
+	Elements also contain an arbitrary number of attributes.
+*/
+class TiXmlElement : public TiXmlNode
+{
+public:
+	/// Construct an element.
+	TiXmlElement (const char * in_value);
+
+	#ifdef TIXML_USE_STL
+	/// std::string constructor.
+	TiXmlElement( const std::string& _value );
+	#endif
+
+	TiXmlElement( const TiXmlElement& );
+
+	void operator=( const TiXmlElement& base );
+
+	virtual ~TiXmlElement();
+
+	/** Given an attribute name, Attribute() returns the value
+		for the attribute of that name, or null if none exists.
+	*/
+	const char* Attribute( const char* name ) const;
+
+	/** Given an attribute name, Attribute() returns the value
+		for the attribute of that name, or null if none exists.
+		If the attribute exists and can be converted to an integer,
+		the integer value will be put in the return 'i', if 'i'
+		is non-null.
+	*/
+	const char* Attribute( const char* name, int* i ) const;
+
+	/** Given an attribute name, Attribute() returns the value
+		for the attribute of that name, or null if none exists.
+		If the attribute exists and can be converted to an double,
+		the double value will be put in the return 'd', if 'd'
+		is non-null.
+	*/
+	const char* Attribute( const char* name, double* d ) const;
+
+	/** QueryIntAttribute examines the attribute - it is an alternative to the
+		Attribute() method with richer error checking.
+		If the attribute is an integer, it is stored in 'value' and 
+		the call returns TIXML_SUCCESS. If it is not
+		an integer, it returns TIXML_WRONG_TYPE. If the attribute
+		does not exist, then TIXML_NO_ATTRIBUTE is returned.
+	*/	
+	int QueryIntAttribute( const char* name, int* value ) const;
+	/// QueryDoubleAttribute examines the attribute - see QueryIntAttribute().
+	int QueryDoubleAttribute( const char* name, double* value ) const;
+	/// QueryFloatAttribute examines the attribute - see QueryIntAttribute().
+	int QueryDoubleAttribute( const char* name, float* value ) const {
+		double d;
+		int result = QueryDoubleAttribute( name, &d );
+		*value = (float)d;
+		return result;
+	}
+
+	/** Sets an attribute of name to a given value. The attribute
+		will be created if it does not exist, or changed if it does.
+	*/
+	void SetAttribute( const char* name, const char * value );
+
+    #ifdef TIXML_USE_STL
+	const char* Attribute( const std::string& name ) const				{ return Attribute( name.c_str() ); }
+	const char* Attribute( const std::string& name, int* i ) const		{ return Attribute( name.c_str(), i ); }
+	const char* Attribute( const std::string& name, double* d ) const	{ return Attribute( name.c_str(), d ); }
+	int QueryIntAttribute( const std::string& name, int* value ) const	{ return QueryIntAttribute( name.c_str(), value ); }
+	int QueryDoubleAttribute( const std::string& name, double* value ) const { return QueryDoubleAttribute( name.c_str(), value ); }
+
+	/// STL std::string form.
+	void SetAttribute( const std::string& name, const std::string& _value )	
+	{	
+		StringToBuffer n( name );
+		StringToBuffer v( _value );
+		if ( n.buffer && v.buffer )
+			SetAttribute (n.buffer, v.buffer );	
+	}	
+	///< STL std::string form.
+	void SetAttribute( const std::string& name, int _value )	
+	{	
+		StringToBuffer n( name );
+		if ( n.buffer )
+			SetAttribute (n.buffer, _value);	
+	}	
+	#endif
+
+	/** Sets an attribute of name to a given value. The attribute
+		will be created if it does not exist, or changed if it does.
+	*/
+	void SetAttribute( const char * name, int value );
+
+	/** Sets an attribute of name to a given value. The attribute
+		will be created if it does not exist, or changed if it does.
+	*/
+	void SetDoubleAttribute( const char * name, double value );
+
+	/** Deletes an attribute with the given name.
+	*/
+	void RemoveAttribute( const char * name );
+    #ifdef TIXML_USE_STL
+	void RemoveAttribute( const std::string& name )	{	RemoveAttribute (name.c_str ());	}	///< STL std::string form.
+	#endif
+
+	const TiXmlAttribute* FirstAttribute() const	{ return attributeSet.First(); }		///< Access the first attribute in this element.
+	TiXmlAttribute* FirstAttribute() 				{ return attributeSet.First(); }
+	const TiXmlAttribute* LastAttribute()	const 	{ return attributeSet.Last(); }		///< Access the last attribute in this element.
+	TiXmlAttribute* LastAttribute()					{ return attributeSet.Last(); }
+
+	/// Creates a new Element and returns it - the returned element is a copy.
+	virtual TiXmlNode* Clone() const;
+	// Print the Element to a FILE stream.
+	virtual void Print( FILE* cfile, int depth ) const;
+
+	/*	Attribtue parsing starts: next char past '<'
+						 returns: next char past '>'
+	*/
+	virtual const char* Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding );
+
+protected:
+
+	void CopyTo( TiXmlElement* target ) const;
+	void ClearThis();	// like clear, but initializes 'this' object as well
+
+	// Used to be public [internal use]
+	#ifdef TIXML_USE_STL
+	    virtual void StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag );
+	#endif
+	virtual void StreamOut( TIXML_OSTREAM * out ) const;
+
+	/*	[internal use]
+		Reads the "value" of the element -- another element, or text.
+		This should terminate with the current end tag.
+	*/
+	const char* ReadValue( const char* in, TiXmlParsingData* prevData, TiXmlEncoding encoding );
+
+private:
+
+	TiXmlAttributeSet attributeSet;
+};
+
+
+/**	An XML comment.
+*/
+class TiXmlComment : public TiXmlNode
+{
+public:
+	/// Constructs an empty comment.
+	TiXmlComment() : TiXmlNode( TiXmlNode::COMMENT ) {}
+	TiXmlComment( const TiXmlComment& );
+	void operator=( const TiXmlComment& base );
+
+	virtual ~TiXmlComment()	{}
+
+	/// Returns a copy of this Comment.
+	virtual TiXmlNode* Clone() const;
+	/// Write this Comment to a FILE stream.
+	virtual void Print( FILE* cfile, int depth ) const;
+
+	/*	Attribtue parsing starts: at the ! of the !--
+						 returns: next char past '>'
+	*/
+	virtual const char* Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding );
+
+protected:
+	void CopyTo( TiXmlComment* target ) const;
+
+	// used to be public
+	#ifdef TIXML_USE_STL
+	    virtual void StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag );
+	#endif
+	virtual void StreamOut( TIXML_OSTREAM * out ) const;
+
+private:
+
+};
+
+
+/** XML text. Contained in an element.
+*/
+class TiXmlText : public TiXmlNode
+{
+	friend class TiXmlElement;
+public:
+	/// Constructor.
+	TiXmlText (const char * initValue) : TiXmlNode (TiXmlNode::TEXT)
+	{
+		SetValue( initValue );
+	}
+	virtual ~TiXmlText() {}
+
+	#ifdef TIXML_USE_STL
+	/// Constructor.
+	TiXmlText( const std::string& initValue ) : TiXmlNode (TiXmlNode::TEXT)
+	{
+		SetValue( initValue );
+	}
+	#endif
+
+	TiXmlText( const TiXmlText& copy ) : TiXmlNode( TiXmlNode::TEXT )	{ copy.CopyTo( this ); }
+	void operator=( const TiXmlText& base )							 	{ base.CopyTo( this ); }
+
+	/// Write this text object to a FILE stream.
+	virtual void Print( FILE* cfile, int depth ) const;
+
+	virtual const char* Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding );
+
+protected :
+	///  [internal use] Creates a new Element and returns it.
+	virtual TiXmlNode* Clone() const;
+	void CopyTo( TiXmlText* target ) const;
+
+	virtual void StreamOut ( TIXML_OSTREAM * out ) const;
+	bool Blank() const;	// returns true if all white space and new lines
+	// [internal use]
+	#ifdef TIXML_USE_STL
+	    virtual void StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag );
+	#endif
+
+private:
+};
+
+
+/** In correct XML the declaration is the first entry in the file.
+	@verbatim
+		<?xml version="1.0" standalone="yes"?>
+	@endverbatim
+
+	TinyXml will happily read or write files without a declaration,
+	however. There are 3 possible attributes to the declaration:
+	version, encoding, and standalone.
+
+	Note: In this version of the code, the attributes are
+	handled as special cases, not generic attributes, simply
+	because there can only be at most 3 and they are always the same.
+*/
+class TiXmlDeclaration : public TiXmlNode
+{
+public:
+	/// Construct an empty declaration.
+	TiXmlDeclaration()   : TiXmlNode( TiXmlNode::DECLARATION ) {}
+
+#ifdef TIXML_USE_STL
+	/// Constructor.
+	TiXmlDeclaration(	const std::string& _version,
+						const std::string& _encoding,
+						const std::string& _standalone );
+#endif
+
+	/// Construct.
+	TiXmlDeclaration(	const char* _version,
+						const char* _encoding,
+						const char* _standalone );
+
+	TiXmlDeclaration( const TiXmlDeclaration& copy );
+	void operator=( const TiXmlDeclaration& copy );
+
+	virtual ~TiXmlDeclaration()	{}
+
+	/// Version. Will return an empty string if none was found.
+	const char *Version() const			{ return version.c_str (); }
+	/// Encoding. Will return an empty string if none was found.
+	const char *Encoding() const		{ return encoding.c_str (); }
+	/// Is this a standalone document?
+	const char *Standalone() const		{ return standalone.c_str (); }
+
+	/// Creates a copy of this Declaration and returns it.
+	virtual TiXmlNode* Clone() const;
+	/// Print this declaration to a FILE stream.
+	virtual void Print( FILE* cfile, int depth ) const;
+
+	virtual const char* Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding );
+
+protected:
+	void CopyTo( TiXmlDeclaration* target ) const;
+	// used to be public
+	#ifdef TIXML_USE_STL
+	    virtual void StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag );
+	#endif
+	virtual void StreamOut ( TIXML_OSTREAM * out) const;
+
+private:
+
+	TIXML_STRING version;
+	TIXML_STRING encoding;
+	TIXML_STRING standalone;
+};
+
+
+/** Any tag that tinyXml doesn't recognize is saved as an
+	unknown. It is a tag of text, but should not be modified.
+	It will be written back to the XML, unchanged, when the file
+	is saved.
+
+	DTD tags get thrown into TiXmlUnknowns.
+*/
+class TiXmlUnknown : public TiXmlNode
+{
+public:
+	TiXmlUnknown() : TiXmlNode( TiXmlNode::UNKNOWN )	{}
+	virtual ~TiXmlUnknown() {}
+
+	TiXmlUnknown( const TiXmlUnknown& copy ) : TiXmlNode( TiXmlNode::UNKNOWN )		{ copy.CopyTo( this ); }
+	void operator=( const TiXmlUnknown& copy )										{ copy.CopyTo( this ); }
+
+	/// Creates a copy of this Unknown and returns it.
+	virtual TiXmlNode* Clone() const;
+	/// Print this Unknown to a FILE stream.
+	virtual void Print( FILE* cfile, int depth ) const;
+
+	virtual const char* Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding );
+
+protected:
+	void CopyTo( TiXmlUnknown* target ) const;
+
+	#ifdef TIXML_USE_STL
+	    virtual void StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag );
+	#endif
+	virtual void StreamOut ( TIXML_OSTREAM * out ) const;
+
+private:
+
+};
+
+
+/** Always the top level node. A document binds together all the
+	XML pieces. It can be saved, loaded, and printed to the screen.
+	The 'value' of a document node is the xml file name.
+*/
+class TiXmlDocument : public TiXmlNode
+{
+public:
+	/// Create an empty document, that has no name.
+	TiXmlDocument();
+	/// Create a document with a name. The name of the document is also the filename of the xml.
+	TiXmlDocument( const char * documentName );
+
+	#ifdef TIXML_USE_STL
+	/// Constructor.
+	TiXmlDocument( const std::string& documentName );
+	#endif
+
+	TiXmlDocument( const TiXmlDocument& copy );
+	void operator=( const TiXmlDocument& copy );
+
+	virtual ~TiXmlDocument() {}
+
+	/** Load a file using the current document value.
+		Returns true if successful. Will delete any existing
+		document data before loading.
+	*/
+	bool LoadFile( TiXmlEncoding encoding = TIXML_DEFAULT_ENCODING );
+	/// Save a file using the current document value. Returns true if successful.
+	bool SaveFile() const;
+	/// Load a file using the given filename. Returns true if successful.
+	bool LoadFile( const char * filename, TiXmlEncoding encoding = TIXML_DEFAULT_ENCODING );
+	/// Save a file using the given filename. Returns true if successful.
+	bool SaveFile( const char * filename ) const;
+
+	#ifdef TIXML_USE_STL
+	bool LoadFile( const std::string& filename, TiXmlEncoding encoding = TIXML_DEFAULT_ENCODING )			///< STL std::string version.
+	{
+		StringToBuffer f( filename );
+		return ( f.buffer && LoadFile( f.buffer, encoding ));
+	}
+	bool SaveFile( const std::string& filename ) const		///< STL std::string version.
+	{
+		StringToBuffer f( filename );
+		return ( f.buffer && SaveFile( f.buffer ));
+	}
+	#endif
+
+	/** Parse the given null terminated block of xml data. Passing in an encoding to this
+		method (either TIXML_ENCODING_LEGACY or TIXML_ENCODING_UTF8 will force TinyXml
+		to use that encoding, regardless of what TinyXml might otherwise try to detect.
+	*/
+	virtual const char* Parse( const char* p, TiXmlParsingData* data = 0, TiXmlEncoding encoding = TIXML_DEFAULT_ENCODING );
+
+	/** Get the root element -- the only top level element -- of the document.
+		In well formed XML, there should only be one. TinyXml is tolerant of
+		multiple elements at the document level.
+	*/
+	const TiXmlElement* RootElement() const		{ return FirstChildElement(); }
+	TiXmlElement* RootElement()					{ return FirstChildElement(); }
+
+	/** If an error occurs, Error will be set to true. Also,
+		- The ErrorId() will contain the integer identifier of the error (not generally useful)
+		- The ErrorDesc() method will return the name of the error. (very useful)
+		- The ErrorRow() and ErrorCol() will return the location of the error (if known)
+	*/	
+	bool Error() const						{ return error; }
+
+	/// Contains a textual (english) description of the error if one occurs.
+	const char * ErrorDesc() const	{ return errorDesc.c_str (); }
+
+	/** Generally, you probably want the error string ( ErrorDesc() ). But if you
+		prefer the ErrorId, this function will fetch it.
+	*/
+	const int ErrorId()	const				{ return errorId; }
+
+	/** Returns the location (if known) of the error. The first column is column 1, 
+		and the first row is row 1. A value of 0 means the row and column wasn't applicable
+		(memory errors, for example, have no row/column) or the parser lost the error. (An
+		error in the error reporting, in that case.)
+
+		@sa SetTabSize, Row, Column
+	*/
+	int ErrorRow()	{ return errorLocation.row+1; }
+	int ErrorCol()	{ return errorLocation.col+1; }	///< The column where the error occured. See ErrorRow()
+
+	/** By calling this method, with a tab size
+		greater than 0, the row and column of each node and attribute is stored
+		when the file is loaded. Very useful for tracking the DOM back in to
+		the source file.
+
+		The tab size is required for calculating the location of nodes. If not
+		set, the default of 4 is used. The tabsize is set per document. Setting
+		the tabsize to 0 disables row/column tracking.
+
+		Note that row and column tracking is not supported when using operator>>.
+
+		The tab size needs to be enabled before the parse or load. Correct usage:
+		@verbatim
+		TiXmlDocument doc;
+		doc.SetTabSize( 8 );
+		doc.Load( "myfile.xml" );
+		@endverbatim
+
+		@sa Row, Column
+	*/
+	void SetTabSize( int _tabsize )		{ tabsize = _tabsize; }
+
+	int TabSize() const	{ return tabsize; }
+
+	/** If you have handled the error, it can be reset with this call. The error
+		state is automatically cleared if you Parse a new XML block.
+	*/
+	void ClearError()						{	error = false; 
+												errorId = 0; 
+												errorDesc = ""; 
+												errorLocation.row = errorLocation.col = 0; 
+												//errorLocation.last = 0; 
+											}
+
+	/** Dump the document to standard out. */
+	void Print() const						{ Print( stdout, 0 ); }
+
+	/// Print this Document to a FILE stream.
+	virtual void Print( FILE* cfile, int depth = 0 ) const;
+	// [internal use]
+	void SetError( int err, const char* errorLocation, TiXmlParsingData* prevData, TiXmlEncoding encoding );
+
+protected :
+	virtual void StreamOut ( TIXML_OSTREAM * out) const;
+	// [internal use]
+	virtual TiXmlNode* Clone() const;
+	#ifdef TIXML_USE_STL
+	    virtual void StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag );
+	#endif
+
+private:
+	void CopyTo( TiXmlDocument* target ) const;
+
+	bool error;
+	int  errorId;
+	TIXML_STRING errorDesc;
+	int tabsize;
+	TiXmlCursor errorLocation;
+};
+
+
+/**
+	A TiXmlHandle is a class that wraps a node pointer with null checks; this is
+	an incredibly useful thing. Note that TiXmlHandle is not part of the TinyXml
+	DOM structure. It is a separate utility class.
+
+	Take an example:
+	@verbatim
+	<Document>
+		<Element attributeA = "valueA">
+			<Child attributeB = "value1" />
+			<Child attributeB = "value2" />
+		</Element>
+	<Document>
+	@endverbatim
+
+	Assuming you want the value of "attributeB" in the 2nd "Child" element, it's very 
+	easy to write a *lot* of code that looks like:
+
+	@verbatim
+	TiXmlElement* root = document.FirstChildElement( "Document" );
+	if ( root )
+	{
+		TiXmlElement* element = root->FirstChildElement( "Element" );
+		if ( element )
+		{
+			TiXmlElement* child = element->FirstChildElement( "Child" );
+			if ( child )
+			{
+				TiXmlElement* child2 = child->NextSiblingElement( "Child" );
+				if ( child2 )
+				{
+					// Finally do something useful.
+	@endverbatim
+
+	And that doesn't even cover "else" cases. TiXmlHandle addresses the verbosity
+	of such code. A TiXmlHandle checks for null	pointers so it is perfectly safe 
+	and correct to use:
+
+	@verbatim
+	TiXmlHandle docHandle( &document );
+	TiXmlElement* child2 = docHandle.FirstChild( "Document" ).FirstChild( "Element" ).Child( "Child", 1 ).Element();
+	if ( child2 )
+	{
+		// do something useful
+	@endverbatim
+
+	Which is MUCH more concise and useful.
+
+	It is also safe to copy handles - internally they are nothing more than node pointers.
+	@verbatim
+	TiXmlHandle handleCopy = handle;
+	@endverbatim
+
+	What they should not be used for is iteration:
+
+	@verbatim
+	int i=0; 
+	while ( true )
+	{
+		TiXmlElement* child = docHandle.FirstChild( "Document" ).FirstChild( "Element" ).Child( "Child", i ).Element();
+		if ( !child )
+			break;
+		// do something
+		++i;
+	}
+	@endverbatim
+
+	It seems reasonable, but it is in fact two embedded while loops. The Child method is 
+	a linear walk to find the element, so this code would iterate much more than it needs 
+	to. Instead, prefer:
+
+	@verbatim
+	TiXmlElement* child = docHandle.FirstChild( "Document" ).FirstChild( "Element" ).FirstChild( "Child" ).Element();
+
+	for( child; child; child=child->NextSiblingElement() )
+	{
+		// do something
+	}
+	@endverbatim
+*/
+class TiXmlHandle
+{
+public:
+	/// Create a handle from any node (at any depth of the tree.) This can be a null pointer.
+	TiXmlHandle( TiXmlNode* node )					{ this->node = node; }
+	/// Copy constructor
+	TiXmlHandle( const TiXmlHandle& ref )			{ this->node = ref.node; }
+	TiXmlHandle operator=( const TiXmlHandle& ref ) { this->node = ref.node; return *this; }
+
+	/// Return a handle to the first child node.
+	TiXmlHandle FirstChild() const;
+	/// Return a handle to the first child node with the given name.
+	TiXmlHandle FirstChild( const char * value ) const;
+	/// Return a handle to the first child element.
+	TiXmlHandle FirstChildElement() const;
+	/// Return a handle to the first child element with the given name.
+	TiXmlHandle FirstChildElement( const char * value ) const;
+
+	/** Return a handle to the "index" child with the given name. 
+		The first child is 0, the second 1, etc.
+	*/
+	TiXmlHandle Child( const char* value, int index ) const;
+	/** Return a handle to the "index" child. 
+		The first child is 0, the second 1, etc.
+	*/
+	TiXmlHandle Child( int index ) const;
+	/** Return a handle to the "index" child element with the given name. 
+		The first child element is 0, the second 1, etc. Note that only TiXmlElements
+		are indexed: other types are not counted.
+	*/
+	TiXmlHandle ChildElement( const char* value, int index ) const;
+	/** Return a handle to the "index" child element. 
+		The first child element is 0, the second 1, etc. Note that only TiXmlElements
+		are indexed: other types are not counted.
+	*/
+	TiXmlHandle ChildElement( int index ) const;
+
+	#ifdef TIXML_USE_STL
+	TiXmlHandle FirstChild( const std::string& _value ) const				{ return FirstChild( _value.c_str() ); }
+	TiXmlHandle FirstChildElement( const std::string& _value ) const		{ return FirstChildElement( _value.c_str() ); }
+
+	TiXmlHandle Child( const std::string& _value, int index ) const			{ return Child( _value.c_str(), index ); }
+	TiXmlHandle ChildElement( const std::string& _value, int index ) const	{ return ChildElement( _value.c_str(), index ); }
+	#endif
+
+	/// Return the handle as a TiXmlNode. This may return null.
+	TiXmlNode* Node() const			{ return node; } 
+	/// Return the handle as a TiXmlElement. This may return null.
+	TiXmlElement* Element() const	{ return ( ( node && node->ToElement() ) ? node->ToElement() : 0 ); }
+	/// Return the handle as a TiXmlText. This may return null.
+	TiXmlText* Text() const			{ return ( ( node && node->ToText() ) ? node->ToText() : 0 ); }
+	/// Return the handle as a TiXmlUnknown. This may return null;
+	TiXmlUnknown* Unknown() const			{ return ( ( node && node->ToUnknown() ) ? node->ToUnknown() : 0 ); }
+
+private:
+	TiXmlNode* node;
+};
+
+#ifdef _MSC_VER
+#pragma warning( default : 4530 )
+#pragma warning( default : 4786 )
+#endif
+
+#endif
+
diff --git a/updater/tinyxmlerror.cpp b/updater/tinyxmlerror.cpp
new file mode 100644
index 0000000..b04add7
--- /dev/null
+++ b/updater/tinyxmlerror.cpp
@@ -0,0 +1,51 @@
+/*
+www.sourceforge.net/projects/tinyxml
+Original code (2.0 and earlier )copyright (c) 2000-2002 Lee Thomason (www.grinninglizard.com)
+
+This software is provided 'as-is', without any express or implied 
+warranty. In no event will the authors be held liable for any 
+damages arising from the use of this software.
+
+Permission is granted to anyone to use this software for any 
+purpose, including commercial applications, and to alter it and 
+redistribute it freely, subject to the following restrictions:
+
+1. The origin of this software must not be misrepresented; you must
+not claim that you wrote the original software. If you use this
+software in a product, an acknowledgment in the product documentation
+would be appreciated but is not required.
+
+2. Altered source versions must be plainly marked as such, and
+must not be misrepresented as being the original software.
+
+3. This notice may not be removed or altered from any source
+distribution.
+*/
+
+#include "tinyxml.h"
+
+// The goal of the seperate error file is to make the first
+// step towards localization. tinyxml (currently) only supports
+// latin-1, but at least the error messages could now be translated.
+//
+// It also cleans up the code a bit.
+//
+
+const char* TiXmlBase::errorString[ TIXML_ERROR_STRING_COUNT ] =
+{
+	"No error",
+	"Error",
+	"Failed to open file",
+	"Memory allocation failed.",
+	"Error parsing Element.",
+	"Failed to read Element name",
+	"Error reading Element value.",
+	"Error reading Attributes.",
+	"Error: empty tag.",
+	"Error reading end tag.",
+	"Error parsing Unknown.",
+	"Error parsing Comment.",
+	"Error parsing Declaration.",
+	"Error document empty.",
+	"Error null (0) or unexpected EOF found in input stream.",
+};
diff --git a/updater/tinyxmlparser.cpp b/updater/tinyxmlparser.cpp
new file mode 100644
index 0000000..56917b6
--- /dev/null
+++ b/updater/tinyxmlparser.cpp
@@ -0,0 +1,1508 @@
+/*
+www.sourceforge.net/projects/tinyxml
+Original code (2.0 and earlier )copyright (c) 2000-2002 Lee Thomason (www.grinninglizard.com)
+
+This software is provided 'as-is', without any express or implied 
+warranty. In no event will the authors be held liable for any 
+damages arising from the use of this software.
+
+Permission is granted to anyone to use this software for any 
+purpose, including commercial applications, and to alter it and 
+redistribute it freely, subject to the following restrictions:
+
+1. The origin of this software must not be misrepresented; you must 
+not claim that you wrote the original software. If you use this
+software in a product, an acknowledgment in the product documentation
+would be appreciated but is not required.
+
+2. Altered source versions must be plainly marked as such, and 
+must not be misrepresented as being the original software.
+
+3. This notice may not be removed or altered from any source 
+distribution.
+*/
+
+#include "tinyxml.h"
+#include <ctype.h>
+#include <stddef.h>
+
+//#define DEBUG_PARSER
+
+// Note tha "PutString" hardcodes the same list. This
+// is less flexible than it appears. Changing the entries
+// or order will break putstring.	
+TiXmlBase::Entity TiXmlBase::entity[ NUM_ENTITY ] = 
+{
+	{ "&amp;",  5, '&' },
+	{ "&lt;",   4, '<' },
+	{ "&gt;",   4, '>' },
+	{ "&quot;", 6, '\"' },
+	{ "&apos;", 6, '\'' }
+};
+
+// Bunch of unicode info at:
+//		http://www.unicode.org/faq/utf_bom.html
+// Including the basic of this table, which determines the #bytes in the
+// sequence from the lead byte. 1 placed for invalid sequences --
+// although the result will be junk, pass it through as much as possible.
+// Beware of the non-characters in UTF-8:	
+//				ef bb bf (Microsoft "lead bytes")
+//				ef bf be
+//				ef bf bf 
+
+const unsigned char TIXML_UTF_LEAD_0 = 0xefU;
+const unsigned char TIXML_UTF_LEAD_1 = 0xbbU;
+const unsigned char TIXML_UTF_LEAD_2 = 0xbfU;
+
+const int TiXmlBase::utf8ByteTable[256] = 
+{
+	//	0	1	2	3	4	5	6	7	8	9	a	b	c	d	e	f
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0x00
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0x10
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0x20
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0x30
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0x40
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0x50
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0x60
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0x70	End of ASCII range
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0x80 0x80 to 0xc1 invalid
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0x90 
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0xa0 
+		1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	// 0xb0 
+		1,	1,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	// 0xc0 0xc2 to 0xdf 2 byte
+		2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	2,	// 0xd0
+		3,	3,	3,	3,	3,	3,	3,	3,	3,	3,	3,	3,	3,	3,	3,	3,	// 0xe0 0xe0 to 0xef 3 byte
+		4,	4,	4,	4,	4,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1,	1	// 0xf0 0xf0 to 0xf4 4 byte, 0xf5 and higher invalid
+};
+
+
+void TiXmlBase::ConvertUTF32ToUTF8( unsigned long input, char* output, int* length )
+{
+	const unsigned long BYTE_MASK = 0xBF;
+	const unsigned long BYTE_MARK = 0x80;
+	const unsigned long FIRST_BYTE_MARK[7] = { 0x00, 0x00, 0xC0, 0xE0, 0xF0, 0xF8, 0xFC };
+
+	if (input < 0x80) 
+		*length = 1;
+	else if ( input < 0x800 )
+		*length = 2;
+	else if ( input < 0x10000 )
+		*length = 3;
+	else if ( input < 0x200000 )
+		*length = 4;
+	else
+		{ *length = 0; return; }	// This code won't covert this correctly anyway.
+
+	output += *length;
+
+	// Scary scary fall throughs.
+	switch (*length) 
+	{
+		case 4:
+			--output; 
+			*output = (char)((input | BYTE_MARK) & BYTE_MASK); 
+			input >>= 6;
+		case 3:
+			--output; 
+			*output = (char)((input | BYTE_MARK) & BYTE_MASK); 
+			input >>= 6;
+		case 2:
+			--output; 
+			*output = (char)((input | BYTE_MARK) & BYTE_MASK); 
+			input >>= 6;
+		case 1:
+			--output; 
+			*output = (char)(input | FIRST_BYTE_MARK[*length]);
+	}
+}
+
+
+/*static*/ int TiXmlBase::IsAlpha( unsigned char anyByte, TiXmlEncoding /*encoding*/ )
+{
+	// This will only work for low-ascii, everything else is assumed to be a valid
+	// letter. I'm not sure this is the best approach, but it is quite tricky trying
+	// to figure out alhabetical vs. not across encoding. So take a very 
+	// conservative approach.
+
+//	if ( encoding == TIXML_ENCODING_UTF8 )
+//	{
+		if ( anyByte < 127 )
+			return isalpha( anyByte );
+		else
+			return 1;	// What else to do? The unicode set is huge...get the english ones right.
+//	}
+//	else
+//	{
+//		return isalpha( anyByte );
+//	}
+}
+
+
+/*static*/ int TiXmlBase::IsAlphaNum( unsigned char anyByte, TiXmlEncoding /*encoding*/ )
+{
+	// This will only work for low-ascii, everything else is assumed to be a valid
+	// letter. I'm not sure this is the best approach, but it is quite tricky trying
+	// to figure out alhabetical vs. not across encoding. So take a very 
+	// conservative approach.
+
+//	if ( encoding == TIXML_ENCODING_UTF8 )
+//	{
+		if ( anyByte < 127 )
+			return isalnum( anyByte );
+		else
+			return 1;	// What else to do? The unicode set is huge...get the english ones right.
+//	}
+//	else
+//	{
+//		return isalnum( anyByte );
+//	}
+}
+
+
+class TiXmlParsingData
+{
+	friend class TiXmlDocument;
+  public:
+	void Stamp( const char* now, TiXmlEncoding encoding );
+
+	const TiXmlCursor& Cursor()	{ return cursor; }
+
+  private:
+	// Only used by the document!
+	TiXmlParsingData( const char* start, int _tabsize, int row, int col )
+	{
+		assert( start );
+		stamp = start;
+		tabsize = _tabsize;
+		cursor.row = row;
+		cursor.col = col;
+	}
+
+	TiXmlCursor		cursor;
+	const char*		stamp;
+	int				tabsize;
+};
+
+
+void TiXmlParsingData::Stamp( const char* now, TiXmlEncoding encoding )
+{
+	assert( now );
+
+	// Do nothing if the tabsize is 0.
+	if ( tabsize < 1 )
+	{
+		return;
+	}
+
+	// Get the current row, column.
+	int row = cursor.row;
+	int col = cursor.col;
+	const char* p = stamp;
+	assert( p );
+
+	while ( p < now )
+	{
+		// Treat p as unsigned, so we have a happy compiler.
+		const unsigned char* pU = (const unsigned char*)p;
+
+		// Code contributed by Fletcher Dunn: (modified by lee)
+		switch (*pU) {
+			case 0:
+				// We *should* never get here, but in case we do, don't
+				// advance past the terminating null character, ever
+				return;
+
+			case '\r':
+				// bump down to the next line
+				++row;
+				col = 0;				
+				// Eat the character
+				++p;
+
+				// Check for \r\n sequence, and treat this as a single character
+				if (*p == '\n') {
+					++p;
+				}
+				break;
+
+			case '\n':
+				// bump down to the next line
+				++row;
+				col = 0;
+
+				// Eat the character
+				++p;
+
+				// Check for \n\r sequence, and treat this as a single
+				// character.  (Yes, this bizarre thing does occur still
+				// on some arcane platforms...)
+				if (*p == '\r') {
+					++p;
+				}
+				break;
+
+			case '\t':
+				// Eat the character
+				++p;
+
+				// Skip to next tab stop
+				col = (col / tabsize + 1) * tabsize;
+				break;
+
+			case TIXML_UTF_LEAD_0:
+				if ( encoding == TIXML_ENCODING_UTF8 )
+				{
+					if ( *(p+1) && *(p+2) )
+					{
+						// In these cases, don't advance the column. These are
+						// 0-width spaces.
+						if ( *(pU+1)==TIXML_UTF_LEAD_1 && *(pU+2)==TIXML_UTF_LEAD_2 )
+							p += 3;	
+						else if ( *(pU+1)==0xbfU && *(pU+2)==0xbeU )
+							p += 3;	
+						else if ( *(pU+1)==0xbfU && *(pU+2)==0xbfU )
+							p += 3;	
+						else
+							{ p +=3; ++col; }	// A normal character.
+					}
+				}
+				else
+				{
+					++p;
+					++col;
+				}
+				break;
+
+			default:
+				if ( encoding == TIXML_ENCODING_UTF8 )
+				{
+					// Eat the 1 to 4 byte utf8 character.
+					int step = TiXmlBase::utf8ByteTable[*((unsigned char*)p)];
+					if ( step == 0 )
+						step = 1;		// Error case from bad encoding, but handle gracefully.
+					p += step;
+
+					// Just advance one column, of course.
+					++col;
+				}
+				else
+				{
+					++p;
+					++col;
+				}
+				break;
+		}
+	}
+	cursor.row = row;
+	cursor.col = col;
+	assert( cursor.row >= -1 );
+	assert( cursor.col >= -1 );
+	stamp = p;
+	assert( stamp );
+}
+
+
+const char* TiXmlBase::SkipWhiteSpace( const char* p, TiXmlEncoding encoding )
+{
+	if ( !p || !*p )
+	{
+		return 0;
+	}
+	if ( encoding == TIXML_ENCODING_UTF8 )
+	{
+		while ( *p )
+		{
+			const unsigned char* pU = (const unsigned char*)p;
+			
+			// Skip the stupid Microsoft UTF-8 Byte order marks
+			if (	*(pU+0)==TIXML_UTF_LEAD_0
+				 && *(pU+1)==TIXML_UTF_LEAD_1 
+				 && *(pU+2)==TIXML_UTF_LEAD_2 )
+			{
+				p += 3;
+				continue;
+			}
+			else if(*(pU+0)==TIXML_UTF_LEAD_0
+				 && *(pU+1)==0xbfU
+				 && *(pU+2)==0xbeU )
+			{
+				p += 3;
+				continue;
+			}
+			else if(*(pU+0)==TIXML_UTF_LEAD_0
+				 && *(pU+1)==0xbfU
+				 && *(pU+2)==0xbfU )
+			{
+				p += 3;
+				continue;
+			}
+
+			if ( IsWhiteSpace( *p ) || *p == '\n' || *p =='\r' )		// Still using old rules for white space.
+				++p;
+			else
+				break;
+		}
+	}
+	else
+	{
+		while ( *p && IsWhiteSpace( *p ) || *p == '\n' || *p =='\r' )
+			++p;
+	}
+
+	return p;
+}
+
+#ifdef TIXML_USE_STL
+/*static*/ bool TiXmlBase::StreamWhiteSpace( TIXML_ISTREAM * in, TIXML_STRING * tag )
+{
+	for( ;; )
+	{
+		if ( !in->good() ) return false;
+
+		int c = in->peek();
+		// At this scope, we can't get to a document. So fail silently.
+		if ( !IsWhiteSpace( c ) || c <= 0 )
+			return true;
+
+		*tag += (char) in->get();
+	}
+}
+
+/*static*/ bool TiXmlBase::StreamTo( TIXML_ISTREAM * in, int character, TIXML_STRING * tag )
+{
+	//assert( character > 0 && character < 128 );	// else it won't work in utf-8
+	while ( in->good() )
+	{
+		int c = in->peek();
+		if ( c == character )
+			return true;
+		if ( c <= 0 )		// Silent failure: can't get document at this scope
+			return false;
+
+		in->get();
+		*tag += (char) c;
+	}
+	return false;
+}
+#endif
+
+const char* TiXmlBase::ReadName( const char* p, TIXML_STRING * name, TiXmlEncoding encoding )
+{
+	*name = "";
+	assert( p );
+
+	// Names start with letters or underscores.
+	// Of course, in unicode, tinyxml has no idea what a letter *is*. The
+	// algorithm is generous.
+	//
+	// After that, they can be letters, underscores, numbers,
+	// hyphens, or colons. (Colons are valid ony for namespaces,
+	// but tinyxml can't tell namespaces from names.)
+	if (    p && *p 
+		 && ( IsAlpha( (unsigned char) *p, encoding ) || *p == '_' ) )
+	{
+		while(		p && *p
+				&&	(		IsAlphaNum( (unsigned char ) *p, encoding ) 
+						 || *p == '_'
+						 || *p == '-'
+						 || *p == '.'
+						 || *p == ':' ) )
+		{
+			(*name) += *p;
+			++p;
+		}
+		return p;
+	}
+	return 0;
+}
+
+const char* TiXmlBase::GetEntity( const char* p, char* value, int* length, TiXmlEncoding encoding )
+{
+	// Presume an entity, and pull it out.
+    TIXML_STRING ent;
+	int i;
+	*length = 0;
+
+	if ( *(p+1) && *(p+1) == '#' && *(p+2) )
+	{
+		unsigned long ucs = 0;
+		ptrdiff_t delta = 0;
+		unsigned mult = 1;
+
+		if ( *(p+2) == 'x' )
+		{
+			// Hexadecimal.
+			if ( !*(p+3) ) return 0;
+
+			const char* q = p+3;
+			q = strchr( q, ';' );
+
+			if ( !q || !*q ) return 0;
+
+			delta = q-p;
+			--q;
+
+			while ( *q != 'x' )
+			{
+				if ( *q >= '0' && *q <= '9' )
+					ucs += mult * (*q - '0');
+				else if ( *q >= 'a' && *q <= 'f' )
+					ucs += mult * (*q - 'a' + 10);
+				else if ( *q >= 'A' && *q <= 'F' )
+					ucs += mult * (*q - 'A' + 10 );
+				else 
+					return 0;
+				mult *= 16;
+				--q;
+			}
+		}
+		else
+		{
+			// Decimal.
+			if ( !*(p+2) ) return 0;
+
+			const char* q = p+2;
+			q = strchr( q, ';' );
+
+			if ( !q || !*q ) return 0;
+
+			delta = q-p;
+			--q;
+
+			while ( *q != '#' )
+			{
+				if ( *q >= '0' && *q <= '9' )
+					ucs += mult * (*q - '0');
+				else 
+					return 0;
+				mult *= 10;
+				--q;
+			}
+		}
+		if ( encoding == TIXML_ENCODING_UTF8 )
+		{
+			// convert the UCS to UTF-8
+			ConvertUTF32ToUTF8( ucs, value, length );
+		}
+		else
+		{
+			*value = (char)ucs;
+			*length = 1;
+		}
+		return p + delta + 1;
+	}
+
+	// Now try to match it.
+	for( i=0; i<NUM_ENTITY; ++i )
+	{
+		if ( strncmp( entity[i].str, p, entity[i].strLength ) == 0 )
+		{
+			assert( strlen( entity[i].str ) == entity[i].strLength );
+			*value = entity[i].chr;
+			*length = 1;
+			return ( p + entity[i].strLength );
+		}
+	}
+
+	// So it wasn't an entity, its unrecognized, or something like that.
+	*value = *p;	// Don't put back the last one, since we return it!
+	return p+1;
+}
+
+
+bool TiXmlBase::StringEqual( const char* p,
+							 const char* tag,
+							 bool ignoreCase,
+							 TiXmlEncoding encoding )
+{
+	assert( p );
+	assert( tag );
+	if ( !p || !*p )
+	{
+		assert( 0 );
+		return false;
+	}
+
+	const char* q = p;
+
+	if ( ignoreCase )
+	{
+		while ( *q && *tag && ToLower( *q, encoding ) == ToLower( *tag, encoding ) )
+		{
+			++q;
+			++tag;
+		}
+
+		if ( *tag == 0 )
+			return true;
+	}
+	else
+	{
+		while ( *q && *tag && *q == *tag )
+		{
+			++q;
+			++tag;
+		}
+
+		if ( *tag == 0 )		// Have we found the end of the tag, and everything equal?
+			return true;
+	}
+	return false;
+}
+
+const char* TiXmlBase::ReadText(	const char* p, 
+									TIXML_STRING * text, 
+									bool trimWhiteSpace, 
+									const char* endTag, 
+									bool caseInsensitive,
+									TiXmlEncoding encoding )
+{
+    *text = "";
+	if (    !trimWhiteSpace			// certain tags always keep whitespace
+		 || !condenseWhiteSpace )	// if true, whitespace is always kept
+	{
+		// Keep all the white space.
+		while (	   p && *p
+				&& !StringEqual( p, endTag, caseInsensitive, encoding )
+			  )
+		{
+			int len;
+			char cArr[4] = { 0, 0, 0, 0 };
+			p = GetChar( p, cArr, &len, encoding );
+			text->append( cArr, len );
+		}
+	}
+	else
+	{
+		bool whitespace = false;
+
+		// Remove leading white space:
+		p = SkipWhiteSpace( p, encoding );
+		while (	   p && *p
+				&& !StringEqual( p, endTag, caseInsensitive, encoding ) )
+		{
+			if ( *p == '\r' || *p == '\n' )
+			{
+				whitespace = true;
+				++p;
+			}
+			else if ( IsWhiteSpace( *p ) )
+			{
+				whitespace = true;
+				++p;
+			}
+			else
+			{
+				// If we've found whitespace, add it before the
+				// new character. Any whitespace just becomes a space.
+				if ( whitespace )
+				{
+					(*text) += ' ';
+					whitespace = false;
+				}
+				int len;
+				char cArr[4] = { 0, 0, 0, 0 };
+				p = GetChar( p, cArr, &len, encoding );
+				if ( len == 1 )
+					(*text) += cArr[0];	// more efficient
+				else
+					text->append( cArr, len );
+			}
+		}
+	}
+	return p + strlen( endTag );
+}
+
+#ifdef TIXML_USE_STL
+
+void TiXmlDocument::StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag )
+{
+	// The basic issue with a document is that we don't know what we're
+	// streaming. Read something presumed to be a tag (and hope), then
+	// identify it, and call the appropriate stream method on the tag.
+	//
+	// This "pre-streaming" will never read the closing ">" so the
+	// sub-tag can orient itself.
+
+	if ( !StreamTo( in, '<', tag ) ) 
+	{
+		SetError( TIXML_ERROR_PARSING_EMPTY, 0, 0, TIXML_ENCODING_UNKNOWN );
+		return;
+	}
+
+	while ( in->good() )
+	{
+		int tagIndex = (int) tag->length();
+		while ( in->good() && in->peek() != '>' )
+		{
+			int c = in->get();
+			if ( c <= 0 )
+			{
+				SetError( TIXML_ERROR_EMBEDDED_NULL, 0, 0, TIXML_ENCODING_UNKNOWN );
+				break;
+			}
+			(*tag) += (char) c;
+		}
+
+		if ( in->good() )
+		{
+			// We now have something we presume to be a node of 
+			// some sort. Identify it, and call the node to
+			// continue streaming.
+			TiXmlNode* node = Identify( tag->c_str() + tagIndex, TIXML_DEFAULT_ENCODING );
+
+			if ( node )
+			{
+				node->StreamIn( in, tag );
+				bool isElement = node->ToElement() != 0;
+				delete node;
+				node = 0;
+
+				// If this is the root element, we're done. Parsing will be
+				// done by the >> operator.
+				if ( isElement )
+				{
+					return;
+				}
+			}
+			else
+			{
+				SetError( TIXML_ERROR, 0, 0, TIXML_ENCODING_UNKNOWN );
+				return;
+			}
+		}
+	}
+	// We should have returned sooner.
+	SetError( TIXML_ERROR, 0, 0, TIXML_ENCODING_UNKNOWN );
+}
+
+#endif
+
+const char* TiXmlDocument::Parse( const char* p, TiXmlParsingData* prevData, TiXmlEncoding encoding )
+{
+	ClearError();
+
+	// Parse away, at the document level. Since a document
+	// contains nothing but other tags, most of what happens
+	// here is skipping white space.
+	if ( !p || !*p )
+	{
+		SetError( TIXML_ERROR_DOCUMENT_EMPTY, 0, 0, TIXML_ENCODING_UNKNOWN );
+		return 0;
+	}
+
+	// Note that, for a document, this needs to come
+	// before the while space skip, so that parsing
+	// starts from the pointer we are given.
+	location.Clear();
+	if ( prevData )
+	{
+		location.row = prevData->cursor.row;
+		location.col = prevData->cursor.col;
+	}
+	else
+	{
+		location.row = 0;
+		location.col = 0;
+	}
+	TiXmlParsingData data( p, TabSize(), location.row, location.col );
+	location = data.Cursor();
+
+	if ( encoding == TIXML_ENCODING_UNKNOWN )
+	{
+		// Check for the Microsoft UTF-8 lead bytes.
+		const unsigned char* pU = (const unsigned char*)p;
+		if (	*(pU+0) && *(pU+0) == TIXML_UTF_LEAD_0
+			 && *(pU+1) && *(pU+1) == TIXML_UTF_LEAD_1
+			 && *(pU+2) && *(pU+2) == TIXML_UTF_LEAD_2 )
+		{
+			encoding = TIXML_ENCODING_UTF8;
+		}
+	}
+
+    p = SkipWhiteSpace( p, encoding );
+	if ( !p )
+	{
+		SetError( TIXML_ERROR_DOCUMENT_EMPTY, 0, 0, TIXML_ENCODING_UNKNOWN );
+		return 0;
+	}
+
+	while ( p && *p )
+	{
+		TiXmlNode* node = Identify( p, encoding );
+		if ( node )
+		{
+			p = node->Parse( p, &data, encoding );
+			LinkEndChild( node );
+		}
+		else
+		{
+			break;
+		}
+
+		// Did we get encoding info?
+		if (    encoding == TIXML_ENCODING_UNKNOWN
+			 && node->ToDeclaration() )
+		{
+			TiXmlDeclaration* dec = node->ToDeclaration();
+			const char* enc = dec->Encoding();
+			assert( enc );
+
+			if ( *enc == 0 )
+				encoding = TIXML_ENCODING_UTF8;
+			else if ( StringEqual( enc, "UTF-8", true, TIXML_ENCODING_UNKNOWN ) )
+				encoding = TIXML_ENCODING_UTF8;
+			else if ( StringEqual( enc, "UTF8", true, TIXML_ENCODING_UNKNOWN ) )
+				encoding = TIXML_ENCODING_UTF8;	// incorrect, but be nice
+			else 
+				encoding = TIXML_ENCODING_LEGACY;
+		}
+
+		p = SkipWhiteSpace( p, encoding );
+	}
+
+	// Was this empty?
+	if ( !firstChild ) {
+		SetError( TIXML_ERROR_DOCUMENT_EMPTY, 0, 0, encoding );
+		return 0;
+	}
+
+	// All is well.
+	return p;
+}
+
+void TiXmlDocument::SetError( int err, const char* pError, TiXmlParsingData* data, TiXmlEncoding encoding )
+{	
+	// The first error in a chain is more accurate - don't set again!
+	if ( error )
+		return;
+
+	assert( err > 0 && err < TIXML_ERROR_STRING_COUNT );
+	error   = true;
+	errorId = err;
+	errorDesc = errorString[ errorId ];
+
+	errorLocation.Clear();
+	if ( pError && data )
+	{
+		//TiXmlParsingData data( pError, prevData );
+		data->Stamp( pError, encoding );
+		errorLocation = data->Cursor();
+	}
+}
+
+
+TiXmlNode* TiXmlNode::Identify( const char* p, TiXmlEncoding encoding )
+{
+	TiXmlNode* returnNode = 0;
+
+	p = SkipWhiteSpace( p, encoding );
+	if( !p || !*p || *p != '<' )
+	{
+		return 0;
+	}
+
+	TiXmlDocument* doc = GetDocument();
+	p = SkipWhiteSpace( p, encoding );
+
+	if ( !p || !*p )
+	{
+		return 0;
+	}
+
+	// What is this thing? 
+	// - Elements start with a letter or underscore, but xml is reserved.
+	// - Comments: <!--
+	// - Decleration: <?xml
+	// - Everthing else is unknown to tinyxml.
+	//
+
+	const char* xmlHeader = { "<?xml" };
+	const char* commentHeader = { "<!--" };
+	const char* dtdHeader = { "<!" };
+
+	if ( StringEqual( p, xmlHeader, true, encoding ) )
+	{
+		#ifdef DEBUG_PARSER
+			TIXML_LOG( "XML parsing Declaration\n" );
+		#endif
+		returnNode = new TiXmlDeclaration();
+	}
+	else if ( StringEqual( p, commentHeader, false, encoding ) )
+	{
+		#ifdef DEBUG_PARSER
+			TIXML_LOG( "XML parsing Comment\n" );
+		#endif
+		returnNode = new TiXmlComment();
+	}
+	else if ( StringEqual( p, dtdHeader, false, encoding ) )
+	{
+		#ifdef DEBUG_PARSER
+			TIXML_LOG( "XML parsing Unknown(1)\n" );
+		#endif
+		returnNode = new TiXmlUnknown();
+	}
+	else if (    IsAlpha( *(p+1), encoding )
+			  || *(p+1) == '_' )
+	{
+		#ifdef DEBUG_PARSER
+			TIXML_LOG( "XML parsing Element\n" );
+		#endif
+		returnNode = new TiXmlElement( "" );
+	}
+	else
+	{
+		#ifdef DEBUG_PARSER
+			TIXML_LOG( "XML parsing Unknown(2)\n" );
+		#endif
+		returnNode = new TiXmlUnknown();
+	}
+
+	if ( returnNode )
+	{
+		// Set the parent, so it can report errors
+		returnNode->parent = this;
+	}
+	else
+	{
+		if ( doc )
+			doc->SetError( TIXML_ERROR_OUT_OF_MEMORY, 0, 0, TIXML_ENCODING_UNKNOWN );
+	}
+	return returnNode;
+}
+
+#ifdef TIXML_USE_STL
+
+void TiXmlElement::StreamIn (TIXML_ISTREAM * in, TIXML_STRING * tag)
+{
+	// We're called with some amount of pre-parsing. That is, some of "this"
+	// element is in "tag". Go ahead and stream to the closing ">"
+	while( in->good() )
+	{
+		int c = in->get();
+		if ( c <= 0 )
+		{
+			TiXmlDocument* document = GetDocument();
+			if ( document )
+				document->SetError( TIXML_ERROR_EMBEDDED_NULL, 0, 0, TIXML_ENCODING_UNKNOWN );
+			return;
+		}
+		(*tag) += (char) c ;
+		
+		if ( c == '>' )
+			break;
+	}
+
+	if ( tag->length() < 3 ) return;
+
+	// Okay...if we are a "/>" tag, then we're done. We've read a complete tag.
+	// If not, identify and stream.
+
+	if (    tag->at( tag->length() - 1 ) == '>' 
+		 && tag->at( tag->length() - 2 ) == '/' )
+	{
+		// All good!
+		return;
+	}
+	else if ( tag->at( tag->length() - 1 ) == '>' )
+	{
+		// There is more. Could be:
+		//		text
+		//		closing tag
+		//		another node.
+		for ( ;; )
+		{
+			StreamWhiteSpace( in, tag );
+
+			// Do we have text?
+			if ( in->good() && in->peek() != '<' ) 
+			{
+				// Yep, text.
+				TiXmlText text( "" );
+				text.StreamIn( in, tag );
+
+				// What follows text is a closing tag or another node.
+				// Go around again and figure it out.
+				continue;
+			}
+
+			// We now have either a closing tag...or another node.
+			// We should be at a "<", regardless.
+			if ( !in->good() ) return;
+			assert( in->peek() == '<' );
+			int tagIndex = tag->length();
+
+			bool closingTag = false;
+			bool firstCharFound = false;
+
+			for( ;; )
+			{
+				if ( !in->good() )
+					return;
+
+				int c = in->peek();
+				if ( c <= 0 )
+				{
+					TiXmlDocument* document = GetDocument();
+					if ( document )
+						document->SetError( TIXML_ERROR_EMBEDDED_NULL, 0, 0, TIXML_ENCODING_UNKNOWN );
+					return;
+				}
+				
+				if ( c == '>' )
+					break;
+
+				*tag += (char) c;
+				in->get();
+
+				if ( !firstCharFound && c != '<' && !IsWhiteSpace( c ) )
+				{
+					firstCharFound = true;
+					if ( c == '/' )
+						closingTag = true;
+				}
+			}
+			// If it was a closing tag, then read in the closing '>' to clean up the input stream.
+			// If it was not, the streaming will be done by the tag.
+			if ( closingTag )
+			{
+				if ( !in->good() )
+					return;
+
+				int c = in->get();
+				if ( c <= 0 )
+				{
+					TiXmlDocument* document = GetDocument();
+					if ( document )
+						document->SetError( TIXML_ERROR_EMBEDDED_NULL, 0, 0, TIXML_ENCODING_UNKNOWN );
+					return;
+				}
+				assert( c == '>' );
+				*tag += (char) c;
+
+				// We are done, once we've found our closing tag.
+				return;
+			}
+			else
+			{
+				// If not a closing tag, id it, and stream.
+				const char* tagloc = tag->c_str() + tagIndex;
+				TiXmlNode* node = Identify( tagloc, TIXML_DEFAULT_ENCODING );
+				if ( !node )
+					return;
+				node->StreamIn( in, tag );
+				delete node;
+				node = 0;
+
+				// No return: go around from the beginning: text, closing tag, or node.
+			}
+		}
+	}
+}
+#endif
+
+const char* TiXmlElement::Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding )
+{
+	p = SkipWhiteSpace( p, encoding );
+	TiXmlDocument* document = GetDocument();
+
+	if ( !p || !*p )
+	{
+		if ( document ) document->SetError( TIXML_ERROR_PARSING_ELEMENT, 0, 0, encoding );
+		return 0;
+	}
+
+//	TiXmlParsingData data( p, prevData );
+	if ( data )
+	{
+		data->Stamp( p, encoding );
+		location = data->Cursor();
+	}
+
+	if ( *p != '<' )
+	{
+		if ( document ) document->SetError( TIXML_ERROR_PARSING_ELEMENT, p, data, encoding );
+		return 0;
+	}
+
+	p = SkipWhiteSpace( p+1, encoding );
+
+	// Read the name.
+	const char* pErr = p;
+
+    p = ReadName( p, &value, encoding );
+	if ( !p || !*p )
+	{
+		if ( document )	document->SetError( TIXML_ERROR_FAILED_TO_READ_ELEMENT_NAME, pErr, data, encoding );
+		return 0;
+	}
+
+    TIXML_STRING endTag ("</");
+	endTag += value;
+	endTag += ">";
+
+	// Check for and read attributes. Also look for an empty
+	// tag or an end tag.
+	while ( p && *p )
+	{
+		pErr = p;
+		p = SkipWhiteSpace( p, encoding );
+		if ( !p || !*p )
+		{
+			if ( document ) document->SetError( TIXML_ERROR_READING_ATTRIBUTES, pErr, data, encoding );
+			return 0;
+		}
+		if ( *p == '/' )
+		{
+			++p;
+			// Empty tag.
+			if ( *p  != '>' )
+			{
+				if ( document ) document->SetError( TIXML_ERROR_PARSING_EMPTY, p, data, encoding );		
+				return 0;
+			}
+			return (p+1);
+		}
+		else if ( *p == '>' )
+		{
+			// Done with attributes (if there were any.)
+			// Read the value -- which can include other
+			// elements -- read the end tag, and return.
+			++p;
+			p = ReadValue( p, data, encoding );		// Note this is an Element method, and will set the error if one happens.
+			if ( !p || !*p )
+				return 0;
+
+			// We should find the end tag now
+			if ( StringEqual( p, endTag.c_str(), false, encoding ) )
+			{
+				p += endTag.length();
+				return p;
+			}
+			else
+			{
+				if ( document ) document->SetError( TIXML_ERROR_READING_END_TAG, p, data, encoding );
+				return 0;
+			}
+		}
+		else
+		{
+			// Try to read an attribute:
+			TiXmlAttribute* attrib = new TiXmlAttribute();
+			if ( !attrib )
+			{
+				if ( document ) document->SetError( TIXML_ERROR_OUT_OF_MEMORY, pErr, data, encoding );
+				return 0;
+			}
+
+			attrib->SetDocument( document );
+			const char* pErr = p;
+			p = attrib->Parse( p, data, encoding );
+
+			if ( !p || !*p )
+			{
+				if ( document ) document->SetError( TIXML_ERROR_PARSING_ELEMENT, pErr, data, encoding );
+				delete attrib;
+				return 0;
+			}
+
+			// Handle the strange case of double attributes:
+			TiXmlAttribute* node = attributeSet.Find( attrib->Name() );
+			if ( node )
+			{
+				node->SetValue( attrib->Value() );
+				delete attrib;
+				return 0;
+			}
+
+			attributeSet.Add( attrib );
+		}
+	}
+	return p;
+}
+
+
+const char* TiXmlElement::ReadValue( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding )
+{
+	TiXmlDocument* document = GetDocument();
+
+	const char* pWithWhiteSpace = p;
+	// Read in text and elements in any order.
+	p = SkipWhiteSpace( p, encoding );
+	while ( p && *p )
+	{
+		if ( *p != '<' )
+		{
+			// Take what we have, make a text element.
+			TiXmlText* textNode = new TiXmlText( "" );
+
+			if ( !textNode )
+			{
+				if ( document ) document->SetError( TIXML_ERROR_OUT_OF_MEMORY, 0, 0, encoding );
+				    return 0;
+			}
+
+			if ( TiXmlBase::IsWhiteSpaceCondensed() )
+			{
+				p = textNode->Parse( p, data, encoding );
+			}
+			else
+			{
+				// Special case: we want to keep the white space
+				// so that leading spaces aren't removed.
+				p = textNode->Parse( pWithWhiteSpace, data, encoding );
+			}
+
+			if ( !textNode->Blank() )
+				LinkEndChild( textNode );
+			else
+				delete textNode;
+		} 
+		else 
+		{
+			// We hit a '<'
+			// Have we hit a new element or an end tag?
+			if ( StringEqual( p, "</", false, encoding ) )
+			{
+				return p;
+			}
+			else
+			{
+				TiXmlNode* node = Identify( p, encoding );
+				if ( node )
+				{
+					p = node->Parse( p, data, encoding );
+					LinkEndChild( node );
+				}				
+				else
+				{
+					return 0;
+				}
+			}
+		}
+		p = SkipWhiteSpace( p, encoding );
+	}
+
+	if ( !p )
+	{
+		if ( document ) document->SetError( TIXML_ERROR_READING_ELEMENT_VALUE, 0, 0, encoding );
+	}	
+	return p;
+}
+
+
+#ifdef TIXML_USE_STL
+void TiXmlUnknown::StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag )
+{
+	while ( in->good() )
+	{
+		int c = in->get();	
+		if ( c <= 0 )
+		{
+			TiXmlDocument* document = GetDocument();
+			if ( document )
+				document->SetError( TIXML_ERROR_EMBEDDED_NULL, 0, 0, TIXML_ENCODING_UNKNOWN );
+			return;
+		}
+		(*tag) += (char) c;
+
+		if ( c == '>' )
+		{
+			// All is well.
+			return;		
+		}
+	}
+}
+#endif
+
+
+const char* TiXmlUnknown::Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding )
+{
+	TiXmlDocument* document = GetDocument();
+	p = SkipWhiteSpace( p, encoding );
+
+//	TiXmlParsingData data( p, prevData );
+	if ( data )
+	{
+		data->Stamp( p, encoding );
+		location = data->Cursor();
+	}
+	if ( !p || !*p || *p != '<' )
+	{
+		if ( document ) document->SetError( TIXML_ERROR_PARSING_UNKNOWN, p, data, encoding );
+		return 0;
+	}
+	++p;
+    value = "";
+
+	while ( p && *p && *p != '>' )
+	{
+		value += *p;
+		++p;
+	}
+
+	if ( !p )
+	{
+		if ( document )	document->SetError( TIXML_ERROR_PARSING_UNKNOWN, 0, 0, encoding );
+	}
+	if ( *p == '>' )
+		return p+1;
+	return p;
+}
+
+#ifdef TIXML_USE_STL
+void TiXmlComment::StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag )
+{
+	while ( in->good() )
+	{
+		int c = in->get();	
+		if ( c <= 0 )
+		{
+			TiXmlDocument* document = GetDocument();
+			if ( document )
+				document->SetError( TIXML_ERROR_EMBEDDED_NULL, 0, 0, TIXML_ENCODING_UNKNOWN );
+			return;
+		}
+
+		(*tag) += (char) c;
+
+		if ( c == '>' 
+			 && tag->at( tag->length() - 2 ) == '-'
+			 && tag->at( tag->length() - 3 ) == '-' )
+		{
+			// All is well.
+			return;		
+		}
+	}
+}
+#endif
+
+
+const char* TiXmlComment::Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding )
+{
+	TiXmlDocument* document = GetDocument();
+	value = "";
+
+	p = SkipWhiteSpace( p, encoding );
+
+//	TiXmlParsingData data( p, prevData );
+	if ( data )
+	{
+		data->Stamp( p, encoding );
+		location = data->Cursor();
+	}
+	const char* startTag = "<!--";
+	const char* endTag   = "-->";
+
+	if ( !StringEqual( p, startTag, false, encoding ) )
+	{
+		document->SetError( TIXML_ERROR_PARSING_COMMENT, p, data, encoding );
+		return 0;
+	}
+	p += strlen( startTag );
+	p = ReadText( p, &value, false, endTag, false, encoding );
+	return p;
+}
+
+
+const char* TiXmlAttribute::Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding )
+{
+	p = SkipWhiteSpace( p, encoding );
+	if ( !p || !*p ) return 0;
+
+	int tabsize = 4;
+	if ( document )
+		tabsize = document->TabSize();
+
+//	TiXmlParsingData data( p, prevData );
+	if ( data )
+	{
+		data->Stamp( p, encoding );
+		location = data->Cursor();
+	}
+	// Read the name, the '=' and the value.
+	const char* pErr = p;
+	p = ReadName( p, &name, encoding );
+	if ( !p || !*p )
+	{
+		if ( document ) document->SetError( TIXML_ERROR_READING_ATTRIBUTES, pErr, data, encoding );
+		return 0;
+	}
+	p = SkipWhiteSpace( p, encoding );
+	if ( !p || !*p || *p != '=' )
+	{
+		if ( document ) document->SetError( TIXML_ERROR_READING_ATTRIBUTES, p, data, encoding );
+		return 0;
+	}
+
+	++p;	// skip '='
+	p = SkipWhiteSpace( p, encoding );
+	if ( !p || !*p )
+	{
+		if ( document ) document->SetError( TIXML_ERROR_READING_ATTRIBUTES, p, data, encoding );
+		return 0;
+	}
+	
+	const char* end;
+
+	if ( *p == '\'' )
+	{
+		++p;
+		end = "\'";
+		p = ReadText( p, &value, false, end, false, encoding );
+	}
+	else if ( *p == '"' )
+	{
+		++p;
+		end = "\"";
+		p = ReadText( p, &value, false, end, false, encoding );
+	}
+	else
+	{
+		// All attribute values should be in single or double quotes.
+		// But this is such a common error that the parser will try
+		// its best, even without them.
+		value = "";
+		while (    p && *p										// existence
+				&& !IsWhiteSpace( *p ) && *p != '\n' && *p != '\r'	// whitespace
+				&& *p != '/' && *p != '>' )						// tag end
+		{
+			value += *p;
+			++p;
+		}
+	}
+	return p;
+}
+
+#ifdef TIXML_USE_STL
+void TiXmlText::StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag )
+{
+	while ( in->good() )
+	{
+		int c = in->peek();	
+		if ( c == '<' )
+			return;
+		if ( c <= 0 )
+		{
+			TiXmlDocument* document = GetDocument();
+			if ( document )
+				document->SetError( TIXML_ERROR_EMBEDDED_NULL, 0, 0, TIXML_ENCODING_UNKNOWN );
+			return;
+		}
+
+		(*tag) += (char) c;
+		in->get();
+	}
+}
+#endif
+
+const char* TiXmlText::Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding encoding )
+{
+	value = "";
+//	TiXmlParsingData data( p, prevData );
+	if ( data )
+	{
+		data->Stamp( p, encoding );
+		location = data->Cursor();
+	}
+	bool ignoreWhite = true;
+
+	const char* end = "<";
+	p = ReadText( p, &value, ignoreWhite, end, false, encoding );
+	if ( p )
+		return p-1;	// don't truncate the '<'
+	return 0;
+}
+
+#ifdef TIXML_USE_STL
+void TiXmlDeclaration::StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag )
+{
+	while ( in->good() )
+	{
+		int c = in->get();
+		if ( c <= 0 )
+		{
+			TiXmlDocument* document = GetDocument();
+			if ( document )
+				document->SetError( TIXML_ERROR_EMBEDDED_NULL, 0, 0, TIXML_ENCODING_UNKNOWN );
+			return;
+		}
+		(*tag) += (char) c;
+
+		if ( c == '>' )
+		{
+			// All is well.
+			return;
+		}
+	}
+}
+#endif
+
+const char* TiXmlDeclaration::Parse( const char* p, TiXmlParsingData* data, TiXmlEncoding _encoding )
+{
+	p = SkipWhiteSpace( p, _encoding );
+	// Find the beginning, find the end, and look for
+	// the stuff in-between.
+	TiXmlDocument* document = GetDocument();
+	if ( !p || !*p || !StringEqual( p, "<?xml", true, _encoding ) )
+	{
+		if ( document ) document->SetError( TIXML_ERROR_PARSING_DECLARATION, 0, 0, _encoding );
+		return 0;
+	}
+//	TiXmlParsingData data( p, prevData );
+	if ( data )
+	{
+		data->Stamp( p, _encoding );
+		location = data->Cursor();
+	}
+	p += 5;
+
+	version = "";
+	encoding = "";
+	standalone = "";
+
+	while ( p && *p )
+	{
+		if ( *p == '>' )
+		{
+			++p;
+			return p;
+		}
+
+		p = SkipWhiteSpace( p, _encoding );
+		if ( StringEqual( p, "version", true, _encoding ) )
+		{
+			TiXmlAttribute attrib;
+			p = attrib.Parse( p, data, _encoding );		
+			version = attrib.Value();
+		}
+		else if ( StringEqual( p, "encoding", true, _encoding ) )
+		{
+			TiXmlAttribute attrib;
+			p = attrib.Parse( p, data, _encoding );		
+			encoding = attrib.Value();
+		}
+		else if ( StringEqual( p, "standalone", true, _encoding ) )
+		{
+			TiXmlAttribute attrib;
+			p = attrib.Parse( p, data, _encoding );		
+			standalone = attrib.Value();
+		}
+		else
+		{
+			// Read over whatever it is.
+			while( p && *p && *p != '>' && !IsWhiteSpace( *p ) )
+				++p;
+		}
+	}
+	return 0;
+}
+
+bool TiXmlText::Blank() const
+{
+	for ( unsigned i=0; i<value.length(); i++ )
+		if ( !IsWhiteSpace( value[i] ) )
+			return false;
+	return true;
+}
+
diff --git a/updater/u.ico b/updater/u.ico
new file mode 100644
index 0000000..8587058
--- /dev/null
+++ b/updater/u.ico
diff --git a/updater/ue.ico b/updater/ue.ico
new file mode 100644
index 0000000..c60f689
--- /dev/null
+++ b/updater/ue.ico
diff --git a/updater/unzip.cpp b/updater/unzip.cpp
new file mode 100644
index 0000000..2ce0954
--- /dev/null
+++ b/updater/unzip.cpp
@@ -0,0 +1,4165 @@
+#include <windows.h>
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <tchar.h>
+#include "unzip.h"
+
+// THIS FILE is almost entirely based upon code by Jean-loup Gailly
+// and Mark Adler. It has been modified by Lucian Wischik.
+// The modifications were: incorporate the bugfixes of 1.1.4, allow
+// unzipping to/from handles/pipes/files/memory, encryption, unicode,
+// a windowsish api, and putting everything into a single .cpp file.
+// The original code may be found at http://www.gzip.org/zlib/
+// The original copyright text follows.
+//
+//
+//
+// zlib.h -- interface of the 'zlib' general purpose compression library
+//  version 1.1.3, July 9th, 1998
+//
+//  Copyright (C) 1995-1998 Jean-loup Gailly and Mark Adler
+//
+//  This software is provided 'as-is', without any express or implied
+//  warranty.  In no event will the authors be held liable for any damages
+//  arising from the use of this software.
+//
+//  Permission is granted to anyone to use this software for any purpose,
+//  including commercial applications, and to alter it and redistribute it
+//  freely, subject to the following restrictions:
+//
+//  1. The origin of this software must not be misrepresented; you must not
+//     claim that you wrote the original software. If you use this software
+//     in a product, an acknowledgment in the product documentation would be
+//     appreciated but is not required.
+//  2. Altered source versions must be plainly marked as such, and must not be
+//     misrepresented as being the original software.
+//  3. This notice may not be removed or altered from any source distribution.
+//
+//  Jean-loup Gailly        Mark Adler
+//  jloup@gzip.org          madler@alumni.caltech.edu
+//
+//
+//  The data format used by the zlib library is described by RFCs (Request for
+//  Comments) 1950 to 1952 in the files ftp://ds.internic.net/rfc/rfc1950.txt
+//  (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).
+//
+//
+//     The 'zlib' compression library provides in-memory compression and
+//  decompression functions, including integrity checks of the uncompressed
+//  data.  This version of the library supports only one compression method
+//  (deflation) but other algorithms will be added later and will have the same
+//  stream interface.
+//
+//     Compression can be done in a single step if the buffers are large
+//  enough (for example if an input file is mmap'ed), or can be done by
+//  repeated calls of the compression function.  In the latter case, the
+//  application must provide more input and/or consume the output
+//  (providing more output space) before each call.
+//
+//     The library also supports reading and writing files in gzip (.gz) format
+//  with an interface similar to that of stdio.
+//
+//     The library does not install any signal handler. The decoder checks
+//  the consistency of the compressed data, so the library should never
+//  crash even in case of corrupted input.
+//
+// for more info about .ZIP format, see ftp://ftp.cdrom.com/pub/infozip/doc/appnote-970311-iz.zip
+//   PkWare has also a specification at ftp://ftp.pkware.com/probdesc.zip
+
+#define ZIP_HANDLE   1
+#define ZIP_FILENAME 2
+#define ZIP_MEMORY   3
+
+
+#define zmalloc(len) malloc(len)
+
+#define zfree(p) free(p)
+
+/*
+void *zmalloc(unsigned int len)
+{ char *buf = new char[len+32];
+  for (int i=0; i<16; i++)
+  { buf[i]=i;
+    buf[len+31-i]=i;
+  }
+  *((unsigned int*)buf) = len;
+  char c[1000]; wsprintf(c,"malloc 0x%lx  - %lu",buf+16,len);
+  OutputDebugString(c);
+  return buf+16;
+}
+
+void zfree(void *buf)
+{ char c[1000]; wsprintf(c,"free   0x%lx",buf);
+  OutputDebugString(c);
+  char *p = ((char*)buf)-16;
+  unsigned int len = *((unsigned int*)p);
+  bool blown=false;
+  for (int i=0; i<16; i++)
+  { char lo = p[i];
+    char hi = p[len+31-i];
+    if (hi!=i || (lo!=i && i>4)) blown=true;
+  }
+  if (blown)
+  { OutputDebugString("BLOWN!!!");
+  }
+  delete[] p;
+}
+*/
+
+
+typedef struct tm_unz_s
+{ unsigned int tm_sec;            // seconds after the minute - [0,59]
+  unsigned int tm_min;            // minutes after the hour - [0,59]
+  unsigned int tm_hour;           // hours since midnight - [0,23]
+  unsigned int tm_mday;           // day of the month - [1,31]
+  unsigned int tm_mon;            // months since January - [0,11]
+  unsigned int tm_year;           // years - [1980..2044]
+} tm_unz;
+
+
+// unz_global_info structure contain global data about the ZIPfile
+typedef struct unz_global_info_s
+{ unsigned long number_entry;         // total number of entries in the central dir on this disk
+  unsigned long size_comment;         // size of the global comment of the zipfile
+} unz_global_info;
+
+// unz_file_info contain information about a file in the zipfile
+typedef struct unz_file_info_s
+{ unsigned long version;              // version made by                 2 bytes
+  unsigned long version_needed;       // version needed to extract       2 bytes
+  unsigned long flag;                 // general purpose bit flag        2 bytes
+  unsigned long compression_method;   // compression method              2 bytes
+  unsigned long dosDate;              // last mod file date in Dos fmt   4 bytes
+  unsigned long crc;                  // crc-32                          4 bytes
+  unsigned long compressed_size;      // compressed size                 4 bytes
+  unsigned long uncompressed_size;    // uncompressed size               4 bytes
+  unsigned long size_filename;        // filename length                 2 bytes
+  unsigned long size_file_extra;      // extra field length              2 bytes
+  unsigned long size_file_comment;    // file comment length             2 bytes
+  unsigned long disk_num_start;       // disk number start               2 bytes
+  unsigned long internal_fa;          // internal file attributes        2 bytes
+  unsigned long external_fa;          // external file attributes        4 bytes
+  tm_unz tmu_date;
+} unz_file_info;
+
+
+#define UNZ_OK                  (0)
+#define UNZ_END_OF_LIST_OF_FILE (-100)
+#define UNZ_ERRNO               (Z_ERRNO)
+#define UNZ_EOF                 (0)
+#define UNZ_PARAMERROR          (-102)
+#define UNZ_BADZIPFILE          (-103)
+#define UNZ_INTERNALERROR       (-104)
+#define UNZ_CRCERROR            (-105)
+#define UNZ_PASSWORD            (-106)
+
+
+
+
+
+
+
+#define ZLIB_VERSION "1.1.3"
+
+
+// Allowed flush values; see deflate() for details
+#define Z_NO_FLUSH      0
+#define Z_SYNC_FLUSH    2
+#define Z_FULL_FLUSH    3
+#define Z_FINISH        4
+
+
+// compression levels
+#define Z_NO_COMPRESSION         0
+#define Z_BEST_SPEED             1
+#define Z_BEST_COMPRESSION       9
+#define Z_DEFAULT_COMPRESSION  (-1)
+
+// compression strategy; see deflateInit2() for details
+#define Z_FILTERED            1
+#define Z_HUFFMAN_ONLY        2
+#define Z_DEFAULT_STRATEGY    0
+
+// Possible values of the data_type field
+#define Z_BINARY   0
+#define Z_ASCII    1
+#define Z_UNKNOWN  2
+
+// The deflate compression method (the only one supported in this version)
+#define Z_DEFLATED   8
+
+// for initializing zalloc, zfree, opaque
+#define Z_NULL  0
+
+// case sensitivity when searching for filenames
+#define CASE_SENSITIVE 1
+#define CASE_INSENSITIVE 2
+
+
+// Return codes for the compression/decompression functions. Negative
+// values are errors, positive values are used for special but normal events.
+#define Z_OK            0
+#define Z_STREAM_END    1
+#define Z_NEED_DICT     2
+#define Z_ERRNO        (-1)
+#define Z_STREAM_ERROR (-2)
+#define Z_DATA_ERROR   (-3)
+#define Z_MEM_ERROR    (-4)
+#define Z_BUF_ERROR    (-5)
+#define Z_VERSION_ERROR (-6)
+
+
+
+// Basic data types
+typedef unsigned char  Byte;  // 8 bits
+typedef unsigned int   uInt;  // 16 bits or more
+typedef unsigned long  uLong; // 32 bits or more
+typedef void *voidpf;
+typedef void     *voidp;
+typedef long z_off_t;
+
+
+
+
+
+
+
+
+
+
+
+
+typedef voidpf (*alloc_func) (voidpf opaque, uInt items, uInt size);
+typedef void   (*free_func)  (voidpf opaque, voidpf address);
+
+struct internal_state;
+
+typedef struct z_stream_s {
+    Byte    *next_in;  // next input byte
+    uInt     avail_in;  // number of bytes available at next_in
+    uLong    total_in;  // total nb of input bytes read so far
+
+    Byte    *next_out; // next output byte should be put there
+    uInt     avail_out; // remaining free space at next_out
+    uLong    total_out; // total nb of bytes output so far
+
+    char     *msg;      // last error message, NULL if no error
+    struct internal_state *state; // not visible by applications
+
+    alloc_func zalloc;  // used to allocate the internal state
+    free_func  zfree;   // used to free the internal state
+    voidpf     opaque;  // private data object passed to zalloc and zfree
+
+    int     data_type;  // best guess about the data type: ascii or binary
+    uLong   adler;      // adler32 value of the uncompressed data
+    uLong   reserved;   // reserved for future use
+} z_stream;
+
+typedef z_stream *z_streamp;
+
+
+//   The application must update next_in and avail_in when avail_in has
+//   dropped to zero. It must update next_out and avail_out when avail_out
+//   has dropped to zero. The application must initialize zalloc, zfree and
+//   opaque before calling the init function. All other fields are set by the
+//   compression library and must not be updated by the application.
+//
+//   The opaque value provided by the application will be passed as the first
+//   parameter for calls of zalloc and zfree. This can be useful for custom
+//   memory management. The compression library attaches no meaning to the
+//   opaque value.
+//
+//   zalloc must return Z_NULL if there is not enough memory for the object.
+//   If zlib is used in a multi-threaded application, zalloc and zfree must be
+//   thread safe.
+//
+//   The fields total_in and total_out can be used for statistics or
+//   progress reports. After compression, total_in holds the total size of
+//   the uncompressed data and may be saved for use in the decompressor
+//   (particularly if the decompressor wants to decompress everything in
+//   a single step).
+//
+
+
+// basic functions
+
+const char *zlibVersion ();
+// The application can compare zlibVersion and ZLIB_VERSION for consistency.
+// If the first character differs, the library code actually used is
+// not compatible with the zlib.h header file used by the application.
+// This check is automatically made by inflateInit.
+
+
+
+
+
+
+int inflate (z_streamp strm, int flush);
+//
+//    inflate decompresses as much data as possible, and stops when the input
+//  buffer becomes empty or the output buffer becomes full. It may some
+//  introduce some output latency (reading input without producing any output)
+//  except when forced to flush.
+//
+//  The detailed semantics are as follows. inflate performs one or both of the
+//  following actions:
+//
+//  - Decompress more input starting at next_in and update next_in and avail_in
+//    accordingly. If not all input can be processed (because there is not
+//    enough room in the output buffer), next_in is updated and processing
+//    will resume at this point for the next call of inflate().
+//
+//  - Provide more output starting at next_out and update next_out and avail_out
+//    accordingly.  inflate() provides as much output as possible, until there
+//    is no more input data or no more space in the output buffer (see below
+//    about the flush parameter).
+//
+//  Before the call of inflate(), the application should ensure that at least
+//  one of the actions is possible, by providing more input and/or consuming
+//  more output, and updating the next_* and avail_* values accordingly.
+//  The application can consume the uncompressed output when it wants, for
+//  example when the output buffer is full (avail_out == 0), or after each
+//  call of inflate(). If inflate returns Z_OK and with zero avail_out, it
+//  must be called again after making room in the output buffer because there
+//  might be more output pending.
+//
+//    If the parameter flush is set to Z_SYNC_FLUSH, inflate flushes as much
+//  output as possible to the output buffer. The flushing behavior of inflate is
+//  not specified for values of the flush parameter other than Z_SYNC_FLUSH
+//  and Z_FINISH, but the current implementation actually flushes as much output
+//  as possible anyway.
+//
+//    inflate() should normally be called until it returns Z_STREAM_END or an
+//  error. However if all decompression is to be performed in a single step
+//  (a single call of inflate), the parameter flush should be set to
+//  Z_FINISH. In this case all pending input is processed and all pending
+//  output is flushed; avail_out must be large enough to hold all the
+//  uncompressed data. (The size of the uncompressed data may have been saved
+//  by the compressor for this purpose.) The next operation on this stream must
+//  be inflateEnd to deallocate the decompression state. The use of Z_FINISH
+//  is never required, but can be used to inform inflate that a faster routine
+//  may be used for the single inflate() call.
+//
+//     If a preset dictionary is needed at this point (see inflateSetDictionary
+//  below), inflate sets strm-adler to the adler32 checksum of the
+//  dictionary chosen by the compressor and returns Z_NEED_DICT; otherwise
+//  it sets strm->adler to the adler32 checksum of all output produced
+//  so far (that is, total_out bytes) and returns Z_OK, Z_STREAM_END or
+//  an error code as described below. At the end of the stream, inflate()
+//  checks that its computed adler32 checksum is equal to that saved by the
+//  compressor and returns Z_STREAM_END only if the checksum is correct.
+//
+//    inflate() returns Z_OK if some progress has been made (more input processed
+//  or more output produced), Z_STREAM_END if the end of the compressed data has
+//  been reached and all uncompressed output has been produced, Z_NEED_DICT if a
+//  preset dictionary is needed at this point, Z_DATA_ERROR if the input data was
+//  corrupted (input stream not conforming to the zlib format or incorrect
+//  adler32 checksum), Z_STREAM_ERROR if the stream structure was inconsistent
+//  (for example if next_in or next_out was NULL), Z_MEM_ERROR if there was not
+//  enough memory, Z_BUF_ERROR if no progress is possible or if there was not
+//  enough room in the output buffer when Z_FINISH is used. In the Z_DATA_ERROR
+//  case, the application may then call inflateSync to look for a good
+//  compression block.
+//
+
+
+int inflateEnd (z_streamp strm);
+//
+//     All dynamically allocated data structures for this stream are freed.
+//   This function discards any unprocessed input and does not flush any
+//   pending output.
+//
+//     inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state
+//   was inconsistent. In the error case, msg may be set but then points to a
+//   static string (which must not be deallocated).
+
+                        // Advanced functions 
+
+//  The following functions are needed only in some special applications.
+
+
+
+
+
+int inflateSetDictionary (z_streamp strm,
+                                             const Byte *dictionary,
+                                             uInt  dictLength);
+//
+//     Initializes the decompression dictionary from the given uncompressed byte
+//   sequence. This function must be called immediately after a call of inflate
+//   if this call returned Z_NEED_DICT. The dictionary chosen by the compressor
+//   can be determined from the Adler32 value returned by this call of
+//   inflate. The compressor and decompressor must use exactly the same
+//   dictionary. 
+//
+//     inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a
+//   parameter is invalid (such as NULL dictionary) or the stream state is
+//   inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the
+//   expected one (incorrect Adler32 value). inflateSetDictionary does not
+//   perform any decompression: this will be done by subsequent calls of
+//   inflate().
+
+
+int inflateSync (z_streamp strm);
+// 
+//    Skips invalid compressed data until a full flush point can be found, or until all
+//  available input is skipped. No output is provided.
+//
+//    inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR
+//  if no more input was provided, Z_DATA_ERROR if no flush point has been found,
+//  or Z_STREAM_ERROR if the stream structure was inconsistent. In the success
+//  case, the application may save the current current value of total_in which
+//  indicates where valid compressed data was found. In the error case, the
+//  application may repeatedly call inflateSync, providing more input each time,
+//  until success or end of the input data.
+
+
+int inflateReset (z_streamp strm);
+//     This function is equivalent to inflateEnd followed by inflateInit,
+//   but does not free and reallocate all the internal decompression state.
+//   The stream will keep attributes that may have been set by inflateInit2.
+//
+//      inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source
+//   stream state was inconsistent (such as zalloc or state being NULL).
+//
+
+
+
+// checksum functions
+// These functions are not related to compression but are exported
+// anyway because they might be useful in applications using the
+// compression library.
+
+uLong adler32 (uLong adler, const Byte *buf, uInt len);
+//     Update a running Adler-32 checksum with the bytes buf[0..len-1] and
+//   return the updated checksum. If buf is NULL, this function returns
+//   the required initial value for the checksum.
+//   An Adler-32 checksum is almost as reliable as a CRC32 but can be computed
+//   much faster. Usage example:
+//
+//     uLong adler = adler32(0L, Z_NULL, 0);
+//
+//     while (read_buffer(buffer, length) != EOF) {
+//       adler = adler32(adler, buffer, length);
+//     }
+//     if (adler != original_adler) error();
+
+uLong ucrc32   (uLong crc, const Byte *buf, uInt len);
+//     Update a running crc with the bytes buf[0..len-1] and return the updated
+//   crc. If buf is NULL, this function returns the required initial value
+//   for the crc. Pre- and post-conditioning (one's complement) is performed
+//   within this function so it shouldn't be done by the application.
+//   Usage example:
+//
+//     uLong crc = crc32(0L, Z_NULL, 0);
+//
+//     while (read_buffer(buffer, length) != EOF) {
+//       crc = crc32(crc, buffer, length);
+//     }
+//     if (crc != original_crc) error();
+
+
+
+
+const char   *zError           (int err);
+int           inflateSyncPoint (z_streamp z);
+const uLong *get_crc_table    (void);
+
+
+
+typedef unsigned char  uch;
+typedef uch uchf;
+typedef unsigned short ush;
+typedef ush ushf;
+typedef unsigned long  ulg;
+
+
+
+const char * const z_errmsg[10] = { // indexed by 2-zlib_error
+"need dictionary",     // Z_NEED_DICT       2
+"stream end",          // Z_STREAM_END      1
+"",                    // Z_OK              0
+"file error",          // Z_ERRNO         (-1)
+"stream error",        // Z_STREAM_ERROR  (-2)
+"data error",          // Z_DATA_ERROR    (-3)
+"insufficient memory", // Z_MEM_ERROR     (-4)
+"buffer error",        // Z_BUF_ERROR     (-5)
+"incompatible version",// Z_VERSION_ERROR (-6)
+""};
+
+
+#define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)]
+
+#define ERR_RETURN(strm,err) \
+  return (strm->msg = (char*)ERR_MSG(err), (err))
+// To be used only when the state is known to be valid 
+
+        // common constants
+
+
+#define STORED_BLOCK 0
+#define STATIC_TREES 1
+#define DYN_TREES    2
+// The three kinds of block type 
+
+#define MIN_MATCH  3
+#define MAX_MATCH  258
+// The minimum and maximum match lengths 
+
+#define PRESET_DICT 0x20 // preset dictionary flag in zlib header 
+
+        // target dependencies 
+
+#define OS_CODE  0x0b  // Window 95 & Windows NT
+
+
+
+         // functions 
+
+#define zmemzero(dest, len) memset(dest, 0, len)
+
+// Diagnostic functions
+#define LuAssert(cond,msg)
+#define LuTrace(x)
+#define LuTracev(x)
+#define LuTracevv(x)
+#define LuTracec(c,x)
+#define LuTracecv(c,x)
+
+
+typedef uLong (*check_func) (uLong check, const Byte *buf, uInt len);
+voidpf zcalloc (voidpf opaque, unsigned items, unsigned size);
+void   zcfree  (voidpf opaque, voidpf ptr);
+
+#define ZALLOC(strm, items, size) \
+           (*((strm)->zalloc))((strm)->opaque, (items), (size))
+#define ZFREE(strm, addr)  (*((strm)->zfree))((strm)->opaque, (voidpf)(addr))
+
+//void ZFREE(z_streamp strm,voidpf addr)
+//{ *((strm)->zfree))((strm)->opaque, addr);
+//}
+
+#define TRY_FREE(s, p) {if (p) ZFREE(s, p);}
+
+
+
+
+// Huffman code lookup table entry--this entry is four bytes for machines
+// that have 16-bit pointers (e.g. PC's in the small or medium model).
+
+
+typedef struct inflate_huft_s inflate_huft;
+
+struct inflate_huft_s {
+  union {
+    struct {
+      Byte Exop;        // number of extra bits or operation
+      Byte Bits;        // number of bits in this code or subcode
+    } what;
+    uInt pad;           // pad structure to a power of 2 (4 bytes for
+  } word;               //  16-bit, 8 bytes for 32-bit int's)
+  uInt base;            // literal, length base, distance base, or table offset
+};
+
+// Maximum size of dynamic tree.  The maximum found in a long but non-
+//   exhaustive search was 1004 huft structures (850 for length/literals
+//   and 154 for distances, the latter actually the result of an
+//   exhaustive search).  The actual maximum is not known, but the
+//   value below is more than safe.
+#define MANY 1440
+
+int inflate_trees_bits (
+    uInt *,                    // 19 code lengths
+    uInt *,                    // bits tree desired/actual depth
+    inflate_huft * *,       // bits tree result
+    inflate_huft *,             // space for trees
+    z_streamp);                // for messages
+
+int inflate_trees_dynamic (
+    uInt,                       // number of literal/length codes
+    uInt,                       // number of distance codes
+    uInt *,                    // that many (total) code lengths
+    uInt *,                    // literal desired/actual bit depth
+    uInt *,                    // distance desired/actual bit depth
+    inflate_huft * *,       // literal/length tree result
+    inflate_huft * *,       // distance tree result
+    inflate_huft *,             // space for trees
+    z_streamp);                // for messages
+
+int inflate_trees_fixed (
+    uInt *,                    // literal desired/actual bit depth
+    uInt *,                    // distance desired/actual bit depth
+    const inflate_huft * *,       // literal/length tree result
+    const inflate_huft * *,       // distance tree result
+    z_streamp);                // for memory allocation
+
+
+
+
+
+struct inflate_blocks_state;
+typedef struct inflate_blocks_state inflate_blocks_statef;
+
+inflate_blocks_statef * inflate_blocks_new (
+    z_streamp z,
+    check_func c,               // check function
+    uInt w);                   // window size
+
+int inflate_blocks (
+    inflate_blocks_statef *,
+    z_streamp ,
+    int);                      // initial return code
+
+void inflate_blocks_reset (
+    inflate_blocks_statef *,
+    z_streamp ,
+    uLong *);                  // check value on output
+
+int inflate_blocks_free (
+    inflate_blocks_statef *,
+    z_streamp);
+
+void inflate_set_dictionary (
+    inflate_blocks_statef *s,
+    const Byte *d,  // dictionary
+    uInt  n);       // dictionary length
+
+int inflate_blocks_sync_point (
+    inflate_blocks_statef *s);
+
+
+
+
+struct inflate_codes_state;
+typedef struct inflate_codes_state inflate_codes_statef;
+
+inflate_codes_statef *inflate_codes_new (
+    uInt, uInt,
+    const inflate_huft *, const inflate_huft *,
+    z_streamp );
+
+int inflate_codes (
+    inflate_blocks_statef *,
+    z_streamp ,
+    int);
+
+void inflate_codes_free (
+    inflate_codes_statef *,
+    z_streamp );
+
+
+
+
+typedef enum {
+      IBM_TYPE,     // get type bits (3, including end bit)
+      IBM_LENS,     // get lengths for stored
+      IBM_STORED,   // processing stored block
+      IBM_TABLE,    // get table lengths
+      IBM_BTREE,    // get bit lengths tree for a dynamic block
+      IBM_DTREE,    // get length, distance trees for a dynamic block
+      IBM_CODES,    // processing fixed or dynamic block
+      IBM_DRY,      // output remaining window bytes
+      IBM_DONE,     // finished last block, done 
+      IBM_BAD}      // got a data error--stuck here 
+inflate_block_mode;
+
+// inflate blocks semi-private state 
+struct inflate_blocks_state {
+
+  // mode 
+  inflate_block_mode  mode;     // current inflate_block mode 
+
+  // mode dependent information 
+  union {
+    uInt left;          // if STORED, bytes left to copy 
+    struct {
+      uInt table;               // table lengths (14 bits) 
+      uInt index;               // index into blens (or border)
+      uInt *blens;             // bit lengths of codes
+      uInt bb;                  // bit length tree depth 
+      inflate_huft *tb;         // bit length decoding tree 
+    } trees;            // if DTREE, decoding info for trees 
+    struct {
+      inflate_codes_statef 
+         *codes;
+    } decode;           // if CODES, current state 
+  } sub;                // submode
+  uInt last;            // true if this block is the last block 
+
+  // mode independent information 
+  uInt bitk;            // bits in bit buffer 
+  uLong bitb;           // bit buffer 
+  inflate_huft *hufts;  // single malloc for tree space 
+  Byte *window;        // sliding window 
+  Byte *end;           // one byte after sliding window 
+  Byte *read;          // window read pointer 
+  Byte *write;         // window write pointer 
+  check_func checkfn;   // check function 
+  uLong check;          // check on output 
+
+};
+
+
+// defines for inflate input/output
+//   update pointers and return 
+#define UPDBITS {s->bitb=b;s->bitk=k;}
+#define UPDIN {z->avail_in=n;z->total_in+=(uLong)(p-z->next_in);z->next_in=p;}
+#define UPDOUT {s->write=q;}
+#define UPDATE {UPDBITS UPDIN UPDOUT}
+#define LEAVE {UPDATE return inflate_flush(s,z,r);}
+//   get bytes and bits 
+#define LOADIN {p=z->next_in;n=z->avail_in;b=s->bitb;k=s->bitk;}
+#define NEEDBYTE {if(n)r=Z_OK;else LEAVE}
+#define NEXTBYTE (n--,*p++)
+#define NEEDBITS(j) {while(k<(j)){NEEDBYTE;b|=((uLong)NEXTBYTE)<<k;k+=8;}}
+#define DUMPBITS(j) {b>>=(j);k-=(j);}
+//   output bytes 
+#define WAVAIL (uInt)(q<s->read?s->read-q-1:s->end-q)
+#define LOADOUT {q=s->write;m=(uInt)WAVAIL;m;}
+#define WRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=(uInt)WAVAIL;}}
+#define FLUSH {UPDOUT r=inflate_flush(s,z,r); LOADOUT}
+#define NEEDOUT {if(m==0){WRAP if(m==0){FLUSH WRAP if(m==0) LEAVE}}r=Z_OK;}
+#define OUTBYTE(a) {*q++=(Byte)(a);m--;}
+//   load local pointers 
+#define LOAD {LOADIN LOADOUT}
+
+// masks for lower bits (size given to avoid silly warnings with Visual C++) 
+// And'ing with mask[n] masks the lower n bits
+const uInt inflate_mask[17] = {
+    0x0000,
+    0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff,
+    0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff
+};
+
+// copy as much as possible from the sliding window to the output area
+int inflate_flush (inflate_blocks_statef *, z_streamp, int);
+
+int inflate_fast (uInt, uInt, const inflate_huft *, const inflate_huft *, inflate_blocks_statef *, z_streamp );
+
+
+
+const uInt fixed_bl = 9;
+const uInt fixed_bd = 5;
+const inflate_huft fixed_tl[] = {
+    {{{96,7}},256}, {{{0,8}},80}, {{{0,8}},16}, {{{84,8}},115},
+    {{{82,7}},31}, {{{0,8}},112}, {{{0,8}},48}, {{{0,9}},192},
+    {{{80,7}},10}, {{{0,8}},96}, {{{0,8}},32}, {{{0,9}},160},
+    {{{0,8}},0}, {{{0,8}},128}, {{{0,8}},64}, {{{0,9}},224},
+    {{{80,7}},6}, {{{0,8}},88}, {{{0,8}},24}, {{{0,9}},144},
+    {{{83,7}},59}, {{{0,8}},120}, {{{0,8}},56}, {{{0,9}},208},
+    {{{81,7}},17}, {{{0,8}},104}, {{{0,8}},40}, {{{0,9}},176},
+    {{{0,8}},8}, {{{0,8}},136}, {{{0,8}},72}, {{{0,9}},240},
+    {{{80,7}},4}, {{{0,8}},84}, {{{0,8}},20}, {{{85,8}},227},
+    {{{83,7}},43}, {{{0,8}},116}, {{{0,8}},52}, {{{0,9}},200},
+    {{{81,7}},13}, {{{0,8}},100}, {{{0,8}},36}, {{{0,9}},168},
+    {{{0,8}},4}, {{{0,8}},132}, {{{0,8}},68}, {{{0,9}},232},
+    {{{80,7}},8}, {{{0,8}},92}, {{{0,8}},28}, {{{0,9}},152},
+    {{{84,7}},83}, {{{0,8}},124}, {{{0,8}},60}, {{{0,9}},216},
+    {{{82,7}},23}, {{{0,8}},108}, {{{0,8}},44}, {{{0,9}},184},
+    {{{0,8}},12}, {{{0,8}},140}, {{{0,8}},76}, {{{0,9}},248},
+    {{{80,7}},3}, {{{0,8}},82}, {{{0,8}},18}, {{{85,8}},163},
+    {{{83,7}},35}, {{{0,8}},114}, {{{0,8}},50}, {{{0,9}},196},
+    {{{81,7}},11}, {{{0,8}},98}, {{{0,8}},34}, {{{0,9}},164},
+    {{{0,8}},2}, {{{0,8}},130}, {{{0,8}},66}, {{{0,9}},228},
+    {{{80,7}},7}, {{{0,8}},90}, {{{0,8}},26}, {{{0,9}},148},
+    {{{84,7}},67}, {{{0,8}},122}, {{{0,8}},58}, {{{0,9}},212},
+    {{{82,7}},19}, {{{0,8}},106}, {{{0,8}},42}, {{{0,9}},180},
+    {{{0,8}},10}, {{{0,8}},138}, {{{0,8}},74}, {{{0,9}},244},
+    {{{80,7}},5}, {{{0,8}},86}, {{{0,8}},22}, {{{192,8}},0},
+    {{{83,7}},51}, {{{0,8}},118}, {{{0,8}},54}, {{{0,9}},204},
+    {{{81,7}},15}, {{{0,8}},102}, {{{0,8}},38}, {{{0,9}},172},
+    {{{0,8}},6}, {{{0,8}},134}, {{{0,8}},70}, {{{0,9}},236},
+    {{{80,7}},9}, {{{0,8}},94}, {{{0,8}},30}, {{{0,9}},156},
+    {{{84,7}},99}, {{{0,8}},126}, {{{0,8}},62}, {{{0,9}},220},
+    {{{82,7}},27}, {{{0,8}},110}, {{{0,8}},46}, {{{0,9}},188},
+    {{{0,8}},14}, {{{0,8}},142}, {{{0,8}},78}, {{{0,9}},252},
+    {{{96,7}},256}, {{{0,8}},81}, {{{0,8}},17}, {{{85,8}},131},
+    {{{82,7}},31}, {{{0,8}},113}, {{{0,8}},49}, {{{0,9}},194},
+    {{{80,7}},10}, {{{0,8}},97}, {{{0,8}},33}, {{{0,9}},162},
+    {{{0,8}},1}, {{{0,8}},129}, {{{0,8}},65}, {{{0,9}},226},
+    {{{80,7}},6}, {{{0,8}},89}, {{{0,8}},25}, {{{0,9}},146},
+    {{{83,7}},59}, {{{0,8}},121}, {{{0,8}},57}, {{{0,9}},210},
+    {{{81,7}},17}, {{{0,8}},105}, {{{0,8}},41}, {{{0,9}},178},
+    {{{0,8}},9}, {{{0,8}},137}, {{{0,8}},73}, {{{0,9}},242},
+    {{{80,7}},4}, {{{0,8}},85}, {{{0,8}},21}, {{{80,8}},258},
+    {{{83,7}},43}, {{{0,8}},117}, {{{0,8}},53}, {{{0,9}},202},
+    {{{81,7}},13}, {{{0,8}},101}, {{{0,8}},37}, {{{0,9}},170},
+    {{{0,8}},5}, {{{0,8}},133}, {{{0,8}},69}, {{{0,9}},234},
+    {{{80,7}},8}, {{{0,8}},93}, {{{0,8}},29}, {{{0,9}},154},
+    {{{84,7}},83}, {{{0,8}},125}, {{{0,8}},61}, {{{0,9}},218},
+    {{{82,7}},23}, {{{0,8}},109}, {{{0,8}},45}, {{{0,9}},186},
+    {{{0,8}},13}, {{{0,8}},141}, {{{0,8}},77}, {{{0,9}},250},
+    {{{80,7}},3}, {{{0,8}},83}, {{{0,8}},19}, {{{85,8}},195},
+    {{{83,7}},35}, {{{0,8}},115}, {{{0,8}},51}, {{{0,9}},198},
+    {{{81,7}},11}, {{{0,8}},99}, {{{0,8}},35}, {{{0,9}},166},
+    {{{0,8}},3}, {{{0,8}},131}, {{{0,8}},67}, {{{0,9}},230},
+    {{{80,7}},7}, {{{0,8}},91}, {{{0,8}},27}, {{{0,9}},150},
+    {{{84,7}},67}, {{{0,8}},123}, {{{0,8}},59}, {{{0,9}},214},
+    {{{82,7}},19}, {{{0,8}},107}, {{{0,8}},43}, {{{0,9}},182},
+    {{{0,8}},11}, {{{0,8}},139}, {{{0,8}},75}, {{{0,9}},246},
+    {{{80,7}},5}, {{{0,8}},87}, {{{0,8}},23}, {{{192,8}},0},
+    {{{83,7}},51}, {{{0,8}},119}, {{{0,8}},55}, {{{0,9}},206},
+    {{{81,7}},15}, {{{0,8}},103}, {{{0,8}},39}, {{{0,9}},174},
+    {{{0,8}},7}, {{{0,8}},135}, {{{0,8}},71}, {{{0,9}},238},
+    {{{80,7}},9}, {{{0,8}},95}, {{{0,8}},31}, {{{0,9}},158},
+    {{{84,7}},99}, {{{0,8}},127}, {{{0,8}},63}, {{{0,9}},222},
+    {{{82,7}},27}, {{{0,8}},111}, {{{0,8}},47}, {{{0,9}},190},
+    {{{0,8}},15}, {{{0,8}},143}, {{{0,8}},79}, {{{0,9}},254},
+    {{{96,7}},256}, {{{0,8}},80}, {{{0,8}},16}, {{{84,8}},115},
+    {{{82,7}},31}, {{{0,8}},112}, {{{0,8}},48}, {{{0,9}},193},
+    {{{80,7}},10}, {{{0,8}},96}, {{{0,8}},32}, {{{0,9}},161},
+    {{{0,8}},0}, {{{0,8}},128}, {{{0,8}},64}, {{{0,9}},225},
+    {{{80,7}},6}, {{{0,8}},88}, {{{0,8}},24}, {{{0,9}},145},
+    {{{83,7}},59}, {{{0,8}},120}, {{{0,8}},56}, {{{0,9}},209},
+    {{{81,7}},17}, {{{0,8}},104}, {{{0,8}},40}, {{{0,9}},177},
+    {{{0,8}},8}, {{{0,8}},136}, {{{0,8}},72}, {{{0,9}},241},
+    {{{80,7}},4}, {{{0,8}},84}, {{{0,8}},20}, {{{85,8}},227},
+    {{{83,7}},43}, {{{0,8}},116}, {{{0,8}},52}, {{{0,9}},201},
+    {{{81,7}},13}, {{{0,8}},100}, {{{0,8}},36}, {{{0,9}},169},
+    {{{0,8}},4}, {{{0,8}},132}, {{{0,8}},68}, {{{0,9}},233},
+    {{{80,7}},8}, {{{0,8}},92}, {{{0,8}},28}, {{{0,9}},153},
+    {{{84,7}},83}, {{{0,8}},124}, {{{0,8}},60}, {{{0,9}},217},
+    {{{82,7}},23}, {{{0,8}},108}, {{{0,8}},44}, {{{0,9}},185},
+    {{{0,8}},12}, {{{0,8}},140}, {{{0,8}},76}, {{{0,9}},249},
+    {{{80,7}},3}, {{{0,8}},82}, {{{0,8}},18}, {{{85,8}},163},
+    {{{83,7}},35}, {{{0,8}},114}, {{{0,8}},50}, {{{0,9}},197},
+    {{{81,7}},11}, {{{0,8}},98}, {{{0,8}},34}, {{{0,9}},165},
+    {{{0,8}},2}, {{{0,8}},130}, {{{0,8}},66}, {{{0,9}},229},
+    {{{80,7}},7}, {{{0,8}},90}, {{{0,8}},26}, {{{0,9}},149},
+    {{{84,7}},67}, {{{0,8}},122}, {{{0,8}},58}, {{{0,9}},213},
+    {{{82,7}},19}, {{{0,8}},106}, {{{0,8}},42}, {{{0,9}},181},
+    {{{0,8}},10}, {{{0,8}},138}, {{{0,8}},74}, {{{0,9}},245},
+    {{{80,7}},5}, {{{0,8}},86}, {{{0,8}},22}, {{{192,8}},0},
+    {{{83,7}},51}, {{{0,8}},118}, {{{0,8}},54}, {{{0,9}},205},
+    {{{81,7}},15}, {{{0,8}},102}, {{{0,8}},38}, {{{0,9}},173},
+    {{{0,8}},6}, {{{0,8}},134}, {{{0,8}},70}, {{{0,9}},237},
+    {{{80,7}},9}, {{{0,8}},94}, {{{0,8}},30}, {{{0,9}},157},
+    {{{84,7}},99}, {{{0,8}},126}, {{{0,8}},62}, {{{0,9}},221},
+    {{{82,7}},27}, {{{0,8}},110}, {{{0,8}},46}, {{{0,9}},189},
+    {{{0,8}},14}, {{{0,8}},142}, {{{0,8}},78}, {{{0,9}},253},
+    {{{96,7}},256}, {{{0,8}},81}, {{{0,8}},17}, {{{85,8}},131},
+    {{{82,7}},31}, {{{0,8}},113}, {{{0,8}},49}, {{{0,9}},195},
+    {{{80,7}},10}, {{{0,8}},97}, {{{0,8}},33}, {{{0,9}},163},
+    {{{0,8}},1}, {{{0,8}},129}, {{{0,8}},65}, {{{0,9}},227},
+    {{{80,7}},6}, {{{0,8}},89}, {{{0,8}},25}, {{{0,9}},147},
+    {{{83,7}},59}, {{{0,8}},121}, {{{0,8}},57}, {{{0,9}},211},
+    {{{81,7}},17}, {{{0,8}},105}, {{{0,8}},41}, {{{0,9}},179},
+    {{{0,8}},9}, {{{0,8}},137}, {{{0,8}},73}, {{{0,9}},243},
+    {{{80,7}},4}, {{{0,8}},85}, {{{0,8}},21}, {{{80,8}},258},
+    {{{83,7}},43}, {{{0,8}},117}, {{{0,8}},53}, {{{0,9}},203},
+    {{{81,7}},13}, {{{0,8}},101}, {{{0,8}},37}, {{{0,9}},171},
+    {{{0,8}},5}, {{{0,8}},133}, {{{0,8}},69}, {{{0,9}},235},
+    {{{80,7}},8}, {{{0,8}},93}, {{{0,8}},29}, {{{0,9}},155},
+    {{{84,7}},83}, {{{0,8}},125}, {{{0,8}},61}, {{{0,9}},219},
+    {{{82,7}},23}, {{{0,8}},109}, {{{0,8}},45}, {{{0,9}},187},
+    {{{0,8}},13}, {{{0,8}},141}, {{{0,8}},77}, {{{0,9}},251},
+    {{{80,7}},3}, {{{0,8}},83}, {{{0,8}},19}, {{{85,8}},195},
+    {{{83,7}},35}, {{{0,8}},115}, {{{0,8}},51}, {{{0,9}},199},
+    {{{81,7}},11}, {{{0,8}},99}, {{{0,8}},35}, {{{0,9}},167},
+    {{{0,8}},3}, {{{0,8}},131}, {{{0,8}},67}, {{{0,9}},231},
+    {{{80,7}},7}, {{{0,8}},91}, {{{0,8}},27}, {{{0,9}},151},
+    {{{84,7}},67}, {{{0,8}},123}, {{{0,8}},59}, {{{0,9}},215},
+    {{{82,7}},19}, {{{0,8}},107}, {{{0,8}},43}, {{{0,9}},183},
+    {{{0,8}},11}, {{{0,8}},139}, {{{0,8}},75}, {{{0,9}},247},
+    {{{80,7}},5}, {{{0,8}},87}, {{{0,8}},23}, {{{192,8}},0},
+    {{{83,7}},51}, {{{0,8}},119}, {{{0,8}},55}, {{{0,9}},207},
+    {{{81,7}},15}, {{{0,8}},103}, {{{0,8}},39}, {{{0,9}},175},
+    {{{0,8}},7}, {{{0,8}},135}, {{{0,8}},71}, {{{0,9}},239},
+    {{{80,7}},9}, {{{0,8}},95}, {{{0,8}},31}, {{{0,9}},159},
+    {{{84,7}},99}, {{{0,8}},127}, {{{0,8}},63}, {{{0,9}},223},
+    {{{82,7}},27}, {{{0,8}},111}, {{{0,8}},47}, {{{0,9}},191},
+    {{{0,8}},15}, {{{0,8}},143}, {{{0,8}},79}, {{{0,9}},255}
+  };
+const inflate_huft fixed_td[] = {
+    {{{80,5}},1}, {{{87,5}},257}, {{{83,5}},17}, {{{91,5}},4097},
+    {{{81,5}},5}, {{{89,5}},1025}, {{{85,5}},65}, {{{93,5}},16385},
+    {{{80,5}},3}, {{{88,5}},513}, {{{84,5}},33}, {{{92,5}},8193},
+    {{{82,5}},9}, {{{90,5}},2049}, {{{86,5}},129}, {{{192,5}},24577},
+    {{{80,5}},2}, {{{87,5}},385}, {{{83,5}},25}, {{{91,5}},6145},
+    {{{81,5}},7}, {{{89,5}},1537}, {{{85,5}},97}, {{{93,5}},24577},
+    {{{80,5}},4}, {{{88,5}},769}, {{{84,5}},49}, {{{92,5}},12289},
+    {{{82,5}},13}, {{{90,5}},3073}, {{{86,5}},193}, {{{192,5}},24577}
+  };
+
+
+
+
+
+
+
+// copy as much as possible from the sliding window to the output area
+int inflate_flush(inflate_blocks_statef *s,z_streamp z,int r)
+{
+  uInt n;
+  Byte *p;
+  Byte *q;
+
+  // local copies of source and destination pointers 
+  p = z->next_out;
+  q = s->read;
+
+  // compute number of bytes to copy as far as end of window 
+  n = (uInt)((q <= s->write ? s->write : s->end) - q);
+  if (n > z->avail_out) n = z->avail_out;
+  if (n && r == Z_BUF_ERROR) r = Z_OK;
+
+  // update counters
+  z->avail_out -= n;
+  z->total_out += n;
+
+  // update check information 
+  if (s->checkfn != Z_NULL)
+    z->adler = s->check = (*s->checkfn)(s->check, q, n);
+
+  // copy as far as end of window 
+  if (n!=0)          // check for n!=0 to avoid waking up CodeGuard
+  { memcpy(p, q, n);
+    p += n;
+    q += n;
+  }
+
+  // see if more to copy at beginning of window
+  if (q == s->end)
+  {
+    // wrap pointers 
+    q = s->window;
+    if (s->write == s->end)
+      s->write = s->window;
+
+    // compute bytes to copy 
+    n = (uInt)(s->write - q);
+    if (n > z->avail_out) n = z->avail_out;
+    if (n && r == Z_BUF_ERROR) r = Z_OK;
+
+    // update counters 
+    z->avail_out -= n;
+    z->total_out += n;
+
+    // update check information 
+    if (s->checkfn != Z_NULL)
+      z->adler = s->check = (*s->checkfn)(s->check, q, n);
+
+    // copy
+    if (n!=0) {memcpy(p,q,n); p+=n; q+=n;}
+  }
+
+  // update pointers
+  z->next_out = p;
+  s->read = q;
+
+  // done
+  return r;
+}
+
+
+
+
+
+
+// simplify the use of the inflate_huft type with some defines
+#define exop word.what.Exop
+#define bits word.what.Bits
+
+typedef enum {        // waiting for "i:"=input, "o:"=output, "x:"=nothing 
+      START,    // x: set up for LEN 
+      LEN,      // i: get length/literal/eob next 
+      LENEXT,   // i: getting length extra (have base) 
+      DIST,     // i: get distance next 
+      DISTEXT,  // i: getting distance extra 
+      COPY,     // o: copying bytes in window, waiting for space
+      LIT,      // o: got literal, waiting for output space 
+      WASH,     // o: got eob, possibly still output waiting 
+      END,      // x: got eob and all data flushed 
+      BADCODE}  // x: got error 
+inflate_codes_mode;
+
+// inflate codes private state
+struct inflate_codes_state {
+
+  // mode 
+  inflate_codes_mode mode;      // current inflate_codes mode 
+
+  // mode dependent information 
+  uInt len;
+  union {
+    struct {
+      const inflate_huft *tree;       // pointer into tree 
+      uInt need;                // bits needed 
+    } code;             // if LEN or DIST, where in tree 
+    uInt lit;           // if LIT, literal 
+    struct {
+      uInt get;                 // bits to get for extra 
+      uInt dist;                // distance back to copy from 
+    } copy;             // if EXT or COPY, where and how much 
+  } sub;                // submode
+
+  // mode independent information 
+  Byte lbits;           // ltree bits decoded per branch 
+  Byte dbits;           // dtree bits decoder per branch 
+  const inflate_huft *ltree;          // literal/length/eob tree
+  const inflate_huft *dtree;          // distance tree
+
+};
+
+
+inflate_codes_statef *inflate_codes_new(
+uInt bl, uInt bd,
+const inflate_huft *tl,
+const inflate_huft *td, // need separate declaration for Borland C++
+z_streamp z)
+{
+  inflate_codes_statef *c;
+
+  if ((c = (inflate_codes_statef *)
+       ZALLOC(z,1,sizeof(struct inflate_codes_state))) != Z_NULL)
+  {
+    c->mode = START;
+    c->lbits = (Byte)bl;
+    c->dbits = (Byte)bd;
+    c->ltree = tl;
+    c->dtree = td;
+    LuTracev((stderr, "inflate:       codes new\n"));
+  }
+  return c;
+}
+
+
+int inflate_codes(inflate_blocks_statef *s, z_streamp z, int r)
+{
+  uInt j;               // temporary storage
+  const inflate_huft *t;      // temporary pointer
+  uInt e;               // extra bits or operation
+  uLong b;              // bit buffer
+  uInt k;               // bits in bit buffer
+  Byte *p;             // input data pointer
+  uInt n;               // bytes available there
+  Byte *q;             // output window write pointer
+  uInt m;               // bytes to end of window or read pointer
+  Byte *f;             // pointer to copy strings from
+  inflate_codes_statef *c = s->sub.decode.codes;  // codes state
+
+  // copy input/output information to locals (UPDATE macro restores)
+  LOAD
+
+  // process input and output based on current state
+  for(;;) switch (c->mode)
+  {             // waiting for "i:"=input, "o:"=output, "x:"=nothing
+    case START:         // x: set up for LEN
+#ifndef SLOW
+      if (m >= 258 && n >= 10)
+      {
+        UPDATE
+        r = inflate_fast(c->lbits, c->dbits, c->ltree, c->dtree, s, z);
+        LOAD
+        if (r != Z_OK)
+        {
+          c->mode = r == Z_STREAM_END ? WASH : BADCODE;
+          break;
+        }
+      }
+#endif // !SLOW
+      c->sub.code.need = c->lbits;
+      c->sub.code.tree = c->ltree;
+      c->mode = LEN;
+    case LEN:           // i: get length/literal/eob next
+      j = c->sub.code.need;
+      NEEDBITS(j)
+      t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
+      DUMPBITS(t->bits)
+      e = (uInt)(t->exop);
+      if (e == 0)               // literal 
+      {
+        c->sub.lit = t->base;
+        LuTracevv((stderr, t->base >= 0x20 && t->base < 0x7f ?
+                 "inflate:         literal '%c'\n" :
+                 "inflate:         literal 0x%02x\n", t->base));
+        c->mode = LIT;
+        break;
+      }
+      if (e & 16)               // length 
+      {
+        c->sub.copy.get = e & 15;
+        c->len = t->base;
+        c->mode = LENEXT;
+        break;
+      }
+      if ((e & 64) == 0)        // next table 
+      {
+        c->sub.code.need = e;
+        c->sub.code.tree = t + t->base;
+        break;
+      }
+      if (e & 32)               // end of block 
+      {
+        LuTracevv((stderr, "inflate:         end of block\n"));
+        c->mode = WASH;
+        break;
+      }
+      c->mode = BADCODE;        // invalid code 
+      z->msg = (char*)"invalid literal/length code";
+      r = Z_DATA_ERROR;
+      LEAVE
+    case LENEXT:        // i: getting length extra (have base) 
+      j = c->sub.copy.get;
+      NEEDBITS(j)
+      c->len += (uInt)b & inflate_mask[j];
+      DUMPBITS(j)
+      c->sub.code.need = c->dbits;
+      c->sub.code.tree = c->dtree;
+      LuTracevv((stderr, "inflate:         length %u\n", c->len));
+      c->mode = DIST;
+    case DIST:          // i: get distance next 
+      j = c->sub.code.need;
+      NEEDBITS(j)
+      t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
+      DUMPBITS(t->bits)
+      e = (uInt)(t->exop);
+      if (e & 16)               // distance 
+      {
+        c->sub.copy.get = e & 15;
+        c->sub.copy.dist = t->base;
+        c->mode = DISTEXT;
+        break;
+      }
+      if ((e & 64) == 0)        // next table 
+      {
+        c->sub.code.need = e;
+        c->sub.code.tree = t + t->base;
+        break;
+      }
+      c->mode = BADCODE;        // invalid code 
+      z->msg = (char*)"invalid distance code";
+      r = Z_DATA_ERROR;
+      LEAVE
+    case DISTEXT:       // i: getting distance extra 
+      j = c->sub.copy.get;
+      NEEDBITS(j)
+      c->sub.copy.dist += (uInt)b & inflate_mask[j];
+      DUMPBITS(j)
+      LuTracevv((stderr, "inflate:         distance %u\n", c->sub.copy.dist));
+      c->mode = COPY;
+    case COPY:          // o: copying bytes in window, waiting for space 
+      f = q - c->sub.copy.dist;
+      while (f < s->window)             // modulo window size-"while" instead
+        f += s->end - s->window;        // of "if" handles invalid distances 
+      while (c->len)
+      {
+        NEEDOUT
+        OUTBYTE(*f++)
+        if (f == s->end)
+          f = s->window;
+        c->len--;
+      }
+      c->mode = START;
+      break;
+    case LIT:           // o: got literal, waiting for output space 
+      NEEDOUT
+      OUTBYTE(c->sub.lit)
+      c->mode = START;
+      break;
+    case WASH:          // o: got eob, possibly more output 
+      if (k > 7)        // return unused byte, if any 
+      {
+        //Assert(k < 16, "inflate_codes grabbed too many bytes")
+        k -= 8;
+        n++;
+        p--;            // can always return one 
+      }
+      FLUSH
+      if (s->read != s->write)
+        LEAVE
+      c->mode = END;
+    case END:
+      r = Z_STREAM_END;
+      LEAVE
+    case BADCODE:       // x: got error
+      r = Z_DATA_ERROR;
+      LEAVE
+    default:
+      r = Z_STREAM_ERROR;
+      LEAVE
+  }
+}
+
+
+void inflate_codes_free(inflate_codes_statef *c,z_streamp z)
+{ ZFREE(z, c);
+  LuTracev((stderr, "inflate:       codes free\n"));
+}
+
+
+
+// infblock.c -- interpret and process block types to last block
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+
+//struct inflate_codes_state {int dummy;}; // for buggy compilers 
+
+
+
+// Table for deflate from PKZIP's appnote.txt.
+const uInt border[] = { // Order of the bit length code lengths
+        16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
+
+//
+// Notes beyond the 1.93a appnote.txt:
+//
+// 1. Distance pointers never point before the beginning of the output stream.
+// 2. Distance pointers can point back across blocks, up to 32k away.
+// 3. There is an implied maximum of 7 bits for the bit length table and
+//    15 bits for the actual data.
+// 4. If only one code exists, then it is encoded using one bit.  (Zero
+//    would be more efficient, but perhaps a little confusing.)  If two
+//    codes exist, they are coded using one bit each (0 and 1).
+// 5. There is no way of sending zero distance codes--a dummy must be
+//    sent if there are none.  (History: a pre 2.0 version of PKZIP would
+//    store blocks with no distance codes, but this was discovered to be
+//    too harsh a criterion.)  Valid only for 1.93a.  2.04c does allow
+//    zero distance codes, which is sent as one code of zero bits in
+//    length.
+// 6. There are up to 286 literal/length codes.  Code 256 represents the
+//    end-of-block.  Note however that the static length tree defines
+//    288 codes just to fill out the Huffman codes.  Codes 286 and 287
+//    cannot be used though, since there is no length base or extra bits
+//    defined for them.  Similarily, there are up to 30 distance codes.
+//    However, static trees define 32 codes (all 5 bits) to fill out the
+//    Huffman codes, but the last two had better not show up in the data.
+// 7. Unzip can check dynamic Huffman blocks for complete code sets.
+//    The exception is that a single code would not be complete (see #4).
+// 8. The five bits following the block type is really the number of
+//    literal codes sent minus 257.
+// 9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits
+//    (1+6+6).  Therefore, to output three times the length, you output
+//    three codes (1+1+1), whereas to output four times the same length,
+//    you only need two codes (1+3).  Hmm.
+//10. In the tree reconstruction algorithm, Code = Code + Increment
+//    only if BitLength(i) is not zero.  (Pretty obvious.)
+//11. Correction: 4 Bits: # of Bit Length codes - 4     (4 - 19)
+//12. Note: length code 284 can represent 227-258, but length code 285
+//    really is 258.  The last length deserves its own, short code
+//    since it gets used a lot in very redundant files.  The length
+//    258 is special since 258 - 3 (the min match length) is 255.
+//13. The literal/length and distance code bit lengths are read as a
+//    single stream of lengths.  It is possible (and advantageous) for
+//    a repeat code (16, 17, or 18) to go across the boundary between
+//    the two sets of lengths.
+
+
+void inflate_blocks_reset(inflate_blocks_statef *s, z_streamp z, uLong *c)
+{
+  if (c != Z_NULL)
+    *c = s->check;
+  if (s->mode == IBM_BTREE || s->mode == IBM_DTREE)
+    ZFREE(z, s->sub.trees.blens);
+  if (s->mode == IBM_CODES)
+    inflate_codes_free(s->sub.decode.codes, z);
+  s->mode = IBM_TYPE;
+  s->bitk = 0;
+  s->bitb = 0;
+  s->read = s->write = s->window;
+  if (s->checkfn != Z_NULL)
+    z->adler = s->check = (*s->checkfn)(0L, (const Byte *)Z_NULL, 0);
+  LuTracev((stderr, "inflate:   blocks reset\n"));
+}
+
+
+inflate_blocks_statef *inflate_blocks_new(z_streamp z, check_func c, uInt w)
+{
+  inflate_blocks_statef *s;
+
+  if ((s = (inflate_blocks_statef *)ZALLOC
+       (z,1,sizeof(struct inflate_blocks_state))) == Z_NULL)
+    return s;
+  if ((s->hufts =
+       (inflate_huft *)ZALLOC(z, sizeof(inflate_huft), MANY)) == Z_NULL)
+  {
+    ZFREE(z, s);
+    return Z_NULL;
+  }
+  if ((s->window = (Byte *)ZALLOC(z, 1, w)) == Z_NULL)
+  {
+    ZFREE(z, s->hufts);
+    ZFREE(z, s);
+    return Z_NULL;
+  }
+  s->end = s->window + w;
+  s->checkfn = c;
+  s->mode = IBM_TYPE;
+  LuTracev((stderr, "inflate:   blocks allocated\n"));
+  inflate_blocks_reset(s, z, Z_NULL);
+  return s;
+}
+
+
+int inflate_blocks(inflate_blocks_statef *s, z_streamp z, int r)
+{
+  uInt t;               // temporary storage
+  uLong b;              // bit buffer
+  uInt k;               // bits in bit buffer
+  Byte *p;             // input data pointer
+  uInt n;               // bytes available there
+  Byte *q;             // output window write pointer
+  uInt m;               // bytes to end of window or read pointer 
+
+  // copy input/output information to locals (UPDATE macro restores) 
+  LOAD
+
+  // process input based on current state 
+  for(;;) switch (s->mode)
+  {
+    case IBM_TYPE:
+      NEEDBITS(3)
+      t = (uInt)b & 7;
+      s->last = t & 1;
+      switch (t >> 1)
+      {
+        case 0:                         // stored 
+          LuTracev((stderr, "inflate:     stored block%s\n",
+                 s->last ? " (last)" : ""));
+          DUMPBITS(3)
+          t = k & 7;                    // go to byte boundary 
+          DUMPBITS(t)
+          s->mode = IBM_LENS;               // get length of stored block
+          break;
+        case 1:                         // fixed 
+          LuTracev((stderr, "inflate:     fixed codes block%s\n",
+                 s->last ? " (last)" : ""));
+          {
+            uInt bl, bd;
+            const inflate_huft *tl, *td;
+
+            inflate_trees_fixed(&bl, &bd, &tl, &td, z);
+            s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z);
+            if (s->sub.decode.codes == Z_NULL)
+            {
+              r = Z_MEM_ERROR;
+              LEAVE
+            }
+          }
+          DUMPBITS(3)
+          s->mode = IBM_CODES;
+          break;
+        case 2:                         // dynamic 
+          LuTracev((stderr, "inflate:     dynamic codes block%s\n",
+                 s->last ? " (last)" : ""));
+          DUMPBITS(3)
+          s->mode = IBM_TABLE;
+          break;
+        case 3:                         // illegal
+          DUMPBITS(3)
+          s->mode = IBM_BAD;
+          z->msg = (char*)"invalid block type";
+          r = Z_DATA_ERROR;
+          LEAVE
+      }
+      break;
+    case IBM_LENS:
+      NEEDBITS(32)
+      if ((((~b) >> 16) & 0xffff) != (b & 0xffff))
+      {
+        s->mode = IBM_BAD;
+        z->msg = (char*)"invalid stored block lengths";
+        r = Z_DATA_ERROR;
+        LEAVE
+      }
+      s->sub.left = (uInt)b & 0xffff;
+      b = k = 0;                      // dump bits 
+      LuTracev((stderr, "inflate:       stored length %u\n", s->sub.left));
+      s->mode = s->sub.left ? IBM_STORED : (s->last ? IBM_DRY : IBM_TYPE);
+      break;
+    case IBM_STORED:
+      if (n == 0)
+        LEAVE
+      NEEDOUT
+      t = s->sub.left;
+      if (t > n) t = n;
+      if (t > m) t = m;
+      memcpy(q, p, t);
+      p += t;  n -= t;
+      q += t;  m -= t;
+      if ((s->sub.left -= t) != 0)
+        break;
+      LuTracev((stderr, "inflate:       stored end, %lu total out\n",
+              z->total_out + (q >= s->read ? q - s->read :
+              (s->end - s->read) + (q - s->window))));
+      s->mode = s->last ? IBM_DRY : IBM_TYPE;
+      break;
+    case IBM_TABLE:
+      NEEDBITS(14)
+      s->sub.trees.table = t = (uInt)b & 0x3fff;
+      // remove this section to workaround bug in pkzip
+      if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29)
+      {
+        s->mode = IBM_BAD;
+        z->msg = (char*)"too many length or distance symbols";
+        r = Z_DATA_ERROR;
+        LEAVE
+      }
+      // end remove
+      t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);
+      if ((s->sub.trees.blens = (uInt*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
+      {
+        r = Z_MEM_ERROR;
+        LEAVE
+      }
+      DUMPBITS(14)
+      s->sub.trees.index = 0;
+      LuTracev((stderr, "inflate:       table sizes ok\n"));
+      s->mode = IBM_BTREE;
+    case IBM_BTREE:
+      while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
+      {
+        NEEDBITS(3)
+        s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
+        DUMPBITS(3)
+      }
+      while (s->sub.trees.index < 19)
+        s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
+      s->sub.trees.bb = 7;
+      t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
+                             &s->sub.trees.tb, s->hufts, z);
+      if (t != Z_OK)
+      {
+        r = t;
+        if (r == Z_DATA_ERROR)
+        {
+          ZFREE(z, s->sub.trees.blens);
+          s->mode = IBM_BAD;
+        }
+        LEAVE
+      }
+      s->sub.trees.index = 0;
+      LuTracev((stderr, "inflate:       bits tree ok\n"));
+      s->mode = IBM_DTREE;
+    case IBM_DTREE:
+      while (t = s->sub.trees.table,
+             s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))
+      {
+        inflate_huft *h;
+        uInt i, j, c;
+
+        t = s->sub.trees.bb;
+        NEEDBITS(t)
+        h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
+        t = h->bits;
+        c = h->base;
+        if (c < 16)
+        {
+          DUMPBITS(t)
+          s->sub.trees.blens[s->sub.trees.index++] = c;
+        }
+        else // c == 16..18 
+        {
+          i = c == 18 ? 7 : c - 14;
+          j = c == 18 ? 11 : 3;
+          NEEDBITS(t + i)
+          DUMPBITS(t)
+          j += (uInt)b & inflate_mask[i];
+          DUMPBITS(i)
+          i = s->sub.trees.index;
+          t = s->sub.trees.table;
+          if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) ||
+              (c == 16 && i < 1))
+          {
+            ZFREE(z, s->sub.trees.blens);
+            s->mode = IBM_BAD;
+            z->msg = (char*)"invalid bit length repeat";
+            r = Z_DATA_ERROR;
+            LEAVE
+          }
+          c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
+          do {
+            s->sub.trees.blens[i++] = c;
+          } while (--j);
+          s->sub.trees.index = i;
+        }
+      }
+      s->sub.trees.tb = Z_NULL;
+      {
+        uInt bl, bd;
+        inflate_huft *tl, *td;
+        inflate_codes_statef *c;
+
+        bl = 9;         // must be <= 9 for lookahead assumptions 
+        bd = 6;         // must be <= 9 for lookahead assumptions
+        t = s->sub.trees.table;
+        t = inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f),
+                                  s->sub.trees.blens, &bl, &bd, &tl, &td,
+                                  s->hufts, z);
+        if (t != Z_OK)
+        {
+          if (t == (uInt)Z_DATA_ERROR)
+          {
+            ZFREE(z, s->sub.trees.blens);
+            s->mode = IBM_BAD;
+          }
+          r = t;
+          LEAVE
+        }
+        LuTracev((stderr, "inflate:       trees ok\n"));
+        if ((c = inflate_codes_new(bl, bd, tl, td, z)) == Z_NULL)
+        {
+          r = Z_MEM_ERROR;
+          LEAVE
+        }
+        s->sub.decode.codes = c;
+      }
+      ZFREE(z, s->sub.trees.blens);
+      s->mode = IBM_CODES;
+    case IBM_CODES:
+      UPDATE
+      if ((r = inflate_codes(s, z, r)) != Z_STREAM_END)
+        return inflate_flush(s, z, r);
+      r = Z_OK;
+      inflate_codes_free(s->sub.decode.codes, z);
+      LOAD
+      LuTracev((stderr, "inflate:       codes end, %lu total out\n",
+              z->total_out + (q >= s->read ? q - s->read :
+              (s->end - s->read) + (q - s->window))));
+      if (!s->last)
+      {
+        s->mode = IBM_TYPE;
+        break;
+      }
+      s->mode = IBM_DRY;
+    case IBM_DRY:
+      FLUSH
+      if (s->read != s->write)
+        LEAVE
+      s->mode = IBM_DONE;
+    case IBM_DONE:
+      r = Z_STREAM_END;
+      LEAVE
+    case IBM_BAD:
+      r = Z_DATA_ERROR;
+      LEAVE
+    default:
+      r = Z_STREAM_ERROR;
+      LEAVE
+  }
+}
+
+
+int inflate_blocks_free(inflate_blocks_statef *s, z_streamp z)
+{
+  inflate_blocks_reset(s, z, Z_NULL);
+  ZFREE(z, s->window);
+  ZFREE(z, s->hufts);
+  ZFREE(z, s);
+  LuTracev((stderr, "inflate:   blocks freed\n"));
+  return Z_OK;
+}
+
+
+
+// inftrees.c -- generate Huffman trees for efficient decoding
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+//
+
+
+
+extern const char inflate_copyright[] =
+   " inflate 1.1.3 Copyright 1995-1998 Mark Adler ";
+// If you use the zlib library in a product, an acknowledgment is welcome
+// in the documentation of your product. If for some reason you cannot
+// include such an acknowledgment, I would appreciate that you keep this
+// copyright string in the executable of your product.
+
+
+
+int huft_build (
+    uInt *,            // code lengths in bits
+    uInt,               // number of codes
+    uInt,               // number of "simple" codes
+    const uInt *,      // list of base values for non-simple codes
+    const uInt *,      // list of extra bits for non-simple codes
+    inflate_huft **,// result: starting table
+    uInt *,            // maximum lookup bits (returns actual) 
+    inflate_huft *,     // space for trees 
+    uInt *,             // hufts used in space 
+    uInt * );         // space for values 
+
+// Tables for deflate from PKZIP's appnote.txt. 
+const uInt cplens[31] = { // Copy lengths for literal codes 257..285
+        3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
+        35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};
+        // see note #13 above about 258
+const uInt cplext[31] = { // Extra bits for literal codes 257..285
+        0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2,
+        3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112}; // 112==invalid
+const uInt cpdist[30] = { // Copy offsets for distance codes 0..29
+        1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
+        257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
+        8193, 12289, 16385, 24577};
+const uInt cpdext[30] = { // Extra bits for distance codes 
+        0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6,
+        7, 7, 8, 8, 9, 9, 10, 10, 11, 11,
+        12, 12, 13, 13};
+
+//
+//   Huffman code decoding is performed using a multi-level table lookup.
+//   The fastest way to decode is to simply build a lookup table whose
+//   size is determined by the longest code.  However, the time it takes
+//   to build this table can also be a factor if the data being decoded
+//   is not very long.  The most common codes are necessarily the
+//   shortest codes, so those codes dominate the decoding time, and hence
+//   the speed.  The idea is you can have a shorter table that decodes the
+//   shorter, more probable codes, and then point to subsidiary tables for
+//   the longer codes.  The time it costs to decode the longer codes is
+//   then traded against the time it takes to make longer tables.
+//
+//   This results of this trade are in the variables lbits and dbits
+//   below.  lbits is the number of bits the first level table for literal/
+//   length codes can decode in one step, and dbits is the same thing for
+//   the distance codes.  Subsequent tables are also less than or equal to
+//   those sizes.  These values may be adjusted either when all of the
+//   codes are shorter than that, in which case the longest code length in
+//   bits is used, or when the shortest code is *longer* than the requested
+//   table size, in which case the length of the shortest code in bits is
+//   used.
+//
+//   There are two different values for the two tables, since they code a
+//   different number of possibilities each.  The literal/length table
+//   codes 286 possible values, or in a flat code, a little over eight
+//   bits.  The distance table codes 30 possible values, or a little less
+//   than five bits, flat.  The optimum values for speed end up being
+//   about one bit more than those, so lbits is 8+1 and dbits is 5+1.
+//   The optimum values may differ though from machine to machine, and
+//   possibly even between compilers.  Your mileage may vary.
+//
+
+
+// If BMAX needs to be larger than 16, then h and x[] should be uLong. 
+#define BMAX 15         // maximum bit length of any code
+
+int huft_build(
+uInt *b,               // code lengths in bits (all assumed <= BMAX)
+uInt n,                 // number of codes (assumed <= 288)
+uInt s,                 // number of simple-valued codes (0..s-1)
+const uInt *d,         // list of base values for non-simple codes
+const uInt *e,         // list of extra bits for non-simple codes
+inflate_huft * *t,  // result: starting table
+uInt *m,               // maximum lookup bits, returns actual
+inflate_huft *hp,       // space for trees
+uInt *hn,               // hufts used in space
+uInt *v)               // working area: values in order of bit length
+// Given a list of code lengths and a maximum table size, make a set of
+// tables to decode that set of codes.  Return Z_OK on success, Z_BUF_ERROR
+// if the given code set is incomplete (the tables are still built in this
+// case), or Z_DATA_ERROR if the input is invalid.
+{
+
+  uInt a;                       // counter for codes of length k
+  uInt c[BMAX+1];               // bit length count table
+  uInt f;                       // i repeats in table every f entries 
+  int g;                        // maximum code length 
+  int h;                        // table level 
+  register uInt i;              // counter, current code 
+  register uInt j;              // counter
+  register int k;               // number of bits in current code 
+  int l;                        // bits per table (returned in m) 
+  uInt mask;                    // (1 << w) - 1, to avoid cc -O bug on HP 
+  register uInt *p;            // pointer into c[], b[], or v[]
+  inflate_huft *q;              // points to current table 
+  struct inflate_huft_s r;      // table entry for structure assignment 
+  inflate_huft *u[BMAX];        // table stack 
+  register int w;               // bits before this table == (l * h) 
+  uInt x[BMAX+1];               // bit offsets, then code stack 
+  uInt *xp;                    // pointer into x 
+  int y;                        // number of dummy codes added 
+  uInt z;                       // number of entries in current table 
+
+
+  // Generate counts for each bit length 
+  p = c;
+#define C0 *p++ = 0;
+#define C2 C0 C0 C0 C0
+#define C4 C2 C2 C2 C2
+  C4; p;                          // clear c[]--assume BMAX+1 is 16
+  p = b;  i = n;
+  do {
+    c[*p++]++;                  // assume all entries <= BMAX 
+  } while (--i);
+  if (c[0] == n)                // null input--all zero length codes 
+  {
+    *t = (inflate_huft *)Z_NULL;
+    *m = 0;
+    return Z_OK;
+  }
+
+
+  // Find minimum and maximum length, bound *m by those 
+  l = *m;
+  for (j = 1; j <= BMAX; j++)
+    if (c[j])
+      break;
+  k = j;                        // minimum code length 
+  if ((uInt)l < j)
+    l = j;
+  for (i = BMAX; i; i--)
+    if (c[i])
+      break;
+  g = i;                        // maximum code length 
+  if ((uInt)l > i)
+    l = i;
+  *m = l;
+
+
+  // Adjust last length count to fill out codes, if needed 
+  for (y = 1 << j; j < i; j++, y <<= 1)
+    if ((y -= c[j]) < 0)
+      return Z_DATA_ERROR;
+  if ((y -= c[i]) < 0)
+    return Z_DATA_ERROR;
+  c[i] += y;
+
+
+  // Generate starting offsets into the value table for each length 
+  x[1] = j = 0;
+  p = c + 1;  xp = x + 2;
+  while (--i) {                 // note that i == g from above 
+    *xp++ = (j += *p++);
+  }
+
+
+  // Make a table of values in order of bit lengths 
+  p = b;  i = 0;
+  do {
+    if ((j = *p++) != 0)
+      v[x[j]++] = i;
+  } while (++i < n);
+  n = x[g];                     // set n to length of v 
+
+
+  // Generate the Huffman codes and for each, make the table entries 
+  x[0] = i = 0;                 // first Huffman code is zero 
+  p = v;                        // grab values in bit order 
+  h = -1;                       // no tables yet--level -1 
+  w = -l;                       // bits decoded == (l * h) 
+  u[0] = (inflate_huft *)Z_NULL;        // just to keep compilers happy 
+  q = (inflate_huft *)Z_NULL;   // ditto 
+  z = 0;                        // ditto 
+
+  // go through the bit lengths (k already is bits in shortest code) 
+  for (; k <= g; k++)
+  {
+    a = c[k];
+    while (a--)
+    {
+      // here i is the Huffman code of length k bits for value *p 
+      // make tables up to required level 
+      while (k > w + l)
+      {
+        h++;
+        w += l;                 // previous table always l bits 
+
+        // compute minimum size table less than or equal to l bits
+        z = g - w;
+        z = z > (uInt)l ? l : z;        // table size upper limit 
+        if ((f = 1 << (j = k - w)) > a + 1)     // try a k-w bit table 
+        {                       // too few codes for k-w bit table 
+          f -= a + 1;           // deduct codes from patterns left 
+          xp = c + k;
+          if (j < z)
+            while (++j < z)     // try smaller tables up to z bits 
+            {
+              if ((f <<= 1) <= *++xp)
+                break;          // enough codes to use up j bits 
+              f -= *xp;         // else deduct codes from patterns
+            }
+        }
+        z = 1 << j;             // table entries for j-bit table 
+
+        // allocate new table 
+        if (*hn + z > MANY)     // (note: doesn't matter for fixed) 
+          return Z_DATA_ERROR;  // overflow of MANY 
+        u[h] = q = hp + *hn;
+        *hn += z;
+
+        // connect to last table, if there is one 
+        if (h)
+        {
+          x[h] = i;             // save pattern for backing up
+          r.bits = (Byte)l;     // bits to dump before this table 
+          r.exop = (Byte)j;     // bits in this table 
+          j = i >> (w - l);
+          r.base = (uInt)(q - u[h-1] - j);   // offset to this table 
+          u[h-1][j] = r;        // connect to last table 
+        }
+        else
+          *t = q;               // first table is returned result 
+      }
+
+      // set up table entry in r 
+      r.bits = (Byte)(k - w);
+      if (p >= v + n)
+        r.exop = 128 + 64;      // out of values--invalid code 
+      else if (*p < s)
+      {
+        r.exop = (Byte)(*p < 256 ? 0 : 32 + 64);     // 256 is end-of-block 
+        r.base = *p++;          // simple code is just the value 
+      }
+      else
+      {
+        r.exop = (Byte)(e[*p - s] + 16 + 64);// non-simple--look up in lists 
+        r.base = d[*p++ - s];
+      }
+
+      // fill code-like entries with r
+      f = 1 << (k - w);
+      for (j = i >> w; j < z; j += f)
+        q[j] = r;
+
+      // backwards increment the k-bit code i 
+      for (j = 1 << (k - 1); i & j; j >>= 1)
+        i ^= j;
+      i ^= j;
+
+      // backup over finished tables 
+      mask = (1 << w) - 1;      // needed on HP, cc -O bug 
+      while ((i & mask) != x[h])
+      {
+        h--;                    // don't need to update q
+        w -= l;
+        mask = (1 << w) - 1;
+      }
+    }
+  }
+
+
+  // Return Z_BUF_ERROR if we were given an incomplete table 
+  return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK;
+}
+
+
+int inflate_trees_bits(
+uInt *c,               // 19 code lengths
+uInt *bb,              // bits tree desired/actual depth
+inflate_huft * *tb, // bits tree result
+inflate_huft *hp,       // space for trees
+z_streamp z)            // for messages
+{
+  int r;
+  uInt hn = 0;          // hufts used in space 
+  uInt *v;             // work area for huft_build 
+
+  if ((v = (uInt*)ZALLOC(z, 19, sizeof(uInt))) == Z_NULL)
+    return Z_MEM_ERROR;
+  r = huft_build(c, 19, 19, (uInt*)Z_NULL, (uInt*)Z_NULL,
+                 tb, bb, hp, &hn, v);
+  if (r == Z_DATA_ERROR)
+    z->msg = (char*)"oversubscribed dynamic bit lengths tree";
+  else if (r == Z_BUF_ERROR || *bb == 0)
+  {
+    z->msg = (char*)"incomplete dynamic bit lengths tree";
+    r = Z_DATA_ERROR;
+  }
+  ZFREE(z, v);
+  return r;
+}
+
+
+int inflate_trees_dynamic(
+uInt nl,                // number of literal/length codes
+uInt nd,                // number of distance codes
+uInt *c,               // that many (total) code lengths
+uInt *bl,              // literal desired/actual bit depth
+uInt *bd,              // distance desired/actual bit depth
+inflate_huft * *tl, // literal/length tree result
+inflate_huft * *td, // distance tree result
+inflate_huft *hp,       // space for trees
+z_streamp z)            // for messages
+{
+  int r;
+  uInt hn = 0;          // hufts used in space 
+  uInt *v;             // work area for huft_build 
+
+  // allocate work area 
+  if ((v = (uInt*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL)
+    return Z_MEM_ERROR;
+
+  // build literal/length tree 
+  r = huft_build(c, nl, 257, cplens, cplext, tl, bl, hp, &hn, v);
+  if (r != Z_OK || *bl == 0)
+  {
+    if (r == Z_DATA_ERROR)
+      z->msg = (char*)"oversubscribed literal/length tree";
+    else if (r != Z_MEM_ERROR)
+    {
+      z->msg = (char*)"incomplete literal/length tree";
+      r = Z_DATA_ERROR;
+    }
+    ZFREE(z, v);
+    return r;
+  }
+
+  // build distance tree 
+  r = huft_build(c + nl, nd, 0, cpdist, cpdext, td, bd, hp, &hn, v);
+  if (r != Z_OK || (*bd == 0 && nl > 257))
+  {
+    if (r == Z_DATA_ERROR)
+      z->msg = (char*)"oversubscribed distance tree";
+    else if (r == Z_BUF_ERROR) {
+      z->msg = (char*)"incomplete distance tree";
+      r = Z_DATA_ERROR;
+    }
+    else if (r != Z_MEM_ERROR)
+    {
+      z->msg = (char*)"empty distance tree with lengths";
+      r = Z_DATA_ERROR;
+    }
+    ZFREE(z, v);
+    return r;
+  }
+
+  // done 
+  ZFREE(z, v);
+  return Z_OK;
+}
+
+
+
+
+
+int inflate_trees_fixed(
+uInt *bl,               // literal desired/actual bit depth
+uInt *bd,               // distance desired/actual bit depth
+const inflate_huft * * tl,     // literal/length tree result
+const inflate_huft * *td,     // distance tree result
+z_streamp )             // for memory allocation
+{
+  *bl = fixed_bl;
+  *bd = fixed_bd;
+  *tl = fixed_tl;
+  *td = fixed_td;
+  return Z_OK;
+}
+
+
+// inffast.c -- process literals and length/distance pairs fast
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+//
+
+
+//struct inflate_codes_state {int dummy;}; // for buggy compilers 
+
+
+// macros for bit input with no checking and for returning unused bytes 
+#define GRABBITS(j) {while(k<(j)){b|=((uLong)NEXTBYTE)<<k;k+=8;}}
+#define UNGRAB {c=z->avail_in-n;c=(k>>3)<c?k>>3:c;n+=c;p-=c;k-=c<<3;}
+
+// Called with number of bytes left to write in window at least 258
+// (the maximum string length) and number of input bytes available
+// at least ten.  The ten bytes are six bytes for the longest length/
+// distance pair plus four bytes for overloading the bit buffer. 
+
+int inflate_fast(
+uInt bl, uInt bd,
+const inflate_huft *tl,
+const inflate_huft *td, // need separate declaration for Borland C++
+inflate_blocks_statef *s,
+z_streamp z)
+{
+  const inflate_huft *t;      // temporary pointer 
+  uInt e;               // extra bits or operation 
+  uLong b;              // bit buffer 
+  uInt k;               // bits in bit buffer 
+  Byte *p;             // input data pointer 
+  uInt n;               // bytes available there 
+  Byte *q;             // output window write pointer 
+  uInt m;               // bytes to end of window or read pointer 
+  uInt ml;              // mask for literal/length tree
+  uInt md;              // mask for distance tree 
+  uInt c;               // bytes to copy 
+  uInt d;               // distance back to copy from 
+  Byte *r;             // copy source pointer 
+
+  // load input, output, bit values 
+  LOAD
+
+  // initialize masks 
+  ml = inflate_mask[bl];
+  md = inflate_mask[bd];
+
+  // do until not enough input or output space for fast loop 
+  do {                          // assume called with m >= 258 && n >= 10 
+    // get literal/length code 
+    GRABBITS(20)                // max bits for literal/length code 
+    if ((e = (t = tl + ((uInt)b & ml))->exop) == 0)
+    {
+      DUMPBITS(t->bits)
+      LuTracevv((stderr, t->base >= 0x20 && t->base < 0x7f ?
+                "inflate:         * literal '%c'\n" :
+                "inflate:         * literal 0x%02x\n", t->base));
+      *q++ = (Byte)t->base;
+      m--;
+      continue;
+    }
+    for (;;) {
+      DUMPBITS(t->bits)
+      if (e & 16)
+      {
+        // get extra bits for length 
+        e &= 15;
+        c = t->base + ((uInt)b & inflate_mask[e]);
+        DUMPBITS(e)
+        LuTracevv((stderr, "inflate:         * length %u\n", c));
+
+        // decode distance base of block to copy 
+        GRABBITS(15);           // max bits for distance code 
+        e = (t = td + ((uInt)b & md))->exop;
+        for (;;) {
+          DUMPBITS(t->bits)
+          if (e & 16)
+          {
+            // get extra bits to add to distance base 
+            e &= 15;
+            GRABBITS(e)         // get extra bits (up to 13) 
+            d = t->base + ((uInt)b & inflate_mask[e]);
+            DUMPBITS(e)
+            LuTracevv((stderr, "inflate:         * distance %u\n", d));
+
+            // do the copy
+            m -= c;
+            r = q - d;
+            if (r < s->window)                  // wrap if needed
+            {
+              do {
+                r += s->end - s->window;        // force pointer in window
+              } while (r < s->window);          // covers invalid distances
+              e = (uInt) (s->end - r);
+              if (c > e)
+              {
+                c -= e;                         // wrapped copy
+                do {
+                    *q++ = *r++;
+                } while (--e);
+                r = s->window;
+                do {
+                    *q++ = *r++;
+                } while (--c);
+              }
+              else                              // normal copy
+              {
+                *q++ = *r++;  c--;
+                *q++ = *r++;  c--;
+                do {
+                    *q++ = *r++;
+                } while (--c);
+              }
+            }
+            else                                /* normal copy */
+            {
+              *q++ = *r++;  c--;
+              *q++ = *r++;  c--;
+              do {
+                *q++ = *r++;
+              } while (--c);
+            }
+            break;
+          }
+          else if ((e & 64) == 0)
+          {
+            t += t->base;
+            e = (t += ((uInt)b & inflate_mask[e]))->exop;
+          }
+          else
+          {
+            z->msg = (char*)"invalid distance code";
+            UNGRAB
+            UPDATE
+            return Z_DATA_ERROR;
+          }
+        };
+        break;
+      }
+      if ((e & 64) == 0)
+      {
+        t += t->base;
+        if ((e = (t += ((uInt)b & inflate_mask[e]))->exop) == 0)
+        {
+          DUMPBITS(t->bits)
+          LuTracevv((stderr, t->base >= 0x20 && t->base < 0x7f ?
+                    "inflate:         * literal '%c'\n" :
+                    "inflate:         * literal 0x%02x\n", t->base));
+          *q++ = (Byte)t->base;
+          m--;
+          break;
+        }
+      }
+      else if (e & 32)
+      {
+        LuTracevv((stderr, "inflate:         * end of block\n"));
+        UNGRAB
+        UPDATE
+        return Z_STREAM_END;
+      }
+      else
+      {
+        z->msg = (char*)"invalid literal/length code";
+        UNGRAB
+        UPDATE
+        return Z_DATA_ERROR;
+      }
+    };
+  } while (m >= 258 && n >= 10);
+
+  // not enough input or output--restore pointers and return
+  UNGRAB
+  UPDATE
+  return Z_OK;
+}
+
+
+
+
+
+
+// crc32.c -- compute the CRC-32 of a data stream
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+
+// @(#) $Id$
+
+
+
+
+
+
+// Table of CRC-32's of all single-byte values (made by make_crc_table)
+const uLong crc_table[256] = {
+  0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
+  0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
+  0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
+  0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL,
+  0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L,
+  0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L,
+  0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L,
+  0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL,
+  0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L,
+  0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL,
+  0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L,
+  0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L,
+  0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L,
+  0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL,
+  0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL,
+  0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L,
+  0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL,
+  0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L,
+  0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L,
+  0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L,
+  0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL,
+  0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L,
+  0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L,
+  0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
+  0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L,
+  0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L,
+  0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L,
+  0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L,
+  0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L,
+  0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL,
+  0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL,
+  0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L,
+  0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L,
+  0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL,
+  0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL,
+  0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L,
+  0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL,
+  0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L,
+  0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL,
+  0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L,
+  0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL,
+  0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L,
+  0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L,
+  0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL,
+  0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L,
+  0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L,
+  0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L,
+  0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
+  0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L,
+  0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L,
+  0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
+  0x2d02ef8dL
+};
+
+const uLong * get_crc_table()
+{ return (const uLong *)crc_table;
+}
+
+#define CRC_DO1(buf) crc = crc_table[((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8);
+#define CRC_DO2(buf)  CRC_DO1(buf); CRC_DO1(buf);
+#define CRC_DO4(buf)  CRC_DO2(buf); CRC_DO2(buf);
+#define CRC_DO8(buf)  CRC_DO4(buf); CRC_DO4(buf);
+
+uLong ucrc32(uLong crc, const Byte *buf, uInt len)
+{ if (buf == Z_NULL) return 0L;
+  crc = crc ^ 0xffffffffL;
+  while (len >= 8)  {CRC_DO8(buf); len -= 8;}
+  if (len) do {CRC_DO1(buf);} while (--len);
+  return crc ^ 0xffffffffL;
+}
+
+
+
+// =============================================================
+// some decryption routines
+#define CRC32(c, b) (crc_table[((int)(c)^(b))&0xff]^((c)>>8))
+void Uupdate_keys(unsigned long *keys, char c)
+{ keys[0] = CRC32(keys[0],c);
+  keys[1] += keys[0] & 0xFF;
+  keys[1] = keys[1]*134775813L +1;
+  keys[2] = CRC32(keys[2], keys[1] >> 24);
+}
+char Udecrypt_byte(unsigned long *keys)
+{ unsigned temp = ((unsigned)keys[2] & 0xffff) | 2;
+  return (char)(((temp * (temp ^ 1)) >> 8) & 0xff);
+}
+char zdecode(unsigned long *keys, char c)
+{ c^=Udecrypt_byte(keys);
+  Uupdate_keys(keys,c);
+  return c;
+}
+
+
+
+// adler32.c -- compute the Adler-32 checksum of a data stream
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+
+// @(#) $Id$
+
+
+#define BASE 65521L // largest prime smaller than 65536
+#define NMAX 5552
+// NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1
+
+#define AD_DO1(buf,i)  {s1 += buf[i]; s2 += s1;}
+#define AD_DO2(buf,i)  AD_DO1(buf,i); AD_DO1(buf,i+1);
+#define AD_DO4(buf,i)  AD_DO2(buf,i); AD_DO2(buf,i+2);
+#define AD_DO8(buf,i)  AD_DO4(buf,i); AD_DO4(buf,i+4);
+#define AD_DO16(buf)   AD_DO8(buf,0); AD_DO8(buf,8);
+
+// =========================================================================
+uLong adler32(uLong adler, const Byte *buf, uInt len)
+{
+    unsigned long s1 = adler & 0xffff;
+    unsigned long s2 = (adler >> 16) & 0xffff;
+    int k;
+
+    if (buf == Z_NULL) return 1L;
+
+    while (len > 0) {
+        k = len < NMAX ? len : NMAX;
+        len -= k;
+        while (k >= 16) {
+            AD_DO16(buf);
+	    buf += 16;
+            k -= 16;
+        }
+        if (k != 0) do {
+            s1 += *buf++;
+	    s2 += s1;
+        } while (--k);
+        s1 %= BASE;
+        s2 %= BASE;
+    }
+    return (s2 << 16) | s1;
+}
+
+
+
+// zutil.c -- target dependent utility functions for the compression library
+// Copyright (C) 1995-1998 Jean-loup Gailly.
+// For conditions of distribution and use, see copyright notice in zlib.h
+// @(#) $Id$
+
+
+
+
+
+
+const char * zlibVersion()
+{
+    return ZLIB_VERSION;
+}
+
+// exported to allow conversion of error code to string for compress() and
+// uncompress()
+const char * zError(int err)
+{ return ERR_MSG(err);
+}
+
+
+
+
+/*
+voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
+{
+    if (opaque) items += size - size; // make compiler happy
+    return (voidpf)calloc(items, size);
+}
+
+
+void  zcfree (voidpf opaque, voidpf ptr)
+{
+    zfree(ptr);
+    if (opaque) return; // make compiler happy
+}
+*/
+
+
+// inflate.c -- zlib interface to inflate modules
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+
+//struct inflate_blocks_state {int dummy;}; // for buggy compilers
+
+typedef enum {
+      IM_METHOD,   // waiting for method byte
+      IM_FLAG,     // waiting for flag byte
+      IM_DICT4,    // four dictionary check bytes to go
+      IM_DICT3,    // three dictionary check bytes to go
+      IM_DICT2,    // two dictionary check bytes to go
+      IM_DICT1,    // one dictionary check byte to go
+      IM_DICT0,    // waiting for inflateSetDictionary
+      IM_BLOCKS,   // decompressing blocks
+      IM_CHECK4,   // four check bytes to go
+      IM_CHECK3,   // three check bytes to go
+      IM_CHECK2,   // two check bytes to go
+      IM_CHECK1,   // one check byte to go
+      IM_DONE,     // finished check, done
+      IM_BAD}      // got an error--stay here
+inflate_mode;
+
+// inflate private state
+struct internal_state {
+
+  // mode
+  inflate_mode  mode;   // current inflate mode
+
+  // mode dependent information
+  union {
+    uInt method;        // if IM_FLAGS, method byte
+    struct {
+      uLong was;                // computed check value
+      uLong need;               // stream check value
+    } check;            // if CHECK, check values to compare
+    uInt marker;        // if IM_BAD, inflateSync's marker bytes count
+  } sub;        // submode
+
+  // mode independent information
+  int  nowrap;          // flag for no wrapper
+  uInt wbits;           // log2(window size)  (8..15, defaults to 15)
+  inflate_blocks_statef
+    *blocks;            // current inflate_blocks state
+
+};
+
+int inflateReset(z_streamp z)
+{
+  if (z == Z_NULL || z->state == Z_NULL)
+    return Z_STREAM_ERROR;
+  z->total_in = z->total_out = 0;
+  z->msg = Z_NULL;
+  z->state->mode = z->state->nowrap ? IM_BLOCKS : IM_METHOD;
+  inflate_blocks_reset(z->state->blocks, z, Z_NULL);
+  LuTracev((stderr, "inflate: reset\n"));
+  return Z_OK;
+}
+
+int inflateEnd(z_streamp z)
+{
+  if (z == Z_NULL || z->state == Z_NULL || z->zfree == Z_NULL)
+    return Z_STREAM_ERROR;
+  if (z->state->blocks != Z_NULL)
+    inflate_blocks_free(z->state->blocks, z);
+  ZFREE(z, z->state);
+  z->state = Z_NULL;
+  LuTracev((stderr, "inflate: end\n"));
+  return Z_OK;
+}
+
+
+int inflateInit2(z_streamp z)
+{ const char *version = ZLIB_VERSION; int stream_size = sizeof(z_stream);
+  if (version == Z_NULL || version[0] != ZLIB_VERSION[0] || stream_size != sizeof(z_stream)) return Z_VERSION_ERROR;
+
+  int w = -15; // MAX_WBITS: 32K LZ77 window.
+  // Warning: reducing MAX_WBITS makes minigzip unable to extract .gz files created by gzip.
+  // The memory requirements for deflate are (in bytes):
+  //            (1 << (windowBits+2)) +  (1 << (memLevel+9))
+  // that is: 128K for windowBits=15  +  128K for memLevel = 8  (default values)
+  // plus a few kilobytes for small objects. For example, if you want to reduce
+  // the default memory requirements from 256K to 128K, compile with
+  //     make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
+  // Of course this will generally degrade compression (there's no free lunch).
+  //
+  //   The memory requirements for inflate are (in bytes) 1 << windowBits
+  // that is, 32K for windowBits=15 (default value) plus a few kilobytes
+  // for small objects.
+
+  // initialize state
+  if (z == Z_NULL) return Z_STREAM_ERROR;
+  z->msg = Z_NULL;
+  if (z->zalloc == Z_NULL)
+  {
+    z->zalloc = zcalloc;
+    z->opaque = (voidpf)0;
+  }
+  if (z->zfree == Z_NULL) z->zfree = zcfree;
+  if ((z->state = (struct internal_state *)
+       ZALLOC(z,1,sizeof(struct internal_state))) == Z_NULL)
+    return Z_MEM_ERROR;
+  z->state->blocks = Z_NULL;
+
+  // handle undocumented nowrap option (no zlib header or check)
+  z->state->nowrap = 0;
+  if (w < 0)
+  {
+    w = - w;
+    z->state->nowrap = 1;
+  }
+
+  // set window size
+  if (w < 8 || w > 15)
+  {
+    inflateEnd(z);
+    return Z_STREAM_ERROR;
+  }
+  z->state->wbits = (uInt)w;
+
+  // create inflate_blocks state
+  if ((z->state->blocks =
+      inflate_blocks_new(z, z->state->nowrap ? Z_NULL : adler32, (uInt)1 << w))
+      == Z_NULL)
+  {
+    inflateEnd(z);
+    return Z_MEM_ERROR;
+  }
+  LuTracev((stderr, "inflate: allocated\n"));
+
+  // reset state 
+  inflateReset(z);
+  return Z_OK;
+}
+
+
+
+#define IM_NEEDBYTE {if(z->avail_in==0)return r;r=f;}
+#define IM_NEXTBYTE (z->avail_in--,z->total_in++,*z->next_in++)
+
+int inflate(z_streamp z, int f)
+{
+  int r;
+  uInt b;
+
+  if (z == Z_NULL || z->state == Z_NULL || z->next_in == Z_NULL)
+    return Z_STREAM_ERROR;
+  f = f == Z_FINISH ? Z_BUF_ERROR : Z_OK;
+  r = Z_BUF_ERROR;
+  for (;;) switch (z->state->mode)
+  {
+    case IM_METHOD:
+      IM_NEEDBYTE
+      if (((z->state->sub.method = IM_NEXTBYTE) & 0xf) != Z_DEFLATED)
+      {
+        z->state->mode = IM_BAD;
+        z->msg = (char*)"unknown compression method";
+        z->state->sub.marker = 5;       // can't try inflateSync
+        break;
+      }
+      if ((z->state->sub.method >> 4) + 8 > z->state->wbits)
+      {
+        z->state->mode = IM_BAD;
+        z->msg = (char*)"invalid window size";
+        z->state->sub.marker = 5;       // can't try inflateSync
+        break;
+      }
+      z->state->mode = IM_FLAG;
+    case IM_FLAG:
+      IM_NEEDBYTE
+      b = IM_NEXTBYTE;
+      if (((z->state->sub.method << 8) + b) % 31)
+      {
+        z->state->mode = IM_BAD;
+        z->msg = (char*)"incorrect header check";
+        z->state->sub.marker = 5;       // can't try inflateSync 
+        break;
+      }
+      LuTracev((stderr, "inflate: zlib header ok\n"));
+      if (!(b & PRESET_DICT))
+      {
+        z->state->mode = IM_BLOCKS;
+        break;
+      }
+      z->state->mode = IM_DICT4;
+    case IM_DICT4:
+      IM_NEEDBYTE
+      z->state->sub.check.need = (uLong)IM_NEXTBYTE << 24;
+      z->state->mode = IM_DICT3;
+    case IM_DICT3:
+      IM_NEEDBYTE
+      z->state->sub.check.need += (uLong)IM_NEXTBYTE << 16;
+      z->state->mode = IM_DICT2;
+    case IM_DICT2:
+      IM_NEEDBYTE
+      z->state->sub.check.need += (uLong)IM_NEXTBYTE << 8;
+      z->state->mode = IM_DICT1;
+    case IM_DICT1:
+      IM_NEEDBYTE; r;
+      z->state->sub.check.need += (uLong)IM_NEXTBYTE;
+      z->adler = z->state->sub.check.need;
+      z->state->mode = IM_DICT0;
+      return Z_NEED_DICT;
+    case IM_DICT0:
+      z->state->mode = IM_BAD;
+      z->msg = (char*)"need dictionary";
+      z->state->sub.marker = 0;       // can try inflateSync 
+      return Z_STREAM_ERROR;
+    case IM_BLOCKS:
+      r = inflate_blocks(z->state->blocks, z, r);
+      if (r == Z_DATA_ERROR)
+      {
+        z->state->mode = IM_BAD;
+        z->state->sub.marker = 0;       // can try inflateSync 
+        break;
+      }
+      if (r == Z_OK)
+        r = f;
+      if (r != Z_STREAM_END)
+        return r;
+      r = f;
+      inflate_blocks_reset(z->state->blocks, z, &z->state->sub.check.was);
+      if (z->state->nowrap)
+      {
+        z->state->mode = IM_DONE;
+        break;
+      }
+      z->state->mode = IM_CHECK4;
+    case IM_CHECK4:
+      IM_NEEDBYTE
+      z->state->sub.check.need = (uLong)IM_NEXTBYTE << 24;
+      z->state->mode = IM_CHECK3;
+    case IM_CHECK3:
+      IM_NEEDBYTE
+      z->state->sub.check.need += (uLong)IM_NEXTBYTE << 16;
+      z->state->mode = IM_CHECK2;
+    case IM_CHECK2:
+      IM_NEEDBYTE
+      z->state->sub.check.need += (uLong)IM_NEXTBYTE << 8;
+      z->state->mode = IM_CHECK1;
+    case IM_CHECK1:
+      IM_NEEDBYTE
+      z->state->sub.check.need += (uLong)IM_NEXTBYTE;
+
+      if (z->state->sub.check.was != z->state->sub.check.need)
+      {
+        z->state->mode = IM_BAD;
+        z->msg = (char*)"incorrect data check";
+        z->state->sub.marker = 5;       // can't try inflateSync 
+        break;
+      }
+      LuTracev((stderr, "inflate: zlib check ok\n"));
+      z->state->mode = IM_DONE;
+    case IM_DONE:
+      return Z_STREAM_END;
+    case IM_BAD:
+      return Z_DATA_ERROR;
+    default:
+      return Z_STREAM_ERROR;
+  }
+}
+
+
+
+
+
+// unzip.c -- IO on .zip files using zlib
+// Version 0.15 beta, Mar 19th, 1998,
+// Read unzip.h for more info
+
+
+
+
+#define UNZ_BUFSIZE (16384)
+#define UNZ_MAXFILENAMEINZIP (256)
+#define SIZECENTRALDIRITEM (0x2e)
+#define SIZEZIPLOCALHEADER (0x1e)
+
+
+
+
+const char unz_copyright[] = " unzip 0.15 Copyright 1998 Gilles Vollant ";
+
+// unz_file_info_interntal contain internal info about a file in zipfile
+typedef struct unz_file_info_internal_s
+{
+    uLong offset_curfile;// relative offset of local header 4 bytes
+} unz_file_info_internal;
+
+
+typedef struct
+{ bool is_handle; // either a handle or memory
+  bool canseek;
+  // for handles:
+  HANDLE h; bool herr; unsigned long initial_offset; bool mustclosehandle;
+  // for memory:
+  void *buf; unsigned int len,pos; // if it's a memory block
+} LUFILE;
+
+
+LUFILE *lufopen(void *z,unsigned int len,DWORD flags,ZRESULT *err)
+{ if (flags!=ZIP_HANDLE && flags!=ZIP_FILENAME && flags!=ZIP_MEMORY) {*err=ZR_ARGS; return NULL;}
+  //
+  HANDLE h=0; bool canseek=false; *err=ZR_OK;
+  bool mustclosehandle=false;
+  if (flags==ZIP_HANDLE||flags==ZIP_FILENAME)
+  { if (flags==ZIP_HANDLE)
+    { HANDLE hf = z;
+      h=hf; mustclosehandle=false;
+#ifdef DuplicateHandle
+      BOOL res = DuplicateHandle(GetCurrentProcess(),hf,GetCurrentProcess(),&h,0,FALSE,DUPLICATE_SAME_ACCESS);
+      if (!res) mustclosehandle=true;
+#endif
+    }
+    else
+    { h=CreateFile((const TCHAR*)z,GENERIC_READ,FILE_SHARE_READ,NULL,OPEN_EXISTING,FILE_ATTRIBUTE_NORMAL,NULL);
+      if (h==INVALID_HANDLE_VALUE) {*err=ZR_NOFILE; return NULL;}
+      mustclosehandle=true;
+    }
+    // test if we can seek on it. We can't use GetFileType(h)==FILE_TYPE_DISK since it's not on CE.
+    DWORD res = SetFilePointer(h,0,0,FILE_CURRENT);
+    canseek = (res!=0xFFFFFFFF);
+  }
+  LUFILE *lf = new LUFILE;
+  if (flags==ZIP_HANDLE||flags==ZIP_FILENAME)
+  { lf->is_handle=true; lf->mustclosehandle=mustclosehandle;
+    lf->canseek=canseek;
+    lf->h=h; lf->herr=false;
+    lf->initial_offset=0;
+    if (canseek) lf->initial_offset = SetFilePointer(h,0,NULL,FILE_CURRENT);
+  }
+  else
+  { lf->is_handle=false;
+    lf->canseek=true;
+    lf->mustclosehandle=false;
+    lf->buf=z; lf->len=len; lf->pos=0; lf->initial_offset=0;
+  }
+  *err=ZR_OK;
+  return lf;
+}
+
+
+int lufclose(LUFILE *stream)
+{ if (stream==NULL) return EOF;
+  if (stream->mustclosehandle) CloseHandle(stream->h);
+  delete stream;
+  return 0;
+}
+
+int luferror(LUFILE *stream)
+{ if (stream->is_handle && stream->herr) return 1;
+  else return 0;
+}
+
+long int luftell(LUFILE *stream)
+{ if (stream->is_handle && stream->canseek) return SetFilePointer(stream->h,0,NULL,FILE_CURRENT)-stream->initial_offset;
+  else if (stream->is_handle) return 0;
+  else return stream->pos;
+}
+
+int lufseek(LUFILE *stream, long offset, int whence)
+{ if (stream->is_handle && stream->canseek)
+  { if (whence==SEEK_SET) SetFilePointer(stream->h,stream->initial_offset+offset,0,FILE_BEGIN);
+    else if (whence==SEEK_CUR) SetFilePointer(stream->h,offset,NULL,FILE_CURRENT);
+    else if (whence==SEEK_END) SetFilePointer(stream->h,offset,NULL,FILE_END);
+    else return 19; // EINVAL
+    return 0;
+  }
+  else if (stream->is_handle) return 29; // ESPIPE
+  else
+  { if (whence==SEEK_SET) stream->pos=offset;
+    else if (whence==SEEK_CUR) stream->pos+=offset;
+    else if (whence==SEEK_END) stream->pos=stream->len+offset;
+    return 0;
+  }
+}
+
+
+size_t lufread(void *ptr,size_t size,size_t n,LUFILE *stream)
+{ unsigned int toread = (unsigned int)(size*n);
+  if (stream->is_handle)
+  { DWORD red; BOOL res = ReadFile(stream->h,ptr,toread,&red,NULL);
+    if (!res) stream->herr=true;
+    return red/size;
+  }
+  if (stream->pos+toread > stream->len) toread = stream->len-stream->pos;
+  memcpy(ptr, (char*)stream->buf + stream->pos, toread); DWORD red = toread;
+  stream->pos += red;
+  return red/size;
+}
+
+
+
+
+// file_in_zip_read_info_s contain internal information about a file in zipfile,
+//  when reading and decompress it
+typedef struct
+{
+	char  *read_buffer;         // internal buffer for compressed data
+	z_stream stream;            // zLib stream structure for inflate
+
+	uLong pos_in_zipfile;       // position in byte on the zipfile, for fseek
+	uLong stream_initialised;   // flag set if stream structure is initialised
+
+	uLong offset_local_extrafield;// offset of the local extra field
+	uInt  size_local_extrafield;// size of the local extra field
+	uLong pos_local_extrafield;   // position in the local extra field in read
+
+	uLong crc32;                // crc32 of all data uncompressed
+	uLong crc32_wait;           // crc32 we must obtain after decompress all
+	uLong rest_read_compressed; // number of byte to be decompressed
+	uLong rest_read_uncompressed;//number of byte to be obtained after decomp
+	LUFILE* file;                 // io structore of the zipfile
+	uLong compression_method;   // compression method (0==store)
+	uLong byte_before_the_zipfile;// byte before the zipfile, (>0 for sfx)
+  bool encrypted;               // is it encrypted?
+  unsigned long keys[3];        // decryption keys, initialized by unzOpenCurrentFile
+  int encheadleft;              // the first call(s) to unzReadCurrentFile will read this many encryption-header bytes first
+  char crcenctest;              // if encrypted, we'll check the encryption buffer against this
+} file_in_zip_read_info_s;
+
+
+// unz_s contain internal information about the zipfile
+typedef struct
+{
+	LUFILE* file;               // io structore of the zipfile
+	unz_global_info gi;         // public global information
+	uLong byte_before_the_zipfile;// byte before the zipfile, (>0 for sfx)
+	uLong num_file;             // number of the current file in the zipfile
+	uLong pos_in_central_dir;   // pos of the current file in the central dir
+	uLong current_file_ok;      // flag about the usability of the current file
+	uLong central_pos;          // position of the beginning of the central dir
+
+	uLong size_central_dir;     // size of the central directory
+	uLong offset_central_dir;   // offset of start of central directory with respect to the starting disk number
+
+	unz_file_info cur_file_info; // public info about the current file in zip
+	unz_file_info_internal cur_file_info_internal; // private info about it
+    file_in_zip_read_info_s* pfile_in_zip_read; // structure about the current file if we are decompressing it
+} unz_s, *unzFile;
+
+
+int unzStringFileNameCompare (const char* fileName1,const char* fileName2,int iCaseSensitivity);
+//   Compare two filename (fileName1,fileName2).
+
+z_off_t unztell (unzFile file);
+//  Give the current position in uncompressed data
+
+int unzeof (unzFile file);
+//  return 1 if the end of file was reached, 0 elsewhere
+
+int unzGetLocalExtrafield (unzFile file, voidp buf, unsigned len);
+//  Read extra field from the current file (opened by unzOpenCurrentFile)
+//  This is the local-header version of the extra field (sometimes, there is
+//    more info in the local-header version than in the central-header)
+//
+//  if buf==NULL, it return the size of the local extra field
+//
+//  if buf!=NULL, len is the size of the buffer, the extra header is copied in
+//	buf.
+//  the return value is the number of bytes copied in buf, or (if <0)
+//	the error code
+
+
+
+// ===========================================================================
+//   Read a byte from a gz_stream; update next_in and avail_in. Return EOF
+// for end of file.
+// IN assertion: the stream s has been sucessfully opened for reading.
+
+int unzlocal_getByte(LUFILE *fin,int *pi)
+{ unsigned char c;
+  int err = (int)lufread(&c, 1, 1, fin);
+  if (err==1)
+  { *pi = (int)c;
+    return UNZ_OK;
+  }
+  else
+  { if (luferror(fin)) return UNZ_ERRNO;
+    else return UNZ_EOF;
+  }
+}
+
+
+// ===========================================================================
+// Reads a long in LSB order from the given gz_stream. Sets
+int unzlocal_getShort (LUFILE *fin,uLong *pX)
+{
+    uLong x ;
+    int i;
+    int err;
+
+    err = unzlocal_getByte(fin,&i);
+    x = (uLong)i;
+
+    if (err==UNZ_OK)
+        err = unzlocal_getByte(fin,&i);
+    x += ((uLong)i)<<8;
+
+    if (err==UNZ_OK)
+        *pX = x;
+    else
+        *pX = 0;
+    return err;
+}
+
+int unzlocal_getLong (LUFILE *fin,uLong *pX)
+{
+    uLong x ;
+    int i;
+    int err;
+
+    err = unzlocal_getByte(fin,&i);
+    x = (uLong)i;
+    
+    if (err==UNZ_OK)
+        err = unzlocal_getByte(fin,&i);
+    x += ((uLong)i)<<8;
+
+    if (err==UNZ_OK)
+        err = unzlocal_getByte(fin,&i);
+    x += ((uLong)i)<<16;
+
+    if (err==UNZ_OK)
+        err = unzlocal_getByte(fin,&i);
+    x += ((uLong)i)<<24;
+   
+    if (err==UNZ_OK)
+        *pX = x;
+    else
+        *pX = 0;
+    return err;
+}
+
+
+// My own strcmpi / strcasecmp 
+int strcmpcasenosensitive_internal (const char* fileName1,const char *fileName2)
+{
+	for (;;)
+	{
+		char c1=*(fileName1++);
+		char c2=*(fileName2++);
+		if ((c1>='a') && (c1<='z'))
+			c1 -= (char)0x20;
+		if ((c2>='a') && (c2<='z'))
+			c2 -= (char)0x20;
+		if (c1=='\0')
+			return ((c2=='\0') ? 0 : -1);
+		if (c2=='\0')
+			return 1;
+		if (c1<c2)
+			return -1;
+		if (c1>c2)
+			return 1;
+	}
+}
+
+
+
+
+//
+// Compare two filename (fileName1,fileName2).
+// If iCaseSenisivity = 1, comparision is case sensitivity (like strcmp)
+// If iCaseSenisivity = 2, comparision is not case sensitivity (like strcmpi or strcasecmp)
+//
+int unzStringFileNameCompare (const char*fileName1,const char*fileName2,int iCaseSensitivity)
+{ if (iCaseSensitivity==1) return strcmp(fileName1,fileName2);
+  else return strcmpcasenosensitive_internal(fileName1,fileName2);
+} 
+
+#define BUFREADCOMMENT (0x400)
+
+
+//  Locate the Central directory of a zipfile (at the end, just before
+// the global comment). Lu bugfix 2005.07.26 - returns 0xFFFFFFFF if not found,
+// rather than 0, since 0 is a valid central-dir-location for an empty zipfile.
+uLong unzlocal_SearchCentralDir(LUFILE *fin)
+{ if (lufseek(fin,0,SEEK_END) != 0) return 0xFFFFFFFF;
+  uLong uSizeFile = luftell(fin);
+
+  uLong uMaxBack=0xffff; // maximum size of global comment
+  if (uMaxBack>uSizeFile) uMaxBack = uSizeFile;
+
+  unsigned char *buf = (unsigned char*)zmalloc(BUFREADCOMMENT+4);
+  if (buf==NULL) return 0xFFFFFFFF;
+  uLong uPosFound=0xFFFFFFFF;
+
+  uLong uBackRead = 4;
+  while (uBackRead<uMaxBack)
+  { uLong uReadSize,uReadPos ;
+    int i;
+    if (uBackRead+BUFREADCOMMENT>uMaxBack) uBackRead = uMaxBack;
+    else uBackRead+=BUFREADCOMMENT;
+    uReadPos = uSizeFile-uBackRead ;
+    uReadSize = ((BUFREADCOMMENT+4) < (uSizeFile-uReadPos)) ? (BUFREADCOMMENT+4) : (uSizeFile-uReadPos);
+    if (lufseek(fin,uReadPos,SEEK_SET)!=0) break;
+    if (lufread(buf,(uInt)uReadSize,1,fin)!=1) break;
+    for (i=(int)uReadSize-3; (i--)>=0;)
+    { if (((*(buf+i))==0x50) && ((*(buf+i+1))==0x4b) &&	((*(buf+i+2))==0x05) && ((*(buf+i+3))==0x06))
+      { uPosFound = uReadPos+i;	break;
+      }
+    }
+    if (uPosFound!=0) break;
+  }
+  if (buf) zfree(buf);
+  return uPosFound;
+}
+
+
+int unzGoToFirstFile (unzFile file);
+int unzCloseCurrentFile (unzFile file);
+
+// Open a Zip file.
+// If the zipfile cannot be opened (file don't exist or in not valid), return NULL.
+// Otherwise, the return value is a unzFile Handle, usable with other unzip functions
+unzFile unzOpenInternal(LUFILE *fin)
+{ if (fin==NULL) return NULL;
+  if (unz_copyright[0]!=' ') {lufclose(fin); return NULL;}
+
+  int err=UNZ_OK;
+  unz_s us;
+  uLong central_pos,uL;
+  central_pos = unzlocal_SearchCentralDir(fin);
+  if (central_pos==0xFFFFFFFF) err=UNZ_ERRNO;
+  if (lufseek(fin,central_pos,SEEK_SET)!=0) err=UNZ_ERRNO;
+  // the signature, already checked
+  if (unzlocal_getLong(fin,&uL)!=UNZ_OK) err=UNZ_ERRNO;
+  // number of this disk
+  uLong number_disk;          // number of the current dist, used for spanning ZIP, unsupported, always 0
+  if (unzlocal_getShort(fin,&number_disk)!=UNZ_OK) err=UNZ_ERRNO;
+  // number of the disk with the start of the central directory
+  uLong number_disk_with_CD;  // number the the disk with central dir, used for spaning ZIP, unsupported, always 0
+  if (unzlocal_getShort(fin,&number_disk_with_CD)!=UNZ_OK) err=UNZ_ERRNO;
+  // total number of entries in the central dir on this disk
+  if (unzlocal_getShort(fin,&us.gi.number_entry)!=UNZ_OK) err=UNZ_ERRNO;
+  // total number of entries in the central dir
+  uLong number_entry_CD;      // total number of entries in the central dir (same than number_entry on nospan)
+  if (unzlocal_getShort(fin,&number_entry_CD)!=UNZ_OK) err=UNZ_ERRNO;
+  if ((number_entry_CD!=us.gi.number_entry) || (number_disk_with_CD!=0) || (number_disk!=0)) err=UNZ_BADZIPFILE;
+  // size of the central directory
+  if (unzlocal_getLong(fin,&us.size_central_dir)!=UNZ_OK) err=UNZ_ERRNO;
+  // offset of start of central directory with respect to the starting disk number
+  if (unzlocal_getLong(fin,&us.offset_central_dir)!=UNZ_OK) err=UNZ_ERRNO;
+  // zipfile comment length
+  if (unzlocal_getShort(fin,&us.gi.size_comment)!=UNZ_OK) err=UNZ_ERRNO;
+  if ((central_pos+fin->initial_offset<us.offset_central_dir+us.size_central_dir) && (err==UNZ_OK)) err=UNZ_BADZIPFILE;
+  if (err!=UNZ_OK) {lufclose(fin);return NULL;}
+
+  us.file=fin;
+  us.byte_before_the_zipfile = central_pos+fin->initial_offset - (us.offset_central_dir+us.size_central_dir);
+  us.central_pos = central_pos;
+  us.pfile_in_zip_read = NULL;
+  fin->initial_offset = 0; // since the zipfile itself is expected to handle this
+
+  unz_s *s = (unz_s*)zmalloc(sizeof(unz_s));
+  *s=us;
+  unzGoToFirstFile((unzFile)s);
+  return (unzFile)s;
+}
+
+
+
+//  Close a ZipFile opened with unzipOpen.
+//  If there is files inside the .Zip opened with unzipOpenCurrentFile (see later),
+//    these files MUST be closed with unzipCloseCurrentFile before call unzipClose.
+//  return UNZ_OK if there is no problem.
+int unzClose (unzFile file)
+{
+	unz_s* s;
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+
+    if (s->pfile_in_zip_read!=NULL)
+        unzCloseCurrentFile(file);
+
+	lufclose(s->file);
+	if (s) zfree(s); // unused s=0;
+	return UNZ_OK;
+}
+
+
+//  Write info about the ZipFile in the *pglobal_info structure.
+//  No preparation of the structure is needed
+//  return UNZ_OK if there is no problem. 
+int unzGetGlobalInfo (unzFile file,unz_global_info *pglobal_info)
+{
+	unz_s* s;
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+	*pglobal_info=s->gi;
+	return UNZ_OK;
+}
+
+
+//   Translate date/time from Dos format to tm_unz (readable more easilty)
+void unzlocal_DosDateToTmuDate (uLong ulDosDate, tm_unz* ptm)
+{
+    uLong uDate;
+    uDate = (uLong)(ulDosDate>>16);
+    ptm->tm_mday = (uInt)(uDate&0x1f) ;
+    ptm->tm_mon =  (uInt)((((uDate)&0x1E0)/0x20)-1) ;
+    ptm->tm_year = (uInt)(((uDate&0x0FE00)/0x0200)+1980) ;
+
+    ptm->tm_hour = (uInt) ((ulDosDate &0xF800)/0x800);
+    ptm->tm_min =  (uInt) ((ulDosDate&0x7E0)/0x20) ;
+    ptm->tm_sec =  (uInt) (2*(ulDosDate&0x1f)) ;
+}
+
+//  Get Info about the current file in the zipfile, with internal only info
+int unzlocal_GetCurrentFileInfoInternal (unzFile file,
+                                                  unz_file_info *pfile_info,
+                                                  unz_file_info_internal
+                                                  *pfile_info_internal,
+                                                  char *szFileName,
+												  uLong fileNameBufferSize,
+                                                  void *extraField,
+												  uLong extraFieldBufferSize,
+                                                  char *szComment,
+												  uLong commentBufferSize);
+
+int unzlocal_GetCurrentFileInfoInternal (unzFile file, unz_file_info *pfile_info,
+   unz_file_info_internal *pfile_info_internal, char *szFileName,
+   uLong fileNameBufferSize, void *extraField, uLong extraFieldBufferSize,
+   char *szComment, uLong commentBufferSize)
+{
+	unz_s* s;
+	unz_file_info file_info;
+	unz_file_info_internal file_info_internal;
+	int err=UNZ_OK;
+	uLong uMagic;
+	long lSeek=0;
+
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+	if (lufseek(s->file,s->pos_in_central_dir+s->byte_before_the_zipfile,SEEK_SET)!=0)
+		err=UNZ_ERRNO;
+
+
+	// we check the magic
+	if (err==UNZ_OK)
+		if (unzlocal_getLong(s->file,&uMagic) != UNZ_OK)
+			err=UNZ_ERRNO;
+		else if (uMagic!=0x02014b50)
+			err=UNZ_BADZIPFILE;
+
+	if (unzlocal_getShort(s->file,&file_info.version) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getShort(s->file,&file_info.version_needed) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getShort(s->file,&file_info.flag) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getShort(s->file,&file_info.compression_method) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getLong(s->file,&file_info.dosDate) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+    unzlocal_DosDateToTmuDate(file_info.dosDate,&file_info.tmu_date);
+
+	if (unzlocal_getLong(s->file,&file_info.crc) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getLong(s->file,&file_info.compressed_size) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getLong(s->file,&file_info.uncompressed_size) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getShort(s->file,&file_info.size_filename) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getShort(s->file,&file_info.size_file_extra) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getShort(s->file,&file_info.size_file_comment) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getShort(s->file,&file_info.disk_num_start) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getShort(s->file,&file_info.internal_fa) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getLong(s->file,&file_info.external_fa) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getLong(s->file,&file_info_internal.offset_curfile) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	lSeek+=file_info.size_filename;
+	if ((err==UNZ_OK) && (szFileName!=NULL))
+	{
+		uLong uSizeRead ;
+		if (file_info.size_filename<fileNameBufferSize)
+		{
+			*(szFileName+file_info.size_filename)='\0';
+			uSizeRead = file_info.size_filename;
+		}
+		else
+			uSizeRead = fileNameBufferSize;
+
+		if ((file_info.size_filename>0) && (fileNameBufferSize>0))
+			if (lufread(szFileName,(uInt)uSizeRead,1,s->file)!=1)
+				err=UNZ_ERRNO;
+		lSeek -= uSizeRead;
+	}
+
+
+	if ((err==UNZ_OK) && (extraField!=NULL))
+	{
+		uLong uSizeRead ;
+		if (file_info.size_file_extra<extraFieldBufferSize)
+			uSizeRead = file_info.size_file_extra;
+		else
+			uSizeRead = extraFieldBufferSize;
+
+		if (lSeek!=0)
+			if (lufseek(s->file,lSeek,SEEK_CUR)==0)
+				lSeek=0;
+			else
+				err=UNZ_ERRNO;
+		if ((file_info.size_file_extra>0) && (extraFieldBufferSize>0))
+			if (lufread(extraField,(uInt)uSizeRead,1,s->file)!=1)
+				err=UNZ_ERRNO;
+		lSeek += file_info.size_file_extra - uSizeRead;
+	}
+	else
+		lSeek+=file_info.size_file_extra;
+
+
+	if ((err==UNZ_OK) && (szComment!=NULL))
+	{
+		uLong uSizeRead ;
+		if (file_info.size_file_comment<commentBufferSize)
+		{
+			*(szComment+file_info.size_file_comment)='\0';
+			uSizeRead = file_info.size_file_comment;
+		}
+		else
+			uSizeRead = commentBufferSize;
+
+		if (lSeek!=0)
+			if (lufseek(s->file,lSeek,SEEK_CUR)==0)
+				{} // unused lSeek=0;
+			else
+				err=UNZ_ERRNO;
+		if ((file_info.size_file_comment>0) && (commentBufferSize>0))
+			if (lufread(szComment,(uInt)uSizeRead,1,s->file)!=1)
+				err=UNZ_ERRNO;
+		//unused lSeek+=file_info.size_file_comment - uSizeRead;
+	}
+	else {} //unused lSeek+=file_info.size_file_comment;
+
+	if ((err==UNZ_OK) && (pfile_info!=NULL))
+		*pfile_info=file_info;
+
+	if ((err==UNZ_OK) && (pfile_info_internal!=NULL))
+		*pfile_info_internal=file_info_internal;
+
+	return err;
+}
+
+
+
+//  Write info about the ZipFile in the *pglobal_info structure.
+//  No preparation of the structure is needed
+//  return UNZ_OK if there is no problem.
+int unzGetCurrentFileInfo (unzFile file, unz_file_info *pfile_info,
+  char *szFileName, uLong fileNameBufferSize, void *extraField, uLong extraFieldBufferSize,
+  char *szComment, uLong commentBufferSize)
+{ return unzlocal_GetCurrentFileInfoInternal(file,pfile_info,NULL,szFileName,fileNameBufferSize,
+      extraField,extraFieldBufferSize, szComment,commentBufferSize);
+}
+
+
+//  Set the current file of the zipfile to the first file.
+//  return UNZ_OK if there is no problem
+int unzGoToFirstFile (unzFile file)
+{
+	int err;
+	unz_s* s;
+	if (file==NULL) return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+	s->pos_in_central_dir=s->offset_central_dir;
+	s->num_file=0;
+	err=unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info,
+											 &s->cur_file_info_internal,
+											 NULL,0,NULL,0,NULL,0);
+	s->current_file_ok = (err == UNZ_OK);
+	return err;
+}
+
+
+//  Set the current file of the zipfile to the next file.
+//  return UNZ_OK if there is no problem
+//  return UNZ_END_OF_LIST_OF_FILE if the actual file was the latest.
+int unzGoToNextFile (unzFile file)
+{
+	unz_s* s;
+	int err;
+
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+	if (!s->current_file_ok)
+		return UNZ_END_OF_LIST_OF_FILE;
+	if (s->num_file+1==s->gi.number_entry)
+		return UNZ_END_OF_LIST_OF_FILE;
+
+	s->pos_in_central_dir += SIZECENTRALDIRITEM + s->cur_file_info.size_filename +
+			s->cur_file_info.size_file_extra + s->cur_file_info.size_file_comment ;
+	s->num_file++;
+	err = unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info,
+											   &s->cur_file_info_internal,
+											   NULL,0,NULL,0,NULL,0);
+	s->current_file_ok = (err == UNZ_OK);
+	return err;
+}
+
+
+//  Try locate the file szFileName in the zipfile.
+//  For the iCaseSensitivity signification, see unzStringFileNameCompare
+//  return value :
+//  UNZ_OK if the file is found. It becomes the current file.
+//  UNZ_END_OF_LIST_OF_FILE if the file is not found
+int unzLocateFile (unzFile file, const char *szFileName, int iCaseSensitivity)
+{
+	unz_s* s;
+	int err;
+
+
+	uLong num_fileSaved;
+	uLong pos_in_central_dirSaved;
+
+
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+
+    if (strlen(szFileName)>=UNZ_MAXFILENAMEINZIP)
+        return UNZ_PARAMERROR;
+
+	s=(unz_s*)file;
+	if (!s->current_file_ok)
+		return UNZ_END_OF_LIST_OF_FILE;
+
+	num_fileSaved = s->num_file;
+	pos_in_central_dirSaved = s->pos_in_central_dir;
+
+	err = unzGoToFirstFile(file);
+
+	while (err == UNZ_OK)
+	{
+		char szCurrentFileName[UNZ_MAXFILENAMEINZIP+1];
+		unzGetCurrentFileInfo(file,NULL,
+								szCurrentFileName,sizeof(szCurrentFileName)-1,
+								NULL,0,NULL,0);
+		if (unzStringFileNameCompare(szCurrentFileName,szFileName,iCaseSensitivity)==0)
+			return UNZ_OK;
+		err = unzGoToNextFile(file);
+	}
+
+	s->num_file = num_fileSaved ;
+	s->pos_in_central_dir = pos_in_central_dirSaved ;
+	return err;
+}
+
+
+//  Read the local header of the current zipfile
+//  Check the coherency of the local header and info in the end of central
+//        directory about this file
+//  store in *piSizeVar the size of extra info in local header
+//        (filename and size of extra field data)
+int unzlocal_CheckCurrentFileCoherencyHeader (unz_s *s,uInt *piSizeVar,
+  uLong *poffset_local_extrafield, uInt  *psize_local_extrafield)
+{
+	uLong uMagic,uData,uFlags;
+	uLong size_filename;
+	uLong size_extra_field;
+	int err=UNZ_OK;
+
+	*piSizeVar = 0;
+	*poffset_local_extrafield = 0;
+	*psize_local_extrafield = 0;
+
+	if (lufseek(s->file,s->cur_file_info_internal.offset_curfile + s->byte_before_the_zipfile,SEEK_SET)!=0)
+		return UNZ_ERRNO;
+
+
+	if (err==UNZ_OK)
+		if (unzlocal_getLong(s->file,&uMagic) != UNZ_OK)
+			err=UNZ_ERRNO;
+		else if (uMagic!=0x04034b50)
+			err=UNZ_BADZIPFILE;
+
+	if (unzlocal_getShort(s->file,&uData) != UNZ_OK)
+		err=UNZ_ERRNO;
+//	else if ((err==UNZ_OK) && (uData!=s->cur_file_info.wVersion))
+//		err=UNZ_BADZIPFILE;
+	if (unzlocal_getShort(s->file,&uFlags) != UNZ_OK)
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getShort(s->file,&uData) != UNZ_OK)
+		err=UNZ_ERRNO;
+	else if ((err==UNZ_OK) && (uData!=s->cur_file_info.compression_method))
+		err=UNZ_BADZIPFILE;
+
+    if ((err==UNZ_OK) && (s->cur_file_info.compression_method!=0) &&
+                         (s->cur_file_info.compression_method!=Z_DEFLATED))
+        err=UNZ_BADZIPFILE;
+
+	if (unzlocal_getLong(s->file,&uData) != UNZ_OK) // date/time
+		err=UNZ_ERRNO;
+
+	if (unzlocal_getLong(s->file,&uData) != UNZ_OK) // crc
+		err=UNZ_ERRNO;
+	else if ((err==UNZ_OK) && (uData!=s->cur_file_info.crc) &&
+		                      ((uFlags & 8)==0))
+		err=UNZ_BADZIPFILE;
+
+	if (unzlocal_getLong(s->file,&uData) != UNZ_OK) // size compr
+		err=UNZ_ERRNO;
+	else if ((err==UNZ_OK) && (uData!=s->cur_file_info.compressed_size) &&
+							  ((uFlags & 8)==0))
+		err=UNZ_BADZIPFILE;
+
+	if (unzlocal_getLong(s->file,&uData) != UNZ_OK) // size uncompr
+		err=UNZ_ERRNO;
+	else if ((err==UNZ_OK) && (uData!=s->cur_file_info.uncompressed_size) &&
+							  ((uFlags & 8)==0))
+		err=UNZ_BADZIPFILE;
+
+
+	if (unzlocal_getShort(s->file,&size_filename) != UNZ_OK)
+		err=UNZ_ERRNO;
+	else if ((err==UNZ_OK) && (size_filename!=s->cur_file_info.size_filename))
+		err=UNZ_BADZIPFILE;
+
+	*piSizeVar += (uInt)size_filename;
+
+	if (unzlocal_getShort(s->file,&size_extra_field) != UNZ_OK)
+		err=UNZ_ERRNO;
+	*poffset_local_extrafield= s->cur_file_info_internal.offset_curfile +
+									SIZEZIPLOCALHEADER + size_filename;
+	*psize_local_extrafield = (uInt)size_extra_field;
+
+	*piSizeVar += (uInt)size_extra_field;
+
+	return err;
+}
+
+
+
+
+
+//  Open for reading data the current file in the zipfile.
+//  If there is no error and the file is opened, the return value is UNZ_OK.
+int unzOpenCurrentFile (unzFile file, const char *password)
+{
+	int err;
+	int Store;
+	uInt iSizeVar;
+	unz_s* s;
+	file_in_zip_read_info_s* pfile_in_zip_read_info;
+	uLong offset_local_extrafield;  // offset of the local extra field
+	uInt  size_local_extrafield;    // size of the local extra field
+
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+	if (!s->current_file_ok)
+		return UNZ_PARAMERROR;
+
+    if (s->pfile_in_zip_read != NULL)
+        unzCloseCurrentFile(file);
+
+	if (unzlocal_CheckCurrentFileCoherencyHeader(s,&iSizeVar,
+				&offset_local_extrafield,&size_local_extrafield)!=UNZ_OK)
+		return UNZ_BADZIPFILE;
+
+	pfile_in_zip_read_info = (file_in_zip_read_info_s*)zmalloc(sizeof(file_in_zip_read_info_s));
+	if (pfile_in_zip_read_info==NULL)
+		return UNZ_INTERNALERROR;
+
+	pfile_in_zip_read_info->read_buffer=(char*)zmalloc(UNZ_BUFSIZE);
+	pfile_in_zip_read_info->offset_local_extrafield = offset_local_extrafield;
+	pfile_in_zip_read_info->size_local_extrafield = size_local_extrafield;
+	pfile_in_zip_read_info->pos_local_extrafield=0;
+
+	if (pfile_in_zip_read_info->read_buffer==NULL)
+	{
+		if (pfile_in_zip_read_info!=0) zfree(pfile_in_zip_read_info); //unused pfile_in_zip_read_info=0;
+		return UNZ_INTERNALERROR;
+	}
+
+	pfile_in_zip_read_info->stream_initialised=0;
+
+	if ((s->cur_file_info.compression_method!=0) && (s->cur_file_info.compression_method!=Z_DEFLATED))
+        { // unused err=UNZ_BADZIPFILE;
+        }
+	Store = s->cur_file_info.compression_method==0;
+
+	pfile_in_zip_read_info->crc32_wait=s->cur_file_info.crc;
+	pfile_in_zip_read_info->crc32=0;
+	pfile_in_zip_read_info->compression_method = s->cur_file_info.compression_method;
+	pfile_in_zip_read_info->file=s->file;
+	pfile_in_zip_read_info->byte_before_the_zipfile=s->byte_before_the_zipfile;
+
+    pfile_in_zip_read_info->stream.total_out = 0;
+
+	if (!Store)
+	{
+	  pfile_in_zip_read_info->stream.zalloc = (alloc_func)0;
+	  pfile_in_zip_read_info->stream.zfree = (free_func)0;
+	  pfile_in_zip_read_info->stream.opaque = (voidpf)0;
+
+          err=inflateInit2(&pfile_in_zip_read_info->stream);
+	  if (err == Z_OK)
+	    pfile_in_zip_read_info->stream_initialised=1;
+        // windowBits is passed < 0 to tell that there is no zlib header.
+        // Note that in this case inflate *requires* an extra "dummy" byte
+        // after the compressed stream in order to complete decompression and
+        // return Z_STREAM_END.
+        // In unzip, i don't wait absolutely Z_STREAM_END because I known the
+        // size of both compressed and uncompressed data
+	}
+	pfile_in_zip_read_info->rest_read_compressed = s->cur_file_info.compressed_size ;
+	pfile_in_zip_read_info->rest_read_uncompressed = s->cur_file_info.uncompressed_size ;
+  pfile_in_zip_read_info->encrypted = (s->cur_file_info.flag&1)!=0;
+  bool extlochead = (s->cur_file_info.flag&8)!=0;
+  if (extlochead) pfile_in_zip_read_info->crcenctest = (char)((s->cur_file_info.dosDate>>8)&0xff);
+  else pfile_in_zip_read_info->crcenctest = (char)(s->cur_file_info.crc >> 24);
+  pfile_in_zip_read_info->encheadleft = (pfile_in_zip_read_info->encrypted?12:0);
+  pfile_in_zip_read_info->keys[0] = 305419896L;
+  pfile_in_zip_read_info->keys[1] = 591751049L;
+  pfile_in_zip_read_info->keys[2] = 878082192L;
+  for (const char *cp=password; cp!=0 && *cp!=0; cp++) Uupdate_keys(pfile_in_zip_read_info->keys,*cp);
+
+	pfile_in_zip_read_info->pos_in_zipfile =
+            s->cur_file_info_internal.offset_curfile + SIZEZIPLOCALHEADER +
+			  iSizeVar;
+
+	pfile_in_zip_read_info->stream.avail_in = (uInt)0;
+
+	s->pfile_in_zip_read = pfile_in_zip_read_info;
+
+  return UNZ_OK;
+}
+
+
+//  Read bytes from the current file.
+//  buf contain buffer where data must be copied
+//  len the size of buf.
+//  return the number of byte copied if somes bytes are copied (and also sets *reached_eof)
+//  return 0 if the end of file was reached. (and also sets *reached_eof).
+//  return <0 with error code if there is an error. (in which case *reached_eof is meaningless)
+//    (UNZ_ERRNO for IO error, or zLib error for uncompress error)
+int unzReadCurrentFile  (unzFile file, voidp buf, unsigned len, bool *reached_eof)
+{ int err=UNZ_OK;
+  uInt iRead = 0;
+  if (reached_eof!=0) *reached_eof=false;
+
+  unz_s *s = (unz_s*)file;
+  if (s==NULL) return UNZ_PARAMERROR;
+
+  file_in_zip_read_info_s* pfile_in_zip_read_info = s->pfile_in_zip_read;
+  if (pfile_in_zip_read_info==NULL) return UNZ_PARAMERROR;
+  if ((pfile_in_zip_read_info->read_buffer == NULL)) return UNZ_END_OF_LIST_OF_FILE;
+  if (len==0) return 0;
+
+  pfile_in_zip_read_info->stream.next_out = (Byte*)buf;
+  pfile_in_zip_read_info->stream.avail_out = (uInt)len;
+
+  if (len>pfile_in_zip_read_info->rest_read_uncompressed)
+  { pfile_in_zip_read_info->stream.avail_out = (uInt)pfile_in_zip_read_info->rest_read_uncompressed;
+  }
+
+  while (pfile_in_zip_read_info->stream.avail_out>0)
+  { if ((pfile_in_zip_read_info->stream.avail_in==0) && (pfile_in_zip_read_info->rest_read_compressed>0))
+    { uInt uReadThis = UNZ_BUFSIZE;
+      if (pfile_in_zip_read_info->rest_read_compressed<uReadThis) uReadThis = (uInt)pfile_in_zip_read_info->rest_read_compressed;
+      if (uReadThis == 0) {if (reached_eof!=0) *reached_eof=true; return UNZ_EOF;}
+      if (lufseek(pfile_in_zip_read_info->file, pfile_in_zip_read_info->pos_in_zipfile + pfile_in_zip_read_info->byte_before_the_zipfile,SEEK_SET)!=0) return UNZ_ERRNO;
+      if (lufread(pfile_in_zip_read_info->read_buffer,uReadThis,1,pfile_in_zip_read_info->file)!=1) return UNZ_ERRNO;
+      pfile_in_zip_read_info->pos_in_zipfile += uReadThis;
+      pfile_in_zip_read_info->rest_read_compressed-=uReadThis;
+      pfile_in_zip_read_info->stream.next_in = (Byte*)pfile_in_zip_read_info->read_buffer;
+      pfile_in_zip_read_info->stream.avail_in = (uInt)uReadThis;
+      //
+      if (pfile_in_zip_read_info->encrypted)
+      { char *buf = (char*)pfile_in_zip_read_info->stream.next_in;
+        for (unsigned int i=0; i<uReadThis; i++) buf[i]=zdecode(pfile_in_zip_read_info->keys,buf[i]);
+      }
+    }
+
+    unsigned int uDoEncHead = pfile_in_zip_read_info->encheadleft;
+    if (uDoEncHead>pfile_in_zip_read_info->stream.avail_in) uDoEncHead=pfile_in_zip_read_info->stream.avail_in;
+    if (uDoEncHead>0)
+    { char bufcrc=pfile_in_zip_read_info->stream.next_in[uDoEncHead-1];
+      pfile_in_zip_read_info->rest_read_uncompressed-=uDoEncHead;
+      pfile_in_zip_read_info->stream.avail_in -= uDoEncHead;
+      pfile_in_zip_read_info->stream.next_in += uDoEncHead;
+      pfile_in_zip_read_info->encheadleft -= uDoEncHead;
+      if (pfile_in_zip_read_info->encheadleft==0)
+      { if (bufcrc!=pfile_in_zip_read_info->crcenctest) return UNZ_PASSWORD;
+      }
+    }
+
+    if (pfile_in_zip_read_info->compression_method==0)
+    { uInt uDoCopy,i ;
+      if (pfile_in_zip_read_info->stream.avail_out < pfile_in_zip_read_info->stream.avail_in)
+      { uDoCopy = pfile_in_zip_read_info->stream.avail_out ;
+      }
+      else
+      { uDoCopy = pfile_in_zip_read_info->stream.avail_in ;
+      }
+      for (i=0;i<uDoCopy;i++) *(pfile_in_zip_read_info->stream.next_out+i) = *(pfile_in_zip_read_info->stream.next_in+i);
+      pfile_in_zip_read_info->crc32 = ucrc32(pfile_in_zip_read_info->crc32,pfile_in_zip_read_info->stream.next_out,uDoCopy);
+      pfile_in_zip_read_info->rest_read_uncompressed-=uDoCopy;
+      pfile_in_zip_read_info->stream.avail_in -= uDoCopy;
+      pfile_in_zip_read_info->stream.avail_out -= uDoCopy;
+      pfile_in_zip_read_info->stream.next_out += uDoCopy;
+      pfile_in_zip_read_info->stream.next_in += uDoCopy;
+      pfile_in_zip_read_info->stream.total_out += uDoCopy;
+      iRead += uDoCopy;
+      if (pfile_in_zip_read_info->rest_read_uncompressed==0) {if (reached_eof!=0) *reached_eof=true;}
+    }
+    else
+    { uLong uTotalOutBefore,uTotalOutAfter;
+      const Byte *bufBefore;
+      uLong uOutThis;
+      int flush=Z_SYNC_FLUSH;
+      uTotalOutBefore = pfile_in_zip_read_info->stream.total_out;
+      bufBefore = pfile_in_zip_read_info->stream.next_out;
+      //
+      err=inflate(&pfile_in_zip_read_info->stream,flush);
+      //
+      uTotalOutAfter = pfile_in_zip_read_info->stream.total_out;
+      uOutThis = uTotalOutAfter-uTotalOutBefore;
+      pfile_in_zip_read_info->crc32 = ucrc32(pfile_in_zip_read_info->crc32,bufBefore,(uInt)(uOutThis));
+      pfile_in_zip_read_info->rest_read_uncompressed -= uOutThis;
+      iRead += (uInt)(uTotalOutAfter - uTotalOutBefore);
+      if (err==Z_STREAM_END || pfile_in_zip_read_info->rest_read_uncompressed==0)
+      { if (reached_eof!=0) *reached_eof=true;
+        return iRead;
+      }
+      if (err!=Z_OK) break;
+    }
+  }
+
+  if (err==Z_OK) return iRead;
+  return err;
+}
+
+
+//  Give the current position in uncompressed data
+z_off_t unztell (unzFile file)
+{
+	unz_s* s;
+	file_in_zip_read_info_s* pfile_in_zip_read_info;
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+    pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+	if (pfile_in_zip_read_info==NULL)
+		return UNZ_PARAMERROR;
+
+	return (z_off_t)pfile_in_zip_read_info->stream.total_out;
+}
+
+
+//  return 1 if the end of file was reached, 0 elsewhere
+int unzeof (unzFile file)
+{
+	unz_s* s;
+	file_in_zip_read_info_s* pfile_in_zip_read_info;
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+    pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+	if (pfile_in_zip_read_info==NULL)
+		return UNZ_PARAMERROR;
+
+	if (pfile_in_zip_read_info->rest_read_uncompressed == 0)
+		return 1;
+	else
+		return 0;
+}
+
+
+
+//  Read extra field from the current file (opened by unzOpenCurrentFile)
+//  This is the local-header version of the extra field (sometimes, there is
+//    more info in the local-header version than in the central-header)
+//  if buf==NULL, it return the size of the local extra field that can be read
+//  if buf!=NULL, len is the size of the buffer, the extra header is copied in buf.
+//  the return value is the number of bytes copied in buf, or (if <0) the error code
+int unzGetLocalExtrafield (unzFile file,voidp buf,unsigned len)
+{
+	unz_s* s;
+	file_in_zip_read_info_s* pfile_in_zip_read_info;
+	uInt read_now;
+	uLong size_to_read;
+
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+    pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+	if (pfile_in_zip_read_info==NULL)
+		return UNZ_PARAMERROR;
+
+	size_to_read = (pfile_in_zip_read_info->size_local_extrafield -
+				pfile_in_zip_read_info->pos_local_extrafield);
+
+	if (buf==NULL)
+		return (int)size_to_read;
+
+	if (len>size_to_read)
+		read_now = (uInt)size_to_read;
+	else
+		read_now = (uInt)len ;
+
+	if (read_now==0)
+		return 0;
+
+	if (lufseek(pfile_in_zip_read_info->file, pfile_in_zip_read_info->offset_local_extrafield +  pfile_in_zip_read_info->pos_local_extrafield,SEEK_SET)!=0)
+		return UNZ_ERRNO;
+
+	if (lufread(buf,(uInt)size_to_read,1,pfile_in_zip_read_info->file)!=1)
+		return UNZ_ERRNO;
+
+	return (int)read_now;
+}
+
+//  Close the file in zip opened with unzipOpenCurrentFile
+//  Return UNZ_CRCERROR if all the file was read but the CRC is not good
+int unzCloseCurrentFile (unzFile file)
+{
+	int err=UNZ_OK;
+
+	unz_s* s;
+	file_in_zip_read_info_s* pfile_in_zip_read_info;
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+    pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+	if (pfile_in_zip_read_info==NULL)
+		return UNZ_PARAMERROR;
+
+
+	if (pfile_in_zip_read_info->rest_read_uncompressed == 0)
+	{
+		if (pfile_in_zip_read_info->crc32 != pfile_in_zip_read_info->crc32_wait)
+			err=UNZ_CRCERROR;
+	}
+
+
+	if (pfile_in_zip_read_info->read_buffer!=0)
+        { void *buf = pfile_in_zip_read_info->read_buffer;
+          zfree(buf);
+          pfile_in_zip_read_info->read_buffer=0;
+        }
+	pfile_in_zip_read_info->read_buffer = NULL;
+	if (pfile_in_zip_read_info->stream_initialised)
+		inflateEnd(&pfile_in_zip_read_info->stream);
+
+	pfile_in_zip_read_info->stream_initialised = 0;
+        if (pfile_in_zip_read_info!=0) zfree(pfile_in_zip_read_info); // unused pfile_in_zip_read_info=0;
+
+    s->pfile_in_zip_read=NULL;
+
+	return err;
+}
+
+
+//  Get the global comment string of the ZipFile, in the szComment buffer.
+//  uSizeBuf is the size of the szComment buffer.
+//  return the number of byte copied or an error code <0
+int unzGetGlobalComment (unzFile file, char *szComment, uLong uSizeBuf)
+{ //int err=UNZ_OK;
+  unz_s* s;
+  uLong uReadThis ;
+  if (file==NULL) return UNZ_PARAMERROR;
+  s=(unz_s*)file;
+  uReadThis = uSizeBuf;
+  if (uReadThis>s->gi.size_comment) uReadThis = s->gi.size_comment;
+  if (lufseek(s->file,s->central_pos+22,SEEK_SET)!=0) return UNZ_ERRNO;
+  if (uReadThis>0)
+  { *szComment='\0';
+    if (lufread(szComment,(uInt)uReadThis,1,s->file)!=1) return UNZ_ERRNO;
+  }
+  if ((szComment != NULL) && (uSizeBuf > s->gi.size_comment)) *(szComment+s->gi.size_comment)='\0';
+  return (int)uReadThis;
+}
+
+
+
+
+
+int unzOpenCurrentFile (unzFile file, const char *password);
+int unzReadCurrentFile (unzFile file, void *buf, unsigned len);
+int unzCloseCurrentFile (unzFile file);
+
+
+typedef unsigned __int32 lutime_t;       // define it ourselves since we don't include time.h
+
+FILETIME timet2filetime(const lutime_t t)
+{ //LONGLONG i = Int32x32To64(t,10000000) + 116444736000000000;
+  LONGLONG i = Int32x32To64(t,10000000) + (LONGLONG)116444736000000000ll;
+  FILETIME ft;
+  ft.dwLowDateTime = (DWORD) i;
+  ft.dwHighDateTime = (DWORD)(i >>32);
+  return ft;
+}
+
+FILETIME dosdatetime2filetime(WORD dosdate,WORD dostime)
+{ // date: bits 0-4 are day of month 1-31. Bits 5-8 are month 1..12. Bits 9-15 are year-1980
+  // time: bits 0-4 are seconds/2, bits 5-10 are minute 0..59. Bits 11-15 are hour 0..23
+  SYSTEMTIME st;
+  st.wYear = (WORD)(((dosdate>>9)&0x7f) + 1980);
+  st.wMonth = (WORD)((dosdate>>5)&0xf);
+  st.wDay = (WORD)(dosdate&0x1f);
+  st.wHour = (WORD)((dostime>>11)&0x1f);
+  st.wMinute = (WORD)((dostime>>5)&0x3f);
+  st.wSecond = (WORD)((dostime&0x1f)*2);
+  st.wMilliseconds = 0;
+  FILETIME ft; SystemTimeToFileTime(&st,&ft);
+  return ft;
+}
+
+
+
+class TUnzip
+{ public:
+  TUnzip(const char *pwd) : uf(0), unzbuf(0), currentfile(-1), czei(-1), password(0) {if (pwd!=0) {password=new char[strlen(pwd)+1]; strcpy(password,pwd);}}
+  ~TUnzip() {if (password!=0) delete[] password; password=0; if (unzbuf!=0) delete[] unzbuf; unzbuf=0;}
+
+  unzFile uf; int currentfile; ZIPENTRY cze; int czei;
+  char *password;
+  char *unzbuf;            // lazily created and destroyed, used by Unzip
+  TCHAR rootdir[MAX_PATH]; // includes a trailing slash
+
+  ZRESULT Open(void *z,unsigned int len,DWORD flags);
+  ZRESULT Get(int index,ZIPENTRY *ze);
+  ZRESULT Find(const TCHAR *name,bool ic,int *index,ZIPENTRY *ze);
+  ZRESULT Unzip(int index,void *dst,unsigned int len,DWORD flags);
+  ZRESULT SetUnzipBaseDir(const TCHAR *dir);
+  ZRESULT Close();
+};
+
+
+ZRESULT TUnzip::Open(void *z,unsigned int len,DWORD flags)
+{ if (uf!=0 || currentfile!=-1) return ZR_NOTINITED;
+  //
+#ifdef GetCurrentDirectory
+  GetCurrentDirectory(MAX_PATH,rootdir);
+#else
+  _tcscpy(rootdir,_T("\\"));
+#endif
+  TCHAR lastchar = rootdir[_tcslen(rootdir)-1];
+  if (lastchar!='\\' && lastchar!='/') _tcscat(rootdir,_T("\\"));
+  //
+  if (flags==ZIP_HANDLE)
+  { // test if we can seek on it. We can't use GetFileType(h)==FILE_TYPE_DISK since it's not on CE.
+    DWORD res = SetFilePointer(z,0,0,FILE_CURRENT);
+    bool canseek = (res!=0xFFFFFFFF);
+    if (!canseek) return ZR_SEEK;
+  }
+  ZRESULT e; LUFILE *f = lufopen(z,len,flags,&e);
+  if (f==NULL) return e;
+  uf = unzOpenInternal(f);
+  if (uf==0) return ZR_NOFILE;
+  return ZR_OK;
+}
+
+ZRESULT TUnzip::SetUnzipBaseDir(const TCHAR *dir)
+{ _tcscpy(rootdir,dir);
+  TCHAR lastchar = rootdir[_tcslen(rootdir)-1];
+  if (lastchar!='\\' && lastchar!='/') _tcscat(rootdir,_T("\\"));
+  return ZR_OK;
+}
+
+ZRESULT TUnzip::Get(int index,ZIPENTRY *ze)
+{ if (index<-1 || index>=(int)uf->gi.number_entry) return ZR_ARGS;
+  if (currentfile!=-1) unzCloseCurrentFile(uf); currentfile=-1;
+  if (index==czei && index!=-1) {memcpy(ze,&cze,sizeof(ZIPENTRY)); return ZR_OK;}
+  if (index==-1)
+  { ze->index = uf->gi.number_entry;
+    ze->name[0]=0;
+    ze->attr=0;
+    ze->atime.dwLowDateTime=0; ze->atime.dwHighDateTime=0;
+    ze->ctime.dwLowDateTime=0; ze->ctime.dwHighDateTime=0;
+    ze->mtime.dwLowDateTime=0; ze->mtime.dwHighDateTime=0;
+    ze->comp_size=0;
+    ze->unc_size=0;
+    return ZR_OK;
+  }
+  if (index<(int)uf->num_file) unzGoToFirstFile(uf);
+  while ((int)uf->num_file<index) unzGoToNextFile(uf);
+  unz_file_info ufi; char fn[MAX_PATH];
+  unzGetCurrentFileInfo(uf,&ufi,fn,MAX_PATH,NULL,0,NULL,0);
+  // now get the extra header. We do this ourselves, instead of
+  // calling unzOpenCurrentFile &c., to avoid allocating more than necessary.
+  unsigned int extralen,iSizeVar; unsigned long offset;
+  int res = unzlocal_CheckCurrentFileCoherencyHeader(uf,&iSizeVar,&offset,&extralen);
+  if (res!=UNZ_OK) return ZR_CORRUPT;
+  if (lufseek(uf->file,offset,SEEK_SET)!=0) return ZR_READ;
+  unsigned char *extra = new unsigned char[extralen];
+  if (lufread(extra,1,(uInt)extralen,uf->file)!=extralen) {delete[] extra; return ZR_READ;}
+  //
+  ze->index=uf->num_file;
+  TCHAR tfn[MAX_PATH];
+#ifdef UNICODE
+  MultiByteToWideChar(CP_UTF8,0,fn,-1,tfn,MAX_PATH);
+#else
+  strcpy(tfn,fn);
+#endif
+  // As a safety feature: if the zip filename had sneaky stuff
+  // like "c:\windows\file.txt" or "\windows\file.txt" or "fred\..\..\..\windows\file.txt"
+  // then we get rid of them all. That way, when the programmer does UnzipItem(hz,i,ze.name),
+  // it won't be a problem. (If the programmer really did want to get the full evil information,
+  // then they can edit out this security feature from here).
+  // In particular, we chop off any prefixes that are "c:\" or "\" or "/" or "[stuff]\.." or "[stuff]/.."
+  const TCHAR *sfn=tfn;
+  for (;;)
+  { if (sfn[0]!=0 && sfn[1]==':') {sfn+=2; continue;}
+    if (sfn[0]=='\\') {sfn++; continue;}
+    if (sfn[0]=='/') {sfn++; continue;}
+    const TCHAR *c;
+    c=_tcsstr(sfn,_T("\\..\\")); if (c!=0) {sfn=c+4; continue;}
+    c=_tcsstr(sfn,_T("\\../")); if (c!=0) {sfn=c+4; continue;}
+    c=_tcsstr(sfn,_T("/../")); if (c!=0) {sfn=c+4; continue;}
+    c=_tcsstr(sfn,_T("/..\\")); if (c!=0) {sfn=c+4; continue;}
+    break;
+  }
+  _tcscpy(ze->name, sfn);
+
+
+  // zip has an 'attribute' 32bit value. Its lower half is windows stuff
+  // its upper half is standard unix stat.st_mode. We'll start trying
+  // to read it in unix mode
+  unsigned long a = ufi.external_fa;
+  bool isdir  =   (a&0x40000000)!=0;
+  bool readonly=  (a&0x00800000)==0;
+  //bool readable=  (a&0x01000000)!=0; // unused
+  //bool executable=(a&0x00400000)!=0; // unused
+  bool hidden=false, system=false, archive=true;
+  // but in normal hostmodes these are overridden by the lower half...
+  int host = ufi.version>>8;
+  if (host==0 || host==7 || host==11 || host==14)
+  { readonly=  (a&0x00000001)!=0;
+    hidden=    (a&0x00000002)!=0;
+    system=    (a&0x00000004)!=0;
+    isdir=     (a&0x00000010)!=0;
+    archive=   (a&0x00000020)!=0;
+  }
+  ze->attr=0;
+  if (isdir) ze->attr |= FILE_ATTRIBUTE_DIRECTORY;
+  if (archive) ze->attr|=FILE_ATTRIBUTE_ARCHIVE;
+  if (hidden) ze->attr|=FILE_ATTRIBUTE_HIDDEN;
+  if (readonly) ze->attr|=FILE_ATTRIBUTE_READONLY;
+  if (system) ze->attr|=FILE_ATTRIBUTE_SYSTEM;
+  ze->comp_size = ufi.compressed_size;
+  ze->unc_size = ufi.uncompressed_size;
+  //
+  WORD dostime = (WORD)(ufi.dosDate&0xFFFF);
+  WORD dosdate = (WORD)((ufi.dosDate>>16)&0xFFFF);
+  FILETIME ftd = dosdatetime2filetime(dosdate,dostime);
+  FILETIME ft; LocalFileTimeToFileTime(&ftd,&ft);
+  ze->atime=ft; ze->ctime=ft; ze->mtime=ft;
+  // the zip will always have at least that dostime. But if it also has
+  // an extra header, then we'll instead get the info from that.
+  unsigned int epos=0;
+  while (epos+4<extralen)
+  { char etype[3]; etype[0]=extra[epos+0]; etype[1]=extra[epos+1]; etype[2]=0;
+    int size = extra[epos+2];
+    if (strcmp(etype,"UT")!=0) {epos += 4+size; continue;}
+    int flags = extra[epos+4];
+    bool hasmtime = (flags&1)!=0;
+    bool hasatime = (flags&2)!=0;
+    bool hasctime = (flags&4)!=0;
+    epos+=5;
+    if (hasmtime)
+    { lutime_t mtime = ((extra[epos+0])<<0) | ((extra[epos+1])<<8) |((extra[epos+2])<<16) | ((extra[epos+3])<<24);
+	  epos+=4;
+      ze->mtime = timet2filetime(mtime);
+    }
+    if (hasatime)
+    { lutime_t atime = ((extra[epos+0])<<0) | ((extra[epos+1])<<8) |((extra[epos+2])<<16) | ((extra[epos+3])<<24);
+      epos+=4;
+      ze->atime = timet2filetime(atime);
+    }
+    if (hasctime)
+    { lutime_t ctime = ((extra[epos+0])<<0) | ((extra[epos+1])<<8) |((extra[epos+2])<<16) | ((extra[epos+3])<<24);
+      epos+=4;
+      ze->ctime = timet2filetime(ctime);
+    }
+    break;
+  }
+  //
+  if (extra!=0) delete[] extra;
+  memcpy(&cze,ze,sizeof(ZIPENTRY)); czei=index;
+  return ZR_OK;
+}
+
+ZRESULT TUnzip::Find(const TCHAR *tname,bool ic,int *index,ZIPENTRY *ze)
+{ char name[MAX_PATH];
+#ifdef UNICODE
+  WideCharToMultiByte(CP_UTF8,0,tname,-1,name,MAX_PATH,0,0);
+#else
+  strcpy(name,tname);
+#endif
+  int res = unzLocateFile(uf,name,ic?CASE_INSENSITIVE:CASE_SENSITIVE);
+  if (res!=UNZ_OK)
+  { if (index!=0) *index=-1;
+    if (ze!=NULL) {ZeroMemory(ze,sizeof(ZIPENTRY)); ze->index=-1;}
+    return ZR_NOTFOUND;
+  }
+  if (currentfile!=-1) unzCloseCurrentFile(uf); currentfile=-1;
+  int i = (int)uf->num_file;
+  if (index!=NULL) *index=i;
+  if (ze!=NULL)
+  { ZRESULT zres = Get(i,ze);
+    if (zres!=ZR_OK) return zres;
+  }
+  return ZR_OK;
+}
+
+void EnsureDirectory(const TCHAR *rootdir, const TCHAR *dir)
+{ if (rootdir!=0 && GetFileAttributes(rootdir)==0xFFFFFFFF) CreateDirectory(rootdir,0);
+  if (*dir==0) return;
+  const TCHAR *lastslash=dir, *c=lastslash;
+  while (*c!=0) {if (*c=='/' || *c=='\\') lastslash=c; c++;}
+  const TCHAR *name=lastslash;
+  if (lastslash!=dir)
+  { TCHAR tmp[MAX_PATH]; memcpy(tmp,dir,sizeof(TCHAR)*(lastslash-dir));
+    tmp[lastslash-dir]=0;
+    EnsureDirectory(rootdir,tmp);
+    name++;
+  }
+  TCHAR cd[MAX_PATH]; *cd=0; if (rootdir!=0) _tcscpy(cd,rootdir); _tcscat(cd,dir);
+  if (GetFileAttributes(cd)==0xFFFFFFFF) CreateDirectory(cd,NULL);
+}
+
+
+
+ZRESULT TUnzip::Unzip(int index,void *dst,unsigned int len,DWORD flags)
+{ if (flags!=ZIP_MEMORY && flags!=ZIP_FILENAME && flags!=ZIP_HANDLE) return ZR_ARGS;
+  if (flags==ZIP_MEMORY)
+  { if (index!=currentfile)
+    { if (currentfile!=-1) unzCloseCurrentFile(uf); currentfile=-1;
+      if (index>=(int)uf->gi.number_entry) return ZR_ARGS;
+      if (index<(int)uf->num_file) unzGoToFirstFile(uf);
+      while ((int)uf->num_file<index) unzGoToNextFile(uf);
+      unzOpenCurrentFile(uf,password); currentfile=index;
+    }
+    bool reached_eof;
+    int res = unzReadCurrentFile(uf,dst,len,&reached_eof);
+    if (res<=0) {unzCloseCurrentFile(uf); currentfile=-1;}
+    if (reached_eof) return ZR_OK;
+    if (res>0) return ZR_MORE;
+    if (res==UNZ_PASSWORD) return ZR_PASSWORD;
+    return ZR_FLATE;
+  }
+  // otherwise we're writing to a handle or a file
+  if (currentfile!=-1) unzCloseCurrentFile(uf); currentfile=-1;
+  if (index>=(int)uf->gi.number_entry) return ZR_ARGS;
+  if (index<(int)uf->num_file) unzGoToFirstFile(uf);
+  while ((int)uf->num_file<index) unzGoToNextFile(uf);
+  ZIPENTRY ze; Get(index,&ze);
+  // zipentry=directory is handled specially
+  if ((ze.attr&FILE_ATTRIBUTE_DIRECTORY)!=0)
+  { if (flags==ZIP_HANDLE) return ZR_OK; // don't do anything
+    const TCHAR *dir = (const TCHAR*)dst;
+    bool isabsolute = (dir[0]=='/' || dir[0]=='\\' || (dir[0]!=0 && dir[1]==':'));
+    if (isabsolute) EnsureDirectory(0,dir); else EnsureDirectory(rootdir,dir);
+    return ZR_OK;
+  }
+  // otherwise, we write the zipentry to a file/handle
+  HANDLE h;
+  if (flags==ZIP_HANDLE) h=dst;
+  else
+  { const TCHAR *ufn = (const TCHAR*)dst;
+    // We'll qualify all relative names to our root dir, and leave absolute names as they are
+    // ufn="zipfile.txt"  dir=""  name="zipfile.txt"  fn="c:\\currentdir\\zipfile.txt"
+    // ufn="dir1/dir2/subfile.txt"  dir="dir1/dir2/"  name="subfile.txt"  fn="c:\\currentdir\\dir1/dir2/subfiles.txt"
+    // ufn="\z\file.txt"  dir="\z\"  name="file.txt"  fn="\z\file.txt"
+    // This might be a security risk, in the case where we just use the zipentry's name as "ufn", where
+    // a malicious zip could unzip itself into c:\windows. Our solution is that GetZipItem (which
+    // is how the user retrieve's the file's name within the zip) never returns absolute paths.
+    const TCHAR *name=ufn; const TCHAR *c=name; while (*c!=0) {if (*c=='/' || *c=='\\') name=c+1; c++;}
+    TCHAR dir[MAX_PATH]; _tcscpy(dir,ufn); if (name==ufn) *dir=0; else dir[name-ufn]=0;
+    TCHAR fn[MAX_PATH]; 
+    bool isabsolute = (dir[0]=='/' || dir[0]=='\\' || (dir[0]!=0 && dir[1]==':'));
+    if (isabsolute) {wsprintf(fn,_T("%s%s"),dir,name); EnsureDirectory(0,dir);}
+    else {wsprintf(fn,_T("%s%s%s"),rootdir,dir,name); EnsureDirectory(rootdir,dir);}
+    //
+    h = CreateFile(fn,GENERIC_WRITE,0,NULL,CREATE_ALWAYS,ze.attr,NULL);
+  }
+  if (h==INVALID_HANDLE_VALUE) return ZR_NOFILE;
+  unzOpenCurrentFile(uf,password);
+  if (unzbuf==0) unzbuf=new char[16384]; DWORD haderr=0;
+  //  
+
+  for (; haderr==0;)
+  { bool reached_eof;
+    int res = unzReadCurrentFile(uf,unzbuf,16384,&reached_eof);
+    if (res==UNZ_PASSWORD) {haderr=ZR_PASSWORD; break;}
+    if (res<0) {haderr=ZR_FLATE; break;}
+    if (res>0) {DWORD writ; BOOL bres=WriteFile(h,unzbuf,res,&writ,NULL); if (!bres) {haderr=ZR_WRITE; break;}}
+    if (reached_eof) break;
+    if (res==0) {haderr=ZR_FLATE; break;}
+  }
+  if (!haderr) SetFileTime(h,&ze.ctime,&ze.atime,&ze.mtime); // may fail if it was a pipe
+  if (flags!=ZIP_HANDLE) CloseHandle(h);
+  unzCloseCurrentFile(uf);
+  if (haderr!=0) return haderr;
+  return ZR_OK;
+}
+
+ZRESULT TUnzip::Close()
+{ if (currentfile!=-1) unzCloseCurrentFile(uf); currentfile=-1;
+  if (uf!=0) unzClose(uf); uf=0;
+  return ZR_OK;
+}
+
+
+
+
+
+ZRESULT lasterrorU=ZR_OK;
+
+unsigned int FormatZipMessageU(ZRESULT code, TCHAR *buf,unsigned int len)
+{ if (code==ZR_RECENT) code=lasterrorU;
+  const TCHAR *msg=_T("unknown zip result code");
+  switch (code)
+  { case ZR_OK: msg=_T("Success"); break;
+    case ZR_NODUPH: msg=_T("Culdn't duplicate handle"); break;
+    case ZR_NOFILE: msg=_T("Couldn't create/open file"); break;
+    case ZR_NOALLOC: msg=_T("Failed to allocate memory"); break;
+    case ZR_WRITE: msg=_T("Error writing to file"); break;
+    case ZR_NOTFOUND: msg=_T("File not found in the zipfile"); break;
+    case ZR_MORE: msg=_T("Still more data to unzip"); break;
+    case ZR_CORRUPT: msg=_T("Zipfile is corrupt or not a zipfile"); break;
+    case ZR_READ: msg=_T("Error reading file"); break;
+    case ZR_PASSWORD: msg=_T("Correct password required"); break;
+    case ZR_ARGS: msg=_T("Caller: faulty arguments"); break;
+    case ZR_PARTIALUNZ: msg=_T("Caller: the file had already been partially unzipped"); break;
+    case ZR_NOTMMAP: msg=_T("Caller: can only get memory of a memory zipfile"); break;
+    case ZR_MEMSIZE: msg=_T("Caller: not enough space allocated for memory zipfile"); break;
+    case ZR_FAILED: msg=_T("Caller: there was a previous error"); break;
+    case ZR_ENDED: msg=_T("Caller: additions to the zip have already been ended"); break;
+    case ZR_ZMODE: msg=_T("Caller: mixing creation and opening of zip"); break;
+    case ZR_NOTINITED: msg=_T("Zip-bug: internal initialisation not completed"); break;
+    case ZR_SEEK: msg=_T("Zip-bug: trying to seek the unseekable"); break;
+    case ZR_MISSIZE: msg=_T("Zip-bug: the anticipated size turned out wrong"); break;
+    case ZR_NOCHANGE: msg=_T("Zip-bug: tried to change mind, but not allowed"); break;
+    case ZR_FLATE: msg=_T("Zip-bug: an internal error during flation"); break;
+  }
+  unsigned int mlen=(unsigned int)_tcslen(msg);
+  if (buf==0 || len==0) return mlen;
+  unsigned int n=mlen; if (n+1>len) n=len-1;
+  _tcsncpy(buf,msg,n); buf[n]=0;
+  return mlen;
+}
+
+
+typedef struct
+{ DWORD flag;
+  TUnzip *unz;
+} TUnzipHandleData;
+
+HZIP OpenZipInternal(void *z,unsigned int len,DWORD flags, const char *password)
+{ TUnzip *unz = new TUnzip(password);
+  lasterrorU = unz->Open(z,len,flags);
+  if (lasterrorU!=ZR_OK) {delete unz; return 0;}
+  TUnzipHandleData *han = new TUnzipHandleData;
+  han->flag=1; han->unz=unz; return (HZIP)han;
+}
+HZIP OpenZipHandle(HANDLE h, const char *password) {return OpenZipInternal((void*)h,0,ZIP_HANDLE,password);}
+HZIP OpenZip(const TCHAR *fn, const char *password) {return OpenZipInternal((void*)fn,0,ZIP_FILENAME,password);}
+HZIP OpenZip(void *z,unsigned int len, const char *password) {return OpenZipInternal(z,len,ZIP_MEMORY,password);}
+
+
+ZRESULT GetZipItem(HZIP hz, int index, ZIPENTRY *ze)
+{ ze->index=0; *ze->name=0; ze->unc_size=0;
+  if (hz==0) {lasterrorU=ZR_ARGS;return ZR_ARGS;}
+  TUnzipHandleData *han = (TUnzipHandleData*)hz;
+  if (han->flag!=1) {lasterrorU=ZR_ZMODE;return ZR_ZMODE;}
+  TUnzip *unz = han->unz;
+  lasterrorU = unz->Get(index,ze);
+  return lasterrorU;
+}
+
+ZRESULT FindZipItem(HZIP hz, const TCHAR *name, bool ic, int *index, ZIPENTRY *ze)
+{ if (hz==0) {lasterrorU=ZR_ARGS;return ZR_ARGS;}
+  TUnzipHandleData *han = (TUnzipHandleData*)hz;
+  if (han->flag!=1) {lasterrorU=ZR_ZMODE;return ZR_ZMODE;}
+  TUnzip *unz = han->unz;
+  lasterrorU = unz->Find(name,ic,index,ze);
+  return lasterrorU;
+}
+
+ZRESULT UnzipItemInternal(HZIP hz, int index, void *dst, unsigned int len, DWORD flags)
+{ if (hz==0) {lasterrorU=ZR_ARGS;return ZR_ARGS;}
+  TUnzipHandleData *han = (TUnzipHandleData*)hz;
+  if (han->flag!=1) {lasterrorU=ZR_ZMODE;return ZR_ZMODE;}
+  TUnzip *unz = han->unz;
+  lasterrorU = unz->Unzip(index,dst,len,flags);
+  return lasterrorU;
+}
+ZRESULT UnzipItemHandle(HZIP hz, int index, HANDLE h) {return UnzipItemInternal(hz,index,(void*)h,0,ZIP_HANDLE);}
+ZRESULT UnzipItem(HZIP hz, int index, const TCHAR *fn) {return UnzipItemInternal(hz,index,(void*)fn,0,ZIP_FILENAME);}
+ZRESULT UnzipItem(HZIP hz, int index, void *z,unsigned int len) {return UnzipItemInternal(hz,index,z,len,ZIP_MEMORY);}
+
+ZRESULT SetUnzipBaseDir(HZIP hz, const TCHAR *dir)
+{ if (hz==0) {lasterrorU=ZR_ARGS;return ZR_ARGS;}
+  TUnzipHandleData *han = (TUnzipHandleData*)hz;
+  if (han->flag!=1) {lasterrorU=ZR_ZMODE;return ZR_ZMODE;}
+  TUnzip *unz = han->unz;
+  lasterrorU = unz->SetUnzipBaseDir(dir);
+  return lasterrorU;
+}
+
+
+ZRESULT CloseZipU(HZIP hz)
+{ if (hz==0) {lasterrorU=ZR_ARGS;return ZR_ARGS;}
+  TUnzipHandleData *han = (TUnzipHandleData*)hz;
+  if (han->flag!=1) {lasterrorU=ZR_ZMODE;return ZR_ZMODE;}
+  TUnzip *unz = han->unz;
+  lasterrorU = unz->Close();
+  delete unz;
+  delete han;
+  return lasterrorU;
+}
+
+bool IsZipHandleU(HZIP hz)
+{ if (hz==0) return false;
+  TUnzipHandleData *han = (TUnzipHandleData*)hz;
+  return (han->flag==1);
+}
+
+
diff --git a/updater/unzip.h b/updater/unzip.h
new file mode 100644
index 0000000..5310f1d
--- /dev/null
+++ b/updater/unzip.h
@@ -0,0 +1,214 @@
+#ifndef _unzip_H
+#define _unzip_H
+
+// UNZIPPING functions -- for unzipping.
+// This file is a repackaged form of extracts from the zlib code available
+// at www.gzip.org/zlib, by Jean-Loup Gailly and Mark Adler. The original
+// copyright notice may be found in unzip.cpp. The repackaging was done
+// by Lucian Wischik to simplify and extend its use in Windows/C++. Also
+// encryption and unicode filenames have been added.
+
+
+#ifndef _zip_H
+DECLARE_HANDLE(HZIP);
+#endif
+// An HZIP identifies a zip file that has been opened
+
+typedef DWORD ZRESULT;
+// return codes from any of the zip functions. Listed later.
+
+typedef struct
+{ int index;                 // index of this file within the zip
+  TCHAR name[MAX_PATH];      // filename within the zip
+  DWORD attr;                // attributes, as in GetFileAttributes.
+  FILETIME atime,ctime,mtime;// access, create, modify filetimes
+  long comp_size;            // sizes of item, compressed and uncompressed. These
+  long unc_size;             // may be -1 if not yet known (e.g. being streamed in)
+} ZIPENTRY;
+
+
+HZIP OpenZip(const TCHAR *fn, const char *password);
+HZIP OpenZip(void *z,unsigned int len, const char *password);
+HZIP OpenZipHandle(HANDLE h, const char *password);
+// OpenZip - opens a zip file and returns a handle with which you can
+// subsequently examine its contents. You can open a zip file from:
+// from a pipe:             OpenZipHandle(hpipe_read,0);
+// from a file (by handle): OpenZipHandle(hfile,0);
+// from a file (by name):   OpenZip("c:\\test.zip","password");
+// from a memory block:     OpenZip(bufstart, buflen,0);
+// If the file is opened through a pipe, then items may only be
+// accessed in increasing order, and an item may only be unzipped once,
+// although GetZipItem can be called immediately before and after unzipping
+// it. If it's opened in any other way, then full random access is possible.
+// Note: pipe input is not yet implemented.
+// Note: zip passwords are ascii, not unicode.
+// Note: for windows-ce, you cannot close the handle until after CloseZip.
+// but for real windows, the zip makes its own copy of your handle, so you
+// can close yours anytime.
+
+ZRESULT GetZipItem(HZIP hz, int index, ZIPENTRY *ze);
+// GetZipItem - call this to get information about an item in the zip.
+// If index is -1 and the file wasn't opened through a pipe,
+// then it returns information about the whole zipfile
+// (and in particular ze.index returns the number of index items).
+// Note: the item might be a directory (ze.attr & FILE_ATTRIBUTE_DIRECTORY)
+// See below for notes on what happens when you unzip such an item.
+// Note: if you are opening the zip through a pipe, then random access
+// is not possible and GetZipItem(-1) fails and you can't discover the number
+// of items except by calling GetZipItem on each one of them in turn,
+// starting at 0, until eventually the call fails. Also, in the event that
+// you are opening through a pipe and the zip was itself created into a pipe,
+// then then comp_size and sometimes unc_size as well may not be known until
+// after the item has been unzipped.
+
+ZRESULT FindZipItem(HZIP hz, const TCHAR *name, bool ic, int *index, ZIPENTRY *ze);
+// FindZipItem - finds an item by name. ic means 'insensitive to case'.
+// It returns the index of the item, and returns information about it.
+// If nothing was found, then index is set to -1 and the function returns
+// an error code.
+
+ZRESULT UnzipItem(HZIP hz, int index, const TCHAR *fn);
+ZRESULT UnzipItem(HZIP hz, int index, void *z,unsigned int len);
+ZRESULT UnzipItemHandle(HZIP hz, int index, HANDLE h);
+// UnzipItem - given an index to an item, unzips it. You can unzip to:
+// to a pipe:             UnzipItemHandle(hz,i, hpipe_write);
+// to a file (by handle): UnzipItemHandle(hz,i, hfile);
+// to a file (by name):   UnzipItem(hz,i, ze.name);
+// to a memory block:     UnzipItem(hz,i, buf,buflen);
+// In the final case, if the buffer isn't large enough to hold it all,
+// then the return code indicates that more is yet to come. If it was
+// large enough, and you want to know precisely how big, GetZipItem.
+// Note: zip files are normally stored with relative pathnames. If you
+// unzip with ZIP_FILENAME a relative pathname then the item gets created
+// relative to the current directory - it first ensures that all necessary
+// subdirectories have been created. Also, the item may itself be a directory.
+// If you unzip a directory with ZIP_FILENAME, then the directory gets created.
+// If you unzip it to a handle or a memory block, then nothing gets created
+// and it emits 0 bytes.
+ZRESULT SetUnzipBaseDir(HZIP hz, const TCHAR *dir);
+// if unzipping to a filename, and it's a relative filename, then it will be relative to here.
+// (defaults to current-directory).
+
+
+ZRESULT CloseZip(HZIP hz);
+// CloseZip - the zip handle must be closed with this function.
+
+unsigned int FormatZipMessage(ZRESULT code, TCHAR *buf,unsigned int len);
+// FormatZipMessage - given an error code, formats it as a string.
+// It returns the length of the error message. If buf/len points
+// to a real buffer, then it also writes as much as possible into there.
+
+
+// These are the result codes:
+#define ZR_OK         0x00000000     // nb. the pseudo-code zr-recent is never returned,
+#define ZR_RECENT     0x00000001     // but can be passed to FormatZipMessage.
+// The following come from general system stuff (e.g. files not openable)
+#define ZR_GENMASK    0x0000FF00
+#define ZR_NODUPH     0x00000100     // couldn't duplicate the handle
+#define ZR_NOFILE     0x00000200     // couldn't create/open the file
+#define ZR_NOALLOC    0x00000300     // failed to allocate some resource
+#define ZR_WRITE      0x00000400     // a general error writing to the file
+#define ZR_NOTFOUND   0x00000500     // couldn't find that file in the zip
+#define ZR_MORE       0x00000600     // there's still more data to be unzipped
+#define ZR_CORRUPT    0x00000700     // the zipfile is corrupt or not a zipfile
+#define ZR_READ       0x00000800     // a general error reading the file
+#define ZR_PASSWORD   0x00001000     // we didn't get the right password to unzip the file
+// The following come from mistakes on the part of the caller
+#define ZR_CALLERMASK 0x00FF0000
+#define ZR_ARGS       0x00010000     // general mistake with the arguments
+#define ZR_NOTMMAP    0x00020000     // tried to ZipGetMemory, but that only works on mmap zipfiles, which yours wasn't
+#define ZR_MEMSIZE    0x00030000     // the memory size is too small
+#define ZR_FAILED     0x00040000     // the thing was already failed when you called this function
+#define ZR_ENDED      0x00050000     // the zip creation has already been closed
+#define ZR_MISSIZE    0x00060000     // the indicated input file size turned out mistaken
+#define ZR_PARTIALUNZ 0x00070000     // the file had already been partially unzipped
+#define ZR_ZMODE      0x00080000     // tried to mix creating/opening a zip 
+// The following come from bugs within the zip library itself
+#define ZR_BUGMASK    0xFF000000
+#define ZR_NOTINITED  0x01000000     // initialisation didn't work
+#define ZR_SEEK       0x02000000     // trying to seek in an unseekable file
+#define ZR_NOCHANGE   0x04000000     // changed its mind on storage, but not allowed
+#define ZR_FLATE      0x05000000     // an internal error in the de/inflation code
+
+
+
+
+
+// e.g.
+//
+// SetCurrentDirectory("c:\\docs\\stuff");
+// HZIP hz = OpenZip("c:\\stuff.zip",0);
+// ZIPENTRY ze; GetZipItem(hz,-1,&ze); int numitems=ze.index;
+// for (int i=0; i<numitems; i++)
+// { GetZipItem(hz,i,&ze);
+//   UnzipItem(hz,i,ze.name);
+// }
+// CloseZip(hz);
+//
+//
+// HRSRC hrsrc = FindResource(hInstance,MAKEINTRESOURCE(1),RT_RCDATA);
+// HANDLE hglob = LoadResource(hInstance,hrsrc);
+// void *zipbuf=LockResource(hglob);
+// unsigned int ziplen=SizeofResource(hInstance,hrsrc);
+// HZIP hz = OpenZip(zipbuf, ziplen, 0);
+//   - unzip to a membuffer -
+// ZIPENTRY ze; int i; FindZipItem(hz,"file.dat",true,&i,&ze);
+// char *ibuf = new char[ze.unc_size];
+// UnzipItem(hz,i, ibuf, ze.unc_size);
+// delete[] ibuf;
+//   - unzip to a fixed membuff -
+// ZIPENTRY ze; int i; FindZipItem(hz,"file.dat",true,&i,&ze);
+// char ibuf[1024]; ZRESULT zr=ZR_MORE; unsigned long totsize=0;
+// while (zr==ZR_MORE)
+// { zr = UnzipItem(hz,i, ibuf,1024);
+//   unsigned long bufsize=1024; if (zr==ZR_OK) bufsize=ze.unc_size-totsize;
+//   totsize+=bufsize;
+// }
+//   - unzip to a pipe -
+// HANDLE hwrite; HANDLE hthread=CreateWavReaderThread(&hwrite);
+// int i; ZIPENTRY ze; FindZipItem(hz,"sound.wav",true,&i,&ze);
+// UnzipItemHandle(hz,i, hwrite);
+// CloseHandle(hwrite);
+// WaitForSingleObject(hthread,INFINITE);
+// CloseHandle(hwrite); CloseHandle(hthread);
+//   - finished -
+// CloseZip(hz);
+// // note: no need to free resources obtained through Find/Load/LockResource
+//
+//
+// SetCurrentDirectory("c:\\docs\\pipedzipstuff");
+// HANDLE hread,hwrite; CreatePipe(&hread,&hwrite,0,0);
+// CreateZipWriterThread(hwrite);
+// HZIP hz = OpenZipHandle(hread,0);
+// for (int i=0; ; i++)
+// { ZIPENTRY ze;
+//   ZRESULT zr=GetZipItem(hz,i,&ze); if (zr!=ZR_OK) break; // no more
+//   UnzipItem(hz,i, ze.name);
+// }
+// CloseZip(hz);
+//
+//
+
+
+
+
+// Now we indulge in a little skullduggery so that the code works whether
+// the user has included just zip or both zip and unzip.
+// Idea: if header files for both zip and unzip are present, then presumably
+// the cpp files for zip and unzip are both present, so we will call
+// one or the other of them based on a dynamic choice. If the header file
+// for only one is present, then we will bind to that particular one.
+ZRESULT CloseZipU(HZIP hz);
+unsigned int FormatZipMessageU(ZRESULT code, TCHAR *buf,unsigned int len);
+bool IsZipHandleU(HZIP hz);
+#ifdef _zip_H
+#undef CloseZip
+#define CloseZip(hz) (IsZipHandleU(hz)?CloseZipU(hz):CloseZipZ(hz))
+#else
+#define CloseZip CloseZipU
+#define FormatZipMessage FormatZipMessageU
+#endif
+
+
+
+#endif // _unzip_H
diff --git a/updater/updater.cpp b/updater/updater.cpp
new file mode 100644
index 0000000..aebe70d
--- /dev/null
+++ b/updater/updater.cpp
@@ -0,0 +1,250 @@
+#include "common.h"
+#include "updater.h"
+
+HINSTANCE hInst;
+PLUGINLINK *pluginLink;
+
+HANDLE hNetlibUser = 0;
+
+DWORD mainThreadId;
+HANDLE mainThread;
+
+bool is_idle = false;
+
+//#define TESTING			// defined here to reduce build time blowout caused by changing common.h
+
+PLUGININFO pluginInfo={
+	sizeof(PLUGININFO),
+	__PLUGIN_NAME,
+#ifdef TESTING
+	0x00000001,
+#else
+	PLUGIN_MAKE_VERSION(__MAJOR_VERSION, __MINOR_VERSION, __RELEASE_NUM, __BUILD_NUM),
+#endif
+	__DESC,
+	__AUTHOR,
+	__AUTHOREMAIL,
+	__COPYRIGHT,
+	__AUTHORWEB,
+	0,		//not transient
+	0		//doesn't replace anything built-in
+};
+
+extern "C" BOOL WINAPI DllMain(HINSTANCE hinstDLL,DWORD fdwReason,LPVOID lpvReserved)
+{
+	hInst=hinstDLL;
+	return TRUE;
+}
+
+extern "C" __declspec(dllexport) PLUGININFO* MirandaPluginInfo(DWORD mirandaVersion)
+{
+	return &pluginInfo;
+}
+
+int IdleChanged(WPARAM wParam, LPARAM lParam) {
+
+	is_idle = (lParam & IDF_ISIDLE);
+
+	return 0;
+}
+
+void InitNetlib() {
+	NETLIBUSER nl_user = {0};
+	nl_user.cbSize = sizeof(nl_user);
+	nl_user.szSettingsModule = MODULE;
+	nl_user.flags = NUF_OUTGOING | NUF_HTTPCONNS;
+	nl_user.szDescriptiveName = "Updater";
+
+	hNetlibUser = (HANDLE)CallService(MS_NETLIB_REGISTERUSER, 0, (LPARAM)&nl_user);
+}
+
+void DeinitNetlib() {
+	if(hNetlibUser)
+		CallService(MS_NETLIB_CLOSEHANDLE, (WPARAM)hNetlibUser, 0);
+}
+
+HANDLE hEventIdleChanged;
+int ModulesLoaded(WPARAM wParam, LPARAM lParam) {
+	LoadOptions();
+
+	if(!options.check_on_startup) {
+		RestoreStatus();
+	}
+
+	/*{
+		char buff[265];
+		sprintf(buff, "sizeof(Update) == %d", sizeof(Update));
+		PUShowMessage(buff, SM_NOTIFY);
+	}*/
+
+	InitIcons();
+
+	InitOptionsMenuItems();
+	
+	InitNetlib();
+	InitPopups();
+
+#ifdef USE_MY_SERVER
+	Update update = {0};
+	char szVersion[16];
+	update.cbSize = sizeof(Update);
+
+	update.szComponentName = pluginInfo.shortName;
+	update.pbVersion = (BYTE *)CreateVersionString(&pluginInfo, szVersion);
+	update.cpbVersion = strlen((char *)update.pbVersion);
+
+#ifdef _UNICODE
+	update.szUpdateURL = BETA_HOST_URL_PREFIX "/ver_updater_unicode.zip";
+	update.szVersionURL = BETA_HOST_URL_PREFIX "/updater_unicode.html";
+	update.pbVersionPrefix = (BYTE *)"Updater (Unicode) version ";
+	update.cpbVersionPrefix = strlen((char *)update.pbVersionPrefix);
+#else //!_UNICODE
+	update.szUpdateURL = BETA_HOST_URL_PREFIX "/updater.zip";
+	update.szVersionURL = BETA_HOST_URL_PREFIX "/ver_updater.html";
+	update.pbVersionPrefix = (BYTE *)"Updater version ";
+	update.cpbVersionPrefix = strlen((char *)update.pbVersionPrefix);
+#endif //_UNICODE
+
+
+	CallService(MS_UPDATE_REGISTER, 0, (WPARAM)&update);
+
+#else //!USE_MY_SERVER
+
+#ifdef REGISTER_BETA
+
+	Update update = {0};
+	char szVersion[16];
+	update.cbSize = sizeof(Update);
+
+	update.szComponentName = pluginInfo.shortName;
+	update.pbVersion = (BYTE *)CreateVersionStringPlugin(&pluginInfo, szVersion);
+	update.cpbVersion = strlen((char *)update.pbVersion);
+
+	
+#ifdef _UNICODE
+
+#ifdef REGISTER_AUTO
+	update.szUpdateURL = UPDATER_AUTOREGISTER;
+#else //!REGISTER_AUTO
+	update.szUpdateURL = MIM_DOWNLOAD_URL_PREFIX "2596";
+	update.szVersionURL = MIM_VIEW_URL_PREFIX "2596";
+	update.pbVersionPrefix = (BYTE *)"<span class=\"fileNameHeader\">Updater (Unicode) ";
+	update.cpbVersionPrefix = strlen((char *)update.pbVersionPrefix);
+#endif //REGISTER_AUTO
+
+	update.szBetaUpdateURL = BETA_HOST_URL_PREFIX "/updater_unicode.zip";
+	update.szBetaVersionURL = BETA_HOST_URL_PREFIX "/ver_updater_unicode.html";
+	update.pbBetaVersionPrefix = (BYTE *)"Updater (Unicode) version ";
+	update.cpbBetaVersionPrefix = strlen((char *)update.pbBetaVersionPrefix);
+#else //!_UNICODE
+
+#ifdef REGISTER_AUTO
+	update.szUpdateURL = UPDATER_AUTOREGISTER;
+#else //!REGISTER_AUTO
+	update.szUpdateURL = MIM_DOWNLOAD_URL_PREFIX "2254";
+	update.szVersionURL = MIM_VIEW_URL_PREFIX "2254";
+	update.pbVersionPrefix = (BYTE *)"<span class=\"fileNameHeader\">Updater ";
+	update.cpbVersionPrefix = strlen((char *)update.pbVersionPrefix);
+#endif //REGISTER_AUTO
+
+	update.szBetaUpdateURL = BETA_HOST_URL_PREFIX "/updater.zip";
+	update.szBetaVersionURL = BETA_HOST_URL_PREFIX "/ver_updater.html";
+	update.pbBetaVersionPrefix = (BYTE *)"Updater version ";
+	update.cpbBetaVersionPrefix = strlen((char *)update.pbBetaVersionPrefix);
+#endif //_UNICODE
+
+
+	CallService(MS_UPDATE_REGISTER, 0, (WPARAM)&update);
+#else // !REGISTER_BETA
+
+#ifdef _UNICODE
+	CallService(MS_UPDATE_REGISTERFL, (WPARAM)2596, (LPARAM)&pluginInfo);
+#else //!_UNICODE
+	CallService(MS_UPDATE_REGISTERFL, (WPARAM)2254, (LPARAM)&pluginInfo);
+#endif //_UNICODE
+
+#endif // REGISTER_BETA
+
+#endif // USE_MY_SERVER
+
+
+
+	hEventIdleChanged = HookEvent(ME_IDLE_CHANGED, IdleChanged);
+
+	if(ServiceExists(MS_TRIGGER_REGISTERACTION)) {
+		// create update action for triggerplugin
+		ACTIONREGISTER ar = {0};
+		ar.cbSize = sizeof(ACTIONREGISTER);
+		ar.pszName = Translate("Check for Updates");
+		ar.pszService = MS_UPDATE_CHECKFORUPDATESTRGR;
+
+		CallService(MS_TRIGGER_REGISTERACTION, 0, (LPARAM)&ar);
+	}
+
+	return 0;
+}
+
+int Shutdown(WPARAM wParam, LPARAM lParam) {
+	if(hNetlibUser) {
+		SOCKET s = CallService( MS_NETLIB_GETSOCKET, (WPARAM)hNetlibUser, 0 );
+		if ( s != INVALID_SOCKET ) shutdown( s, 2 );
+	}
+	return 0;
+}
+
+HANDLE hEventOptInit, hEventPreShutdown, hEventModulesLoaded;
+
+extern "C" int __declspec(dllexport) Load(PLUGINLINK *link)
+{
+	pluginLink = link;
+
+	mainThreadId = GetCurrentThreadId();
+	DuplicateHandle( GetCurrentProcess(), GetCurrentThread(), GetCurrentProcess(), &mainThread, THREAD_SET_CONTEXT, FALSE, 0 );
+
+	// save global status from clist - will be restored after update check if that option is enabled, or in modules loaded if not
+	options.start_offline = (DBGetContactSettingByte(0, MODULE, "StartOffline", 1) == 1); // load option here - rest loading in modulesloaded
+	if(options.start_offline) {
+		WORD saved_status = DBGetContactSettingWord(0, "CList", "Status", ID_STATUS_OFFLINE);
+		if(saved_status != ID_STATUS_OFFLINE) {
+			DBWriteContactSettingWord(0, MODULE, "SavedGlobalStatus", saved_status);
+			DBWriteContactSettingWord(0, "CList", "Status", ID_STATUS_OFFLINE);
+		}
+	}
+
+	INITCOMMONCONTROLSEX icex;
+
+	// Ensure that the common control DLL is loaded (for listview)
+	icex.dwSize = sizeof(INITCOMMONCONTROLSEX);
+	icex.dwICC  = ICC_LISTVIEW_CLASSES;
+	InitCommonControlsEx(&icex); 	
+
+	OleInitialize(0);
+
+	HookEvent(ME_OPT_INITIALISE, OptInit);
+
+	HookEvent(ME_SYSTEM_PRESHUTDOWN, Shutdown);
+
+	// do this before init services, so that InitPopups is called before startup update
+	HookEvent(ME_SYSTEM_MODULESLOADED, ModulesLoaded); 
+
+	InitServices();
+
+	return 0;
+}
+
+extern "C" int __declspec(dllexport) Unload(void)
+{
+	UnhookEvent(hEventIdleChanged);
+	UnhookEvent(hEventOptInit);
+	UnhookEvent(hEventPreShutdown);
+	UnhookEvent(hEventModulesLoaded);
+
+	DeinitServices();
+	DeinitPopups();
+
+	DeinitNetlib();
+	DeinitIcons();
+
+	OleUninitialize();
+	return 0;
+}
diff --git a/updater/updater.dsp b/updater/updater.dsp
new file mode 100644
index 0000000..b3a247b
--- /dev/null
+++ b/updater/updater.dsp
@@ -0,0 +1,538 @@
+# Microsoft Developer Studio Project File - Name="updater" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
+
+CFG=updater - Win32 Debug Unicode
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "updater.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "updater.mak" CFG="updater - Win32 Debug Unicode"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "updater - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "updater - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "updater - Win32 Release Unicode" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "updater - Win32 Debug Unicode" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+MTL=midl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "updater - Win32 Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "Release"
+# PROP BASE Intermediate_Dir "Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Release"
+# PROP Intermediate_Dir "Release"
+# PROP Ignore_Export_Lib 1
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "UPDATER_EXPORTS" /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O1 /I "../../include" /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "UPDATER_EXPORTS" /FR /YX /FD /c
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0x809 /d "NDEBUG"
+# ADD RSC /l 0xc09 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386
+# ADD LINK32 comctl32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib /nologo /base:"0x22000000" /dll /machine:I386 /out:"../../bin/release/plugins/updater.dll"
+# SUBTRACT LINK32 /nodefaultlib
+
+!ELSEIF  "$(CFG)" == "updater - Win32 Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "Debug"
+# PROP BASE Intermediate_Dir "Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Debug"
+# PROP Intermediate_Dir "Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "UPDATER_EXPORTS" /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /I "../../include" /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "UPDATER_EXPORTS" /FR /YX /FD /GZ /c
+# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0x809 /d "_DEBUG"
+# ADD RSC /l 0xc09 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 comctl32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /out:"../../bin/debug/plugins/updater.dll" /pdbtype:sept
+
+!ELSEIF  "$(CFG)" == "updater - Win32 Release Unicode"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "updater___Win32_Release_Unicode"
+# PROP BASE Intermediate_Dir "updater___Win32_Release_Unicode"
+# PROP BASE Ignore_Export_Lib 1
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "updater___Win32_Release_Unicode"
+# PROP Intermediate_Dir "updater___Win32_Release_Unicode"
+# PROP Ignore_Export_Lib 1
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MT /W3 /GX /O1 /I "../../include" /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "UPDATER_EXPORTS" /FR /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O1 /I "../../include" /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "UPDATER_EXPORTS" /D "_UNICODE" /D "UNICODE" /FR /YX /FD /c
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0xc09 /d "NDEBUG"
+# ADD RSC /l 0xc09 /d "NDEBUG" /d "_UNICODE" /d "UNICODE"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 comctl32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib /nologo /base:"0x22000000" /dll /machine:I386 /out:"../../bin/release/plugins/updater.dll"
+# SUBTRACT BASE LINK32 /nodefaultlib
+# ADD LINK32 comctl32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib /nologo /base:"0x22000000" /dll /machine:I386 /out:"../../bin/Release Unicode/plugins/updater.dll"
+# SUBTRACT LINK32 /nodefaultlib
+
+!ELSEIF  "$(CFG)" == "updater - Win32 Debug Unicode"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "updater___Win32_Debug_Unicode"
+# PROP BASE Intermediate_Dir "updater___Win32_Debug_Unicode"
+# PROP BASE Ignore_Export_Lib 0
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "updater___Win32_Debug_Unicode"
+# PROP Intermediate_Dir "updater___Win32_Debug_Unicode"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /I "../../include" /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "UPDATER_EXPORTS" /FR /YX /FD /GZ /c
+# ADD CPP /nologo /MTd /W3 /Gm /GX /ZI /Od /I "../../include" /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /D "_MBCS" /D "_USRDLL" /D "UPDATER_EXPORTS" /D "_UNICODE" /D "UNICODE" /FR /YX /FD /GZ /c
+# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD BASE RSC /l 0xc09 /d "_DEBUG"
+# ADD RSC /l 0xc09 /d "_DEBUG" /d "_UNICODE" /d "UNICODE"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 comctl32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /out:"../../bin/debug/plugins/updater.dll" /pdbtype:sept
+# ADD LINK32 comctl32.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /out:"../../bin/Debug Unicode/plugins/updater.dll" /pdbtype:sept
+
+!ENDIF 
+
+# Begin Target
+
+# Name "updater - Win32 Release"
+# Name "updater - Win32 Debug"
+# Name "updater - Win32 Release Unicode"
+# Name "updater - Win32 Debug Unicode"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE=.\allocations.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\common.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\conf_comp_dialog.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\conf_dialog.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\extern.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\icons.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\options.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\popups.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\progress_dialog.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\scan.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\services.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\socket.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\str_utils.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\tinystr.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\tinyxml.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\tinyxmlerror.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\tinyxmlparser.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\updater.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\utils.cpp
+# End Source File
+# Begin Source File
+
+SOURCE=.\xmldata.cpp
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# Begin Source File
+
+SOURCE=.\allocations.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\common.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\conf_comp_dialog.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\conf_dialog.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\extern.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\icons.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\m_updater.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\options.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\popups.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\progress_dialog.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\resource.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\scan.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\services.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\socket.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\str_utils.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\tinystr.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\tinyxml.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\updater.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\utils.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\version.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\xmldata.h
+# End Source File
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# Begin Source File
+
+SOURCE=.\ico00001.ico
+# End Source File
+# Begin Source File
+
+SOURCE=.\ico00002.ico
+# End Source File
+# Begin Source File
+
+SOURCE=.\icon1.ico
+# End Source File
+# Begin Source File
+
+SOURCE=.\notick.ico
+# End Source File
+# Begin Source File
+
+SOURCE=.\resource.rc
+# End Source File
+# Begin Source File
+
+SOURCE=.\tick.ico
+# End Source File
+# Begin Source File
+
+SOURCE=.\updater.rc
+# PROP Exclude_From_Build 1
+# End Source File
+# Begin Source File
+
+SOURCE=.\version.rc
+# PROP Exclude_From_Build 1
+# End Source File
+# End Group
+# Begin Group "bzip-1.0.3"
+
+# PROP Default_Filter ""
+# Begin Source File
+
+SOURCE=".\bzip2-1.0.3\blocksort.c"
+# End Source File
+# Begin Source File
+
+SOURCE=".\bzip2-1.0.3\bzlib.c"
+# End Source File
+# Begin Source File
+
+SOURCE=".\bzip2-1.0.3\bzlib.h"
+# End Source File
+# Begin Source File
+
+SOURCE=".\bzip2-1.0.3\bzlib_private.h"
+# End Source File
+# Begin Source File
+
+SOURCE=".\bzip2-1.0.3\compress.c"
+# End Source File
+# Begin Source File
+
+SOURCE=".\bzip2-1.0.3\crctable.c"
+# End Source File
+# Begin Source File
+
+SOURCE=".\bzip2-1.0.3\decompress.c"
+# End Source File
+# Begin Source File
+
+SOURCE=".\bzip2-1.0.3\huffman.c"
+# End Source File
+# Begin Source File
+
+SOURCE=".\bzip2-1.0.3\randtable.c"
+# End Source File
+# End Group
+# Begin Group "zlib123"
+
+# PROP Default_Filter ""
+# Begin Group "contrib"
+
+# PROP Default_Filter ""
+# Begin Group "minizip"
+
+# PROP Default_Filter ""
+# Begin Source File
+
+SOURCE=.\zlib123\contrib\minizip\ioapi.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\contrib\minizip\iowin32.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\contrib\minizip\iowin32.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\contrib\minizip\miniunz.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\contrib\minizip\unzip.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\contrib\minizip\unzip.h
+# End Source File
+# End Group
+# End Group
+# Begin Source File
+
+SOURCE=.\zlib123\adler32.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\compress_zlib.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\crc32.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\crc32.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\deflate.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\deflate.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\gzio.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\infback.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\inffast.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\inffast.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\inffixed.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\inflate.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\inflate.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\inftrees.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\inftrees.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\minigzip.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\contrib\vstudio\readme.txt
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\trees.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\trees.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\uncompr.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\zconf.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\zconf.in.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\zlib.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\zutil.c
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib123\zutil.h
+# End Source File
+# End Group
+# End Target
+# End Project
diff --git a/updater/updater.dsw b/updater/updater.dsw
new file mode 100644
index 0000000..6ad8b35
--- /dev/null
+++ b/updater/updater.dsw
@@ -0,0 +1,29 @@
+Microsoft Developer Studio Workspace File, Format Version 6.00
+# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
+
+###############################################################################
+
+Project: "updater"=".\updater.dsp" - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Global:
+
+Package=<5>
+{{{
+}}}
+
+Package=<3>
+{{{
+}}}
+
+###############################################################################
+
diff --git a/updater/updater.h b/updater/updater.h
new file mode 100644
index 0000000..a0e6c5f
--- /dev/null
+++ b/updater/updater.h
@@ -0,0 +1,15 @@
+#ifndef _UPDATER_INC
+#define _UPDATER_INC
+
+#include "options.h"
+#include "services.h"
+#include "socket.h"
+#include "popups.h"
+#include "version.h"
+#include "icons.h"
+
+#include "m_updater.h"
+
+#define UPDATE_V1_SIZE		48
+
+#endif
diff --git a/updater/updater.mdsp b/updater/updater.mdsp
new file mode 100644
index 0000000..32c104e
--- /dev/null
+++ b/updater/updater.mdsp
@@ -0,0 +1,170 @@
+[Project]
+name=updater
+type=2
+defaultConfig=0
+
+
+[Debug]
+// compiler 
+workingDirectory=
+arguments=
+intermediateFilesDirectory=Debug
+outputFilesDirectory=Debug
+compilerPreprocessor=
+extraCompilerOptions=
+compilerIncludeDirectory=..\..\include
+noWarning=0
+defaultWarning=0
+allWarning=1
+extraWarning=0
+isoWarning=0
+warningsAsErrors=0
+debugType=1
+debugLevel=2
+exceptionEnabled=1
+runtimeTypeEnabled=0
+optimizeLevel=0
+
+// linker
+libraryPath=
+outputFilename=../../bin/debug/plugins/updater.dll
+libraries=ole32,comctl32,ws2_32
+extraLinkerOptions=
+ignoreStartupFile=0
+ignoreDefaultLibs=0
+stripExecutableFile=0
+
+// archive
+extraArchiveOptions=
+
+//resource
+resourcePreprocessor=
+resourceIncludeDirectory=
+extraResourceOptions=-D IDC_STATIC=-1
+
+[Release]
+// compiler 
+workingDirectory=
+arguments=
+intermediateFilesDirectory=Release
+outputFilesDirectory=Release
+compilerPreprocessor=
+extraCompilerOptions=
+compilerIncludeDirectory=..\..\include
+noWarning=0
+defaultWarning=0
+allWarning=1
+extraWarning=0
+isoWarning=0
+warningAsErrors=0
+debugType=0
+debugLevel=1
+exceptionEnabled=1
+runtimeTypeEnabled=0
+optimizeLevel=4
+
+// linker
+libraryPath=
+outputFilename=../../bin/release/plugins/updater.dll
+libraries=ole32,comctl32,ws2_32,stlport.5.0
+extraLinkerOptions=
+ignoreStartupFile=0
+ignoreDefaultLibs=0
+stripExecutableFile=1
+
+// archive
+extraArchiveOptions=
+
+//resource
+resourcePreprocessor=
+resourceIncludeDirectory=
+extraResourceOptions=-D IDC_STATIC=-1
+
+[Source]
+1=allocations.cpp
+2=common.cpp
+3=conf_comp_dialog.cpp
+4=conf_dialog.cpp
+5=extern.cpp
+6=icons.cpp
+7=options.cpp
+8=popups.cpp
+9=progress_dialog.cpp
+10=scan.cpp
+11=services.cpp
+12=socket.cpp
+13=str_utils.cpp
+14=tinystr.cpp
+15=tinyxml.cpp
+16=tinyxmlerror.cpp
+17=tinyxmlparser.cpp
+18=unzip.cpp
+19=updater.cpp
+20=utils.cpp
+21=xmldata.cpp
+22=zlib123\adler32.c
+23=zlib123\compress_zlib.c
+24=zlib123\crc32.c
+25=zlib123\deflate.c
+26=zlib123\gzio.c
+27=zlib123\infback.c
+28=zlib123\inffast.c
+29=zlib123\inflate.c
+30=zlib123\inftrees.c
+31=zlib123\trees.c
+32=zlib123\uncompr.c
+33=zlib123\zutil.c
+34=zlib123\contrib\minizip\ioapi.c
+35=zlib123\contrib\minizip\iowin32.c
+36=zlib123\contrib\minizip\miniunz.c
+37=bzip2-1.0.3\blocksort.c
+38=bzip2-1.0.3\bzlib.c
+39=bzip2-1.0.3\compress.c
+40=bzip2-1.0.3\crctable.c
+41=bzip2-1.0.3\decompress.c
+42=bzip2-1.0.3\huffman.c
+43=bzip2-1.0.3\randtable.c
+44=zlib123\contrib\minizip\munzip.c
+[Header]
+1=IcoLib.h
+2=allocations.h
+3=check.h
+4=common.h
+5=conf_comp_dialog.h
+6=conf_dialog.h
+7=extern.h
+8=icons.h
+9=m_updater.h
+10=options.h
+11=popups.h
+12=progress_dialog.h
+13=resource.h
+14=scan.h
+15=services.h
+16=socket.h
+17=str_utils.h
+18=tinystr.h
+19=tinyxml.h
+20=updater.h
+21=utils.h
+22=version.h
+23=xmldata.h
+24=bzip2-1.0.3\bzlib.h
+25=bzip2-1.0.3\bzlib_private.h
+26=zlib123\crc32.h
+27=zlib123\deflate.h
+28=zlib123\inffast.h
+29=zlib123\inffixed.h
+30=zlib123\inflate.h
+31=zlib123\inftrees.h
+32=zlib123\trees.h
+33=zlib123\zconf.h
+34=zlib123\zlib.h
+35=zlib123\zutil.h
+36=zlib123\contrib\minizip\iowin32.h
+37=zlib123\contrib\minizip\munzip.h
+[Resource]
+1=updater.rc
+2=version.rc
+[Other]
+[History]
diff --git a/updater/updater.rc b/updater/updater.rc
new file mode 100644
index 0000000..660fe9e
--- /dev/null
+++ b/updater/updater.rc
@@ -0,0 +1,238 @@
+// Microsoft Visual C++ generated resource script.
+//
+#include "resource.h"
+
+#define APSTUDIO_READONLY_SYMBOLS
+/////////////////////////////////////////////////////////////////////////////
+//
+// Generated from the TEXTINCLUDE 2 resource.
+//
+#include "afxres.h"
+
+/////////////////////////////////////////////////////////////////////////////
+#undef APSTUDIO_READONLY_SYMBOLS
+
+/////////////////////////////////////////////////////////////////////////////
+// Neutral resources
+
+#if !defined(AFX_RESOURCE_DLL) || defined(AFX_TARG_NEU)
+#ifdef _WIN32
+LANGUAGE LANG_NEUTRAL, SUBLANG_NEUTRAL
+#pragma code_page(1252)
+#endif //_WIN32
+
+/////////////////////////////////////////////////////////////////////////////
+//
+// Dialog
+//
+
+IDD_CONFIRMCOMPONENTS DIALOGEX 0, 0, 226, 225
+STYLE DS_SETFONT | DS_MODALFRAME | DS_FIXEDSYS | WS_POPUP | WS_CAPTION | WS_SYSMENU
+CAPTION "Confirm Files"
+FONT 8, "MS Shell Dlg", 0, 0, 0x0
+BEGIN
+    DEFPUSHBUTTON   "OK",IDOK,60,204,50,14
+    PUSHBUTTON      "Cancel",IDCANCEL,116,204,50,14
+    CONTROL         "List1",IDC_LIST_COMPONENTS,"SysListView32",LVS_REPORT | LVS_SORTASCENDING | WS_BORDER | WS_TABSTOP,15,25,195,152
+    CTEXT           "Uncheck the files that you do not want installed:",IDC_STATIC,0,9,222,12
+    PUSHBUTTON      "Select DLLs",IDC_BTN_SELECTDLLS,145,180,63,14
+    PUSHBUTTON      "Invert Selection",IDC_BTN_SELECTINV,79,180,63,14
+    PUSHBUTTON      "Select All",IDC_BTN_SELECTALL,13,180,63,14
+END
+
+
+/////////////////////////////////////////////////////////////////////////////
+//
+// DESIGNINFO
+//
+
+#ifdef APSTUDIO_INVOKED
+GUIDELINES DESIGNINFO 
+BEGIN
+    IDD_CONFIRMCOMPONENTS, DIALOG
+    BEGIN
+        LEFTMARGIN, 7
+        RIGHTMARGIN, 219
+        TOPMARGIN, 7
+        BOTTOMMARGIN, 218
+    END
+END
+#endif    // APSTUDIO_INVOKED
+
+#endif    // Neutral resources
+/////////////////////////////////////////////////////////////////////////////
+
+
+/////////////////////////////////////////////////////////////////////////////
+// English (Australia) resources
+
+#if !defined(AFX_RESOURCE_DLL) || defined(AFX_TARG_ENA)
+#ifdef _WIN32
+LANGUAGE LANG_ENGLISH, SUBLANG_ENGLISH_AUS
+#pragma code_page(1252)
+#endif //_WIN32
+
+/////////////////////////////////////////////////////////////////////////////
+//
+// Dialog
+//
+
+IDD_OPT1 DIALOGEX 0, 0, 293, 228
+STYLE DS_SETFONT | DS_FIXEDSYS | WS_CHILD
+FONT 8, "MS Shell Dlg", 0, 0, 0x0
+BEGIN
+    CONTROL         "Check for updates on startup",IDC_CHK_ONSTART,"Button",BS_AUTOCHECKBOX | WS_TABSTOP,11,105,138,10
+    PUSHBUTTON      "Check for updates",IDC_BTN_CHECK,156,211,91,17
+    CONTROL         "List1",IDC_LST_REGISTERED,"SysListView32",LVS_REPORT | LVS_SINGLESEL | LVS_SORTASCENDING | WS_BORDER | WS_TABSTOP,0,0,293,79
+    CONTROL         "(But only once per day)",IDC_CHK_ONCE,"Button",BS_AUTOCHECKBOX | WS_TABSTOP,18,118,128,10
+    CONTROL         "Check daily",IDC_CHK_DAILY,"Button",BS_AUTOCHECKBOX | WS_TABSTOP,11,131,136,10
+    CONTROL         "Install without confirmation if idle",IDC_CHK_NOCONFIDLE,
+                    "Button",BS_AUTOCHECKBOX | WS_TABSTOP,18,144,128,10
+    CONTROL         "Backup updated files",IDC_CHK_BACKUP,"Button",BS_AUTOCHECKBOX | WS_TABSTOP,151,105,127,10
+    GROUPBOX        "General Settings",IDC_STATIC,0,81,293,93
+    GROUPBOX        "Global Status Control",IDC_STATIC,0,178,293,30
+    CONTROL         "Start offline, restore after update check",IDC_CHK_STARTOFFLINE,
+                    "Button",BS_AUTOCHECKBOX | WS_TABSTOP,11,191,215,10
+    CONTROL         "Use popups for progress info",IDC_CHK_POPUP,"Button",BS_AUTOCHECKBOX | WS_TABSTOP,151,118,127,10
+    CONTROL         "Show 'Restart' menu item",IDC_CHK_RESTART,"Button",BS_AUTOCHECKBOX | WS_TABSTOP,151,131,127,10
+    PUSHBUTTON      "Update and Exit",IDC_BTN_CHECKNORESTART,58,211,91,17
+    CONTROL         "Show 'Update and Exit' menu item",IDC_CHK_UPDATEANDEXIT,
+                    "Button",BS_AUTOCHECKBOX | WS_TABSTOP,151,144,127,10
+    CONTROL         "Slider1",IDC_SLID_VERREQ,"msctls_trackbar32",TBS_BOTH | TBS_NOTICKS | WS_TABSTOP,14,91,100,12
+    LTEXT           "Static",IDC_ST_VERREQ,130,93,146,8
+    CONTROL         "Keep downloaded archives",IDC_CHK_SAVEZIPS,"Button",BS_AUTOCHECKBOX | WS_TABSTOP,151,157,127,10
+    CONTROL         "Only install DLLs automatically",IDC_CHK_DLLSONLY,
+                    "Button",BS_AUTOCHECKBOX | WS_TABSTOP,18,157,128,10
+END
+
+IDD_CONFIRMUPDATES DIALOGEX 0, 0, 241, 209
+STYLE DS_SETFONT | DS_MODALFRAME | DS_SETFOREGROUND | DS_FIXEDSYS | DS_CENTER | WS_MINIMIZEBOX | WS_POPUP | WS_CAPTION | WS_SYSMENU
+CAPTION "Confirm Updates"
+FONT 8, "MS Shell Dlg", 0, 0, 0x0
+BEGIN
+    DEFPUSHBUTTON   "Update",IDOK,70,188,50,14
+    PUSHBUTTON      "Cancel",IDCANCEL,128,188,50,14
+    CTEXT           "Updates are available for the following components:",IDC_STATIC,9,9,222,12
+    CONTROL         "List1",IDC_LIST_UPDATES,"SysListView32",LVS_REPORT | LVS_SINGLESEL | LVS_SORTASCENDING | WS_BORDER | WS_TABSTOP,13,26,213,116
+    GROUPBOX        "",IDC_STATIC,13,144,214,39
+    CONTROL         "Confirm install for individual files",IDC_CHK_CONFALL,
+                    "Button",BS_AUTOCHECKBOX | WS_TABSTOP,21,153,143,10
+    CONTROL         "Download but do not install",IDC_CHK_NOINSTALL,"Button",BS_AUTOCHECKBOX | WS_TABSTOP,21,166,143,10
+    DEFPUSHBUTTON   "Changelog",IDC_BTN_CHANGELOG,169,159,53,14,WS_DISABLED | NOT WS_TABSTOP
+END
+
+IDD_PROGRESS DIALOGEX 0, 0, 187, 47
+STYLE DS_SETFONT | DS_MODALFRAME | DS_FIXEDSYS | DS_CENTER | WS_MINIMIZEBOX | WS_POPUP | WS_CAPTION | WS_SYSMENU
+CAPTION "Progress"
+FONT 8, "MS Shell Dlg", 0, 0, 0x1
+BEGIN
+    CONTROL         "Progress1",IDC_PROGRESS,"msctls_progress32",WS_BORDER,7,21,173,19,WS_EX_STATICEDGE
+    LTEXT           "Initialising...",IDC_PROGMSG,9,7,171,8
+END
+
+IDD_OPT2 DIALOGEX 0, 0, 281, 225
+STYLE DS_SETFONT | DS_FIXEDSYS | WS_CHILD
+FONT 8, "MS Shell Dlg", 0, 0, 0x0
+BEGIN
+    LTEXT           "Updates:",IDC_STATIC,14,58,129,8
+    LTEXT           "Data:",IDC_STATIC,14,102,129,8
+    LTEXT           "Backups:",IDC_STATIC,14,136,129,8
+    EDITTEXT        IDC_ED_UPDATES,26,73,185,14,ES_AUTOHSCROLL
+    EDITTEXT        IDC_ED_DATA,26,117,185,14,ES_AUTOHSCROLL
+    EDITTEXT        IDC_ED_BACKUPS,26,150,185,14,ES_AUTOHSCROLL
+    PUSHBUTTON      "Browse...",IDC_BTN_BRUPDATES,217,73,50,14
+    PUSHBUTTON      "Browse...",IDC_BTN_BRDATA,217,117,50,14
+    PUSHBUTTON      "Browse...",IDC_BTN_BRBACKUPS,217,150,50,14
+    LTEXT           "WARNING: Updater will move or delete everything in the 'Updates' folder when installing - so do not point it at anything important (e.g. your plugins folder) or put anything other than updates in there!",IDC_STATIC,25,19,234,34
+    EDITTEXT        IDC_ED_ZIPS,25,191,185,14,ES_AUTOHSCROLL
+    PUSHBUTTON      "Browse...",IDC_BTN_BRZIPS,215,191,50,14
+    LTEXT           "Saved archives:",IDC_STATIC,14,178,129,8
+END
+
+
+/////////////////////////////////////////////////////////////////////////////
+//
+// DESIGNINFO
+//
+
+#ifdef APSTUDIO_INVOKED
+GUIDELINES DESIGNINFO 
+BEGIN
+    IDD_CONFIRMUPDATES, DIALOG
+    BEGIN
+        LEFTMARGIN, 7
+        RIGHTMARGIN, 234
+        TOPMARGIN, 7
+        BOTTOMMARGIN, 202
+    END
+
+    IDD_PROGRESS, DIALOG
+    BEGIN
+        LEFTMARGIN, 7
+        RIGHTMARGIN, 180
+        TOPMARGIN, 7
+        BOTTOMMARGIN, 40
+    END
+
+    IDD_OPT2, DIALOG
+    BEGIN
+        LEFTMARGIN, 7
+        RIGHTMARGIN, 274
+        TOPMARGIN, 7
+        BOTTOMMARGIN, 218
+    END
+END
+#endif    // APSTUDIO_INVOKED
+
+
+#ifdef APSTUDIO_INVOKED
+/////////////////////////////////////////////////////////////////////////////
+//
+// TEXTINCLUDE
+//
+
+1 TEXTINCLUDE 
+BEGIN
+    "resource.h\0"
+END
+
+2 TEXTINCLUDE 
+BEGIN
+    "#include ""afxres.h""\r\n"
+    "\0"
+END
+
+3 TEXTINCLUDE 
+BEGIN
+    "\r\n"
+    "\0"
+END
+
+#endif    // APSTUDIO_INVOKED
+
+
+/////////////////////////////////////////////////////////////////////////////
+//
+// Icon
+//
+
+// Icon with lowest ID value placed first to ensure application icon
+// remains consistent on all systems.
+IDI_MAINMENU            ICON                    "u.ico"
+IDI_RESTART             ICON                    "restart.ico"
+IDI_UPDATEANDEXIT       ICON                    "ue.ico"
+#endif    // English (Australia) resources
+/////////////////////////////////////////////////////////////////////////////
+
+
+
+#ifndef APSTUDIO_INVOKED
+/////////////////////////////////////////////////////////////////////////////
+//
+// Generated from the TEXTINCLUDE 3 resource.
+//
+
+
+/////////////////////////////////////////////////////////////////////////////
+#endif    // not APSTUDIO_INVOKED
+
diff --git a/updater/updater.sln b/updater/updater.sln
new file mode 100644
index 0000000..5ea0410
--- /dev/null
+++ b/updater/updater.sln
@@ -0,0 +1,25 @@
+Microsoft Visual Studio Solution File, Format Version 9.00
+# Visual Studio 2005
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "updater", "updater.vcproj", "{4C1CE389-7129-45FC-83C2-E9C310AC0427}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug Unicode|Win32 = Debug Unicode|Win32
+		Debug|Win32 = Debug|Win32
+		Release Unicode|Win32 = Release Unicode|Win32
+		Release|Win32 = Release|Win32
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{4C1CE389-7129-45FC-83C2-E9C310AC0427}.Debug Unicode|Win32.ActiveCfg = Debug Unicode|Win32
+		{4C1CE389-7129-45FC-83C2-E9C310AC0427}.Debug Unicode|Win32.Build.0 = Debug Unicode|Win32
+		{4C1CE389-7129-45FC-83C2-E9C310AC0427}.Debug|Win32.ActiveCfg = Debug|Win32
+		{4C1CE389-7129-45FC-83C2-E9C310AC0427}.Debug|Win32.Build.0 = Debug|Win32
+		{4C1CE389-7129-45FC-83C2-E9C310AC0427}.Release Unicode|Win32.ActiveCfg = Release Unicode|Win32
+		{4C1CE389-7129-45FC-83C2-E9C310AC0427}.Release Unicode|Win32.Build.0 = Release Unicode|Win32
+		{4C1CE389-7129-45FC-83C2-E9C310AC0427}.Release|Win32.ActiveCfg = Release|Win32
+		{4C1CE389-7129-45FC-83C2-E9C310AC0427}.Release|Win32.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/updater/updater.vcproj b/updater/updater.vcproj
new file mode 100644
index 0000000..8283b49
--- /dev/null
+++ b/updater/updater.vcproj
@@ -0,0 +1,2665 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8.00"
+	Name="updater"
+	ProjectGUID="{4C1CE389-7129-45FC-83C2-E9C310AC0427}"
+	RootNamespace="updater"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug Unicode|Win32"
+			OutputDirectory=".\updater___Win32_Debug_Unicode"
+			IntermediateDirectory=".\updater___Win32_Debug_Unicode"
+			ConfigurationType="2"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			CharacterSet="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="_DEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="1"
+				TypeLibraryName=".\updater___Win32_Debug_Unicode/updater.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="zlib123;../../include"
+				PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				UsePrecompiledHeader="2"
+				PrecompiledHeaderThrough="common.h"
+				AssemblerListingLocation=".\updater___Win32_Debug_Unicode/"
+				ObjectFile=".\updater___Win32_Debug_Unicode/"
+				ProgramDataBaseFileName=".\updater___Win32_Debug_Unicode/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				DebugInformationFormat="4"
+				CompileAs="0"
+				DisableSpecificWarnings="4996"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG,_UNICODE,UNICODE"
+				Culture="3081"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalOptions="/MACHINE:I386"
+				AdditionalDependencies="comctl32.lib ws2_32.lib"
+				OutputFile="../../bin/Debug Unicode/plugins/updater.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile=".\updater___Win32_Debug_Unicode/updater.pdb"
+				GenerateMapFile="true"
+				MapExports="true"
+				ImportLibrary="$(IntDir)/$(TargetName).lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory=".\Debug"
+			IntermediateDirectory=".\Debug"
+			ConfigurationType="2"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="_DEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="1"
+				TypeLibraryName=".\Debug/updater.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="zlib123;../../include"
+				PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				UsePrecompiledHeader="2"
+				PrecompiledHeaderThrough="common.h"
+				AssemblerListingLocation=".\Debug/"
+				ObjectFile=".\Debug/"
+				ProgramDataBaseFileName=".\Debug/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				DebugInformationFormat="4"
+				CompileAs="0"
+				DisableSpecificWarnings="4996"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+				Culture="3081"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalOptions="/MACHINE:I386"
+				AdditionalDependencies="comctl32.lib ws2_32.lib"
+				OutputFile="../../bin/debug/plugins/updater.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile=".\Debug/updater.pdb"
+				GenerateMapFile="true"
+				MapExports="true"
+				SubSystem="0"
+				ImportLibrary="$(IntDir)/$(TargetName).lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release Unicode|Win32"
+			OutputDirectory=".\updater___Win32_Release_Unicode"
+			IntermediateDirectory=".\updater___Win32_Release_Unicode"
+			ConfigurationType="2"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			CharacterSet="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="1"
+				TypeLibraryName=".\updater___Win32_Release_Unicode/updater.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="zlib123;../../include"
+				PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE"
+				StringPooling="true"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="2"
+				PrecompiledHeaderThrough="common.h"
+				AssemblerListingLocation=".\updater___Win32_Release_Unicode/"
+				ObjectFile=".\updater___Win32_Release_Unicode/"
+				ProgramDataBaseFileName=".\updater___Win32_Release_Unicode/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				CompileAs="0"
+				DisableSpecificWarnings="4996"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG,_UNICODE,UNICODE"
+				Culture="3081"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				IgnoreImportLibrary="true"
+				AdditionalOptions="/MACHINE:I386"
+				AdditionalDependencies="comctl32.lib ws2_32.lib"
+				OutputFile="../../bin/Release Unicode/plugins/updater.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				ProgramDatabaseFile=".\updater___Win32_Release_Unicode/updater.pdb"
+				BaseAddress="0x22000000"
+				ImportLibrary="$(IntDir)/$(TargetName).lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory=".\Release"
+			IntermediateDirectory=".\Release"
+			ConfigurationType="2"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="1"
+				TypeLibraryName=".\Release/updater.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="zlib123;../../include"
+				PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS"
+				StringPooling="true"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="2"
+				PrecompiledHeaderThrough="common.h"
+				AssemblerListingLocation=".\Release/"
+				ObjectFile=".\Release/"
+				ProgramDataBaseFileName=".\Release/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				DebugInformationFormat="0"
+				CompileAs="0"
+				DisableSpecificWarnings="4996"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="3081"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				IgnoreImportLibrary="true"
+				AdditionalOptions="/MACHINE:I386"
+				AdditionalDependencies="comctl32.lib ws2_32.lib"
+				OutputFile="../../bin/release/plugins/updater.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				ProgramDatabaseFile=".\Release/updater.pdb"
+				BaseAddress="0x22000000"
+				ImportLibrary="$(IntDir)/$(TargetName).lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+			>
+			<File
+				RelativePath="allocations.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="common.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="conf_comp_dialog.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="conf_dialog.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="extern.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="icons.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="options.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="popups.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="progress_dialog.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="scan.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="services.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="socket.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="str_utils.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="updater.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="1"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="1"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="1"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="1"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="utils.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="xmldata.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl"
+			>
+			<File
+				RelativePath="allocations.h"
+				>
+			</File>
+			<File
+				RelativePath="common.h"
+				>
+			</File>
+			<File
+				RelativePath="conf_comp_dialog.h"
+				>
+			</File>
+			<File
+				RelativePath="conf_dialog.h"
+				>
+			</File>
+			<File
+				RelativePath="extern.h"
+				>
+			</File>
+			<File
+				RelativePath="icons.h"
+				>
+			</File>
+			<File
+				RelativePath="m_updater.h"
+				>
+			</File>
+			<File
+				RelativePath="options.h"
+				>
+			</File>
+			<File
+				RelativePath="popups.h"
+				>
+			</File>
+			<File
+				RelativePath="progress_dialog.h"
+				>
+			</File>
+			<File
+				RelativePath="resource.h"
+				>
+			</File>
+			<File
+				RelativePath="scan.h"
+				>
+			</File>
+			<File
+				RelativePath="services.h"
+				>
+			</File>
+			<File
+				RelativePath="socket.h"
+				>
+			</File>
+			<File
+				RelativePath="str_utils.h"
+				>
+			</File>
+			<File
+				RelativePath="tinystr.h"
+				>
+			</File>
+			<File
+				RelativePath="tinyxml.h"
+				>
+			</File>
+			<File
+				RelativePath="updater.h"
+				>
+			</File>
+			<File
+				RelativePath="utils.h"
+				>
+			</File>
+			<File
+				RelativePath="version.h"
+				>
+			</File>
+			<File
+				RelativePath="xmldata.h"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+			>
+			<File
+				RelativePath="ico00001.ico"
+				>
+			</File>
+			<File
+				RelativePath="ico00002.ico"
+				>
+			</File>
+			<File
+				RelativePath="icon1.ico"
+				>
+			</File>
+			<File
+				RelativePath="notick.ico"
+				>
+			</File>
+			<File
+				RelativePath="resource.rc"
+				>
+			</File>
+			<File
+				RelativePath=".\restart.ico"
+				>
+			</File>
+			<File
+				RelativePath="tick.ico"
+				>
+			</File>
+			<File
+				RelativePath=".\u.ico"
+				>
+			</File>
+			<File
+				RelativePath=".\ue.ico"
+				>
+			</File>
+			<File
+				RelativePath="updater.rc"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCResourceCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCResourceCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCResourceCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCResourceCompilerTool"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="version.rc"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCResourceCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCResourceCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCResourceCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCResourceCompilerTool"
+					/>
+				</FileConfiguration>
+			</File>
+		</Filter>
+		<Filter
+			Name="zlib123"
+			>
+			<File
+				RelativePath="zlib123\adler32.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\compress_zlib.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\crc32.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\crc32.h"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\deflate.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\deflate.h"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\gzio.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\infback.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\inffast.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\inffast.h"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\inffixed.h"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\inflate.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\inflate.h"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\inftrees.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\inftrees.h"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\minigzip.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\contrib\vstudio\readme.txt"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\trees.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\trees.h"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\uncompr.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\zconf.h"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\zconf.in.h"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\zlib.h"
+				>
+			</File>
+			<File
+				RelativePath="zlib123\zutil.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="zlib123\zutil.h"
+				>
+			</File>
+			<Filter
+				Name="contrib"
+				>
+				<Filter
+					Name="minizip"
+					>
+					<File
+						RelativePath="zlib123\contrib\minizip\ioapi.c"
+						>
+						<FileConfiguration
+							Name="Debug Unicode|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+								BasicRuntimeChecks="3"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Debug|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+								BasicRuntimeChecks="3"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Unicode|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="zlib123\contrib\minizip\iowin32.c"
+						>
+						<FileConfiguration
+							Name="Debug Unicode|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+								BasicRuntimeChecks="3"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Debug|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+								BasicRuntimeChecks="3"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Unicode|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="zlib123\contrib\minizip\iowin32.h"
+						>
+					</File>
+					<File
+						RelativePath="zlib123\contrib\minizip\miniunz.c"
+						>
+						<FileConfiguration
+							Name="Debug Unicode|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+								BasicRuntimeChecks="3"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Debug|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+								BasicRuntimeChecks="3"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Unicode|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+								UsePrecompiledHeader="0"
+								BrowseInformation="1"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="zlib123\contrib\minizip\munzip.c"
+						>
+						<FileConfiguration
+							Name="Debug Unicode|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								UsePrecompiledHeader="0"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Debug|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								UsePrecompiledHeader="0"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Unicode|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								UsePrecompiledHeader="0"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								UsePrecompiledHeader="0"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="zlib123\contrib\minizip\munzip.h"
+						>
+					</File>
+				</Filter>
+			</Filter>
+		</Filter>
+		<Filter
+			Name="bzip-1.0.3"
+			>
+			<File
+				RelativePath="bzip2-1.0.3\blocksort.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="bzip2-1.0.3\bzlib.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="bzip2-1.0.3\bzlib.h"
+				>
+			</File>
+			<File
+				RelativePath="bzip2-1.0.3\bzlib_private.h"
+				>
+			</File>
+			<File
+				RelativePath="bzip2-1.0.3\compress.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="bzip2-1.0.3\crctable.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="bzip2-1.0.3\decompress.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="bzip2-1.0.3\huffman.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="bzip2-1.0.3\randtable.c"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+		</Filter>
+		<Filter
+			Name="tinyxml"
+			>
+			<File
+				RelativePath="tinystr.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="tinyxml.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="tinyxmlerror.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="tinyxmlparser.cpp"
+				>
+				<FileConfiguration
+					Name="Debug Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						BasicRuntimeChecks="3"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release Unicode|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_MBCS;_USRDLL;UPDATER_EXPORTS;UNICODE;_UNICODE;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS;_USRDLL;UPDATER_EXPORTS;_MBCS;$(NoInherit)"
+						UsePrecompiledHeader="0"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/updater___Win32_Debug_Unicode/BuildLog.htm b/updater/updater___Win32_Debug_Unicode/BuildLog.htm
new file mode 100644
index 0000000..f00b514
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/BuildLog.htm
diff --git a/updater/updater___Win32_Debug_Unicode/adler32.obj b/updater/updater___Win32_Debug_Unicode/adler32.obj
new file mode 100644
index 0000000..d17ae6d
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/adler32.obj
diff --git a/updater/updater___Win32_Debug_Unicode/adler32.sbr b/updater/updater___Win32_Debug_Unicode/adler32.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/adler32.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/allocations.obj b/updater/updater___Win32_Debug_Unicode/allocations.obj
new file mode 100644
index 0000000..8e2c303
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/allocations.obj
diff --git a/updater/updater___Win32_Debug_Unicode/allocations.sbr b/updater/updater___Win32_Debug_Unicode/allocations.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/allocations.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/blocksort.obj b/updater/updater___Win32_Debug_Unicode/blocksort.obj
new file mode 100644
index 0000000..ba241c2
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/blocksort.obj
diff --git a/updater/updater___Win32_Debug_Unicode/blocksort.sbr b/updater/updater___Win32_Debug_Unicode/blocksort.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/blocksort.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/bzlib.obj b/updater/updater___Win32_Debug_Unicode/bzlib.obj
new file mode 100644
index 0000000..de0d8db
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/bzlib.obj
diff --git a/updater/updater___Win32_Debug_Unicode/bzlib.sbr b/updater/updater___Win32_Debug_Unicode/bzlib.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/bzlib.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/common.obj b/updater/updater___Win32_Debug_Unicode/common.obj
new file mode 100644
index 0000000..a99a100
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/common.obj
diff --git a/updater/updater___Win32_Debug_Unicode/common.sbr b/updater/updater___Win32_Debug_Unicode/common.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/common.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/compress.obj b/updater/updater___Win32_Debug_Unicode/compress.obj
new file mode 100644
index 0000000..8dbf4d5
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/compress.obj
diff --git a/updater/updater___Win32_Debug_Unicode/compress.sbr b/updater/updater___Win32_Debug_Unicode/compress.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/compress.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/compress_zlib.obj b/updater/updater___Win32_Debug_Unicode/compress_zlib.obj
new file mode 100644
index 0000000..6ea61a9
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/compress_zlib.obj
diff --git a/updater/updater___Win32_Debug_Unicode/compress_zlib.sbr b/updater/updater___Win32_Debug_Unicode/compress_zlib.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/compress_zlib.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/conf_comp_dialog.obj b/updater/updater___Win32_Debug_Unicode/conf_comp_dialog.obj
new file mode 100644
index 0000000..ed5ddca
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/conf_comp_dialog.obj
diff --git a/updater/updater___Win32_Debug_Unicode/conf_comp_dialog.sbr b/updater/updater___Win32_Debug_Unicode/conf_comp_dialog.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/conf_comp_dialog.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/conf_dialog.obj b/updater/updater___Win32_Debug_Unicode/conf_dialog.obj
new file mode 100644
index 0000000..7708e4d
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/conf_dialog.obj
diff --git a/updater/updater___Win32_Debug_Unicode/conf_dialog.sbr b/updater/updater___Win32_Debug_Unicode/conf_dialog.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/conf_dialog.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/crc32.obj b/updater/updater___Win32_Debug_Unicode/crc32.obj
new file mode 100644
index 0000000..341e064
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/crc32.obj
diff --git a/updater/updater___Win32_Debug_Unicode/crc32.sbr b/updater/updater___Win32_Debug_Unicode/crc32.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/crc32.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/crctable.obj b/updater/updater___Win32_Debug_Unicode/crctable.obj
new file mode 100644
index 0000000..cb73f03
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/crctable.obj
diff --git a/updater/updater___Win32_Debug_Unicode/crctable.sbr b/updater/updater___Win32_Debug_Unicode/crctable.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/crctable.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/decompress.obj b/updater/updater___Win32_Debug_Unicode/decompress.obj
new file mode 100644
index 0000000..339ecf0
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/decompress.obj
diff --git a/updater/updater___Win32_Debug_Unicode/decompress.sbr b/updater/updater___Win32_Debug_Unicode/decompress.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/decompress.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/deflate.obj b/updater/updater___Win32_Debug_Unicode/deflate.obj
new file mode 100644
index 0000000..af52dde
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/deflate.obj
diff --git a/updater/updater___Win32_Debug_Unicode/deflate.sbr b/updater/updater___Win32_Debug_Unicode/deflate.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/deflate.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/extern.obj b/updater/updater___Win32_Debug_Unicode/extern.obj
new file mode 100644
index 0000000..42b0a38
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/extern.obj
diff --git a/updater/updater___Win32_Debug_Unicode/extern.sbr b/updater/updater___Win32_Debug_Unicode/extern.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/extern.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/gzio.obj b/updater/updater___Win32_Debug_Unicode/gzio.obj
new file mode 100644
index 0000000..e306369
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/gzio.obj
diff --git a/updater/updater___Win32_Debug_Unicode/gzio.sbr b/updater/updater___Win32_Debug_Unicode/gzio.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/gzio.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/huffman.obj b/updater/updater___Win32_Debug_Unicode/huffman.obj
new file mode 100644
index 0000000..dd74cce
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/huffman.obj
diff --git a/updater/updater___Win32_Debug_Unicode/huffman.sbr b/updater/updater___Win32_Debug_Unicode/huffman.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/huffman.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/icons.obj b/updater/updater___Win32_Debug_Unicode/icons.obj
new file mode 100644
index 0000000..e53f287
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/icons.obj
diff --git a/updater/updater___Win32_Debug_Unicode/icons.sbr b/updater/updater___Win32_Debug_Unicode/icons.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/icons.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/infback.obj b/updater/updater___Win32_Debug_Unicode/infback.obj
new file mode 100644
index 0000000..7e888cd
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/infback.obj
diff --git a/updater/updater___Win32_Debug_Unicode/infback.sbr b/updater/updater___Win32_Debug_Unicode/infback.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/infback.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/inffast.obj b/updater/updater___Win32_Debug_Unicode/inffast.obj
new file mode 100644
index 0000000..3a80329
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/inffast.obj
diff --git a/updater/updater___Win32_Debug_Unicode/inffast.sbr b/updater/updater___Win32_Debug_Unicode/inffast.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/inffast.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/inflate.obj b/updater/updater___Win32_Debug_Unicode/inflate.obj
new file mode 100644
index 0000000..32d0a6a
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/inflate.obj
diff --git a/updater/updater___Win32_Debug_Unicode/inflate.sbr b/updater/updater___Win32_Debug_Unicode/inflate.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/inflate.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/inftrees.obj b/updater/updater___Win32_Debug_Unicode/inftrees.obj
new file mode 100644
index 0000000..7dbf51b
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/inftrees.obj
diff --git a/updater/updater___Win32_Debug_Unicode/inftrees.sbr b/updater/updater___Win32_Debug_Unicode/inftrees.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/inftrees.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/ioapi.obj b/updater/updater___Win32_Debug_Unicode/ioapi.obj
new file mode 100644
index 0000000..f434e2a
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/ioapi.obj
diff --git a/updater/updater___Win32_Debug_Unicode/ioapi.sbr b/updater/updater___Win32_Debug_Unicode/ioapi.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/ioapi.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/iowin32.obj b/updater/updater___Win32_Debug_Unicode/iowin32.obj
new file mode 100644
index 0000000..0ea94dc
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/iowin32.obj
diff --git a/updater/updater___Win32_Debug_Unicode/iowin32.sbr b/updater/updater___Win32_Debug_Unicode/iowin32.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/iowin32.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/minigzip.obj b/updater/updater___Win32_Debug_Unicode/minigzip.obj
new file mode 100644
index 0000000..82c74f9
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/minigzip.obj
diff --git a/updater/updater___Win32_Debug_Unicode/minigzip.sbr b/updater/updater___Win32_Debug_Unicode/minigzip.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/minigzip.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/miniunz.obj b/updater/updater___Win32_Debug_Unicode/miniunz.obj
new file mode 100644
index 0000000..31e8a96
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/miniunz.obj
diff --git a/updater/updater___Win32_Debug_Unicode/miniunz.sbr b/updater/updater___Win32_Debug_Unicode/miniunz.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/miniunz.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/mt.dep b/updater/updater___Win32_Debug_Unicode/mt.dep
new file mode 100644
index 0000000..f623c16
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/mt.dep
@@ -0,0 +1 @@
+Manifest resource last updated at 23:36:56.00 on Tue 31/10/2006 
diff --git a/updater/updater___Win32_Debug_Unicode/munzip.obj b/updater/updater___Win32_Debug_Unicode/munzip.obj
new file mode 100644
index 0000000..34bf782
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/munzip.obj
diff --git a/updater/updater___Win32_Debug_Unicode/munzip.sbr b/updater/updater___Win32_Debug_Unicode/munzip.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/munzip.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/options.obj b/updater/updater___Win32_Debug_Unicode/options.obj
new file mode 100644
index 0000000..5dd0392
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/options.obj
diff --git a/updater/updater___Win32_Debug_Unicode/options.sbr b/updater/updater___Win32_Debug_Unicode/options.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/options.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/popups.obj b/updater/updater___Win32_Debug_Unicode/popups.obj
new file mode 100644
index 0000000..da79dbb
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/popups.obj
diff --git a/updater/updater___Win32_Debug_Unicode/popups.sbr b/updater/updater___Win32_Debug_Unicode/popups.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/popups.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/progress_dialog.obj b/updater/updater___Win32_Debug_Unicode/progress_dialog.obj
new file mode 100644
index 0000000..f466322
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/progress_dialog.obj
diff --git a/updater/updater___Win32_Debug_Unicode/progress_dialog.sbr b/updater/updater___Win32_Debug_Unicode/progress_dialog.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/progress_dialog.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/randtable.obj b/updater/updater___Win32_Debug_Unicode/randtable.obj
new file mode 100644
index 0000000..3296749
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/randtable.obj
diff --git a/updater/updater___Win32_Debug_Unicode/randtable.sbr b/updater/updater___Win32_Debug_Unicode/randtable.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/randtable.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/resource.res b/updater/updater___Win32_Debug_Unicode/resource.res
new file mode 100644
index 0000000..1833aa0
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/resource.res
diff --git a/updater/updater___Win32_Debug_Unicode/scan.obj b/updater/updater___Win32_Debug_Unicode/scan.obj
new file mode 100644
index 0000000..bf97759
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/scan.obj
diff --git a/updater/updater___Win32_Debug_Unicode/scan.sbr b/updater/updater___Win32_Debug_Unicode/scan.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/scan.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/services.obj b/updater/updater___Win32_Debug_Unicode/services.obj
new file mode 100644
index 0000000..d69b158
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/services.obj
diff --git a/updater/updater___Win32_Debug_Unicode/services.sbr b/updater/updater___Win32_Debug_Unicode/services.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/services.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/socket.obj b/updater/updater___Win32_Debug_Unicode/socket.obj
new file mode 100644
index 0000000..c0608c7
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/socket.obj
diff --git a/updater/updater___Win32_Debug_Unicode/socket.sbr b/updater/updater___Win32_Debug_Unicode/socket.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/socket.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/str_utils.obj b/updater/updater___Win32_Debug_Unicode/str_utils.obj
new file mode 100644
index 0000000..50b59b7
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/str_utils.obj
diff --git a/updater/updater___Win32_Debug_Unicode/str_utils.sbr b/updater/updater___Win32_Debug_Unicode/str_utils.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/str_utils.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/tinystr.obj b/updater/updater___Win32_Debug_Unicode/tinystr.obj
new file mode 100644
index 0000000..820cdb9
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/tinystr.obj
diff --git a/updater/updater___Win32_Debug_Unicode/tinystr.sbr b/updater/updater___Win32_Debug_Unicode/tinystr.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/tinystr.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/tinyxml.obj b/updater/updater___Win32_Debug_Unicode/tinyxml.obj
new file mode 100644
index 0000000..8a82b50
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/tinyxml.obj
diff --git a/updater/updater___Win32_Debug_Unicode/tinyxml.sbr b/updater/updater___Win32_Debug_Unicode/tinyxml.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/tinyxml.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/tinyxmlerror.obj b/updater/updater___Win32_Debug_Unicode/tinyxmlerror.obj
new file mode 100644
index 0000000..a807821
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/tinyxmlerror.obj
diff --git a/updater/updater___Win32_Debug_Unicode/tinyxmlerror.sbr b/updater/updater___Win32_Debug_Unicode/tinyxmlerror.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/tinyxmlerror.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/tinyxmlparser.obj b/updater/updater___Win32_Debug_Unicode/tinyxmlparser.obj
new file mode 100644
index 0000000..12fe6b8
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/tinyxmlparser.obj
diff --git a/updater/updater___Win32_Debug_Unicode/tinyxmlparser.sbr b/updater/updater___Win32_Debug_Unicode/tinyxmlparser.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/tinyxmlparser.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/trees.obj b/updater/updater___Win32_Debug_Unicode/trees.obj
new file mode 100644
index 0000000..729dc74
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/trees.obj
diff --git a/updater/updater___Win32_Debug_Unicode/trees.sbr b/updater/updater___Win32_Debug_Unicode/trees.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/trees.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/uncompr.obj b/updater/updater___Win32_Debug_Unicode/uncompr.obj
new file mode 100644
index 0000000..b1ebd1b
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/uncompr.obj
diff --git a/updater/updater___Win32_Debug_Unicode/uncompr.sbr b/updater/updater___Win32_Debug_Unicode/uncompr.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/uncompr.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/updater.bsc b/updater/updater___Win32_Debug_Unicode/updater.bsc
new file mode 100644
index 0000000..95bd8c7
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/updater.bsc
diff --git a/updater/updater___Win32_Debug_Unicode/updater.dll.intermediate.manifest b/updater/updater___Win32_Debug_Unicode/updater.dll.intermediate.manifest
new file mode 100644
index 0000000..cdaa604
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/updater.dll.intermediate.manifest
@@ -0,0 +1,3 @@
+<?xml version='1.0' encoding='UTF-8' standalone='yes'?>
+<assembly xmlns='urn:schemas-microsoft-com:asm.v1' manifestVersion='1.0'>
+</assembly>
diff --git a/updater/updater___Win32_Debug_Unicode/updater.exp b/updater/updater___Win32_Debug_Unicode/updater.exp
new file mode 100644
index 0000000..02e65ca
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/updater.exp
diff --git a/updater/updater___Win32_Debug_Unicode/updater.lib b/updater/updater___Win32_Debug_Unicode/updater.lib
new file mode 100644
index 0000000..927f4f8
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/updater.lib
diff --git a/updater/updater___Win32_Debug_Unicode/updater.obj b/updater/updater___Win32_Debug_Unicode/updater.obj
new file mode 100644
index 0000000..e222f94
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/updater.obj
diff --git a/updater/updater___Win32_Debug_Unicode/updater.pch b/updater/updater___Win32_Debug_Unicode/updater.pch
new file mode 100644
index 0000000..62c63e0
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/updater.pch
diff --git a/updater/updater___Win32_Debug_Unicode/updater.pdb b/updater/updater___Win32_Debug_Unicode/updater.pdb
new file mode 100644
index 0000000..48e2887
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/updater.pdb
diff --git a/updater/updater___Win32_Debug_Unicode/updater.sbr b/updater/updater___Win32_Debug_Unicode/updater.sbr
new file mode 100644
index 0000000..285c709
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/updater.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/utils.obj b/updater/updater___Win32_Debug_Unicode/utils.obj
new file mode 100644
index 0000000..8fea064
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/utils.obj
diff --git a/updater/updater___Win32_Debug_Unicode/utils.sbr b/updater/updater___Win32_Debug_Unicode/utils.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/utils.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/vc80.idb b/updater/updater___Win32_Debug_Unicode/vc80.idb
new file mode 100644
index 0000000..55e8b99
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/vc80.idb
diff --git a/updater/updater___Win32_Debug_Unicode/vc80.pdb b/updater/updater___Win32_Debug_Unicode/vc80.pdb
new file mode 100644
index 0000000..883da91
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/vc80.pdb
diff --git a/updater/updater___Win32_Debug_Unicode/xmldata.obj b/updater/updater___Win32_Debug_Unicode/xmldata.obj
new file mode 100644
index 0000000..5c6d475
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/xmldata.obj
diff --git a/updater/updater___Win32_Debug_Unicode/xmldata.sbr b/updater/updater___Win32_Debug_Unicode/xmldata.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/xmldata.sbr
diff --git a/updater/updater___Win32_Debug_Unicode/zutil.obj b/updater/updater___Win32_Debug_Unicode/zutil.obj
new file mode 100644
index 0000000..0eda5a5
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/zutil.obj
diff --git a/updater/updater___Win32_Debug_Unicode/zutil.sbr b/updater/updater___Win32_Debug_Unicode/zutil.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Debug_Unicode/zutil.sbr
diff --git a/updater/updater___Win32_Release_Unicode/BuildLog.htm b/updater/updater___Win32_Release_Unicode/BuildLog.htm
new file mode 100644
index 0000000..6a3da6e
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/BuildLog.htm
diff --git a/updater/updater___Win32_Release_Unicode/adler32.obj b/updater/updater___Win32_Release_Unicode/adler32.obj
new file mode 100644
index 0000000..71951d1
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/adler32.obj
diff --git a/updater/updater___Win32_Release_Unicode/adler32.sbr b/updater/updater___Win32_Release_Unicode/adler32.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/adler32.sbr
diff --git a/updater/updater___Win32_Release_Unicode/allocations.obj b/updater/updater___Win32_Release_Unicode/allocations.obj
new file mode 100644
index 0000000..928baa4
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/allocations.obj
diff --git a/updater/updater___Win32_Release_Unicode/allocations.sbr b/updater/updater___Win32_Release_Unicode/allocations.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/allocations.sbr
diff --git a/updater/updater___Win32_Release_Unicode/blocksort.obj b/updater/updater___Win32_Release_Unicode/blocksort.obj
new file mode 100644
index 0000000..fd2a84c
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/blocksort.obj
diff --git a/updater/updater___Win32_Release_Unicode/blocksort.sbr b/updater/updater___Win32_Release_Unicode/blocksort.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/blocksort.sbr
diff --git a/updater/updater___Win32_Release_Unicode/bzlib.obj b/updater/updater___Win32_Release_Unicode/bzlib.obj
new file mode 100644
index 0000000..1b11f95
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/bzlib.obj
diff --git a/updater/updater___Win32_Release_Unicode/bzlib.sbr b/updater/updater___Win32_Release_Unicode/bzlib.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/bzlib.sbr
diff --git a/updater/updater___Win32_Release_Unicode/common.obj b/updater/updater___Win32_Release_Unicode/common.obj
new file mode 100644
index 0000000..4666432
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/common.obj
diff --git a/updater/updater___Win32_Release_Unicode/common.sbr b/updater/updater___Win32_Release_Unicode/common.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/common.sbr
diff --git a/updater/updater___Win32_Release_Unicode/compress.obj b/updater/updater___Win32_Release_Unicode/compress.obj
new file mode 100644
index 0000000..6630c56
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/compress.obj
diff --git a/updater/updater___Win32_Release_Unicode/compress.sbr b/updater/updater___Win32_Release_Unicode/compress.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/compress.sbr
diff --git a/updater/updater___Win32_Release_Unicode/compress_zlib.obj b/updater/updater___Win32_Release_Unicode/compress_zlib.obj
new file mode 100644
index 0000000..0a90723
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/compress_zlib.obj
diff --git a/updater/updater___Win32_Release_Unicode/compress_zlib.sbr b/updater/updater___Win32_Release_Unicode/compress_zlib.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/compress_zlib.sbr
diff --git a/updater/updater___Win32_Release_Unicode/conf_comp_dialog.obj b/updater/updater___Win32_Release_Unicode/conf_comp_dialog.obj
new file mode 100644
index 0000000..e843ffc
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/conf_comp_dialog.obj
diff --git a/updater/updater___Win32_Release_Unicode/conf_comp_dialog.sbr b/updater/updater___Win32_Release_Unicode/conf_comp_dialog.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/conf_comp_dialog.sbr
diff --git a/updater/updater___Win32_Release_Unicode/conf_dialog.obj b/updater/updater___Win32_Release_Unicode/conf_dialog.obj
new file mode 100644
index 0000000..ddd7db3
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/conf_dialog.obj
diff --git a/updater/updater___Win32_Release_Unicode/conf_dialog.sbr b/updater/updater___Win32_Release_Unicode/conf_dialog.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/conf_dialog.sbr
diff --git a/updater/updater___Win32_Release_Unicode/crc32.obj b/updater/updater___Win32_Release_Unicode/crc32.obj
new file mode 100644
index 0000000..15bd46d
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/crc32.obj
diff --git a/updater/updater___Win32_Release_Unicode/crc32.sbr b/updater/updater___Win32_Release_Unicode/crc32.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/crc32.sbr
diff --git a/updater/updater___Win32_Release_Unicode/crctable.obj b/updater/updater___Win32_Release_Unicode/crctable.obj
new file mode 100644
index 0000000..f21c266
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/crctable.obj
diff --git a/updater/updater___Win32_Release_Unicode/crctable.sbr b/updater/updater___Win32_Release_Unicode/crctable.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/crctable.sbr
diff --git a/updater/updater___Win32_Release_Unicode/decompress.obj b/updater/updater___Win32_Release_Unicode/decompress.obj
new file mode 100644
index 0000000..250ff76
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/decompress.obj
diff --git a/updater/updater___Win32_Release_Unicode/decompress.sbr b/updater/updater___Win32_Release_Unicode/decompress.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/decompress.sbr
diff --git a/updater/updater___Win32_Release_Unicode/deflate.obj b/updater/updater___Win32_Release_Unicode/deflate.obj
new file mode 100644
index 0000000..099b786
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/deflate.obj
diff --git a/updater/updater___Win32_Release_Unicode/deflate.sbr b/updater/updater___Win32_Release_Unicode/deflate.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/deflate.sbr
diff --git a/updater/updater___Win32_Release_Unicode/extern.obj b/updater/updater___Win32_Release_Unicode/extern.obj
new file mode 100644
index 0000000..49f08ee
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/extern.obj
diff --git a/updater/updater___Win32_Release_Unicode/extern.sbr b/updater/updater___Win32_Release_Unicode/extern.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/extern.sbr
diff --git a/updater/updater___Win32_Release_Unicode/gzio.obj b/updater/updater___Win32_Release_Unicode/gzio.obj
new file mode 100644
index 0000000..38b37e3
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/gzio.obj
diff --git a/updater/updater___Win32_Release_Unicode/gzio.sbr b/updater/updater___Win32_Release_Unicode/gzio.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/gzio.sbr
diff --git a/updater/updater___Win32_Release_Unicode/huffman.obj b/updater/updater___Win32_Release_Unicode/huffman.obj
new file mode 100644
index 0000000..b75e24e
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/huffman.obj
diff --git a/updater/updater___Win32_Release_Unicode/huffman.sbr b/updater/updater___Win32_Release_Unicode/huffman.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/huffman.sbr
diff --git a/updater/updater___Win32_Release_Unicode/icons.obj b/updater/updater___Win32_Release_Unicode/icons.obj
new file mode 100644
index 0000000..27f95de
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/icons.obj
diff --git a/updater/updater___Win32_Release_Unicode/icons.sbr b/updater/updater___Win32_Release_Unicode/icons.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/icons.sbr
diff --git a/updater/updater___Win32_Release_Unicode/infback.obj b/updater/updater___Win32_Release_Unicode/infback.obj
new file mode 100644
index 0000000..85bd74f
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/infback.obj
diff --git a/updater/updater___Win32_Release_Unicode/infback.sbr b/updater/updater___Win32_Release_Unicode/infback.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/infback.sbr
diff --git a/updater/updater___Win32_Release_Unicode/inffast.obj b/updater/updater___Win32_Release_Unicode/inffast.obj
new file mode 100644
index 0000000..ffedc7f
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/inffast.obj
diff --git a/updater/updater___Win32_Release_Unicode/inffast.sbr b/updater/updater___Win32_Release_Unicode/inffast.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/inffast.sbr
diff --git a/updater/updater___Win32_Release_Unicode/inflate.obj b/updater/updater___Win32_Release_Unicode/inflate.obj
new file mode 100644
index 0000000..ef51512
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/inflate.obj
diff --git a/updater/updater___Win32_Release_Unicode/inflate.sbr b/updater/updater___Win32_Release_Unicode/inflate.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/inflate.sbr
diff --git a/updater/updater___Win32_Release_Unicode/inftrees.obj b/updater/updater___Win32_Release_Unicode/inftrees.obj
new file mode 100644
index 0000000..57df92d
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/inftrees.obj
diff --git a/updater/updater___Win32_Release_Unicode/inftrees.sbr b/updater/updater___Win32_Release_Unicode/inftrees.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/inftrees.sbr
diff --git a/updater/updater___Win32_Release_Unicode/ioapi.obj b/updater/updater___Win32_Release_Unicode/ioapi.obj
new file mode 100644
index 0000000..86d6f8a
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/ioapi.obj
diff --git a/updater/updater___Win32_Release_Unicode/ioapi.sbr b/updater/updater___Win32_Release_Unicode/ioapi.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/ioapi.sbr
diff --git a/updater/updater___Win32_Release_Unicode/iowin32.obj b/updater/updater___Win32_Release_Unicode/iowin32.obj
new file mode 100644
index 0000000..5a8ad04
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/iowin32.obj
diff --git a/updater/updater___Win32_Release_Unicode/iowin32.sbr b/updater/updater___Win32_Release_Unicode/iowin32.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/iowin32.sbr
diff --git a/updater/updater___Win32_Release_Unicode/minigzip.obj b/updater/updater___Win32_Release_Unicode/minigzip.obj
new file mode 100644
index 0000000..ca932fa
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/minigzip.obj
diff --git a/updater/updater___Win32_Release_Unicode/minigzip.sbr b/updater/updater___Win32_Release_Unicode/minigzip.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/minigzip.sbr
diff --git a/updater/updater___Win32_Release_Unicode/miniunz.obj b/updater/updater___Win32_Release_Unicode/miniunz.obj
new file mode 100644
index 0000000..cfcd719
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/miniunz.obj
diff --git a/updater/updater___Win32_Release_Unicode/miniunz.sbr b/updater/updater___Win32_Release_Unicode/miniunz.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/miniunz.sbr
diff --git a/updater/updater___Win32_Release_Unicode/munzip.obj b/updater/updater___Win32_Release_Unicode/munzip.obj
new file mode 100644
index 0000000..a1637c3
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/munzip.obj
diff --git a/updater/updater___Win32_Release_Unicode/munzip.sbr b/updater/updater___Win32_Release_Unicode/munzip.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/munzip.sbr
diff --git a/updater/updater___Win32_Release_Unicode/options.obj b/updater/updater___Win32_Release_Unicode/options.obj
new file mode 100644
index 0000000..a88ecce
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/options.obj
diff --git a/updater/updater___Win32_Release_Unicode/options.sbr b/updater/updater___Win32_Release_Unicode/options.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/options.sbr
diff --git a/updater/updater___Win32_Release_Unicode/popups.obj b/updater/updater___Win32_Release_Unicode/popups.obj
new file mode 100644
index 0000000..081da26
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/popups.obj
diff --git a/updater/updater___Win32_Release_Unicode/popups.sbr b/updater/updater___Win32_Release_Unicode/popups.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/popups.sbr
diff --git a/updater/updater___Win32_Release_Unicode/progress_dialog.obj b/updater/updater___Win32_Release_Unicode/progress_dialog.obj
new file mode 100644
index 0000000..8277186
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/progress_dialog.obj
diff --git a/updater/updater___Win32_Release_Unicode/progress_dialog.sbr b/updater/updater___Win32_Release_Unicode/progress_dialog.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/progress_dialog.sbr
diff --git a/updater/updater___Win32_Release_Unicode/randtable.obj b/updater/updater___Win32_Release_Unicode/randtable.obj
new file mode 100644
index 0000000..6b18a8f
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/randtable.obj
diff --git a/updater/updater___Win32_Release_Unicode/randtable.sbr b/updater/updater___Win32_Release_Unicode/randtable.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/randtable.sbr
diff --git a/updater/updater___Win32_Release_Unicode/resource.res b/updater/updater___Win32_Release_Unicode/resource.res
new file mode 100644
index 0000000..554e743
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/resource.res
diff --git a/updater/updater___Win32_Release_Unicode/scan.obj b/updater/updater___Win32_Release_Unicode/scan.obj
new file mode 100644
index 0000000..bb4e275
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/scan.obj
diff --git a/updater/updater___Win32_Release_Unicode/scan.sbr b/updater/updater___Win32_Release_Unicode/scan.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/scan.sbr
diff --git a/updater/updater___Win32_Release_Unicode/services.obj b/updater/updater___Win32_Release_Unicode/services.obj
new file mode 100644
index 0000000..cf96c64
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/services.obj
diff --git a/updater/updater___Win32_Release_Unicode/services.sbr b/updater/updater___Win32_Release_Unicode/services.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/services.sbr
diff --git a/updater/updater___Win32_Release_Unicode/socket.obj b/updater/updater___Win32_Release_Unicode/socket.obj
new file mode 100644
index 0000000..b6cf8fa
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/socket.obj
diff --git a/updater/updater___Win32_Release_Unicode/socket.sbr b/updater/updater___Win32_Release_Unicode/socket.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/socket.sbr
diff --git a/updater/updater___Win32_Release_Unicode/str_utils.obj b/updater/updater___Win32_Release_Unicode/str_utils.obj
new file mode 100644
index 0000000..642a521
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/str_utils.obj
diff --git a/updater/updater___Win32_Release_Unicode/str_utils.sbr b/updater/updater___Win32_Release_Unicode/str_utils.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/str_utils.sbr
diff --git a/updater/updater___Win32_Release_Unicode/tinystr.obj b/updater/updater___Win32_Release_Unicode/tinystr.obj
new file mode 100644
index 0000000..0f1fa72
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/tinystr.obj
diff --git a/updater/updater___Win32_Release_Unicode/tinystr.sbr b/updater/updater___Win32_Release_Unicode/tinystr.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/tinystr.sbr
diff --git a/updater/updater___Win32_Release_Unicode/tinyxml.obj b/updater/updater___Win32_Release_Unicode/tinyxml.obj
new file mode 100644
index 0000000..015b6b5
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/tinyxml.obj
diff --git a/updater/updater___Win32_Release_Unicode/tinyxml.sbr b/updater/updater___Win32_Release_Unicode/tinyxml.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/tinyxml.sbr
diff --git a/updater/updater___Win32_Release_Unicode/tinyxmlerror.obj b/updater/updater___Win32_Release_Unicode/tinyxmlerror.obj
new file mode 100644
index 0000000..9b998db
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/tinyxmlerror.obj
diff --git a/updater/updater___Win32_Release_Unicode/tinyxmlerror.sbr b/updater/updater___Win32_Release_Unicode/tinyxmlerror.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/tinyxmlerror.sbr
diff --git a/updater/updater___Win32_Release_Unicode/tinyxmlparser.obj b/updater/updater___Win32_Release_Unicode/tinyxmlparser.obj
new file mode 100644
index 0000000..93b206c
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/tinyxmlparser.obj
diff --git a/updater/updater___Win32_Release_Unicode/tinyxmlparser.sbr b/updater/updater___Win32_Release_Unicode/tinyxmlparser.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/tinyxmlparser.sbr
diff --git a/updater/updater___Win32_Release_Unicode/trees.obj b/updater/updater___Win32_Release_Unicode/trees.obj
new file mode 100644
index 0000000..8e63718
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/trees.obj
diff --git a/updater/updater___Win32_Release_Unicode/trees.sbr b/updater/updater___Win32_Release_Unicode/trees.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/trees.sbr
diff --git a/updater/updater___Win32_Release_Unicode/uncompr.obj b/updater/updater___Win32_Release_Unicode/uncompr.obj
new file mode 100644
index 0000000..539f981
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/uncompr.obj
diff --git a/updater/updater___Win32_Release_Unicode/uncompr.sbr b/updater/updater___Win32_Release_Unicode/uncompr.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/uncompr.sbr
diff --git a/updater/updater___Win32_Release_Unicode/updater.bsc b/updater/updater___Win32_Release_Unicode/updater.bsc
new file mode 100644
index 0000000..b75e537
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/updater.bsc
diff --git a/updater/updater___Win32_Release_Unicode/updater.exp b/updater/updater___Win32_Release_Unicode/updater.exp
new file mode 100644
index 0000000..1459b92
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/updater.exp
diff --git a/updater/updater___Win32_Release_Unicode/updater.lib b/updater/updater___Win32_Release_Unicode/updater.lib
new file mode 100644
index 0000000..e97d862
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/updater.lib
diff --git a/updater/updater___Win32_Release_Unicode/updater.obj b/updater/updater___Win32_Release_Unicode/updater.obj
new file mode 100644
index 0000000..4bc41eb
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/updater.obj
diff --git a/updater/updater___Win32_Release_Unicode/updater.pch b/updater/updater___Win32_Release_Unicode/updater.pch
new file mode 100644
index 0000000..4481b34
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/updater.pch
diff --git a/updater/updater___Win32_Release_Unicode/updater.sbr b/updater/updater___Win32_Release_Unicode/updater.sbr
new file mode 100644
index 0000000..0720359
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/updater.sbr
diff --git a/updater/updater___Win32_Release_Unicode/utils.obj b/updater/updater___Win32_Release_Unicode/utils.obj
new file mode 100644
index 0000000..af50b67
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/utils.obj
diff --git a/updater/updater___Win32_Release_Unicode/utils.sbr b/updater/updater___Win32_Release_Unicode/utils.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/utils.sbr
diff --git a/updater/updater___Win32_Release_Unicode/vc80.idb b/updater/updater___Win32_Release_Unicode/vc80.idb
new file mode 100644
index 0000000..ddea80f
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/vc80.idb
diff --git a/updater/updater___Win32_Release_Unicode/xmldata.obj b/updater/updater___Win32_Release_Unicode/xmldata.obj
new file mode 100644
index 0000000..8a8100a
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/xmldata.obj
diff --git a/updater/updater___Win32_Release_Unicode/xmldata.sbr b/updater/updater___Win32_Release_Unicode/xmldata.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/xmldata.sbr
diff --git a/updater/updater___Win32_Release_Unicode/zutil.obj b/updater/updater___Win32_Release_Unicode/zutil.obj
new file mode 100644
index 0000000..3d2b233
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/zutil.obj
diff --git a/updater/updater___Win32_Release_Unicode/zutil.sbr b/updater/updater___Win32_Release_Unicode/zutil.sbr
new file mode 100644
index 0000000..e69de29
--- /dev/null
+++ b/updater/updater___Win32_Release_Unicode/zutil.sbr
diff --git a/updater/updater_unicode.mdsp b/updater/updater_unicode.mdsp
new file mode 100644
index 0000000..592a843
--- /dev/null
+++ b/updater/updater_unicode.mdsp
@@ -0,0 +1,171 @@
+[Project]
+name=updater
+type=2
+defaultConfig=0
+
+
+[Debug]
+// compiler 
+workingDirectory=
+arguments=
+intermediateFilesDirectory=Debug_Unicode
+outputFilesDirectory=Debug_Unicode
+compilerPreprocessor=_UNICODE,UNICODE
+extraCompilerOptions=
+compilerIncludeDirectory=..\..\include
+noWarning=0
+defaultWarning=0
+allWarning=1
+extraWarning=0
+isoWarning=0
+warningsAsErrors=0
+debugType=1
+debugLevel=2
+exceptionEnabled=1
+runtimeTypeEnabled=1
+optimizeLevel=0
+
+// linker
+libraryPath=
+outputFilename=../../bin/Debug Unicode/plugins/updater.dll
+libraries=ole32,comctl32,stlport.5.0.dll
+extraLinkerOptions=
+ignoreStartupFile=0
+ignoreDefaultLibs=0
+stripExecutableFile=0
+
+// archive
+extraArchiveOptions=
+
+//resource
+resourcePreprocessor=_UNICODE,UNICODE
+resourceIncludeDirectory=
+extraResourceOptions=-D IDC_STATIC=-1
+
+[Release]
+// compiler 
+workingDirectory=
+arguments=
+intermediateFilesDirectory=Release_Unicode
+outputFilesDirectory=Release_Unicode
+compilerPreprocessor=_UNICODE,UNICODE
+extraCompilerOptions=
+compilerIncludeDirectory=..\..\include
+noWarning=0
+defaultWarning=0
+allWarning=1
+extraWarning=0
+isoWarning=0
+warningAsErrors=0
+debugType=0
+debugLevel=1
+exceptionEnabled=0
+runtimeTypeEnabled=0
+optimizeLevel=4
+
+// linker
+libraryPath=
+outputFilename=../../bin/Release Unicode/plugins/updater.dll
+libraries=ole32,comctl32,stlport.5.0.dll
+extraLinkerOptions=
+ignoreStartupFile=0
+ignoreDefaultLibs=0
+stripExecutableFile=1
+
+// archive
+extraArchiveOptions=
+
+//resource
+resourcePreprocessor=_UNICODE,UNICODE
+resourceIncludeDirectory=
+extraResourceOptions=-D IDC_STATIC=-1
+
+[Source]
+1=allocations.cpp
+2=common.cpp
+3=conf_comp_dialog.cpp
+4=conf_dialog.cpp
+5=extern.cpp
+6=icons.cpp
+7=options.cpp
+8=popups.cpp
+9=progress_dialog.cpp
+10=scan.cpp
+11=services.cpp
+12=socket.cpp
+13=str_utils.cpp
+14=tinystr.cpp
+15=tinyxml.cpp
+16=tinyxmlerror.cpp
+17=tinyxmlparser.cpp
+18=unzip.cpp
+19=updater.cpp
+20=utils.cpp
+21=xmldata.cpp
+22=zlib123\adler32.c
+23=zlib123\compress_zlib.c
+24=zlib123\crc32.c
+25=zlib123\deflate.c
+26=zlib123\gzio.c
+27=zlib123\infback.c
+28=zlib123\inffast.c
+29=zlib123\inflate.c
+30=zlib123\inftrees.c
+31=zlib123\trees.c
+32=zlib123\uncompr.c
+33=zlib123\zutil.c
+34=zlib123\contrib\minizip\ioapi.c
+35=zlib123\contrib\minizip\iowin32.c
+36=zlib123\contrib\minizip\miniunz.c
+37=bzip2-1.0.3\blocksort.c
+38=bzip2-1.0.3\bzlib.c
+39=bzip2-1.0.3\compress.c
+40=bzip2-1.0.3\crctable.c
+41=bzip2-1.0.3\decompress.c
+42=bzip2-1.0.3\huffman.c
+43=bzip2-1.0.3\randtable.c
+44=zlib123\contrib\minizip\munzip.c
+[Header]
+1=IcoLib.h
+2=allocations.h
+3=check.h
+4=common.h
+5=conf_comp_dialog.h
+6=conf_dialog.h
+7=extern.h
+8=icons.h
+9=m_updater.h
+10=options.h
+11=popups.h
+12=progress_dialog.h
+13=resource.h
+14=scan.h
+15=services.h
+16=socket.h
+17=str_utils.h
+18=tinystr.h
+19=tinyxml.h
+20=updater.h
+21=utils.h
+22=version.h
+23=xmldata.h
+24=bzip2-1.0.3\bzlib.h
+25=bzip2-1.0.3\bzlib_private.h
+26=zlib123\crc32.h
+27=zlib123\deflate.h
+28=zlib123\inffast.h
+29=zlib123\inffixed.h
+30=zlib123\inflate.h
+31=zlib123\inftrees.h
+32=zlib123\trees.h
+33=zlib123\zconf.h
+34=zlib123\zlib.h
+35=zlib123\zutil.h
+36=zlib123\contrib\minizip\iowin32.h
+37=zlib123\contrib\minizip\munzip.h
+[Resource]
+1=updater.rc
+2=version.rc
+[Other]
+[History]
+scan.cpp,4917
diff --git a/updater/utils.cpp b/updater/utils.cpp
new file mode 100644
index 0000000..f370e68
--- /dev/null
+++ b/updater/utils.cpp
@@ -0,0 +1,247 @@
+#include "common.h"
+#include "utils.h"
+
+bool VersionFromString(const char *szVer, DWORD *pdwVer) {
+	char *p = (char *)szVer;
+	*pdwVer = 0;
+
+	int bytes = 1; // we start in the first 'byte'
+	int digit_count = 0;
+	while(*p && bytes <= 4 && digit_count <= 3) {
+		if(*p >= '0' && *p <= '9') {
+			*pdwVer = (*pdwVer & 0xFFFFFF00) + (*pdwVer & 0xFF) * 10 + (*p - '0');
+			digit_count++;
+		} else if(*p == '.') {
+			*pdwVer = *pdwVer << 8;
+			bytes++;
+			digit_count = 0;
+		} else {
+			if(bytes < 3) // allow other chars on the end (e.g. space)
+				return false; // incompatible version string
+			else 
+				return true;
+		}
+		p++;
+	}
+
+	// version must be x.x.x.x format (for now - until a convention is established
+	// whereby we assume '0' bytes as either prefix or suffix)
+	// 15/3/06 - allowing 3 digit version numbers (ostensibly for spamfilter definition files which use date for version)
+	return (bytes >= 3);
+
+}
+
+int CheckForFileID(char *update_url, char *version_url, char *name) {
+	if(strlen(update_url) > 45 && strncmp(update_url, MIM_DOWNLOAD_URL_PREFIX, 45) == 0) {
+		char *p = update_url + 45;
+		return atoi(p);
+	}
+	if(strlen(update_url) > 51 && strncmp(update_url, "http://www.miranda-im.org/download/feed.php?dlfile=", 51) == 0) {
+		char *p = update_url + 51;
+		return atoi(p);
+	}
+	if(strlen(update_url) > 47 && strncmp(update_url, "http://miranda-im.org/download/feed.php?dlfile=", 47) == 0) {
+		char *p = update_url + 47;
+		return atoi(p);
+	}
+	return -1;
+}
+
+bool CreatePath(const TCHAR *path) {
+	if(!path) return false;
+
+	TCHAR folder[MAX_PATH];
+	_tcscpy(folder, path);
+	int i = 0;
+
+	if(folder[0] && folder[1] && folder[1] == ':') i += 2; // skip drive letter
+
+	SetLastError(ERROR_SUCCESS);
+	TCHAR *p = &folder[i];
+	while(folder[i]) {
+		p = _tcschr(p, _T('\\'));
+		if(p) {
+			i = p - folder;
+			p++;
+
+			if(folder[i]) folder[i] = 0;
+		} else 
+			i = _tcslen(folder);
+
+		/*
+		// this fails when the user does not have permission to create intermediate folders
+		if(!CreateDirectory(folder, 0)) {
+			DWORD err = GetLastError();
+			if(err != ERROR_ALREADY_EXISTS) {
+				//MessageBox(0, Translate("Could not create temporary folder."), Translate("Error"), MB_OK | MB_ICONERROR);
+				//return 1;
+				return false;
+			}
+		}
+		*/
+		CreateDirectory(folder, 0);
+
+		folder[i] = path[i];
+	}
+
+	DWORD lerr = GetLastError();
+	return (lerr == ERROR_SUCCESS || lerr == ERROR_ALREADY_EXISTS);
+
+	/*
+	// this function seems to be unavailable in shell32.dll under NT4
+	int ret = SHCreateDirectoryEx(0, path, 0);
+	return  (ret == ERROR_SUCCESS) || (ret == ERROR_FILE_EXISTS) || (ret == ERROR_ALREADY_EXISTS);
+	*/
+}
+
+// must 'free' return val
+TCHAR *GetTString(const char *asc) {
+	if(!asc) return 0;
+
+#ifdef _UNICODE 
+	wchar_t *ret;
+	int code_page = CP_ACP;
+	if(ServiceExists(MS_LANGPACK_GETCODEPAGE)) code_page = CallService(MS_LANGPACK_GETCODEPAGE, 0, 0);
+	int size = MultiByteToWideChar(code_page, MB_PRECOMPOSED, asc, -1, 0, 0);
+	ret = (wchar_t *)malloc(sizeof(wchar_t) * size);
+	MultiByteToWideChar(code_page, MB_PRECOMPOSED, asc, -1, ret, size);
+	return ret;
+#else
+	return _strdup(asc);
+#endif
+}
+
+TCHAR *GetTStringACP(const char *asc) {
+	if(!asc) return 0;
+
+#ifdef _UNICODE 
+	wchar_t *ret;
+
+	int size = MultiByteToWideChar(CP_ACP, MB_PRECOMPOSED, asc, -1, 0, 0);
+	ret = (wchar_t *)malloc(sizeof(wchar_t) * size);
+	MultiByteToWideChar(CP_ACP, MB_PRECOMPOSED, asc, -1, ret, size);
+	return ret;
+#else
+	return _strdup(asc);
+#endif
+}
+
+char *GetAString(const TCHAR *t) {
+	if(!t) return 0;
+
+#ifdef _UNICODE
+	char *ret;
+
+	int code_page = CP_ACP;
+	if(ServiceExists(MS_LANGPACK_GETCODEPAGE)) code_page = CallService(MS_LANGPACK_GETCODEPAGE, 0, 0);
+	int size = WideCharToMultiByte(code_page, 0, t, -1, 0, 0, 0, 0);
+	ret = (char *)malloc(size);
+	WideCharToMultiByte(code_page, 0, t, -1, ret, size, 0, 0);
+	return ret;
+#else
+	return _strdup(t);
+#endif
+}
+
+void RemoveFolder(const TCHAR *src_folder) {
+	TCHAR szFilesPath[MAX_PATH], szNewFileName[MAX_PATH];
+	
+	_tcscpy(szFilesPath, src_folder);
+	_tcscat(szFilesPath, _T("\\*.*"));
+
+	WIN32_FIND_DATA findData;
+	HANDLE hFileSearch = FindFirstFile(szFilesPath, &findData);
+	if(hFileSearch != INVALID_HANDLE_VALUE) {
+		do {
+			if(findData.cFileName[0] != _T('.')) {
+				_tcslwr(findData.cFileName);
+				_tcscpy(szNewFileName, src_folder);
+				_tcscat(szNewFileName, _T("\\"));
+				_tcscat(szNewFileName, findData.cFileName);
+
+				if(findData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)
+					// recurse
+					RemoveFolder(szNewFileName);
+				else
+					DeleteFile(szNewFileName);
+			}
+		} while(FindNextFile(hFileSearch, &findData));
+		FindClose(hFileSearch);
+	}
+
+	RemoveDirectory(src_folder);
+}
+
+bool FolderIsEmpty(const TCHAR *folder) {
+	TCHAR szFilesPath[MAX_PATH];
+	
+	_tcscpy(szFilesPath, folder);
+	_tcscat(szFilesPath, _T("\\*.*"));
+
+	WIN32_FIND_DATA findData;
+	HANDLE hFileSearch = FindFirstFile(szFilesPath, &findData);
+	if(hFileSearch != INVALID_HANDLE_VALUE) {
+		do {
+			if(_tcscmp(findData.cFileName, _T(".")) != 0 && _tcscmp(findData.cFileName, _T("..")) != 0) {
+				FindClose(hFileSearch);
+				return false;
+			}
+		} while(FindNextFile(hFileSearch, &findData));
+		FindClose(hFileSearch);
+	}
+
+	return true;
+}
+
+bool DeleteNonDlls(const TCHAR *folder) {
+	TCHAR szFilesPath[MAX_PATH], szFilename[MAX_PATH];
+
+	{
+		char buff[200];
+#ifdef _UNICODE
+		char mbFname[MAX_PATH];
+		WideCharToMultiByte(CP_ACP, 0, folder, -1, mbFname, MAX_PATH, 0, 0);
+		sprintf(buff, "Deleting non-dlls in %s", mbFname);
+#else
+		sprintf(buff, "Deleting non-dlls in %s", folder);
+#endif
+		NLog(buff);
+	}
+
+	_tcscpy(szFilesPath, folder);
+	_tcscpy(szFilename, folder);
+	_tcscat(szFilename, _T("\\"));
+	TCHAR *p = szFilename + _tcslen(szFilename);
+	_tcscat(szFilesPath, _T("\\*.*"));
+
+	WIN32_FIND_DATA findData;
+	HANDLE hFileSearch = FindFirstFile(szFilesPath, &findData);
+	if(hFileSearch != INVALID_HANDLE_VALUE) {
+		do {
+			if(_tcscmp(findData.cFileName, _T(".")) != 0 && _tcscmp(findData.cFileName, _T("..")) != 0) {
+				_tcscpy(p, findData.cFileName);
+				if(findData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY) {
+					DeleteNonDlls(szFilename);
+				} else {
+					if(_tcsstr(findData.cFileName, _T(".dll")) == 0) {
+						{
+							char buff[200];
+#ifdef _UNICODE
+							char mbFname[MAX_PATH];
+							WideCharToMultiByte(CP_ACP, 0, szFilename, -1, mbFname, MAX_PATH, 0, 0);
+							sprintf(buff, "Deleting %s", mbFname);
+#else
+							sprintf(buff, "Deleting %s", szFilename);
+#endif
+							NLog(buff);
+						}
+						DeleteFile(szFilename);	
+					}
+				}
+			}
+		} while(FindNextFile(hFileSearch, &findData));
+		FindClose(hFileSearch);
+	}
+
+	return true;
+}
+\ No newline at end of file
diff --git a/updater/utils.h b/updater/utils.h
new file mode 100644
index 0000000..5d915a4
--- /dev/null
+++ b/updater/utils.h
@@ -0,0 +1,26 @@
+#ifndef _UTILS_INC
+#define _UTILS_INC
+
+#include <shlobj.h>
+#include "xmldata.h"
+
+bool VersionFromString(const char *szVer, DWORD *pdwVer);
+
+int CheckForFileID(char *update_url, char *version_url, char *name);
+
+bool CreatePath(const TCHAR *path);
+
+// must 'free' return val
+TCHAR *GetTString(const char *asc);
+// use system default codepage - called from external process where langpack codepage is not (easily) accessible
+TCHAR *GetTStringACP(const char *asc);
+
+char *GetAString(const TCHAR *t);
+
+void RemoveFolder(const TCHAR *src_folder);
+
+bool FolderIsEmpty(const TCHAR *folder);
+
+bool DeleteNonDlls(const TCHAR *folder);
+
+#endif
diff --git a/updater/version.h b/updater/version.h
new file mode 100644
index 0000000..180539a
--- /dev/null
+++ b/updater/version.h
@@ -0,0 +1,29 @@
+#ifndef __VERSION_H_INCLUDED
+#define __VERSION_H_INCLUDED
+
+
+#define __MAJOR_VERSION				0
+#define __MINOR_VERSION				4
+#define __RELEASE_NUM				12
+#define __BUILD_NUM					0
+
+#define __FILEVERSION_STRING        __MAJOR_VERSION,__MINOR_VERSION,__RELEASE_NUM,__BUILD_NUM
+#define __FILEVERSION_STRING_DOTS	__MAJOR_VERSION.__MINOR_VERSION.__RELEASE_NUM.__BUILD_NUM
+#define __STRINGIFY(x)				#x
+#define __VERSION_STRING			__STRINGIFY(__FILEVERSION_STRING_DOTS)
+
+#define __DESC						"Automatic Updater for Miranda"
+#define __AUTHOR					"Scott Ellis"
+#define __AUTHOREMAIL				"mail@scottellis.com.au"
+#define __COPYRIGHT					"� 2005,2006 Scott Ellis"
+#define __AUTHORWEB					"http://www.scottellis.com.au"
+
+#ifdef _UNICODE
+#define __PLUGIN_NAME				"Updater (Unicode)"
+#else
+#define __PLUGIN_NAME				"Updater"
+#endif
+#define __FILENAME					"updater.dll"
+
+
+#endif //__VERSION_H_INCLUDED
diff --git a/updater/version.rc b/updater/version.rc
new file mode 100644
index 0000000..0bb7a49
--- /dev/null
+++ b/updater/version.rc
@@ -0,0 +1,33 @@
+
+#include <windows.h>
+#include "version.h"
+
+VS_VERSION_INFO VERSIONINFO
+ FILEVERSION __FILEVERSION_STRING
+ PRODUCTVERSION __FILEVERSION_STRING
+ FILEFLAGSMASK 0x3fL
+#ifdef _DEBUG
+ FILEFLAGS 0x1L
+#else
+ FILEFLAGS 0x0L
+#endif
+ FILEOS 0x40004L
+ FILETYPE 0x1L
+ FILESUBTYPE 0x0L
+BEGIN
+    BLOCK "StringFileInfo"
+    BEGIN
+        BLOCK "000004b0"
+        BEGIN
+            VALUE "Author", __AUTHOR
+            VALUE "FileDescription", __DESC
+            VALUE "InternalName", __PLUGIN_NAME
+            VALUE "LegalCopyright", __COPYRIGHT
+            VALUE "OriginalFilename", __FILENAME
+        END
+    END
+    BLOCK "VarFileInfo"
+    BEGIN
+        VALUE "Translation", 0x0, 1200
+    END
+END
diff --git a/updater/xmldata.cpp b/updater/xmldata.cpp
new file mode 100644
index 0000000..132fd7a
--- /dev/null
+++ b/updater/xmldata.cpp
@@ -0,0 +1,512 @@
+#include "common.h"
+#include "xmldata.h"
+
+const char *category_files[] = { "category_plugins", "category_localisation" };
+
+BYTE *pData[NUM_CATEGORIES] = {0};
+int dataLength[NUM_CATEGORIES] = {0};
+TiXmlDocument *doc[NUM_CATEGORIES] = {0};
+
+bool XMLDataAvailable(const Category cat) {
+	return (pData[cat] && dataLength[cat]);
+}
+
+void FreeXMLData(const Category cat) {
+	if(pData[cat]) {
+		free(pData[cat]);
+		pData[cat] = 0;
+	}
+	if(doc[cat]) {
+		delete doc[cat];
+		doc[cat] = 0;
+	}
+	dataLength[cat] = 0;
+}
+
+bool OldXMLDataExists(const Category cat) {
+	TCHAR xml_data_filename[MAX_PATH];
+	TCHAR *ts;
+	_tcscpy(xml_data_filename, options.data_folder);
+	_tcscat(xml_data_filename, _T("\\"));
+	_tcscat(xml_data_filename, ts = GetTString(category_files[cat]));
+	_tcscat(xml_data_filename, _T(".xml"));
+	free(ts);
+
+	HANDLE hDataFile = CreateFile(xml_data_filename, 0, 0, 0, OPEN_EXISTING, 0, 0);
+	if(hDataFile != INVALID_HANDLE_VALUE) {
+		CloseHandle(hDataFile);
+		return true;
+	}
+
+	return false;
+}
+
+// return age of file in hours
+const ULARGE_INTEGER mult = { 600000000, 0}; // number of 100 microsecond blocks in a minute
+long OldXMLDataAge(const Category cat) {
+	TCHAR xml_data_filename[MAX_PATH];
+	TCHAR *ts;
+	_tcscpy(xml_data_filename, options.data_folder);
+	_tcscat(xml_data_filename, _T("\\"));
+	_tcscat(xml_data_filename, ts = GetTString(category_files[cat]));
+	_tcscat(xml_data_filename, _T(".xml"));
+	free(ts);
+
+	HANDLE hDataFile = CreateFile(xml_data_filename, GENERIC_READ, FILE_SHARE_READ, 0, OPEN_EXISTING, 0, 0);
+	if(hDataFile != INVALID_HANDLE_VALUE) {
+		FILETIME ft_then, ft_now;
+		GetFileTime(hDataFile, 0, 0, &ft_then);
+		CloseHandle(hDataFile);
+
+		SYSTEMTIME now;
+		GetSystemTime(&now);
+		SystemTimeToFileTime(&now, &ft_now);
+
+		ULARGE_INTEGER uli_now, uli_then, diff;
+		uli_now.HighPart = ft_now.dwHighDateTime;
+		uli_now.LowPart = ft_now.dwLowDateTime;
+		uli_then.HighPart = ft_then.dwHighDateTime;
+		uli_then.LowPart = ft_then.dwLowDateTime;
+
+		diff.QuadPart = uli_now.QuadPart - uli_then.QuadPart;
+
+		long minutes = (long)(diff.QuadPart / mult.QuadPart); // rounded down 
+
+		// convert to hours (add 30 so we round up properly)
+		return (minutes + 30) / 60;
+	}
+
+	return -1;
+}
+
+bool LoadOldXMLData(const Category cat, bool update_age) {
+	TCHAR xml_data_filename[MAX_PATH];
+	TCHAR *ts;
+	_tcscpy(xml_data_filename, options.data_folder);
+	_tcscat(xml_data_filename, _T("\\"));
+	_tcscat(xml_data_filename, ts = GetTString(category_files[cat]));
+	_tcscat(xml_data_filename, _T(".xml"));
+	free(ts);
+
+	if(pData[cat]) free(pData[cat]);
+	pData[cat] = 0;
+	dataLength[cat] = 0;
+
+	// load 
+	HANDLE hDataFile = CreateFile(xml_data_filename, GENERIC_READ, FILE_SHARE_READ, 0, OPEN_EXISTING, 0, 0);
+	if(hDataFile != INVALID_HANDLE_VALUE) {
+		dataLength[cat] = GetFileSize(hDataFile, 0);
+		if(dataLength[cat]) {
+			unsigned long bytes_read;
+			pData[cat] = (BYTE *)malloc(dataLength[cat]);
+			if(ReadFile(hDataFile, pData[cat], dataLength[cat], &bytes_read, 0))
+				dataLength[cat] = bytes_read;
+			else {
+				free(pData[cat]);
+				pData[cat] = 0;
+				dataLength[cat] = 0;
+			}
+
+		}
+
+		if(update_age) {
+			FILETIME ft_now;
+			SYSTEMTIME now;
+			GetSystemTime(&now);
+			SystemTimeToFileTime(&now, &ft_now);
+			SetFileTime(hDataFile, 0, 0, &ft_now);
+		}
+
+		CloseHandle(hDataFile);
+	}
+	
+	if(pData[cat] && dataLength[cat]) {
+		doc[cat] = new TiXmlDocument;
+		doc[cat]->Parse((char *)pData[cat], 0, TIXML_DEFAULT_ENCODING);
+		if(doc[cat]->Error()) {
+			FreeXMLData(cat);
+			return false;
+		}
+		return true;
+	}
+	return false;
+}
+
+bool SaveXMLData(const Category cat) {
+	TCHAR xml_data_filename[MAX_PATH];
+	TCHAR *ts;
+	_tcscpy(xml_data_filename, options.data_folder);
+	_tcscat(xml_data_filename, _T("\\"));
+	_tcscat(xml_data_filename, ts = GetTString(category_files[cat]));
+	_tcscat(xml_data_filename, _T(".xml"));
+	free(ts);
+
+	if(!CreatePath(options.data_folder)) {
+		return false;
+	}
+	
+	// save data
+	if(pData[cat] && dataLength[cat]) {
+		HANDLE hDataFile = CreateFile(xml_data_filename, GENERIC_READ | GENERIC_WRITE, 0, 0, CREATE_ALWAYS, 0, 0);
+		if(hDataFile != INVALID_HANDLE_VALUE) {
+			unsigned long bytes_written;
+			WriteFile(hDataFile, pData[cat], dataLength[cat], &bytes_written, 0);
+			CloseHandle(hDataFile);
+			return true;
+		}
+	}
+
+	return false;
+}
+
+bool bz2_decompress_xml(char *in_data, int in_data_length, BYTE **pDat, int *data_length) {
+	const int BLOCKSIZE = 1024 * 100;
+
+	bz_stream bzs = {0};
+
+	switch(BZ2_bzDecompressInit(&bzs, 0, 0)) {
+	case BZ_CONFIG_ERROR: 
+		//MessageBox(0, "Configuration Error", "BZ2 Decompres Init", MB_OK | MB_ICONERROR); 
+		ShowError(TranslateT("BZ2 Decompression, configuration error"));
+		return false;
+	case BZ_PARAM_ERROR: 
+		//MessageBox(0, "Parameters Error", "BZ2 Decompres Init", MB_OK | MB_ICONERROR); 
+		ShowError(TranslateT("BZ2 Decompression, parameter error"));
+		return false;
+	case BZ_MEM_ERROR: 
+		//MessageBox(0, "Memory Error", "BZ2 Decompres Init", MB_OK | MB_ICONERROR); 
+		ShowError(TranslateT("DB2 Decompression, memory error"));
+		return false;
+	}
+
+	bzs.avail_in = in_data_length;
+	bzs.next_in = in_data;
+
+	bzs.avail_out = BLOCKSIZE;
+	*pDat = (BYTE *)malloc(bzs.avail_out + 1); // allocate 100k (at present, xml data is about 87k)  (1 byte extra for a terminating 0 for safety)
+	bzs.next_out = (char *)*pDat;
+
+	int blocknum = 0;
+	int ret;
+	while((ret = BZ2_bzDecompress(&bzs)) == BZ_OK && bzs.avail_in > 0) {
+		if(bzs.avail_out == 0) {
+			blocknum++;
+			*pDat = (BYTE *)realloc(*pDat, (blocknum + 1) * BLOCKSIZE + 1);
+			bzs.next_out = (char *)(*pDat + (blocknum * BLOCKSIZE));
+			bzs.avail_out = BLOCKSIZE;
+		}
+	}
+
+	BZ2_bzDecompressEnd(&bzs);
+
+	if(ret != BZ_STREAM_END) {
+//		char msg[512];
+//		sprintf(msg, "Error decompressing, code: %d", ret);
+//		MessageBox(0, msg, "Error Decompressing BZ2 XML data", MB_OK);
+		free(*pDat);
+		*pDat = 0;
+		*data_length = 0;
+		return false;
+	}
+
+	*data_length = bzs.total_out_lo32;		// assume it's not too massive!
+	(*pDat)[*data_length] = 0;				// for safety - last char shouldn't matter to us
+
+	//char msg[256];
+	//sprintf(msg, "Bytes decompressed: %d", data_length);
+	//MessageBox(0, msg, "msg", MB_OK);
+
+	return true;
+}
+
+bool UpdateXMLData(const Category cat, const char *redirect_url /*= 0*/, int recurse_count /*=0*/) {
+	
+	if(recurse_count > MAX_REDIRECT_RECURSE) {
+		PUShowMessage(Translate("Updater: Error getting data - too many redirects"), SM_WARNING);
+		return false;
+	}
+
+	NETLIBHTTPREQUEST req = {0};
+	NETLIBHTTPHEADER etag_hdr = {0};
+
+	if(OldXMLDataExists(cat)) {
+		// ensure backend not checked more than once every MIN_XMLDATA_AGE hours
+		long age = OldXMLDataAge(cat);
+		if(age >= 0 && age < MIN_XMLDATA_AGE)	{	// get it only if our file is at least 8 hours old
+#ifdef DEBUG_HTTP_POPUPS
+			char buff[512];
+			sprintf(buff, "XML Data is recent (%d hours old) - not downloading, using local copy", age);
+			PUShowMessage(buff, SM_NOTIFY);
+#endif
+
+			return LoadOldXMLData(cat, false);
+		}
+
+		// add ETag header for conditional get
+		DBCONTACTGETSETTING cgs;
+		DBVARIANT dbv;
+		cgs.szModule = MODULE;
+		char buff[256];
+		strcpy(buff, "DataETag_");
+		strcat(buff, category_files[cat]);
+		cgs.szSetting = buff;
+		cgs.pValue = &dbv;
+		if(!CallService(MS_DB_CONTACT_GETSETTING, 0, (LPARAM)&cgs)) {
+			req.headersCount = 1;
+			req.headers = &etag_hdr;
+			etag_hdr.szName = "If-None-Match";
+			etag_hdr.szValue = _strdup(dbv.pszVal);
+			DBFreeVariant(&dbv);
+		}
+	}
+
+	req.cbSize = sizeof(req);
+	req.requestType = REQUEST_GET;
+	char URL[MAX_PATH];
+	if(!redirect_url) {
+		strcpy(URL, MIM_BACKEND_URL_PREFIX);
+		strcat(URL, category_files[cat]);
+		strcat(URL, ".bz2");
+	} else {
+		strcpy(URL, redirect_url);
+	}
+	req.szUrl = URL;
+	//req.flags = NLHRF_DUMPASTEXT; //NLHRF_SMARTREMOVEHOST | NLHRF_SMARTAUTHHEADER;
+
+	NETLIBHTTPREQUEST *resp = (NETLIBHTTPREQUEST *)CallService(MS_NETLIB_HTTPTRANSACTION, (WPARAM)hNetlibUser, (LPARAM)&req);
+	if(etag_hdr.szValue) free(etag_hdr.szValue);
+
+	if(!resp) {
+		int err = GetLastError();
+		if(err) {
+			TCHAR buff[512];
+			_stprintf(buff, TranslateT("Failed to download XML data: "));
+			int len = _tcslen(buff);
+			FormatMessage(FORMAT_MESSAGE_FROM_SYSTEM, 0, err, 0, buff + len, 512 - len, 0);
+			ShowError(buff);
+			//MessageBox(0, buff + len, Translate("Updater: Error Downloading XML Data"), MB_OK | MB_ICONWARNING);
+			char *ts = GetAString(buff);
+			NLog(ts);
+			free(ts);
+		} else {
+			ShowError(TranslateT("Failed to download XML data - Response is NULL"));
+			//MessageBox(0, "Error downloading XML data...\nResponse is NULL"), Translate("Updater Error"), MB_OK | MB_ICONWARNING);
+			NLog("Failed to download XML data - Response is NULL");
+		}
+		return LoadOldXMLData(cat, false);
+
+	} else if(resp->resultCode == 304) { // 'Not Modified' response
+		CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+		resp = 0;
+#ifdef DEBUG_HTTP_POPUPS
+		PUShowMessage("XML Data unchanged - using local copy", SM_NOTIFY);
+#endif
+		// mark data as current
+		return LoadOldXMLData(cat, true);
+	} else if(resp->resultCode >= 300 && resp->resultCode < 400) { // redirect response
+		// get new location
+		bool ret = false;
+		for(int i = 0; i < resp->headersCount; i++) {
+			//MessageBox(0, resp->headers[i].szValue, resp->headers[i].szName, MB_OK);
+			if(strcmp(resp->headers[i].szName, "Location") == 0) {
+				ret = UpdateXMLData(cat, resp->headers[i].szValue, recurse_count + 1);
+				break;
+			}
+		}
+		CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+		resp = 0;
+		if(!ret) return LoadOldXMLData(cat, false);
+
+		return ret;
+
+	} else if(resp->resultCode != 200) {
+		TCHAR buff[512];
+		_stprintf(buff, TranslateT("Failed to download XML data - Invalid response, code %d"), resp->resultCode);
+		ShowError(buff);
+
+		char *ts = GetAString(buff);
+		NLog(ts);
+		free(ts);
+		CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+		resp = 0;
+		return LoadOldXMLData(cat, false);
+	}
+		
+	// resp->resultCode == 200
+
+	if(!bz2_decompress_xml(resp->pData, resp->dataLength, &pData[cat], &dataLength[cat])) {
+		ShowError(TranslateT("Failed to decompress XML data"));
+		CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+		resp = 0;
+		return LoadOldXMLData(cat, false);
+	}
+
+	// store date header and data for response 'Not Modified' (304) above
+	for(int i = 0; i < resp->headersCount; i++) {
+		//MessageBox(0, resp->headers[i].szValue, resp->headers[i].szName, MB_OK);
+		if(strcmp(resp->headers[i].szName, "ETag") == 0) {
+			//MessageBox(0, resp->headers[i].szValue, "Storing ETag", MB_OK);
+			char buff[256];
+			strcpy(buff, "DataETag_");
+			strcat(buff, category_files[cat]);
+			DBWriteContactSettingString(0, MODULE, buff, resp->headers[i].szValue);
+		}
+	}
+
+	CallService(MS_NETLIB_FREEHTTPREQUESTSTRUCT, 0, (LPARAM)resp);
+	resp = 0;
+
+	doc[cat] = new TiXmlDocument;
+	doc[cat]->Parse((char *)pData[cat], 0, TIXML_DEFAULT_ENCODING);
+	if(doc[cat]->Error()) {
+		FreeXMLData(cat);
+		return false;
+	}
+
+	SaveXMLData(cat);
+
+	return true;
+}
+
+bool GetXMLData(BYTE **pDat, int &dataLen, const Category cat) {
+	if(pData[cat] && dataLength[cat]) {
+		*pDat = pData[cat];
+		dataLen = dataLength[cat];
+		return true;
+	} else
+		return false;
+}
+
+bool VersionLess(char *current, char *potential) {
+	DWORD dwCur, dwPot;
+	if(VersionFromString(current, &dwCur) && VersionFromString(potential, &dwPot)) {
+		switch(options.ver_req) {
+		case VR_MAJOR:
+			dwCur &= 0xFF000000;
+			dwPot &= 0xFF000000;
+			break;
+		case VR_MINOR:
+			dwCur &= 0xFFFF0000;
+			dwPot &= 0xFFFF0000;
+			break;
+		case VR_RELEASE:
+			dwCur &= 0xFFFFFF00;
+			dwPot &= 0xFFFFFF00;
+			break;
+		case VR_BUILD:
+			break;
+		}
+		return dwCur < dwPot;
+	}
+	return false;
+}
+
+char *FindVersion(int file_id, BYTE *pbVersionBytes, int cpbVersionBytes, const Category cat) {
+
+	if(!doc[cat]) return 0;
+
+	char version_string[128];
+	strncpy(version_string, (char *)pbVersionBytes, cpbVersionBytes);
+	version_string[cpbVersionBytes] = 0;
+
+	char *version;
+	int id = -1;
+	TiXmlElement *root = doc[cat]->RootElement();
+	for(TiXmlElement *el = root->FirstChildElement()->FirstChildElement(); el; el = el->NextSiblingElement()) {
+		if(strcmp(el->Value(), "item") == 0) {
+			version = 0;
+			for(TiXmlElement *el2 = el->FirstChildElement()->NextSiblingElement(); el2; el2 = el2->NextSiblingElement()) {
+				if(strcmp(el2->Value(), "id") == 0) {
+					id = atoi(el2->FirstChild()->Value());
+				}
+				if(strcmp(el2->Value(), "version") == 0) {
+					version = _strdup(el2->FirstChild()->Value());
+				}
+			}
+			if(id == file_id && version) {
+				if(strncmp(version, (char *)pbVersionBytes, cpbVersionBytes) == 0) {
+					free(version);
+					return _strdup("same");
+				} else {
+					if(VersionLess(version_string, version)) {
+						return version;
+					} else {
+						free(version);
+						return _strdup("same");
+					}
+				}
+			} else
+				if(version) free(version);
+		}
+	}
+
+	return 0;
+}
+
+int FindFileID(const char *name, const Category cat, UpdateList *update_list) {
+
+	if(!doc[cat]) return -1;
+
+	// ignore case in name
+	char *lowname = _strdup(name); strlwr(lowname);
+	
+	const char *fl_name;
+	char *namelwr;
+	int id = -1;
+
+	TiXmlElement *root = doc[cat]->RootElement();
+	for(TiXmlElement *el = root->FirstChildElement("channel")->FirstChildElement("item"); el; el = el->NextSiblingElement("item")) {
+		if(strcmp(el->Value(), "item") == 0) {
+			fl_name = el->FirstChildElement("title")->FirstChild()->Value();
+			namelwr = _strdup(fl_name); strlwr(namelwr);
+			if(strcmp(lowname, namelwr) == 0) {
+				for(TiXmlElement *el2 = el->FirstChildElement()->NextSiblingElement(); el2; el2 = el2->NextSiblingElement()) {
+					if(strcmp(el2->Value(), "id") == 0) {
+						id = atoi(el2->FirstChild()->Value());
+					} else if(strcmp(el2->Value(), "subcategory") == 0 && strcmp(el2->FirstChild()->Value(), "Archived") == 0) {
+						id = -1; // this is an archived release with the same name - skip
+						break;
+					}
+				}
+			}
+			free(namelwr);
+			if(id != -1) break; // we found a non-archived release
+		}
+	}
+
+	free(lowname);
+
+	if(id == -1 && update_list) {
+		// couldn't find it in xml file - check if a plugin gave us a file id for a different shortName
+		for(update_list->reset(); update_list->current(); update_list->next()) {
+			if(update_list->current()->file_id != -1 && strcmp(update_list->current()->update.szComponentName, name) == 0) {
+				id = update_list->current()->file_id;
+				break;
+			}
+		}
+	}
+
+	return id;
+}
+
+void UpdateFLIDs(UpdateList &update_list) {
+	for(update_list.reset(); update_list.current(); update_list.next()) {
+		if(update_list.current()->file_id == -1 && update_list.current()->update.szUpdateURL && strcmp(update_list.current()->update.szUpdateURL, UPDATER_AUTOREGISTER) == 0) {
+			int file_id = FindFileID(update_list.current()->update.szComponentName, MC_PLUGINS, 0);
+			if(file_id == -1)
+				file_id = FindFileID(update_list.current()->update.szComponentName, MC_LOCALIZATION, 0);
+			if(file_id != -1) {
+				update_list.current()->file_id = file_id;
+				char *buff = (char *)safe_alloc(strlen(MIM_DOWNLOAD_URL_PREFIX) + 9);
+				sprintf(buff, MIM_DOWNLOAD_URL_PREFIX "%d", file_id);
+				update_list.current()->update.szUpdateURL = buff;
+				update_list.current()->shortName = safe_strdup(update_list.current()->update.szComponentName);
+
+				if(update_list.current()->update.szBetaVersionURL) {
+					update_list.current()->update_options.fixed = false;
+					LoadUpdateOptions(update_list.current()->update.szComponentName, &update_list.current()->update_options);
+				}
+			}
+		}
+	}
+}
diff --git a/updater/xmldata.h b/updater/xmldata.h
new file mode 100644
index 0000000..26b93e8
--- /dev/null
+++ b/updater/xmldata.h
@@ -0,0 +1,29 @@
+#ifndef _XMLDATA_INC
+#define _XMLDATA_INC
+
+#include "options.h"
+#include "bzip2-1.0.3/bzlib.h"
+#include "utils.h"
+#include "popups.h"
+#include "services.h"
+
+#define MIM_BACKEND_URL_PREFIX		"http://addons.miranda-im.org/backend/"
+#define MIM_DOWNLOAD_URL_PREFIX		"http://addons.miranda-im.org/feed.php?dlfile="
+#define MIM_VIEW_URL_PREFIX			"http://addons.miranda-im.org/details.php?action=viewfile&id="
+#define MIM_CHANGELOG_URL_PREFIX	"http://addons.miranda-im.org/details.php?action=viewlog&id="
+// this is the minimum age (in hours) of the local copy before a new download is allowed
+#define	MIN_XMLDATA_AGE		8
+
+void FreeXMLData(const Category cat);
+bool OldXMLDataExists(const Category cat);
+bool LoadOldXMLData(const Category cat, bool update_age);
+bool UpdateXMLData(const Category cat, const char *redirect_url = 0, int recurse_count = 0);
+bool XMLDataAvailable(const Category cat);
+
+char *FindVersion(int fileID, BYTE *pbVersionBytes, int cpbVersionBytes, const Category cat);
+int FindFileID(const char *name, const Category cat, UpdateList *update_list);
+
+// update file listing id's for non-plugin AUTOREGISTER components
+void UpdateFLIDs(UpdateList &update_list);
+
+#endif
diff --git a/updater/zlib123/ChangeLog b/updater/zlib123/ChangeLog
new file mode 100644
index 0000000..1ac9463
--- /dev/null
+++ b/updater/zlib123/ChangeLog
@@ -0,0 +1,855 @@
+
+                ChangeLog file for zlib
+
+Changes in 1.2.3 (18 July 2005)
+- Apply security vulnerability fixes to contrib/infback9 as well
+- Clean up some text files (carriage returns, trailing space)
+- Update testzlib, vstudio, masmx64, and masmx86 in contrib [Vollant]
+
+Changes in 1.2.2.4 (11 July 2005)
+- Add inflatePrime() function for starting inflation at bit boundary
+- Avoid some Visual C warnings in deflate.c
+- Avoid more silly Visual C warnings in inflate.c and inftrees.c for 64-bit
+  compile
+- Fix some spelling errors in comments [Betts]
+- Correct inflateInit2() error return documentation in zlib.h
+- Added zran.c example of compressed data random access to examples
+  directory, shows use of inflatePrime()
+- Fix cast for assignments to strm->state in inflate.c and infback.c
+- Fix zlibCompileFlags() in zutil.c to use 1L for long shifts [Oberhumer]
+- Move declarations of gf2 functions to right place in crc32.c [Oberhumer]
+- Add cast in trees.c t avoid a warning [Oberhumer]
+- Avoid some warnings in fitblk.c, gun.c, gzjoin.c in examples [Oberhumer]
+- Update make_vms.com [Zinser]
+- Initialize state->write in inflateReset() since copied in inflate_fast()
+- Be more strict on incomplete code sets in inflate_table() and increase
+  ENOUGH and MAXD -- this repairs a possible security vulnerability for
+  invalid inflate input.  Thanks to Tavis Ormandy and Markus Oberhumer for
+  discovering the vulnerability and providing test cases.
+- Add ia64 support to configure for HP-UX [Smith]
+- Add error return to gzread() for format or i/o error [Levin]
+- Use malloc.h for OS/2 [Necasek]
+
+Changes in 1.2.2.3 (27 May 2005)
+- Replace 1U constants in inflate.c and inftrees.c for 64-bit compile
+- Typecast fread() return values in gzio.c [Vollant]
+- Remove trailing space in minigzip.c outmode (VC++ can't deal with it)
+- Fix crc check bug in gzread() after gzungetc() [Heiner]
+- Add the deflateTune() function to adjust internal compression parameters
+- Add a fast gzip decompressor, gun.c, to examples (use of inflateBack)
+- Remove an incorrect assertion in examples/zpipe.c
+- Add C++ wrapper in infback9.h [Donais]
+- Fix bug in inflateCopy() when decoding fixed codes
+- Note in zlib.h how much deflateSetDictionary() actually uses
+- Remove USE_DICT_HEAD in deflate.c (would mess up inflate if used)
+- Add _WIN32_WCE to define WIN32 in zconf.in.h [Spencer]
+- Don't include stderr.h or errno.h for _WIN32_WCE in zutil.h [Spencer]
+- Add gzdirect() function to indicate transparent reads
+- Update contrib/minizip [Vollant]
+- Fix compilation of deflate.c when both ASMV and FASTEST [Oberhumer]
+- Add casts in crc32.c to avoid warnings [Oberhumer]
+- Add contrib/masmx64 [Vollant]
+- Update contrib/asm586, asm686, masmx86, testzlib, vstudio [Vollant]
+
+Changes in 1.2.2.2 (30 December 2004)
+- Replace structure assignments in deflate.c and inflate.c with zmemcpy to
+  avoid implicit memcpy calls (portability for no-library compilation)
+- Increase sprintf() buffer size in gzdopen() to allow for large numbers
+- Add INFLATE_STRICT to check distances against zlib header
+- Improve WinCE errno handling and comments [Chang]
+- Remove comment about no gzip header processing in FAQ
+- Add Z_FIXED strategy option to deflateInit2() to force fixed trees
+- Add updated make_vms.com [Coghlan], update README
+- Create a new "examples" directory, move gzappend.c there, add zpipe.c,
+  fitblk.c, gzlog.[ch], gzjoin.c, and zlib_how.html.
+- Add FAQ entry and comments in deflate.c on uninitialized memory access
+- Add Solaris 9 make options in configure [Gilbert]
+- Allow strerror() usage in gzio.c for STDC
+- Fix DecompressBuf in contrib/delphi/ZLib.pas [ManChesTer]
+- Update contrib/masmx86/inffas32.asm and gvmat32.asm [Vollant]
+- Use z_off_t for adler32_combine() and crc32_combine() lengths
+- Make adler32() much faster for small len
+- Use OS_CODE in deflate() default gzip header
+
+Changes in 1.2.2.1 (31 October 2004)
+- Allow inflateSetDictionary() call for raw inflate
+- Fix inflate header crc check bug for file names and comments
+- Add deflateSetHeader() and gz_header structure for custom gzip headers
+- Add inflateGetheader() to retrieve gzip headers
+- Add crc32_combine() and adler32_combine() functions
+- Add alloc_func, free_func, in_func, out_func to Z_PREFIX list
+- Use zstreamp consistently in zlib.h (inflate_back functions)
+- Remove GUNZIP condition from definition of inflate_mode in inflate.h
+  and in contrib/inflate86/inffast.S [Truta, Anderson]
+- Add support for AMD64 in contrib/inflate86/inffas86.c [Anderson]
+- Update projects/README.projects and projects/visualc6 [Truta]
+- Update win32/DLL_FAQ.txt [Truta]
+- Avoid warning under NO_GZCOMPRESS in gzio.c; fix typo [Truta]
+- Deprecate Z_ASCII; use Z_TEXT instead [Truta]
+- Use a new algorithm for setting strm->data_type in trees.c [Truta]
+- Do not define an exit() prototype in zutil.c unless DEBUG defined
+- Remove prototype of exit() from zutil.c, example.c, minigzip.c [Truta]
+- Add comment in zlib.h for Z_NO_FLUSH parameter to deflate()
+- Fix Darwin build version identification [Peterson]
+
+Changes in 1.2.2 (3 October 2004)
+- Update zlib.h comments on gzip in-memory processing
+- Set adler to 1 in inflateReset() to support Java test suite [Walles]
+- Add contrib/dotzlib [Ravn]
+- Update win32/DLL_FAQ.txt [Truta]
+- Update contrib/minizip [Vollant]
+- Move contrib/visual-basic.txt to old/ [Truta]
+- Fix assembler builds in projects/visualc6/ [Truta]
+
+Changes in 1.2.1.2 (9 September 2004)
+- Update INDEX file
+- Fix trees.c to update strm->data_type (no one ever noticed!)
+- Fix bug in error case in inflate.c, infback.c, and infback9.c [Brown]
+- Add "volatile" to crc table flag declaration (for DYNAMIC_CRC_TABLE)
+- Add limited multitasking protection to DYNAMIC_CRC_TABLE
+- Add NO_vsnprintf for VMS in zutil.h [Mozilla]
+- Don't declare strerror() under VMS [Mozilla]
+- Add comment to DYNAMIC_CRC_TABLE to use get_crc_table() to initialize
+- Update contrib/ada [Anisimkov]
+- Update contrib/minizip [Vollant]
+- Fix configure to not hardcode directories for Darwin [Peterson]
+- Fix gzio.c to not return error on empty files [Brown]
+- Fix indentation; update version in contrib/delphi/ZLib.pas and
+  contrib/pascal/zlibpas.pas [Truta]
+- Update mkasm.bat in contrib/masmx86 [Truta]
+- Update contrib/untgz [Truta]
+- Add projects/README.projects [Truta]
+- Add project for MS Visual C++ 6.0 in projects/visualc6 [Cadieux, Truta]
+- Update win32/DLL_FAQ.txt [Truta]
+- Update list of Z_PREFIX symbols in zconf.h [Randers-Pehrson, Truta]
+- Remove an unnecessary assignment to curr in inftrees.c [Truta]
+- Add OS/2 to exe builds in configure [Poltorak]
+- Remove err dummy parameter in zlib.h [Kientzle]
+
+Changes in 1.2.1.1 (9 January 2004)
+- Update email address in README
+- Several FAQ updates
+- Fix a big fat bug in inftrees.c that prevented decoding valid
+  dynamic blocks with only literals and no distance codes --
+  Thanks to "Hot Emu" for the bug report and sample file
+- Add a note to puff.c on no distance codes case.
+
+Changes in 1.2.1 (17 November 2003)
+- Remove a tab in contrib/gzappend/gzappend.c
+- Update some interfaces in contrib for new zlib functions
+- Update zlib version number in some contrib entries
+- Add Windows CE definition for ptrdiff_t in zutil.h [Mai, Truta]
+- Support shared libraries on Hurd and KFreeBSD [Brown]
+- Fix error in NO_DIVIDE option of adler32.c
+
+Changes in 1.2.0.8 (4 November 2003)
+- Update version in contrib/delphi/ZLib.pas and contrib/pascal/zlibpas.pas
+- Add experimental NO_DIVIDE #define in adler32.c
+    - Possibly faster on some processors (let me know if it is)
+- Correct Z_BLOCK to not return on first inflate call if no wrap
+- Fix strm->data_type on inflate() return to correctly indicate EOB
+- Add deflatePrime() function for appending in the middle of a byte
+- Add contrib/gzappend for an example of appending to a stream
+- Update win32/DLL_FAQ.txt [Truta]
+- Delete Turbo C comment in README [Truta]
+- Improve some indentation in zconf.h [Truta]
+- Fix infinite loop on bad input in configure script [Church]
+- Fix gzeof() for concatenated gzip files [Johnson]
+- Add example to contrib/visual-basic.txt [Michael B.]
+- Add -p to mkdir's in Makefile.in [vda]
+- Fix configure to properly detect presence or lack of printf functions
+- Add AS400 support [Monnerat]
+- Add a little Cygwin support [Wilson]
+
+Changes in 1.2.0.7 (21 September 2003)
+- Correct some debug formats in contrib/infback9
+- Cast a type in a debug statement in trees.c
+- Change search and replace delimiter in configure from % to # [Beebe]
+- Update contrib/untgz to 0.2 with various fixes [Truta]
+- Add build support for Amiga [Nikl]
+- Remove some directories in old that have been updated to 1.2
+- Add dylib building for Mac OS X in configure and Makefile.in
+- Remove old distribution stuff from Makefile
+- Update README to point to DLL_FAQ.txt, and add comment on Mac OS X
+- Update links in README
+
+Changes in 1.2.0.6 (13 September 2003)
+- Minor FAQ updates
+- Update contrib/minizip to 1.00 [Vollant]
+- Remove test of gz functions in example.c when GZ_COMPRESS defined [Truta]
+- Update POSTINC comment for 68060 [Nikl]
+- Add contrib/infback9 with deflate64 decoding (unsupported)
+- For MVS define NO_vsnprintf and undefine FAR [van Burik]
+- Add pragma for fdopen on MVS [van Burik]
+
+Changes in 1.2.0.5 (8 September 2003)
+- Add OF to inflateBackEnd() declaration in zlib.h
+- Remember start when using gzdopen in the middle of a file
+- Use internal off_t counters in gz* functions to properly handle seeks
+- Perform more rigorous check for distance-too-far in inffast.c
+- Add Z_BLOCK flush option to return from inflate at block boundary
+- Set strm->data_type on return from inflate
+    - Indicate bits unused, if at block boundary, and if in last block
+- Replace size_t with ptrdiff_t in crc32.c, and check for correct size
+- Add condition so old NO_DEFLATE define still works for compatibility
+- FAQ update regarding the Windows DLL [Truta]
+- INDEX update: add qnx entry, remove aix entry [Truta]
+- Install zlib.3 into mandir [Wilson]
+- Move contrib/zlib_dll_FAQ.txt to win32/DLL_FAQ.txt; update [Truta]
+- Adapt the zlib interface to the new DLL convention guidelines [Truta]
+- Introduce ZLIB_WINAPI macro to allow the export of functions using
+  the WINAPI calling convention, for Visual Basic [Vollant, Truta]
+- Update msdos and win32 scripts and makefiles [Truta]
+- Export symbols by name, not by ordinal, in win32/zlib.def [Truta]
+- Add contrib/ada [Anisimkov]
+- Move asm files from contrib/vstudio/vc70_32 to contrib/asm386 [Truta]
+- Rename contrib/asm386 to contrib/masmx86 [Truta, Vollant]
+- Add contrib/masm686 [Truta]
+- Fix offsets in contrib/inflate86 and contrib/masmx86/inffas32.asm
+  [Truta, Vollant]
+- Update contrib/delphi; rename to contrib/pascal; add example [Truta]
+- Remove contrib/delphi2; add a new contrib/delphi [Truta]
+- Avoid inclusion of the nonstandard <memory.h> in contrib/iostream,
+  and fix some method prototypes [Truta]
+- Fix the ZCR_SEED2 constant to avoid warnings in contrib/minizip
+  [Truta]
+- Avoid the use of backslash (\) in contrib/minizip [Vollant]
+- Fix file time handling in contrib/untgz; update makefiles [Truta]
+- Update contrib/vstudio/vc70_32 to comply with the new DLL guidelines
+  [Vollant]
+- Remove contrib/vstudio/vc15_16 [Vollant]
+- Rename contrib/vstudio/vc70_32 to contrib/vstudio/vc7 [Truta]
+- Update README.contrib [Truta]
+- Invert the assignment order of match_head and s->prev[...] in
+  INSERT_STRING [Truta]
+- Compare TOO_FAR with 32767 instead of 32768, to avoid 16-bit warnings
+  [Truta]
+- Compare function pointers with 0, not with NULL or Z_NULL [Truta]
+- Fix prototype of syncsearch in inflate.c [Truta]
+- Introduce ASMINF macro to be enabled when using an ASM implementation
+  of inflate_fast [Truta]
+- Change NO_DEFLATE to NO_GZCOMPRESS [Truta]
+- Modify test_gzio in example.c to take a single file name as a
+  parameter [Truta]
+- Exit the example.c program if gzopen fails [Truta]
+- Add type casts around strlen in example.c [Truta]
+- Remove casting to sizeof in minigzip.c; give a proper type
+  to the variable compared with SUFFIX_LEN [Truta]
+- Update definitions of STDC and STDC99 in zconf.h [Truta]
+- Synchronize zconf.h with the new Windows DLL interface [Truta]
+- Use SYS16BIT instead of __32BIT__ to distinguish between
+  16- and 32-bit platforms [Truta]
+- Use far memory allocators in small 16-bit memory models for
+  Turbo C [Truta]
+- Add info about the use of ASMV, ASMINF and ZLIB_WINAPI in
+  zlibCompileFlags [Truta]
+- Cygwin has vsnprintf [Wilson]
+- In Windows16, OS_CODE is 0, as in MSDOS [Truta]
+- In Cygwin, OS_CODE is 3 (Unix), not 11 (Windows32) [Wilson]
+
+Changes in 1.2.0.4 (10 August 2003)
+- Minor FAQ updates
+- Be more strict when checking inflateInit2's windowBits parameter
+- Change NO_GUNZIP compile option to NO_GZIP to cover deflate as well
+- Add gzip wrapper option to deflateInit2 using windowBits
+- Add updated QNX rule in configure and qnx directory [Bonnefoy]
+- Make inflate distance-too-far checks more rigorous
+- Clean up FAR usage in inflate
+- Add casting to sizeof() in gzio.c and minigzip.c
+
+Changes in 1.2.0.3 (19 July 2003)
+- Fix silly error in gzungetc() implementation [Vollant]
+- Update contrib/minizip and contrib/vstudio [Vollant]
+- Fix printf format in example.c
+- Correct cdecl support in zconf.in.h [Anisimkov]
+- Minor FAQ updates
+
+Changes in 1.2.0.2 (13 July 2003)
+- Add ZLIB_VERNUM in zlib.h for numerical preprocessor comparisons
+- Attempt to avoid warnings in crc32.c for pointer-int conversion
+- Add AIX to configure, remove aix directory [Bakker]
+- Add some casts to minigzip.c
+- Improve checking after insecure sprintf() or vsprintf() calls
+- Remove #elif's from crc32.c
+- Change leave label to inf_leave in inflate.c and infback.c to avoid
+  library conflicts
+- Remove inflate gzip decoding by default--only enable gzip decoding by
+  special request for stricter backward compatibility
+- Add zlibCompileFlags() function to return compilation information
+- More typecasting in deflate.c to avoid warnings
+- Remove leading underscore from _Capital #defines [Truta]
+- Fix configure to link shared library when testing
+- Add some Windows CE target adjustments [Mai]
+- Remove #define ZLIB_DLL in zconf.h [Vollant]
+- Add zlib.3 [Rodgers]
+- Update RFC URL in deflate.c and algorithm.txt [Mai]
+- Add zlib_dll_FAQ.txt to contrib [Truta]
+- Add UL to some constants [Truta]
+- Update minizip and vstudio [Vollant]
+- Remove vestigial NEED_DUMMY_RETURN from zconf.in.h
+- Expand use of NO_DUMMY_DECL to avoid all dummy structures
+- Added iostream3 to contrib [Schwardt]
+- Replace rewind() with fseek() for WinCE [Truta]
+- Improve setting of zlib format compression level flags
+    - Report 0 for huffman and rle strategies and for level == 0 or 1
+    - Report 2 only for level == 6
+- Only deal with 64K limit when necessary at compile time [Truta]
+- Allow TOO_FAR check to be turned off at compile time [Truta]
+- Add gzclearerr() function [Souza]
+- Add gzungetc() function
+
+Changes in 1.2.0.1 (17 March 2003)
+- Add Z_RLE strategy for run-length encoding [Truta]
+    - When Z_RLE requested, restrict matches to distance one
+    - Update zlib.h, minigzip.c, gzopen(), gzdopen() for Z_RLE
+- Correct FASTEST compilation to allow level == 0
+- Clean up what gets compiled for FASTEST
+- Incorporate changes to zconf.in.h [Vollant]
+    - Refine detection of Turbo C need for dummy returns
+    - Refine ZLIB_DLL compilation
+    - Include additional header file on VMS for off_t typedef
+- Try to use _vsnprintf where it supplants vsprintf [Vollant]
+- Add some casts in inffast.c
+- Enchance comments in zlib.h on what happens if gzprintf() tries to
+  write more than 4095 bytes before compression
+- Remove unused state from inflateBackEnd()
+- Remove exit(0) from minigzip.c, example.c
+- Get rid of all those darn tabs
+- Add "check" target to Makefile.in that does the same thing as "test"
+- Add "mostlyclean" and "maintainer-clean" targets to Makefile.in
+- Update contrib/inflate86 [Anderson]
+- Update contrib/testzlib, contrib/vstudio, contrib/minizip [Vollant]
+- Add msdos and win32 directories with makefiles [Truta]
+- More additions and improvements to the FAQ
+
+Changes in 1.2.0 (9 March 2003)
+- New and improved inflate code
+    - About 20% faster
+    - Does not allocate 32K window unless and until needed
+    - Automatically detects and decompresses gzip streams
+    - Raw inflate no longer needs an extra dummy byte at end
+    - Added inflateBack functions using a callback interface--even faster
+      than inflate, useful for file utilities (gzip, zip)
+    - Added inflateCopy() function to record state for random access on
+      externally generated deflate streams (e.g. in gzip files)
+    - More readable code (I hope)
+- New and improved crc32()
+    - About 50% faster, thanks to suggestions from Rodney Brown
+- Add deflateBound() and compressBound() functions
+- Fix memory leak in deflateInit2()
+- Permit setting dictionary for raw deflate (for parallel deflate)
+- Fix const declaration for gzwrite()
+- Check for some malloc() failures in gzio.c
+- Fix bug in gzopen() on single-byte file 0x1f
+- Fix bug in gzread() on concatenated file with 0x1f at end of buffer
+  and next buffer doesn't start with 0x8b
+- Fix uncompress() to return Z_DATA_ERROR on truncated input
+- Free memory at end of example.c
+- Remove MAX #define in trees.c (conflicted with some libraries)
+- Fix static const's in deflate.c, gzio.c, and zutil.[ch]
+- Declare malloc() and free() in gzio.c if STDC not defined
+- Use malloc() instead of calloc() in zutil.c if int big enough
+- Define STDC for AIX
+- Add aix/ with approach for compiling shared library on AIX
+- Add HP-UX support for shared libraries in configure
+- Add OpenUNIX support for shared libraries in configure
+- Use $cc instead of gcc to build shared library
+- Make prefix directory if needed when installing
+- Correct Macintosh avoidance of typedef Byte in zconf.h
+- Correct Turbo C memory allocation when under Linux
+- Use libz.a instead of -lz in Makefile (assure use of compiled library)
+- Update configure to check for snprintf or vsnprintf functions and their
+  return value, warn during make if using an insecure function
+- Fix configure problem with compile-time knowledge of HAVE_UNISTD_H that
+  is lost when library is used--resolution is to build new zconf.h
+- Documentation improvements (in zlib.h):
+    - Document raw deflate and inflate
+    - Update RFCs URL
+    - Point out that zlib and gzip formats are different
+    - Note that Z_BUF_ERROR is not fatal
+    - Document string limit for gzprintf() and possible buffer overflow
+    - Note requirement on avail_out when flushing
+    - Note permitted values of flush parameter of inflate()
+- Add some FAQs (and even answers) to the FAQ
+- Add contrib/inflate86/ for x86 faster inflate
+- Add contrib/blast/ for PKWare Data Compression Library decompression
+- Add contrib/puff/ simple inflate for deflate format description
+
+Changes in 1.1.4 (11 March 2002)
+- ZFREE was repeated on same allocation on some error conditions.
+  This creates a security problem described in
+  http://www.zlib.org/advisory-2002-03-11.txt
+- Returned incorrect error (Z_MEM_ERROR) on some invalid data
+- Avoid accesses before window for invalid distances with inflate window
+  less than 32K.
+- force windowBits > 8 to avoid a bug in the encoder for a window size
+  of 256 bytes. (A complete fix will be available in 1.1.5).
+
+Changes in 1.1.3 (9 July 1998)
+- fix "an inflate input buffer bug that shows up on rare but persistent
+  occasions" (Mark)
+- fix gzread and gztell for concatenated .gz files (Didier Le Botlan)
+- fix gzseek(..., SEEK_SET) in write mode
+- fix crc check after a gzeek (Frank Faubert)
+- fix miniunzip when the last entry in a zip file is itself a zip file
+  (J Lillge)
+- add contrib/asm586 and contrib/asm686 (Brian Raiter)
+  See http://www.muppetlabs.com/~breadbox/software/assembly.html
+- add support for Delphi 3 in contrib/delphi (Bob Dellaca)
+- add support for C++Builder 3 and Delphi 3 in contrib/delphi2 (Davide Moretti)
+- do not exit prematurely in untgz if 0 at start of block (Magnus Holmgren)
+- use macro EXTERN instead of extern to support DLL for BeOS (Sander Stoks)
+- added a FAQ file
+
+- Support gzdopen on Mac with Metrowerks (Jason Linhart)
+- Do not redefine Byte on Mac (Brad Pettit & Jason Linhart)
+- define SEEK_END too if SEEK_SET is not defined (Albert Chin-A-Young)
+- avoid some warnings with Borland C (Tom Tanner)
+- fix a problem in contrib/minizip/zip.c for 16-bit MSDOS (Gilles Vollant)
+- emulate utime() for WIN32 in contrib/untgz  (Gilles Vollant)
+- allow several arguments to configure (Tim Mooney, Frodo Looijaard)
+- use libdir and includedir in Makefile.in (Tim Mooney)
+- support shared libraries on OSF1 V4 (Tim Mooney)
+- remove so_locations in "make clean"  (Tim Mooney)
+- fix maketree.c compilation error (Glenn, Mark)
+- Python interface to zlib now in Python 1.5 (Jeremy Hylton)
+- new Makefile.riscos (Rich Walker)
+- initialize static descriptors in trees.c for embedded targets (Nick Smith)
+- use "foo-gz" in example.c for RISCOS and VMS (Nick Smith)
+- add the OS/2 files in Makefile.in too (Andrew Zabolotny)
+- fix fdopen and halloc macros for Microsoft C 6.0 (Tom Lane)
+- fix maketree.c to allow clean compilation of inffixed.h (Mark)
+- fix parameter check in deflateCopy (Gunther Nikl)
+- cleanup trees.c, use compressed_len only in debug mode (Christian Spieler)
+- Many portability patches by Christian Spieler:
+  . zutil.c, zutil.h: added "const" for zmem*
+  . Make_vms.com: fixed some typos
+  . Make_vms.com: msdos/Makefile.*: removed zutil.h from some dependency lists
+  . msdos/Makefile.msc: remove "default rtl link library" info from obj files
+  . msdos/Makefile.*: use model-dependent name for the built zlib library
+  . msdos/Makefile.emx, nt/Makefile.emx, nt/Makefile.gcc:
+     new makefiles, for emx (DOS/OS2), emx&rsxnt and mingw32 (Windows 9x / NT)
+- use define instead of typedef for Bytef also for MSC small/medium (Tom Lane)
+- replace __far with _far for better portability (Christian Spieler, Tom Lane)
+- fix test for errno.h in configure (Tim Newsham)
+
+Changes in 1.1.2 (19 March 98)
+- added contrib/minzip, mini zip and unzip based on zlib (Gilles Vollant)
+  See http://www.winimage.com/zLibDll/unzip.html
+- preinitialize the inflate tables for fixed codes, to make the code
+  completely thread safe (Mark)
+- some simplifications and slight speed-up to the inflate code (Mark)
+- fix gzeof on non-compressed files (Allan Schrum)
+- add -std1 option in configure for OSF1 to fix gzprintf (Martin Mokrejs)
+- use default value of 4K for Z_BUFSIZE for 16-bit MSDOS (Tim Wegner + Glenn)
+- added os2/Makefile.def and os2/zlib.def (Andrew Zabolotny)
+- add shared lib support for UNIX_SV4.2MP (MATSUURA Takanori)
+- do not wrap extern "C" around system includes (Tom Lane)
+- mention zlib binding for TCL in README (Andreas Kupries)
+- added amiga/Makefile.pup for Amiga powerUP SAS/C PPC (Andreas Kleinert)
+- allow "make install prefix=..." even after configure (Glenn Randers-Pehrson)
+- allow "configure --prefix $HOME" (Tim Mooney)
+- remove warnings in example.c and gzio.c (Glenn Randers-Pehrson)
+- move Makefile.sas to amiga/Makefile.sas
+
+Changes in 1.1.1 (27 Feb 98)
+- fix macros _tr_tally_* in deflate.h for debug mode  (Glenn Randers-Pehrson)
+- remove block truncation heuristic which had very marginal effect for zlib
+  (smaller lit_bufsize than in gzip 1.2.4) and degraded a little the
+  compression ratio on some files. This also allows inlining _tr_tally for
+  matches in deflate_slow.
+- added msdos/Makefile.w32 for WIN32 Microsoft Visual C++ (Bob Frazier)
+
+Changes in 1.1.0 (24 Feb 98)
+- do not return STREAM_END prematurely in inflate (John Bowler)
+- revert to the zlib 1.0.8 inflate to avoid the gcc 2.8.0 bug (Jeremy Buhler)
+- compile with -DFASTEST to get compression code optimized for speed only
+- in minigzip, try mmap'ing the input file first (Miguel Albrecht)
+- increase size of I/O buffers in minigzip.c and gzio.c (not a big gain
+  on Sun but significant on HP)
+
+- add a pointer to experimental unzip library in README (Gilles Vollant)
+- initialize variable gcc in configure (Chris Herborth)
+
+Changes in 1.0.9 (17 Feb 1998)
+- added gzputs and gzgets functions
+- do not clear eof flag in gzseek (Mark Diekhans)
+- fix gzseek for files in transparent mode (Mark Diekhans)
+- do not assume that vsprintf returns the number of bytes written (Jens Krinke)
+- replace EXPORT with ZEXPORT to avoid conflict with other programs
+- added compress2 in zconf.h, zlib.def, zlib.dnt
+- new asm code from Gilles Vollant in contrib/asm386
+- simplify the inflate code (Mark):
+ . Replace ZALLOC's in huft_build() with single ZALLOC in inflate_blocks_new()
+ . ZALLOC the length list in inflate_trees_fixed() instead of using stack
+ . ZALLOC the value area for huft_build() instead of using stack
+ . Simplify Z_FINISH check in inflate()
+
+- Avoid gcc 2.8.0 comparison bug a little differently than zlib 1.0.8
+- in inftrees.c, avoid cc -O bug on HP (Farshid Elahi)
+- in zconf.h move the ZLIB_DLL stuff earlier to avoid problems with
+  the declaration of FAR (Gilles VOllant)
+- install libz.so* with mode 755 (executable) instead of 644 (Marc Lehmann)
+- read_buf buf parameter of type Bytef* instead of charf*
+- zmemcpy parameters are of type Bytef*, not charf* (Joseph Strout)
+- do not redeclare unlink in minigzip.c for WIN32 (John Bowler)
+- fix check for presence of directories in "make install" (Ian Willis)
+
+Changes in 1.0.8 (27 Jan 1998)
+- fixed offsets in contrib/asm386/gvmat32.asm (Gilles Vollant)
+- fix gzgetc and gzputc for big endian systems (Markus Oberhumer)
+- added compress2() to allow setting the compression level
+- include sys/types.h to get off_t on some systems (Marc Lehmann & QingLong)
+- use constant arrays for the static trees in trees.c instead of computing
+  them at run time (thanks to Ken Raeburn for this suggestion). To create
+  trees.h, compile with GEN_TREES_H and run "make test".
+- check return code of example in "make test" and display result
+- pass minigzip command line options to file_compress
+- simplifying code of inflateSync to avoid gcc 2.8 bug
+
+- support CC="gcc -Wall" in configure -s (QingLong)
+- avoid a flush caused by ftell in gzopen for write mode (Ken Raeburn)
+- fix test for shared library support to avoid compiler warnings
+- zlib.lib -> zlib.dll in msdos/zlib.rc (Gilles Vollant)
+- check for TARGET_OS_MAC in addition to MACOS (Brad Pettit)
+- do not use fdopen for Metrowerks on Mac (Brad Pettit))
+- add checks for gzputc and gzputc in example.c
+- avoid warnings in gzio.c and deflate.c (Andreas Kleinert)
+- use const for the CRC table (Ken Raeburn)
+- fixed "make uninstall" for shared libraries
+- use Tracev instead of Trace in infblock.c
+- in example.c use correct compressed length for test_sync
+- suppress +vnocompatwarnings in configure for HPUX (not always supported)
+
+Changes in 1.0.7 (20 Jan 1998)
+- fix gzseek which was broken in write mode
+- return error for gzseek to negative absolute position
+- fix configure for Linux (Chun-Chung Chen)
+- increase stack space for MSC (Tim Wegner)
+- get_crc_table and inflateSyncPoint are EXPORTed (Gilles Vollant)
+- define EXPORTVA for gzprintf (Gilles Vollant)
+- added man page zlib.3 (Rick Rodgers)
+- for contrib/untgz, fix makedir() and improve Makefile
+
+- check gzseek in write mode in example.c
+- allocate extra buffer for seeks only if gzseek is actually called
+- avoid signed/unsigned comparisons (Tim Wegner, Gilles Vollant)
+- add inflateSyncPoint in zconf.h
+- fix list of exported functions in nt/zlib.dnt and mdsos/zlib.def
+
+Changes in 1.0.6 (19 Jan 1998)
+- add functions gzprintf, gzputc, gzgetc, gztell, gzeof, gzseek, gzrewind and
+  gzsetparams (thanks to Roland Giersig and Kevin Ruland for some of this code)
+- Fix a deflate bug occurring only with compression level 0 (thanks to
+  Andy Buckler for finding this one).
+- In minigzip, pass transparently also the first byte for .Z files.
+- return Z_BUF_ERROR instead of Z_OK if output buffer full in uncompress()
+- check Z_FINISH in inflate (thanks to Marc Schluper)
+- Implement deflateCopy (thanks to Adam Costello)
+- make static libraries by default in configure, add --shared option.
+- move MSDOS or Windows specific files to directory msdos
+- suppress the notion of partial flush to simplify the interface
+  (but the symbol Z_PARTIAL_FLUSH is kept for compatibility with 1.0.4)
+- suppress history buffer provided by application to simplify the interface
+  (this feature was not implemented anyway in 1.0.4)
+- next_in and avail_in must be initialized before calling inflateInit or
+  inflateInit2
+- add EXPORT in all exported functions (for Windows DLL)
+- added Makefile.nt (thanks to Stephen Williams)
+- added the unsupported "contrib" directory:
+   contrib/asm386/ by Gilles Vollant <info@winimage.com>
+        386 asm code replacing longest_match().
+   contrib/iostream/ by Kevin Ruland <kevin@rodin.wustl.edu>
+        A C++ I/O streams interface to the zlib gz* functions
+   contrib/iostream2/  by Tyge L�vset <Tyge.Lovset@cmr.no>
+        Another C++ I/O streams interface
+   contrib/untgz/  by "Pedro A. Aranda Guti\irrez" <paag@tid.es>
+        A very simple tar.gz file extractor using zlib
+   contrib/visual-basic.txt by Carlos Rios <c_rios@sonda.cl>
+        How to use compress(), uncompress() and the gz* functions from VB.
+- pass params -f (filtered data), -h (huffman only), -1 to -9 (compression
+  level) in minigzip (thanks to Tom Lane)
+
+- use const for rommable constants in deflate
+- added test for gzseek and gztell in example.c
+- add undocumented function inflateSyncPoint() (hack for Paul Mackerras)
+- add undocumented function zError to convert error code to string
+  (for Tim Smithers)
+- Allow compilation of gzio with -DNO_DEFLATE to avoid the compression code.
+- Use default memcpy for Symantec MSDOS compiler.
+- Add EXPORT keyword for check_func (needed for Windows DLL)
+- add current directory to LD_LIBRARY_PATH for "make test"
+- create also a link for libz.so.1
+- added support for FUJITSU UXP/DS (thanks to Toshiaki Nomura)
+- use $(SHAREDLIB) instead of libz.so in Makefile.in (for HPUX)
+- added -soname for Linux in configure (Chun-Chung Chen,
+- assign numbers to the exported functions in zlib.def (for Windows DLL)
+- add advice in zlib.h for best usage of deflateSetDictionary
+- work around compiler bug on Atari (cast Z_NULL in call of s->checkfn)
+- allow compilation with ANSI keywords only enabled for TurboC in large model
+- avoid "versionString"[0] (Borland bug)
+- add NEED_DUMMY_RETURN for Borland
+- use variable z_verbose for tracing in debug mode (L. Peter Deutsch).
+- allow compilation with CC
+- defined STDC for OS/2 (David Charlap)
+- limit external names to 8 chars for MVS (Thomas Lund)
+- in minigzip.c, use static buffers only for 16-bit systems
+- fix suffix check for "minigzip -d foo.gz"
+- do not return an error for the 2nd of two consecutive gzflush() (Felix Lee)
+- use _fdopen instead of fdopen for MSC >= 6.0 (Thomas Fanslau)
+- added makelcc.bat for lcc-win32 (Tom St Denis)
+- in Makefile.dj2, use copy and del instead of install and rm (Frank Donahoe)
+- Avoid expanded $Id$. Use "rcs -kb" or "cvs admin -kb" to avoid Id expansion.
+- check for unistd.h in configure (for off_t)
+- remove useless check parameter in inflate_blocks_free
+- avoid useless assignment of s->check to itself in inflate_blocks_new
+- do not flush twice in gzclose (thanks to Ken Raeburn)
+- rename FOPEN as F_OPEN to avoid clash with /usr/include/sys/file.h
+- use NO_ERRNO_H instead of enumeration of operating systems with errno.h
+- work around buggy fclose on pipes for HP/UX
+- support zlib DLL with BORLAND C++ 5.0 (thanks to Glenn Randers-Pehrson)
+- fix configure if CC is already equal to gcc
+
+Changes in 1.0.5 (3 Jan 98)
+- Fix inflate to terminate gracefully when fed corrupted or invalid data
+- Use const for rommable constants in inflate
+- Eliminate memory leaks on error conditions in inflate
+- Removed some vestigial code in inflate
+- Update web address in README
+
+Changes in 1.0.4 (24 Jul 96)
+- In very rare conditions, deflate(s, Z_FINISH) could fail to produce an EOF
+  bit, so the decompressor could decompress all the correct data but went
+  on to attempt decompressing extra garbage data. This affected minigzip too.
+- zlibVersion and gzerror return const char* (needed for DLL)
+- port to RISCOS (no fdopen, no multiple dots, no unlink, no fileno)
+- use z_error only for DEBUG (avoid problem with DLLs)
+
+Changes in 1.0.3 (2 Jul 96)
+- use z_streamp instead of z_stream *, which is now a far pointer in MSDOS
+  small and medium models; this makes the library incompatible with previous
+  versions for these models. (No effect in large model or on other systems.)
+- return OK instead of BUF_ERROR if previous deflate call returned with
+  avail_out as zero but there is nothing to do
+- added memcmp for non STDC compilers
+- define NO_DUMMY_DECL for more Mac compilers (.h files merged incorrectly)
+- define __32BIT__ if __386__ or i386 is defined (pb. with Watcom and SCO)
+- better check for 16-bit mode MSC (avoids problem with Symantec)
+
+Changes in 1.0.2 (23 May 96)
+- added Windows DLL support
+- added a function zlibVersion (for the DLL support)
+- fixed declarations using Bytef in infutil.c (pb with MSDOS medium model)
+- Bytef is define's instead of typedef'd only for Borland C
+- avoid reading uninitialized memory in example.c
+- mention in README that the zlib format is now RFC1950
+- updated Makefile.dj2
+- added algorithm.doc
+
+Changes in 1.0.1 (20 May 96) [1.0 skipped to avoid confusion]
+- fix array overlay in deflate.c which sometimes caused bad compressed data
+- fix inflate bug with empty stored block
+- fix MSDOS medium model which was broken in 0.99
+- fix deflateParams() which could generated bad compressed data.
+- Bytef is define'd instead of typedef'ed (work around Borland bug)
+- added an INDEX file
+- new makefiles for DJGPP (Makefile.dj2), 32-bit Borland (Makefile.b32),
+  Watcom (Makefile.wat), Amiga SAS/C (Makefile.sas)
+- speed up adler32 for modern machines without auto-increment
+- added -ansi for IRIX in configure
+- static_init_done in trees.c is an int
+- define unlink as delete for VMS
+- fix configure for QNX
+- add configure branch for SCO and HPUX
+- avoid many warnings (unused variables, dead assignments, etc...)
+- no fdopen for BeOS
+- fix the Watcom fix for 32 bit mode (define FAR as empty)
+- removed redefinition of Byte for MKWERKS
+- work around an MWKERKS bug (incorrect merge of all .h files)
+
+Changes in 0.99 (27 Jan 96)
+- allow preset dictionary shared between compressor and decompressor
+- allow compression level 0 (no compression)
+- add deflateParams in zlib.h: allow dynamic change of compression level
+  and compression strategy.
+- test large buffers and deflateParams in example.c
+- add optional "configure" to build zlib as a shared library
+- suppress Makefile.qnx, use configure instead
+- fixed deflate for 64-bit systems (detected on Cray)
+- fixed inflate_blocks for 64-bit systems (detected on Alpha)
+- declare Z_DEFLATED in zlib.h (possible parameter for deflateInit2)
+- always return Z_BUF_ERROR when deflate() has nothing to do
+- deflateInit and inflateInit are now macros to allow version checking
+- prefix all global functions and types with z_ with -DZ_PREFIX
+- make falloc completely reentrant (inftrees.c)
+- fixed very unlikely race condition in ct_static_init
+- free in reverse order of allocation to help memory manager
+- use zlib-1.0/* instead of zlib/* inside the tar.gz
+- make zlib warning-free with "gcc -O3 -Wall -Wwrite-strings -Wpointer-arith
+  -Wconversion -Wstrict-prototypes -Wmissing-prototypes"
+- allow gzread on concatenated .gz files
+- deflateEnd now returns Z_DATA_ERROR if it was premature
+- deflate is finally (?) fully deterministic (no matches beyond end of input)
+- Document Z_SYNC_FLUSH
+- add uninstall in Makefile
+- Check for __cpluplus in zlib.h
+- Better test in ct_align for partial flush
+- avoid harmless warnings for Borland C++
+- initialize hash_head in deflate.c
+- avoid warning on fdopen (gzio.c) for HP cc -Aa
+- include stdlib.h for STDC compilers
+- include errno.h for Cray
+- ignore error if ranlib doesn't exist
+- call ranlib twice for NeXTSTEP
+- use exec_prefix instead of prefix for libz.a
+- renamed ct_* as _tr_* to avoid conflict with applications
+- clear z->msg in inflateInit2 before any error return
+- initialize opaque in example.c, gzio.c, deflate.c and inflate.c
+- fixed typo in zconf.h (_GNUC__ => __GNUC__)
+- check for WIN32 in zconf.h and zutil.c (avoid farmalloc in 32-bit mode)
+- fix typo in Make_vms.com (f$trnlnm -> f$getsyi)
+- in fcalloc, normalize pointer if size > 65520 bytes
+- don't use special fcalloc for 32 bit Borland C++
+- use STDC instead of __GO32__ to avoid redeclaring exit, calloc, etc...
+- use Z_BINARY instead of BINARY
+- document that gzclose after gzdopen will close the file
+- allow "a" as mode in gzopen.
+- fix error checking in gzread
+- allow skipping .gz extra-field on pipes
+- added reference to Perl interface in README
+- put the crc table in FAR data (I dislike more and more the medium model :)
+- added get_crc_table
+- added a dimension to all arrays (Borland C can't count).
+- workaround Borland C bug in declaration of inflate_codes_new & inflate_fast
+- guard against multiple inclusion of *.h (for precompiled header on Mac)
+- Watcom C pretends to be Microsoft C small model even in 32 bit mode.
+- don't use unsized arrays to avoid silly warnings by Visual C++:
+     warning C4746: 'inflate_mask' : unsized array treated as  '__far'
+     (what's wrong with far data in far model?).
+- define enum out of inflate_blocks_state to allow compilation with C++
+
+Changes in 0.95 (16 Aug 95)
+- fix MSDOS small and medium model (now easier to adapt to any compiler)
+- inlined send_bits
+- fix the final (:-) bug for deflate with flush (output was correct but
+  not completely flushed in rare occasions).
+- default window size is same for compression and decompression
+  (it's now sufficient to set MAX_WBITS in zconf.h).
+- voidp -> voidpf and voidnp -> voidp (for consistency with other
+  typedefs and because voidnp was not near in large model).
+
+Changes in 0.94 (13 Aug 95)
+- support MSDOS medium model
+- fix deflate with flush (could sometimes generate bad output)
+- fix deflateReset (zlib header was incorrectly suppressed)
+- added support for VMS
+- allow a compression level in gzopen()
+- gzflush now calls fflush
+- For deflate with flush, flush even if no more input is provided.
+- rename libgz.a as libz.a
+- avoid complex expression in infcodes.c triggering Turbo C bug
+- work around a problem with gcc on Alpha (in INSERT_STRING)
+- don't use inline functions (problem with some gcc versions)
+- allow renaming of Byte, uInt, etc... with #define.
+- avoid warning about (unused) pointer before start of array in deflate.c
+- avoid various warnings in gzio.c, example.c, infblock.c, adler32.c, zutil.c
+- avoid reserved word 'new' in trees.c
+
+Changes in 0.93 (25 June 95)
+- temporarily disable inline functions
+- make deflate deterministic
+- give enough lookahead for PARTIAL_FLUSH
+- Set binary mode for stdin/stdout in minigzip.c for OS/2
+- don't even use signed char in inflate (not portable enough)
+- fix inflate memory leak for segmented architectures
+
+Changes in 0.92 (3 May 95)
+- don't assume that char is signed (problem on SGI)
+- Clear bit buffer when starting a stored block
+- no memcpy on Pyramid
+- suppressed inftest.c
+- optimized fill_window, put longest_match inline for gcc
+- optimized inflate on stored blocks.
+- untabify all sources to simplify patches
+
+Changes in 0.91 (2 May 95)
+- Default MEM_LEVEL is 8 (not 9 for Unix) as documented in zlib.h
+- Document the memory requirements in zconf.h
+- added "make install"
+- fix sync search logic in inflateSync
+- deflate(Z_FULL_FLUSH) now works even if output buffer too short
+- after inflateSync, don't scare people with just "lo world"
+- added support for DJGPP
+
+Changes in 0.9 (1 May 95)
+- don't assume that zalloc clears the allocated memory (the TurboC bug
+  was Mark's bug after all :)
+- let again gzread copy uncompressed data unchanged (was working in 0.71)
+- deflate(Z_FULL_FLUSH), inflateReset and inflateSync are now fully implemented
+- added a test of inflateSync in example.c
+- moved MAX_WBITS to zconf.h because users might want to change that.
+- document explicitly that zalloc(64K) on MSDOS must return a normalized
+  pointer (zero offset)
+- added Makefiles for Microsoft C, Turbo C, Borland C++
+- faster crc32()
+
+Changes in 0.8 (29 April 95)
+- added fast inflate (inffast.c)
+- deflate(Z_FINISH) now returns Z_STREAM_END when done. Warning: this
+  is incompatible with previous versions of zlib which returned Z_OK.
+- work around a TurboC compiler bug (bad code for b << 0, see infutil.h)
+  (actually that was not a compiler bug, see 0.81 above)
+- gzread no longer reads one extra byte in certain cases
+- In gzio destroy(), don't reference a freed structure
+- avoid many warnings for MSDOS
+- avoid the ERROR symbol which is used by MS Windows
+
+Changes in 0.71 (14 April 95)
+- Fixed more MSDOS compilation problems :( There is still a bug with
+  TurboC large model.
+
+Changes in 0.7 (14 April 95)
+- Added full inflate support.
+- Simplified the crc32() interface. The pre- and post-conditioning
+  (one's complement) is now done inside crc32(). WARNING: this is
+  incompatible with previous versions; see zlib.h for the new usage.
+
+Changes in 0.61 (12 April 95)
+- workaround for a bug in TurboC. example and minigzip now work on MSDOS.
+
+Changes in 0.6 (11 April 95)
+- added minigzip.c
+- added gzdopen to reopen a file descriptor as gzFile
+- added transparent reading of non-gziped files in gzread.
+- fixed bug in gzread (don't read crc as data)
+- fixed bug in destroy (gzio.c) (don't return Z_STREAM_END for gzclose).
+- don't allocate big arrays in the stack (for MSDOS)
+- fix some MSDOS compilation problems
+
+Changes in 0.5:
+- do real compression in deflate.c. Z_PARTIAL_FLUSH is supported but
+  not yet Z_FULL_FLUSH.
+- support decompression but only in a single step (forced Z_FINISH)
+- added opaque object for zalloc and zfree.
+- added deflateReset and inflateReset
+- added a variable zlib_version for consistency checking.
+- renamed the 'filter' parameter of deflateInit2 as 'strategy'.
+  Added Z_FILTERED and Z_HUFFMAN_ONLY constants.
+
+Changes in 0.4:
+- avoid "zip" everywhere, use zlib instead of ziplib.
+- suppress Z_BLOCK_FLUSH, interpret Z_PARTIAL_FLUSH as block flush
+  if compression method == 8.
+- added adler32 and crc32
+- renamed deflateOptions as deflateInit2, call one or the other but not both
+- added the method parameter for deflateInit2.
+- added inflateInit2
+- simplied considerably deflateInit and inflateInit by not supporting
+  user-provided history buffer. This is supported only in deflateInit2
+  and inflateInit2.
+
+Changes in 0.3:
+- prefix all macro names with Z_
+- use Z_FINISH instead of deflateEnd to finish compression.
+- added Z_HUFFMAN_ONLY
+- added gzerror()
diff --git a/updater/zlib123/FAQ b/updater/zlib123/FAQ
new file mode 100644
index 0000000..15d0436
--- /dev/null
+++ b/updater/zlib123/FAQ
@@ -0,0 +1,339 @@
+
+                Frequently Asked Questions about zlib
+
+
+If your question is not there, please check the zlib home page
+http://www.zlib.org which may have more recent information.
+The lastest zlib FAQ is at http://www.gzip.org/zlib/zlib_faq.html
+
+
+ 1. Is zlib Y2K-compliant?
+
+    Yes. zlib doesn't handle dates.
+
+ 2. Where can I get a Windows DLL version?
+
+    The zlib sources can be compiled without change to produce a DLL.
+    See the file win32/DLL_FAQ.txt in the zlib distribution.
+    Pointers to the precompiled DLL are found in the zlib web site at
+    http://www.zlib.org.
+
+ 3. Where can I get a Visual Basic interface to zlib?
+
+    See
+        * http://www.dogma.net/markn/articles/zlibtool/zlibtool.htm
+        * contrib/visual-basic.txt in the zlib distribution
+        * win32/DLL_FAQ.txt in the zlib distribution
+
+ 4. compress() returns Z_BUF_ERROR.
+
+    Make sure that before the call of compress, the length of the compressed
+    buffer is equal to the total size of the compressed buffer and not
+    zero. For Visual Basic, check that this parameter is passed by reference
+    ("as any"), not by value ("as long").
+
+ 5. deflate() or inflate() returns Z_BUF_ERROR.
+
+    Before making the call, make sure that avail_in and avail_out are not
+    zero. When setting the parameter flush equal to Z_FINISH, also make sure
+    that avail_out is big enough to allow processing all pending input.
+    Note that a Z_BUF_ERROR is not fatal--another call to deflate() or
+    inflate() can be made with more input or output space. A Z_BUF_ERROR
+    may in fact be unavoidable depending on how the functions are used, since
+    it is not possible to tell whether or not there is more output pending
+    when strm.avail_out returns with zero.
+
+ 6. Where's the zlib documentation (man pages, etc.)?
+
+    It's in zlib.h for the moment, and Francis S. Lin has converted it to a
+    web page zlib.html. Volunteers to transform this to Unix-style man pages,
+    please contact us (zlib@gzip.org). Examples of zlib usage are in the files
+    example.c and minigzip.c.
+
+ 7. Why don't you use GNU autoconf or libtool or ...?
+
+    Because we would like to keep zlib as a very small and simple
+    package. zlib is rather portable and doesn't need much configuration.
+
+ 8. I found a bug in zlib.
+
+    Most of the time, such problems are due to an incorrect usage of
+    zlib. Please try to reproduce the problem with a small program and send
+    the corresponding source to us at zlib@gzip.org . Do not send
+    multi-megabyte data files without prior agreement.
+
+ 9. Why do I get "undefined reference to gzputc"?
+
+    If "make test" produces something like
+
+       example.o(.text+0x154): undefined reference to `gzputc'
+
+    check that you don't have old files libz.* in /usr/lib, /usr/local/lib or
+    /usr/X11R6/lib. Remove any old versions, then do "make install".
+
+10. I need a Delphi interface to zlib.
+
+    See the contrib/delphi directory in the zlib distribution.
+
+11. Can zlib handle .zip archives?
+
+    Not by itself, no.  See the directory contrib/minizip in the zlib
+    distribution.
+
+12. Can zlib handle .Z files?
+
+    No, sorry. You have to spawn an uncompress or gunzip subprocess, or adapt
+    the code of uncompress on your own.
+
+13. How can I make a Unix shared library?
+
+    make clean
+    ./configure -s
+    make
+
+14. How do I install a shared zlib library on Unix?
+
+    After the above, then:
+
+    make install
+
+    However, many flavors of Unix come with a shared zlib already installed.
+    Before going to the trouble of compiling a shared version of zlib and
+    trying to install it, you may want to check if it's already there! If you
+    can #include <zlib.h>, it's there. The -lz option will probably link to it.
+
+15. I have a question about OttoPDF.
+
+    We are not the authors of OttoPDF. The real author is on the OttoPDF web
+    site: Joel Hainley, jhainley@myndkryme.com.
+
+16. Can zlib decode Flate data in an Adobe PDF file?
+
+    Yes. See http://www.fastio.com/ (ClibPDF), or http://www.pdflib.com/ .
+    To modify PDF forms, see http://sourceforge.net/projects/acroformtool/ .
+
+17. Why am I getting this "register_frame_info not found" error on Solaris?
+
+    After installing zlib 1.1.4 on Solaris 2.6, running applications using zlib
+    generates an error such as:
+
+        ld.so.1: rpm: fatal: relocation error: file /usr/local/lib/libz.so:
+        symbol __register_frame_info: referenced symbol not found
+
+    The symbol __register_frame_info is not part of zlib, it is generated by
+    the C compiler (cc or gcc). You must recompile applications using zlib
+    which have this problem. This problem is specific to Solaris. See
+    http://www.sunfreeware.com for Solaris versions of zlib and applications
+    using zlib.
+
+18. Why does gzip give an error on a file I make with compress/deflate?
+
+    The compress and deflate functions produce data in the zlib format, which
+    is different and incompatible with the gzip format. The gz* functions in
+    zlib on the other hand use the gzip format. Both the zlib and gzip
+    formats use the same compressed data format internally, but have different
+    headers and trailers around the compressed data.
+
+19. Ok, so why are there two different formats?
+
+    The gzip format was designed to retain the directory information about
+    a single file, such as the name and last modification date. The zlib
+    format on the other hand was designed for in-memory and communication
+    channel applications, and has a much more compact header and trailer and
+    uses a faster integrity check than gzip.
+
+20. Well that's nice, but how do I make a gzip file in memory?
+
+    You can request that deflate write the gzip format instead of the zlib
+    format using deflateInit2(). You can also request that inflate decode
+    the gzip format using inflateInit2(). Read zlib.h for more details.
+
+21. Is zlib thread-safe?
+
+    Yes. However any library routines that zlib uses and any application-
+    provided memory allocation routines must also be thread-safe. zlib's gz*
+    functions use stdio library routines, and most of zlib's functions use the
+    library memory allocation routines by default. zlib's Init functions allow
+    for the application to provide custom memory allocation routines.
+
+    Of course, you should only operate on any given zlib or gzip stream from a
+    single thread at a time.
+
+22. Can I use zlib in my commercial application?
+
+    Yes. Please read the license in zlib.h.
+
+23. Is zlib under the GNU license?
+
+    No. Please read the license in zlib.h.
+
+24. The license says that altered source versions must be "plainly marked". So
+    what exactly do I need to do to meet that requirement?
+
+    You need to change the ZLIB_VERSION and ZLIB_VERNUM #defines in zlib.h. In
+    particular, the final version number needs to be changed to "f", and an
+    identification string should be appended to ZLIB_VERSION. Version numbers
+    x.x.x.f are reserved for modifications to zlib by others than the zlib
+    maintainers. For example, if the version of the base zlib you are altering
+    is "1.2.3.4", then in zlib.h you should change ZLIB_VERNUM to 0x123f, and
+    ZLIB_VERSION to something like "1.2.3.f-zachary-mods-v3". You can also
+    update the version strings in deflate.c and inftrees.c.
+
+    For altered source distributions, you should also note the origin and
+    nature of the changes in zlib.h, as well as in ChangeLog and README, along
+    with the dates of the alterations. The origin should include at least your
+    name (or your company's name), and an email address to contact for help or
+    issues with the library.
+
+    Note that distributing a compiled zlib library along with zlib.h and
+    zconf.h is also a source distribution, and so you should change
+    ZLIB_VERSION and ZLIB_VERNUM and note the origin and nature of the changes
+    in zlib.h as you would for a full source distribution.
+
+25. Will zlib work on a big-endian or little-endian architecture, and can I
+    exchange compressed data between them?
+
+    Yes and yes.
+
+26. Will zlib work on a 64-bit machine?
+
+    It should. It has been tested on 64-bit machines, and has no dependence
+    on any data types being limited to 32-bits in length. If you have any
+    difficulties, please provide a complete problem report to zlib@gzip.org
+
+27. Will zlib decompress data from the PKWare Data Compression Library?
+
+    No. The PKWare DCL uses a completely different compressed data format
+    than does PKZIP and zlib. However, you can look in zlib's contrib/blast
+    directory for a possible solution to your problem.
+
+28. Can I access data randomly in a compressed stream?
+
+    No, not without some preparation. If when compressing you periodically
+    use Z_FULL_FLUSH, carefully write all the pending data at those points,
+    and keep an index of those locations, then you can start decompression
+    at those points. You have to be careful to not use Z_FULL_FLUSH too
+    often, since it can significantly degrade compression.
+
+29. Does zlib work on MVS, OS/390, CICS, etc.?
+
+    We don't know for sure. We have heard occasional reports of success on
+    these systems. If you do use it on one of these, please provide us with
+    a report, instructions, and patches that we can reference when we get
+    these questions. Thanks.
+
+30. Is there some simpler, easier to read version of inflate I can look at
+    to understand the deflate format?
+
+    First off, you should read RFC 1951. Second, yes. Look in zlib's
+    contrib/puff directory.
+
+31. Does zlib infringe on any patents?
+
+    As far as we know, no. In fact, that was originally the whole point behind
+    zlib. Look here for some more information:
+
+    http://www.gzip.org/#faq11
+
+32. Can zlib work with greater than 4 GB of data?
+
+    Yes. inflate() and deflate() will process any amount of data correctly.
+    Each call of inflate() or deflate() is limited to input and output chunks
+    of the maximum value that can be stored in the compiler's "unsigned int"
+    type, but there is no limit to the number of chunks. Note however that the
+    strm.total_in and strm_total_out counters may be limited to 4 GB. These
+    counters are provided as a convenience and are not used internally by
+    inflate() or deflate(). The application can easily set up its own counters
+    updated after each call of inflate() or deflate() to count beyond 4 GB.
+    compress() and uncompress() may be limited to 4 GB, since they operate in a
+    single call. gzseek() and gztell() may be limited to 4 GB depending on how
+    zlib is compiled. See the zlibCompileFlags() function in zlib.h.
+
+    The word "may" appears several times above since there is a 4 GB limit
+    only if the compiler's "long" type is 32 bits. If the compiler's "long"
+    type is 64 bits, then the limit is 16 exabytes.
+
+33. Does zlib have any security vulnerabilities?
+
+    The only one that we are aware of is potentially in gzprintf(). If zlib
+    is compiled to use sprintf() or vsprintf(), then there is no protection
+    against a buffer overflow of a 4K string space, other than the caller of
+    gzprintf() assuring that the output will not exceed 4K. On the other
+    hand, if zlib is compiled to use snprintf() or vsnprintf(), which should
+    normally be the case, then there is no vulnerability. The ./configure
+    script will display warnings if an insecure variation of sprintf() will
+    be used by gzprintf(). Also the zlibCompileFlags() function will return
+    information on what variant of sprintf() is used by gzprintf().
+
+    If you don't have snprintf() or vsnprintf() and would like one, you can
+    find a portable implementation here:
+
+        http://www.ijs.si/software/snprintf/
+
+    Note that you should be using the most recent version of zlib. Versions
+    1.1.3 and before were subject to a double-free vulnerability.
+
+34. Is there a Java version of zlib?
+
+    Probably what you want is to use zlib in Java. zlib is already included
+    as part of the Java SDK in the java.util.zip package. If you really want
+    a version of zlib written in the Java language, look on the zlib home
+    page for links: http://www.zlib.org/
+
+35. I get this or that compiler or source-code scanner warning when I crank it
+    up to maximally-pedantic. Can't you guys write proper code?
+
+    Many years ago, we gave up attempting to avoid warnings on every compiler
+    in the universe. It just got to be a waste of time, and some compilers
+    were downright silly. So now, we simply make sure that the code always
+    works.
+
+36. Valgrind (or some similar memory access checker) says that deflate is
+    performing a conditional jump that depends on an uninitialized value.
+    Isn't that a bug?
+
+    No.  That is intentional for performance reasons, and the output of
+    deflate is not affected.  This only started showing up recently since
+    zlib 1.2.x uses malloc() by default for allocations, whereas earlier
+    versions used calloc(), which zeros out the allocated memory.
+
+37. Will zlib read the (insert any ancient or arcane format here) compressed
+    data format?
+
+    Probably not. Look in the comp.compression FAQ for pointers to various
+    formats and associated software.
+
+38. How can I encrypt/decrypt zip files with zlib?
+
+    zlib doesn't support encryption. The original PKZIP encryption is very weak
+    and can be broken with freely available programs. To get strong encryption,
+    use GnuPG, http://www.gnupg.org/ , which already includes zlib compression.
+    For PKZIP compatible "encryption", look at http://www.info-zip.org/
+
+39. What's the difference between the "gzip" and "deflate" HTTP 1.1 encodings?
+
+    "gzip" is the gzip format, and "deflate" is the zlib format. They should
+    probably have called the second one "zlib" instead to avoid confusion
+    with the raw deflate compressed data format. While the HTTP 1.1 RFC 2616
+    correctly points to the zlib specification in RFC 1950 for the "deflate"
+    transfer encoding, there have been reports of servers and browsers that
+    incorrectly produce or expect raw deflate data per the deflate
+    specficiation in RFC 1951, most notably Microsoft. So even though the
+    "deflate" transfer encoding using the zlib format would be the more
+    efficient approach (and in fact exactly what the zlib format was designed
+    for), using the "gzip" transfer encoding is probably more reliable due to
+    an unfortunate choice of name on the part of the HTTP 1.1 authors.
+
+    Bottom line: use the gzip format for HTTP 1.1 encoding.
+
+40. Does zlib support the new "Deflate64" format introduced by PKWare?
+
+    No. PKWare has apparently decided to keep that format proprietary, since
+    they have not documented it as they have previous compression formats.
+    In any case, the compression improvements are so modest compared to other
+    more modern approaches, that it's not worth the effort to implement.
+
+41. Can you please sign these lengthy legal documents and fax them back to us
+    so that we can use your software in our product?
+
+    No. Go away. Shoo.
diff --git a/updater/zlib123/INDEX b/updater/zlib123/INDEX
new file mode 100644
index 0000000..4d7eac4
--- /dev/null
+++ b/updater/zlib123/INDEX
@@ -0,0 +1,51 @@
+ChangeLog       history of changes
+FAQ             Frequently Asked Questions about zlib
+INDEX           this file
+Makefile        makefile for Unix (generated by configure)
+Makefile.in     makefile for Unix (template for configure)
+README          guess what
+algorithm.txt   description of the (de)compression algorithm
+configure       configure script for Unix
+zconf.in.h      template for zconf.h (used by configure)
+
+amiga/          makefiles for Amiga SAS C
+as400/          makefiles for IBM AS/400
+msdos/          makefiles for MSDOS
+old/            makefiles for various architectures and zlib documentation
+                files that have not yet been updated for zlib 1.2.x
+projects/       projects for various Integrated Development Environments
+qnx/            makefiles for QNX
+win32/          makefiles for Windows
+
+                zlib public header files (must be kept):
+zconf.h
+zlib.h
+
+                private source files used to build the zlib library:
+adler32.c
+compress.c
+crc32.c
+crc32.h
+deflate.c
+deflate.h
+gzio.c
+infback.c
+inffast.c
+inffast.h
+inffixed.h
+inflate.c
+inflate.h
+inftrees.c
+inftrees.h
+trees.c
+trees.h
+uncompr.c
+zutil.c
+zutil.h
+
+                source files for sample programs:
+example.c
+minigzip.c
+
+                unsupported contribution by third parties
+See contrib/README.contrib
diff --git a/updater/zlib123/Makefile b/updater/zlib123/Makefile
new file mode 100644
index 0000000..a4954c8
--- /dev/null
+++ b/updater/zlib123/Makefile
@@ -0,0 +1,154 @@
+# Makefile for zlib
+# Copyright (C) 1995-2005 Jean-loup Gailly.
+# For conditions of distribution and use, see copyright notice in zlib.h
+
+# To compile and test, type:
+#    ./configure; make test
+# The call of configure is optional if you don't have special requirements
+# If you wish to build zlib as a shared library, use: ./configure -s
+
+# To use the asm code, type:
+#    cp contrib/asm?86/match.S ./match.S
+#    make LOC=-DASMV OBJA=match.o
+
+# To install /usr/local/lib/libz.* and /usr/local/include/zlib.h, type:
+#    make install
+# To install in $HOME instead of /usr/local, use:
+#    make install prefix=$HOME
+
+CC=cc
+
+CFLAGS=-O
+#CFLAGS=-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7
+#CFLAGS=-g -DDEBUG
+#CFLAGS=-O3 -Wall -Wwrite-strings -Wpointer-arith -Wconversion \
+#           -Wstrict-prototypes -Wmissing-prototypes
+
+LDFLAGS=libz.a
+LDSHARED=$(CC)
+CPP=$(CC) -E
+
+LIBS=libz.a
+SHAREDLIB=libz.so
+SHAREDLIBV=libz.so.1.2.3
+SHAREDLIBM=libz.so.1
+
+AR=ar rc
+RANLIB=ranlib
+TAR=tar
+SHELL=/bin/sh
+EXE=
+
+prefix = /usr/local
+exec_prefix = ${prefix}
+libdir = ${exec_prefix}/lib
+includedir = ${prefix}/include
+mandir = ${prefix}/share/man
+man3dir = ${mandir}/man3
+
+OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
+       zutil.o inflate.o infback.o inftrees.o inffast.o
+
+OBJA =
+# to use the asm code: make OBJA=match.o
+
+TEST_OBJS = example.o minigzip.o
+
+all: example$(EXE) minigzip$(EXE)
+
+check: test
+test: all
+	@LD_LIBRARY_PATH=.:$(LD_LIBRARY_PATH) ; export LD_LIBRARY_PATH; \
+	echo hello world | ./minigzip | ./minigzip -d || \
+	  echo '		*** minigzip test FAILED ***' ; \
+	if ./example; then \
+	  echo '		*** zlib test OK ***'; \
+	else \
+	  echo '		*** zlib test FAILED ***'; \
+	fi
+
+libz.a: $(OBJS) $(OBJA)
+	$(AR) $@ $(OBJS) $(OBJA)
+	-@ ($(RANLIB) $@ || true) >/dev/null 2>&1
+
+match.o: match.S
+	$(CPP) match.S > _match.s
+	$(CC) -c _match.s
+	mv _match.o match.o
+	rm -f _match.s
+
+$(SHAREDLIBV): $(OBJS)
+	$(LDSHARED) -o $@ $(OBJS)
+	rm -f $(SHAREDLIB) $(SHAREDLIBM)
+	ln -s $@ $(SHAREDLIB)
+	ln -s $@ $(SHAREDLIBM)
+
+example$(EXE): example.o $(LIBS)
+	$(CC) $(CFLAGS) -o $@ example.o $(LDFLAGS)
+
+minigzip$(EXE): minigzip.o $(LIBS)
+	$(CC) $(CFLAGS) -o $@ minigzip.o $(LDFLAGS)
+
+install: $(LIBS)
+	-@if [ ! -d $(exec_prefix) ]; then mkdir -p $(exec_prefix); fi
+	-@if [ ! -d $(includedir)  ]; then mkdir -p $(includedir); fi
+	-@if [ ! -d $(libdir)      ]; then mkdir -p $(libdir); fi
+	-@if [ ! -d $(man3dir)     ]; then mkdir -p $(man3dir); fi
+	cp zlib.h zconf.h $(includedir)
+	chmod 644 $(includedir)/zlib.h $(includedir)/zconf.h
+	cp $(LIBS) $(libdir)
+	cd $(libdir); chmod 755 $(LIBS)
+	-@(cd $(libdir); $(RANLIB) libz.a || true) >/dev/null 2>&1
+	cd $(libdir); if test -f $(SHAREDLIBV); then \
+	  rm -f $(SHAREDLIB) $(SHAREDLIBM); \
+	  ln -s $(SHAREDLIBV) $(SHAREDLIB); \
+	  ln -s $(SHAREDLIBV) $(SHAREDLIBM); \
+	  (ldconfig || true)  >/dev/null 2>&1; \
+	fi
+	cp zlib.3 $(man3dir)
+	chmod 644 $(man3dir)/zlib.3
+# The ranlib in install is needed on NeXTSTEP which checks file times
+# ldconfig is for Linux
+
+uninstall:
+	cd $(includedir); \
+	cd $(libdir); rm -f libz.a; \
+	if test -f $(SHAREDLIBV); then \
+	  rm -f $(SHAREDLIBV) $(SHAREDLIB) $(SHAREDLIBM); \
+	fi
+	cd $(man3dir); rm -f zlib.3
+
+mostlyclean: clean
+clean:
+	rm -f *.o *~ example$(EXE) minigzip$(EXE) \
+	   libz.* foo.gz so_locations \
+	   _match.s maketree contrib/infback9/*.o
+
+maintainer-clean: distclean
+distclean: clean
+	cp -p Makefile.in Makefile
+	cp -p zconf.in.h zconf.h
+	rm -f .DS_Store
+
+tags:
+	etags *.[ch]
+
+depend:
+	makedepend -- $(CFLAGS) -- *.[ch]
+
+# DO NOT DELETE THIS LINE -- make depend depends on it.
+
+adler32.o: zlib.h zconf.h
+compress.o: zlib.h zconf.h
+crc32.o: crc32.h zlib.h zconf.h
+deflate.o: deflate.h zutil.h zlib.h zconf.h
+example.o: zlib.h zconf.h
+gzio.o: zutil.h zlib.h zconf.h
+inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+inftrees.o: zutil.h zlib.h zconf.h inftrees.h
+minigzip.o: zlib.h zconf.h
+trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
+uncompr.o: zlib.h zconf.h
+zutil.o: zutil.h zlib.h zconf.h
diff --git a/updater/zlib123/Makefile.in b/updater/zlib123/Makefile.in
new file mode 100644
index 0000000..a4954c8
--- /dev/null
+++ b/updater/zlib123/Makefile.in
@@ -0,0 +1,154 @@
+# Makefile for zlib
+# Copyright (C) 1995-2005 Jean-loup Gailly.
+# For conditions of distribution and use, see copyright notice in zlib.h
+
+# To compile and test, type:
+#    ./configure; make test
+# The call of configure is optional if you don't have special requirements
+# If you wish to build zlib as a shared library, use: ./configure -s
+
+# To use the asm code, type:
+#    cp contrib/asm?86/match.S ./match.S
+#    make LOC=-DASMV OBJA=match.o
+
+# To install /usr/local/lib/libz.* and /usr/local/include/zlib.h, type:
+#    make install
+# To install in $HOME instead of /usr/local, use:
+#    make install prefix=$HOME
+
+CC=cc
+
+CFLAGS=-O
+#CFLAGS=-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7
+#CFLAGS=-g -DDEBUG
+#CFLAGS=-O3 -Wall -Wwrite-strings -Wpointer-arith -Wconversion \
+#           -Wstrict-prototypes -Wmissing-prototypes
+
+LDFLAGS=libz.a
+LDSHARED=$(CC)
+CPP=$(CC) -E
+
+LIBS=libz.a
+SHAREDLIB=libz.so
+SHAREDLIBV=libz.so.1.2.3
+SHAREDLIBM=libz.so.1
+
+AR=ar rc
+RANLIB=ranlib
+TAR=tar
+SHELL=/bin/sh
+EXE=
+
+prefix = /usr/local
+exec_prefix = ${prefix}
+libdir = ${exec_prefix}/lib
+includedir = ${prefix}/include
+mandir = ${prefix}/share/man
+man3dir = ${mandir}/man3
+
+OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
+       zutil.o inflate.o infback.o inftrees.o inffast.o
+
+OBJA =
+# to use the asm code: make OBJA=match.o
+
+TEST_OBJS = example.o minigzip.o
+
+all: example$(EXE) minigzip$(EXE)
+
+check: test
+test: all
+	@LD_LIBRARY_PATH=.:$(LD_LIBRARY_PATH) ; export LD_LIBRARY_PATH; \
+	echo hello world | ./minigzip | ./minigzip -d || \
+	  echo '		*** minigzip test FAILED ***' ; \
+	if ./example; then \
+	  echo '		*** zlib test OK ***'; \
+	else \
+	  echo '		*** zlib test FAILED ***'; \
+	fi
+
+libz.a: $(OBJS) $(OBJA)
+	$(AR) $@ $(OBJS) $(OBJA)
+	-@ ($(RANLIB) $@ || true) >/dev/null 2>&1
+
+match.o: match.S
+	$(CPP) match.S > _match.s
+	$(CC) -c _match.s
+	mv _match.o match.o
+	rm -f _match.s
+
+$(SHAREDLIBV): $(OBJS)
+	$(LDSHARED) -o $@ $(OBJS)
+	rm -f $(SHAREDLIB) $(SHAREDLIBM)
+	ln -s $@ $(SHAREDLIB)
+	ln -s $@ $(SHAREDLIBM)
+
+example$(EXE): example.o $(LIBS)
+	$(CC) $(CFLAGS) -o $@ example.o $(LDFLAGS)
+
+minigzip$(EXE): minigzip.o $(LIBS)
+	$(CC) $(CFLAGS) -o $@ minigzip.o $(LDFLAGS)
+
+install: $(LIBS)
+	-@if [ ! -d $(exec_prefix) ]; then mkdir -p $(exec_prefix); fi
+	-@if [ ! -d $(includedir)  ]; then mkdir -p $(includedir); fi
+	-@if [ ! -d $(libdir)      ]; then mkdir -p $(libdir); fi
+	-@if [ ! -d $(man3dir)     ]; then mkdir -p $(man3dir); fi
+	cp zlib.h zconf.h $(includedir)
+	chmod 644 $(includedir)/zlib.h $(includedir)/zconf.h
+	cp $(LIBS) $(libdir)
+	cd $(libdir); chmod 755 $(LIBS)
+	-@(cd $(libdir); $(RANLIB) libz.a || true) >/dev/null 2>&1
+	cd $(libdir); if test -f $(SHAREDLIBV); then \
+	  rm -f $(SHAREDLIB) $(SHAREDLIBM); \
+	  ln -s $(SHAREDLIBV) $(SHAREDLIB); \
+	  ln -s $(SHAREDLIBV) $(SHAREDLIBM); \
+	  (ldconfig || true)  >/dev/null 2>&1; \
+	fi
+	cp zlib.3 $(man3dir)
+	chmod 644 $(man3dir)/zlib.3
+# The ranlib in install is needed on NeXTSTEP which checks file times
+# ldconfig is for Linux
+
+uninstall:
+	cd $(includedir); \
+	cd $(libdir); rm -f libz.a; \
+	if test -f $(SHAREDLIBV); then \
+	  rm -f $(SHAREDLIBV) $(SHAREDLIB) $(SHAREDLIBM); \
+	fi
+	cd $(man3dir); rm -f zlib.3
+
+mostlyclean: clean
+clean:
+	rm -f *.o *~ example$(EXE) minigzip$(EXE) \
+	   libz.* foo.gz so_locations \
+	   _match.s maketree contrib/infback9/*.o
+
+maintainer-clean: distclean
+distclean: clean
+	cp -p Makefile.in Makefile
+	cp -p zconf.in.h zconf.h
+	rm -f .DS_Store
+
+tags:
+	etags *.[ch]
+
+depend:
+	makedepend -- $(CFLAGS) -- *.[ch]
+
+# DO NOT DELETE THIS LINE -- make depend depends on it.
+
+adler32.o: zlib.h zconf.h
+compress.o: zlib.h zconf.h
+crc32.o: crc32.h zlib.h zconf.h
+deflate.o: deflate.h zutil.h zlib.h zconf.h
+example.o: zlib.h zconf.h
+gzio.o: zutil.h zlib.h zconf.h
+inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+inftrees.o: zutil.h zlib.h zconf.h inftrees.h
+minigzip.o: zlib.h zconf.h
+trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
+uncompr.o: zlib.h zconf.h
+zutil.o: zutil.h zlib.h zconf.h
diff --git a/updater/zlib123/README b/updater/zlib123/README
new file mode 100644
index 0000000..80f71ae
--- /dev/null
+++ b/updater/zlib123/README
@@ -0,0 +1,125 @@
+ZLIB DATA COMPRESSION LIBRARY
+
+zlib 1.2.3 is a general purpose data compression library.  All the code is
+thread safe.  The data format used by the zlib library is described by RFCs
+(Request for Comments) 1950 to 1952 in the files
+http://www.ietf.org/rfc/rfc1950.txt (zlib format), rfc1951.txt (deflate format)
+and rfc1952.txt (gzip format). These documents are also available in other
+formats from ftp://ftp.uu.net/graphics/png/documents/zlib/zdoc-index.html
+
+All functions of the compression library are documented in the file zlib.h
+(volunteer to write man pages welcome, contact zlib@gzip.org). A usage example
+of the library is given in the file example.c which also tests that the library
+is working correctly. Another example is given in the file minigzip.c. The
+compression library itself is composed of all source files except example.c and
+minigzip.c.
+
+To compile all files and run the test program, follow the instructions given at
+the top of Makefile. In short "make test; make install" should work for most
+machines. For Unix: "./configure; make test; make install". For MSDOS, use one
+of the special makefiles such as Makefile.msc. For VMS, use make_vms.com.
+
+Questions about zlib should be sent to <zlib@gzip.org>, or to Gilles Vollant
+<info@winimage.com> for the Windows DLL version. The zlib home page is
+http://www.zlib.org or http://www.gzip.org/zlib/ Before reporting a problem,
+please check this site to verify that you have the latest version of zlib;
+otherwise get the latest version and check whether the problem still exists or
+not.
+
+PLEASE read the zlib FAQ http://www.gzip.org/zlib/zlib_faq.html before asking
+for help.
+
+Mark Nelson <markn@ieee.org> wrote an article about zlib for the Jan. 1997
+issue of  Dr. Dobb's Journal; a copy of the article is available in
+http://dogma.net/markn/articles/zlibtool/zlibtool.htm
+
+The changes made in version 1.2.3 are documented in the file ChangeLog.
+
+Unsupported third party contributions are provided in directory "contrib".
+
+A Java implementation of zlib is available in the Java Development Kit
+http://java.sun.com/j2se/1.4.2/docs/api/java/util/zip/package-summary.html
+See the zlib home page http://www.zlib.org for details.
+
+A Perl interface to zlib written by Paul Marquess <pmqs@cpan.org> is in the
+CPAN (Comprehensive Perl Archive Network) sites
+http://www.cpan.org/modules/by-module/Compress/
+
+A Python interface to zlib written by A.M. Kuchling <amk@amk.ca> is
+available in Python 1.5 and later versions, see
+http://www.python.org/doc/lib/module-zlib.html
+
+A zlib binding for TCL written by Andreas Kupries <a.kupries@westend.com> is
+availlable at http://www.oche.de/~akupries/soft/trf/trf_zip.html
+
+An experimental package to read and write files in .zip format, written on top
+of zlib by Gilles Vollant <info@winimage.com>, is available in the
+contrib/minizip directory of zlib.
+
+
+Notes for some targets:
+
+- For Windows DLL versions, please see win32/DLL_FAQ.txt
+
+- For 64-bit Irix, deflate.c must be compiled without any optimization. With
+  -O, one libpng test fails. The test works in 32 bit mode (with the -n32
+  compiler flag). The compiler bug has been reported to SGI.
+
+- zlib doesn't work with gcc 2.6.3 on a DEC 3000/300LX under OSF/1 2.1 it works
+  when compiled with cc.
+
+- On Digital Unix 4.0D (formely OSF/1) on AlphaServer, the cc option -std1 is
+  necessary to get gzprintf working correctly. This is done by configure.
+
+- zlib doesn't work on HP-UX 9.05 with some versions of /bin/cc. It works with
+  other compilers. Use "make test" to check your compiler.
+
+- gzdopen is not supported on RISCOS, BEOS and by some Mac compilers.
+
+- For PalmOs, see http://palmzlib.sourceforge.net/
+
+- When building a shared, i.e. dynamic library on Mac OS X, the library must be
+  installed before testing (do "make install" before "make test"), since the
+  library location is specified in the library.
+
+
+Acknowledgments:
+
+  The deflate format used by zlib was defined by Phil Katz. The deflate
+  and zlib specifications were written by L. Peter Deutsch. Thanks to all the
+  people who reported problems and suggested various improvements in zlib;
+  they are too numerous to cite here.
+
+Copyright notice:
+
+ (C) 1995-2004 Jean-loup Gailly and Mark Adler
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the authors be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Jean-loup Gailly        Mark Adler
+  jloup@gzip.org          madler@alumni.caltech.edu
+
+If you use the zlib library in a product, we would appreciate *not*
+receiving lengthy legal documents to sign. The sources are provided
+for free but without warranty of any kind.  The library has been
+entirely written by Jean-loup Gailly and Mark Adler; it does not
+include third-party code.
+
+If you redistribute modified sources, we would appreciate that you include
+in the file ChangeLog history information documenting your changes. Please
+read the FAQ for more information on the distribution of modified source
+versions.
diff --git a/updater/zlib123/adler32.c b/updater/zlib123/adler32.c
new file mode 100644
index 0000000..bbd8f58
--- /dev/null
+++ b/updater/zlib123/adler32.c
@@ -0,0 +1,143 @@
+/* adler32.c -- compute the Adler-32 checksum of a data stream
+ * Copyright (C) 1995-2004 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#define ZLIB_INTERNAL
+#include "zlib.h"
+
+#define BASE 65521UL    /* largest prime smaller than 65536 */
+#define NMAX 5552
+/* NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1 */
+
+#define DO1(buf,i)  {adler += (buf)[i]; sum2 += adler;}
+#define DO2(buf,i)  DO1(buf,i); DO1(buf,i+1);
+#define DO4(buf,i)  DO2(buf,i); DO2(buf,i+2);
+#define DO8(buf,i)  DO4(buf,i); DO4(buf,i+4);
+#define DO16(buf)   DO8(buf,0); DO8(buf,8);
+
+/* use NO_DIVIDE if your processor does not do division in hardware */
+#ifdef NO_DIVIDE
+#  define MOD(a) \
+    do { \
+        if (a >= (BASE << 16)) a -= (BASE << 16); \
+        if (a >= (BASE << 15)) a -= (BASE << 15); \
+        if (a >= (BASE << 14)) a -= (BASE << 14); \
+        if (a >= (BASE << 13)) a -= (BASE << 13); \
+        if (a >= (BASE << 12)) a -= (BASE << 12); \
+        if (a >= (BASE << 11)) a -= (BASE << 11); \
+        if (a >= (BASE << 10)) a -= (BASE << 10); \
+        if (a >= (BASE << 9)) a -= (BASE << 9); \
+        if (a >= (BASE << 8)) a -= (BASE << 8); \
+        if (a >= (BASE << 7)) a -= (BASE << 7); \
+        if (a >= (BASE << 6)) a -= (BASE << 6); \
+        if (a >= (BASE << 5)) a -= (BASE << 5); \
+        if (a >= (BASE << 4)) a -= (BASE << 4); \
+        if (a >= (BASE << 3)) a -= (BASE << 3); \
+        if (a >= (BASE << 2)) a -= (BASE << 2); \
+        if (a >= (BASE << 1)) a -= (BASE << 1); \
+        if (a >= BASE) a -= BASE; \
+    } while (0)
+#  define MOD4(a) \
+    do { \
+        if (a >= (BASE << 4)) a -= (BASE << 4); \
+        if (a >= (BASE << 3)) a -= (BASE << 3); \
+        if (a >= (BASE << 2)) a -= (BASE << 2); \
+        if (a >= (BASE << 1)) a -= (BASE << 1); \
+        if (a >= BASE) a -= BASE; \
+    } while (0)
+#else
+#  define MOD(a) a %= BASE
+#  define MOD4(a) a %= BASE
+#endif
+
+/* ========================================================================= */
+uLong ZEXPORT adler32(uLong adler, const Bytef *buf, uInt len)
+{
+    unsigned long sum2;
+    unsigned n;
+
+    /* split Adler-32 into component sums */
+    sum2 = (adler >> 16) & 0xffff;
+    adler &= 0xffff;
+
+    /* in case user likes doing a byte at a time, keep it fast */
+    if (len == 1) {
+        adler += buf[0];
+        if (adler >= BASE)
+            adler -= BASE;
+        sum2 += adler;
+        if (sum2 >= BASE)
+            sum2 -= BASE;
+        return adler | (sum2 << 16);
+    }
+
+    /* initial Adler-32 value (deferred check for len == 1 speed) */
+    if (buf == Z_NULL)
+        return 1L;
+
+    /* in case short lengths are provided, keep it somewhat fast */
+    if (len < 16) {
+        while (len--) {
+            adler += *buf++;
+            sum2 += adler;
+        }
+        if (adler >= BASE)
+            adler -= BASE;
+        MOD4(sum2);             /* only added so many BASE's */
+        return adler | (sum2 << 16);
+    }
+
+    /* do length NMAX blocks -- requires just one modulo operation */
+    while (len >= NMAX) {
+        len -= NMAX;
+        n = NMAX / 16;          /* NMAX is divisible by 16 */
+        do {
+            DO16(buf);          /* 16 sums unrolled */
+            buf += 16;
+        } while (--n);
+        MOD(adler);
+        MOD(sum2);
+    }
+
+    /* do remaining bytes (less than NMAX, still just one modulo) */
+    if (len) {                  /* avoid modulos if none remaining */
+        while (len >= 16) {
+            len -= 16;
+            DO16(buf);
+            buf += 16;
+        }
+        while (len--) {
+            adler += *buf++;
+            sum2 += adler;
+        }
+        MOD(adler);
+        MOD(sum2);
+    }
+
+    /* return recombined sums */
+    return adler | (sum2 << 16);
+}
+
+/* ========================================================================= */
+uLong ZEXPORT adler32_combine(uLong adler1, uLong adler2, z_off_t len2)
+{
+    unsigned long sum1;
+    unsigned long sum2;
+    unsigned rem;
+
+    /* the derivation of this formula is left as an exercise for the reader */
+    rem = (unsigned)(len2 % BASE);
+    sum1 = adler1 & 0xffff;
+    sum2 = rem * sum1;
+    MOD(sum2);
+    sum1 += (adler2 & 0xffff) + BASE - 1;
+    sum2 += ((adler1 >> 16) & 0xffff) + ((adler2 >> 16) & 0xffff) + BASE - rem;
+    if (sum1 > BASE) sum1 -= BASE;
+    if (sum1 > BASE) sum1 -= BASE;
+    if (sum2 > (BASE << 1)) sum2 -= (BASE << 1);
+    if (sum2 > BASE) sum2 -= BASE;
+    return sum1 | (sum2 << 16);
+}
diff --git a/updater/zlib123/algorithm.txt b/updater/zlib123/algorithm.txt
new file mode 100644
index 0000000..9f6b068
--- /dev/null
+++ b/updater/zlib123/algorithm.txt
@@ -0,0 +1,209 @@
+1. Compression algorithm (deflate)
+
+The deflation algorithm used by gzip (also zip and zlib) is a variation of
+LZ77 (Lempel-Ziv 1977, see reference below). It finds duplicated strings in
+the input data.  The second occurrence of a string is replaced by a
+pointer to the previous string, in the form of a pair (distance,
+length).  Distances are limited to 32K bytes, and lengths are limited
+to 258 bytes. When a string does not occur anywhere in the previous
+32K bytes, it is emitted as a sequence of literal bytes.  (In this
+description, `string' must be taken as an arbitrary sequence of bytes,
+and is not restricted to printable characters.)
+
+Literals or match lengths are compressed with one Huffman tree, and
+match distances are compressed with another tree. The trees are stored
+in a compact form at the start of each block. The blocks can have any
+size (except that the compressed data for one block must fit in
+available memory). A block is terminated when deflate() determines that
+it would be useful to start another block with fresh trees. (This is
+somewhat similar to the behavior of LZW-based _compress_.)
+
+Duplicated strings are found using a hash table. All input strings of
+length 3 are inserted in the hash table. A hash index is computed for
+the next 3 bytes. If the hash chain for this index is not empty, all
+strings in the chain are compared with the current input string, and
+the longest match is selected.
+
+The hash chains are searched starting with the most recent strings, to
+favor small distances and thus take advantage of the Huffman encoding.
+The hash chains are singly linked. There are no deletions from the
+hash chains, the algorithm simply discards matches that are too old.
+
+To avoid a worst-case situation, very long hash chains are arbitrarily
+truncated at a certain length, determined by a runtime option (level
+parameter of deflateInit). So deflate() does not always find the longest
+possible match but generally finds a match which is long enough.
+
+deflate() also defers the selection of matches with a lazy evaluation
+mechanism. After a match of length N has been found, deflate() searches for
+a longer match at the next input byte. If a longer match is found, the
+previous match is truncated to a length of one (thus producing a single
+literal byte) and the process of lazy evaluation begins again. Otherwise,
+the original match is kept, and the next match search is attempted only N
+steps later.
+
+The lazy match evaluation is also subject to a runtime parameter. If
+the current match is long enough, deflate() reduces the search for a longer
+match, thus speeding up the whole process. If compression ratio is more
+important than speed, deflate() attempts a complete second search even if
+the first match is already long enough.
+
+The lazy match evaluation is not performed for the fastest compression
+modes (level parameter 1 to 3). For these fast modes, new strings
+are inserted in the hash table only when no match was found, or
+when the match is not too long. This degrades the compression ratio
+but saves time since there are both fewer insertions and fewer searches.
+
+
+2. Decompression algorithm (inflate)
+
+2.1 Introduction
+
+The key question is how to represent a Huffman code (or any prefix code) so
+that you can decode fast.  The most important characteristic is that shorter
+codes are much more common than longer codes, so pay attention to decoding the
+short codes fast, and let the long codes take longer to decode.
+
+inflate() sets up a first level table that covers some number of bits of
+input less than the length of longest code.  It gets that many bits from the
+stream, and looks it up in the table.  The table will tell if the next
+code is that many bits or less and how many, and if it is, it will tell
+the value, else it will point to the next level table for which inflate()
+grabs more bits and tries to decode a longer code.
+
+How many bits to make the first lookup is a tradeoff between the time it
+takes to decode and the time it takes to build the table.  If building the
+table took no time (and if you had infinite memory), then there would only
+be a first level table to cover all the way to the longest code.  However,
+building the table ends up taking a lot longer for more bits since short
+codes are replicated many times in such a table.  What inflate() does is
+simply to make the number of bits in the first table a variable, and  then
+to set that variable for the maximum speed.
+
+For inflate, which has 286 possible codes for the literal/length tree, the size
+of the first table is nine bits.  Also the distance trees have 30 possible
+values, and the size of the first table is six bits.  Note that for each of
+those cases, the table ended up one bit longer than the ``average'' code
+length, i.e. the code length of an approximately flat code which would be a
+little more than eight bits for 286 symbols and a little less than five bits
+for 30 symbols.
+
+
+2.2 More details on the inflate table lookup
+
+Ok, you want to know what this cleverly obfuscated inflate tree actually
+looks like.  You are correct that it's not a Huffman tree.  It is simply a
+lookup table for the first, let's say, nine bits of a Huffman symbol.  The
+symbol could be as short as one bit or as long as 15 bits.  If a particular
+symbol is shorter than nine bits, then that symbol's translation is duplicated
+in all those entries that start with that symbol's bits.  For example, if the
+symbol is four bits, then it's duplicated 32 times in a nine-bit table.  If a
+symbol is nine bits long, it appears in the table once.
+
+If the symbol is longer than nine bits, then that entry in the table points
+to another similar table for the remaining bits.  Again, there are duplicated
+entries as needed.  The idea is that most of the time the symbol will be short
+and there will only be one table look up.  (That's whole idea behind data
+compression in the first place.)  For the less frequent long symbols, there
+will be two lookups.  If you had a compression method with really long
+symbols, you could have as many levels of lookups as is efficient.  For
+inflate, two is enough.
+
+So a table entry either points to another table (in which case nine bits in
+the above example are gobbled), or it contains the translation for the symbol
+and the number of bits to gobble.  Then you start again with the next
+ungobbled bit.
+
+You may wonder: why not just have one lookup table for how ever many bits the
+longest symbol is?  The reason is that if you do that, you end up spending
+more time filling in duplicate symbol entries than you do actually decoding.
+At least for deflate's output that generates new trees every several 10's of
+kbytes.  You can imagine that filling in a 2^15 entry table for a 15-bit code
+would take too long if you're only decoding several thousand symbols.  At the
+other extreme, you could make a new table for every bit in the code.  In fact,
+that's essentially a Huffman tree.  But then you spend two much time
+traversing the tree while decoding, even for short symbols.
+
+So the number of bits for the first lookup table is a trade of the time to
+fill out the table vs. the time spent looking at the second level and above of
+the table.
+
+Here is an example, scaled down:
+
+The code being decoded, with 10 symbols, from 1 to 6 bits long:
+
+A: 0
+B: 10
+C: 1100
+D: 11010
+E: 11011
+F: 11100
+G: 11101
+H: 11110
+I: 111110
+J: 111111
+
+Let's make the first table three bits long (eight entries):
+
+000: A,1
+001: A,1
+010: A,1
+011: A,1
+100: B,2
+101: B,2
+110: -> table X (gobble 3 bits)
+111: -> table Y (gobble 3 bits)
+
+Each entry is what the bits decode as and how many bits that is, i.e. how
+many bits to gobble.  Or the entry points to another table, with the number of
+bits to gobble implicit in the size of the table.
+
+Table X is two bits long since the longest code starting with 110 is five bits
+long:
+
+00: C,1
+01: C,1
+10: D,2
+11: E,2
+
+Table Y is three bits long since the longest code starting with 111 is six
+bits long:
+
+000: F,2
+001: F,2
+010: G,2
+011: G,2
+100: H,2
+101: H,2
+110: I,3
+111: J,3
+
+So what we have here are three tables with a total of 20 entries that had to
+be constructed.  That's compared to 64 entries for a single table.  Or
+compared to 16 entries for a Huffman tree (six two entry tables and one four
+entry table).  Assuming that the code ideally represents the probability of
+the symbols, it takes on the average 1.25 lookups per symbol.  That's compared
+to one lookup for the single table, or 1.66 lookups per symbol for the
+Huffman tree.
+
+There, I think that gives you a picture of what's going on.  For inflate, the
+meaning of a particular symbol is often more than just a letter.  It can be a
+byte (a "literal"), or it can be either a length or a distance which
+indicates a base value and a number of bits to fetch after the code that is
+added to the base value.  Or it might be the special end-of-block code.  The
+data structures created in inftrees.c try to encode all that information
+compactly in the tables.
+
+
+Jean-loup Gailly        Mark Adler
+jloup@gzip.org          madler@alumni.caltech.edu
+
+
+References:
+
+[LZ77] Ziv J., Lempel A., ``A Universal Algorithm for Sequential Data
+Compression,'' IEEE Transactions on Information Theory, Vol. 23, No. 3,
+pp. 337-343.
+
+``DEFLATE Compressed Data Format Specification'' available in
+http://www.ietf.org/rfc/rfc1951.txt
diff --git a/updater/zlib123/amiga/Makefile.pup b/updater/zlib123/amiga/Makefile.pup
new file mode 100644
index 0000000..8deb7c8
--- /dev/null
+++ b/updater/zlib123/amiga/Makefile.pup
@@ -0,0 +1,66 @@
+# Amiga powerUP (TM) Makefile
+# makefile for libpng and SAS C V6.58/7.00 PPC compiler
+# Copyright (C) 1998 by Andreas R. Kleinert
+
+LIBNAME	= libzip.a
+
+CC	= scppc
+CFLAGS	= NOSTKCHK NOSINT OPTIMIZE OPTGO OPTPEEP OPTINLOCAL OPTINL \
+	  OPTLOOP OPTRDEP=8 OPTDEP=8 OPTCOMP=8 NOVER
+AR	= ppc-amigaos-ar cr
+RANLIB	= ppc-amigaos-ranlib
+LD	= ppc-amigaos-ld -r
+LDFLAGS	= -o
+LDLIBS	= LIB:scppc.a LIB:end.o
+RM	= delete quiet
+
+OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
+       zutil.o inflate.o infback.o inftrees.o inffast.o
+
+TEST_OBJS = example.o minigzip.o
+
+all: example minigzip
+
+check: test
+test: all
+	example
+	echo hello world | minigzip | minigzip -d
+
+$(LIBNAME): $(OBJS)
+	$(AR) $@ $(OBJS)
+	-$(RANLIB) $@
+
+example: example.o $(LIBNAME)
+	$(LD) $(LDFLAGS) $@ LIB:c_ppc.o $@.o $(LIBNAME) $(LDLIBS)
+
+minigzip: minigzip.o $(LIBNAME)
+	$(LD) $(LDFLAGS) $@ LIB:c_ppc.o $@.o $(LIBNAME) $(LDLIBS)
+
+mostlyclean: clean
+clean:
+	$(RM) *.o example minigzip $(LIBNAME) foo.gz
+
+zip:
+	zip -ul9 zlib README ChangeLog Makefile Make????.??? Makefile.?? \
+	  descrip.mms *.[ch]
+
+tgz:
+	cd ..; tar cfz zlib/zlib.tgz zlib/README zlib/ChangeLog zlib/Makefile \
+	  zlib/Make????.??? zlib/Makefile.?? zlib/descrip.mms zlib/*.[ch]
+
+# DO NOT DELETE THIS LINE -- make depend depends on it.
+
+adler32.o: zlib.h zconf.h
+compress.o: zlib.h zconf.h
+crc32.o: crc32.h zlib.h zconf.h
+deflate.o: deflate.h zutil.h zlib.h zconf.h
+example.o: zlib.h zconf.h
+gzio.o: zutil.h zlib.h zconf.h
+inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+inftrees.o: zutil.h zlib.h zconf.h inftrees.h
+minigzip.o: zlib.h zconf.h
+trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
+uncompr.o: zlib.h zconf.h
+zutil.o: zutil.h zlib.h zconf.h
diff --git a/updater/zlib123/amiga/Makefile.sas b/updater/zlib123/amiga/Makefile.sas
new file mode 100644
index 0000000..580d022
--- /dev/null
+++ b/updater/zlib123/amiga/Makefile.sas
@@ -0,0 +1,65 @@
+# SMakefile for zlib
+# Modified from the standard UNIX Makefile Copyright Jean-loup Gailly
+# Osma Ahvenlampi <Osma.Ahvenlampi@hut.fi>
+# Amiga, SAS/C 6.56 & Smake
+
+CC=sc
+CFLAGS=OPT
+#CFLAGS=OPT CPU=68030
+#CFLAGS=DEBUG=LINE
+LDFLAGS=LIB z.lib
+
+SCOPTIONS=OPTSCHED OPTINLINE OPTALIAS OPTTIME OPTINLOCAL STRMERGE \
+       NOICONS PARMS=BOTH NOSTACKCHECK UTILLIB NOVERSION ERRORREXX \
+       DEF=POSTINC
+
+OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
+       zutil.o inflate.o infback.o inftrees.o inffast.o
+
+TEST_OBJS = example.o minigzip.o
+
+all: SCOPTIONS example minigzip
+
+check: test
+test: all
+	example
+	echo hello world | minigzip | minigzip -d
+
+install: z.lib
+	copy clone zlib.h zconf.h INCLUDE:
+	copy clone z.lib LIB:
+
+z.lib: $(OBJS)
+	oml z.lib r $(OBJS)
+
+example: example.o z.lib
+	$(CC) $(CFLAGS) LINK TO $@ example.o $(LDFLAGS)
+
+minigzip: minigzip.o z.lib
+	$(CC) $(CFLAGS) LINK TO $@ minigzip.o $(LDFLAGS)
+
+mostlyclean: clean
+clean:
+	-delete force quiet example minigzip *.o z.lib foo.gz *.lnk SCOPTIONS
+
+SCOPTIONS: Makefile.sas
+	copy to $@ <from <
+$(SCOPTIONS)
+<
+
+# DO NOT DELETE THIS LINE -- make depend depends on it.
+
+adler32.o: zlib.h zconf.h
+compress.o: zlib.h zconf.h
+crc32.o: crc32.h zlib.h zconf.h
+deflate.o: deflate.h zutil.h zlib.h zconf.h
+example.o: zlib.h zconf.h
+gzio.o: zutil.h zlib.h zconf.h
+inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+inftrees.o: zutil.h zlib.h zconf.h inftrees.h
+minigzip.o: zlib.h zconf.h
+trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
+uncompr.o: zlib.h zconf.h
+zutil.o: zutil.h zlib.h zconf.h
diff --git a/updater/zlib123/as400/bndsrc b/updater/zlib123/as400/bndsrc
new file mode 100644
index 0000000..be631c4
--- /dev/null
+++ b/updater/zlib123/as400/bndsrc
@@ -0,0 +1,132 @@
+STRPGMEXP PGMLVL(*CURRENT) SIGNATURE('ZLIB')
+
+/*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
+/*   Version 1.1.3 entry points.                                    */
+/*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
+
+/********************************************************************/
+/*   *MODULE      ADLER32      ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("adler32")
+
+/********************************************************************/
+/*   *MODULE      COMPRESS     ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("compress")
+  EXPORT SYMBOL("compress2")
+
+/********************************************************************/
+/*   *MODULE      CRC32        ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("crc32")
+  EXPORT SYMBOL("get_crc_table")
+
+/********************************************************************/
+/*   *MODULE      DEFLATE      ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("deflate")
+  EXPORT SYMBOL("deflateEnd")
+  EXPORT SYMBOL("deflateSetDictionary")
+  EXPORT SYMBOL("deflateCopy")
+  EXPORT SYMBOL("deflateReset")
+  EXPORT SYMBOL("deflateParams")
+  EXPORT SYMBOL("deflatePrime")
+  EXPORT SYMBOL("deflateInit_")
+  EXPORT SYMBOL("deflateInit2_")
+
+/********************************************************************/
+/*   *MODULE      GZIO         ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("gzopen")
+  EXPORT SYMBOL("gzdopen")
+  EXPORT SYMBOL("gzsetparams")
+  EXPORT SYMBOL("gzread")
+  EXPORT SYMBOL("gzwrite")
+  EXPORT SYMBOL("gzprintf")
+  EXPORT SYMBOL("gzputs")
+  EXPORT SYMBOL("gzgets")
+  EXPORT SYMBOL("gzputc")
+  EXPORT SYMBOL("gzgetc")
+  EXPORT SYMBOL("gzflush")
+  EXPORT SYMBOL("gzseek")
+  EXPORT SYMBOL("gzrewind")
+  EXPORT SYMBOL("gztell")
+  EXPORT SYMBOL("gzeof")
+  EXPORT SYMBOL("gzclose")
+  EXPORT SYMBOL("gzerror")
+
+/********************************************************************/
+/*   *MODULE      INFLATE      ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("inflate")
+  EXPORT SYMBOL("inflateEnd")
+  EXPORT SYMBOL("inflateSetDictionary")
+  EXPORT SYMBOL("inflateSync")
+  EXPORT SYMBOL("inflateReset")
+  EXPORT SYMBOL("inflateInit_")
+  EXPORT SYMBOL("inflateInit2_")
+  EXPORT SYMBOL("inflateSyncPoint")
+
+/********************************************************************/
+/*   *MODULE      UNCOMPR      ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("uncompress")
+
+/********************************************************************/
+/*   *MODULE      ZUTIL        ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("zlibVersion")
+  EXPORT SYMBOL("zError")
+
+/*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
+/*   Version 1.2.1 additional entry points.                         */
+/*@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@*/
+
+/********************************************************************/
+/*   *MODULE      COMPRESS     ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("compressBound")
+
+/********************************************************************/
+/*   *MODULE      DEFLATE      ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("deflateBound")
+
+/********************************************************************/
+/*   *MODULE      GZIO         ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("gzungetc")
+  EXPORT SYMBOL("gzclearerr")
+
+/********************************************************************/
+/*   *MODULE      INFBACK      ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("inflateBack")
+  EXPORT SYMBOL("inflateBackEnd")
+  EXPORT SYMBOL("inflateBackInit_")
+
+/********************************************************************/
+/*   *MODULE      INFLATE      ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("inflateCopy")
+
+/********************************************************************/
+/*   *MODULE      ZUTIL        ZLIB         01/02/01  00:15:09      */
+/********************************************************************/
+
+  EXPORT SYMBOL("zlibCompileFlags")
+
+ENDPGMEXP
diff --git a/updater/zlib123/as400/compile.clp b/updater/zlib123/as400/compile.clp
new file mode 100644
index 0000000..040de67
--- /dev/null
+++ b/updater/zlib123/as400/compile.clp
@@ -0,0 +1,123 @@
+/******************************************************************************/
+/*                                                                            */
+/*  ZLIB                                                                      */
+/*                                                                            */
+/*    Compile sources into modules and link them into a service program.      */
+/*                                                                            */
+/******************************************************************************/
+
+             PGM
+
+/*      Configuration adjustable parameters.                                  */
+
+             DCL        VAR(&SRCLIB) TYPE(*CHAR) LEN(10) +
+                          VALUE('ZLIB')                         /* Source library. */
+             DCL        VAR(&SRCFILE) TYPE(*CHAR) LEN(10) +
+                          VALUE('SOURCES')                      /* Source member file. */
+             DCL        VAR(&CTLFILE) TYPE(*CHAR) LEN(10) +
+                          VALUE('TOOLS')                        /* Control member file. */
+
+             DCL        VAR(&MODLIB) TYPE(*CHAR) LEN(10) +
+                          VALUE('ZLIB')                         /* Module library. */
+
+             DCL        VAR(&SRVLIB) TYPE(*CHAR) LEN(10) +
+                          VALUE('LGPL')                         /* Service program library. */
+
+             DCL        VAR(&CFLAGS) TYPE(*CHAR) +
+                          VALUE('OPTIMIZE(40)')                 /* Compile options. */
+
+
+/*      Working storage.                                                      */
+
+             DCL        VAR(&CMDLEN) TYPE(*DEC) LEN(15 5) VALUE(300)    /* Command length. */
+             DCL        VAR(&CMD) TYPE(*CHAR) LEN(512)
+
+
+/*      Compile sources into modules.                                         */
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/ADLER32)               SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/COMPRESS)              SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/CRC32)                 SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/DEFLATE)               SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/GZIO)                  SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/INFBACK)               SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/INFFAST)               SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/INFLATE)               SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/INFTREES)              SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/TREES)                 SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/UNCOMPR)               SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+             CHGVAR     VAR(&CMD) VALUE('CRTCMOD MODULE(' *TCAT &MODLIB *TCAT  +
+                        '/ZUTIL)                 SRCFILE(' *TCAT               +
+                        &SRCLIB *TCAT '/' *TCAT &SRCFILE *TCAT                 +
+                        ') SYSIFCOPT(*IFSIO)' *BCAT &CFLAGS)
+             CALL       PGM(QCMDEXC) PARM(&CMD &CMDLEN)
+
+
+/*      Link modules into a service program.                                  */
+
+             CRTSRVPGM  SRVPGM(&SRVLIB/ZLIB) +
+                          MODULE(&MODLIB/ADLER32     &MODLIB/COMPRESS    +
+                                 &MODLIB/CRC32       &MODLIB/DEFLATE     +
+                                 &MODLIB/GZIO        &MODLIB/INFBACK     +
+                                 &MODLIB/INFFAST     &MODLIB/INFLATE     +
+                                 &MODLIB/INFTREES    &MODLIB/TREES       +
+                                 &MODLIB/UNCOMPR     &MODLIB/ZUTIL)      +
+                          SRCFILE(&SRCLIB/&CTLFILE) SRCMBR(BNDSRC) +
+                          TEXT('ZLIB 1.2.3') TGTRLS(V4R4M0)
+
+             ENDPGM
diff --git a/updater/zlib123/as400/readme.txt b/updater/zlib123/as400/readme.txt
new file mode 100644
index 0000000..bace8f4
--- /dev/null
+++ b/updater/zlib123/as400/readme.txt
@@ -0,0 +1,111 @@
+        ZLIB version 1.2.3 for AS400 installation instructions
+
+I) From an AS400 *SAVF file:
+
+1)      Unpacking archive to an AS400 save file
+
+On the AS400:
+
+_       Create the ZLIB AS400 library:
+
+        CRTLIB LIB(ZLIB) TYPE(PROD) TEXT('ZLIB compression API library')
+
+_       Create a work save file, for example:
+
+                CRTSAVF FILE(ZLIB/ZLIBSAVF)
+
+On a PC connected to the target AS400:
+
+_       Unpack the save file image to a PC file "ZLIBSAVF"
+_       Upload this file into the save file on the AS400, for example
+                using ftp in BINARY mode.
+
+
+2)      Populating the ZLIB AS400 source library
+
+On the AS400:
+
+_       Extract the saved objects into the ZLIB AS400 library using:
+
+RSTOBJ OBJ(*ALL) SAVLIB(ZLIB) DEV(*SAVF) SAVF(ZLIB/ZLIBSAVF) RSTLIB(ZLIB)
+
+
+3)      Customize installation:
+
+_       Edit CL member ZLIB/TOOLS(COMPILE) and change parameters if needed,
+                according to the comments.
+
+_       Compile this member with:
+
+        CRTCLPGM PGM(ZLIB/COMPILE) SRCFILE(ZLIB/TOOLS) SRCMBR(COMPILE)
+
+
+4)      Compile and generate the service program:
+
+_       This can now be done by executing:
+
+        CALL PGM(ZLIB/COMPILE)
+
+
+
+II) From the original source distribution:
+
+1)      On the AS400, create the source library:
+
+        CRTLIB LIB(ZLIB) TYPE(PROD) TEXT('ZLIB compression API library')
+
+2)      Create the source files:
+
+        CRTSRCPF FILE(ZLIB/SOURCES) RCDLEN(112) TEXT('ZLIB library modules')
+        CRTSRCPF FILE(ZLIB/H)       RCDLEN(112) TEXT('ZLIB library includes')
+        CRTSRCPF FILE(ZLIB/TOOLS)   RCDLEN(112) TEXT('ZLIB library control utilities')
+
+3)      From the machine hosting the distribution files, upload them (with
+                FTP in text mode, for example) according to the following table:
+
+    Original    AS400   AS400    AS400 AS400
+    file        file    member   type  description
+                SOURCES                Original ZLIB C subprogram sources
+    adler32.c           ADLER32  C     ZLIB - Compute the Adler-32 checksum of a dta strm
+    compress.c          COMPRESS C     ZLIB - Compress a memory buffer
+    crc32.c             CRC32    C     ZLIB - Compute the CRC-32 of a data stream
+    deflate.c           DEFLATE  C     ZLIB - Compress data using the deflation algorithm
+    gzio.c              GZIO     C     ZLIB - IO on .gz files
+    infback.c           INFBACK  C     ZLIB - Inflate using a callback interface
+    inffast.c           INFFAST  C     ZLIB - Fast proc. literals & length/distance pairs
+    inflate.c           INFLATE  C     ZLIB - Interface to inflate modules
+    inftrees.c          INFTREES C     ZLIB - Generate Huffman trees for efficient decode
+    trees.c             TREES    C     ZLIB - Output deflated data using Huffman coding
+    uncompr.c           UNCOMPR  C     ZLIB - Decompress a memory buffer
+    zutil.c             ZUTIL    C     ZLIB - Target dependent utility functions
+                H                      Original ZLIB C and ILE/RPG include files
+    crc32.h             CRC32    C     ZLIB - CRC32 tables
+    deflate.h           DEFLATE  C     ZLIB - Internal compression state
+    inffast.h           INFFAST  C     ZLIB - Header to use inffast.c
+    inffixed.h          INFFIXED C     ZLIB - Table for decoding fixed codes
+    inflate.h           INFLATE  C     ZLIB - Internal inflate state definitions
+    inftrees.h          INFTREES C     ZLIB - Header to use inftrees.c
+    trees.h             TREES    C     ZLIB - Created automatically with -DGEN_TREES_H
+    zconf.h             ZCONF    C     ZLIB - Compression library configuration
+    zlib.h              ZLIB     C     ZLIB - Compression library C user interface
+    as400/zlib.inc      ZLIB.INC RPGLE ZLIB - Compression library ILE RPG user interface
+    zutil.h             ZUTIL    C     ZLIB - Internal interface and configuration
+                TOOLS                  Building source software & AS/400 README
+    as400/bndsrc        BNDSRC         Entry point exportation list
+    as400/compile.clp   COMPILE  CLP   Compile sources & generate service program
+    as400/readme.txt    README   TXT   Installation instructions
+
+4)      Continue as in I)3).
+
+
+
+
+Notes:  For AS400 ILE RPG programmers, a /copy member defining the ZLIB
+                API prototypes for ILE RPG can be found in ZLIB/H(ZLIB.INC).
+                Please read comments in this member for more information.
+
+        Remember that most foreign textual data are ASCII coded: this
+                implementation does not handle conversion from/to ASCII, so
+                text data code conversions must be done explicitely.
+
+        Always open zipped files in binary mode.
diff --git a/updater/zlib123/as400/zlib.inc b/updater/zlib123/as400/zlib.inc
new file mode 100644
index 0000000..c3a9e4f
--- /dev/null
+++ b/updater/zlib123/as400/zlib.inc
@@ -0,0 +1,331 @@
+      *  ZLIB.INC - Interface to the general purpose compression library
+      *
+      *  ILE RPG400 version by Patrick Monnerat, DATASPHERE.
+      *  Version 1.2.3
+      *
+      *
+      *  WARNING:
+      *     Procedures inflateInit(), inflateInit2(), deflateInit(),
+      *         deflateInit2() and inflateBackInit() need to be called with
+      *         two additional arguments:
+      *         the package version string and the stream control structure.
+      *         size. This is needed because RPG lacks some macro feature.
+      *         Call these procedures as:
+      *             inflateInit(...: ZLIB_VERSION: %size(z_stream))
+      *
+      /if not defined(ZLIB_H_)
+      /define ZLIB_H_
+      *
+      **************************************************************************
+      *                               Constants
+      **************************************************************************
+      *
+      *  Versioning information.
+      *
+     D ZLIB_VERSION    C                   '1.2.3'
+     D ZLIB_VERNUM     C                   X'1230'
+      *
+      *  Other equates.
+      *
+     D Z_NO_FLUSH      C                   0
+     D Z_SYNC_FLUSH    C                   2
+     D Z_FULL_FLUSH    C                   3
+     D Z_FINISH        C                   4
+     D Z_BLOCK         C                   5
+      *
+     D Z_OK            C                   0
+     D Z_STREAM_END    C                   1
+     D Z_NEED_DICT     C                   2
+     D Z_ERRNO         C                   -1
+     D Z_STREAM_ERROR  C                   -2
+     D Z_DATA_ERROR    C                   -3
+     D Z_MEM_ERROR     C                   -4
+     D Z_BUF_ERROR     C                   -5
+     DZ_VERSION_ERROR  C                   -6
+      *
+     D Z_NO_COMPRESSION...
+     D                 C                   0
+     D Z_BEST_SPEED    C                   1
+     D Z_BEST_COMPRESSION...
+     D                 C                   9
+     D Z_DEFAULT_COMPRESSION...
+     D                 C                   -1
+      *
+     D Z_FILTERED      C                   1
+     D Z_HUFFMAN_ONLY  C                   2
+     D Z_RLE           C                   3
+     D Z_DEFAULT_STRATEGY...
+     D                 C                   0
+      *
+     D Z_BINARY        C                   0
+     D Z_ASCII         C                   1
+     D Z_UNKNOWN       C                   2
+      *
+     D Z_DEFLATED      C                   8
+      *
+     D Z_NULL          C                   0
+      *
+      **************************************************************************
+      *                                 Types
+      **************************************************************************
+      *
+     D z_streamp       S               *                                        Stream struct ptr
+     D gzFile          S               *                                        File pointer
+     D z_off_t         S             10i 0                                      Stream offsets
+      *
+      **************************************************************************
+      *                               Structures
+      **************************************************************************
+      *
+      *  The GZIP encode/decode stream support structure.
+      *
+     D z_stream        DS                  align based(z_streamp)
+     D  zs_next_in                     *                                        Next input byte
+     D  zs_avail_in                  10U 0                                      Byte cnt at next_in
+     D  zs_total_in                  10U 0                                      Total bytes read
+     D  zs_next_out                    *                                        Output buffer ptr
+     D  zs_avail_out                 10U 0                                      Room left @ next_out
+     D  zs_total_out                 10U 0                                      Total bytes written
+     D  zs_msg                         *                                        Last errmsg or null
+     D  zs_state                       *                                        Internal state
+     D  zs_zalloc                      *   procptr                              Int. state allocator
+     D  zs_free                        *   procptr                              Int. state dealloc.
+     D  zs_opaque                      *                                        Private alloc. data
+     D  zs_data_type                 10i 0                                      ASC/BIN best guess
+     D  zs_adler                     10u 0                                      Uncompr. adler32 val
+     D                               10U 0                                      Reserved
+     D                               10U 0                                      Ptr. alignment
+      *
+      **************************************************************************
+      *                     Utility function prototypes
+      **************************************************************************
+      *
+     D compress        PR            10I 0 extproc('compress')
+     D  dest                      32767    options(*varsize)                    Destination buffer
+     D  destLen                      10U 0                                      Destination length
+     D  source                    32767    const options(*varsize)              Source buffer
+     D  sourceLen                    10u 0 value                                Source length
+      *
+     D compress2       PR            10I 0 extproc('compress2')
+     D  dest                      32767    options(*varsize)                    Destination buffer
+     D  destLen                      10U 0                                      Destination length
+     D  source                    32767    const options(*varsize)              Source buffer
+     D  sourceLen                    10U 0 value                                Source length
+     D  level                        10I 0 value                                Compression level
+      *
+     D compressBound   PR            10U 0 extproc('compressBound')
+     D  sourceLen                    10U 0 value
+      *
+     D uncompress      PR            10I 0 extproc('uncompress')
+     D  dest                      32767    options(*varsize)                    Destination buffer
+     D  destLen                      10U 0                                      Destination length
+     D  source                    32767    const options(*varsize)              Source buffer
+     D  sourceLen                    10U 0 value                                Source length
+      *
+     D gzopen          PR                  extproc('gzopen')
+     D                                     like(gzFile)
+     D  path                           *   value options(*string)               File pathname
+     D  mode                           *   value options(*string)               Open mode
+      *
+     D gzdopen         PR                  extproc('gzdopen')
+     D                                     like(gzFile)
+     D  fd                           10i 0 value                                File descriptor
+     D  mode                           *   value options(*string)               Open mode
+      *
+     D gzsetparams     PR            10I 0 extproc('gzsetparams')
+     D  file                               value like(gzFile)                   File pointer
+     D  level                        10I 0 value
+     D  strategy                     10i 0 value
+      *
+     D gzread          PR            10I 0 extproc('gzread')
+     D  file                               value like(gzFile)                   File pointer
+     D  buf                       32767    options(*varsize)                    Buffer
+     D  len                          10u 0 value                                Buffer length
+      *
+     D gzwrite         PR            10I 0 extproc('gzwrite')
+     D  file                               value like(gzFile)                   File pointer
+     D  buf                       32767    const options(*varsize)              Buffer
+     D  len                          10u 0 value                                Buffer length
+      *
+     D gzputs          PR            10I 0 extproc('gzputs')
+     D  file                               value like(gzFile)                   File pointer
+     D  s                              *   value options(*string)               String to output
+      *
+     D gzgets          PR              *   extproc('gzgets')
+     D  file                               value like(gzFile)                   File pointer
+     D  buf                       32767    options(*varsize)                    Read buffer
+     D  len                          10i 0 value                                Buffer length
+      *
+     D gzflush         PR            10i 0 extproc('gzflush')
+     D  file                               value like(gzFile)                   File pointer
+     D  flush                        10I 0 value                                Type of flush
+      *
+     D gzseek          PR                  extproc('gzseek')
+     D                                     like(z_off_t)
+     D  file                               value like(gzFile)                   File pointer
+     D  offset                             value like(z_off_t)                  Offset
+     D  whence                       10i 0 value                                Origin
+      *
+     D gzrewind        PR            10i 0 extproc('gzrewind')
+     D  file                               value like(gzFile)                   File pointer
+      *
+     D gztell          PR                  extproc('gztell')
+     D                                     like(z_off_t)
+     D  file                               value like(gzFile)                   File pointer
+      *
+     D gzeof           PR            10i 0 extproc('gzeof')
+     D  file                               value like(gzFile)                   File pointer
+      *
+     D gzclose         PR            10i 0 extproc('gzclose')
+     D  file                               value like(gzFile)                   File pointer
+      *
+     D gzerror         PR              *   extproc('gzerror')                   Error string
+     D  file                               value like(gzFile)                   File pointer
+     D  errnum                       10I 0                                      Error code
+      *
+     D gzclearerr      PR                  extproc('gzclearerr')
+     D  file                               value like(gzFile)                   File pointer
+      *
+      **************************************************************************
+      *                        Basic function prototypes
+      **************************************************************************
+      *
+     D zlibVersion     PR              *   extproc('zlibVersion')               Version string
+      *
+     D deflateInit     PR            10I 0 extproc('deflateInit_')              Init. compression
+     D  strm                               like(z_stream)                       Compression stream
+     D  level                        10I 0 value                                Compression level
+     D  version                        *   value options(*string)               Version string
+     D  stream_size                  10i 0 value                                Stream struct. size
+      *
+     D deflate         PR            10I 0 extproc('deflate')                   Compress data
+     D  strm                               like(z_stream)                       Compression stream
+     D  flush                        10I 0 value                                Flush type required
+      *
+     D deflateEnd      PR            10I 0 extproc('deflateEnd')                Termin. compression
+     D  strm                               like(z_stream)                       Compression stream
+      *
+     D inflateInit     PR            10I 0 extproc('inflateInit_')              Init. expansion
+     D  strm                               like(z_stream)                       Expansion stream
+     D  version                        *   value options(*string)               Version string
+     D  stream_size                  10i 0 value                                Stream struct. size
+      *
+     D inflate         PR            10I 0 extproc('inflate')                   Expand data
+     D  strm                               like(z_stream)                       Expansion stream
+     D  flush                        10I 0 value                                Flush type required
+      *
+     D inflateEnd      PR            10I 0 extproc('inflateEnd')                Termin. expansion
+     D  strm                               like(z_stream)                       Expansion stream
+      *
+      **************************************************************************
+      *                        Advanced function prototypes
+      **************************************************************************
+      *
+     D deflateInit2    PR            10I 0 extproc('deflateInit2_')             Init. compression
+     D  strm                               like(z_stream)                       Compression stream
+     D  level                        10I 0 value                                Compression level
+     D  method                       10I 0 value                                Compression method
+     D  windowBits                   10I 0 value                                log2(window size)
+     D  memLevel                     10I 0 value                                Mem/cmpress tradeoff
+     D  strategy                     10I 0 value                                Compression stategy
+     D  version                        *   value options(*string)               Version string
+     D  stream_size                  10i 0 value                                Stream struct. size
+      *
+     D deflateSetDictionary...
+     D                 PR            10I 0 extproc('deflateSetDictionary')      Init. dictionary
+     D  strm                               like(z_stream)                       Compression stream
+     D  dictionary                32767    const options(*varsize)              Dictionary bytes
+     D  dictLength                   10U 0 value                                Dictionary length
+      *
+     D deflateCopy     PR            10I 0 extproc('deflateCopy')               Compress strm 2 strm
+     D  dest                               like(z_stream)                       Destination stream
+     D  source                             like(z_stream)                       Source stream
+      *
+     D deflateReset    PR            10I 0 extproc('deflateReset')              End and init. stream
+     D  strm                               like(z_stream)                       Compression stream
+      *
+     D deflateParams   PR            10I 0 extproc('deflateParams')             Change level & strat
+     D  strm                               like(z_stream)                       Compression stream
+     D  level                        10I 0 value                                Compression level
+     D  strategy                     10I 0 value                                Compression stategy
+      *
+     D deflateBound    PR            10U 0 extproc('deflateBound')              Change level & strat
+     D  strm                               like(z_stream)                       Compression stream
+     D  sourcelen                    10U 0 value                                Compression level
+      *
+     D deflatePrime    PR            10I 0 extproc('deflatePrime')              Change level & strat
+     D  strm                               like(z_stream)                       Compression stream
+     D  bits                         10I 0 value                                Number of bits to insert
+     D  value                        10I 0 value                                Bits to insert
+      *
+     D inflateInit2    PR            10I 0 extproc('inflateInit2_')             Init. expansion
+     D  strm                               like(z_stream)                       Expansion stream
+     D  windowBits                   10I 0 value                                log2(window size)
+     D  version                        *   value options(*string)               Version string
+     D  stream_size                  10i 0 value                                Stream struct. size
+      *
+     D inflateSetDictionary...
+     D                 PR            10I 0 extproc('inflateSetDictionary')      Init. dictionary
+     D  strm                               like(z_stream)                       Expansion stream
+     D  dictionary                32767    const options(*varsize)              Dictionary bytes
+     D  dictLength                   10U 0 value                                Dictionary length
+      *
+     D inflateSync     PR            10I 0 extproc('inflateSync')               Sync. expansion
+     D  strm                               like(z_stream)                       Expansion stream
+      *
+     D inflateCopy     PR            10I 0 extproc('inflateCopy')
+     D  dest                               like(z_stream)                       Destination stream
+     D  source                             like(z_stream)                       Source stream
+      *
+     D inflateReset    PR            10I 0 extproc('inflateReset')              End and init. stream
+     D  strm                               like(z_stream)                       Expansion stream
+      *
+     D inflateBackInit...
+     D                 PR            10I 0 extproc('inflateBackInit_')
+     D  strm                               like(z_stream)                       Expansion stream
+     D  windowBits                   10I 0 value                                Log2(buffer size)
+     D  window                    32767    options(*varsize)                    Buffer
+     D  version                        *   value options(*string)               Version string
+     D  stream_size                  10i 0 value                                Stream struct. size
+      *
+     D inflateBack     PR            10I 0 extproc('inflateBack')
+     D  strm                               like(z_stream)                       Expansion stream
+     D  in                             *   value procptr                        Input function
+     D  in_desc                        *   value                                Input descriptor
+     D  out                            *   value procptr                        Output function
+     D  out_desc                       *   value                                Output descriptor
+      *
+     D inflateBackEnd  PR            10I 0 extproc('inflateBackEnd')
+     D  strm                               like(z_stream)                       Expansion stream
+      *
+     D zlibCompileFlags...
+     D                 PR            10U 0 extproc('zlibCompileFlags')
+      *
+      **************************************************************************
+      *                        Checksum function prototypes
+      **************************************************************************
+      *
+     D adler32         PR            10U 0 extproc('adler32')                   New checksum
+     D  adler                        10U 0 value                                Old checksum
+     D  buf                       32767    const options(*varsize)              Bytes to accumulate
+     D  len                          10U 0 value                                Buffer length
+      *
+     D crc32           PR            10U 0 extproc('crc32')                     New checksum
+     D  crc                          10U 0 value                                Old checksum
+     D  buf                       32767    const options(*varsize)              Bytes to accumulate
+     D  len                          10U 0 value                                Buffer length
+      *
+      **************************************************************************
+      *                     Miscellaneous function prototypes
+      **************************************************************************
+      *
+     D zError          PR              *   extproc('zError')                    Error string
+     D  err                          10I 0 value                                Error code
+      *
+     D inflateSyncPoint...
+     D                 PR            10I 0 extproc('inflateSyncPoint')
+     D  strm                               like(z_stream)                       Expansion stream
+      *
+     D get_crc_table   PR              *   extproc('get_crc_table')             Ptr to ulongs
+      *
+      /endif
diff --git a/updater/zlib123/compress_zlib.c b/updater/zlib123/compress_zlib.c
new file mode 100644
index 0000000..63d4135
--- /dev/null
+++ b/updater/zlib123/compress_zlib.c
@@ -0,0 +1,69 @@
+/* compress.c -- compress a memory buffer
+ * Copyright (C) 1995-2003 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#define ZLIB_INTERNAL
+#include "zlib.h"
+
+/* ===========================================================================
+     Compresses the source buffer into the destination buffer. The level
+   parameter has the same meaning as in deflateInit.  sourceLen is the byte
+   length of the source buffer. Upon entry, destLen is the total size of the
+   destination buffer, which must be at least 0.1% larger than sourceLen plus
+   12 bytes. Upon exit, destLen is the actual size of the compressed buffer.
+
+     compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
+   memory, Z_BUF_ERROR if there was not enough room in the output buffer,
+   Z_STREAM_ERROR if the level parameter is invalid.
+*/
+int ZEXPORT compress2 (Bytef *dest, uLongf *destLen, const Bytef *source, uLong sourceLen, int level)
+{
+    z_stream stream;
+    int err;
+
+    stream.next_in = (Bytef*)source;
+    stream.avail_in = (uInt)sourceLen;
+#ifdef MAXSEG_64K
+    /* Check for source > 64K on 16-bit machine: */
+    if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;
+#endif
+    stream.next_out = dest;
+    stream.avail_out = (uInt)*destLen;
+    if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR;
+
+    stream.zalloc = (alloc_func)0;
+    stream.zfree = (free_func)0;
+    stream.opaque = (voidpf)0;
+
+    err = deflateInit(&stream, level);
+    if (err != Z_OK) return err;
+
+    err = deflate(&stream, Z_FINISH);
+    if (err != Z_STREAM_END) {
+        deflateEnd(&stream);
+        return err == Z_OK ? Z_BUF_ERROR : err;
+    }
+    *destLen = stream.total_out;
+
+    err = deflateEnd(&stream);
+    return err;
+}
+
+/* ===========================================================================
+ */
+int ZEXPORT compress (Bytef *dest, uLongf *destLen, const Bytef *source, uLong sourceLen)
+{
+    return compress2(dest, destLen, source, sourceLen, Z_DEFAULT_COMPRESSION);
+}
+
+/* ===========================================================================
+     If the default memLevel or windowBits for deflateInit() is changed, then
+   this function needs to be updated.
+ */
+uLong ZEXPORT compressBound (uLong sourceLen)
+{
+    return sourceLen + (sourceLen >> 12) + (sourceLen >> 14) + 11;
+}
diff --git a/updater/zlib123/configure b/updater/zlib123/configure
new file mode 100644
index 0000000..212e92e
--- /dev/null
+++ b/updater/zlib123/configure
@@ -0,0 +1,459 @@
+#!/bin/sh
+# configure script for zlib. This script is needed only if
+# you wish to build a shared library and your system supports them,
+# of if you need special compiler, flags or install directory.
+# Otherwise, you can just use directly "make test; make install"
+#
+# To create a shared library, use "configure --shared"; by default a static
+# library is created. If the primitive shared library support provided here
+# does not work, use ftp://prep.ai.mit.edu/pub/gnu/libtool-*.tar.gz
+#
+# To impose specific compiler or flags or install directory, use for example:
+#    prefix=$HOME CC=cc CFLAGS="-O4" ./configure
+# or for csh/tcsh users:
+#    (setenv prefix $HOME; setenv CC cc; setenv CFLAGS "-O4"; ./configure)
+# LDSHARED is the command to be used to create a shared library
+
+# Incorrect settings of CC or CFLAGS may prevent creating a shared library.
+# If you have problems, try without defining CC and CFLAGS before reporting
+# an error.
+
+LIBS=libz.a
+LDFLAGS="-L. ${LIBS}"
+VER=`sed -n -e '/VERSION "/s/.*"\(.*\)".*/\1/p' < zlib.h`
+VER2=`sed -n -e '/VERSION "/s/.*"\([0-9]*\\.[0-9]*\)\\..*/\1/p' < zlib.h`
+VER1=`sed -n -e '/VERSION "/s/.*"\([0-9]*\)\\..*/\1/p' < zlib.h`
+AR=${AR-"ar rc"}
+RANLIB=${RANLIB-"ranlib"}
+prefix=${prefix-/usr/local}
+exec_prefix=${exec_prefix-'${prefix}'}
+libdir=${libdir-'${exec_prefix}/lib'}
+includedir=${includedir-'${prefix}/include'}
+mandir=${mandir-'${prefix}/share/man'}
+shared_ext='.so'
+shared=0
+gcc=0
+old_cc="$CC"
+old_cflags="$CFLAGS"
+
+while test $# -ge 1
+do
+case "$1" in
+    -h* | --h*)
+      echo 'usage:'
+      echo '  configure [--shared] [--prefix=PREFIX]  [--exec_prefix=EXPREFIX]'
+      echo '     [--libdir=LIBDIR] [--includedir=INCLUDEDIR]'
+        exit 0;;
+    -p*=* | --p*=*) prefix=`echo $1 | sed 's/[-a-z_]*=//'`; shift;;
+    -e*=* | --e*=*) exec_prefix=`echo $1 | sed 's/[-a-z_]*=//'`; shift;;
+    -l*=* | --libdir=*) libdir=`echo $1 | sed 's/[-a-z_]*=//'`; shift;;
+    -i*=* | --includedir=*) includedir=`echo $1 | sed 's/[-a-z_]*=//'`;shift;;
+    -p* | --p*) prefix="$2"; shift; shift;;
+    -e* | --e*) exec_prefix="$2"; shift; shift;;
+    -l* | --l*) libdir="$2"; shift; shift;;
+    -i* | --i*) includedir="$2"; shift; shift;;
+    -s* | --s*) shared=1; shift;;
+    *) echo "unknown option: $1"; echo "$0 --help for help"; exit 1;;
+    esac
+done
+
+test=ztest$$
+cat > $test.c <<EOF
+extern int getchar();
+int hello() {return getchar();}
+EOF
+
+test -z "$CC" && echo Checking for gcc...
+cc=${CC-gcc}
+cflags=${CFLAGS-"-O3"}
+# to force the asm version use: CFLAGS="-O3 -DASMV" ./configure
+case "$cc" in
+  *gcc*) gcc=1;;
+esac
+
+if test "$gcc" -eq 1 && ($cc -c $cflags $test.c) 2>/dev/null; then
+  CC="$cc"
+  SFLAGS=${CFLAGS-"-fPIC -O3"}
+  CFLAGS="$cflags"
+  case `(uname -s || echo unknown) 2>/dev/null` in
+  Linux | linux | GNU | GNU/*) LDSHARED=${LDSHARED-"$cc -shared -Wl,-soname,libz.so.1"};;
+  CYGWIN* | Cygwin* | cygwin* | OS/2* )
+             EXE='.exe';;
+  QNX*)  # This is for QNX6. I suppose that the QNX rule below is for QNX2,QNX4
+         # (alain.bonnefoy@icbt.com)
+                 LDSHARED=${LDSHARED-"$cc -shared -Wl,-hlibz.so.1"};;
+  HP-UX*)
+         LDSHARED=${LDSHARED-"$cc -shared $SFLAGS"}
+         case `(uname -m || echo unknown) 2>/dev/null` in
+         ia64)
+                 shared_ext='.so'
+                 SHAREDLIB='libz.so';;
+         *)
+                 shared_ext='.sl'
+                 SHAREDLIB='libz.sl';;
+         esac;;
+  Darwin*)   shared_ext='.dylib'
+             SHAREDLIB=libz$shared_ext
+             SHAREDLIBV=libz.$VER$shared_ext
+             SHAREDLIBM=libz.$VER1$shared_ext
+             LDSHARED=${LDSHARED-"$cc -dynamiclib -install_name $libdir/$SHAREDLIBM -compatibility_version $VER1 -current_version $VER"};;
+  *)             LDSHARED=${LDSHARED-"$cc -shared"};;
+  esac
+else
+  # find system name and corresponding cc options
+  CC=${CC-cc}
+  case `(uname -sr || echo unknown) 2>/dev/null` in
+  HP-UX*)    SFLAGS=${CFLAGS-"-O +z"}
+             CFLAGS=${CFLAGS-"-O"}
+#            LDSHARED=${LDSHARED-"ld -b +vnocompatwarnings"}
+             LDSHARED=${LDSHARED-"ld -b"}
+         case `(uname -m || echo unknown) 2>/dev/null` in
+         ia64)
+             shared_ext='.so'
+             SHAREDLIB='libz.so';;
+         *)
+             shared_ext='.sl'
+             SHAREDLIB='libz.sl';;
+         esac;;
+  IRIX*)     SFLAGS=${CFLAGS-"-ansi -O2 -rpath ."}
+             CFLAGS=${CFLAGS-"-ansi -O2"}
+             LDSHARED=${LDSHARED-"cc -shared"};;
+  OSF1\ V4*) SFLAGS=${CFLAGS-"-O -std1"}
+             CFLAGS=${CFLAGS-"-O -std1"}
+             LDSHARED=${LDSHARED-"cc -shared  -Wl,-soname,libz.so -Wl,-msym -Wl,-rpath,$(libdir) -Wl,-set_version,${VER}:1.0"};;
+  OSF1*)     SFLAGS=${CFLAGS-"-O -std1"}
+             CFLAGS=${CFLAGS-"-O -std1"}
+             LDSHARED=${LDSHARED-"cc -shared"};;
+  QNX*)      SFLAGS=${CFLAGS-"-4 -O"}
+             CFLAGS=${CFLAGS-"-4 -O"}
+             LDSHARED=${LDSHARED-"cc"}
+             RANLIB=${RANLIB-"true"}
+             AR="cc -A";;
+  SCO_SV\ 3.2*) SFLAGS=${CFLAGS-"-O3 -dy -KPIC "}
+             CFLAGS=${CFLAGS-"-O3"}
+             LDSHARED=${LDSHARED-"cc -dy -KPIC -G"};;
+  SunOS\ 5*) SFLAGS=${CFLAGS-"-fast -xcg89 -KPIC -R."}
+             CFLAGS=${CFLAGS-"-fast -xcg89"}
+             LDSHARED=${LDSHARED-"cc -G"};;
+  SunOS\ 4*) SFLAGS=${CFLAGS-"-O2 -PIC"}
+             CFLAGS=${CFLAGS-"-O2"}
+             LDSHARED=${LDSHARED-"ld"};;
+  SunStudio\ 9*) SFLAGS=${CFLAGS-"-DUSE_MMAP -fast -xcode=pic32 -xtarget=ultra3 -xarch=v9b"}
+             CFLAGS=${CFLAGS-"-DUSE_MMAP -fast -xtarget=ultra3 -xarch=v9b"}
+             LDSHARED=${LDSHARED-"cc -xarch=v9b"};;
+  UNIX_System_V\ 4.2.0)
+             SFLAGS=${CFLAGS-"-KPIC -O"}
+             CFLAGS=${CFLAGS-"-O"}
+             LDSHARED=${LDSHARED-"cc -G"};;
+  UNIX_SV\ 4.2MP)
+             SFLAGS=${CFLAGS-"-Kconform_pic -O"}
+             CFLAGS=${CFLAGS-"-O"}
+             LDSHARED=${LDSHARED-"cc -G"};;
+  OpenUNIX\ 5)
+             SFLAGS=${CFLAGS-"-KPIC -O"}
+             CFLAGS=${CFLAGS-"-O"}
+             LDSHARED=${LDSHARED-"cc -G"};;
+  AIX*)  # Courtesy of dbakker@arrayasolutions.com
+             SFLAGS=${CFLAGS-"-O -qmaxmem=8192"}
+             CFLAGS=${CFLAGS-"-O -qmaxmem=8192"}
+             LDSHARED=${LDSHARED-"xlc -G"};;
+  # send working options for other systems to support@gzip.org
+  *)         SFLAGS=${CFLAGS-"-O"}
+             CFLAGS=${CFLAGS-"-O"}
+             LDSHARED=${LDSHARED-"cc -shared"};;
+  esac
+fi
+
+SHAREDLIB=${SHAREDLIB-"libz$shared_ext"}
+SHAREDLIBV=${SHAREDLIBV-"libz$shared_ext.$VER"}
+SHAREDLIBM=${SHAREDLIBM-"libz$shared_ext.$VER1"}
+
+if test $shared -eq 1; then
+  echo Checking for shared library support...
+  # we must test in two steps (cc then ld), required at least on SunOS 4.x
+  if test "`($CC -c $SFLAGS $test.c) 2>&1`" = "" &&
+     test "`($LDSHARED -o $test$shared_ext $test.o) 2>&1`" = ""; then
+    CFLAGS="$SFLAGS"
+    LIBS="$SHAREDLIBV"
+    echo Building shared library $SHAREDLIBV with $CC.
+  elif test -z "$old_cc" -a -z "$old_cflags"; then
+    echo No shared library support.
+    shared=0;
+  else
+    echo 'No shared library support; try without defining CC and CFLAGS'
+    shared=0;
+  fi
+fi
+if test $shared -eq 0; then
+  LDSHARED="$CC"
+  echo Building static library $LIBS version $VER with $CC.
+else
+  LDFLAGS="-L. ${SHAREDLIBV}"
+fi
+
+cat > $test.c <<EOF
+#include <unistd.h>
+int main() { return 0; }
+EOF
+if test "`($CC -c $CFLAGS $test.c) 2>&1`" = ""; then
+  sed < zconf.in.h "/HAVE_UNISTD_H/s%0%1%" > zconf.h
+  echo "Checking for unistd.h... Yes."
+else
+  cp -p zconf.in.h zconf.h
+  echo "Checking for unistd.h... No."
+fi
+
+cat > $test.c <<EOF
+#include <stdio.h>
+#include <stdarg.h>
+#include "zconf.h"
+
+int main()
+{
+#ifndef STDC
+  choke me
+#endif
+
+  return 0;
+}
+EOF
+
+if test "`($CC -c $CFLAGS $test.c) 2>&1`" = ""; then
+  echo "Checking whether to use vs[n]printf() or s[n]printf()... using vs[n]printf()"
+
+  cat > $test.c <<EOF
+#include <stdio.h>
+#include <stdarg.h>
+
+int mytest(char *fmt, ...)
+{
+  char buf[20];
+  va_list ap;
+
+  va_start(ap, fmt);
+  vsnprintf(buf, sizeof(buf), fmt, ap);
+  va_end(ap);
+  return 0;
+}
+
+int main()
+{
+  return (mytest("Hello%d\n", 1));
+}
+EOF
+
+  if test "`($CC $CFLAGS -o $test $test.c) 2>&1`" = ""; then
+    echo "Checking for vsnprintf() in stdio.h... Yes."
+
+    cat >$test.c <<EOF
+#include <stdio.h>
+#include <stdarg.h>
+
+int mytest(char *fmt, ...)
+{
+  int n;
+  char buf[20];
+  va_list ap;
+
+  va_start(ap, fmt);
+  n = vsnprintf(buf, sizeof(buf), fmt, ap);
+  va_end(ap);
+  return n;
+}
+
+int main()
+{
+  return (mytest("Hello%d\n", 1));
+}
+EOF
+
+    if test "`($CC -c $CFLAGS $test.c) 2>&1`" = ""; then
+      echo "Checking for return value of vsnprintf()... Yes."
+    else
+      CFLAGS="$CFLAGS -DHAS_vsnprintf_void"
+      echo "Checking for return value of vsnprintf()... No."
+      echo "  WARNING: apparently vsnprintf() does not return a value. zlib"
+      echo "  can build but will be open to possible string-format security"
+      echo "  vulnerabilities."
+    fi
+  else
+    CFLAGS="$CFLAGS -DNO_vsnprintf"
+    echo "Checking for vsnprintf() in stdio.h... No."
+    echo "  WARNING: vsnprintf() not found, falling back to vsprintf(). zlib"
+    echo "  can build but will be open to possible buffer-overflow security"
+    echo "  vulnerabilities."
+
+    cat >$test.c <<EOF
+#include <stdio.h>
+#include <stdarg.h>
+
+int mytest(char *fmt, ...)
+{
+  int n;
+  char buf[20];
+  va_list ap;
+
+  va_start(ap, fmt);
+  n = vsprintf(buf, fmt, ap);
+  va_end(ap);
+  return n;
+}
+
+int main()
+{
+  return (mytest("Hello%d\n", 1));
+}
+EOF
+
+    if test "`($CC -c $CFLAGS $test.c) 2>&1`" = ""; then
+      echo "Checking for return value of vsprintf()... Yes."
+    else
+      CFLAGS="$CFLAGS -DHAS_vsprintf_void"
+      echo "Checking for return value of vsprintf()... No."
+      echo "  WARNING: apparently vsprintf() does not return a value. zlib"
+      echo "  can build but will be open to possible string-format security"
+      echo "  vulnerabilities."
+    fi
+  fi
+else
+  echo "Checking whether to use vs[n]printf() or s[n]printf()... using s[n]printf()"
+
+  cat >$test.c <<EOF
+#include <stdio.h>
+
+int mytest()
+{
+  char buf[20];
+
+  snprintf(buf, sizeof(buf), "%s", "foo");
+  return 0;
+}
+
+int main()
+{
+  return (mytest());
+}
+EOF
+
+  if test "`($CC $CFLAGS -o $test $test.c) 2>&1`" = ""; then
+    echo "Checking for snprintf() in stdio.h... Yes."
+
+    cat >$test.c <<EOF
+#include <stdio.h>
+
+int mytest()
+{
+  char buf[20];
+
+  return snprintf(buf, sizeof(buf), "%s", "foo");
+}
+
+int main()
+{
+  return (mytest());
+}
+EOF
+
+    if test "`($CC -c $CFLAGS $test.c) 2>&1`" = ""; then
+      echo "Checking for return value of snprintf()... Yes."
+    else
+      CFLAGS="$CFLAGS -DHAS_snprintf_void"
+      echo "Checking for return value of snprintf()... No."
+      echo "  WARNING: apparently snprintf() does not return a value. zlib"
+      echo "  can build but will be open to possible string-format security"
+      echo "  vulnerabilities."
+    fi
+  else
+    CFLAGS="$CFLAGS -DNO_snprintf"
+    echo "Checking for snprintf() in stdio.h... No."
+    echo "  WARNING: snprintf() not found, falling back to sprintf(). zlib"
+    echo "  can build but will be open to possible buffer-overflow security"
+    echo "  vulnerabilities."
+
+    cat >$test.c <<EOF
+#include <stdio.h>
+
+int mytest()
+{
+  char buf[20];
+
+  return sprintf(buf, "%s", "foo");
+}
+
+int main()
+{
+  return (mytest());
+}
+EOF
+
+    if test "`($CC -c $CFLAGS $test.c) 2>&1`" = ""; then
+      echo "Checking for return value of sprintf()... Yes."
+    else
+      CFLAGS="$CFLAGS -DHAS_sprintf_void"
+      echo "Checking for return value of sprintf()... No."
+      echo "  WARNING: apparently sprintf() does not return a value. zlib"
+      echo "  can build but will be open to possible string-format security"
+      echo "  vulnerabilities."
+    fi
+  fi
+fi
+
+cat >$test.c <<EOF
+#include <errno.h>
+int main() { return 0; }
+EOF
+if test "`($CC -c $CFLAGS $test.c) 2>&1`" = ""; then
+  echo "Checking for errno.h... Yes."
+else
+  echo "Checking for errno.h... No."
+  CFLAGS="$CFLAGS -DNO_ERRNO_H"
+fi
+
+cat > $test.c <<EOF
+#include <sys/types.h>
+#include <sys/mman.h>
+#include <sys/stat.h>
+caddr_t hello() {
+  return mmap((caddr_t)0, (off_t)0, PROT_READ, MAP_SHARED, 0, (off_t)0);
+}
+EOF
+if test "`($CC -c $CFLAGS $test.c) 2>&1`" = ""; then
+  CFLAGS="$CFLAGS -DUSE_MMAP"
+  echo Checking for mmap support... Yes.
+else
+  echo Checking for mmap support... No.
+fi
+
+CPP=${CPP-"$CC -E"}
+case $CFLAGS in
+  *ASMV*)
+    if test "`nm $test.o | grep _hello`" = ""; then
+      CPP="$CPP -DNO_UNDERLINE"
+      echo Checking for underline in external names... No.
+    else
+      echo Checking for underline in external names... Yes.
+    fi;;
+esac
+
+rm -f $test.[co] $test $test$shared_ext
+
+# udpate Makefile
+sed < Makefile.in "
+/^CC *=/s#=.*#=$CC#
+/^CFLAGS *=/s#=.*#=$CFLAGS#
+/^CPP *=/s#=.*#=$CPP#
+/^LDSHARED *=/s#=.*#=$LDSHARED#
+/^LIBS *=/s#=.*#=$LIBS#
+/^SHAREDLIB *=/s#=.*#=$SHAREDLIB#
+/^SHAREDLIBV *=/s#=.*#=$SHAREDLIBV#
+/^SHAREDLIBM *=/s#=.*#=$SHAREDLIBM#
+/^AR *=/s#=.*#=$AR#
+/^RANLIB *=/s#=.*#=$RANLIB#
+/^EXE *=/s#=.*#=$EXE#
+/^prefix *=/s#=.*#=$prefix#
+/^exec_prefix *=/s#=.*#=$exec_prefix#
+/^libdir *=/s#=.*#=$libdir#
+/^includedir *=/s#=.*#=$includedir#
+/^mandir *=/s#=.*#=$mandir#
+/^LDFLAGS *=/s#=.*#=$LDFLAGS#
+" > Makefile
diff --git a/updater/zlib123/contrib/README.contrib b/updater/zlib123/contrib/README.contrib
new file mode 100644
index 0000000..e5a6111
--- /dev/null
+++ b/updater/zlib123/contrib/README.contrib
@@ -0,0 +1,71 @@
+All files under this contrib directory are UNSUPPORTED. There were
+provided by users of zlib and were not tested by the authors of zlib.
+Use at your own risk. Please contact the authors of the contributions
+for help about these, not the zlib authors. Thanks.
+
+
+ada/        by Dmitriy Anisimkov <anisimkov@yahoo.com>
+        Support for Ada
+        See http://zlib-ada.sourceforge.net/
+
+asm586/
+asm686/     by Brian Raiter <breadbox@muppetlabs.com>
+        asm code for Pentium and PPro/PII, using the AT&T (GNU as) syntax
+        See http://www.muppetlabs.com/~breadbox/software/assembly.html
+
+blast/      by Mark Adler <madler@alumni.caltech.edu>
+        Decompressor for output of PKWare Data Compression Library (DCL)
+
+delphi/     by Cosmin Truta <cosmint@cs.ubbcluj.ro>
+        Support for Delphi and C++ Builder
+
+dotzlib/    by Henrik Ravn <henrik@ravn.com>
+        Support for Microsoft .Net and Visual C++ .Net
+
+infback9/   by Mark Adler <madler@alumni.caltech.edu>
+        Unsupported diffs to infback to decode the deflate64 format
+
+inflate86/  by Chris Anderson <christop@charm.net>
+        Tuned x86 gcc asm code to replace inflate_fast()
+
+iostream/   by Kevin Ruland <kevin@rodin.wustl.edu>
+        A C++ I/O streams interface to the zlib gz* functions
+
+iostream2/  by Tyge L�vset <Tyge.Lovset@cmr.no>
+        Another C++ I/O streams interface
+
+iostream3/  by Ludwig Schwardt <schwardt@sun.ac.za>
+            and Kevin Ruland <kevin@rodin.wustl.edu>
+        Yet another C++ I/O streams interface
+
+masm686/    by Dan Higdon <hdan@kinesoft.com>
+            and Chuck Walbourn <chuckw@kinesoft.com>
+        asm code for Pentium Pro/PII, using the MASM syntax
+
+masmx64/    by Gilles Vollant <info@winimage.com>
+	x86 64-bit (AMD64 and Intel EM64t) code for x64 assembler to
+	replace longest_match() and inflate_fast()
+
+masmx86/    by Gilles Vollant <info@winimage.com>
+        x86 asm code to replace longest_match() and inflate_fast(),
+        for Visual C++ and MASM
+
+minizip/    by Gilles Vollant <info@winimage.com>
+        Mini zip and unzip based on zlib
+        See http://www.winimage.com/zLibDll/unzip.html
+
+pascal/     by Bob Dellaca <bobdl@xtra.co.nz> et al.
+        Support for Pascal
+
+puff/       by Mark Adler <madler@alumni.caltech.edu>
+        Small, low memory usage inflate.  Also serves to provide an
+        unambiguous description of the deflate format.
+
+testzlib/   by Gilles Vollant <info@winimage.com>
+        Example of the use of zlib
+
+untgz/      by Pedro A. Aranda Gutierrez <paag@tid.es>
+        A very simple tar.gz file extractor using zlib
+
+vstudio/    by Gilles Vollant <info@winimage.com>
+        Building a minizip-enhanced zlib with Microsoft Visual Studio
diff --git a/updater/zlib123/contrib/ada/buffer_demo.adb b/updater/zlib123/contrib/ada/buffer_demo.adb
new file mode 100644
index 0000000..7f23710
--- /dev/null
+++ b/updater/zlib123/contrib/ada/buffer_demo.adb
@@ -0,0 +1,106 @@
+----------------------------------------------------------------
+--  ZLib for Ada thick binding.                               --
+--                                                            --
+--  Copyright (C) 2002-2004 Dmitriy Anisimkov                 --
+--                                                            --
+--  Open source license information is in the zlib.ads file.  --
+----------------------------------------------------------------
+--
+--  $Id: buffer_demo.adb,v 1.3 2004/09/06 06:55:35 vagul Exp $
+
+--  This demo program provided by Dr Steve Sangwine <sjs@essex.ac.uk>
+--
+--  Demonstration of a problem with Zlib-Ada (already fixed) when a buffer
+--  of exactly the correct size is used for decompressed data, and the last
+--  few bytes passed in to Zlib are checksum bytes.
+
+--  This program compresses a string of text, and then decompresses the
+--  compressed text into a buffer of the same size as the original text.
+
+with Ada.Streams; use Ada.Streams;
+with Ada.Text_IO;
+
+with ZLib; use ZLib;
+
+procedure Buffer_Demo is
+   EOL  : Character renames ASCII.LF;
+   Text : constant String
+     := "Four score and seven years ago our fathers brought forth," & EOL &
+        "upon this continent, a new nation, conceived in liberty," & EOL &
+        "and dedicated to the proposition that `all men are created equal'.";
+
+   Source : Stream_Element_Array (1 .. Text'Length);
+   for Source'Address use Text'Address;
+
+begin
+   Ada.Text_IO.Put (Text);
+   Ada.Text_IO.New_Line;
+   Ada.Text_IO.Put_Line
+     ("Uncompressed size : " & Positive'Image (Text'Length) & " bytes");
+
+   declare
+      Compressed_Data : Stream_Element_Array (1 .. Text'Length);
+      L               : Stream_Element_Offset;
+   begin
+      Compress : declare
+         Compressor : Filter_Type;
+         I : Stream_Element_Offset;
+      begin
+         Deflate_Init (Compressor);
+
+         --  Compress the whole of T at once.
+
+         Translate (Compressor, Source, I, Compressed_Data, L, Finish);
+         pragma Assert (I = Source'Last);
+
+         Close (Compressor);
+
+         Ada.Text_IO.Put_Line
+           ("Compressed size :   "
+            & Stream_Element_Offset'Image (L) & " bytes");
+      end Compress;
+
+      --  Now we decompress the data, passing short blocks of data to Zlib
+      --  (because this demonstrates the problem - the last block passed will
+      --  contain checksum information and there will be no output, only a
+      --  check inside Zlib that the checksum is correct).
+
+      Decompress : declare
+         Decompressor : Filter_Type;
+
+         Uncompressed_Data : Stream_Element_Array (1 .. Text'Length);
+
+         Block_Size : constant := 4;
+         --  This makes sure that the last block contains
+         --  only Adler checksum data.
+
+         P : Stream_Element_Offset := Compressed_Data'First - 1;
+         O : Stream_Element_Offset;
+      begin
+         Inflate_Init (Decompressor);
+
+         loop
+            Translate
+              (Decompressor,
+               Compressed_Data
+                 (P + 1 .. Stream_Element_Offset'Min (P + Block_Size, L)),
+               P,
+               Uncompressed_Data
+                 (Total_Out (Decompressor) + 1 .. Uncompressed_Data'Last),
+               O,
+               No_Flush);
+
+               Ada.Text_IO.Put_Line
+                 ("Total in : " & Count'Image (Total_In (Decompressor)) &
+                  ", out : " & Count'Image (Total_Out (Decompressor)));
+
+               exit when P = L;
+         end loop;
+
+         Ada.Text_IO.New_Line;
+         Ada.Text_IO.Put_Line
+           ("Decompressed text matches original text : "
+             & Boolean'Image (Uncompressed_Data = Source));
+      end Decompress;
+   end;
+end Buffer_Demo;
diff --git a/updater/zlib123/contrib/ada/mtest.adb b/updater/zlib123/contrib/ada/mtest.adb
new file mode 100644
index 0000000..a325196
--- /dev/null
+++ b/updater/zlib123/contrib/ada/mtest.adb
@@ -0,0 +1,156 @@
+----------------------------------------------------------------
+--  ZLib for Ada thick binding.                               --
+--                                                            --
+--  Copyright (C) 2002-2003 Dmitriy Anisimkov                 --
+--                                                            --
+--  Open source license information is in the zlib.ads file.  --
+----------------------------------------------------------------
+--  Continuous test for ZLib multithreading. If the test would fail
+--  we should provide thread safe allocation routines for the Z_Stream.
+--
+--  $Id: mtest.adb,v 1.4 2004/07/23 07:49:54 vagul Exp $
+
+with ZLib;
+with Ada.Streams;
+with Ada.Numerics.Discrete_Random;
+with Ada.Text_IO;
+with Ada.Exceptions;
+with Ada.Task_Identification;
+
+procedure MTest is
+   use Ada.Streams;
+   use ZLib;
+
+   Stop : Boolean := False;
+
+   pragma Atomic (Stop);
+
+   subtype Visible_Symbols is Stream_Element range 16#20# .. 16#7E#;
+
+   package Random_Elements is
+      new Ada.Numerics.Discrete_Random (Visible_Symbols);
+
+   task type Test_Task;
+
+   task body Test_Task is
+      Buffer : Stream_Element_Array (1 .. 100_000);
+      Gen : Random_Elements.Generator;
+
+      Buffer_First  : Stream_Element_Offset;
+      Compare_First : Stream_Element_Offset;
+
+      Deflate : Filter_Type;
+      Inflate : Filter_Type;
+
+      procedure Further (Item : in Stream_Element_Array);
+
+      procedure Read_Buffer
+        (Item : out Ada.Streams.Stream_Element_Array;
+         Last : out Ada.Streams.Stream_Element_Offset);
+
+      -------------
+      -- Further --
+      -------------
+
+      procedure Further (Item : in Stream_Element_Array) is
+
+         procedure Compare (Item : in Stream_Element_Array);
+
+         -------------
+         -- Compare --
+         -------------
+
+         procedure Compare (Item : in Stream_Element_Array) is
+            Next_First : Stream_Element_Offset := Compare_First + Item'Length;
+         begin
+            if Buffer (Compare_First .. Next_First - 1) /= Item then
+               raise Program_Error;
+            end if;
+
+            Compare_First := Next_First;
+         end Compare;
+
+         procedure Compare_Write is new ZLib.Write (Write => Compare);
+      begin
+         Compare_Write (Inflate, Item, No_Flush);
+      end Further;
+
+      -----------------
+      -- Read_Buffer --
+      -----------------
+
+      procedure Read_Buffer
+        (Item : out Ada.Streams.Stream_Element_Array;
+         Last : out Ada.Streams.Stream_Element_Offset)
+      is
+         Buff_Diff   : Stream_Element_Offset := Buffer'Last - Buffer_First;
+         Next_First : Stream_Element_Offset;
+      begin
+         if Item'Length <= Buff_Diff then
+            Last := Item'Last;
+
+            Next_First := Buffer_First + Item'Length;
+
+            Item := Buffer (Buffer_First .. Next_First - 1);
+
+            Buffer_First := Next_First;
+         else
+            Last := Item'First + Buff_Diff;
+            Item (Item'First .. Last) := Buffer (Buffer_First .. Buffer'Last);
+            Buffer_First := Buffer'Last + 1;
+         end if;
+      end Read_Buffer;
+
+      procedure Translate is new Generic_Translate
+                                   (Data_In  => Read_Buffer,
+                                    Data_Out => Further);
+
+   begin
+      Random_Elements.Reset (Gen);
+
+      Buffer := (others => 20);
+
+      Main : loop
+         for J in Buffer'Range loop
+            Buffer (J) := Random_Elements.Random (Gen);
+
+            Deflate_Init (Deflate);
+            Inflate_Init (Inflate);
+
+            Buffer_First  := Buffer'First;
+            Compare_First := Buffer'First;
+
+            Translate (Deflate);
+
+            if Compare_First /= Buffer'Last + 1 then
+               raise Program_Error;
+            end if;
+
+            Ada.Text_IO.Put_Line
+              (Ada.Task_Identification.Image
+                 (Ada.Task_Identification.Current_Task)
+               & Stream_Element_Offset'Image (J)
+               & ZLib.Count'Image (Total_Out (Deflate)));
+
+            Close (Deflate);
+            Close (Inflate);
+
+            exit Main when Stop;
+         end loop;
+      end loop Main;
+   exception
+      when E : others =>
+         Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Information (E));
+         Stop := True;
+   end Test_Task;
+
+   Test : array (1 .. 4) of Test_Task;
+
+   pragma Unreferenced (Test);
+
+   Dummy : Character;
+
+begin
+   Ada.Text_IO.Get_Immediate (Dummy);
+   Stop := True;
+end MTest;
diff --git a/updater/zlib123/contrib/ada/read.adb b/updater/zlib123/contrib/ada/read.adb
new file mode 100644
index 0000000..b78b047
--- /dev/null
+++ b/updater/zlib123/contrib/ada/read.adb
@@ -0,0 +1,156 @@
+----------------------------------------------------------------
+--  ZLib for Ada thick binding.                               --
+--                                                            --
+--  Copyright (C) 2002-2003 Dmitriy Anisimkov                 --
+--                                                            --
+--  Open source license information is in the zlib.ads file.  --
+----------------------------------------------------------------
+
+--  $Id: read.adb,v 1.8 2004/05/31 10:53:40 vagul Exp $
+
+--  Test/demo program for the generic read interface.
+
+with Ada.Numerics.Discrete_Random;
+with Ada.Streams;
+with Ada.Text_IO;
+
+with ZLib;
+
+procedure Read is
+
+   use Ada.Streams;
+
+   ------------------------------------
+   --  Test configuration parameters --
+   ------------------------------------
+
+   File_Size   : Stream_Element_Offset := 100_000;
+
+   Continuous  : constant Boolean          := False;
+   --  If this constant is True, the test would be repeated again and again,
+   --  with increment File_Size for every iteration.
+
+   Header      : constant ZLib.Header_Type := ZLib.Default;
+   --  Do not use Header other than Default in ZLib versions 1.1.4 and older.
+
+   Init_Random : constant := 8;
+   --  We are using the same random sequence, in case of we catch bug,
+   --  so we would be able to reproduce it.
+
+   -- End --
+
+   Pack_Size : Stream_Element_Offset;
+   Offset    : Stream_Element_Offset;
+
+   Filter     : ZLib.Filter_Type;
+
+   subtype Visible_Symbols
+      is Stream_Element range 16#20# .. 16#7E#;
+
+   package Random_Elements is new
+      Ada.Numerics.Discrete_Random (Visible_Symbols);
+
+   Gen : Random_Elements.Generator;
+   Period  : constant Stream_Element_Offset := 200;
+   --  Period constant variable for random generator not to be very random.
+   --  Bigger period, harder random.
+
+   Read_Buffer : Stream_Element_Array (1 .. 2048);
+   Read_First  : Stream_Element_Offset;
+   Read_Last   : Stream_Element_Offset;
+
+   procedure Reset;
+
+   procedure Read
+     (Item : out Stream_Element_Array;
+      Last : out Stream_Element_Offset);
+   --  this procedure is for generic instantiation of
+   --  ZLib.Read
+   --  reading data from the File_In.
+
+   procedure Read is new ZLib.Read
+                           (Read,
+                            Read_Buffer,
+                            Rest_First => Read_First,
+                            Rest_Last  => Read_Last);
+
+   ----------
+   -- Read --
+   ----------
+
+   procedure Read
+     (Item : out Stream_Element_Array;
+      Last : out Stream_Element_Offset) is
+   begin
+      Last := Stream_Element_Offset'Min
+               (Item'Last,
+                Item'First + File_Size - Offset);
+
+      for J in Item'First .. Last loop
+         if J < Item'First + Period then
+            Item (J) := Random_Elements.Random (Gen);
+         else
+            Item (J) := Item (J - Period);
+         end if;
+
+         Offset   := Offset + 1;
+      end loop;
+   end Read;
+
+   -----------
+   -- Reset --
+   -----------
+
+   procedure Reset is
+   begin
+      Random_Elements.Reset (Gen, Init_Random);
+      Pack_Size := 0;
+      Offset := 1;
+      Read_First := Read_Buffer'Last + 1;
+      Read_Last  := Read_Buffer'Last;
+   end Reset;
+
+begin
+   Ada.Text_IO.Put_Line ("ZLib " & ZLib.Version);
+
+   loop
+      for Level in ZLib.Compression_Level'Range loop
+
+         Ada.Text_IO.Put ("Level ="
+            & ZLib.Compression_Level'Image (Level));
+
+         --  Deflate using generic instantiation.
+
+         ZLib.Deflate_Init
+               (Filter,
+                Level,
+                Header => Header);
+
+         Reset;
+
+         Ada.Text_IO.Put
+           (Stream_Element_Offset'Image (File_Size) & " ->");
+
+         loop
+            declare
+               Buffer : Stream_Element_Array (1 .. 1024);
+               Last   : Stream_Element_Offset;
+            begin
+               Read (Filter, Buffer, Last);
+
+               Pack_Size := Pack_Size + Last - Buffer'First + 1;
+
+               exit when Last < Buffer'Last;
+            end;
+         end loop;
+
+         Ada.Text_IO.Put_Line (Stream_Element_Offset'Image (Pack_Size));
+
+         ZLib.Close (Filter);
+      end loop;
+
+      exit when not Continuous;
+
+      File_Size := File_Size + 1;
+   end loop;
+end Read;
diff --git a/updater/zlib123/contrib/ada/readme.txt b/updater/zlib123/contrib/ada/readme.txt
new file mode 100644
index 0000000..4cad6a6
--- /dev/null
+++ b/updater/zlib123/contrib/ada/readme.txt
@@ -0,0 +1,65 @@
+                        ZLib for Ada thick binding (ZLib.Ada)
+                        Release 1.3
+
+ZLib.Ada is a thick binding interface to the popular ZLib data
+compression library, available at http://www.gzip.org/zlib/.
+It provides Ada-style access to the ZLib C library.
+
+
+        Here are the main changes since ZLib.Ada 1.2:
+
+- Attension: ZLib.Read generic routine have a initialization requirement
+  for Read_Last parameter now. It is a bit incompartible with previous version,
+  but extends functionality, we could use new parameters Allow_Read_Some and
+  Flush now.
+
+- Added Is_Open routines to ZLib and ZLib.Streams packages.
+
+- Add pragma Assert to check Stream_Element is 8 bit.
+
+- Fix extraction to buffer with exact known decompressed size. Error reported by
+  Steve Sangwine.
+
+- Fix definition of ULong (changed to unsigned_long), fix regression on 64 bits
+  computers. Patch provided by Pascal Obry.
+
+- Add Status_Error exception definition.
+
+- Add pragma Assertion that Ada.Streams.Stream_Element size is 8 bit.
+
+
+        How to build ZLib.Ada under GNAT
+
+You should have the ZLib library already build on your computer, before
+building ZLib.Ada. Make the directory of ZLib.Ada sources current and
+issue the command:
+
+  gnatmake test -largs -L<directory where libz.a is> -lz
+
+Or use the GNAT project file build for GNAT 3.15 or later:
+
+  gnatmake -Pzlib.gpr -L<directory where libz.a is>
+
+
+        How to build ZLib.Ada under Aonix ObjectAda for Win32 7.2.2
+
+1. Make a project with all *.ads and *.adb files from the distribution.
+2. Build the libz.a library from the ZLib C sources.
+3. Rename libz.a to z.lib.
+4. Add the library z.lib to the project.
+5. Add the libc.lib library from the ObjectAda distribution to the project.
+6. Build the executable using test.adb as a main procedure.
+
+
+        How to use ZLib.Ada
+
+The source files test.adb and read.adb are small demo programs that show
+the main functionality of ZLib.Ada.
+
+The routines from the package specifications are commented.
+
+
+Homepage: http://zlib-ada.sourceforge.net/
+Author: Dmitriy Anisimkov <anisimkov@yahoo.com>
+
+Contributors: Pascal Obry <pascal@obry.org>, Steve Sangwine <sjs@essex.ac.uk>
diff --git a/updater/zlib123/contrib/ada/test.adb b/updater/zlib123/contrib/ada/test.adb
new file mode 100644
index 0000000..193f1f0
--- /dev/null
+++ b/updater/zlib123/contrib/ada/test.adb
@@ -0,0 +1,463 @@
+----------------------------------------------------------------
+--  ZLib for Ada thick binding.                               --
+--                                                            --
+--  Copyright (C) 2002-2003 Dmitriy Anisimkov                 --
+--                                                            --
+--  Open source license information is in the zlib.ads file.  --
+----------------------------------------------------------------
+
+--  $Id: test.adb,v 1.17 2003/08/12 12:13:30 vagul Exp $
+
+--  The program has a few aims.
+--  1. Test ZLib.Ada95 thick binding functionality.
+--  2. Show the example of use main functionality of the ZLib.Ada95 binding.
+--  3. Build this program automatically compile all ZLib.Ada95 packages under
+--     GNAT Ada95 compiler.
+
+with ZLib.Streams;
+with Ada.Streams.Stream_IO;
+with Ada.Numerics.Discrete_Random;
+
+with Ada.Text_IO;
+
+with Ada.Calendar;
+
+procedure Test is
+
+   use Ada.Streams;
+   use Stream_IO;
+
+   ------------------------------------
+   --  Test configuration parameters --
+   ------------------------------------
+
+   File_Size   : Count   := 100_000;
+   Continuous  : constant Boolean := False;
+
+   Header      : constant ZLib.Header_Type := ZLib.Default;
+                                              --  ZLib.None;
+                                              --  ZLib.Auto;
+                                              --  ZLib.GZip;
+   --  Do not use Header other then Default in ZLib versions 1.1.4
+   --  and older.
+
+   Strategy    : constant ZLib.Strategy_Type := ZLib.Default_Strategy;
+   Init_Random : constant := 10;
+
+   -- End --
+
+   In_File_Name  : constant String := "testzlib.in";
+   --  Name of the input file
+
+   Z_File_Name   : constant String := "testzlib.zlb";
+   --  Name of the compressed file.
+
+   Out_File_Name : constant String := "testzlib.out";
+   --  Name of the decompressed file.
+
+   File_In   : File_Type;
+   File_Out  : File_Type;
+   File_Back : File_Type;
+   File_Z    : ZLib.Streams.Stream_Type;
+
+   Filter : ZLib.Filter_Type;
+
+   Time_Stamp : Ada.Calendar.Time;
+
+   procedure Generate_File;
+   --  Generate file of spetsified size with some random data.
+   --  The random data is repeatable, for the good compression.
+
+   procedure Compare_Streams
+     (Left, Right : in out Root_Stream_Type'Class);
+   --  The procedure compearing data in 2 streams.
+   --  It is for compare data before and after compression/decompression.
+
+   procedure Compare_Files (Left, Right : String);
+   --  Compare files. Based on the Compare_Streams.
+
+   procedure Copy_Streams
+     (Source, Target : in out Root_Stream_Type'Class;
+      Buffer_Size    : in     Stream_Element_Offset := 1024);
+   --  Copying data from one stream to another. It is for test stream
+   --  interface of the library.
+
+   procedure Data_In
+     (Item : out Stream_Element_Array;
+      Last : out Stream_Element_Offset);
+   --  this procedure is for generic instantiation of
+   --  ZLib.Generic_Translate.
+   --  reading data from the File_In.
+
+   procedure Data_Out (Item : in Stream_Element_Array);
+   --  this procedure is for generic instantiation of
+   --  ZLib.Generic_Translate.
+   --  writing data to the File_Out.
+
+   procedure Stamp;
+   --  Store the timestamp to the local variable.
+
+   procedure Print_Statistic (Msg : String; Data_Size : ZLib.Count);
+   --  Print the time statistic with the message.
+
+   procedure Translate is new ZLib.Generic_Translate
+                                (Data_In  => Data_In,
+                                 Data_Out => Data_Out);
+   --  This procedure is moving data from File_In to File_Out
+   --  with compression or decompression, depend on initialization of
+   --  Filter parameter.
+
+   -------------------
+   -- Compare_Files --
+   -------------------
+
+   procedure Compare_Files (Left, Right : String) is
+      Left_File, Right_File : File_Type;
+   begin
+      Open (Left_File, In_File, Left);
+      Open (Right_File, In_File, Right);
+      Compare_Streams (Stream (Left_File).all, Stream (Right_File).all);
+      Close (Left_File);
+      Close (Right_File);
+   end Compare_Files;
+
+   ---------------------
+   -- Compare_Streams --
+   ---------------------
+
+   procedure Compare_Streams
+     (Left, Right : in out Ada.Streams.Root_Stream_Type'Class)
+   is
+      Left_Buffer, Right_Buffer : Stream_Element_Array (0 .. 16#FFF#);
+      Left_Last, Right_Last : Stream_Element_Offset;
+   begin
+      loop
+         Read (Left, Left_Buffer, Left_Last);
+         Read (Right, Right_Buffer, Right_Last);
+
+         if Left_Last /= Right_Last then
+            Ada.Text_IO.Put_Line ("Compare error :"
+              & Stream_Element_Offset'Image (Left_Last)
+              & " /= "
+              & Stream_Element_Offset'Image (Right_Last));
+
+            raise Constraint_Error;
+
+         elsif Left_Buffer (0 .. Left_Last)
+               /= Right_Buffer (0 .. Right_Last)
+         then
+            Ada.Text_IO.Put_Line ("ERROR: IN and OUT files is not equal.");
+            raise Constraint_Error;
+
+         end if;
+
+         exit when Left_Last < Left_Buffer'Last;
+      end loop;
+   end Compare_Streams;
+
+   ------------------
+   -- Copy_Streams --
+   ------------------
+
+   procedure Copy_Streams
+     (Source, Target : in out Ada.Streams.Root_Stream_Type'Class;
+      Buffer_Size    : in     Stream_Element_Offset := 1024)
+   is
+      Buffer : Stream_Element_Array (1 .. Buffer_Size);
+      Last   : Stream_Element_Offset;
+   begin
+      loop
+         Read  (Source, Buffer, Last);
+         Write (Target, Buffer (1 .. Last));
+
+         exit when Last < Buffer'Last;
+      end loop;
+   end Copy_Streams;
+
+   -------------
+   -- Data_In --
+   -------------
+
+   procedure Data_In
+     (Item : out Stream_Element_Array;
+      Last : out Stream_Element_Offset) is
+   begin
+      Read (File_In, Item, Last);
+   end Data_In;
+
+   --------------
+   -- Data_Out --
+   --------------
+
+   procedure Data_Out (Item : in Stream_Element_Array) is
+   begin
+      Write (File_Out, Item);
+   end Data_Out;
+
+   -------------------
+   -- Generate_File --
+   -------------------
+
+   procedure Generate_File is
+      subtype Visible_Symbols is Stream_Element range 16#20# .. 16#7E#;
+
+      package Random_Elements is
+         new Ada.Numerics.Discrete_Random (Visible_Symbols);
+
+      Gen    : Random_Elements.Generator;
+      Buffer : Stream_Element_Array := (1 .. 77 => 16#20#) & 10;
+
+      Buffer_Count : constant Count := File_Size / Buffer'Length;
+      --  Number of same buffers in the packet.
+
+      Density : constant Count := 30; --  from 0 to Buffer'Length - 2;
+
+      procedure Fill_Buffer (J, D : in Count);
+      --  Change the part of the buffer.
+
+      -----------------
+      -- Fill_Buffer --
+      -----------------
+
+      procedure Fill_Buffer (J, D : in Count) is
+      begin
+         for K in 0 .. D loop
+            Buffer
+              (Stream_Element_Offset ((J + K) mod (Buffer'Length - 1) + 1))
+             := Random_Elements.Random (Gen);
+
+         end loop;
+      end Fill_Buffer;
+
+   begin
+      Random_Elements.Reset (Gen, Init_Random);
+
+      Create (File_In, Out_File, In_File_Name);
+
+      Fill_Buffer (1, Buffer'Length - 2);
+
+      for J in 1 .. Buffer_Count loop
+         Write (File_In, Buffer);
+
+         Fill_Buffer (J, Density);
+      end loop;
+
+      --  fill remain size.
+
+      Write
+        (File_In,
+         Buffer
+           (1 .. Stream_Element_Offset
+                   (File_Size - Buffer'Length * Buffer_Count)));
+
+      Flush (File_In);
+      Close (File_In);
+   end Generate_File;
+
+   ---------------------
+   -- Print_Statistic --
+   ---------------------
+
+   procedure Print_Statistic (Msg : String; Data_Size : ZLib.Count) is
+      use Ada.Calendar;
+      use Ada.Text_IO;
+
+      package Count_IO is new Integer_IO (ZLib.Count);
+
+      Curr_Dur : Duration := Clock - Time_Stamp;
+   begin
+      Put (Msg);
+
+      Set_Col (20);
+      Ada.Text_IO.Put ("size =");
+
+      Count_IO.Put
+        (Data_Size,
+         Width => Stream_IO.Count'Image (File_Size)'Length);
+
+      Put_Line (" duration =" & Duration'Image (Curr_Dur));
+   end Print_Statistic;
+
+   -----------
+   -- Stamp --
+   -----------
+
+   procedure Stamp is
+   begin
+      Time_Stamp := Ada.Calendar.Clock;
+   end Stamp;
+
+begin
+   Ada.Text_IO.Put_Line ("ZLib " & ZLib.Version);
+
+   loop
+      Generate_File;
+
+      for Level in ZLib.Compression_Level'Range loop
+
+         Ada.Text_IO.Put_Line ("Level ="
+            & ZLib.Compression_Level'Image (Level));
+
+         --  Test generic interface.
+         Open   (File_In, In_File, In_File_Name);
+         Create (File_Out, Out_File, Z_File_Name);
+
+         Stamp;
+
+         --  Deflate using generic instantiation.
+
+         ZLib.Deflate_Init
+               (Filter   => Filter,
+                Level    => Level,
+                Strategy => Strategy,
+                Header   => Header);
+
+         Translate (Filter);
+         Print_Statistic ("Generic compress", ZLib.Total_Out (Filter));
+         ZLib.Close (Filter);
+
+         Close (File_In);
+         Close (File_Out);
+
+         Open   (File_In, In_File, Z_File_Name);
+         Create (File_Out, Out_File, Out_File_Name);
+
+         Stamp;
+
+         --  Inflate using generic instantiation.
+
+         ZLib.Inflate_Init (Filter, Header => Header);
+
+         Translate (Filter);
+         Print_Statistic ("Generic decompress", ZLib.Total_Out (Filter));
+
+         ZLib.Close (Filter);
+
+         Close (File_In);
+         Close (File_Out);
+
+         Compare_Files (In_File_Name, Out_File_Name);
+
+         --  Test stream interface.
+
+         --  Compress to the back stream.
+
+         Open   (File_In, In_File, In_File_Name);
+         Create (File_Back, Out_File, Z_File_Name);
+
+         Stamp;
+
+         ZLib.Streams.Create
+           (Stream          => File_Z,
+            Mode            => ZLib.Streams.Out_Stream,
+            Back            => ZLib.Streams.Stream_Access
+                                 (Stream (File_Back)),
+            Back_Compressed => True,
+            Level           => Level,
+            Strategy        => Strategy,
+            Header          => Header);
+
+         Copy_Streams
+           (Source => Stream (File_In).all,
+            Target => File_Z);
+
+         --  Flushing internal buffers to the back stream.
+
+         ZLib.Streams.Flush (File_Z, ZLib.Finish);
+
+         Print_Statistic ("Write compress",
+                          ZLib.Streams.Write_Total_Out (File_Z));
+
+         ZLib.Streams.Close (File_Z);
+
+         Close (File_In);
+         Close (File_Back);
+
+         --  Compare reading from original file and from
+         --  decompression stream.
+
+         Open (File_In,   In_File, In_File_Name);
+         Open (File_Back, In_File, Z_File_Name);
+
+         ZLib.Streams.Create
+           (Stream          => File_Z,
+            Mode            => ZLib.Streams.In_Stream,
+            Back            => ZLib.Streams.Stream_Access
+                                 (Stream (File_Back)),
+            Back_Compressed => True,
+            Header          => Header);
+
+         Stamp;
+         Compare_Streams (Stream (File_In).all, File_Z);
+
+         Print_Statistic ("Read decompress",
+                          ZLib.Streams.Read_Total_Out (File_Z));
+
+         ZLib.Streams.Close (File_Z);
+         Close (File_In);
+         Close (File_Back);
+
+         --  Compress by reading from compression stream.
+
+         Open (File_Back, In_File, In_File_Name);
+         Create (File_Out, Out_File, Z_File_Name);
+
+         ZLib.Streams.Create
+           (Stream          => File_Z,
+            Mode            => ZLib.Streams.In_Stream,
+            Back            => ZLib.Streams.Stream_Access
+                                 (Stream (File_Back)),
+            Back_Compressed => False,
+            Level           => Level,
+            Strategy        => Strategy,
+            Header          => Header);
+
+         Stamp;
+         Copy_Streams
+           (Source => File_Z,
+            Target => Stream (File_Out).all);
+
+         Print_Statistic ("Read compress",
+                          ZLib.Streams.Read_Total_Out (File_Z));
+
+         ZLib.Streams.Close (File_Z);
+
+         Close (File_Out);
+         Close (File_Back);
+
+         --  Decompress to decompression stream.
+
+         Open   (File_In,   In_File, Z_File_Name);
+         Create (File_Back, Out_File, Out_File_Name);
+
+         ZLib.Streams.Create
+           (Stream          => File_Z,
+            Mode            => ZLib.Streams.Out_Stream,
+            Back            => ZLib.Streams.Stream_Access
+                                 (Stream (File_Back)),
+            Back_Compressed => False,
+            Header          => Header);
+
+         Stamp;
+
+         Copy_Streams
+           (Source => Stream (File_In).all,
+            Target => File_Z);
+
+         Print_Statistic ("Write decompress",
+                          ZLib.Streams.Write_Total_Out (File_Z));
+
+         ZLib.Streams.Close (File_Z);
+         Close (File_In);
+         Close (File_Back);
+
+         Compare_Files (In_File_Name, Out_File_Name);
+      end loop;
+
+      Ada.Text_IO.Put_Line (Count'Image (File_Size) & " Ok.");
+
+      exit when not Continuous;
+
+      File_Size := File_Size + 1;
+   end loop;
+end Test;
diff --git a/updater/zlib123/contrib/ada/zlib-streams.adb b/updater/zlib123/contrib/ada/zlib-streams.adb
new file mode 100644
index 0000000..f53b529
--- /dev/null
+++ b/updater/zlib123/contrib/ada/zlib-streams.adb
@@ -0,0 +1,225 @@
+----------------------------------------------------------------
+--  ZLib for Ada thick binding.                               --
+--                                                            --
+--  Copyright (C) 2002-2003 Dmitriy Anisimkov                 --
+--                                                            --
+--  Open source license information is in the zlib.ads file.  --
+----------------------------------------------------------------
+
+--  $Id: zlib-streams.adb,v 1.10 2004/05/31 10:53:40 vagul Exp $
+
+with Ada.Unchecked_Deallocation;
+
+package body ZLib.Streams is
+
+   -----------
+   -- Close --
+   -----------
+
+   procedure Close (Stream : in out Stream_Type) is
+      procedure Free is new Ada.Unchecked_Deallocation
+         (Stream_Element_Array, Buffer_Access);
+   begin
+      if Stream.Mode = Out_Stream or Stream.Mode = Duplex then
+         --  We should flush the data written by the writer.
+
+         Flush (Stream, Finish);
+
+         Close (Stream.Writer);
+      end if;
+
+      if Stream.Mode = In_Stream or Stream.Mode = Duplex then
+         Close (Stream.Reader);
+         Free (Stream.Buffer);
+      end if;
+   end Close;
+
+   ------------
+   -- Create --
+   ------------
+
+   procedure Create
+     (Stream            :    out Stream_Type;
+      Mode              : in     Stream_Mode;
+      Back              : in     Stream_Access;
+      Back_Compressed   : in     Boolean;
+      Level             : in     Compression_Level := Default_Compression;
+      Strategy          : in     Strategy_Type     := Default_Strategy;
+      Header            : in     Header_Type       := Default;
+      Read_Buffer_Size  : in     Ada.Streams.Stream_Element_Offset
+                                    := Default_Buffer_Size;
+      Write_Buffer_Size : in     Ada.Streams.Stream_Element_Offset
+                                    := Default_Buffer_Size)
+   is
+
+      subtype Buffer_Subtype is Stream_Element_Array (1 .. Read_Buffer_Size);
+
+      procedure Init_Filter
+         (Filter   : in out Filter_Type;
+          Compress : in     Boolean);
+
+      -----------------
+      -- Init_Filter --
+      -----------------
+
+      procedure Init_Filter
+         (Filter   : in out Filter_Type;
+          Compress : in     Boolean) is
+      begin
+         if Compress then
+            Deflate_Init
+              (Filter, Level, Strategy, Header => Header);
+         else
+            Inflate_Init (Filter, Header => Header);
+         end if;
+      end Init_Filter;
+
+   begin
+      Stream.Back := Back;
+      Stream.Mode := Mode;
+
+      if Mode = Out_Stream or Mode = Duplex then
+         Init_Filter (Stream.Writer, Back_Compressed);
+         Stream.Buffer_Size := Write_Buffer_Size;
+      else
+         Stream.Buffer_Size := 0;
+      end if;
+
+      if Mode = In_Stream or Mode = Duplex then
+         Init_Filter (Stream.Reader, not Back_Compressed);
+
+         Stream.Buffer     := new Buffer_Subtype;
+         Stream.Rest_First := Stream.Buffer'Last + 1;
+         Stream.Rest_Last  := Stream.Buffer'Last;
+      end if;
+   end Create;
+
+   -----------
+   -- Flush --
+   -----------
+
+   procedure Flush
+     (Stream : in out Stream_Type;
+      Mode   : in     Flush_Mode := Sync_Flush)
+   is
+      Buffer : Stream_Element_Array (1 .. Stream.Buffer_Size);
+      Last   : Stream_Element_Offset;
+   begin
+      loop
+         Flush (Stream.Writer, Buffer, Last, Mode);
+
+         Ada.Streams.Write (Stream.Back.all, Buffer (1 .. Last));
+
+         exit when Last < Buffer'Last;
+      end loop;
+   end Flush;
+
+   -------------
+   -- Is_Open --
+   -------------
+
+   function Is_Open (Stream : Stream_Type) return Boolean is
+   begin
+      return Is_Open (Stream.Reader) or else Is_Open (Stream.Writer);
+   end Is_Open;
+
+   ----------
+   -- Read --
+   ----------
+
+   procedure Read
+     (Stream : in out Stream_Type;
+      Item   :    out Stream_Element_Array;
+      Last   :    out Stream_Element_Offset)
+   is
+
+      procedure Read
+        (Item : out Stream_Element_Array;
+         Last : out Stream_Element_Offset);
+
+      ----------
+      -- Read --
+      ----------
+
+      procedure Read
+        (Item : out Stream_Element_Array;
+         Last : out Stream_Element_Offset) is
+      begin
+         Ada.Streams.Read (Stream.Back.all, Item, Last);
+      end Read;
+
+      procedure Read is new ZLib.Read
+         (Read       => Read,
+          Buffer     => Stream.Buffer.all,
+          Rest_First => Stream.Rest_First,
+          Rest_Last  => Stream.Rest_Last);
+
+   begin
+      Read (Stream.Reader, Item, Last);
+   end Read;
+
+   -------------------
+   -- Read_Total_In --
+   -------------------
+
+   function Read_Total_In (Stream : in Stream_Type) return Count is
+   begin
+      return Total_In (Stream.Reader);
+   end Read_Total_In;
+
+   --------------------
+   -- Read_Total_Out --
+   --------------------
+
+   function Read_Total_Out (Stream : in Stream_Type) return Count is
+   begin
+      return Total_Out (Stream.Reader);
+   end Read_Total_Out;
+
+   -----------
+   -- Write --
+   -----------
+
+   procedure Write
+     (Stream : in out Stream_Type;
+      Item   : in     Stream_Element_Array)
+   is
+
+      procedure Write (Item : in Stream_Element_Array);
+
+      -----------
+      -- Write --
+      -----------
+
+      procedure Write (Item : in Stream_Element_Array) is
+      begin
+         Ada.Streams.Write (Stream.Back.all, Item);
+      end Write;
+
+      procedure Write is new ZLib.Write
+         (Write       => Write,
+          Buffer_Size => Stream.Buffer_Size);
+
+   begin
+      Write (Stream.Writer, Item, No_Flush);
+   end Write;
+
+   --------------------
+   -- Write_Total_In --
+   --------------------
+
+   function Write_Total_In (Stream : in Stream_Type) return Count is
+   begin
+      return Total_In (Stream.Writer);
+   end Write_Total_In;
+
+   ---------------------
+   -- Write_Total_Out --
+   ---------------------
+
+   function Write_Total_Out (Stream : in Stream_Type) return Count is
+   begin
+      return Total_Out (Stream.Writer);
+   end Write_Total_Out;
+
+end ZLib.Streams;
diff --git a/updater/zlib123/contrib/ada/zlib-streams.ads b/updater/zlib123/contrib/ada/zlib-streams.ads
new file mode 100644
index 0000000..f306df1
--- /dev/null
+++ b/updater/zlib123/contrib/ada/zlib-streams.ads
@@ -0,0 +1,114 @@
+----------------------------------------------------------------
+--  ZLib for Ada thick binding.                               --
+--                                                            --
+--  Copyright (C) 2002-2003 Dmitriy Anisimkov                 --
+--                                                            --
+--  Open source license information is in the zlib.ads file.  --
+----------------------------------------------------------------
+
+--  $Id: zlib-streams.ads,v 1.12 2004/05/31 10:53:40 vagul Exp $
+
+package ZLib.Streams is
+
+   type Stream_Mode is (In_Stream, Out_Stream, Duplex);
+
+   type Stream_Access is access all Ada.Streams.Root_Stream_Type'Class;
+
+   type Stream_Type is
+      new Ada.Streams.Root_Stream_Type with private;
+
+   procedure Read
+     (Stream : in out Stream_Type;
+      Item   :    out Ada.Streams.Stream_Element_Array;
+      Last   :    out Ada.Streams.Stream_Element_Offset);
+
+   procedure Write
+     (Stream : in out Stream_Type;
+      Item   : in     Ada.Streams.Stream_Element_Array);
+
+   procedure Flush
+     (Stream : in out Stream_Type;
+      Mode   : in     Flush_Mode := Sync_Flush);
+   --  Flush the written data to the back stream,
+   --  all data placed to the compressor is flushing to the Back stream.
+   --  Should not be used untill necessary, becouse it is decreasing
+   --  compression.
+
+   function Read_Total_In (Stream : in Stream_Type) return Count;
+   pragma Inline (Read_Total_In);
+   --  Return total number of bytes read from back stream so far.
+
+   function Read_Total_Out (Stream : in Stream_Type) return Count;
+   pragma Inline (Read_Total_Out);
+   --  Return total number of bytes read so far.
+
+   function Write_Total_In (Stream : in Stream_Type) return Count;
+   pragma Inline (Write_Total_In);
+   --  Return total number of bytes written so far.
+
+   function Write_Total_Out (Stream : in Stream_Type) return Count;
+   pragma Inline (Write_Total_Out);
+   --  Return total number of bytes written to the back stream.
+
+   procedure Create
+     (Stream            :    out Stream_Type;
+      Mode              : in     Stream_Mode;
+      Back              : in     Stream_Access;
+      Back_Compressed   : in     Boolean;
+      Level             : in     Compression_Level := Default_Compression;
+      Strategy          : in     Strategy_Type     := Default_Strategy;
+      Header            : in     Header_Type       := Default;
+      Read_Buffer_Size  : in     Ada.Streams.Stream_Element_Offset
+                                    := Default_Buffer_Size;
+      Write_Buffer_Size : in     Ada.Streams.Stream_Element_Offset
+                                    := Default_Buffer_Size);
+   --  Create the Comression/Decompression stream.
+   --  If mode is In_Stream then Write operation is disabled.
+   --  If mode is Out_Stream then Read operation is disabled.
+
+   --  If Back_Compressed is true then
+   --  Data written to the Stream is compressing to the Back stream
+   --  and data read from the Stream is decompressed data from the Back stream.
+
+   --  If Back_Compressed is false then
+   --  Data written to the Stream is decompressing to the Back stream
+   --  and data read from the Stream is compressed data from the Back stream.
+
+   --  !!! When the Need_Header is False ZLib-Ada is using undocumented
+   --  ZLib 1.1.4 functionality to do not create/wait for ZLib headers.
+
+   function Is_Open (Stream : Stream_Type) return Boolean;
+
+   procedure Close (Stream : in out Stream_Type);
+
+private
+
+   use Ada.Streams;
+
+   type Buffer_Access is access all Stream_Element_Array;
+
+   type Stream_Type
+     is new Root_Stream_Type with
+   record
+      Mode       : Stream_Mode;
+
+      Buffer     : Buffer_Access;
+      Rest_First : Stream_Element_Offset;
+      Rest_Last  : Stream_Element_Offset;
+      --  Buffer for Read operation.
+      --  We need to have this buffer in the record
+      --  becouse not all read data from back stream
+      --  could be processed during the read operation.
+
+      Buffer_Size : Stream_Element_Offset;
+      --  Buffer size for write operation.
+      --  We do not need to have this buffer
+      --  in the record becouse all data could be
+      --  processed in the write operation.
+
+      Back       : Stream_Access;
+      Reader     : Filter_Type;
+      Writer     : Filter_Type;
+   end record;
+
+end ZLib.Streams;
diff --git a/updater/zlib123/contrib/ada/zlib-thin.adb b/updater/zlib123/contrib/ada/zlib-thin.adb
new file mode 100644
index 0000000..dd18be5
--- /dev/null
+++ b/updater/zlib123/contrib/ada/zlib-thin.adb
@@ -0,0 +1,141 @@
+----------------------------------------------------------------
+--  ZLib for Ada thick binding.                               --
+--                                                            --
+--  Copyright (C) 2002-2003 Dmitriy Anisimkov                 --
+--                                                            --
+--  Open source license information is in the zlib.ads file.  --
+----------------------------------------------------------------
+
+--  $Id: zlib-thin.adb,v 1.8 2003/12/14 18:27:31 vagul Exp $
+
+package body ZLib.Thin is
+
+   ZLIB_VERSION  : constant Chars_Ptr := zlibVersion;
+
+   Z_Stream_Size : constant Int := Z_Stream'Size / System.Storage_Unit;
+
+   --------------
+   -- Avail_In --
+   --------------
+
+   function Avail_In (Strm : in Z_Stream) return UInt is
+   begin
+      return Strm.Avail_In;
+   end Avail_In;
+
+   ---------------
+   -- Avail_Out --
+   ---------------
+
+   function Avail_Out (Strm : in Z_Stream) return UInt is
+   begin
+      return Strm.Avail_Out;
+   end Avail_Out;
+
+   ------------------
+   -- Deflate_Init --
+   ------------------
+
+   function Deflate_Init
+     (strm       : Z_Streamp;
+      level      : Int;
+      method     : Int;
+      windowBits : Int;
+      memLevel   : Int;
+      strategy   : Int)
+      return       Int is
+   begin
+      return deflateInit2
+               (strm,
+                level,
+                method,
+                windowBits,
+                memLevel,
+                strategy,
+                ZLIB_VERSION,
+                Z_Stream_Size);
+   end Deflate_Init;
+
+   ------------------
+   -- Inflate_Init --
+   ------------------
+
+   function Inflate_Init (strm : Z_Streamp; windowBits : Int) return Int is
+   begin
+      return inflateInit2 (strm, windowBits, ZLIB_VERSION, Z_Stream_Size);
+   end Inflate_Init;
+
+   ------------------------
+   -- Last_Error_Message --
+   ------------------------
+
+   function Last_Error_Message (Strm : in Z_Stream) return String is
+      use Interfaces.C.Strings;
+   begin
+      if Strm.msg = Null_Ptr then
+         return "";
+      else
+         return Value (Strm.msg);
+      end if;
+   end Last_Error_Message;
+
+   ------------
+   -- Set_In --
+   ------------
+
+   procedure Set_In
+     (Strm   : in out Z_Stream;
+      Buffer : in     Voidp;
+      Size   : in     UInt) is
+   begin
+      Strm.Next_In  := Buffer;
+      Strm.Avail_In := Size;
+   end Set_In;
+
+   ------------------
+   -- Set_Mem_Func --
+   ------------------
+
+   procedure Set_Mem_Func
+     (Strm   : in out Z_Stream;
+      Opaque : in     Voidp;
+      Alloc  : in     alloc_func;
+      Free   : in     free_func) is
+   begin
+      Strm.opaque := Opaque;
+      Strm.zalloc := Alloc;
+      Strm.zfree  := Free;
+   end Set_Mem_Func;
+
+   -------------
+   -- Set_Out --
+   -------------
+
+   procedure Set_Out
+     (Strm   : in out Z_Stream;
+      Buffer : in     Voidp;
+      Size   : in     UInt) is
+   begin
+      Strm.Next_Out  := Buffer;
+      Strm.Avail_Out := Size;
+   end Set_Out;
+
+   --------------
+   -- Total_In --
+   --------------
+
+   function Total_In (Strm : in Z_Stream) return ULong is
+   begin
+      return Strm.Total_In;
+   end Total_In;
+
+   ---------------
+   -- Total_Out --
+   ---------------
+
+   function Total_Out (Strm : in Z_Stream) return ULong is
+   begin
+      return Strm.Total_Out;
+   end Total_Out;
+
+end ZLib.Thin;
diff --git a/updater/zlib123/contrib/ada/zlib-thin.ads b/updater/zlib123/contrib/ada/zlib-thin.ads
new file mode 100644
index 0000000..4215b4b
--- /dev/null
+++ b/updater/zlib123/contrib/ada/zlib-thin.ads
@@ -0,0 +1,450 @@
+----------------------------------------------------------------
+--  ZLib for Ada thick binding.                               --
+--                                                            --
+--  Copyright (C) 2002-2003 Dmitriy Anisimkov                 --
+--                                                            --
+--  Open source license information is in the zlib.ads file.  --
+----------------------------------------------------------------
+
+--  $Id: zlib-thin.ads,v 1.11 2004/07/23 06:33:11 vagul Exp $
+
+with Interfaces.C.Strings;
+
+with System;
+
+private package ZLib.Thin is
+
+   --  From zconf.h
+
+   MAX_MEM_LEVEL : constant := 9;         --  zconf.h:105
+                                          --  zconf.h:105
+   MAX_WBITS : constant := 15;      --  zconf.h:115
+                                    --  32K LZ77 window
+                                    --  zconf.h:115
+   SEEK_SET : constant := 8#0000#;  --  zconf.h:244
+                                    --  Seek from beginning of file.
+                                    --  zconf.h:244
+   SEEK_CUR : constant := 1;        --  zconf.h:245
+                                    --  Seek from current position.
+                                    --  zconf.h:245
+   SEEK_END : constant := 2;        --  zconf.h:246
+                                    --  Set file pointer to EOF plus "offset"
+                                    --  zconf.h:246
+
+   type Byte is new Interfaces.C.unsigned_char; --  8 bits
+                                                --  zconf.h:214
+   type UInt is new Interfaces.C.unsigned;      --  16 bits or more
+                                                --  zconf.h:216
+   type Int is new Interfaces.C.int;
+
+   type ULong is new Interfaces.C.unsigned_long;     --  32 bits or more
+                                                     --  zconf.h:217
+   subtype Chars_Ptr is Interfaces.C.Strings.chars_ptr;
+
+   type ULong_Access is access ULong;
+   type Int_Access is access Int;
+
+   subtype Voidp is System.Address;            --  zconf.h:232
+
+   subtype Byte_Access is Voidp;
+
+   Nul : constant Voidp := System.Null_Address;
+   --  end from zconf
+
+   Z_NO_FLUSH : constant := 8#0000#;   --  zlib.h:125
+                                       --  zlib.h:125
+   Z_PARTIAL_FLUSH : constant := 1;       --  zlib.h:126
+                                          --  will be removed, use
+                                          --  Z_SYNC_FLUSH instead
+                                          --  zlib.h:126
+   Z_SYNC_FLUSH : constant := 2;       --  zlib.h:127
+                                       --  zlib.h:127
+   Z_FULL_FLUSH : constant := 3;       --  zlib.h:128
+                                       --  zlib.h:128
+   Z_FINISH : constant := 4;        --  zlib.h:129
+                                    --  zlib.h:129
+   Z_OK : constant := 8#0000#;   --  zlib.h:132
+                                 --  zlib.h:132
+   Z_STREAM_END : constant := 1;       --  zlib.h:133
+                                       --  zlib.h:133
+   Z_NEED_DICT : constant := 2;        --  zlib.h:134
+                                       --  zlib.h:134
+   Z_ERRNO : constant := -1;        --  zlib.h:135
+                                    --  zlib.h:135
+   Z_STREAM_ERROR : constant := -2;       --  zlib.h:136
+                                          --  zlib.h:136
+   Z_DATA_ERROR : constant := -3;      --  zlib.h:137
+                                       --  zlib.h:137
+   Z_MEM_ERROR : constant := -4;       --  zlib.h:138
+                                       --  zlib.h:138
+   Z_BUF_ERROR : constant := -5;       --  zlib.h:139
+                                       --  zlib.h:139
+   Z_VERSION_ERROR : constant := -6;      --  zlib.h:140
+                                          --  zlib.h:140
+   Z_NO_COMPRESSION : constant := 8#0000#;   --  zlib.h:145
+                                             --  zlib.h:145
+   Z_BEST_SPEED : constant := 1;       --  zlib.h:146
+                                       --  zlib.h:146
+   Z_BEST_COMPRESSION : constant := 9;       --  zlib.h:147
+                                             --  zlib.h:147
+   Z_DEFAULT_COMPRESSION : constant := -1;      --  zlib.h:148
+                                                --  zlib.h:148
+   Z_FILTERED : constant := 1;      --  zlib.h:151
+                                    --  zlib.h:151
+   Z_HUFFMAN_ONLY : constant := 2;        --  zlib.h:152
+                                          --  zlib.h:152
+   Z_DEFAULT_STRATEGY : constant := 8#0000#; --  zlib.h:153
+                                             --  zlib.h:153
+   Z_BINARY : constant := 8#0000#;  --  zlib.h:156
+                                    --  zlib.h:156
+   Z_ASCII : constant := 1;      --  zlib.h:157
+                                 --  zlib.h:157
+   Z_UNKNOWN : constant := 2;       --  zlib.h:158
+                                    --  zlib.h:158
+   Z_DEFLATED : constant := 8;      --  zlib.h:161
+                                    --  zlib.h:161
+   Z_NULL : constant := 8#0000#; --  zlib.h:164
+                                 --  for initializing zalloc, zfree, opaque
+                                 --  zlib.h:164
+   type gzFile is new Voidp;                  --  zlib.h:646
+
+   type Z_Stream is private;
+
+   type Z_Streamp is access all Z_Stream;     --  zlib.h:89
+
+   type alloc_func is access function
+     (Opaque : Voidp;
+      Items  : UInt;
+      Size   : UInt)
+      return Voidp; --  zlib.h:63
+
+   type free_func is access procedure (opaque : Voidp; address : Voidp);
+
+   function zlibVersion return Chars_Ptr;
+
+   function Deflate (strm : Z_Streamp; flush : Int) return Int;
+
+   function DeflateEnd (strm : Z_Streamp) return Int;
+
+   function Inflate (strm : Z_Streamp; flush : Int) return Int;
+
+   function InflateEnd (strm : Z_Streamp) return Int;
+
+   function deflateSetDictionary
+     (strm       : Z_Streamp;
+      dictionary : Byte_Access;
+      dictLength : UInt)
+      return       Int;
+
+   function deflateCopy (dest : Z_Streamp; source : Z_Streamp) return Int;
+   --  zlib.h:478
+
+   function deflateReset (strm : Z_Streamp) return Int; -- zlib.h:495
+
+   function deflateParams
+     (strm     : Z_Streamp;
+      level    : Int;
+      strategy : Int)
+      return     Int;       -- zlib.h:506
+
+   function inflateSetDictionary
+     (strm       : Z_Streamp;
+      dictionary : Byte_Access;
+      dictLength : UInt)
+      return       Int; --  zlib.h:548
+
+   function inflateSync (strm : Z_Streamp) return Int;  --  zlib.h:565
+
+   function inflateReset (strm : Z_Streamp) return Int; --  zlib.h:580
+
+   function compress
+     (dest      : Byte_Access;
+      destLen   : ULong_Access;
+      source    : Byte_Access;
+      sourceLen : ULong)
+      return      Int;           -- zlib.h:601
+
+   function compress2
+     (dest      : Byte_Access;
+      destLen   : ULong_Access;
+      source    : Byte_Access;
+      sourceLen : ULong;
+      level     : Int)
+      return      Int;          -- zlib.h:615
+
+   function uncompress
+     (dest      : Byte_Access;
+      destLen   : ULong_Access;
+      source    : Byte_Access;
+      sourceLen : ULong)
+      return      Int;
+
+   function gzopen (path : Chars_Ptr; mode : Chars_Ptr) return gzFile;
+
+   function gzdopen (fd : Int; mode : Chars_Ptr) return gzFile;
+
+   function gzsetparams
+     (file     : gzFile;
+      level    : Int;
+      strategy : Int)
+      return     Int;
+
+   function gzread
+     (file : gzFile;
+      buf  : Voidp;
+      len  : UInt)
+      return Int;
+
+   function gzwrite
+     (file : in gzFile;
+      buf  : in Voidp;
+      len  : in UInt)
+      return Int;
+
+   function gzprintf (file : in gzFile; format : in Chars_Ptr) return Int;
+
+   function gzputs (file : in gzFile; s : in Chars_Ptr) return Int;
+
+   function gzgets
+     (file : gzFile;
+      buf  : Chars_Ptr;
+      len  : Int)
+      return Chars_Ptr;
+
+   function gzputc (file : gzFile; char : Int) return Int;
+
+   function gzgetc (file : gzFile) return Int;
+
+   function gzflush (file : gzFile; flush : Int) return Int;
+
+   function gzseek
+     (file   : gzFile;
+      offset : Int;
+      whence : Int)
+      return   Int;
+
+   function gzrewind (file : gzFile) return Int;
+
+   function gztell (file : gzFile) return Int;
+
+   function gzeof (file : gzFile) return Int;
+
+   function gzclose (file : gzFile) return Int;
+
+   function gzerror (file : gzFile; errnum : Int_Access) return Chars_Ptr;
+
+   function adler32
+     (adler : ULong;
+      buf   : Byte_Access;
+      len   : UInt)
+      return  ULong;
+
+   function crc32
+     (crc  : ULong;
+      buf  : Byte_Access;
+      len  : UInt)
+      return ULong;
+
+   function deflateInit
+     (strm        : Z_Streamp;
+      level       : Int;
+      version     : Chars_Ptr;
+      stream_size : Int)
+      return        Int;
+
+   function deflateInit2
+     (strm        : Z_Streamp;
+      level       : Int;
+      method      : Int;
+      windowBits  : Int;
+      memLevel    : Int;
+      strategy    : Int;
+      version     : Chars_Ptr;
+      stream_size : Int)
+      return        Int;
+
+   function Deflate_Init
+     (strm       : Z_Streamp;
+      level      : Int;
+      method     : Int;
+      windowBits : Int;
+      memLevel   : Int;
+      strategy   : Int)
+      return       Int;
+   pragma Inline (Deflate_Init);
+
+   function inflateInit
+     (strm        : Z_Streamp;
+      version     : Chars_Ptr;
+      stream_size : Int)
+      return        Int;
+
+   function inflateInit2
+     (strm        : in Z_Streamp;
+      windowBits  : in Int;
+      version     : in Chars_Ptr;
+      stream_size : in Int)
+      return      Int;
+
+   function inflateBackInit
+     (strm        : in Z_Streamp;
+      windowBits  : in Int;
+      window      : in Byte_Access;
+      version     : in Chars_Ptr;
+      stream_size : in Int)
+      return      Int;
+   --  Size of window have to be 2**windowBits.
+
+   function Inflate_Init (strm : Z_Streamp; windowBits : Int) return Int;
+   pragma Inline (Inflate_Init);
+
+   function zError (err : Int) return Chars_Ptr;
+
+   function inflateSyncPoint (z : Z_Streamp) return Int;
+
+   function get_crc_table return ULong_Access;
+
+   --  Interface to the available fields of the z_stream structure.
+   --  The application must update next_in and avail_in when avail_in has
+   --  dropped to zero. It must update next_out and avail_out when avail_out
+   --  has dropped to zero. The application must initialize zalloc, zfree and
+   --  opaque before calling the init function.
+
+   procedure Set_In
+     (Strm   : in out Z_Stream;
+      Buffer : in Voidp;
+      Size   : in UInt);
+   pragma Inline (Set_In);
+
+   procedure Set_Out
+     (Strm   : in out Z_Stream;
+      Buffer : in Voidp;
+      Size   : in UInt);
+   pragma Inline (Set_Out);
+
+   procedure Set_Mem_Func
+     (Strm   : in out Z_Stream;
+      Opaque : in Voidp;
+      Alloc  : in alloc_func;
+      Free   : in free_func);
+   pragma Inline (Set_Mem_Func);
+
+   function Last_Error_Message (Strm : in Z_Stream) return String;
+   pragma Inline (Last_Error_Message);
+
+   function Avail_Out (Strm : in Z_Stream) return UInt;
+   pragma Inline (Avail_Out);
+
+   function Avail_In (Strm : in Z_Stream) return UInt;
+   pragma Inline (Avail_In);
+
+   function Total_In (Strm : in Z_Stream) return ULong;
+   pragma Inline (Total_In);
+
+   function Total_Out (Strm : in Z_Stream) return ULong;
+   pragma Inline (Total_Out);
+
+   function inflateCopy
+     (dest   : in Z_Streamp;
+      Source : in Z_Streamp)
+      return Int;
+
+   function compressBound (Source_Len : in ULong) return ULong;
+
+   function deflateBound
+     (Strm       : in Z_Streamp;
+      Source_Len : in ULong)
+      return     ULong;
+
+   function gzungetc (C : in Int; File : in  gzFile) return Int;
+
+   function zlibCompileFlags return ULong;
+
+private
+
+   type Z_Stream is record            -- zlib.h:68
+      Next_In   : Voidp      := Nul;  -- next input byte
+      Avail_In  : UInt       := 0;    -- number of bytes available at next_in
+      Total_In  : ULong      := 0;    -- total nb of input bytes read so far
+      Next_Out  : Voidp      := Nul;  -- next output byte should be put there
+      Avail_Out : UInt       := 0;    -- remaining free space at next_out
+      Total_Out : ULong      := 0;    -- total nb of bytes output so far
+      msg       : Chars_Ptr;          -- last error message, NULL if no error
+      state     : Voidp;              -- not visible by applications
+      zalloc    : alloc_func := null; -- used to allocate the internal state
+      zfree     : free_func  := null; -- used to free the internal state
+      opaque    : Voidp;              -- private data object passed to
+                                      --  zalloc and zfree
+      data_type : Int;                -- best guess about the data type:
+                                      --  ascii or binary
+      adler     : ULong;              -- adler32 value of the uncompressed
+                                      --  data
+      reserved  : ULong;              -- reserved for future use
+   end record;
+
+   pragma Convention (C, Z_Stream);
+
+   pragma Import (C, zlibVersion, "zlibVersion");
+   pragma Import (C, Deflate, "deflate");
+   pragma Import (C, DeflateEnd, "deflateEnd");
+   pragma Import (C, Inflate, "inflate");
+   pragma Import (C, InflateEnd, "inflateEnd");
+   pragma Import (C, deflateSetDictionary, "deflateSetDictionary");
+   pragma Import (C, deflateCopy, "deflateCopy");
+   pragma Import (C, deflateReset, "deflateReset");
+   pragma Import (C, deflateParams, "deflateParams");
+   pragma Import (C, inflateSetDictionary, "inflateSetDictionary");
+   pragma Import (C, inflateSync, "inflateSync");
+   pragma Import (C, inflateReset, "inflateReset");
+   pragma Import (C, compress, "compress");
+   pragma Import (C, compress2, "compress2");
+   pragma Import (C, uncompress, "uncompress");
+   pragma Import (C, gzopen, "gzopen");
+   pragma Import (C, gzdopen, "gzdopen");
+   pragma Import (C, gzsetparams, "gzsetparams");
+   pragma Import (C, gzread, "gzread");
+   pragma Import (C, gzwrite, "gzwrite");
+   pragma Import (C, gzprintf, "gzprintf");
+   pragma Import (C, gzputs, "gzputs");
+   pragma Import (C, gzgets, "gzgets");
+   pragma Import (C, gzputc, "gzputc");
+   pragma Import (C, gzgetc, "gzgetc");
+   pragma Import (C, gzflush, "gzflush");
+   pragma Import (C, gzseek, "gzseek");
+   pragma Import (C, gzrewind, "gzrewind");
+   pragma Import (C, gztell, "gztell");
+   pragma Import (C, gzeof, "gzeof");
+   pragma Import (C, gzclose, "gzclose");
+   pragma Import (C, gzerror, "gzerror");
+   pragma Import (C, adler32, "adler32");
+   pragma Import (C, crc32, "crc32");
+   pragma Import (C, deflateInit, "deflateInit_");
+   pragma Import (C, inflateInit, "inflateInit_");
+   pragma Import (C, deflateInit2, "deflateInit2_");
+   pragma Import (C, inflateInit2, "inflateInit2_");
+   pragma Import (C, zError, "zError");
+   pragma Import (C, inflateSyncPoint, "inflateSyncPoint");
+   pragma Import (C, get_crc_table, "get_crc_table");
+
+   --  since zlib 1.2.0:
+
+   pragma Import (C, inflateCopy, "inflateCopy");
+   pragma Import (C, compressBound, "compressBound");
+   pragma Import (C, deflateBound, "deflateBound");
+   pragma Import (C, gzungetc, "gzungetc");
+   pragma Import (C, zlibCompileFlags, "zlibCompileFlags");
+
+   pragma Import (C, inflateBackInit, "inflateBackInit_");
+
+   --  I stopped binding the inflateBack routines, becouse realize that
+   --  it does not support zlib and gzip headers for now, and have no
+   --  symmetric deflateBack routines.
+   --  ZLib-Ada is symmetric regarding deflate/inflate data transformation
+   --  and has a similar generic callback interface for the
+   --  deflate/inflate transformation based on the regular Deflate/Inflate
+   --  routines.
+
+   --  pragma Import (C, inflateBack, "inflateBack");
+   --  pragma Import (C, inflateBackEnd, "inflateBackEnd");
+
+end ZLib.Thin;
diff --git a/updater/zlib123/contrib/ada/zlib.adb b/updater/zlib123/contrib/ada/zlib.adb
new file mode 100644
index 0000000..6d51451
--- /dev/null
+++ b/updater/zlib123/contrib/ada/zlib.adb
@@ -0,0 +1,701 @@
+----------------------------------------------------------------
+--  ZLib for Ada thick binding.                               --
+--                                                            --
+--  Copyright (C) 2002-2004 Dmitriy Anisimkov                 --
+--                                                            --
+--  Open source license information is in the zlib.ads file.  --
+----------------------------------------------------------------
+
+--  $Id: zlib.adb,v 1.31 2004/09/06 06:53:19 vagul Exp $
+
+with Ada.Exceptions;
+with Ada.Unchecked_Conversion;
+with Ada.Unchecked_Deallocation;
+
+with Interfaces.C.Strings;
+
+with ZLib.Thin;
+
+package body ZLib is
+
+   use type Thin.Int;
+
+   type Z_Stream is new Thin.Z_Stream;
+
+   type Return_Code_Enum is
+      (OK,
+       STREAM_END,
+       NEED_DICT,
+       ERRNO,
+       STREAM_ERROR,
+       DATA_ERROR,
+       MEM_ERROR,
+       BUF_ERROR,
+       VERSION_ERROR);
+
+   type Flate_Step_Function is access
+     function (Strm : in Thin.Z_Streamp; Flush : in Thin.Int) return Thin.Int;
+   pragma Convention (C, Flate_Step_Function);
+
+   type Flate_End_Function is access
+      function (Ctrm : in Thin.Z_Streamp) return Thin.Int;
+   pragma Convention (C, Flate_End_Function);
+
+   type Flate_Type is record
+      Step : Flate_Step_Function;
+      Done : Flate_End_Function;
+   end record;
+
+   subtype Footer_Array is Stream_Element_Array (1 .. 8);
+
+   Simple_GZip_Header : constant Stream_Element_Array (1 .. 10)
+     := (16#1f#, 16#8b#,                 --  Magic header
+         16#08#,                         --  Z_DEFLATED
+         16#00#,                         --  Flags
+         16#00#, 16#00#, 16#00#, 16#00#, --  Time
+         16#00#,                         --  XFlags
+         16#03#                          --  OS code
+        );
+   --  The simplest gzip header is not for informational, but just for
+   --  gzip format compatibility.
+   --  Note that some code below is using assumption
+   --  Simple_GZip_Header'Last > Footer_Array'Last, so do not make
+   --  Simple_GZip_Header'Last <= Footer_Array'Last.
+
+   Return_Code : constant array (Thin.Int range <>) of Return_Code_Enum
+     := (0 => OK,
+         1 => STREAM_END,
+         2 => NEED_DICT,
+        -1 => ERRNO,
+        -2 => STREAM_ERROR,
+        -3 => DATA_ERROR,
+        -4 => MEM_ERROR,
+        -5 => BUF_ERROR,
+        -6 => VERSION_ERROR);
+
+   Flate : constant array (Boolean) of Flate_Type
+     := (True  => (Step => Thin.Deflate'Access,
+                   Done => Thin.DeflateEnd'Access),
+         False => (Step => Thin.Inflate'Access,
+                   Done => Thin.InflateEnd'Access));
+
+   Flush_Finish : constant array (Boolean) of Flush_Mode
+     := (True => Finish, False => No_Flush);
+
+   procedure Raise_Error (Stream : in Z_Stream);
+   pragma Inline (Raise_Error);
+
+   procedure Raise_Error (Message : in String);
+   pragma Inline (Raise_Error);
+
+   procedure Check_Error (Stream : in Z_Stream; Code : in Thin.Int);
+
+   procedure Free is new Ada.Unchecked_Deallocation
+      (Z_Stream, Z_Stream_Access);
+
+   function To_Thin_Access is new Ada.Unchecked_Conversion
+     (Z_Stream_Access, Thin.Z_Streamp);
+
+   procedure Translate_GZip
+     (Filter    : in out Filter_Type;
+      In_Data   : in     Ada.Streams.Stream_Element_Array;
+      In_Last   :    out Ada.Streams.Stream_Element_Offset;
+      Out_Data  :    out Ada.Streams.Stream_Element_Array;
+      Out_Last  :    out Ada.Streams.Stream_Element_Offset;
+      Flush     : in     Flush_Mode);
+   --  Separate translate routine for make gzip header.
+
+   procedure Translate_Auto
+     (Filter    : in out Filter_Type;
+      In_Data   : in     Ada.Streams.Stream_Element_Array;
+      In_Last   :    out Ada.Streams.Stream_Element_Offset;
+      Out_Data  :    out Ada.Streams.Stream_Element_Array;
+      Out_Last  :    out Ada.Streams.Stream_Element_Offset;
+      Flush     : in     Flush_Mode);
+   --  translate routine without additional headers.
+
+   -----------------
+   -- Check_Error --
+   -----------------
+
+   procedure Check_Error (Stream : in Z_Stream; Code : in Thin.Int) is
+      use type Thin.Int;
+   begin
+      if Code /= Thin.Z_OK then
+         Raise_Error
+            (Return_Code_Enum'Image (Return_Code (Code))
+              & ": " & Last_Error_Message (Stream));
+      end if;
+   end Check_Error;
+
+   -----------
+   -- Close --
+   -----------
+
+   procedure Close
+     (Filter       : in out Filter_Type;
+      Ignore_Error : in     Boolean := False)
+   is
+      Code : Thin.Int;
+   begin
+      if not Ignore_Error and then not Is_Open (Filter) then
+         raise Status_Error;
+      end if;
+
+      Code := Flate (Filter.Compression).Done (To_Thin_Access (Filter.Strm));
+
+      if Ignore_Error or else Code = Thin.Z_OK then
+         Free (Filter.Strm);
+      else
+         declare
+            Error_Message : constant String
+              := Last_Error_Message (Filter.Strm.all);
+         begin
+            Free (Filter.Strm);
+            Ada.Exceptions.Raise_Exception
+               (ZLib_Error'Identity,
+                Return_Code_Enum'Image (Return_Code (Code))
+                  & ": " & Error_Message);
+         end;
+      end if;
+   end Close;
+
+   -----------
+   -- CRC32 --
+   -----------
+
+   function CRC32
+     (CRC  : in Unsigned_32;
+      Data : in Ada.Streams.Stream_Element_Array)
+      return Unsigned_32
+   is
+      use Thin;
+   begin
+      return Unsigned_32 (crc32 (ULong (CRC),
+                                 Data'Address,
+                                 Data'Length));
+   end CRC32;
+
+   procedure CRC32
+     (CRC  : in out Unsigned_32;
+      Data : in     Ada.Streams.Stream_Element_Array) is
+   begin
+      CRC := CRC32 (CRC, Data);
+   end CRC32;
+
+   ------------------
+   -- Deflate_Init --
+   ------------------
+
+   procedure Deflate_Init
+     (Filter       : in out Filter_Type;
+      Level        : in     Compression_Level  := Default_Compression;
+      Strategy     : in     Strategy_Type      := Default_Strategy;
+      Method       : in     Compression_Method := Deflated;
+      Window_Bits  : in     Window_Bits_Type   := Default_Window_Bits;
+      Memory_Level : in     Memory_Level_Type  := Default_Memory_Level;
+      Header       : in     Header_Type        := Default)
+   is
+      use type Thin.Int;
+      Win_Bits : Thin.Int := Thin.Int (Window_Bits);
+   begin
+      if Is_Open (Filter) then
+         raise Status_Error;
+      end if;
+
+      --  We allow ZLib to make header only in case of default header type.
+      --  Otherwise we would either do header by ourselfs, or do not do
+      --  header at all.
+
+      if Header = None or else Header = GZip then
+         Win_Bits := -Win_Bits;
+      end if;
+
+      --  For the GZip CRC calculation and make headers.
+
+      if Header = GZip then
+         Filter.CRC    := 0;
+         Filter.Offset := Simple_GZip_Header'First;
+      else
+         Filter.Offset := Simple_GZip_Header'Last + 1;
+      end if;
+
+      Filter.Strm        := new Z_Stream;
+      Filter.Compression := True;
+      Filter.Stream_End  := False;
+      Filter.Header      := Header;
+
+      if Thin.Deflate_Init
+           (To_Thin_Access (Filter.Strm),
+            Level      => Thin.Int (Level),
+            method     => Thin.Int (Method),
+            windowBits => Win_Bits,
+            memLevel   => Thin.Int (Memory_Level),
+            strategy   => Thin.Int (Strategy)) /= Thin.Z_OK
+      then
+         Raise_Error (Filter.Strm.all);
+      end if;
+   end Deflate_Init;
+
+   -----------
+   -- Flush --
+   -----------
+
+   procedure Flush
+     (Filter    : in out Filter_Type;
+      Out_Data  :    out Ada.Streams.Stream_Element_Array;
+      Out_Last  :    out Ada.Streams.Stream_Element_Offset;
+      Flush     : in     Flush_Mode)
+   is
+      No_Data : Stream_Element_Array := (1 .. 0 => 0);
+      Last    : Stream_Element_Offset;
+   begin
+      Translate (Filter, No_Data, Last, Out_Data, Out_Last, Flush);
+   end Flush;
+
+   -----------------------
+   -- Generic_Translate --
+   -----------------------
+
+   procedure Generic_Translate
+     (Filter          : in out ZLib.Filter_Type;
+      In_Buffer_Size  : in     Integer := Default_Buffer_Size;
+      Out_Buffer_Size : in     Integer := Default_Buffer_Size)
+   is
+      In_Buffer  : Stream_Element_Array
+                     (1 .. Stream_Element_Offset (In_Buffer_Size));
+      Out_Buffer : Stream_Element_Array
+                     (1 .. Stream_Element_Offset (Out_Buffer_Size));
+      Last       : Stream_Element_Offset;
+      In_Last    : Stream_Element_Offset;
+      In_First   : Stream_Element_Offset;
+      Out_Last   : Stream_Element_Offset;
+   begin
+      Main : loop
+         Data_In (In_Buffer, Last);
+
+         In_First := In_Buffer'First;
+
+         loop
+            Translate
+              (Filter   => Filter,
+               In_Data  => In_Buffer (In_First .. Last),
+               In_Last  => In_Last,
+               Out_Data => Out_Buffer,
+               Out_Last => Out_Last,
+               Flush    => Flush_Finish (Last < In_Buffer'First));
+
+            if Out_Buffer'First <= Out_Last then
+               Data_Out (Out_Buffer (Out_Buffer'First .. Out_Last));
+            end if;
+
+            exit Main when Stream_End (Filter);
+
+            --  The end of in buffer.
+
+            exit when In_Last = Last;
+
+            In_First := In_Last + 1;
+         end loop;
+      end loop Main;
+
+   end Generic_Translate;
+
+   ------------------
+   -- Inflate_Init --
+   ------------------
+
+   procedure Inflate_Init
+     (Filter      : in out Filter_Type;
+      Window_Bits : in     Window_Bits_Type := Default_Window_Bits;
+      Header      : in     Header_Type      := Default)
+   is
+      use type Thin.Int;
+      Win_Bits : Thin.Int := Thin.Int (Window_Bits);
+
+      procedure Check_Version;
+      --  Check the latest header types compatibility.
+
+      procedure Check_Version is
+      begin
+         if Version <= "1.1.4" then
+            Raise_Error
+              ("Inflate header type " & Header_Type'Image (Header)
+               & " incompatible with ZLib version " & Version);
+         end if;
+      end Check_Version;
+
+   begin
+      if Is_Open (Filter) then
+         raise Status_Error;
+      end if;
+
+      case Header is
+         when None =>
+            Check_Version;
+
+            --  Inflate data without headers determined
+            --  by negative Win_Bits.
+
+            Win_Bits := -Win_Bits;
+         when GZip =>
+            Check_Version;
+
+            --  Inflate gzip data defined by flag 16.
+
+            Win_Bits := Win_Bits + 16;
+         when Auto =>
+            Check_Version;
+
+            --  Inflate with automatic detection
+            --  of gzip or native header defined by flag 32.
+
+            Win_Bits := Win_Bits + 32;
+         when Default => null;
+      end case;
+
+      Filter.Strm        := new Z_Stream;
+      Filter.Compression := False;
+      Filter.Stream_End  := False;
+      Filter.Header      := Header;
+
+      if Thin.Inflate_Init
+         (To_Thin_Access (Filter.Strm), Win_Bits) /= Thin.Z_OK
+      then
+         Raise_Error (Filter.Strm.all);
+      end if;
+   end Inflate_Init;
+
+   -------------
+   -- Is_Open --
+   -------------
+
+   function Is_Open (Filter : in Filter_Type) return Boolean is
+   begin
+      return Filter.Strm /= null;
+   end Is_Open;
+
+   -----------------
+   -- Raise_Error --
+   -----------------
+
+   procedure Raise_Error (Message : in String) is
+   begin
+      Ada.Exceptions.Raise_Exception (ZLib_Error'Identity, Message);
+   end Raise_Error;
+
+   procedure Raise_Error (Stream : in Z_Stream) is
+   begin
+      Raise_Error (Last_Error_Message (Stream));
+   end Raise_Error;
+
+   ----------
+   -- Read --
+   ----------
+
+   procedure Read
+     (Filter : in out Filter_Type;
+      Item   :    out Ada.Streams.Stream_Element_Array;
+      Last   :    out Ada.Streams.Stream_Element_Offset;
+      Flush  : in     Flush_Mode := No_Flush)
+   is
+      In_Last    : Stream_Element_Offset;
+      Item_First : Ada.Streams.Stream_Element_Offset := Item'First;
+      V_Flush    : Flush_Mode := Flush;
+
+   begin
+      pragma Assert (Rest_First in Buffer'First .. Buffer'Last + 1);
+      pragma Assert (Rest_Last in Buffer'First - 1 .. Buffer'Last);
+
+      loop
+         if Rest_Last = Buffer'First - 1 then
+            V_Flush := Finish;
+
+         elsif Rest_First > Rest_Last then
+            Read (Buffer, Rest_Last);
+            Rest_First := Buffer'First;
+
+            if Rest_Last < Buffer'First then
+               V_Flush := Finish;
+            end if;
+         end if;
+
+         Translate
+           (Filter   => Filter,
+            In_Data  => Buffer (Rest_First .. Rest_Last),
+            In_Last  => In_Last,
+            Out_Data => Item (Item_First .. Item'Last),
+            Out_Last => Last,
+            Flush    => V_Flush);
+
+         Rest_First := In_Last + 1;
+
+         exit when Stream_End (Filter)
+           or else Last = Item'Last
+           or else (Last >= Item'First and then Allow_Read_Some);
+
+         Item_First := Last + 1;
+      end loop;
+   end Read;
+
+   ----------------
+   -- Stream_End --
+   ----------------
+
+   function Stream_End (Filter : in Filter_Type) return Boolean is
+   begin
+      if Filter.Header = GZip and Filter.Compression then
+         return Filter.Stream_End
+            and then Filter.Offset = Footer_Array'Last + 1;
+      else
+         return Filter.Stream_End;
+      end if;
+   end Stream_End;
+
+   --------------
+   -- Total_In --
+   --------------
+
+   function Total_In (Filter : in Filter_Type) return Count is
+   begin
+      return Count (Thin.Total_In (To_Thin_Access (Filter.Strm).all));
+   end Total_In;
+
+   ---------------
+   -- Total_Out --
+   ---------------
+
+   function Total_Out (Filter : in Filter_Type) return Count is
+   begin
+      return Count (Thin.Total_Out (To_Thin_Access (Filter.Strm).all));
+   end Total_Out;
+
+   ---------------
+   -- Translate --
+   ---------------
+
+   procedure Translate
+     (Filter    : in out Filter_Type;
+      In_Data   : in     Ada.Streams.Stream_Element_Array;
+      In_Last   :    out Ada.Streams.Stream_Element_Offset;
+      Out_Data  :    out Ada.Streams.Stream_Element_Array;
+      Out_Last  :    out Ada.Streams.Stream_Element_Offset;
+      Flush     : in     Flush_Mode) is
+   begin
+      if Filter.Header = GZip and then Filter.Compression then
+         Translate_GZip
+           (Filter   => Filter,
+            In_Data  => In_Data,
+            In_Last  => In_Last,
+            Out_Data => Out_Data,
+            Out_Last => Out_Last,
+            Flush    => Flush);
+      else
+         Translate_Auto
+           (Filter   => Filter,
+            In_Data  => In_Data,
+            In_Last  => In_Last,
+            Out_Data => Out_Data,
+            Out_Last => Out_Last,
+            Flush    => Flush);
+      end if;
+   end Translate;
+
+   --------------------
+   -- Translate_Auto --
+   --------------------
+
+   procedure Translate_Auto
+     (Filter    : in out Filter_Type;
+      In_Data   : in     Ada.Streams.Stream_Element_Array;
+      In_Last   :    out Ada.Streams.Stream_Element_Offset;
+      Out_Data  :    out Ada.Streams.Stream_Element_Array;
+      Out_Last  :    out Ada.Streams.Stream_Element_Offset;
+      Flush     : in     Flush_Mode)
+   is
+      use type Thin.Int;
+      Code : Thin.Int;
+
+   begin
+      if not Is_Open (Filter) then
+         raise Status_Error;
+      end if;
+
+      if Out_Data'Length = 0 and then In_Data'Length = 0 then
+         raise Constraint_Error;
+      end if;
+
+      Set_Out (Filter.Strm.all, Out_Data'Address, Out_Data'Length);
+      Set_In  (Filter.Strm.all, In_Data'Address, In_Data'Length);
+
+      Code := Flate (Filter.Compression).Step
+        (To_Thin_Access (Filter.Strm),
+         Thin.Int (Flush));
+
+      if Code = Thin.Z_STREAM_END then
+         Filter.Stream_End := True;
+      else
+         Check_Error (Filter.Strm.all, Code);
+      end if;
+
+      In_Last  := In_Data'Last
+         - Stream_Element_Offset (Avail_In (Filter.Strm.all));
+      Out_Last := Out_Data'Last
+         - Stream_Element_Offset (Avail_Out (Filter.Strm.all));
+   end Translate_Auto;
+
+   --------------------
+   -- Translate_GZip --
+   --------------------
+
+   procedure Translate_GZip
+     (Filter    : in out Filter_Type;
+      In_Data   : in     Ada.Streams.Stream_Element_Array;
+      In_Last   :    out Ada.Streams.Stream_Element_Offset;
+      Out_Data  :    out Ada.Streams.Stream_Element_Array;
+      Out_Last  :    out Ada.Streams.Stream_Element_Offset;
+      Flush     : in     Flush_Mode)
+   is
+      Out_First : Stream_Element_Offset;
+
+      procedure Add_Data (Data : in Stream_Element_Array);
+      --  Add data to stream from the Filter.Offset till necessary,
+      --  used for add gzip headr/footer.
+
+      procedure Put_32
+        (Item : in out Stream_Element_Array;
+         Data : in     Unsigned_32);
+      pragma Inline (Put_32);
+
+      --------------
+      -- Add_Data --
+      --------------
+
+      procedure Add_Data (Data : in Stream_Element_Array) is
+         Data_First : Stream_Element_Offset renames Filter.Offset;
+         Data_Last  : Stream_Element_Offset;
+         Data_Len   : Stream_Element_Offset; --  -1
+         Out_Len    : Stream_Element_Offset; --  -1
+      begin
+         Out_First := Out_Last + 1;
+
+         if Data_First > Data'Last then
+            return;
+         end if;
+
+         Data_Len  := Data'Last     - Data_First;
+         Out_Len   := Out_Data'Last - Out_First;
+
+         if Data_Len <= Out_Len then
+            Out_Last  := Out_First  + Data_Len;
+            Data_Last := Data'Last;
+         else
+            Out_Last  := Out_Data'Last;
+            Data_Last := Data_First + Out_Len;
+         end if;
+
+         Out_Data (Out_First .. Out_Last) := Data (Data_First .. Data_Last);
+
+         Data_First := Data_Last + 1;
+         Out_First  := Out_Last + 1;
+      end Add_Data;
+
+      ------------
+      -- Put_32 --
+      ------------
+
+      procedure Put_32
+        (Item : in out Stream_Element_Array;
+         Data : in     Unsigned_32)
+      is
+         D : Unsigned_32 := Data;
+      begin
+         for J in Item'First .. Item'First + 3 loop
+            Item (J) := Stream_Element (D and 16#FF#);
+            D := Shift_Right (D, 8);
+         end loop;
+      end Put_32;
+
+   begin
+      Out_Last := Out_Data'First - 1;
+
+      if not Filter.Stream_End then
+         Add_Data (Simple_GZip_Header);
+
+         Translate_Auto
+           (Filter   => Filter,
+            In_Data  => In_Data,
+            In_Last  => In_Last,
+            Out_Data => Out_Data (Out_First .. Out_Data'Last),
+            Out_Last => Out_Last,
+            Flush    => Flush);
+
+         CRC32 (Filter.CRC, In_Data (In_Data'First .. In_Last));
+      end if;
+
+      if Filter.Stream_End and then Out_Last <= Out_Data'Last then
+         --  This detection method would work only when
+         --  Simple_GZip_Header'Last > Footer_Array'Last
+
+         if Filter.Offset = Simple_GZip_Header'Last + 1 then
+            Filter.Offset := Footer_Array'First;
+         end if;
+
+         declare
+            Footer : Footer_Array;
+         begin
+            Put_32 (Footer, Filter.CRC);
+            Put_32 (Footer (Footer'First + 4 .. Footer'Last),
+                    Unsigned_32 (Total_In (Filter)));
+            Add_Data (Footer);
+         end;
+      end if;
+   end Translate_GZip;
+
+   -------------
+   -- Version --
+   -------------
+
+   function Version return String is
+   begin
+      return Interfaces.C.Strings.Value (Thin.zlibVersion);
+   end Version;
+
+   -----------
+   -- Write --
+   -----------
+
+   procedure Write
+     (Filter : in out Filter_Type;
+      Item   : in     Ada.Streams.Stream_Element_Array;
+      Flush  : in     Flush_Mode := No_Flush)
+   is
+      Buffer   : Stream_Element_Array (1 .. Buffer_Size);
+      In_Last  : Stream_Element_Offset;
+      Out_Last : Stream_Element_Offset;
+      In_First : Stream_Element_Offset := Item'First;
+   begin
+      if Item'Length = 0 and Flush = No_Flush then
+         return;
+      end if;
+
+      loop
+         Translate
+           (Filter   => Filter,
+            In_Data  => Item (In_First .. Item'Last),
+            In_Last  => In_Last,
+            Out_Data => Buffer,
+            Out_Last => Out_Last,
+            Flush    => Flush);
+
+         if Out_Last >= Buffer'First then
+            Write (Buffer (1 .. Out_Last));
+         end if;
+
+         exit when In_Last = Item'Last or Stream_End (Filter);
+
+         In_First := In_Last + 1;
+      end loop;
+   end Write;
+
+end ZLib;
diff --git a/updater/zlib123/contrib/ada/zlib.ads b/updater/zlib123/contrib/ada/zlib.ads
new file mode 100644
index 0000000..7126eae
--- /dev/null
+++ b/updater/zlib123/contrib/ada/zlib.ads
@@ -0,0 +1,328 @@
+------------------------------------------------------------------------------
+--                      ZLib for Ada thick binding.                         --
+--                                                                          --
+--              Copyright (C) 2002-2004 Dmitriy Anisimkov                   --
+--                                                                          --
+--  This library 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 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       --
+--  General Public License for more details.                                --
+--                                                                          --
+--  You should have received a copy of the GNU 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.          --
+--                                                                          --
+--  As a special exception, if other files instantiate generics from this   --
+--  unit, or you link this unit with other files to produce an executable,  --
+--  this  unit  does not  by itself cause  the resulting executable to be   --
+--  covered by the GNU General Public License. This exception does not      --
+--  however invalidate any other reasons why the executable file  might be  --
+--  covered by the  GNU Public License.                                     --
+------------------------------------------------------------------------------
+
+--  $Id: zlib.ads,v 1.26 2004/09/06 06:53:19 vagul Exp $
+
+with Ada.Streams;
+
+with Interfaces;
+
+package ZLib is
+
+   ZLib_Error   : exception;
+   Status_Error : exception;
+
+   type Compression_Level is new Integer range -1 .. 9;
+
+   type Flush_Mode is private;
+
+   type Compression_Method is private;
+
+   type Window_Bits_Type is new Integer range 8 .. 15;
+
+   type Memory_Level_Type is new Integer range 1 .. 9;
+
+   type Unsigned_32 is new Interfaces.Unsigned_32;
+
+   type Strategy_Type is private;
+
+   type Header_Type is (None, Auto, Default, GZip);
+   --  Header type usage have a some limitation for inflate.
+   --  See comment for Inflate_Init.
+
+   subtype Count is Ada.Streams.Stream_Element_Count;
+
+   Default_Memory_Level : constant Memory_Level_Type := 8;
+   Default_Window_Bits  : constant Window_Bits_Type  := 15;
+
+   ----------------------------------
+   -- Compression method constants --
+   ----------------------------------
+
+   Deflated : constant Compression_Method;
+   --  Only one method allowed in this ZLib version
+
+   ---------------------------------
+   -- Compression level constants --
+   ---------------------------------
+
+   No_Compression      : constant Compression_Level := 0;
+   Best_Speed          : constant Compression_Level := 1;
+   Best_Compression    : constant Compression_Level := 9;
+   Default_Compression : constant Compression_Level := -1;
+
+   --------------------------
+   -- Flush mode constants --
+   --------------------------
+
+   No_Flush      : constant Flush_Mode;
+   --  Regular way for compression, no flush
+
+   Partial_Flush : constant Flush_Mode;
+   --  Will be removed, use Z_SYNC_FLUSH instead
+
+   Sync_Flush    : constant Flush_Mode;
+   --  All pending output is flushed to the output buffer and the output
+   --  is aligned on a byte boundary, so that the decompressor can get all
+   --  input data available so far. (In particular avail_in is zero after the
+   --  call if enough output space has been provided  before the call.)
+   --  Flushing may degrade compression for some compression algorithms and so
+   --  it should be used only when necessary.
+
+   Block_Flush   : constant Flush_Mode;
+   --  Z_BLOCK requests that inflate() stop
+   --  if and when it get to the next deflate block boundary. When decoding the
+   --  zlib or gzip format, this will cause inflate() to return immediately
+   --  after the header and before the first block. When doing a raw inflate,
+   --  inflate() will go ahead and process the first block, and will return
+   --  when it gets to the end of that block, or when it runs out of data.
+
+   Full_Flush    : constant Flush_Mode;
+   --  All output is flushed as with SYNC_FLUSH, and the compression state
+   --  is reset so that decompression can restart from this point if previous
+   --  compressed data has been damaged or if random access is desired. Using
+   --  Full_Flush too often can seriously degrade the compression.
+
+   Finish        : constant Flush_Mode;
+   --  Just for tell the compressor that input data is complete.
+
+   ------------------------------------
+   -- Compression strategy constants --
+   ------------------------------------
+
+   --  RLE stategy could be used only in version 1.2.0 and later.
+
+   Filtered         : constant Strategy_Type;
+   Huffman_Only     : constant Strategy_Type;
+   RLE              : constant Strategy_Type;
+   Default_Strategy : constant Strategy_Type;
+
+   Default_Buffer_Size : constant := 4096;
+
+   type Filter_Type is tagged limited private;
+   --  The filter is for compression and for decompression.
+   --  The usage of the type is depend of its initialization.
+
+   function Version return String;
+   pragma Inline (Version);
+   --  Return string representation of the ZLib version.
+
+   procedure Deflate_Init
+     (Filter       : in out Filter_Type;
+      Level        : in     Compression_Level  := Default_Compression;
+      Strategy     : in     Strategy_Type      := Default_Strategy;
+      Method       : in     Compression_Method := Deflated;
+      Window_Bits  : in     Window_Bits_Type   := Default_Window_Bits;
+      Memory_Level : in     Memory_Level_Type  := Default_Memory_Level;
+      Header       : in     Header_Type        := Default);
+   --  Compressor initialization.
+   --  When Header parameter is Auto or Default, then default zlib header
+   --  would be provided for compressed data.
+   --  When Header is GZip, then gzip header would be set instead of
+   --  default header.
+   --  When Header is None, no header would be set for compressed data.
+
+   procedure Inflate_Init
+     (Filter      : in out Filter_Type;
+      Window_Bits : in     Window_Bits_Type := Default_Window_Bits;
+      Header      : in     Header_Type      := Default);
+   --  Decompressor initialization.
+   --  Default header type mean that ZLib default header is expecting in the
+   --  input compressed stream.
+   --  Header type None mean that no header is expecting in the input stream.
+   --  GZip header type mean that GZip header is expecting in the
+   --  input compressed stream.
+   --  Auto header type mean that header type (GZip or Native) would be
+   --  detected automatically in the input stream.
+   --  Note that header types parameter values None, GZip and Auto are
+   --  supported for inflate routine only in ZLib versions 1.2.0.2 and later.
+   --  Deflate_Init is supporting all header types.
+
+   function Is_Open (Filter : in Filter_Type) return Boolean;
+   pragma Inline (Is_Open);
+   --  Is the filter opened for compression or decompression.
+
+   procedure Close
+     (Filter       : in out Filter_Type;
+      Ignore_Error : in     Boolean := False);
+   --  Closing the compression or decompressor.
+   --  If stream is closing before the complete and Ignore_Error is False,
+   --  The exception would be raised.
+
+   generic
+      with procedure Data_In
+        (Item : out Ada.Streams.Stream_Element_Array;
+         Last : out Ada.Streams.Stream_Element_Offset);
+      with procedure Data_Out
+        (Item : in Ada.Streams.Stream_Element_Array);
+   procedure Generic_Translate
+     (Filter          : in out Filter_Type;
+      In_Buffer_Size  : in     Integer := Default_Buffer_Size;
+      Out_Buffer_Size : in     Integer := Default_Buffer_Size);
+   --  Compress/decompress data fetch from Data_In routine and pass the result
+   --  to the Data_Out routine. User should provide Data_In and Data_Out
+   --  for compression/decompression data flow.
+   --  Compression or decompression depend on Filter initialization.
+
+   function Total_In (Filter : in Filter_Type) return Count;
+   pragma Inline (Total_In);
+   --  Returns total number of input bytes read so far
+
+   function Total_Out (Filter : in Filter_Type) return Count;
+   pragma Inline (Total_Out);
+   --  Returns total number of bytes output so far
+
+   function CRC32
+     (CRC    : in Unsigned_32;
+      Data   : in Ada.Streams.Stream_Element_Array)
+      return Unsigned_32;
+   pragma Inline (CRC32);
+   --  Compute CRC32, it could be necessary for make gzip format
+
+   procedure CRC32
+     (CRC  : in out Unsigned_32;
+      Data : in     Ada.Streams.Stream_Element_Array);
+   pragma Inline (CRC32);
+   --  Compute CRC32, it could be necessary for make gzip format
+
+   -------------------------------------------------
+   --  Below is more complex low level routines.  --
+   -------------------------------------------------
+
+   procedure Translate
+     (Filter    : in out Filter_Type;
+      In_Data   : in     Ada.Streams.Stream_Element_Array;
+      In_Last   :    out Ada.Streams.Stream_Element_Offset;
+      Out_Data  :    out Ada.Streams.Stream_Element_Array;
+      Out_Last  :    out Ada.Streams.Stream_Element_Offset;
+      Flush     : in     Flush_Mode);
+   --  Compress/decompress the In_Data buffer and place the result into
+   --  Out_Data. In_Last is the index of last element from In_Data accepted by
+   --  the Filter. Out_Last is the last element of the received data from
+   --  Filter. To tell the filter that incoming data are complete put the
+   --  Flush parameter to Finish.
+
+   function Stream_End (Filter : in Filter_Type) return Boolean;
+   pragma Inline (Stream_End);
+   --  Return the true when the stream is complete.
+
+   procedure Flush
+     (Filter    : in out Filter_Type;
+      Out_Data  :    out Ada.Streams.Stream_Element_Array;
+      Out_Last  :    out Ada.Streams.Stream_Element_Offset;
+      Flush     : in     Flush_Mode);
+   pragma Inline (Flush);
+   --  Flushing the data from the compressor.
+
+   generic
+      with procedure Write
+        (Item : in Ada.Streams.Stream_Element_Array);
+      --  User should provide this routine for accept
+      --  compressed/decompressed data.
+
+      Buffer_Size : in Ada.Streams.Stream_Element_Offset
+         := Default_Buffer_Size;
+      --  Buffer size for Write user routine.
+
+   procedure Write
+     (Filter  : in out Filter_Type;
+      Item    : in     Ada.Streams.Stream_Element_Array;
+      Flush   : in     Flush_Mode := No_Flush);
+   --  Compress/Decompress data from Item to the generic parameter procedure
+   --  Write. Output buffer size could be set in Buffer_Size generic parameter.
+
+   generic
+      with procedure Read
+        (Item : out Ada.Streams.Stream_Element_Array;
+         Last : out Ada.Streams.Stream_Element_Offset);
+      --  User should provide data for compression/decompression
+      --  thru this routine.
+
+      Buffer : in out Ada.Streams.Stream_Element_Array;
+      --  Buffer for keep remaining data from the previous
+      --  back read.
+
+      Rest_First, Rest_Last : in out Ada.Streams.Stream_Element_Offset;
+      --  Rest_First have to be initialized to Buffer'Last + 1
+      --  Rest_Last have to be initialized to Buffer'Last
+      --  before usage.
+
+      Allow_Read_Some : in Boolean := False;
+      --  Is it allowed to return Last < Item'Last before end of data.
+
+   procedure Read
+     (Filter : in out Filter_Type;
+      Item   :    out Ada.Streams.Stream_Element_Array;
+      Last   :    out Ada.Streams.Stream_Element_Offset;
+      Flush  : in     Flush_Mode := No_Flush);
+   --  Compress/Decompress data from generic parameter procedure Read to the
+   --  Item. User should provide Buffer and initialized Rest_First, Rest_Last
+   --  indicators. If Allow_Read_Some is True, Read routines could return
+   --  Last < Item'Last only at end of stream.
+
+private
+
+   use Ada.Streams;
+
+   pragma Assert (Ada.Streams.Stream_Element'Size    =    8);
+   pragma Assert (Ada.Streams.Stream_Element'Modulus = 2**8);
+
+   type Flush_Mode is new Integer range 0 .. 5;
+
+   type Compression_Method is new Integer range 8 .. 8;
+
+   type Strategy_Type is new Integer range 0 .. 3;
+
+   No_Flush      : constant Flush_Mode := 0;
+   Partial_Flush : constant Flush_Mode := 1;
+   Sync_Flush    : constant Flush_Mode := 2;
+   Full_Flush    : constant Flush_Mode := 3;
+   Finish        : constant Flush_Mode := 4;
+   Block_Flush   : constant Flush_Mode := 5;
+
+   Filtered         : constant Strategy_Type := 1;
+   Huffman_Only     : constant Strategy_Type := 2;
+   RLE              : constant Strategy_Type := 3;
+   Default_Strategy : constant Strategy_Type := 0;
+
+   Deflated : constant Compression_Method := 8;
+
+   type Z_Stream;
+
+   type Z_Stream_Access is access all Z_Stream;
+
+   type Filter_Type is tagged limited record
+      Strm        : Z_Stream_Access;
+      Compression : Boolean;
+      Stream_End  : Boolean;
+      Header      : Header_Type;
+      CRC         : Unsigned_32;
+      Offset      : Stream_Element_Offset;
+      --  Offset for gzip header/footer output.
+   end record;
+
+end ZLib;
diff --git a/updater/zlib123/contrib/ada/zlib.gpr b/updater/zlib123/contrib/ada/zlib.gpr
new file mode 100644
index 0000000..d5b358e
--- /dev/null
+++ b/updater/zlib123/contrib/ada/zlib.gpr
@@ -0,0 +1,20 @@
+project Zlib is
+
+   for Languages use ("Ada");
+   for Source_Dirs use (".");
+   for Object_Dir use ".";
+   for Main use ("test.adb", "mtest.adb", "read.adb", "buffer_demo");
+
+   package Compiler is
+      for Default_Switches ("ada") use ("-gnatwcfilopru", "-gnatVcdfimorst", "-gnatyabcefhiklmnoprst");
+   end Compiler;
+
+   package Linker is
+      for Default_Switches ("ada") use ("-lz");
+   end Linker;
+
+   package Builder is
+      for Default_Switches ("ada") use ("-s", "-gnatQ");
+   end Builder;
+
+end Zlib;
diff --git a/updater/zlib123/contrib/asm586/README.586 b/updater/zlib123/contrib/asm586/README.586
new file mode 100644
index 0000000..a9293ed
--- /dev/null
+++ b/updater/zlib123/contrib/asm586/README.586
@@ -0,0 +1,43 @@
+This is a patched version of zlib modified to use
+Pentium-optimized assembly code in the deflation algorithm. The files
+changed/added by this patch are:
+
+README.586
+match.S
+
+The effectiveness of these modifications is a bit marginal, as the the
+program's bottleneck seems to be mostly L1-cache contention, for which
+there is no real way to work around without rewriting the basic
+algorithm. The speedup on average is around 5-10% (which is generally
+less than the amount of variance between subsequent executions).
+However, when used at level 9 compression, the cache contention can
+drop enough for the assembly version to achieve 10-20% speedup (and
+sometimes more, depending on the amount of overall redundancy in the
+files). Even here, though, cache contention can still be the limiting
+factor, depending on the nature of the program using the zlib library.
+This may also mean that better improvements will be seen on a Pentium
+with MMX, which suffers much less from L1-cache contention, but I have
+not yet verified this.
+
+Note that this code has been tailored for the Pentium in particular,
+and will not perform well on the Pentium Pro (due to the use of a
+partial register in the inner loop).
+
+If you are using an assembler other than GNU as, you will have to
+translate match.S to use your assembler's syntax. (Have fun.)
+
+Brian Raiter
+breadbox@muppetlabs.com
+April, 1998
+
+
+Added for zlib 1.1.3:
+
+The patches come from
+http://www.muppetlabs.com/~breadbox/software/assembly.html
+
+To compile zlib with this asm file, copy match.S to the zlib directory
+then do:
+
+CFLAGS="-O3 -DASMV" ./configure
+make OBJA=match.o
diff --git a/updater/zlib123/contrib/asm586/match.S b/updater/zlib123/contrib/asm586/match.S
new file mode 100644
index 0000000..371c9a0
--- /dev/null
+++ b/updater/zlib123/contrib/asm586/match.S
@@ -0,0 +1,364 @@
+/* match.s -- Pentium-optimized version of longest_match()
+ * Written for zlib 1.1.2
+ * Copyright (C) 1998 Brian Raiter <breadbox@muppetlabs.com>
+ *
+ * This is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License.
+ */
+
+#ifndef NO_UNDERLINE
+#define	match_init	_match_init
+#define	longest_match	_longest_match
+#endif
+
+#define	MAX_MATCH	(258)
+#define	MIN_MATCH	(3)
+#define	MIN_LOOKAHEAD	(MAX_MATCH + MIN_MATCH + 1)
+#define	MAX_MATCH_8	((MAX_MATCH + 7) & ~7)
+
+/* stack frame offsets */
+
+#define	wmask			0	/* local copy of s->wmask	*/
+#define	window			4	/* local copy of s->window	*/
+#define	windowbestlen		8	/* s->window + bestlen		*/
+#define	chainlenscanend		12	/* high word: current chain len	*/
+					/* low word: last bytes sought	*/
+#define	scanstart		16	/* first two bytes of string	*/
+#define	scanalign		20	/* dword-misalignment of string	*/
+#define	nicematch		24	/* a good enough match size	*/
+#define	bestlen			28	/* size of best match so far	*/
+#define	scan			32	/* ptr to string wanting match	*/
+
+#define	LocalVarsSize		(36)
+/*	saved ebx		36 */
+/*	saved edi		40 */
+/*	saved esi		44 */
+/*	saved ebp		48 */
+/*	return address		52 */
+#define	deflatestate		56	/* the function arguments	*/
+#define	curmatch		60
+
+/* Offsets for fields in the deflate_state structure. These numbers
+ * are calculated from the definition of deflate_state, with the
+ * assumption that the compiler will dword-align the fields. (Thus,
+ * changing the definition of deflate_state could easily cause this
+ * program to crash horribly, without so much as a warning at
+ * compile time. Sigh.)
+ */
+
+/* All the +zlib1222add offsets are due to the addition of fields
+ *  in zlib in the deflate_state structure since the asm code was first written
+ * (if you compile with zlib 1.0.4 or older, use "zlib1222add equ (-4)").
+ * (if you compile with zlib between 1.0.5 and 1.2.2.1, use "zlib1222add equ 0").
+ * if you compile with zlib 1.2.2.2 or later , use "zlib1222add equ 8").
+ */
+
+#define zlib1222add		(8)
+
+#define	dsWSize			(36+zlib1222add)
+#define	dsWMask			(44+zlib1222add)
+#define	dsWindow		(48+zlib1222add)
+#define	dsPrev			(56+zlib1222add)
+#define	dsMatchLen		(88+zlib1222add)
+#define	dsPrevMatch		(92+zlib1222add)
+#define	dsStrStart		(100+zlib1222add)
+#define	dsMatchStart		(104+zlib1222add)
+#define	dsLookahead		(108+zlib1222add)
+#define	dsPrevLen		(112+zlib1222add)
+#define	dsMaxChainLen		(116+zlib1222add)
+#define	dsGoodMatch		(132+zlib1222add)
+#define	dsNiceMatch		(136+zlib1222add)
+
+
+.file "match.S"
+
+.globl	match_init, longest_match
+
+.text
+
+/* uInt longest_match(deflate_state *deflatestate, IPos curmatch) */
+
+longest_match:
+
+/* Save registers that the compiler may be using, and adjust %esp to	*/
+/* make room for our stack frame.					*/
+
+		pushl	%ebp
+		pushl	%edi
+		pushl	%esi
+		pushl	%ebx
+		subl	$LocalVarsSize, %esp
+
+/* Retrieve the function arguments. %ecx will hold cur_match		*/
+/* throughout the entire function. %edx will hold the pointer to the	*/
+/* deflate_state structure during the function's setup (before		*/
+/* entering the main loop).						*/
+
+		movl	deflatestate(%esp), %edx
+		movl	curmatch(%esp), %ecx
+
+/* if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;	*/
+
+		movl	dsNiceMatch(%edx), %eax
+		movl	dsLookahead(%edx), %ebx
+		cmpl	%eax, %ebx
+		jl	LookaheadLess
+		movl	%eax, %ebx
+LookaheadLess:	movl	%ebx, nicematch(%esp)
+
+/* register Bytef *scan = s->window + s->strstart;			*/
+
+		movl	dsWindow(%edx), %esi
+		movl	%esi, window(%esp)
+		movl	dsStrStart(%edx), %ebp
+		lea	(%esi,%ebp), %edi
+		movl	%edi, scan(%esp)
+
+/* Determine how many bytes the scan ptr is off from being		*/
+/* dword-aligned.							*/
+
+		movl	%edi, %eax
+		negl	%eax
+		andl	$3, %eax
+		movl	%eax, scanalign(%esp)
+
+/* IPos limit = s->strstart > (IPos)MAX_DIST(s) ?			*/
+/*     s->strstart - (IPos)MAX_DIST(s) : NIL;				*/
+
+		movl	dsWSize(%edx), %eax
+		subl	$MIN_LOOKAHEAD, %eax
+		subl	%eax, %ebp
+		jg	LimitPositive
+		xorl	%ebp, %ebp
+LimitPositive:
+
+/* unsigned chain_length = s->max_chain_length;				*/
+/* if (s->prev_length >= s->good_match) {				*/
+/*     chain_length >>= 2;						*/
+/* }									*/
+
+		movl	dsPrevLen(%edx), %eax
+		movl	dsGoodMatch(%edx), %ebx
+		cmpl	%ebx, %eax
+		movl	dsMaxChainLen(%edx), %ebx
+		jl	LastMatchGood
+		shrl	$2, %ebx
+LastMatchGood:
+
+/* chainlen is decremented once beforehand so that the function can	*/
+/* use the sign flag instead of the zero flag for the exit test.	*/
+/* It is then shifted into the high word, to make room for the scanend	*/
+/* scanend value, which it will always accompany.			*/
+
+		decl	%ebx
+		shll	$16, %ebx
+
+/* int best_len = s->prev_length;					*/
+
+		movl	dsPrevLen(%edx), %eax
+		movl	%eax, bestlen(%esp)
+
+/* Store the sum of s->window + best_len in %esi locally, and in %esi.	*/
+
+		addl	%eax, %esi
+		movl	%esi, windowbestlen(%esp)
+
+/* register ush scan_start = *(ushf*)scan;				*/
+/* register ush scan_end   = *(ushf*)(scan+best_len-1);			*/
+
+		movw	(%edi), %bx
+		movw	%bx, scanstart(%esp)
+		movw	-1(%edi,%eax), %bx
+		movl	%ebx, chainlenscanend(%esp)
+
+/* Posf *prev = s->prev;						*/
+/* uInt wmask = s->w_mask;						*/
+
+		movl	dsPrev(%edx), %edi
+		movl	dsWMask(%edx), %edx
+		mov	%edx, wmask(%esp)
+
+/* Jump into the main loop.						*/
+
+		jmp	LoopEntry
+
+.balign 16
+
+/* do {
+ *     match = s->window + cur_match;
+ *     if (*(ushf*)(match+best_len-1) != scan_end ||
+ *         *(ushf*)match != scan_start) continue;
+ *     [...]
+ * } while ((cur_match = prev[cur_match & wmask]) > limit
+ *          && --chain_length != 0);
+ *
+ * Here is the inner loop of the function. The function will spend the
+ * majority of its time in this loop, and majority of that time will
+ * be spent in the first ten instructions.
+ *
+ * Within this loop:
+ * %ebx = chainlenscanend - i.e., ((chainlen << 16) | scanend)
+ * %ecx = curmatch
+ * %edx = curmatch & wmask
+ * %esi = windowbestlen - i.e., (window + bestlen)
+ * %edi = prev
+ * %ebp = limit
+ *
+ * Two optimization notes on the choice of instructions:
+ *
+ * The first instruction uses a 16-bit address, which costs an extra,
+ * unpairable cycle. This is cheaper than doing a 32-bit access and
+ * zeroing the high word, due to the 3-cycle misalignment penalty which
+ * would occur half the time. This also turns out to be cheaper than
+ * doing two separate 8-bit accesses, as the memory is so rarely in the
+ * L1 cache.
+ *
+ * The window buffer, however, apparently spends a lot of time in the
+ * cache, and so it is faster to retrieve the word at the end of the
+ * match string with two 8-bit loads. The instructions that test the
+ * word at the beginning of the match string, however, are executed
+ * much less frequently, and there it was cheaper to use 16-bit
+ * instructions, which avoided the necessity of saving off and
+ * subsequently reloading one of the other registers.
+ */
+LookupLoop:
+							/* 1 U & V  */
+		movw	(%edi,%edx,2), %cx		/* 2 U pipe */
+		movl	wmask(%esp), %edx		/* 2 V pipe */
+		cmpl	%ebp, %ecx			/* 3 U pipe */
+		jbe	LeaveNow			/* 3 V pipe */
+		subl	$0x00010000, %ebx		/* 4 U pipe */
+		js	LeaveNow			/* 4 V pipe */
+LoopEntry:	movb	-1(%esi,%ecx), %al		/* 5 U pipe */
+		andl	%ecx, %edx			/* 5 V pipe */
+		cmpb	%bl, %al			/* 6 U pipe */
+		jnz	LookupLoop			/* 6 V pipe */
+		movb	(%esi,%ecx), %ah
+		cmpb	%bh, %ah
+		jnz	LookupLoop
+		movl	window(%esp), %eax
+		movw	(%eax,%ecx), %ax
+		cmpw	scanstart(%esp), %ax
+		jnz	LookupLoop
+
+/* Store the current value of chainlen.					*/
+
+		movl	%ebx, chainlenscanend(%esp)
+
+/* Point %edi to the string under scrutiny, and %esi to the string we	*/
+/* are hoping to match it up with. In actuality, %esi and %edi are	*/
+/* both pointed (MAX_MATCH_8 - scanalign) bytes ahead, and %edx is	*/
+/* initialized to -(MAX_MATCH_8 - scanalign).				*/
+
+		movl	window(%esp), %esi
+		movl	scan(%esp), %edi
+		addl	%ecx, %esi
+		movl	scanalign(%esp), %eax
+		movl	$(-MAX_MATCH_8), %edx
+		lea	MAX_MATCH_8(%edi,%eax), %edi
+		lea	MAX_MATCH_8(%esi,%eax), %esi
+
+/* Test the strings for equality, 8 bytes at a time. At the end,
+ * adjust %edx so that it is offset to the exact byte that mismatched.
+ *
+ * We already know at this point that the first three bytes of the
+ * strings match each other, and they can be safely passed over before
+ * starting the compare loop. So what this code does is skip over 0-3
+ * bytes, as much as necessary in order to dword-align the %edi
+ * pointer. (%esi will still be misaligned three times out of four.)
+ *
+ * It should be confessed that this loop usually does not represent
+ * much of the total running time. Replacing it with a more
+ * straightforward "rep cmpsb" would not drastically degrade
+ * performance.
+ */
+LoopCmps:
+		movl	(%esi,%edx), %eax
+		movl	(%edi,%edx), %ebx
+		xorl	%ebx, %eax
+		jnz	LeaveLoopCmps
+		movl	4(%esi,%edx), %eax
+		movl	4(%edi,%edx), %ebx
+		xorl	%ebx, %eax
+		jnz	LeaveLoopCmps4
+		addl	$8, %edx
+		jnz	LoopCmps
+		jmp	LenMaximum
+LeaveLoopCmps4:	addl	$4, %edx
+LeaveLoopCmps:	testl	$0x0000FFFF, %eax
+		jnz	LenLower
+		addl	$2, %edx
+		shrl	$16, %eax
+LenLower:	subb	$1, %al
+		adcl	$0, %edx
+
+/* Calculate the length of the match. If it is longer than MAX_MATCH,	*/
+/* then automatically accept it as the best possible match and leave.	*/
+
+		lea	(%edi,%edx), %eax
+		movl	scan(%esp), %edi
+		subl	%edi, %eax
+		cmpl	$MAX_MATCH, %eax
+		jge	LenMaximum
+
+/* If the length of the match is not longer than the best match we	*/
+/* have so far, then forget it and return to the lookup loop.		*/
+
+		movl	deflatestate(%esp), %edx
+		movl	bestlen(%esp), %ebx
+		cmpl	%ebx, %eax
+		jg	LongerMatch
+		movl	chainlenscanend(%esp), %ebx
+		movl	windowbestlen(%esp), %esi
+		movl	dsPrev(%edx), %edi
+		movl	wmask(%esp), %edx
+		andl	%ecx, %edx
+		jmp	LookupLoop
+
+/*         s->match_start = cur_match;					*/
+/*         best_len = len;						*/
+/*         if (len >= nice_match) break;				*/
+/*         scan_end = *(ushf*)(scan+best_len-1);			*/
+
+LongerMatch:	movl	nicematch(%esp), %ebx
+		movl	%eax, bestlen(%esp)
+		movl	%ecx, dsMatchStart(%edx)
+		cmpl	%ebx, %eax
+		jge	LeaveNow
+		movl	window(%esp), %esi
+		addl	%eax, %esi
+		movl	%esi, windowbestlen(%esp)
+		movl	chainlenscanend(%esp), %ebx
+		movw	-1(%edi,%eax), %bx
+		movl	dsPrev(%edx), %edi
+		movl	%ebx, chainlenscanend(%esp)
+		movl	wmask(%esp), %edx
+		andl	%ecx, %edx
+		jmp	LookupLoop
+
+/* Accept the current string, with the maximum possible length.		*/
+
+LenMaximum:	movl	deflatestate(%esp), %edx
+		movl	$MAX_MATCH, bestlen(%esp)
+		movl	%ecx, dsMatchStart(%edx)
+
+/* if ((uInt)best_len <= s->lookahead) return (uInt)best_len;		*/
+/* return s->lookahead;							*/
+
+LeaveNow:
+		movl	deflatestate(%esp), %edx
+		movl	bestlen(%esp), %ebx
+		movl	dsLookahead(%edx), %eax
+		cmpl	%eax, %ebx
+		jg	LookaheadRet
+		movl	%ebx, %eax
+LookaheadRet:
+
+/* Restore the stack and return from whence we came.			*/
+
+		addl	$LocalVarsSize, %esp
+		popl	%ebx
+		popl	%esi
+		popl	%edi
+		popl	%ebp
+match_init:	ret
diff --git a/updater/zlib123/contrib/asm686/README.686 b/updater/zlib123/contrib/asm686/README.686
new file mode 100644
index 0000000..929932b
--- /dev/null
+++ b/updater/zlib123/contrib/asm686/README.686
@@ -0,0 +1,34 @@
+This is a patched version of zlib, modified to use
+Pentium-Pro-optimized assembly code in the deflation algorithm. The
+files changed/added by this patch are:
+
+README.686
+match.S
+
+The speedup that this patch provides varies, depending on whether the
+compiler used to build the original version of zlib falls afoul of the
+PPro's speed traps. My own tests show a speedup of around 10-20% at
+the default compression level, and 20-30% using -9, against a version
+compiled using gcc 2.7.2.3. Your mileage may vary.
+
+Note that this code has been tailored for the PPro/PII in particular,
+and will not perform particuarly well on a Pentium.
+
+If you are using an assembler other than GNU as, you will have to
+translate match.S to use your assembler's syntax. (Have fun.)
+
+Brian Raiter
+breadbox@muppetlabs.com
+April, 1998
+
+
+Added for zlib 1.1.3:
+
+The patches come from
+http://www.muppetlabs.com/~breadbox/software/assembly.html
+
+To compile zlib with this asm file, copy match.S to the zlib directory
+then do:
+
+CFLAGS="-O3 -DASMV" ./configure
+make OBJA=match.o
diff --git a/updater/zlib123/contrib/asm686/match.S b/updater/zlib123/contrib/asm686/match.S
new file mode 100644
index 0000000..c24be4d
--- /dev/null
+++ b/updater/zlib123/contrib/asm686/match.S
@@ -0,0 +1,329 @@
+/* match.s -- Pentium-Pro-optimized version of longest_match()
+ * Written for zlib 1.1.2
+ * Copyright (C) 1998 Brian Raiter <breadbox@muppetlabs.com>
+ *
+ * This is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License.
+ */
+
+#ifndef NO_UNDERLINE
+#define	match_init	_match_init
+#define	longest_match	_longest_match
+#endif
+
+#define	MAX_MATCH	(258)
+#define	MIN_MATCH	(3)
+#define	MIN_LOOKAHEAD	(MAX_MATCH + MIN_MATCH + 1)
+#define	MAX_MATCH_8	((MAX_MATCH + 7) & ~7)
+
+/* stack frame offsets */
+
+#define	chainlenwmask		0	/* high word: current chain len	*/
+					/* low word: s->wmask		*/
+#define	window			4	/* local copy of s->window	*/
+#define	windowbestlen		8	/* s->window + bestlen		*/
+#define	scanstart		16	/* first two bytes of string	*/
+#define	scanend			12	/* last two bytes of string	*/
+#define	scanalign		20	/* dword-misalignment of string	*/
+#define	nicematch		24	/* a good enough match size	*/
+#define	bestlen			28	/* size of best match so far	*/
+#define	scan			32	/* ptr to string wanting match	*/
+
+#define	LocalVarsSize		(36)
+/*	saved ebx		36 */
+/*	saved edi		40 */
+/*	saved esi		44 */
+/*	saved ebp		48 */
+/*	return address		52 */
+#define	deflatestate		56	/* the function arguments	*/
+#define	curmatch		60
+
+/* All the +zlib1222add offsets are due to the addition of fields
+ *  in zlib in the deflate_state structure since the asm code was first written
+ * (if you compile with zlib 1.0.4 or older, use "zlib1222add equ (-4)").
+ * (if you compile with zlib between 1.0.5 and 1.2.2.1, use "zlib1222add equ 0").
+ * if you compile with zlib 1.2.2.2 or later , use "zlib1222add equ 8").
+ */
+
+#define zlib1222add		(8)
+
+#define	dsWSize			(36+zlib1222add)
+#define	dsWMask			(44+zlib1222add)
+#define	dsWindow		(48+zlib1222add)
+#define	dsPrev			(56+zlib1222add)
+#define	dsMatchLen		(88+zlib1222add)
+#define	dsPrevMatch		(92+zlib1222add)
+#define	dsStrStart		(100+zlib1222add)
+#define	dsMatchStart		(104+zlib1222add)
+#define	dsLookahead		(108+zlib1222add)
+#define	dsPrevLen		(112+zlib1222add)
+#define	dsMaxChainLen		(116+zlib1222add)
+#define	dsGoodMatch		(132+zlib1222add)
+#define	dsNiceMatch		(136+zlib1222add)
+
+
+.file "match.S"
+
+.globl	match_init, longest_match
+
+.text
+
+/* uInt longest_match(deflate_state *deflatestate, IPos curmatch) */
+
+longest_match:
+
+/* Save registers that the compiler may be using, and adjust %esp to	*/
+/* make room for our stack frame.					*/
+
+		pushl	%ebp
+		pushl	%edi
+		pushl	%esi
+		pushl	%ebx
+		subl	$LocalVarsSize, %esp
+
+/* Retrieve the function arguments. %ecx will hold cur_match		*/
+/* throughout the entire function. %edx will hold the pointer to the	*/
+/* deflate_state structure during the function's setup (before		*/
+/* entering the main loop).						*/
+
+		movl	deflatestate(%esp), %edx
+		movl	curmatch(%esp), %ecx
+
+/* uInt wmask = s->w_mask;						*/
+/* unsigned chain_length = s->max_chain_length;				*/
+/* if (s->prev_length >= s->good_match) {				*/
+/*     chain_length >>= 2;						*/
+/* }									*/
+
+		movl	dsPrevLen(%edx), %eax
+		movl	dsGoodMatch(%edx), %ebx
+		cmpl	%ebx, %eax
+		movl	dsWMask(%edx), %eax
+		movl	dsMaxChainLen(%edx), %ebx
+		jl	LastMatchGood
+		shrl	$2, %ebx
+LastMatchGood:
+
+/* chainlen is decremented once beforehand so that the function can	*/
+/* use the sign flag instead of the zero flag for the exit test.	*/
+/* It is then shifted into the high word, to make room for the wmask	*/
+/* value, which it will always accompany.				*/
+
+		decl	%ebx
+		shll	$16, %ebx
+		orl	%eax, %ebx
+		movl	%ebx, chainlenwmask(%esp)
+
+/* if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;	*/
+
+		movl	dsNiceMatch(%edx), %eax
+		movl	dsLookahead(%edx), %ebx
+		cmpl	%eax, %ebx
+		jl	LookaheadLess
+		movl	%eax, %ebx
+LookaheadLess:	movl	%ebx, nicematch(%esp)
+
+/* register Bytef *scan = s->window + s->strstart;			*/
+
+		movl	dsWindow(%edx), %esi
+		movl	%esi, window(%esp)
+		movl	dsStrStart(%edx), %ebp
+		lea	(%esi,%ebp), %edi
+		movl	%edi, scan(%esp)
+
+/* Determine how many bytes the scan ptr is off from being		*/
+/* dword-aligned.							*/
+
+		movl	%edi, %eax
+		negl	%eax
+		andl	$3, %eax
+		movl	%eax, scanalign(%esp)
+
+/* IPos limit = s->strstart > (IPos)MAX_DIST(s) ?			*/
+/*     s->strstart - (IPos)MAX_DIST(s) : NIL;				*/
+
+		movl	dsWSize(%edx), %eax
+		subl	$MIN_LOOKAHEAD, %eax
+		subl	%eax, %ebp
+		jg	LimitPositive
+		xorl	%ebp, %ebp
+LimitPositive:
+
+/* int best_len = s->prev_length;					*/
+
+		movl	dsPrevLen(%edx), %eax
+		movl	%eax, bestlen(%esp)
+
+/* Store the sum of s->window + best_len in %esi locally, and in %esi.	*/
+
+		addl	%eax, %esi
+		movl	%esi, windowbestlen(%esp)
+
+/* register ush scan_start = *(ushf*)scan;				*/
+/* register ush scan_end   = *(ushf*)(scan+best_len-1);			*/
+/* Posf *prev = s->prev;						*/
+
+		movzwl	(%edi), %ebx
+		movl	%ebx, scanstart(%esp)
+		movzwl	-1(%edi,%eax), %ebx
+		movl	%ebx, scanend(%esp)
+		movl	dsPrev(%edx), %edi
+
+/* Jump into the main loop.						*/
+
+		movl	chainlenwmask(%esp), %edx
+		jmp	LoopEntry
+
+.balign 16
+
+/* do {
+ *     match = s->window + cur_match;
+ *     if (*(ushf*)(match+best_len-1) != scan_end ||
+ *         *(ushf*)match != scan_start) continue;
+ *     [...]
+ * } while ((cur_match = prev[cur_match & wmask]) > limit
+ *          && --chain_length != 0);
+ *
+ * Here is the inner loop of the function. The function will spend the
+ * majority of its time in this loop, and majority of that time will
+ * be spent in the first ten instructions.
+ *
+ * Within this loop:
+ * %ebx = scanend
+ * %ecx = curmatch
+ * %edx = chainlenwmask - i.e., ((chainlen << 16) | wmask)
+ * %esi = windowbestlen - i.e., (window + bestlen)
+ * %edi = prev
+ * %ebp = limit
+ */
+LookupLoop:
+		andl	%edx, %ecx
+		movzwl	(%edi,%ecx,2), %ecx
+		cmpl	%ebp, %ecx
+		jbe	LeaveNow
+		subl	$0x00010000, %edx
+		js	LeaveNow
+LoopEntry:	movzwl	-1(%esi,%ecx), %eax
+		cmpl	%ebx, %eax
+		jnz	LookupLoop
+		movl	window(%esp), %eax
+		movzwl	(%eax,%ecx), %eax
+		cmpl	scanstart(%esp), %eax
+		jnz	LookupLoop
+
+/* Store the current value of chainlen.					*/
+
+		movl	%edx, chainlenwmask(%esp)
+
+/* Point %edi to the string under scrutiny, and %esi to the string we	*/
+/* are hoping to match it up with. In actuality, %esi and %edi are	*/
+/* both pointed (MAX_MATCH_8 - scanalign) bytes ahead, and %edx is	*/
+/* initialized to -(MAX_MATCH_8 - scanalign).				*/
+
+		movl	window(%esp), %esi
+		movl	scan(%esp), %edi
+		addl	%ecx, %esi
+		movl	scanalign(%esp), %eax
+		movl	$(-MAX_MATCH_8), %edx
+		lea	MAX_MATCH_8(%edi,%eax), %edi
+		lea	MAX_MATCH_8(%esi,%eax), %esi
+
+/* Test the strings for equality, 8 bytes at a time. At the end,
+ * adjust %edx so that it is offset to the exact byte that mismatched.
+ *
+ * We already know at this point that the first three bytes of the
+ * strings match each other, and they can be safely passed over before
+ * starting the compare loop. So what this code does is skip over 0-3
+ * bytes, as much as necessary in order to dword-align the %edi
+ * pointer. (%esi will still be misaligned three times out of four.)
+ *
+ * It should be confessed that this loop usually does not represent
+ * much of the total running time. Replacing it with a more
+ * straightforward "rep cmpsb" would not drastically degrade
+ * performance.
+ */
+LoopCmps:
+		movl	(%esi,%edx), %eax
+		xorl	(%edi,%edx), %eax
+		jnz	LeaveLoopCmps
+		movl	4(%esi,%edx), %eax
+		xorl	4(%edi,%edx), %eax
+		jnz	LeaveLoopCmps4
+		addl	$8, %edx
+		jnz	LoopCmps
+		jmp	LenMaximum
+LeaveLoopCmps4:	addl	$4, %edx
+LeaveLoopCmps:	testl	$0x0000FFFF, %eax
+		jnz	LenLower
+		addl	$2, %edx
+		shrl	$16, %eax
+LenLower:	subb	$1, %al
+		adcl	$0, %edx
+
+/* Calculate the length of the match. If it is longer than MAX_MATCH,	*/
+/* then automatically accept it as the best possible match and leave.	*/
+
+		lea	(%edi,%edx), %eax
+		movl	scan(%esp), %edi
+		subl	%edi, %eax
+		cmpl	$MAX_MATCH, %eax
+		jge	LenMaximum
+
+/* If the length of the match is not longer than the best match we	*/
+/* have so far, then forget it and return to the lookup loop.		*/
+
+		movl	deflatestate(%esp), %edx
+		movl	bestlen(%esp), %ebx
+		cmpl	%ebx, %eax
+		jg	LongerMatch
+		movl	windowbestlen(%esp), %esi
+		movl	dsPrev(%edx), %edi
+		movl	scanend(%esp), %ebx
+		movl	chainlenwmask(%esp), %edx
+		jmp	LookupLoop
+
+/*         s->match_start = cur_match;					*/
+/*         best_len = len;						*/
+/*         if (len >= nice_match) break;				*/
+/*         scan_end = *(ushf*)(scan+best_len-1);			*/
+
+LongerMatch:	movl	nicematch(%esp), %ebx
+		movl	%eax, bestlen(%esp)
+		movl	%ecx, dsMatchStart(%edx)
+		cmpl	%ebx, %eax
+		jge	LeaveNow
+		movl	window(%esp), %esi
+		addl	%eax, %esi
+		movl	%esi, windowbestlen(%esp)
+		movzwl	-1(%edi,%eax), %ebx
+		movl	dsPrev(%edx), %edi
+		movl	%ebx, scanend(%esp)
+		movl	chainlenwmask(%esp), %edx
+		jmp	LookupLoop
+
+/* Accept the current string, with the maximum possible length.		*/
+
+LenMaximum:	movl	deflatestate(%esp), %edx
+		movl	$MAX_MATCH, bestlen(%esp)
+		movl	%ecx, dsMatchStart(%edx)
+
+/* if ((uInt)best_len <= s->lookahead) return (uInt)best_len;		*/
+/* return s->lookahead;							*/
+
+LeaveNow:
+		movl	deflatestate(%esp), %edx
+		movl	bestlen(%esp), %ebx
+		movl	dsLookahead(%edx), %eax
+		cmpl	%eax, %ebx
+		jg	LookaheadRet
+		movl	%ebx, %eax
+LookaheadRet:
+
+/* Restore the stack and return from whence we came.			*/
+
+		addl	$LocalVarsSize, %esp
+		popl	%ebx
+		popl	%esi
+		popl	%edi
+		popl	%ebp
+match_init:	ret
diff --git a/updater/zlib123/contrib/blast/Makefile b/updater/zlib123/contrib/blast/Makefile
new file mode 100644
index 0000000..861cf16
--- /dev/null
+++ b/updater/zlib123/contrib/blast/Makefile
@@ -0,0 +1,8 @@
+blast: blast.c blast.h
+	cc -DTEST -o blast blast.c
+
+test: blast
+	blast < test.pk | cmp - test.txt
+
+clean:
+	rm -f blast blast.o
diff --git a/updater/zlib123/contrib/blast/README b/updater/zlib123/contrib/blast/README
new file mode 100644
index 0000000..f6a27eb
--- /dev/null
+++ b/updater/zlib123/contrib/blast/README
@@ -0,0 +1,4 @@
+Read blast.h for purpose and usage.
+
+Mark Adler
+madler@alumni.caltech.edu
diff --git a/updater/zlib123/contrib/blast/blast.c b/updater/zlib123/contrib/blast/blast.c
new file mode 100644
index 0000000..add26f7
--- /dev/null
+++ b/updater/zlib123/contrib/blast/blast.c
@@ -0,0 +1,444 @@
+/* blast.c
+ * Copyright (C) 2003 Mark Adler
+ * For conditions of distribution and use, see copyright notice in blast.h
+ * version 1.1, 16 Feb 2003
+ *
+ * blast.c decompresses data compressed by the PKWare Compression Library.
+ * This function provides functionality similar to the explode() function of
+ * the PKWare library, hence the name "blast".
+ *
+ * This decompressor is based on the excellent format description provided by
+ * Ben Rudiak-Gould in comp.compression on August 13, 2001.  Interestingly, the
+ * example Ben provided in the post is incorrect.  The distance 110001 should
+ * instead be 111000.  When corrected, the example byte stream becomes:
+ *
+ *    00 04 82 24 25 8f 80 7f
+ *
+ * which decompresses to "AIAIAIAIAIAIA" (without the quotes).
+ */
+
+/*
+ * Change history:
+ *
+ * 1.0  12 Feb 2003     - First version
+ * 1.1  16 Feb 2003     - Fixed distance check for > 4 GB uncompressed data
+ */
+
+#include <setjmp.h>             /* for setjmp(), longjmp(), and jmp_buf */
+#include "blast.h"              /* prototype for blast() */
+
+#define local static            /* for local function definitions */
+#define MAXBITS 13              /* maximum code length */
+#define MAXWIN 4096             /* maximum window size */
+
+/* input and output state */
+struct state {
+    /* input state */
+    blast_in infun;             /* input function provided by user */
+    void *inhow;                /* opaque information passed to infun() */
+    unsigned char *in;          /* next input location */
+    unsigned left;              /* available input at in */
+    int bitbuf;                 /* bit buffer */
+    int bitcnt;                 /* number of bits in bit buffer */
+
+    /* input limit error return state for bits() and decode() */
+    jmp_buf env;
+
+    /* output state */
+    blast_out outfun;           /* output function provided by user */
+    void *outhow;               /* opaque information passed to outfun() */
+    unsigned next;              /* index of next write location in out[] */
+    int first;                  /* true to check distances (for first 4K) */
+    unsigned char out[MAXWIN];  /* output buffer and sliding window */
+};
+
+/*
+ * Return need bits from the input stream.  This always leaves less than
+ * eight bits in the buffer.  bits() works properly for need == 0.
+ *
+ * Format notes:
+ *
+ * - Bits are stored in bytes from the least significant bit to the most
+ *   significant bit.  Therefore bits are dropped from the bottom of the bit
+ *   buffer, using shift right, and new bytes are appended to the top of the
+ *   bit buffer, using shift left.
+ */
+local int bits(struct state *s, int need)
+{
+    int val;            /* bit accumulator */
+
+    /* load at least need bits into val */
+    val = s->bitbuf;
+    while (s->bitcnt < need) {
+        if (s->left == 0) {
+            s->left = s->infun(s->inhow, &(s->in));
+            if (s->left == 0) longjmp(s->env, 1);       /* out of input */
+        }
+        val |= (int)(*(s->in)++) << s->bitcnt;          /* load eight bits */
+        s->left--;
+        s->bitcnt += 8;
+    }
+
+    /* drop need bits and update buffer, always zero to seven bits left */
+    s->bitbuf = val >> need;
+    s->bitcnt -= need;
+
+    /* return need bits, zeroing the bits above that */
+    return val & ((1 << need) - 1);
+}
+
+/*
+ * Huffman code decoding tables.  count[1..MAXBITS] is the number of symbols of
+ * each length, which for a canonical code are stepped through in order.
+ * symbol[] are the symbol values in canonical order, where the number of
+ * entries is the sum of the counts in count[].  The decoding process can be
+ * seen in the function decode() below.
+ */
+struct huffman {
+    short *count;       /* number of symbols of each length */
+    short *symbol;      /* canonically ordered symbols */
+};
+
+/*
+ * Decode a code from the stream s using huffman table h.  Return the symbol or
+ * a negative value if there is an error.  If all of the lengths are zero, i.e.
+ * an empty code, or if the code is incomplete and an invalid code is received,
+ * then -9 is returned after reading MAXBITS bits.
+ *
+ * Format notes:
+ *
+ * - The codes as stored in the compressed data are bit-reversed relative to
+ *   a simple integer ordering of codes of the same lengths.  Hence below the
+ *   bits are pulled from the compressed data one at a time and used to
+ *   build the code value reversed from what is in the stream in order to
+ *   permit simple integer comparisons for decoding.
+ *
+ * - The first code for the shortest length is all ones.  Subsequent codes of
+ *   the same length are simply integer decrements of the previous code.  When
+ *   moving up a length, a one bit is appended to the code.  For a complete
+ *   code, the last code of the longest length will be all zeros.  To support
+ *   this ordering, the bits pulled during decoding are inverted to apply the
+ *   more "natural" ordering starting with all zeros and incrementing.
+ */
+local int decode(struct state *s, struct huffman *h)
+{
+    int len;            /* current number of bits in code */
+    int code;           /* len bits being decoded */
+    int first;          /* first code of length len */
+    int count;          /* number of codes of length len */
+    int index;          /* index of first code of length len in symbol table */
+    int bitbuf;         /* bits from stream */
+    int left;           /* bits left in next or left to process */
+    short *next;        /* next number of codes */
+
+    bitbuf = s->bitbuf;
+    left = s->bitcnt;
+    code = first = index = 0;
+    len = 1;
+    next = h->count + 1;
+    while (1) {
+        while (left--) {
+            code |= (bitbuf & 1) ^ 1;   /* invert code */
+            bitbuf >>= 1;
+            count = *next++;
+            if (code < first + count) { /* if length len, return symbol */
+                s->bitbuf = bitbuf;
+                s->bitcnt = (s->bitcnt - len) & 7;
+                return h->symbol[index + (code - first)];
+            }
+            index += count;             /* else update for next length */
+            first += count;
+            first <<= 1;
+            code <<= 1;
+            len++;
+        }
+        left = (MAXBITS+1) - len;
+        if (left == 0) break;
+        if (s->left == 0) {
+            s->left = s->infun(s->inhow, &(s->in));
+            if (s->left == 0) longjmp(s->env, 1);       /* out of input */
+        }
+        bitbuf = *(s->in)++;
+        s->left--;
+        if (left > 8) left = 8;
+    }
+    return -9;                          /* ran out of codes */
+}
+
+/*
+ * Given a list of repeated code lengths rep[0..n-1], where each byte is a
+ * count (high four bits + 1) and a code length (low four bits), generate the
+ * list of code lengths.  This compaction reduces the size of the object code.
+ * Then given the list of code lengths length[0..n-1] representing a canonical
+ * Huffman code for n symbols, construct the tables required to decode those
+ * codes.  Those tables are the number of codes of each length, and the symbols
+ * sorted by length, retaining their original order within each length.  The
+ * return value is zero for a complete code set, negative for an over-
+ * subscribed code set, and positive for an incomplete code set.  The tables
+ * can be used if the return value is zero or positive, but they cannot be used
+ * if the return value is negative.  If the return value is zero, it is not
+ * possible for decode() using that table to return an error--any stream of
+ * enough bits will resolve to a symbol.  If the return value is positive, then
+ * it is possible for decode() using that table to return an error for received
+ * codes past the end of the incomplete lengths.
+ */
+local int construct(struct huffman *h, const unsigned char *rep, int n)
+{
+    int symbol;         /* current symbol when stepping through length[] */
+    int len;            /* current length when stepping through h->count[] */
+    int left;           /* number of possible codes left of current length */
+    short offs[MAXBITS+1];      /* offsets in symbol table for each length */
+    short length[256];  /* code lengths */
+
+    /* convert compact repeat counts into symbol bit length list */
+    symbol = 0;
+    do {
+        len = *rep++;
+        left = (len >> 4) + 1;
+        len &= 15;
+        do {
+            length[symbol++] = len;
+        } while (--left);
+    } while (--n);
+    n = symbol;
+
+    /* count number of codes of each length */
+    for (len = 0; len <= MAXBITS; len++)
+        h->count[len] = 0;
+    for (symbol = 0; symbol < n; symbol++)
+        (h->count[length[symbol]])++;   /* assumes lengths are within bounds */
+    if (h->count[0] == n)               /* no codes! */
+        return 0;                       /* complete, but decode() will fail */
+
+    /* check for an over-subscribed or incomplete set of lengths */
+    left = 1;                           /* one possible code of zero length */
+    for (len = 1; len <= MAXBITS; len++) {
+        left <<= 1;                     /* one more bit, double codes left */
+        left -= h->count[len];          /* deduct count from possible codes */
+        if (left < 0) return left;      /* over-subscribed--return negative */
+    }                                   /* left > 0 means incomplete */
+
+    /* generate offsets into symbol table for each length for sorting */
+    offs[1] = 0;
+    for (len = 1; len < MAXBITS; len++)
+        offs[len + 1] = offs[len] + h->count[len];
+
+    /*
+     * put symbols in table sorted by length, by symbol order within each
+     * length
+     */
+    for (symbol = 0; symbol < n; symbol++)
+        if (length[symbol] != 0)
+            h->symbol[offs[length[symbol]]++] = symbol;
+
+    /* return zero for complete set, positive for incomplete set */
+    return left;
+}
+
+/*
+ * Decode PKWare Compression Library stream.
+ *
+ * Format notes:
+ *
+ * - First byte is 0 if literals are uncoded or 1 if they are coded.  Second
+ *   byte is 4, 5, or 6 for the number of extra bits in the distance code.
+ *   This is the base-2 logarithm of the dictionary size minus six.
+ *
+ * - Compressed data is a combination of literals and length/distance pairs
+ *   terminated by an end code.  Literals are either Huffman coded or
+ *   uncoded bytes.  A length/distance pair is a coded length followed by a
+ *   coded distance to represent a string that occurs earlier in the
+ *   uncompressed data that occurs again at the current location.
+ *
+ * - A bit preceding a literal or length/distance pair indicates which comes
+ *   next, 0 for literals, 1 for length/distance.
+ *
+ * - If literals are uncoded, then the next eight bits are the literal, in the
+ *   normal bit order in th stream, i.e. no bit-reversal is needed. Similarly,
+ *   no bit reversal is needed for either the length extra bits or the distance
+ *   extra bits.
+ *
+ * - Literal bytes are simply written to the output.  A length/distance pair is
+ *   an instruction to copy previously uncompressed bytes to the output.  The
+ *   copy is from distance bytes back in the output stream, copying for length
+ *   bytes.
+ *
+ * - Distances pointing before the beginning of the output data are not
+ *   permitted.
+ *
+ * - Overlapped copies, where the length is greater than the distance, are
+ *   allowed and common.  For example, a distance of one and a length of 518
+ *   simply copies the last byte 518 times.  A distance of four and a length of
+ *   twelve copies the last four bytes three times.  A simple forward copy
+ *   ignoring whether the length is greater than the distance or not implements
+ *   this correctly.
+ */
+local int decomp(struct state *s)
+{
+    int lit;            /* true if literals are coded */
+    int dict;           /* log2(dictionary size) - 6 */
+    int symbol;         /* decoded symbol, extra bits for distance */
+    int len;            /* length for copy */
+    int dist;           /* distance for copy */
+    int copy;           /* copy counter */
+    unsigned char *from, *to;   /* copy pointers */
+    static int virgin = 1;                              /* build tables once */
+    static short litcnt[MAXBITS+1], litsym[256];        /* litcode memory */
+    static short lencnt[MAXBITS+1], lensym[16];         /* lencode memory */
+    static short distcnt[MAXBITS+1], distsym[64];       /* distcode memory */
+    static struct huffman litcode = {litcnt, litsym};   /* length code */
+    static struct huffman lencode = {lencnt, lensym};   /* length code */
+    static struct huffman distcode = {distcnt, distsym};/* distance code */
+        /* bit lengths of literal codes */
+    static const unsigned char litlen[] = {
+        11, 124, 8, 7, 28, 7, 188, 13, 76, 4, 10, 8, 12, 10, 12, 10, 8, 23, 8,
+        9, 7, 6, 7, 8, 7, 6, 55, 8, 23, 24, 12, 11, 7, 9, 11, 12, 6, 7, 22, 5,
+        7, 24, 6, 11, 9, 6, 7, 22, 7, 11, 38, 7, 9, 8, 25, 11, 8, 11, 9, 12,
+        8, 12, 5, 38, 5, 38, 5, 11, 7, 5, 6, 21, 6, 10, 53, 8, 7, 24, 10, 27,
+        44, 253, 253, 253, 252, 252, 252, 13, 12, 45, 12, 45, 12, 61, 12, 45,
+        44, 173};
+        /* bit lengths of length codes 0..15 */
+    static const unsigned char lenlen[] = {2, 35, 36, 53, 38, 23};
+        /* bit lengths of distance codes 0..63 */
+    static const unsigned char distlen[] = {2, 20, 53, 230, 247, 151, 248};
+    static const short base[16] = {     /* base for length codes */
+        3, 2, 4, 5, 6, 7, 8, 9, 10, 12, 16, 24, 40, 72, 136, 264};
+    static const char extra[16] = {     /* extra bits for length codes */
+        0, 0, 0, 0, 0, 0, 0, 0, 1, 2, 3, 4, 5, 6, 7, 8};
+
+    /* set up decoding tables (once--might not be thread-safe) */
+    if (virgin) {
+        construct(&litcode, litlen, sizeof(litlen));
+        construct(&lencode, lenlen, sizeof(lenlen));
+        construct(&distcode, distlen, sizeof(distlen));
+        virgin = 0;
+    }
+
+    /* read header */
+    lit = bits(s, 8);
+    if (lit > 1) return -1;
+    dict = bits(s, 8);
+    if (dict < 4 || dict > 6) return -2;
+
+    /* decode literals and length/distance pairs */
+    do {
+        if (bits(s, 1)) {
+            /* get length */
+            symbol = decode(s, &lencode);
+            len = base[symbol] + bits(s, extra[symbol]);
+            if (len == 519) break;              /* end code */
+
+            /* get distance */
+            symbol = len == 2 ? 2 : dict;
+            dist = decode(s, &distcode) << symbol;
+            dist += bits(s, symbol);
+            dist++;
+            if (s->first && dist > s->next)
+                return -3;              /* distance too far back */
+
+            /* copy length bytes from distance bytes back */
+            do {
+                to = s->out + s->next;
+                from = to - dist;
+                copy = MAXWIN;
+                if (s->next < dist) {
+                    from += copy;
+                    copy = dist;
+                }
+                copy -= s->next;
+                if (copy > len) copy = len;
+                len -= copy;
+                s->next += copy;
+                do {
+                    *to++ = *from++;
+                } while (--copy);
+                if (s->next == MAXWIN) {
+                    if (s->outfun(s->outhow, s->out, s->next)) return 1;
+                    s->next = 0;
+                    s->first = 0;
+                }
+            } while (len != 0);
+        }
+        else {
+            /* get literal and write it */
+            symbol = lit ? decode(s, &litcode) : bits(s, 8);
+            s->out[s->next++] = symbol;
+            if (s->next == MAXWIN) {
+                if (s->outfun(s->outhow, s->out, s->next)) return 1;
+                s->next = 0;
+                s->first = 0;
+            }
+        }
+    } while (1);
+    return 0;
+}
+
+/* See comments in blast.h */
+int blast(blast_in infun, void *inhow, blast_out outfun, void *outhow)
+{
+    struct state s;             /* input/output state */
+    int err;                    /* return value */
+
+    /* initialize input state */
+    s.infun = infun;
+    s.inhow = inhow;
+    s.left = 0;
+    s.bitbuf = 0;
+    s.bitcnt = 0;
+
+    /* initialize output state */
+    s.outfun = outfun;
+    s.outhow = outhow;
+    s.next = 0;
+    s.first = 1;
+
+    /* return if bits() or decode() tries to read past available input */
+    if (setjmp(s.env) != 0)             /* if came back here via longjmp(), */
+        err = 2;                        /*  then skip decomp(), return error */
+    else
+        err = decomp(&s);               /* decompress */
+
+    /* write any leftover output and update the error code if needed */
+    if (err != 1 && s.next && s.outfun(s.outhow, s.out, s.next) && err == 0)
+        err = 1;
+    return err;
+}
+
+#ifdef TEST
+/* Example of how to use blast() */
+#include <stdio.h>
+#include <stdlib.h>
+
+#define CHUNK 16384
+
+local unsigned inf(void *how, unsigned char **buf)
+{
+    static unsigned char hold[CHUNK];
+
+    *buf = hold;
+    return fread(hold, 1, CHUNK, (FILE *)how);
+}
+
+local int outf(void *how, unsigned char *buf, unsigned len)
+{
+    return fwrite(buf, 1, len, (FILE *)how) != len;
+}
+
+/* Decompress a PKWare Compression Library stream from stdin to stdout */
+int main(void)
+{
+    int ret, n;
+
+    /* decompress to stdout */
+    ret = blast(inf, stdin, outf, stdout);
+    if (ret != 0) fprintf(stderr, "blast error: %d\n", ret);
+
+    /* see if there are any leftover bytes */
+    n = 0;
+    while (getchar() != EOF) n++;
+    if (n) fprintf(stderr, "blast warning: %d unused bytes of input\n", n);
+
+    /* return blast() error code */
+    return ret;
+}
+#endif
diff --git a/updater/zlib123/contrib/blast/blast.h b/updater/zlib123/contrib/blast/blast.h
new file mode 100644
index 0000000..ae42528
--- /dev/null
+++ b/updater/zlib123/contrib/blast/blast.h
@@ -0,0 +1,71 @@
+/* blast.h -- interface for blast.c
+  Copyright (C) 2003 Mark Adler
+  version 1.1, 16 Feb 2003
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the author be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Mark Adler    madler@alumni.caltech.edu
+ */
+
+
+/*
+ * blast() decompresses the PKWare Data Compression Library (DCL) compressed
+ * format.  It provides the same functionality as the explode() function in
+ * that library.  (Note: PKWare overused the "implode" verb, and the format
+ * used by their library implode() function is completely different and
+ * incompatible with the implode compression method supported by PKZIP.)
+ */
+
+
+typedef unsigned (*blast_in)(void *how, unsigned char **buf);
+typedef int (*blast_out)(void *how, unsigned char *buf, unsigned len);
+/* Definitions for input/output functions passed to blast().  See below for
+ * what the provided functions need to do.
+ */
+
+
+int blast(blast_in infun, void *inhow, blast_out outfun, void *outhow);
+/* Decompress input to output using the provided infun() and outfun() calls.
+ * On success, the return value of blast() is zero.  If there is an error in
+ * the source data, i.e. it is not in the proper format, then a negative value
+ * is returned.  If there is not enough input available or there is not enough
+ * output space, then a positive error is returned.
+ *
+ * The input function is invoked: len = infun(how, &buf), where buf is set by
+ * infun() to point to the input buffer, and infun() returns the number of
+ * available bytes there.  If infun() returns zero, then blast() returns with
+ * an input error.  (blast() only asks for input if it needs it.)  inhow is for
+ * use by the application to pass an input descriptor to infun(), if desired.
+ *
+ * The output function is invoked: err = outfun(how, buf, len), where the bytes
+ * to be written are buf[0..len-1].  If err is not zero, then blast() returns
+ * with an output error.  outfun() is always called with len <= 4096.  outhow
+ * is for use by the application to pass an output descriptor to outfun(), if
+ * desired.
+ *
+ * The return codes are:
+ *
+ *   2:  ran out of input before completing decompression
+ *   1:  output error before completing decompression
+ *   0:  successful decompression
+ *  -1:  literal flag not zero or one
+ *  -2:  dictionary size not in 4..6
+ *  -3:  distance is too far back
+ *
+ * At the bottom of blast.c is an example program that uses blast() that can be
+ * compiled to produce a command-line decompression filter by defining TEST.
+ */
diff --git a/updater/zlib123/contrib/blast/test.pk b/updater/zlib123/contrib/blast/test.pk
new file mode 100644
index 0000000..be10b2b
--- /dev/null
+++ b/updater/zlib123/contrib/blast/test.pk
diff --git a/updater/zlib123/contrib/blast/test.txt b/updater/zlib123/contrib/blast/test.txt
new file mode 100644
index 0000000..bfdf1c5
--- /dev/null
+++ b/updater/zlib123/contrib/blast/test.txt
@@ -0,0 +1 @@
+AIAIAIAIAIAIA
+\ No newline at end of file
diff --git a/updater/zlib123/contrib/delphi/ZLib.pas b/updater/zlib123/contrib/delphi/ZLib.pas
new file mode 100644
index 0000000..9f1caa7
--- /dev/null
+++ b/updater/zlib123/contrib/delphi/ZLib.pas
@@ -0,0 +1,557 @@
+{*******************************************************}
+{                                                       }
+{       Borland Delphi Supplemental Components          }
+{       ZLIB Data Compression Interface Unit            }
+{                                                       }
+{       Copyright (c) 1997,99 Borland Corporation       }
+{                                                       }
+{*******************************************************}
+
+{ Updated for zlib 1.2.x by Cosmin Truta <cosmint@cs.ubbcluj.ro> }
+
+unit ZLib;
+
+interface
+
+uses SysUtils, Classes;
+
+type
+  TAlloc = function (AppData: Pointer; Items, Size: Integer): Pointer; cdecl;
+  TFree = procedure (AppData, Block: Pointer); cdecl;
+
+  // Internal structure.  Ignore.
+  TZStreamRec = packed record
+    next_in: PChar;       // next input byte
+    avail_in: Integer;    // number of bytes available at next_in
+    total_in: Longint;    // total nb of input bytes read so far
+
+    next_out: PChar;      // next output byte should be put here
+    avail_out: Integer;   // remaining free space at next_out
+    total_out: Longint;   // total nb of bytes output so far
+
+    msg: PChar;           // last error message, NULL if no error
+    internal: Pointer;    // not visible by applications
+
+    zalloc: TAlloc;       // used to allocate the internal state
+    zfree: TFree;         // used to free the internal state
+    AppData: Pointer;     // private data object passed to zalloc and zfree
+
+    data_type: Integer;   // best guess about the data type: ascii or binary
+    adler: Longint;       // adler32 value of the uncompressed data
+    reserved: Longint;    // reserved for future use
+  end;
+
+  // Abstract ancestor class
+  TCustomZlibStream = class(TStream)
+  private
+    FStrm: TStream;
+    FStrmPos: Integer;
+    FOnProgress: TNotifyEvent;
+    FZRec: TZStreamRec;
+    FBuffer: array [Word] of Char;
+  protected
+    procedure Progress(Sender: TObject); dynamic;
+    property OnProgress: TNotifyEvent read FOnProgress write FOnProgress;
+    constructor Create(Strm: TStream);
+  end;
+
+{ TCompressionStream compresses data on the fly as data is written to it, and
+  stores the compressed data to another stream.
+
+  TCompressionStream is write-only and strictly sequential. Reading from the
+  stream will raise an exception. Using Seek to move the stream pointer
+  will raise an exception.
+
+  Output data is cached internally, written to the output stream only when
+  the internal output buffer is full.  All pending output data is flushed
+  when the stream is destroyed.
+
+  The Position property returns the number of uncompressed bytes of
+  data that have been written to the stream so far.
+
+  CompressionRate returns the on-the-fly percentage by which the original
+  data has been compressed:  (1 - (CompressedBytes / UncompressedBytes)) * 100
+  If raw data size = 100 and compressed data size = 25, the CompressionRate
+  is 75%
+
+  The OnProgress event is called each time the output buffer is filled and
+  written to the output stream.  This is useful for updating a progress
+  indicator when you are writing a large chunk of data to the compression
+  stream in a single call.}
+
+
+  TCompressionLevel = (clNone, clFastest, clDefault, clMax);
+
+  TCompressionStream = class(TCustomZlibStream)
+  private
+    function GetCompressionRate: Single;
+  public
+    constructor Create(CompressionLevel: TCompressionLevel; Dest: TStream);
+    destructor Destroy; override;
+    function Read(var Buffer; Count: Longint): Longint; override;
+    function Write(const Buffer; Count: Longint): Longint; override;
+    function Seek(Offset: Longint; Origin: Word): Longint; override;
+    property CompressionRate: Single read GetCompressionRate;
+    property OnProgress;
+  end;
+
+{ TDecompressionStream decompresses data on the fly as data is read from it.
+
+  Compressed data comes from a separate source stream.  TDecompressionStream
+  is read-only and unidirectional; you can seek forward in the stream, but not
+  backwards.  The special case of setting the stream position to zero is
+  allowed.  Seeking forward decompresses data until the requested position in
+  the uncompressed data has been reached.  Seeking backwards, seeking relative
+  to the end of the stream, requesting the size of the stream, and writing to
+  the stream will raise an exception.
+
+  The Position property returns the number of bytes of uncompressed data that
+  have been read from the stream so far.
+
+  The OnProgress event is called each time the internal input buffer of
+  compressed data is exhausted and the next block is read from the input stream.
+  This is useful for updating a progress indicator when you are reading a
+  large chunk of data from the decompression stream in a single call.}
+
+  TDecompressionStream = class(TCustomZlibStream)
+  public
+    constructor Create(Source: TStream);
+    destructor Destroy; override;
+    function Read(var Buffer; Count: Longint): Longint; override;
+    function Write(const Buffer; Count: Longint): Longint; override;
+    function Seek(Offset: Longint; Origin: Word): Longint; override;
+    property OnProgress;
+  end;
+
+
+
+{ CompressBuf compresses data, buffer to buffer, in one call.
+   In: InBuf = ptr to compressed data
+       InBytes = number of bytes in InBuf
+  Out: OutBuf = ptr to newly allocated buffer containing decompressed data
+       OutBytes = number of bytes in OutBuf   }
+procedure CompressBuf(const InBuf: Pointer; InBytes: Integer;
+                      out OutBuf: Pointer; out OutBytes: Integer);
+
+
+{ DecompressBuf decompresses data, buffer to buffer, in one call.
+   In: InBuf = ptr to compressed data
+       InBytes = number of bytes in InBuf
+       OutEstimate = zero, or est. size of the decompressed data
+  Out: OutBuf = ptr to newly allocated buffer containing decompressed data
+       OutBytes = number of bytes in OutBuf   }
+procedure DecompressBuf(const InBuf: Pointer; InBytes: Integer;
+ OutEstimate: Integer; out OutBuf: Pointer; out OutBytes: Integer);
+
+{ DecompressToUserBuf decompresses data, buffer to buffer, in one call.
+   In: InBuf = ptr to compressed data
+       InBytes = number of bytes in InBuf
+  Out: OutBuf = ptr to user-allocated buffer to contain decompressed data
+       BufSize = number of bytes in OutBuf   }
+procedure DecompressToUserBuf(const InBuf: Pointer; InBytes: Integer;
+  const OutBuf: Pointer; BufSize: Integer);
+
+const
+  zlib_version = '1.2.3';
+
+type
+  EZlibError = class(Exception);
+  ECompressionError = class(EZlibError);
+  EDecompressionError = class(EZlibError);
+
+implementation
+
+uses ZLibConst;
+
+const
+  Z_NO_FLUSH      = 0;
+  Z_PARTIAL_FLUSH = 1;
+  Z_SYNC_FLUSH    = 2;
+  Z_FULL_FLUSH    = 3;
+  Z_FINISH        = 4;
+
+  Z_OK            = 0;
+  Z_STREAM_END    = 1;
+  Z_NEED_DICT     = 2;
+  Z_ERRNO         = (-1);
+  Z_STREAM_ERROR  = (-2);
+  Z_DATA_ERROR    = (-3);
+  Z_MEM_ERROR     = (-4);
+  Z_BUF_ERROR     = (-5);
+  Z_VERSION_ERROR = (-6);
+
+  Z_NO_COMPRESSION       =   0;
+  Z_BEST_SPEED           =   1;
+  Z_BEST_COMPRESSION     =   9;
+  Z_DEFAULT_COMPRESSION  = (-1);
+
+  Z_FILTERED            = 1;
+  Z_HUFFMAN_ONLY        = 2;
+  Z_RLE                 = 3;
+  Z_DEFAULT_STRATEGY    = 0;
+
+  Z_BINARY   = 0;
+  Z_ASCII    = 1;
+  Z_UNKNOWN  = 2;
+
+  Z_DEFLATED = 8;
+
+
+{$L adler32.obj}
+{$L compress.obj}
+{$L crc32.obj}
+{$L deflate.obj}
+{$L infback.obj}
+{$L inffast.obj}
+{$L inflate.obj}
+{$L inftrees.obj}
+{$L trees.obj}
+{$L uncompr.obj}
+{$L zutil.obj}
+
+procedure adler32; external;
+procedure compressBound; external;
+procedure crc32; external;
+procedure deflateInit2_; external;
+procedure deflateParams; external;
+
+function _malloc(Size: Integer): Pointer; cdecl;
+begin
+  Result := AllocMem(Size);
+end;
+
+procedure _free(Block: Pointer); cdecl;
+begin
+  FreeMem(Block);
+end;
+
+procedure _memset(P: Pointer; B: Byte; count: Integer); cdecl;
+begin
+  FillChar(P^, count, B);
+end;
+
+procedure _memcpy(dest, source: Pointer; count: Integer); cdecl;
+begin
+  Move(source^, dest^, count);
+end;
+
+
+
+// deflate compresses data
+function deflateInit_(var strm: TZStreamRec; level: Integer; version: PChar;
+  recsize: Integer): Integer; external;
+function deflate(var strm: TZStreamRec; flush: Integer): Integer; external;
+function deflateEnd(var strm: TZStreamRec): Integer; external;
+
+// inflate decompresses data
+function inflateInit_(var strm: TZStreamRec; version: PChar;
+  recsize: Integer): Integer; external;
+function inflate(var strm: TZStreamRec; flush: Integer): Integer; external;
+function inflateEnd(var strm: TZStreamRec): Integer; external;
+function inflateReset(var strm: TZStreamRec): Integer; external;
+
+
+function zlibAllocMem(AppData: Pointer; Items, Size: Integer): Pointer; cdecl;
+begin
+//  GetMem(Result, Items*Size);
+  Result := AllocMem(Items * Size);
+end;
+
+procedure zlibFreeMem(AppData, Block: Pointer); cdecl;
+begin
+  FreeMem(Block);
+end;
+
+{function zlibCheck(code: Integer): Integer;
+begin
+  Result := code;
+  if code < 0 then
+    raise EZlibError.Create('error');    //!!
+end;}
+
+function CCheck(code: Integer): Integer;
+begin
+  Result := code;
+  if code < 0 then
+    raise ECompressionError.Create('error'); //!!
+end;
+
+function DCheck(code: Integer): Integer;
+begin
+  Result := code;
+  if code < 0 then
+    raise EDecompressionError.Create('error');  //!!
+end;
+
+procedure CompressBuf(const InBuf: Pointer; InBytes: Integer;
+                      out OutBuf: Pointer; out OutBytes: Integer);
+var
+  strm: TZStreamRec;
+  P: Pointer;
+begin
+  FillChar(strm, sizeof(strm), 0);
+  strm.zalloc := zlibAllocMem;
+  strm.zfree := zlibFreeMem;
+  OutBytes := ((InBytes + (InBytes div 10) + 12) + 255) and not 255;
+  GetMem(OutBuf, OutBytes);
+  try
+    strm.next_in := InBuf;
+    strm.avail_in := InBytes;
+    strm.next_out := OutBuf;
+    strm.avail_out := OutBytes;
+    CCheck(deflateInit_(strm, Z_BEST_COMPRESSION, zlib_version, sizeof(strm)));
+    try
+      while CCheck(deflate(strm, Z_FINISH)) <> Z_STREAM_END do
+      begin
+        P := OutBuf;
+        Inc(OutBytes, 256);
+        ReallocMem(OutBuf, OutBytes);
+        strm.next_out := PChar(Integer(OutBuf) + (Integer(strm.next_out) - Integer(P)));
+        strm.avail_out := 256;
+      end;
+    finally
+      CCheck(deflateEnd(strm));
+    end;
+    ReallocMem(OutBuf, strm.total_out);
+    OutBytes := strm.total_out;
+  except
+    FreeMem(OutBuf);
+    raise
+  end;
+end;
+
+
+procedure DecompressBuf(const InBuf: Pointer; InBytes: Integer;
+  OutEstimate: Integer; out OutBuf: Pointer; out OutBytes: Integer);
+var
+  strm: TZStreamRec;
+  P: Pointer;
+  BufInc: Integer;
+begin
+  FillChar(strm, sizeof(strm), 0);
+  strm.zalloc := zlibAllocMem;
+  strm.zfree := zlibFreeMem;
+  BufInc := (InBytes + 255) and not 255;
+  if OutEstimate = 0 then
+    OutBytes := BufInc
+  else
+    OutBytes := OutEstimate;
+  GetMem(OutBuf, OutBytes);
+  try
+    strm.next_in := InBuf;
+    strm.avail_in := InBytes;
+    strm.next_out := OutBuf;
+    strm.avail_out := OutBytes;
+    DCheck(inflateInit_(strm, zlib_version, sizeof(strm)));
+    try
+      while DCheck(inflate(strm, Z_NO_FLUSH)) <> Z_STREAM_END do
+      begin
+        P := OutBuf;
+        Inc(OutBytes, BufInc);
+        ReallocMem(OutBuf, OutBytes);
+        strm.next_out := PChar(Integer(OutBuf) + (Integer(strm.next_out) - Integer(P)));
+        strm.avail_out := BufInc;
+      end;
+    finally
+      DCheck(inflateEnd(strm));
+    end;
+    ReallocMem(OutBuf, strm.total_out);
+    OutBytes := strm.total_out;
+  except
+    FreeMem(OutBuf);
+    raise
+  end;
+end;
+
+procedure DecompressToUserBuf(const InBuf: Pointer; InBytes: Integer;
+  const OutBuf: Pointer; BufSize: Integer);
+var
+  strm: TZStreamRec;
+begin
+  FillChar(strm, sizeof(strm), 0);
+  strm.zalloc := zlibAllocMem;
+  strm.zfree := zlibFreeMem;
+  strm.next_in := InBuf;
+  strm.avail_in := InBytes;
+  strm.next_out := OutBuf;
+  strm.avail_out := BufSize;
+  DCheck(inflateInit_(strm, zlib_version, sizeof(strm)));
+  try
+    if DCheck(inflate(strm, Z_FINISH)) <> Z_STREAM_END then
+      raise EZlibError.CreateRes(@sTargetBufferTooSmall);
+  finally
+    DCheck(inflateEnd(strm));
+  end;
+end;
+
+// TCustomZlibStream
+
+constructor TCustomZLibStream.Create(Strm: TStream);
+begin
+  inherited Create;
+  FStrm := Strm;
+  FStrmPos := Strm.Position;
+  FZRec.zalloc := zlibAllocMem;
+  FZRec.zfree := zlibFreeMem;
+end;
+
+procedure TCustomZLibStream.Progress(Sender: TObject);
+begin
+  if Assigned(FOnProgress) then FOnProgress(Sender);
+end;
+
+
+// TCompressionStream
+
+constructor TCompressionStream.Create(CompressionLevel: TCompressionLevel;
+  Dest: TStream);
+const
+  Levels: array [TCompressionLevel] of ShortInt =
+    (Z_NO_COMPRESSION, Z_BEST_SPEED, Z_DEFAULT_COMPRESSION, Z_BEST_COMPRESSION);
+begin
+  inherited Create(Dest);
+  FZRec.next_out := FBuffer;
+  FZRec.avail_out := sizeof(FBuffer);
+  CCheck(deflateInit_(FZRec, Levels[CompressionLevel], zlib_version, sizeof(FZRec)));
+end;
+
+destructor TCompressionStream.Destroy;
+begin
+  FZRec.next_in := nil;
+  FZRec.avail_in := 0;
+  try
+    if FStrm.Position <> FStrmPos then FStrm.Position := FStrmPos;
+    while (CCheck(deflate(FZRec, Z_FINISH)) <> Z_STREAM_END)
+      and (FZRec.avail_out = 0) do
+    begin
+      FStrm.WriteBuffer(FBuffer, sizeof(FBuffer));
+      FZRec.next_out := FBuffer;
+      FZRec.avail_out := sizeof(FBuffer);
+    end;
+    if FZRec.avail_out < sizeof(FBuffer) then
+      FStrm.WriteBuffer(FBuffer, sizeof(FBuffer) - FZRec.avail_out);
+  finally
+    deflateEnd(FZRec);
+  end;
+  inherited Destroy;
+end;
+
+function TCompressionStream.Read(var Buffer; Count: Longint): Longint;
+begin
+  raise ECompressionError.CreateRes(@sInvalidStreamOp);
+end;
+
+function TCompressionStream.Write(const Buffer; Count: Longint): Longint;
+begin
+  FZRec.next_in := @Buffer;
+  FZRec.avail_in := Count;
+  if FStrm.Position <> FStrmPos then FStrm.Position := FStrmPos;
+  while (FZRec.avail_in > 0) do
+  begin
+    CCheck(deflate(FZRec, 0));
+    if FZRec.avail_out = 0 then
+    begin
+      FStrm.WriteBuffer(FBuffer, sizeof(FBuffer));
+      FZRec.next_out := FBuffer;
+      FZRec.avail_out := sizeof(FBuffer);
+      FStrmPos := FStrm.Position;
+      Progress(Self);
+    end;
+  end;
+  Result := Count;
+end;
+
+function TCompressionStream.Seek(Offset: Longint; Origin: Word): Longint;
+begin
+  if (Offset = 0) and (Origin = soFromCurrent) then
+    Result := FZRec.total_in
+  else
+    raise ECompressionError.CreateRes(@sInvalidStreamOp);
+end;
+
+function TCompressionStream.GetCompressionRate: Single;
+begin
+  if FZRec.total_in = 0 then
+    Result := 0
+  else
+    Result := (1.0 - (FZRec.total_out / FZRec.total_in)) * 100.0;
+end;
+
+
+// TDecompressionStream
+
+constructor TDecompressionStream.Create(Source: TStream);
+begin
+  inherited Create(Source);
+  FZRec.next_in := FBuffer;
+  FZRec.avail_in := 0;
+  DCheck(inflateInit_(FZRec, zlib_version, sizeof(FZRec)));
+end;
+
+destructor TDecompressionStream.Destroy;
+begin
+  FStrm.Seek(-FZRec.avail_in, 1);
+  inflateEnd(FZRec);
+  inherited Destroy;
+end;
+
+function TDecompressionStream.Read(var Buffer; Count: Longint): Longint;
+begin
+  FZRec.next_out := @Buffer;
+  FZRec.avail_out := Count;
+  if FStrm.Position <> FStrmPos then FStrm.Position := FStrmPos;
+  while (FZRec.avail_out > 0) do
+  begin
+    if FZRec.avail_in = 0 then
+    begin
+      FZRec.avail_in := FStrm.Read(FBuffer, sizeof(FBuffer));
+      if FZRec.avail_in = 0 then
+      begin
+        Result := Count - FZRec.avail_out;
+        Exit;
+      end;
+      FZRec.next_in := FBuffer;
+      FStrmPos := FStrm.Position;
+      Progress(Self);
+    end;
+    CCheck(inflate(FZRec, 0));
+  end;
+  Result := Count;
+end;
+
+function TDecompressionStream.Write(const Buffer; Count: Longint): Longint;
+begin
+  raise EDecompressionError.CreateRes(@sInvalidStreamOp);
+end;
+
+function TDecompressionStream.Seek(Offset: Longint; Origin: Word): Longint;
+var
+  I: Integer;
+  Buf: array [0..4095] of Char;
+begin
+  if (Offset = 0) and (Origin = soFromBeginning) then
+  begin
+    DCheck(inflateReset(FZRec));
+    FZRec.next_in := FBuffer;
+    FZRec.avail_in := 0;
+    FStrm.Position := 0;
+    FStrmPos := 0;
+  end
+  else if ( (Offset >= 0) and (Origin = soFromCurrent)) or
+          ( ((Offset - FZRec.total_out) > 0) and (Origin = soFromBeginning)) then
+  begin
+    if Origin = soFromBeginning then Dec(Offset, FZRec.total_out);
+    if Offset > 0 then
+    begin
+      for I := 1 to Offset div sizeof(Buf) do
+        ReadBuffer(Buf, sizeof(Buf));
+      ReadBuffer(Buf, Offset mod sizeof(Buf));
+    end;
+  end
+  else
+    raise EDecompressionError.CreateRes(@sInvalidStreamOp);
+  Result := FZRec.total_out;
+end;
+
+
+end.
diff --git a/updater/zlib123/contrib/delphi/ZLibConst.pas b/updater/zlib123/contrib/delphi/ZLibConst.pas
new file mode 100644
index 0000000..9e9fa18
--- /dev/null
+++ b/updater/zlib123/contrib/delphi/ZLibConst.pas
@@ -0,0 +1,11 @@
+unit ZLibConst;
+
+interface
+
+resourcestring
+  sTargetBufferTooSmall = 'ZLib error: target buffer may be too small';
+  sInvalidStreamOp = 'Invalid stream operation';
+
+implementation
+
+end.
diff --git a/updater/zlib123/contrib/delphi/readme.txt b/updater/zlib123/contrib/delphi/readme.txt
new file mode 100644
index 0000000..5aed74e
--- /dev/null
+++ b/updater/zlib123/contrib/delphi/readme.txt
@@ -0,0 +1,76 @@
+
+Overview
+========
+
+This directory contains an update to the ZLib interface unit,
+distributed by Borland as a Delphi supplemental component.
+
+The original ZLib unit is Copyright (c) 1997,99 Borland Corp.,
+and is based on zlib version 1.0.4.  There are a series of bugs
+and security problems associated with that old zlib version, and
+we recommend the users to update their ZLib unit.
+
+
+Summary of modifications
+========================
+
+- Improved makefile, adapted to zlib version 1.2.1.
+
+- Some field types from TZStreamRec are changed from Integer to
+  Longint, for consistency with the zlib.h header, and for 64-bit
+  readiness.
+
+- The zlib_version constant is updated.
+
+- The new Z_RLE strategy has its corresponding symbolic constant.
+
+- The allocation and deallocation functions and function types
+  (TAlloc, TFree, zlibAllocMem and zlibFreeMem) are now cdecl,
+  and _malloc and _free are added as C RTL stubs.  As a result,
+  the original C sources of zlib can be compiled out of the box,
+  and linked to the ZLib unit.
+
+
+Suggestions for improvements
+============================
+
+Currently, the ZLib unit provides only a limited wrapper around
+the zlib library, and much of the original zlib functionality is
+missing.  Handling compressed file formats like ZIP/GZIP or PNG
+cannot be implemented without having this functionality.
+Applications that handle these formats are either using their own,
+duplicated code, or not using the ZLib unit at all.
+
+Here are a few suggestions:
+
+- Checksum class wrappers around adler32() and crc32(), similar
+  to the Java classes that implement the java.util.zip.Checksum
+  interface.
+
+- The ability to read and write raw deflate streams, without the
+  zlib stream header and trailer.  Raw deflate streams are used
+  in the ZIP file format.
+
+- The ability to read and write gzip streams, used in the GZIP
+  file format, and normally produced by the gzip program.
+
+- The ability to select a different compression strategy, useful
+  to PNG and MNG image compression, and to multimedia compression
+  in general.  Besides the compression level
+
+    TCompressionLevel = (clNone, clFastest, clDefault, clMax);
+
+  which, in fact, could have used the 'z' prefix and avoided
+  TColor-like symbols
+
+    TCompressionLevel = (zcNone, zcFastest, zcDefault, zcMax);
+
+  there could be a compression strategy
+
+    TCompressionStrategy = (zsDefault, zsFiltered, zsHuffmanOnly, zsRle);
+
+- ZIP and GZIP stream handling via TStreams.
+
+
+--
+Cosmin Truta <cosmint@cs.ubbcluj.ro>
diff --git a/updater/zlib123/contrib/delphi/zlibd32.mak b/updater/zlib123/contrib/delphi/zlibd32.mak
new file mode 100644
index 0000000..6fb10e4
--- /dev/null
+++ b/updater/zlib123/contrib/delphi/zlibd32.mak
@@ -0,0 +1,93 @@
+# Makefile for zlib
+# For use with Delphi and C++ Builder under Win32
+# Updated for zlib 1.2.x by Cosmin Truta
+
+# ------------ Borland C++ ------------
+
+# This project uses the Delphi (fastcall/register) calling convention:
+LOC = -DZEXPORT=__fastcall -DZEXPORTVA=__cdecl
+
+CC = bcc32
+LD = bcc32
+AR = tlib
+# do not use "-pr" in CFLAGS
+CFLAGS = -a -d -k- -O2 $(LOC)
+LDFLAGS =
+
+
+# variables
+ZLIB_LIB = zlib.lib
+
+OBJ1 = adler32.obj compress.obj crc32.obj deflate.obj gzio.obj infback.obj
+OBJ2 = inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
+OBJP1 = +adler32.obj+compress.obj+crc32.obj+deflate.obj+gzio.obj+infback.obj
+OBJP2 = +inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
+
+
+# targets
+all: $(ZLIB_LIB) example.exe minigzip.exe
+
+.c.obj:
+	$(CC) -c $(CFLAGS) $*.c
+
+adler32.obj: adler32.c zlib.h zconf.h
+
+compress.obj: compress.c zlib.h zconf.h
+
+crc32.obj: crc32.c zlib.h zconf.h crc32.h
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+
+infback.obj: infback.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+
+trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+
+example.obj: example.c zlib.h zconf.h
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+
+
+# For the sake of the old Borland make,
+# the command line is cut to fit in the MS-DOS 128 byte limit:
+$(ZLIB_LIB): $(OBJ1) $(OBJ2)
+	-del $(ZLIB_LIB)
+	$(AR) $(ZLIB_LIB) $(OBJP1)
+	$(AR) $(ZLIB_LIB) $(OBJP2)
+
+
+# testing
+test: example.exe minigzip.exe
+	example
+	echo hello world | minigzip | minigzip -d
+
+example.exe: example.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) example.obj $(ZLIB_LIB)
+
+minigzip.exe: minigzip.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) minigzip.obj $(ZLIB_LIB)
+
+
+# cleanup
+clean:
+	-del *.obj
+	-del *.exe
+	-del *.lib
+	-del *.tds
+	-del zlib.bak
+	-del foo.gz
+
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib.build b/updater/zlib123/contrib/dotzlib/DotZLib.build
new file mode 100644
index 0000000..ed19cc9
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib.build
@@ -0,0 +1,33 @@
+<?xml version="1.0" encoding="utf-8" ?>
+<project name="DotZLib" default="build" basedir="./DotZLib">
+	<description>A .Net wrapper library around ZLib1.dll</description>
+
+	<property name="nunit.location" value="c:/program files/NUnit V2.1/bin" />
+	<property name="build.root" value="bin" />
+	
+	<property name="debug" value="true" />
+	<property name="nunit" value="true" />
+
+	<property name="build.folder" value="${build.root}/debug/" if="${debug}" />
+	<property name="build.folder" value="${build.root}/release/" unless="${debug}" />
+
+	<target name="clean" description="Remove all generated files">
+		<delete dir="${build.root}" failonerror="false" />
+	</target>
+
+	<target name="build" description="compiles the source code">
+		
+		<mkdir dir="${build.folder}" />
+		<csc target="library" output="${build.folder}DotZLib.dll" debug="${debug}">
+			<references basedir="${nunit.location}">
+				<includes if="${nunit}" name="nunit.framework.dll" />
+			</references>
+			<sources>
+				<includes name="*.cs" />
+				<excludes name="UnitTests.cs" unless="${nunit}" />
+			</sources>
+			<arg value="/d:nunit" if="${nunit}" />
+		</csc>
+	</target>
+
+</project>
+\ No newline at end of file
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib.chm b/updater/zlib123/contrib/dotzlib/DotZLib.chm
new file mode 100644
index 0000000..0bc7df7
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib.chm
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib.sln b/updater/zlib123/contrib/dotzlib/DotZLib.sln
new file mode 100644
index 0000000..ac45ca0
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib.sln
@@ -0,0 +1,21 @@
+Microsoft Visual Studio Solution File, Format Version 8.00
+Project("{FAE04EC0-301F-11D3-BF4B-00C04F79EFBC}") = "DotZLib", "DotZLib\DotZLib.csproj", "{BB1EE0B1-1808-46CB-B786-949D91117FC5}"
+	ProjectSection(ProjectDependencies) = postProject
+	EndProjectSection
+EndProject
+Global
+	GlobalSection(SolutionConfiguration) = preSolution
+		Debug = Debug
+		Release = Release
+	EndGlobalSection
+	GlobalSection(ProjectConfiguration) = postSolution
+		{BB1EE0B1-1808-46CB-B786-949D91117FC5}.Debug.ActiveCfg = Debug|.NET
+		{BB1EE0B1-1808-46CB-B786-949D91117FC5}.Debug.Build.0 = Debug|.NET
+		{BB1EE0B1-1808-46CB-B786-949D91117FC5}.Release.ActiveCfg = Release|.NET
+		{BB1EE0B1-1808-46CB-B786-949D91117FC5}.Release.Build.0 = Release|.NET
+	EndGlobalSection
+	GlobalSection(ExtensibilityGlobals) = postSolution
+	EndGlobalSection
+	GlobalSection(ExtensibilityAddIns) = postSolution
+	EndGlobalSection
+EndGlobal
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib/AssemblyInfo.cs b/updater/zlib123/contrib/dotzlib/DotZLib/AssemblyInfo.cs
new file mode 100644
index 0000000..6fc0fdc
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib/AssemblyInfo.cs
@@ -0,0 +1,58 @@
+using System.Reflection;
+using System.Runtime.CompilerServices;
+
+//
+// General Information about an assembly is controlled through the following 
+// set of attributes. Change these attribute values to modify the information
+// associated with an assembly.
+//
+[assembly: AssemblyTitle("DotZLib")]
+[assembly: AssemblyDescription(".Net bindings for ZLib compression dll 1.2.x")]
+[assembly: AssemblyConfiguration("")]
+[assembly: AssemblyCompany("Henrik Ravn")]
+[assembly: AssemblyProduct("")]
+[assembly: AssemblyCopyright("(c) 2004 by Henrik Ravn")]
+[assembly: AssemblyTrademark("")]
+[assembly: AssemblyCulture("")]		
+
+//
+// Version information for an assembly consists of the following four values:
+//
+//      Major Version
+//      Minor Version 
+//      Build Number
+//      Revision
+//
+// You can specify all the values or you can default the Revision and Build Numbers 
+// by using the '*' as shown below:
+
+[assembly: AssemblyVersion("1.0.*")]
+
+//
+// In order to sign your assembly you must specify a key to use. Refer to the 
+// Microsoft .NET Framework documentation for more information on assembly signing.
+//
+// Use the attributes below to control which key is used for signing. 
+//
+// Notes: 
+//   (*) If no key is specified, the assembly is not signed.
+//   (*) KeyName refers to a key that has been installed in the Crypto Service
+//       Provider (CSP) on your machine. KeyFile refers to a file which contains
+//       a key.
+//   (*) If the KeyFile and the KeyName values are both specified, the 
+//       following processing occurs:
+//       (1) If the KeyName can be found in the CSP, that key is used.
+//       (2) If the KeyName does not exist and the KeyFile does exist, the key 
+//           in the KeyFile is installed into the CSP and used.
+//   (*) In order to create a KeyFile, you can use the sn.exe (Strong Name) utility.
+//       When specifying the KeyFile, the location of the KeyFile should be
+//       relative to the project output directory which is
+//       %Project Directory%\obj\<configuration>. For example, if your KeyFile is
+//       located in the project directory, you would specify the AssemblyKeyFile 
+//       attribute as [assembly: AssemblyKeyFile("..\\..\\mykey.snk")]
+//   (*) Delay Signing is an advanced option - see the Microsoft .NET Framework
+//       documentation for more information on this.
+//
+[assembly: AssemblyDelaySign(false)]
+[assembly: AssemblyKeyFile("")]
+[assembly: AssemblyKeyName("")]
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib/ChecksumImpl.cs b/updater/zlib123/contrib/dotzlib/DotZLib/ChecksumImpl.cs
new file mode 100644
index 0000000..dfe7e90
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib/ChecksumImpl.cs
@@ -0,0 +1,202 @@
+//
+// � Copyright Henrik Ravn 2004
+//
+// Use, modification and distribution are subject to the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//
+
+using System;
+using System.Runtime.InteropServices;
+using System.Text;
+
+
+namespace DotZLib
+{
+    #region ChecksumGeneratorBase
+    /// <summary>
+    /// Implements the common functionality needed for all <see cref="ChecksumGenerator"/>s
+    /// </summary>
+    /// <example></example>
+    public abstract class ChecksumGeneratorBase : ChecksumGenerator
+    {
+        /// <summary>
+        /// The value of the current checksum
+        /// </summary>
+        protected uint _current;
+
+        /// <summary>
+        /// Initializes a new instance of the checksum generator base - the current checksum is 
+        /// set to zero
+        /// </summary>
+        public ChecksumGeneratorBase()
+        {
+            _current = 0;
+        }
+
+        /// <summary>
+        /// Initializes a new instance of the checksum generator basewith a specified value
+        /// </summary>
+        /// <param name="initialValue">The value to set the current checksum to</param>
+        public ChecksumGeneratorBase(uint initialValue)
+        {
+            _current = initialValue;
+        }
+
+        /// <summary>
+        /// Resets the current checksum to zero
+        /// </summary>
+        public void Reset() { _current = 0; }
+
+        /// <summary>
+        /// Gets the current checksum value
+        /// </summary>
+        public uint Value { get { return _current; } }
+
+        /// <summary>
+        /// Updates the current checksum with part of an array of bytes
+        /// </summary>
+        /// <param name="data">The data to update the checksum with</param>
+        /// <param name="offset">Where in <c>data</c> to start updating</param>
+        /// <param name="count">The number of bytes from <c>data</c> to use</param>
+        /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
+        /// <exception cref="NullReferenceException"><c>data</c> is a null reference</exception>
+        /// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
+        /// <remarks>All the other <c>Update</c> methods are implmeneted in terms of this one. 
+        /// This is therefore the only method a derived class has to implement</remarks>
+        public abstract void Update(byte[] data, int offset, int count);
+
+        /// <summary>
+        /// Updates the current checksum with an array of bytes.
+        /// </summary>
+        /// <param name="data">The data to update the checksum with</param>
+        public void Update(byte[] data)
+        {
+            Update(data, 0, data.Length);
+        }
+
+        /// <summary>
+        /// Updates the current checksum with the data from a string
+        /// </summary>
+        /// <param name="data">The string to update the checksum with</param>
+        /// <remarks>The characters in the string are converted by the UTF-8 encoding</remarks>
+        public void Update(string data)
+        {
+			Update(Encoding.UTF8.GetBytes(data));
+        }
+
+        /// <summary>
+        /// Updates the current checksum with the data from a string, using a specific encoding
+        /// </summary>
+        /// <param name="data">The string to update the checksum with</param>
+        /// <param name="encoding">The encoding to use</param>
+        public void Update(string data, Encoding encoding)
+        {
+            Update(encoding.GetBytes(data));
+        }
+
+    }
+    #endregion
+
+    #region CRC32
+    /// <summary>
+    /// Implements a CRC32 checksum generator
+    /// </summary>
+    public sealed class CRC32Checksum : ChecksumGeneratorBase    
+    {
+        #region DLL imports
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern uint crc32(uint crc, int data, uint length);
+
+        #endregion
+
+        /// <summary>
+        /// Initializes a new instance of the CRC32 checksum generator
+        /// </summary>
+        public CRC32Checksum() : base() {}
+
+        /// <summary>
+        /// Initializes a new instance of the CRC32 checksum generator with a specified value
+        /// </summary>
+        /// <param name="initialValue">The value to set the current checksum to</param>
+        public CRC32Checksum(uint initialValue) : base(initialValue) {}
+
+        /// <summary>
+        /// Updates the current checksum with part of an array of bytes
+        /// </summary>
+        /// <param name="data">The data to update the checksum with</param>
+        /// <param name="offset">Where in <c>data</c> to start updating</param>
+        /// <param name="count">The number of bytes from <c>data</c> to use</param>
+        /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
+        /// <exception cref="NullReferenceException"><c>data</c> is a null reference</exception>
+        /// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
+        public override void Update(byte[] data, int offset, int count)
+        {
+            if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
+            if ((offset+count) > data.Length) throw new ArgumentException();
+            GCHandle hData = GCHandle.Alloc(data, GCHandleType.Pinned);
+            try
+            {
+                _current = crc32(_current, hData.AddrOfPinnedObject().ToInt32()+offset, (uint)count);
+            }
+            finally
+            {
+                hData.Free();
+            }
+        }
+
+    }
+    #endregion
+
+    #region Adler
+    /// <summary>
+    /// Implements a checksum generator that computes the Adler checksum on data
+    /// </summary>
+    public sealed class AdlerChecksum : ChecksumGeneratorBase    
+    {
+        #region DLL imports
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern uint adler32(uint adler, int data, uint length);
+
+        #endregion
+
+        /// <summary>
+        /// Initializes a new instance of the Adler checksum generator
+        /// </summary>
+        public AdlerChecksum() : base() {}
+
+        /// <summary>
+        /// Initializes a new instance of the Adler checksum generator with a specified value
+        /// </summary>
+        /// <param name="initialValue">The value to set the current checksum to</param>
+        public AdlerChecksum(uint initialValue) : base(initialValue) {}
+
+        /// <summary>
+        /// Updates the current checksum with part of an array of bytes
+        /// </summary>
+        /// <param name="data">The data to update the checksum with</param>
+        /// <param name="offset">Where in <c>data</c> to start updating</param>
+        /// <param name="count">The number of bytes from <c>data</c> to use</param>
+        /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
+        /// <exception cref="NullReferenceException"><c>data</c> is a null reference</exception>
+        /// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
+        public override void Update(byte[] data, int offset, int count)
+        {
+            if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
+            if ((offset+count) > data.Length) throw new ArgumentException();
+            GCHandle hData = GCHandle.Alloc(data, GCHandleType.Pinned);
+            try
+            {
+                _current = adler32(_current, hData.AddrOfPinnedObject().ToInt32()+offset, (uint)count);
+            }
+            finally
+            {
+                hData.Free();
+            }
+        }
+
+    }
+    #endregion
+
+}
+\ No newline at end of file
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib/CircularBuffer.cs b/updater/zlib123/contrib/dotzlib/DotZLib/CircularBuffer.cs
new file mode 100644
index 0000000..16997e9
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib/CircularBuffer.cs
@@ -0,0 +1,83 @@
+//
+// � Copyright Henrik Ravn 2004
+//
+// Use, modification and distribution are subject to the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//
+
+using System;
+using System.Diagnostics;
+
+namespace DotZLib
+{
+
+	/// <summary>
+	/// This class implements a circular buffer
+	/// </summary>
+	internal class CircularBuffer
+	{
+        #region Private data
+        private int _capacity;
+        private int _head;
+        private int _tail;
+        private int _size;
+        private byte[] _buffer;
+        #endregion
+
+        public CircularBuffer(int capacity)
+        {    
+            Debug.Assert( capacity > 0 );
+            _buffer = new byte[capacity];
+            _capacity = capacity;
+            _head = 0;
+            _tail = 0;
+            _size = 0;
+        }
+
+        public int Size { get { return _size; } }
+
+        public int Put(byte[] source, int offset, int count)
+        {
+            Debug.Assert( count > 0 );
+            int trueCount = Math.Min(count, _capacity - Size);
+            for (int i = 0; i < trueCount; ++i)
+                _buffer[(_tail+i) % _capacity] = source[offset+i];
+            _tail += trueCount;
+            _tail %= _capacity;
+            _size += trueCount;
+            return trueCount;
+        }
+
+        public bool Put(byte b)
+        {
+            if (Size == _capacity) // no room
+                return false;
+            _buffer[_tail++] = b;
+            _tail %= _capacity;
+            ++_size;
+            return true;
+        }
+
+        public int Get(byte[] destination, int offset, int count)
+        {
+            int trueCount = Math.Min(count,Size);
+            for (int i = 0; i < trueCount; ++i)
+                destination[offset + i] = _buffer[(_head+i) % _capacity];
+            _head += trueCount;
+            _head %= _capacity;
+            _size -= trueCount;
+            return trueCount;
+        }
+
+        public int Get()
+        {
+            if (Size == 0)
+                return -1;
+
+            int result = (int)_buffer[_head++ % _capacity];
+            --_size;
+            return result;
+        }
+
+    }
+}
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib/CodecBase.cs b/updater/zlib123/contrib/dotzlib/DotZLib/CodecBase.cs
new file mode 100644
index 0000000..954db7d
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib/CodecBase.cs
@@ -0,0 +1,198 @@
+//
+// � Copyright Henrik Ravn 2004
+//
+// Use, modification and distribution are subject to the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//
+
+using System;
+using System.Runtime.InteropServices;
+
+namespace DotZLib
+{
+	/// <summary>
+	/// Implements the common functionality needed for all <see cref="Codec"/>s
+	/// </summary>
+	public abstract class CodecBase : Codec, IDisposable
+	{
+
+        #region Data members
+
+        /// <summary>
+        /// Instance of the internal zlib buffer structure that is 
+        /// passed to all functions in the zlib dll
+        /// </summary>
+        internal ZStream _ztream = new ZStream();
+
+        /// <summary>
+        /// True if the object instance has been disposed, false otherwise
+        /// </summary>
+        protected bool _isDisposed = false;
+
+        /// <summary>
+        /// The size of the internal buffers
+        /// </summary>
+        protected const int kBufferSize = 16384;
+
+        private byte[] _outBuffer = new byte[kBufferSize];
+        private byte[] _inBuffer = new byte[kBufferSize];
+
+        private GCHandle _hInput;
+        private GCHandle _hOutput;
+
+        private uint _checksum = 0;
+
+        #endregion
+
+        /// <summary>
+        /// Initializes a new instance of the <c>CodeBase</c> class. 
+        /// </summary>
+		public CodecBase()
+		{
+            try
+            {
+                _hInput = GCHandle.Alloc(_inBuffer, GCHandleType.Pinned);
+                _hOutput = GCHandle.Alloc(_outBuffer, GCHandleType.Pinned);
+            }
+            catch (Exception)
+            {
+                CleanUp(false);
+                throw;
+            }
+        }
+
+
+        #region Codec Members
+
+        /// <summary>
+        /// Occurs when more processed data are available.
+        /// </summary>
+        public event DataAvailableHandler DataAvailable;
+
+        /// <summary>
+        /// Fires the <see cref="DataAvailable"/> event
+        /// </summary>
+        protected void OnDataAvailable()
+        {
+            if (_ztream.total_out > 0)
+            {
+                if (DataAvailable != null)
+                    DataAvailable( _outBuffer, 0, (int)_ztream.total_out); 
+                resetOutput();
+            }
+        }
+
+        /// <summary>
+        /// Adds more data to the codec to be processed.
+        /// </summary>
+        /// <param name="data">Byte array containing the data to be added to the codec</param>
+        /// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
+        public void Add(byte[] data)
+        {
+            Add(data,0,data.Length);
+        }
+
+        /// <summary>
+        /// Adds more data to the codec to be processed.
+        /// </summary>
+        /// <param name="data">Byte array containing the data to be added to the codec</param>
+        /// <param name="offset">The index of the first byte to add from <c>data</c></param>
+        /// <param name="count">The number of bytes to add</param>
+        /// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
+        /// <remarks>This must be implemented by a derived class</remarks>
+        public abstract void Add(byte[] data, int offset, int count);
+
+        /// <summary>
+        /// Finishes up any pending data that needs to be processed and handled.
+        /// </summary>
+        /// <remarks>This must be implemented by a derived class</remarks>
+        public abstract void Finish();
+
+        /// <summary>
+        /// Gets the checksum of the data that has been added so far
+        /// </summary>
+        public uint Checksum { get { return _checksum; } }
+
+        #endregion
+
+        #region Destructor & IDisposable stuff
+
+        /// <summary>
+        /// Destroys this instance
+        /// </summary>
+        ~CodecBase()
+        {
+            CleanUp(false);
+        }
+
+        /// <summary>
+        /// Releases any unmanaged resources and calls the <see cref="CleanUp()"/> method of the derived class
+        /// </summary>
+        public void Dispose()
+        {
+            CleanUp(true);
+        }
+
+        /// <summary>
+        /// Performs any codec specific cleanup
+        /// </summary>
+        /// <remarks>This must be implemented by a derived class</remarks>
+        protected abstract void CleanUp();
+
+        // performs the release of the handles and calls the dereived CleanUp()
+        private void CleanUp(bool isDisposing)
+        {
+            if (!_isDisposed)
+            {
+                CleanUp();
+                if (_hInput.IsAllocated)
+                    _hInput.Free();
+                if (_hOutput.IsAllocated)
+                    _hOutput.Free();
+
+                _isDisposed = true;
+            }
+        }
+
+
+        #endregion
+
+        #region Helper methods
+
+        /// <summary>
+        /// Copies a number of bytes to the internal codec buffer - ready for proccesing
+        /// </summary>
+        /// <param name="data">The byte array that contains the data to copy</param>
+        /// <param name="startIndex">The index of the first byte to copy</param>
+        /// <param name="count">The number of bytes to copy from <c>data</c></param>
+        protected void copyInput(byte[] data, int startIndex, int count)
+        {
+            Array.Copy(data, startIndex, _inBuffer,0, count);
+            _ztream.next_in = _hInput.AddrOfPinnedObject();
+            _ztream.total_in = 0;
+            _ztream.avail_in = (uint)count;
+
+        }
+
+        /// <summary>
+        /// Resets the internal output buffers to a known state - ready for processing
+        /// </summary>
+        protected void resetOutput()
+        {
+            _ztream.total_out = 0;
+            _ztream.avail_out = kBufferSize;
+            _ztream.next_out = _hOutput.AddrOfPinnedObject();
+        }
+
+        /// <summary>
+        /// Updates the running checksum property
+        /// </summary>
+        /// <param name="newSum">The new checksum value</param>
+        protected void setChecksum(uint newSum)
+        {
+            _checksum = newSum;
+        }
+        #endregion
+
+    }
+}
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib/Deflater.cs b/updater/zlib123/contrib/dotzlib/DotZLib/Deflater.cs
new file mode 100644
index 0000000..d7b8dcc
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib/Deflater.cs
@@ -0,0 +1,106 @@
+//
+// � Copyright Henrik Ravn 2004
+//
+// Use, modification and distribution are subject to the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//
+
+using System;
+using System.Diagnostics;
+using System.Runtime.InteropServices;
+
+namespace DotZLib
+{
+
+    /// <summary>
+    /// Implements a data compressor, using the deflate algorithm in the ZLib dll
+    /// </summary>
+	public sealed class Deflater : CodecBase
+	{
+        #region Dll imports
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl, CharSet=CharSet.Ansi)]
+        private static extern int deflateInit_(ref ZStream sz, int level, string vs, int size);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int deflate(ref ZStream sz, int flush);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int deflateReset(ref ZStream sz);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int deflateEnd(ref ZStream sz);
+        #endregion
+
+        /// <summary>
+        /// Constructs an new instance of the <c>Deflater</c>
+        /// </summary>
+        /// <param name="level">The compression level to use for this <c>Deflater</c></param>
+		public Deflater(CompressLevel level) : base()
+		{
+            int retval = deflateInit_(ref _ztream, (int)level, Info.Version, Marshal.SizeOf(_ztream));
+            if (retval != 0)
+                throw new ZLibException(retval, "Could not initialize deflater");
+
+            resetOutput();
+		}
+
+        /// <summary>
+        /// Adds more data to the codec to be processed.
+        /// </summary>
+        /// <param name="data">Byte array containing the data to be added to the codec</param>
+        /// <param name="offset">The index of the first byte to add from <c>data</c></param>
+        /// <param name="count">The number of bytes to add</param>
+        /// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
+        public override void Add(byte[] data, int offset, int count)
+        {
+            if (data == null) throw new ArgumentNullException();
+            if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
+            if ((offset+count) > data.Length) throw new ArgumentException();
+            
+            int total = count;
+            int inputIndex = offset;
+            int err = 0;
+
+            while (err >= 0 && inputIndex < total)
+            {
+                copyInput(data, inputIndex, Math.Min(total - inputIndex, kBufferSize));
+                while (err >= 0 && _ztream.avail_in > 0)
+                {
+                    err = deflate(ref _ztream, (int)FlushTypes.None);
+                    if (err == 0)
+                        while (_ztream.avail_out == 0)
+                        {
+                            OnDataAvailable();
+                            err = deflate(ref _ztream, (int)FlushTypes.None);
+                        }
+                    inputIndex += (int)_ztream.total_in;
+                }
+            }
+            setChecksum( _ztream.adler );
+        }
+
+
+        /// <summary>
+        /// Finishes up any pending data that needs to be processed and handled.
+        /// </summary>
+        public override void Finish()
+        {
+            int err;
+            do 
+            {
+                err = deflate(ref _ztream, (int)FlushTypes.Finish);
+                OnDataAvailable();
+            }
+            while (err == 0);
+            setChecksum( _ztream.adler );
+            deflateReset(ref _ztream);
+            resetOutput();
+        }
+
+        /// <summary>
+        /// Closes the internal zlib deflate stream
+        /// </summary>
+        protected override void CleanUp() { deflateEnd(ref _ztream); }
+
+    }
+}
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib/DotZLib.cs b/updater/zlib123/contrib/dotzlib/DotZLib/DotZLib.cs
new file mode 100644
index 0000000..410deb0
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib/DotZLib.cs
@@ -0,0 +1,288 @@
+//
+// � Copyright Henrik Ravn 2004
+//
+// Use, modification and distribution are subject to the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//
+
+using System;
+using System.IO;
+using System.Runtime.InteropServices;
+using System.Text;
+
+
+namespace DotZLib
+{
+
+    #region Internal types
+
+    /// <summary>
+    /// Defines constants for the various flush types used with zlib
+    /// </summary>
+    internal enum FlushTypes 
+    {
+        None,  Partial,  Sync,  Full,  Finish,  Block
+    }
+
+    #region ZStream structure
+    // internal mapping of the zlib zstream structure for marshalling
+    [StructLayoutAttribute(LayoutKind.Sequential, Pack=4, Size=0, CharSet=CharSet.Ansi)]
+    internal struct ZStream
+    {
+        public IntPtr next_in;
+        public uint avail_in;
+        public uint total_in;
+
+        public IntPtr next_out;
+        public uint avail_out;
+        public uint total_out;
+
+        [MarshalAs(UnmanagedType.LPStr)]
+        string msg; 
+        uint state;
+
+        uint zalloc;
+        uint zfree;
+        uint opaque;
+
+        int data_type;
+        public uint adler;
+        uint reserved;
+    }
+
+    #endregion
+    
+    #endregion
+
+    #region Public enums
+    /// <summary>
+    /// Defines constants for the available compression levels in zlib
+    /// </summary>
+    public enum CompressLevel : int
+    {
+        /// <summary>
+        /// The default compression level with a reasonable compromise between compression and speed
+        /// </summary>
+        Default = -1,   
+        /// <summary>
+        /// No compression at all. The data are passed straight through.
+        /// </summary>
+        None = 0,
+        /// <summary>
+        /// The maximum compression rate available.
+        /// </summary>
+        Best = 9,   
+        /// <summary>
+        /// The fastest available compression level.
+        /// </summary>
+        Fastest = 1
+    }
+    #endregion
+
+    #region Exception classes
+    /// <summary>
+    /// The exception that is thrown when an error occurs on the zlib dll
+    /// </summary>
+    public class ZLibException : ApplicationException
+    {
+        /// <summary>
+        /// Initializes a new instance of the <see cref="ZLibException"/> class with a specified 
+        /// error message and error code
+        /// </summary>
+        /// <param name="errorCode">The zlib error code that caused the exception</param>
+        /// <param name="msg">A message that (hopefully) describes the error</param>
+        public ZLibException(int errorCode, string msg) : base(String.Format("ZLib error {0} {1}", errorCode, msg))
+        {
+        }
+
+        /// <summary>
+        /// Initializes a new instance of the <see cref="ZLibException"/> class with a specified 
+        /// error code
+        /// </summary>
+        /// <param name="errorCode">The zlib error code that caused the exception</param>
+        public ZLibException(int errorCode) : base(String.Format("ZLib error {0}", errorCode))
+        {
+        }
+    }
+    #endregion
+
+    #region Interfaces
+
+    /// <summary>
+    /// Declares methods and properties that enables a running checksum to be calculated 
+    /// </summary>
+    public interface ChecksumGenerator
+    {
+        /// <summary>
+        /// Gets the current value of the checksum
+        /// </summary>
+        uint Value { get; }
+
+        /// <summary>
+        /// Clears the current checksum to 0
+        /// </summary>
+        void Reset();
+
+        /// <summary>
+        /// Updates the current checksum with an array of bytes
+        /// </summary>
+        /// <param name="data">The data to update the checksum with</param>
+        void Update(byte[] data);
+
+        /// <summary>
+        /// Updates the current checksum with part of an array of bytes
+        /// </summary>
+        /// <param name="data">The data to update the checksum with</param>
+        /// <param name="offset">Where in <c>data</c> to start updating</param>
+        /// <param name="count">The number of bytes from <c>data</c> to use</param>
+        /// <exception cref="ArgumentException">The sum of offset and count is larger than the length of <c>data</c></exception>
+        /// <exception cref="ArgumentNullException"><c>data</c> is a null reference</exception>
+        /// <exception cref="ArgumentOutOfRangeException">Offset or count is negative.</exception>
+        void Update(byte[] data, int offset, int count);
+
+        /// <summary>
+        /// Updates the current checksum with the data from a string
+        /// </summary>
+        /// <param name="data">The string to update the checksum with</param>
+        /// <remarks>The characters in the string are converted by the UTF-8 encoding</remarks>
+        void Update(string data);
+
+        /// <summary>
+        /// Updates the current checksum with the data from a string, using a specific encoding
+        /// </summary>
+        /// <param name="data">The string to update the checksum with</param>
+        /// <param name="encoding">The encoding to use</param>
+        void Update(string data, Encoding encoding);
+    }
+
+
+    /// <summary>
+    /// Represents the method that will be called from a codec when new data
+    /// are available.
+    /// </summary>
+    /// <paramref name="data">The byte array containing the processed data</paramref>
+    /// <paramref name="startIndex">The index of the first processed byte in <c>data</c></paramref>
+    /// <paramref name="count">The number of processed bytes available</paramref>
+    /// <remarks>On return from this method, the data may be overwritten, so grab it while you can. 
+    /// You cannot assume that startIndex will be zero.
+    /// </remarks>
+    public delegate void DataAvailableHandler(byte[] data, int startIndex, int count);
+
+    /// <summary>
+    /// Declares methods and events for implementing compressors/decompressors
+    /// </summary>
+    public interface Codec
+    {
+        /// <summary>
+        /// Occurs when more processed data are available.
+        /// </summary>
+        event DataAvailableHandler DataAvailable;
+
+        /// <summary>
+        /// Adds more data to the codec to be processed.
+        /// </summary>
+        /// <param name="data">Byte array containing the data to be added to the codec</param>
+        /// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
+        void Add(byte[] data);
+
+        /// <summary>
+        /// Adds more data to the codec to be processed.
+        /// </summary>
+        /// <param name="data">Byte array containing the data to be added to the codec</param>
+        /// <param name="offset">The index of the first byte to add from <c>data</c></param>
+        /// <param name="count">The number of bytes to add</param>
+        /// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
+        void Add(byte[] data, int offset, int count);
+
+        /// <summary>
+        /// Finishes up any pending data that needs to be processed and handled.
+        /// </summary>
+        void Finish();
+
+        /// <summary>
+        /// Gets the checksum of the data that has been added so far
+        /// </summary>
+        uint Checksum { get; }
+
+
+    }
+
+    #endregion
+
+    #region Classes
+    /// <summary>
+    /// Encapsulates general information about the ZLib library
+    /// </summary>
+    public class Info
+    {
+        #region DLL imports
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern uint zlibCompileFlags();
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern string zlibVersion();
+        #endregion
+
+        #region Private stuff
+        private uint _flags;
+
+        // helper function that unpacks a bitsize mask
+        private static int bitSize(uint bits)
+        {
+            switch (bits)
+            {
+                case 0: return 16;
+                case 1: return 32;
+                case 2: return 64;
+            }
+            return -1;
+        }
+        #endregion
+
+        /// <summary>
+        /// Constructs an instance of the <c>Info</c> class.
+        /// </summary>
+        public Info()
+        {
+            _flags = zlibCompileFlags();
+        }
+
+        /// <summary>
+        /// True if the library is compiled with debug info
+        /// </summary>
+        public bool HasDebugInfo { get { return 0 != (_flags & 0x100); } }
+
+        /// <summary>
+        /// True if the library is compiled with assembly optimizations
+        /// </summary>
+        public bool UsesAssemblyCode { get { return 0 != (_flags & 0x200); } }
+
+        /// <summary>
+        /// Gets the size of the unsigned int that was compiled into Zlib
+        /// </summary>
+        public int SizeOfUInt { get { return bitSize(_flags & 3); } }
+
+        /// <summary>
+        /// Gets the size of the unsigned long that was compiled into Zlib
+        /// </summary>
+        public int SizeOfULong { get { return bitSize((_flags >> 2) & 3); } }
+
+        /// <summary>
+        /// Gets the size of the pointers that were compiled into Zlib
+        /// </summary>
+        public int SizeOfPointer { get { return bitSize((_flags >> 4) & 3); } }
+
+        /// <summary>
+        /// Gets the size of the z_off_t type that was compiled into Zlib
+        /// </summary>
+        public int SizeOfOffset { get { return bitSize((_flags >> 6) & 3); } }
+
+        /// <summary>
+        /// Gets the version of ZLib as a string, e.g. "1.2.1"
+        /// </summary>
+        public static string Version { get { return zlibVersion(); } }
+    }
+
+    #endregion
+
+}
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib/DotZLib.csproj b/updater/zlib123/contrib/dotzlib/DotZLib/DotZLib.csproj
new file mode 100644
index 0000000..71eeb85
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib/DotZLib.csproj
@@ -0,0 +1,141 @@
+<VisualStudioProject>
+    <CSHARP
+        ProjectType = "Local"
+        ProductVersion = "7.10.3077"
+        SchemaVersion = "2.0"
+        ProjectGuid = "{BB1EE0B1-1808-46CB-B786-949D91117FC5}"
+    >
+        <Build>
+            <Settings
+                ApplicationIcon = ""
+                AssemblyKeyContainerName = ""
+                AssemblyName = "DotZLib"
+                AssemblyOriginatorKeyFile = ""
+                DefaultClientScript = "JScript"
+                DefaultHTMLPageLayout = "Grid"
+                DefaultTargetSchema = "IE50"
+                DelaySign = "false"
+                OutputType = "Library"
+                PreBuildEvent = ""
+                PostBuildEvent = ""
+                RootNamespace = "DotZLib"
+                RunPostBuildEvent = "OnBuildSuccess"
+                StartupObject = ""
+            >
+                <Config
+                    Name = "Debug"
+                    AllowUnsafeBlocks = "false"
+                    BaseAddress = "285212672"
+                    CheckForOverflowUnderflow = "false"
+                    ConfigurationOverrideFile = ""
+                    DefineConstants = "DEBUG;TRACE"
+                    DocumentationFile = "docs\DotZLib.xml"
+                    DebugSymbols = "true"
+                    FileAlignment = "4096"
+                    IncrementalBuild = "false"
+                    NoStdLib = "false"
+                    NoWarn = "1591"
+                    Optimize = "false"
+                    OutputPath = "bin\Debug\"
+                    RegisterForComInterop = "false"
+                    RemoveIntegerChecks = "false"
+                    TreatWarningsAsErrors = "false"
+                    WarningLevel = "4"
+                />
+                <Config
+                    Name = "Release"
+                    AllowUnsafeBlocks = "false"
+                    BaseAddress = "285212672"
+                    CheckForOverflowUnderflow = "false"
+                    ConfigurationOverrideFile = ""
+                    DefineConstants = "TRACE"
+                    DocumentationFile = "docs\DotZLib.xml"
+                    DebugSymbols = "false"
+                    FileAlignment = "4096"
+                    IncrementalBuild = "false"
+                    NoStdLib = "false"
+                    NoWarn = ""
+                    Optimize = "true"
+                    OutputPath = "bin\Release\"
+                    RegisterForComInterop = "false"
+                    RemoveIntegerChecks = "false"
+                    TreatWarningsAsErrors = "false"
+                    WarningLevel = "4"
+                />
+            </Settings>
+            <References>
+                <Reference
+                    Name = "System"
+                    AssemblyName = "System"
+                    HintPath = "C:\WINNT\Microsoft.NET\Framework\v1.1.4322\System.dll"
+                />
+                <Reference
+                    Name = "System.Data"
+                    AssemblyName = "System.Data"
+                    HintPath = "C:\WINNT\Microsoft.NET\Framework\v1.1.4322\System.Data.dll"
+                />
+                <Reference
+                    Name = "System.XML"
+                    AssemblyName = "System.Xml"
+                    HintPath = "C:\WINNT\Microsoft.NET\Framework\v1.1.4322\System.XML.dll"
+                />
+                <Reference
+                    Name = "nunit.framework"
+                    AssemblyName = "nunit.framework"
+                    HintPath = "E:\apps\NUnit V2.1\\bin\nunit.framework.dll"
+                    AssemblyFolderKey = "hklm\dn\nunit.framework"
+                />
+            </References>
+        </Build>
+        <Files>
+            <Include>
+                <File
+                    RelPath = "AssemblyInfo.cs"
+                    SubType = "Code"
+                    BuildAction = "Compile"
+                />
+                <File
+                    RelPath = "ChecksumImpl.cs"
+                    SubType = "Code"
+                    BuildAction = "Compile"
+                />
+                <File
+                    RelPath = "CircularBuffer.cs"
+                    SubType = "Code"
+                    BuildAction = "Compile"
+                />
+                <File
+                    RelPath = "CodecBase.cs"
+                    SubType = "Code"
+                    BuildAction = "Compile"
+                />
+                <File
+                    RelPath = "Deflater.cs"
+                    SubType = "Code"
+                    BuildAction = "Compile"
+                />
+                <File
+                    RelPath = "DotZLib.cs"
+                    SubType = "Code"
+                    BuildAction = "Compile"
+                />
+                <File
+                    RelPath = "GZipStream.cs"
+                    SubType = "Code"
+                    BuildAction = "Compile"
+                />
+                <File
+                    RelPath = "Inflater.cs"
+                    SubType = "Code"
+                    BuildAction = "Compile"
+                />
+                <File
+                    RelPath = "UnitTests.cs"
+                    SubType = "Code"
+                    BuildAction = "Compile"
+                />
+            </Include>
+        </Files>
+    </CSHARP>
+</VisualStudioProject>
+
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib/GZipStream.cs b/updater/zlib123/contrib/dotzlib/DotZLib/GZipStream.cs
new file mode 100644
index 0000000..f861675
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib/GZipStream.cs
@@ -0,0 +1,301 @@
+//
+// � Copyright Henrik Ravn 2004
+//
+// Use, modification and distribution are subject to the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//
+
+using System;
+using System.IO;
+using System.Runtime.InteropServices;
+
+namespace DotZLib
+{
+	/// <summary>
+	/// Implements a compressed <see cref="Stream"/>, in GZip (.gz) format.
+	/// </summary>
+	public class GZipStream : Stream, IDisposable
+	{
+        #region Dll Imports
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl, CharSet=CharSet.Ansi)]
+        private static extern IntPtr gzopen(string name, string mode);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int gzclose(IntPtr gzFile);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int gzwrite(IntPtr gzFile, int data, int length);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int gzread(IntPtr gzFile, int data, int length);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int gzgetc(IntPtr gzFile);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int gzputc(IntPtr gzFile, int c);
+
+        #endregion
+
+        #region Private data
+        private IntPtr _gzFile;
+        private bool _isDisposed = false;
+        private bool _isWriting;
+        #endregion
+
+        #region Constructors
+        /// <summary>
+        /// Creates a new file as a writeable GZipStream
+        /// </summary>
+        /// <param name="fileName">The name of the compressed file to create</param>
+        /// <param name="level">The compression level to use when adding data</param>
+        /// <exception cref="ZLibException">If an error occurred in the internal zlib function</exception>
+		public GZipStream(string fileName, CompressLevel level)
+		{
+            _isWriting = true;
+            _gzFile = gzopen(fileName, String.Format("wb{0}", (int)level));
+            if (_gzFile == IntPtr.Zero)
+                throw new ZLibException(-1, "Could not open " + fileName);
+		}
+
+        /// <summary>
+        /// Opens an existing file as a readable GZipStream
+        /// </summary>
+        /// <param name="fileName">The name of the file to open</param>
+        /// <exception cref="ZLibException">If an error occurred in the internal zlib function</exception>
+        public GZipStream(string fileName)
+        {
+            _isWriting = false;
+            _gzFile = gzopen(fileName, "rb");
+            if (_gzFile == IntPtr.Zero)
+                throw new ZLibException(-1, "Could not open " + fileName);
+
+        }
+        #endregion
+
+        #region Access properties
+        /// <summary>
+        /// Returns true of this stream can be read from, false otherwise
+        /// </summary>
+        public override bool CanRead
+        {
+            get
+            {
+                return !_isWriting;
+            }
+        }
+    
+
+        /// <summary>
+        /// Returns false.
+        /// </summary>
+        public override bool CanSeek
+        {
+            get
+            {
+                return false;
+            }
+        }
+    
+        /// <summary>
+        /// Returns true if this tsream is writeable, false otherwise
+        /// </summary>
+        public override bool CanWrite
+        {
+            get
+            {
+                return _isWriting;
+            }
+        }
+        #endregion
+    
+        #region Destructor & IDispose stuff
+
+        /// <summary>
+        /// Destroys this instance
+        /// </summary>
+        ~GZipStream()
+        {
+            cleanUp(false);
+        }
+
+        /// <summary>
+        /// Closes the external file handle
+        /// </summary>
+        public void Dispose()
+        {
+            cleanUp(true);
+        }
+
+        // Does the actual closing of the file handle.
+        private void cleanUp(bool isDisposing)
+        {
+            if (!_isDisposed)
+            {
+                gzclose(_gzFile);
+                _isDisposed = true;
+            }
+        }
+        #endregion
+    
+        #region Basic reading and writing
+        /// <summary>
+        /// Attempts to read a number of bytes from the stream.
+        /// </summary>
+        /// <param name="buffer">The destination data buffer</param>
+        /// <param name="offset">The index of the first destination byte in <c>buffer</c></param>
+        /// <param name="count">The number of bytes requested</param>
+        /// <returns>The number of bytes read</returns>
+        /// <exception cref="ArgumentNullException">If <c>buffer</c> is null</exception>
+        /// <exception cref="ArgumentOutOfRangeException">If <c>count</c> or <c>offset</c> are negative</exception>
+        /// <exception cref="ArgumentException">If <c>offset</c>  + <c>count</c> is &gt; buffer.Length</exception>
+        /// <exception cref="NotSupportedException">If this stream is not readable.</exception>
+        /// <exception cref="ObjectDisposedException">If this stream has been disposed.</exception>
+        public override int Read(byte[] buffer, int offset, int count)
+        {
+            if (!CanRead) throw new NotSupportedException();
+            if (buffer == null) throw new ArgumentNullException();
+            if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
+            if ((offset+count) > buffer.Length) throw new ArgumentException();
+            if (_isDisposed) throw new ObjectDisposedException("GZipStream");
+
+            GCHandle h = GCHandle.Alloc(buffer, GCHandleType.Pinned);
+            int result;
+            try
+            {
+                result = gzread(_gzFile, h.AddrOfPinnedObject().ToInt32() + offset, count);
+                if (result < 0)
+                    throw new IOException();
+            }
+            finally
+            {
+                h.Free();
+            }
+            return result;
+        }
+
+        /// <summary>
+        /// Attempts to read a single byte from the stream.
+        /// </summary>
+        /// <returns>The byte that was read, or -1 in case of error or End-Of-File</returns>
+        public override int ReadByte()
+        {
+            if (!CanRead) throw new NotSupportedException();
+            if (_isDisposed) throw new ObjectDisposedException("GZipStream");
+            return gzgetc(_gzFile);
+        }
+
+        /// <summary>
+        /// Writes a number of bytes to the stream
+        /// </summary>
+        /// <param name="buffer"></param>
+        /// <param name="offset"></param>
+        /// <param name="count"></param>
+        /// <exception cref="ArgumentNullException">If <c>buffer</c> is null</exception>
+        /// <exception cref="ArgumentOutOfRangeException">If <c>count</c> or <c>offset</c> are negative</exception>
+        /// <exception cref="ArgumentException">If <c>offset</c>  + <c>count</c> is &gt; buffer.Length</exception>
+        /// <exception cref="NotSupportedException">If this stream is not writeable.</exception>
+        /// <exception cref="ObjectDisposedException">If this stream has been disposed.</exception>
+        public override void Write(byte[] buffer, int offset, int count)
+        {
+            if (!CanWrite) throw new NotSupportedException();
+            if (buffer == null) throw new ArgumentNullException();
+            if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
+            if ((offset+count) > buffer.Length) throw new ArgumentException();
+            if (_isDisposed) throw new ObjectDisposedException("GZipStream");
+
+            GCHandle h = GCHandle.Alloc(buffer, GCHandleType.Pinned);
+            try
+            {
+                int result = gzwrite(_gzFile, h.AddrOfPinnedObject().ToInt32() + offset, count);
+                if (result < 0)
+                    throw new IOException();
+            }
+            finally
+            {
+                h.Free();
+            }
+        }
+
+        /// <summary>
+        /// Writes a single byte to the stream
+        /// </summary>
+        /// <param name="value">The byte to add to the stream.</param>
+        /// <exception cref="NotSupportedException">If this stream is not writeable.</exception>
+        /// <exception cref="ObjectDisposedException">If this stream has been disposed.</exception>
+        public override void WriteByte(byte value)
+        {
+            if (!CanWrite) throw new NotSupportedException();
+            if (_isDisposed) throw new ObjectDisposedException("GZipStream");
+
+            int result = gzputc(_gzFile, (int)value);
+            if (result < 0)
+                throw new IOException();
+        }
+        #endregion
+
+        #region Position & length stuff
+        /// <summary>
+        /// Not supported.
+        /// </summary>
+        /// <param name="value"></param>
+        /// <exception cref="NotSupportedException">Always thrown</exception>
+        public override void SetLength(long value)
+        {
+            throw new NotSupportedException();
+        }
+    
+        /// <summary>
+        ///  Not suppported.
+        /// </summary>
+        /// <param name="offset"></param>
+        /// <param name="origin"></param>
+        /// <returns></returns>
+        /// <exception cref="NotSupportedException">Always thrown</exception>
+        public override long Seek(long offset, SeekOrigin origin)
+        {
+            throw new NotSupportedException();
+        }
+    
+        /// <summary>
+        /// Flushes the <c>GZipStream</c>.
+        /// </summary>
+        /// <remarks>In this implementation, this method does nothing. This is because excessive
+        /// flushing may degrade the achievable compression rates.</remarks>
+        public override void Flush()
+        {
+            // left empty on purpose
+        }
+    
+        /// <summary>
+        /// Gets/sets the current position in the <c>GZipStream</c>. Not suppported.
+        /// </summary>
+        /// <remarks>In this implementation this property is not supported</remarks>
+        /// <exception cref="NotSupportedException">Always thrown</exception>
+        public override long Position
+        {
+            get
+            {
+                throw new NotSupportedException();
+            }
+            set
+            {
+                throw new NotSupportedException();
+            }
+        }
+    
+        /// <summary>
+        /// Gets the size of the stream. Not suppported.
+        /// </summary>
+        /// <remarks>In this implementation this property is not supported</remarks>
+        /// <exception cref="NotSupportedException">Always thrown</exception>
+        public override long Length
+        {
+            get
+            {
+                throw new NotSupportedException();
+            }
+        }
+        #endregion
+    }
+}
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib/Inflater.cs b/updater/zlib123/contrib/dotzlib/DotZLib/Inflater.cs
new file mode 100644
index 0000000..4e60cda
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib/Inflater.cs
@@ -0,0 +1,105 @@
+//
+// � Copyright Henrik Ravn 2004
+//
+// Use, modification and distribution are subject to the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//
+
+using System;
+using System.Diagnostics;
+using System.Runtime.InteropServices;
+
+namespace DotZLib
+{
+    
+    /// <summary>
+    /// Implements a data decompressor, using the inflate algorithm in the ZLib dll
+    /// </summary>
+    public class Inflater : CodecBase
+	{
+        #region Dll imports
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl, CharSet=CharSet.Ansi)]
+        private static extern int inflateInit_(ref ZStream sz, string vs, int size);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int inflate(ref ZStream sz, int flush);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int inflateReset(ref ZStream sz);
+
+        [DllImport("ZLIB1.dll", CallingConvention=CallingConvention.Cdecl)]
+        private static extern int inflateEnd(ref ZStream sz);
+        #endregion
+
+        /// <summary>
+        /// Constructs an new instance of the <c>Inflater</c>
+        /// </summary>
+        public Inflater() : base()
+		{
+            int retval = inflateInit_(ref _ztream, Info.Version, Marshal.SizeOf(_ztream));
+            if (retval != 0)
+                throw new ZLibException(retval, "Could not initialize inflater");
+
+            resetOutput();
+        }
+
+
+        /// <summary>
+        /// Adds more data to the codec to be processed.
+        /// </summary>
+        /// <param name="data">Byte array containing the data to be added to the codec</param>
+        /// <param name="offset">The index of the first byte to add from <c>data</c></param>
+        /// <param name="count">The number of bytes to add</param>
+        /// <remarks>Adding data may, or may not, raise the <c>DataAvailable</c> event</remarks>
+        public override void Add(byte[] data, int offset, int count)
+        {
+            if (data == null) throw new ArgumentNullException();
+            if (offset < 0 || count < 0) throw new ArgumentOutOfRangeException();
+            if ((offset+count) > data.Length) throw new ArgumentException();
+
+            int total = count;
+            int inputIndex = offset;
+            int err = 0;
+
+            while (err >= 0 && inputIndex < total)
+            {
+                copyInput(data, inputIndex, Math.Min(total - inputIndex, kBufferSize));
+                err = inflate(ref _ztream, (int)FlushTypes.None);
+                if (err == 0)
+                    while (_ztream.avail_out == 0)
+                    {
+                        OnDataAvailable();
+                        err = inflate(ref _ztream, (int)FlushTypes.None);
+                    }
+
+                inputIndex += (int)_ztream.total_in;
+            }
+            setChecksum( _ztream.adler );
+        }
+
+
+        /// <summary>
+        /// Finishes up any pending data that needs to be processed and handled.
+        /// </summary>
+        public override void Finish()
+        {
+            int err;
+            do 
+            {
+                err = inflate(ref _ztream, (int)FlushTypes.Finish);
+                OnDataAvailable();
+            }
+            while (err == 0);
+            setChecksum( _ztream.adler );
+            inflateReset(ref _ztream);
+            resetOutput();
+        }
+
+        /// <summary>
+        /// Closes the internal zlib inflate stream
+        /// </summary>
+        protected override void CleanUp() { inflateEnd(ref _ztream); }
+
+
+	}
+}
diff --git a/updater/zlib123/contrib/dotzlib/DotZLib/UnitTests.cs b/updater/zlib123/contrib/dotzlib/DotZLib/UnitTests.cs
new file mode 100644
index 0000000..8dc00db
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/DotZLib/UnitTests.cs
@@ -0,0 +1,274 @@
+//
+// � Copyright Henrik Ravn 2004
+//
+// Use, modification and distribution are subject to the Boost Software License, Version 1.0. 
+// (See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
+//
+
+using System;
+using System.Collections;
+using System.IO;
+
+// uncomment the define below to include unit tests
+//#define nunit
+#if nunit
+using NUnit.Framework;
+
+// Unit tests for the DotZLib class library
+// ----------------------------------------
+//
+// Use this with NUnit 2 from http://www.nunit.org
+//
+
+namespace DotZLibTests
+{
+    using DotZLib;
+
+    // helper methods
+    internal class Utils
+    {
+        public static bool byteArrEqual( byte[] lhs, byte[] rhs )
+        {
+            if (lhs.Length != rhs.Length)
+                return false;
+            for (int i = lhs.Length-1; i >= 0; --i)
+                if (lhs[i] != rhs[i])
+                    return false;
+            return true;
+        }
+
+    }
+
+
+    [TestFixture]
+    public class CircBufferTests
+    {
+        #region Circular buffer tests
+        [Test]
+        public void SinglePutGet()
+        {
+            CircularBuffer buf = new CircularBuffer(10);
+            Assert.AreEqual( 0, buf.Size );
+            Assert.AreEqual( -1, buf.Get() );
+
+            Assert.IsTrue(buf.Put( 1 ));
+            Assert.AreEqual( 1, buf.Size );
+            Assert.AreEqual( 1, buf.Get() );
+            Assert.AreEqual( 0, buf.Size );
+            Assert.AreEqual( -1, buf.Get() );
+        }
+
+        [Test]
+        public void BlockPutGet()
+        {
+            CircularBuffer buf = new CircularBuffer(10);
+            byte[] arr = {1,2,3,4,5,6,7,8,9,10};
+            Assert.AreEqual( 10, buf.Put(arr,0,10) );
+            Assert.AreEqual( 10, buf.Size );
+            Assert.IsFalse( buf.Put(11) );
+            Assert.AreEqual( 1, buf.Get() );
+            Assert.IsTrue( buf.Put(11) );
+
+            byte[] arr2 = (byte[])arr.Clone();
+            Assert.AreEqual( 9, buf.Get(arr2,1,9) );
+            Assert.IsTrue( Utils.byteArrEqual(arr,arr2) );
+        }
+
+        #endregion
+    }
+
+    [TestFixture]
+    public class ChecksumTests
+    {
+        #region CRC32 Tests
+        [Test]
+        public void CRC32_Null()
+        {
+            CRC32Checksum crc32 = new CRC32Checksum();
+            Assert.AreEqual( 0, crc32.Value );
+
+            crc32 = new CRC32Checksum(1);
+            Assert.AreEqual( 1, crc32.Value );
+
+            crc32 = new CRC32Checksum(556);
+            Assert.AreEqual( 556, crc32.Value );
+        }
+
+        [Test]
+        public void CRC32_Data()
+        {
+            CRC32Checksum crc32 = new CRC32Checksum();
+            byte[] data = { 1,2,3,4,5,6,7 };
+            crc32.Update(data);
+            Assert.AreEqual( 0x70e46888, crc32.Value  );
+
+            crc32 = new CRC32Checksum();
+            crc32.Update("penguin");
+            Assert.AreEqual( 0x0e5c1a120, crc32.Value );
+
+            crc32 = new CRC32Checksum(1);
+            crc32.Update("penguin");
+            Assert.AreEqual(0x43b6aa94, crc32.Value);
+
+        }
+        #endregion
+
+        #region Adler tests
+
+        [Test]
+        public void Adler_Null()
+        {
+            AdlerChecksum adler = new AdlerChecksum();
+            Assert.AreEqual(0, adler.Value);
+
+            adler = new AdlerChecksum(1);
+            Assert.AreEqual( 1, adler.Value );
+
+            adler = new AdlerChecksum(556);
+            Assert.AreEqual( 556, adler.Value );
+        }
+
+        [Test]
+        public void Adler_Data()
+        {
+            AdlerChecksum adler = new AdlerChecksum(1);
+            byte[] data = { 1,2,3,4,5,6,7 };
+            adler.Update(data);
+            Assert.AreEqual( 0x5b001d, adler.Value  );
+
+            adler = new AdlerChecksum();
+            adler.Update("penguin");
+            Assert.AreEqual(0x0bcf02f6, adler.Value );
+
+            adler = new AdlerChecksum(1);
+            adler.Update("penguin");
+            Assert.AreEqual(0x0bd602f7, adler.Value);
+
+        }
+        #endregion
+    }
+
+    [TestFixture]
+    public class InfoTests
+    {
+        #region Info tests
+        [Test]
+        public void Info_Version()
+        {
+            Info info = new Info();
+            Assert.AreEqual("1.2.3", Info.Version);
+            Assert.AreEqual(32, info.SizeOfUInt);
+            Assert.AreEqual(32, info.SizeOfULong);
+            Assert.AreEqual(32, info.SizeOfPointer);
+            Assert.AreEqual(32, info.SizeOfOffset);
+        }
+        #endregion
+    }
+
+    [TestFixture]
+    public class DeflateInflateTests
+    {
+        #region Deflate tests
+        [Test]
+        public void Deflate_Init()
+        {
+            using (Deflater def = new Deflater(CompressLevel.Default))
+            {
+            }
+        }
+
+        private ArrayList compressedData = new ArrayList();
+        private uint adler1;
+
+        private ArrayList uncompressedData = new ArrayList();
+        private uint adler2;
+
+        public void CDataAvail(byte[] data, int startIndex, int count)
+        {
+            for (int i = 0; i < count; ++i)
+                compressedData.Add(data[i+startIndex]);
+        }
+
+        [Test]
+        public void Deflate_Compress()
+        {
+            compressedData.Clear();
+
+            byte[] testData = new byte[35000];
+            for (int i = 0; i < testData.Length; ++i)
+                testData[i] = 5;
+
+            using (Deflater def = new Deflater((CompressLevel)5))
+            {
+                def.DataAvailable += new DataAvailableHandler(CDataAvail);
+                def.Add(testData);
+                def.Finish();
+                adler1 = def.Checksum;
+            }
+        }
+        #endregion
+
+        #region Inflate tests
+        [Test]
+        public void Inflate_Init()
+        {
+            using (Inflater inf = new Inflater())
+            {
+            }
+        }
+
+        private void DDataAvail(byte[] data, int startIndex, int count)
+        {
+            for (int i = 0; i < count; ++i)
+                uncompressedData.Add(data[i+startIndex]);
+        }
+
+        [Test]
+        public void Inflate_Expand()
+        { 
+            uncompressedData.Clear();
+
+            using (Inflater inf = new Inflater())
+            {
+                inf.DataAvailable += new DataAvailableHandler(DDataAvail);
+                inf.Add((byte[])compressedData.ToArray(typeof(byte)));
+                inf.Finish();
+                adler2 = inf.Checksum;
+            }
+            Assert.AreEqual( adler1, adler2 );
+        }
+        #endregion
+    }
+
+    [TestFixture]
+    public class GZipStreamTests
+    {
+        #region GZipStream test
+        [Test]
+        public void GZipStream_WriteRead()
+        {
+            using (GZipStream gzOut = new GZipStream("gzstream.gz", CompressLevel.Best))
+            {
+                BinaryWriter writer = new BinaryWriter(gzOut);
+                writer.Write("hi there");
+                writer.Write(Math.PI);
+                writer.Write(42);
+            }
+
+            using (GZipStream gzIn = new GZipStream("gzstream.gz"))
+            {
+                BinaryReader reader = new BinaryReader(gzIn);
+                string s = reader.ReadString();
+                Assert.AreEqual("hi there",s);
+                double d = reader.ReadDouble();
+                Assert.AreEqual(Math.PI, d);
+                int i = reader.ReadInt32();
+                Assert.AreEqual(42,i);
+            }
+
+        }
+        #endregion
+	}
+}
+
+#endif
+\ No newline at end of file
diff --git a/updater/zlib123/contrib/dotzlib/LICENSE_1_0.txt b/updater/zlib123/contrib/dotzlib/LICENSE_1_0.txt
new file mode 100644
index 0000000..30aac2c
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/LICENSE_1_0.txt
@@ -0,0 +1,23 @@
+Boost Software License - Version 1.0 - August 17th, 2003
+
+Permission is hereby granted, free of charge, to any person or organization
+obtaining a copy of the software and accompanying documentation covered by
+this license (the "Software") to use, reproduce, display, distribute,
+execute, and transmit the Software, and to prepare derivative works of the
+Software, and to permit third-parties to whom the Software is furnished to
+do so, all subject to the following:
+
+The copyright notices in the Software and this entire statement, including
+the above license grant, this restriction and the following disclaimer,
+must be included in all copies of the Software, in whole or in part, and
+all derivative works of the Software, unless such copies or derivative
+works are solely in the form of machine-executable object code generated by
+a source language processor.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE, TITLE AND NON-INFRINGEMENT. IN NO EVENT
+SHALL THE COPYRIGHT HOLDERS OR ANYONE DISTRIBUTING THE SOFTWARE BE LIABLE
+FOR ANY DAMAGES OR OTHER LIABILITY, WHETHER IN CONTRACT, TORT OR OTHERWISE,
+ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.
+\ No newline at end of file
diff --git a/updater/zlib123/contrib/dotzlib/readme.txt b/updater/zlib123/contrib/dotzlib/readme.txt
new file mode 100644
index 0000000..210f4b0
--- /dev/null
+++ b/updater/zlib123/contrib/dotzlib/readme.txt
@@ -0,0 +1,58 @@
+This directory contains a .Net wrapper class library for the ZLib1.dll
+
+The wrapper includes support for inflating/deflating memory buffers, 
+.Net streaming wrappers for the gz streams part of zlib, and wrappers
+for the checksum parts of zlib. See DotZLib/UnitTests.cs for examples.
+
+Directory structure:
+--------------------
+
+LICENSE_1_0.txt       - License file.
+readme.txt            - This file.
+DotZLib.chm           - Class library documentation
+DotZLib.build         - NAnt build file
+DotZLib.sln           - Microsoft Visual Studio 2003 solution file
+
+DotZLib\*.cs          - Source files for the class library
+
+Unit tests:
+-----------
+The file DotZLib/UnitTests.cs contains unit tests for use with NUnit 2.1 or higher.
+To include unit tests in the build, define nunit before building.
+
+
+Build instructions:
+-------------------
+
+1. Using Visual Studio.Net 2003:
+   Open DotZLib.sln in VS.Net and build from there. Output file (DotZLib.dll)
+   will be found ./DotZLib/bin/release or ./DotZLib/bin/debug, depending on 
+   you are building the release or debug version of the library. Check 
+   DotZLib/UnitTests.cs for instructions on how to include unit tests in the
+   build.
+   
+2. Using NAnt:
+   Open a command prompt with access to the build environment and run nant
+   in the same directory as the DotZLib.build file.
+   You can define 2 properties on the nant command-line to control the build:
+   debug={true|false} to toggle between release/debug builds (default=true).
+   nunit={true|false} to include or esclude unit tests (default=true).
+   Also the target clean will remove binaries.
+   Output file (DotZLib.dll) will be found in either ./DotZLib/bin/release 
+   or ./DotZLib/bin/debug, depending on whether you are building the release 
+   or debug version of the library.
+
+   Examples: 
+     nant -D:debug=false -D:nunit=false
+       will build a release mode version of the library without unit tests.
+     nant
+       will build a debug version of the library with unit tests 
+     nant clean
+       will remove all previously built files.
+
+
+---------------------------------
+Copyright (c) Henrik Ravn 2004
+
+Use, modification and distribution are subject to the Boost Software License, Version 1.0. 
+(See accompanying file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
diff --git a/updater/zlib123/contrib/infback9/README b/updater/zlib123/contrib/infback9/README
new file mode 100644
index 0000000..b084612
--- /dev/null
+++ b/updater/zlib123/contrib/infback9/README
@@ -0,0 +1 @@
+See infback9.h for what this is and how to use it.
diff --git a/updater/zlib123/contrib/infback9/infback9.c b/updater/zlib123/contrib/infback9/infback9.c
new file mode 100644
index 0000000..6faf3e6
--- /dev/null
+++ b/updater/zlib123/contrib/infback9/infback9.c
@@ -0,0 +1,608 @@
+/* infback9.c -- inflate deflate64 data using a call-back interface
+ * Copyright (C) 1995-2003 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+#include "zutil.h"
+#include "infback9.h"
+#include "inftree9.h"
+#include "inflate9.h"
+
+#define WSIZE 65536UL
+
+/*
+   strm provides memory allocation functions in zalloc and zfree, or
+   Z_NULL to use the library memory allocation functions.
+
+   window is a user-supplied window and output buffer that is 64K bytes.
+ */
+int ZEXPORT inflateBack9Init_(strm, window, version, stream_size)
+z_stream FAR *strm;
+unsigned char FAR *window;
+const char *version;
+int stream_size;
+{
+    struct inflate_state FAR *state;
+
+    if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
+        stream_size != (int)(sizeof(z_stream)))
+        return Z_VERSION_ERROR;
+    if (strm == Z_NULL || window == Z_NULL)
+        return Z_STREAM_ERROR;
+    strm->msg = Z_NULL;                 /* in case we return an error */
+    if (strm->zalloc == (alloc_func)0) {
+        strm->zalloc = zcalloc;
+        strm->opaque = (voidpf)0;
+    }
+    if (strm->zfree == (free_func)0) strm->zfree = zcfree;
+    state = (struct inflate_state FAR *)ZALLOC(strm, 1,
+                                               sizeof(struct inflate_state));
+    if (state == Z_NULL) return Z_MEM_ERROR;
+    Tracev((stderr, "inflate: allocated\n"));
+    strm->state = (voidpf)state;
+    state->window = window;
+    return Z_OK;
+}
+
+/*
+   Build and output length and distance decoding tables for fixed code
+   decoding.
+ */
+#ifdef MAKEFIXED
+#include <stdio.h>
+
+void makefixed9(void)
+{
+    unsigned sym, bits, low, size;
+    code *next, *lenfix, *distfix;
+    struct inflate_state state;
+    code fixed[544];
+
+    /* literal/length table */
+    sym = 0;
+    while (sym < 144) state.lens[sym++] = 8;
+    while (sym < 256) state.lens[sym++] = 9;
+    while (sym < 280) state.lens[sym++] = 7;
+    while (sym < 288) state.lens[sym++] = 8;
+    next = fixed;
+    lenfix = next;
+    bits = 9;
+    inflate_table9(LENS, state.lens, 288, &(next), &(bits), state.work);
+
+    /* distance table */
+    sym = 0;
+    while (sym < 32) state.lens[sym++] = 5;
+    distfix = next;
+    bits = 5;
+    inflate_table9(DISTS, state.lens, 32, &(next), &(bits), state.work);
+
+    /* write tables */
+    puts("    /* inffix9.h -- table for decoding deflate64 fixed codes");
+    puts("     * Generated automatically by makefixed9().");
+    puts("     */");
+    puts("");
+    puts("    /* WARNING: this file should *not* be used by applications.");
+    puts("       It is part of the implementation of this library and is");
+    puts("       subject to change. Applications should only use zlib.h.");
+    puts("     */");
+    puts("");
+    size = 1U << 9;
+    printf("    static const code lenfix[%u] = {", size);
+    low = 0;
+    for (;;) {
+        if ((low % 6) == 0) printf("\n        ");
+        printf("{%u,%u,%d}", lenfix[low].op, lenfix[low].bits,
+               lenfix[low].val);
+        if (++low == size) break;
+        putchar(',');
+    }
+    puts("\n    };");
+    size = 1U << 5;
+    printf("\n    static const code distfix[%u] = {", size);
+    low = 0;
+    for (;;) {
+        if ((low % 5) == 0) printf("\n        ");
+        printf("{%u,%u,%d}", distfix[low].op, distfix[low].bits,
+               distfix[low].val);
+        if (++low == size) break;
+        putchar(',');
+    }
+    puts("\n    };");
+}
+#endif /* MAKEFIXED */
+
+/* Macros for inflateBack(): */
+
+/* Clear the input bit accumulator */
+#define INITBITS() \
+    do { \
+        hold = 0; \
+        bits = 0; \
+    } while (0)
+
+/* Assure that some input is available.  If input is requested, but denied,
+   then return a Z_BUF_ERROR from inflateBack(). */
+#define PULL() \
+    do { \
+        if (have == 0) { \
+            have = in(in_desc, &next); \
+            if (have == 0) { \
+                next = Z_NULL; \
+                ret = Z_BUF_ERROR; \
+                goto inf_leave; \
+            } \
+        } \
+    } while (0)
+
+/* Get a byte of input into the bit accumulator, or return from inflateBack()
+   with an error if there is no input available. */
+#define PULLBYTE() \
+    do { \
+        PULL(); \
+        have--; \
+        hold += (unsigned long)(*next++) << bits; \
+        bits += 8; \
+    } while (0)
+
+/* Assure that there are at least n bits in the bit accumulator.  If there is
+   not enough available input to do that, then return from inflateBack() with
+   an error. */
+#define NEEDBITS(n) \
+    do { \
+        while (bits < (unsigned)(n)) \
+            PULLBYTE(); \
+    } while (0)
+
+/* Return the low n bits of the bit accumulator (n <= 16) */
+#define BITS(n) \
+    ((unsigned)hold & ((1U << (n)) - 1))
+
+/* Remove n bits from the bit accumulator */
+#define DROPBITS(n) \
+    do { \
+        hold >>= (n); \
+        bits -= (unsigned)(n); \
+    } while (0)
+
+/* Remove zero to seven bits as needed to go to a byte boundary */
+#define BYTEBITS() \
+    do { \
+        hold >>= bits & 7; \
+        bits -= bits & 7; \
+    } while (0)
+
+/* Assure that some output space is available, by writing out the window
+   if it's full.  If the write fails, return from inflateBack() with a
+   Z_BUF_ERROR. */
+#define ROOM() \
+    do { \
+        if (left == 0) { \
+            put = window; \
+            left = WSIZE; \
+            wrap = 1; \
+            if (out(out_desc, put, (unsigned)left)) { \
+                ret = Z_BUF_ERROR; \
+                goto inf_leave; \
+            } \
+        } \
+    } while (0)
+
+/*
+   strm provides the memory allocation functions and window buffer on input,
+   and provides information on the unused input on return.  For Z_DATA_ERROR
+   returns, strm will also provide an error message.
+
+   in() and out() are the call-back input and output functions.  When
+   inflateBack() needs more input, it calls in().  When inflateBack() has
+   filled the window with output, or when it completes with data in the
+   window, it calls out() to write out the data.  The application must not
+   change the provided input until in() is called again or inflateBack()
+   returns.  The application must not change the window/output buffer until
+   inflateBack() returns.
+
+   in() and out() are called with a descriptor parameter provided in the
+   inflateBack() call.  This parameter can be a structure that provides the
+   information required to do the read or write, as well as accumulated
+   information on the input and output such as totals and check values.
+
+   in() should return zero on failure.  out() should return non-zero on
+   failure.  If either in() or out() fails, than inflateBack() returns a
+   Z_BUF_ERROR.  strm->next_in can be checked for Z_NULL to see whether it
+   was in() or out() that caused in the error.  Otherwise,  inflateBack()
+   returns Z_STREAM_END on success, Z_DATA_ERROR for an deflate format
+   error, or Z_MEM_ERROR if it could not allocate memory for the state.
+   inflateBack() can also return Z_STREAM_ERROR if the input parameters
+   are not correct, i.e. strm is Z_NULL or the state was not initialized.
+ */
+int ZEXPORT inflateBack9(strm, in, in_desc, out, out_desc)
+z_stream FAR *strm;
+in_func in;
+void FAR *in_desc;
+out_func out;
+void FAR *out_desc;
+{
+    struct inflate_state FAR *state;
+    unsigned char FAR *next;    /* next input */
+    unsigned char FAR *put;     /* next output */
+    unsigned have;              /* available input */
+    unsigned long left;         /* available output */
+    inflate_mode mode;          /* current inflate mode */
+    int lastblock;              /* true if processing last block */
+    int wrap;                   /* true if the window has wrapped */
+    unsigned long write;        /* window write index */
+    unsigned char FAR *window;  /* allocated sliding window, if needed */
+    unsigned long hold;         /* bit buffer */
+    unsigned bits;              /* bits in bit buffer */
+    unsigned extra;             /* extra bits needed */
+    unsigned long length;       /* literal or length of data to copy */
+    unsigned long offset;       /* distance back to copy string from */
+    unsigned long copy;         /* number of stored or match bytes to copy */
+    unsigned char FAR *from;    /* where to copy match bytes from */
+    code const FAR *lencode;    /* starting table for length/literal codes */
+    code const FAR *distcode;   /* starting table for distance codes */
+    unsigned lenbits;           /* index bits for lencode */
+    unsigned distbits;          /* index bits for distcode */
+    code this;                  /* current decoding table entry */
+    code last;                  /* parent table entry */
+    unsigned len;               /* length to copy for repeats, bits to drop */
+    int ret;                    /* return code */
+    static const unsigned short order[19] = /* permutation of code lengths */
+        {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
+#include "inffix9.h"
+
+    /* Check that the strm exists and that the state was initialized */
+    if (strm == Z_NULL || strm->state == Z_NULL)
+        return Z_STREAM_ERROR;
+    state = (struct inflate_state FAR *)strm->state;
+
+    /* Reset the state */
+    strm->msg = Z_NULL;
+    mode = TYPE;
+    lastblock = 0;
+    write = 0;
+    wrap = 0;
+    window = state->window;
+    next = strm->next_in;
+    have = next != Z_NULL ? strm->avail_in : 0;
+    hold = 0;
+    bits = 0;
+    put = window;
+    left = WSIZE;
+    lencode = Z_NULL;
+    distcode = Z_NULL;
+
+    /* Inflate until end of block marked as last */
+    for (;;)
+        switch (mode) {
+        case TYPE:
+            /* determine and dispatch block type */
+            if (lastblock) {
+                BYTEBITS();
+                mode = DONE;
+                break;
+            }
+            NEEDBITS(3);
+            lastblock = BITS(1);
+            DROPBITS(1);
+            switch (BITS(2)) {
+            case 0:                             /* stored block */
+                Tracev((stderr, "inflate:     stored block%s\n",
+                        lastblock ? " (last)" : ""));
+                mode = STORED;
+                break;
+            case 1:                             /* fixed block */
+                lencode = lenfix;
+                lenbits = 9;
+                distcode = distfix;
+                distbits = 5;
+                Tracev((stderr, "inflate:     fixed codes block%s\n",
+                        lastblock ? " (last)" : ""));
+                mode = LEN;                     /* decode codes */
+                break;
+            case 2:                             /* dynamic block */
+                Tracev((stderr, "inflate:     dynamic codes block%s\n",
+                        lastblock ? " (last)" : ""));
+                mode = TABLE;
+                break;
+            case 3:
+                strm->msg = (char *)"invalid block type";
+                mode = BAD;
+            }
+            DROPBITS(2);
+            break;
+
+        case STORED:
+            /* get and verify stored block length */
+            BYTEBITS();                         /* go to byte boundary */
+            NEEDBITS(32);
+            if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
+                strm->msg = (char *)"invalid stored block lengths";
+                mode = BAD;
+                break;
+            }
+            length = (unsigned)hold & 0xffff;
+            Tracev((stderr, "inflate:       stored length %lu\n",
+                    length));
+            INITBITS();
+
+            /* copy stored block from input to output */
+            while (length != 0) {
+                copy = length;
+                PULL();
+                ROOM();
+                if (copy > have) copy = have;
+                if (copy > left) copy = left;
+                zmemcpy(put, next, copy);
+                have -= copy;
+                next += copy;
+                left -= copy;
+                put += copy;
+                length -= copy;
+            }
+            Tracev((stderr, "inflate:       stored end\n"));
+            mode = TYPE;
+            break;
+
+        case TABLE:
+            /* get dynamic table entries descriptor */
+            NEEDBITS(14);
+            state->nlen = BITS(5) + 257;
+            DROPBITS(5);
+            state->ndist = BITS(5) + 1;
+            DROPBITS(5);
+            state->ncode = BITS(4) + 4;
+            DROPBITS(4);
+            if (state->nlen > 286) {
+                strm->msg = (char *)"too many length symbols";
+                mode = BAD;
+                break;
+            }
+            Tracev((stderr, "inflate:       table sizes ok\n"));
+
+            /* get code length code lengths (not a typo) */
+            state->have = 0;
+            while (state->have < state->ncode) {
+                NEEDBITS(3);
+                state->lens[order[state->have++]] = (unsigned short)BITS(3);
+                DROPBITS(3);
+            }
+            while (state->have < 19)
+                state->lens[order[state->have++]] = 0;
+            state->next = state->codes;
+            lencode = (code const FAR *)(state->next);
+            lenbits = 7;
+            ret = inflate_table9(CODES, state->lens, 19, &(state->next),
+                                &(lenbits), state->work);
+            if (ret) {
+                strm->msg = (char *)"invalid code lengths set";
+                mode = BAD;
+                break;
+            }
+            Tracev((stderr, "inflate:       code lengths ok\n"));
+
+            /* get length and distance code code lengths */
+            state->have = 0;
+            while (state->have < state->nlen + state->ndist) {
+                for (;;) {
+                    this = lencode[BITS(lenbits)];
+                    if ((unsigned)(this.bits) <= bits) break;
+                    PULLBYTE();
+                }
+                if (this.val < 16) {
+                    NEEDBITS(this.bits);
+                    DROPBITS(this.bits);
+                    state->lens[state->have++] = this.val;
+                }
+                else {
+                    if (this.val == 16) {
+                        NEEDBITS(this.bits + 2);
+                        DROPBITS(this.bits);
+                        if (state->have == 0) {
+                            strm->msg = (char *)"invalid bit length repeat";
+                            mode = BAD;
+                            break;
+                        }
+                        len = (unsigned)(state->lens[state->have - 1]);
+                        copy = 3 + BITS(2);
+                        DROPBITS(2);
+                    }
+                    else if (this.val == 17) {
+                        NEEDBITS(this.bits + 3);
+                        DROPBITS(this.bits);
+                        len = 0;
+                        copy = 3 + BITS(3);
+                        DROPBITS(3);
+                    }
+                    else {
+                        NEEDBITS(this.bits + 7);
+                        DROPBITS(this.bits);
+                        len = 0;
+                        copy = 11 + BITS(7);
+                        DROPBITS(7);
+                    }
+                    if (state->have + copy > state->nlen + state->ndist) {
+                        strm->msg = (char *)"invalid bit length repeat";
+                        mode = BAD;
+                        break;
+                    }
+                    while (copy--)
+                        state->lens[state->have++] = (unsigned short)len;
+                }
+            }
+
+            /* handle error breaks in while */
+            if (mode == BAD) break;
+
+            /* build code tables */
+            state->next = state->codes;
+            lencode = (code const FAR *)(state->next);
+            lenbits = 9;
+            ret = inflate_table9(LENS, state->lens, state->nlen,
+                            &(state->next), &(lenbits), state->work);
+            if (ret) {
+                strm->msg = (char *)"invalid literal/lengths set";
+                mode = BAD;
+                break;
+            }
+            distcode = (code const FAR *)(state->next);
+            distbits = 6;
+            ret = inflate_table9(DISTS, state->lens + state->nlen,
+                            state->ndist, &(state->next), &(distbits),
+                            state->work);
+            if (ret) {
+                strm->msg = (char *)"invalid distances set";
+                mode = BAD;
+                break;
+            }
+            Tracev((stderr, "inflate:       codes ok\n"));
+            mode = LEN;
+
+        case LEN:
+            /* get a literal, length, or end-of-block code */
+            for (;;) {
+                this = lencode[BITS(lenbits)];
+                if ((unsigned)(this.bits) <= bits) break;
+                PULLBYTE();
+            }
+            if (this.op && (this.op & 0xf0) == 0) {
+                last = this;
+                for (;;) {
+                    this = lencode[last.val +
+                            (BITS(last.bits + last.op) >> last.bits)];
+                    if ((unsigned)(last.bits + this.bits) <= bits) break;
+                    PULLBYTE();
+                }
+                DROPBITS(last.bits);
+            }
+            DROPBITS(this.bits);
+            length = (unsigned)this.val;
+
+            /* process literal */
+            if (this.op == 0) {
+                Tracevv((stderr, this.val >= 0x20 && this.val < 0x7f ?
+                        "inflate:         literal '%c'\n" :
+                        "inflate:         literal 0x%02x\n", this.val));
+                ROOM();
+                *put++ = (unsigned char)(length);
+                left--;
+                mode = LEN;
+                break;
+            }
+
+            /* process end of block */
+            if (this.op & 32) {
+                Tracevv((stderr, "inflate:         end of block\n"));
+                mode = TYPE;
+                break;
+            }
+
+            /* invalid code */
+            if (this.op & 64) {
+                strm->msg = (char *)"invalid literal/length code";
+                mode = BAD;
+                break;
+            }
+
+            /* length code -- get extra bits, if any */
+            extra = (unsigned)(this.op) & 31;
+            if (extra != 0) {
+                NEEDBITS(extra);
+                length += BITS(extra);
+                DROPBITS(extra);
+            }
+            Tracevv((stderr, "inflate:         length %lu\n", length));
+
+            /* get distance code */
+            for (;;) {
+                this = distcode[BITS(distbits)];
+                if ((unsigned)(this.bits) <= bits) break;
+                PULLBYTE();
+            }
+            if ((this.op & 0xf0) == 0) {
+                last = this;
+                for (;;) {
+                    this = distcode[last.val +
+                            (BITS(last.bits + last.op) >> last.bits)];
+                    if ((unsigned)(last.bits + this.bits) <= bits) break;
+                    PULLBYTE();
+                }
+                DROPBITS(last.bits);
+            }
+            DROPBITS(this.bits);
+            if (this.op & 64) {
+                strm->msg = (char *)"invalid distance code";
+                mode = BAD;
+                break;
+            }
+            offset = (unsigned)this.val;
+
+            /* get distance extra bits, if any */
+            extra = (unsigned)(this.op) & 15;
+            if (extra != 0) {
+                NEEDBITS(extra);
+                offset += BITS(extra);
+                DROPBITS(extra);
+            }
+            if (offset > WSIZE - (wrap ? 0: left)) {
+                strm->msg = (char *)"invalid distance too far back";
+                mode = BAD;
+                break;
+            }
+            Tracevv((stderr, "inflate:         distance %lu\n", offset));
+
+            /* copy match from window to output */
+            do {
+                ROOM();
+                copy = WSIZE - offset;
+                if (copy < left) {
+                    from = put + copy;
+                    copy = left - copy;
+                }
+                else {
+                    from = put - offset;
+                    copy = left;
+                }
+                if (copy > length) copy = length;
+                length -= copy;
+                left -= copy;
+                do {
+                    *put++ = *from++;
+                } while (--copy);
+            } while (length != 0);
+            break;
+
+        case DONE:
+            /* inflate stream terminated properly -- write leftover output */
+            ret = Z_STREAM_END;
+            if (left < WSIZE) {
+                if (out(out_desc, window, (unsigned)(WSIZE - left)))
+                    ret = Z_BUF_ERROR;
+            }
+            goto inf_leave;
+
+        case BAD:
+            ret = Z_DATA_ERROR;
+            goto inf_leave;
+
+        default:                /* can't happen, but makes compilers happy */
+            ret = Z_STREAM_ERROR;
+            goto inf_leave;
+        }
+
+    /* Return unused input */
+  inf_leave:
+    strm->next_in = next;
+    strm->avail_in = have;
+    return ret;
+}
+
+int ZEXPORT inflateBack9End(strm)
+z_stream FAR *strm;
+{
+    if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
+        return Z_STREAM_ERROR;
+    ZFREE(strm, strm->state);
+    strm->state = Z_NULL;
+    Tracev((stderr, "inflate: end\n"));
+    return Z_OK;
+}
diff --git a/updater/zlib123/contrib/infback9/infback9.h b/updater/zlib123/contrib/infback9/infback9.h
new file mode 100644
index 0000000..2057f40
--- /dev/null
+++ b/updater/zlib123/contrib/infback9/infback9.h
@@ -0,0 +1,37 @@
+/* infback9.h -- header for using inflateBack9 functions
+ * Copyright (C) 2003 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/*
+ * This header file and associated patches provide a decoder for PKWare's
+ * undocumented deflate64 compression method (method 9).  Use with infback9.c,
+ * inftree9.h, inftree9.c, and inffix9.h.  These patches are not supported.
+ * This should be compiled with zlib, since it uses zutil.h and zutil.o.
+ * This code has not yet been tested on 16-bit architectures.  See the
+ * comments in zlib.h for inflateBack() usage.  These functions are used
+ * identically, except that there is no windowBits parameter, and a 64K
+ * window must be provided.  Also if int's are 16 bits, then a zero for
+ * the third parameter of the "out" function actually means 65536UL.
+ * zlib.h must be included before this header file.
+ */
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+ZEXTERN int ZEXPORT inflateBack9 OF((z_stream FAR *strm,
+                                    in_func in, void FAR *in_desc,
+                                    out_func out, void FAR *out_desc));
+ZEXTERN int ZEXPORT inflateBack9End OF((z_stream FAR *strm));
+ZEXTERN int ZEXPORT inflateBack9Init_ OF((z_stream FAR *strm,
+                                         unsigned char FAR *window,
+                                         const char *version,
+                                         int stream_size));
+#define inflateBack9Init(strm, window) \
+        inflateBack9Init_((strm), (window), \
+        ZLIB_VERSION, sizeof(z_stream))
+
+#ifdef __cplusplus
+}
+#endif
diff --git a/updater/zlib123/contrib/infback9/inffix9.h b/updater/zlib123/contrib/infback9/inffix9.h
new file mode 100644
index 0000000..6f128f6
--- /dev/null
+++ b/updater/zlib123/contrib/infback9/inffix9.h
@@ -0,0 +1,107 @@
+    /* inffix9.h -- table for decoding deflate64 fixed codes
+     * Generated automatically by makefixed9().
+     */
+
+    /* WARNING: this file should *not* be used by applications.
+       It is part of the implementation of this library and is
+       subject to change. Applications should only use zlib.h.
+     */
+
+    static const code lenfix[512] = {
+        {96,7,0},{0,8,80},{0,8,16},{132,8,115},{130,7,31},{0,8,112},
+        {0,8,48},{0,9,192},{128,7,10},{0,8,96},{0,8,32},{0,9,160},
+        {0,8,0},{0,8,128},{0,8,64},{0,9,224},{128,7,6},{0,8,88},
+        {0,8,24},{0,9,144},{131,7,59},{0,8,120},{0,8,56},{0,9,208},
+        {129,7,17},{0,8,104},{0,8,40},{0,9,176},{0,8,8},{0,8,136},
+        {0,8,72},{0,9,240},{128,7,4},{0,8,84},{0,8,20},{133,8,227},
+        {131,7,43},{0,8,116},{0,8,52},{0,9,200},{129,7,13},{0,8,100},
+        {0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},
+        {128,7,8},{0,8,92},{0,8,28},{0,9,152},{132,7,83},{0,8,124},
+        {0,8,60},{0,9,216},{130,7,23},{0,8,108},{0,8,44},{0,9,184},
+        {0,8,12},{0,8,140},{0,8,76},{0,9,248},{128,7,3},{0,8,82},
+        {0,8,18},{133,8,163},{131,7,35},{0,8,114},{0,8,50},{0,9,196},
+        {129,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2},{0,8,130},
+        {0,8,66},{0,9,228},{128,7,7},{0,8,90},{0,8,26},{0,9,148},
+        {132,7,67},{0,8,122},{0,8,58},{0,9,212},{130,7,19},{0,8,106},
+        {0,8,42},{0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},
+        {128,7,5},{0,8,86},{0,8,22},{65,8,0},{131,7,51},{0,8,118},
+        {0,8,54},{0,9,204},{129,7,15},{0,8,102},{0,8,38},{0,9,172},
+        {0,8,6},{0,8,134},{0,8,70},{0,9,236},{128,7,9},{0,8,94},
+        {0,8,30},{0,9,156},{132,7,99},{0,8,126},{0,8,62},{0,9,220},
+        {130,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142},
+        {0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{133,8,131},
+        {130,7,31},{0,8,113},{0,8,49},{0,9,194},{128,7,10},{0,8,97},
+        {0,8,33},{0,9,162},{0,8,1},{0,8,129},{0,8,65},{0,9,226},
+        {128,7,6},{0,8,89},{0,8,25},{0,9,146},{131,7,59},{0,8,121},
+        {0,8,57},{0,9,210},{129,7,17},{0,8,105},{0,8,41},{0,9,178},
+        {0,8,9},{0,8,137},{0,8,73},{0,9,242},{128,7,4},{0,8,85},
+        {0,8,21},{144,8,3},{131,7,43},{0,8,117},{0,8,53},{0,9,202},
+        {129,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},
+        {0,8,69},{0,9,234},{128,7,8},{0,8,93},{0,8,29},{0,9,154},
+        {132,7,83},{0,8,125},{0,8,61},{0,9,218},{130,7,23},{0,8,109},
+        {0,8,45},{0,9,186},{0,8,13},{0,8,141},{0,8,77},{0,9,250},
+        {128,7,3},{0,8,83},{0,8,19},{133,8,195},{131,7,35},{0,8,115},
+        {0,8,51},{0,9,198},{129,7,11},{0,8,99},{0,8,35},{0,9,166},
+        {0,8,3},{0,8,131},{0,8,67},{0,9,230},{128,7,7},{0,8,91},
+        {0,8,27},{0,9,150},{132,7,67},{0,8,123},{0,8,59},{0,9,214},
+        {130,7,19},{0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},
+        {0,8,75},{0,9,246},{128,7,5},{0,8,87},{0,8,23},{77,8,0},
+        {131,7,51},{0,8,119},{0,8,55},{0,9,206},{129,7,15},{0,8,103},
+        {0,8,39},{0,9,174},{0,8,7},{0,8,135},{0,8,71},{0,9,238},
+        {128,7,9},{0,8,95},{0,8,31},{0,9,158},{132,7,99},{0,8,127},
+        {0,8,63},{0,9,222},{130,7,27},{0,8,111},{0,8,47},{0,9,190},
+        {0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},
+        {0,8,16},{132,8,115},{130,7,31},{0,8,112},{0,8,48},{0,9,193},
+        {128,7,10},{0,8,96},{0,8,32},{0,9,161},{0,8,0},{0,8,128},
+        {0,8,64},{0,9,225},{128,7,6},{0,8,88},{0,8,24},{0,9,145},
+        {131,7,59},{0,8,120},{0,8,56},{0,9,209},{129,7,17},{0,8,104},
+        {0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72},{0,9,241},
+        {128,7,4},{0,8,84},{0,8,20},{133,8,227},{131,7,43},{0,8,116},
+        {0,8,52},{0,9,201},{129,7,13},{0,8,100},{0,8,36},{0,9,169},
+        {0,8,4},{0,8,132},{0,8,68},{0,9,233},{128,7,8},{0,8,92},
+        {0,8,28},{0,9,153},{132,7,83},{0,8,124},{0,8,60},{0,9,217},
+        {130,7,23},{0,8,108},{0,8,44},{0,9,185},{0,8,12},{0,8,140},
+        {0,8,76},{0,9,249},{128,7,3},{0,8,82},{0,8,18},{133,8,163},
+        {131,7,35},{0,8,114},{0,8,50},{0,9,197},{129,7,11},{0,8,98},
+        {0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229},
+        {128,7,7},{0,8,90},{0,8,26},{0,9,149},{132,7,67},{0,8,122},
+        {0,8,58},{0,9,213},{130,7,19},{0,8,106},{0,8,42},{0,9,181},
+        {0,8,10},{0,8,138},{0,8,74},{0,9,245},{128,7,5},{0,8,86},
+        {0,8,22},{65,8,0},{131,7,51},{0,8,118},{0,8,54},{0,9,205},
+        {129,7,15},{0,8,102},{0,8,38},{0,9,173},{0,8,6},{0,8,134},
+        {0,8,70},{0,9,237},{128,7,9},{0,8,94},{0,8,30},{0,9,157},
+        {132,7,99},{0,8,126},{0,8,62},{0,9,221},{130,7,27},{0,8,110},
+        {0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},
+        {96,7,0},{0,8,81},{0,8,17},{133,8,131},{130,7,31},{0,8,113},
+        {0,8,49},{0,9,195},{128,7,10},{0,8,97},{0,8,33},{0,9,163},
+        {0,8,1},{0,8,129},{0,8,65},{0,9,227},{128,7,6},{0,8,89},
+        {0,8,25},{0,9,147},{131,7,59},{0,8,121},{0,8,57},{0,9,211},
+        {129,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9},{0,8,137},
+        {0,8,73},{0,9,243},{128,7,4},{0,8,85},{0,8,21},{144,8,3},
+        {131,7,43},{0,8,117},{0,8,53},{0,9,203},{129,7,13},{0,8,101},
+        {0,8,37},{0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},
+        {128,7,8},{0,8,93},{0,8,29},{0,9,155},{132,7,83},{0,8,125},
+        {0,8,61},{0,9,219},{130,7,23},{0,8,109},{0,8,45},{0,9,187},
+        {0,8,13},{0,8,141},{0,8,77},{0,9,251},{128,7,3},{0,8,83},
+        {0,8,19},{133,8,195},{131,7,35},{0,8,115},{0,8,51},{0,9,199},
+        {129,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131},
+        {0,8,67},{0,9,231},{128,7,7},{0,8,91},{0,8,27},{0,9,151},
+        {132,7,67},{0,8,123},{0,8,59},{0,9,215},{130,7,19},{0,8,107},
+        {0,8,43},{0,9,183},{0,8,11},{0,8,139},{0,8,75},{0,9,247},
+        {128,7,5},{0,8,87},{0,8,23},{77,8,0},{131,7,51},{0,8,119},
+        {0,8,55},{0,9,207},{129,7,15},{0,8,103},{0,8,39},{0,9,175},
+        {0,8,7},{0,8,135},{0,8,71},{0,9,239},{128,7,9},{0,8,95},
+        {0,8,31},{0,9,159},{132,7,99},{0,8,127},{0,8,63},{0,9,223},
+        {130,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},
+        {0,8,79},{0,9,255}
+    };
+
+    static const code distfix[32] = {
+        {128,5,1},{135,5,257},{131,5,17},{139,5,4097},{129,5,5},
+        {137,5,1025},{133,5,65},{141,5,16385},{128,5,3},{136,5,513},
+        {132,5,33},{140,5,8193},{130,5,9},{138,5,2049},{134,5,129},
+        {142,5,32769},{128,5,2},{135,5,385},{131,5,25},{139,5,6145},
+        {129,5,7},{137,5,1537},{133,5,97},{141,5,24577},{128,5,4},
+        {136,5,769},{132,5,49},{140,5,12289},{130,5,13},{138,5,3073},
+        {134,5,193},{142,5,49153}
+    };
diff --git a/updater/zlib123/contrib/infback9/inflate9.h b/updater/zlib123/contrib/infback9/inflate9.h
new file mode 100644
index 0000000..893a46f
--- /dev/null
+++ b/updater/zlib123/contrib/infback9/inflate9.h
@@ -0,0 +1,47 @@
+/* inflate9.h -- internal inflate state definition
+ * Copyright (C) 1995-2003 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+   part of the implementation of the compression library and is
+   subject to change. Applications should only use zlib.h.
+ */
+
+/* Possible inflate modes between inflate() calls */
+typedef enum {
+        TYPE,       /* i: waiting for type bits, including last-flag bit */
+        STORED,     /* i: waiting for stored size (length and complement) */
+        TABLE,      /* i: waiting for dynamic block table lengths */
+            LEN,        /* i: waiting for length/lit code */
+    DONE,       /* finished check, done -- remain here until reset */
+    BAD         /* got a data error -- remain here until reset */
+} inflate_mode;
+
+/*
+    State transitions between above modes -
+
+    (most modes can go to the BAD mode -- not shown for clarity)
+
+    Read deflate blocks:
+            TYPE -> STORED or TABLE or LEN or DONE
+            STORED -> TYPE
+            TABLE -> LENLENS -> CODELENS -> LEN
+    Read deflate codes:
+                LEN -> LEN or TYPE
+ */
+
+/* state maintained between inflate() calls.  Approximately 7K bytes. */
+struct inflate_state {
+        /* sliding window */
+    unsigned char FAR *window;  /* allocated sliding window, if needed */
+        /* dynamic table building */
+    unsigned ncode;             /* number of code length code lengths */
+    unsigned nlen;              /* number of length code lengths */
+    unsigned ndist;             /* number of distance code lengths */
+    unsigned have;              /* number of code lengths in lens[] */
+    code FAR *next;             /* next available space in codes[] */
+    unsigned short lens[320];   /* temporary storage for code lengths */
+    unsigned short work[288];   /* work area for code table building */
+    code codes[ENOUGH];         /* space for code tables */
+};
diff --git a/updater/zlib123/contrib/infback9/inftree9.c b/updater/zlib123/contrib/infback9/inftree9.c
new file mode 100644
index 0000000..dd96783
--- /dev/null
+++ b/updater/zlib123/contrib/infback9/inftree9.c
@@ -0,0 +1,323 @@
+/* inftree9.c -- generate Huffman trees for efficient decoding
+ * Copyright (C) 1995-2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+#include "zutil.h"
+#include "inftree9.h"
+
+#define MAXBITS 15
+
+const char inflate9_copyright[] =
+   " inflate9 1.2.3 Copyright 1995-2005 Mark Adler ";
+/*
+  If you use the zlib library in a product, an acknowledgment is welcome
+  in the documentation of your product. If for some reason you cannot
+  include such an acknowledgment, I would appreciate that you keep this
+  copyright string in the executable of your product.
+ */
+
+/*
+   Build a set of tables to decode the provided canonical Huffman code.
+   The code lengths are lens[0..codes-1].  The result starts at *table,
+   whose indices are 0..2^bits-1.  work is a writable array of at least
+   lens shorts, which is used as a work area.  type is the type of code
+   to be generated, CODES, LENS, or DISTS.  On return, zero is success,
+   -1 is an invalid code, and +1 means that ENOUGH isn't enough.  table
+   on return points to the next available entry's address.  bits is the
+   requested root table index bits, and on return it is the actual root
+   table index bits.  It will differ if the request is greater than the
+   longest code or if it is less than the shortest code.
+ */
+int inflate_table9(type, lens, codes, table, bits, work)
+codetype type;
+unsigned short FAR *lens;
+unsigned codes;
+code FAR * FAR *table;
+unsigned FAR *bits;
+unsigned short FAR *work;
+{
+    unsigned len;               /* a code's length in bits */
+    unsigned sym;               /* index of code symbols */
+    unsigned min, max;          /* minimum and maximum code lengths */
+    unsigned root;              /* number of index bits for root table */
+    unsigned curr;              /* number of index bits for current table */
+    unsigned drop;              /* code bits to drop for sub-table */
+    int left;                   /* number of prefix codes available */
+    unsigned used;              /* code entries in table used */
+    unsigned huff;              /* Huffman code */
+    unsigned incr;              /* for incrementing code, index */
+    unsigned fill;              /* index for replicating entries */
+    unsigned low;               /* low bits for current root entry */
+    unsigned mask;              /* mask for low root bits */
+    code this;                  /* table entry for duplication */
+    code FAR *next;             /* next available space in table */
+    const unsigned short FAR *base;     /* base value table to use */
+    const unsigned short FAR *extra;    /* extra bits table to use */
+    int end;                    /* use base and extra for symbol > end */
+    unsigned short count[MAXBITS+1];    /* number of codes of each length */
+    unsigned short offs[MAXBITS+1];     /* offsets in table for each length */
+    static const unsigned short lbase[31] = { /* Length codes 257..285 base */
+        3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17,
+        19, 23, 27, 31, 35, 43, 51, 59, 67, 83, 99, 115,
+        131, 163, 195, 227, 3, 0, 0};
+    static const unsigned short lext[31] = { /* Length codes 257..285 extra */
+        128, 128, 128, 128, 128, 128, 128, 128, 129, 129, 129, 129,
+        130, 130, 130, 130, 131, 131, 131, 131, 132, 132, 132, 132,
+        133, 133, 133, 133, 144, 201, 196};
+    static const unsigned short dbase[32] = { /* Distance codes 0..31 base */
+        1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49,
+        65, 97, 129, 193, 257, 385, 513, 769, 1025, 1537, 2049, 3073,
+        4097, 6145, 8193, 12289, 16385, 24577, 32769, 49153};
+    static const unsigned short dext[32] = { /* Distance codes 0..31 extra */
+        128, 128, 128, 128, 129, 129, 130, 130, 131, 131, 132, 132,
+        133, 133, 134, 134, 135, 135, 136, 136, 137, 137, 138, 138,
+        139, 139, 140, 140, 141, 141, 142, 142};
+
+    /*
+       Process a set of code lengths to create a canonical Huffman code.  The
+       code lengths are lens[0..codes-1].  Each length corresponds to the
+       symbols 0..codes-1.  The Huffman code is generated by first sorting the
+       symbols by length from short to long, and retaining the symbol order
+       for codes with equal lengths.  Then the code starts with all zero bits
+       for the first code of the shortest length, and the codes are integer
+       increments for the same length, and zeros are appended as the length
+       increases.  For the deflate format, these bits are stored backwards
+       from their more natural integer increment ordering, and so when the
+       decoding tables are built in the large loop below, the integer codes
+       are incremented backwards.
+
+       This routine assumes, but does not check, that all of the entries in
+       lens[] are in the range 0..MAXBITS.  The caller must assure this.
+       1..MAXBITS is interpreted as that code length.  zero means that that
+       symbol does not occur in this code.
+
+       The codes are sorted by computing a count of codes for each length,
+       creating from that a table of starting indices for each length in the
+       sorted table, and then entering the symbols in order in the sorted
+       table.  The sorted table is work[], with that space being provided by
+       the caller.
+
+       The length counts are used for other purposes as well, i.e. finding
+       the minimum and maximum length codes, determining if there are any
+       codes at all, checking for a valid set of lengths, and looking ahead
+       at length counts to determine sub-table sizes when building the
+       decoding tables.
+     */
+
+    /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
+    for (len = 0; len <= MAXBITS; len++)
+        count[len] = 0;
+    for (sym = 0; sym < codes; sym++)
+        count[lens[sym]]++;
+
+    /* bound code lengths, force root to be within code lengths */
+    root = *bits;
+    for (max = MAXBITS; max >= 1; max--)
+        if (count[max] != 0) break;
+    if (root > max) root = max;
+    if (max == 0) return -1;            /* no codes! */
+    for (min = 1; min <= MAXBITS; min++)
+        if (count[min] != 0) break;
+    if (root < min) root = min;
+
+    /* check for an over-subscribed or incomplete set of lengths */
+    left = 1;
+    for (len = 1; len <= MAXBITS; len++) {
+        left <<= 1;
+        left -= count[len];
+        if (left < 0) return -1;        /* over-subscribed */
+    }
+    if (left > 0 && (type == CODES || max != 1))
+        return -1;                      /* incomplete set */
+
+    /* generate offsets into symbol table for each length for sorting */
+    offs[1] = 0;
+    for (len = 1; len < MAXBITS; len++)
+        offs[len + 1] = offs[len] + count[len];
+
+    /* sort symbols by length, by symbol order within each length */
+    for (sym = 0; sym < codes; sym++)
+        if (lens[sym] != 0) work[offs[lens[sym]]++] = (unsigned short)sym;
+
+    /*
+       Create and fill in decoding tables.  In this loop, the table being
+       filled is at next and has curr index bits.  The code being used is huff
+       with length len.  That code is converted to an index by dropping drop
+       bits off of the bottom.  For codes where len is less than drop + curr,
+       those top drop + curr - len bits are incremented through all values to
+       fill the table with replicated entries.
+
+       root is the number of index bits for the root table.  When len exceeds
+       root, sub-tables are created pointed to by the root entry with an index
+       of the low root bits of huff.  This is saved in low to check for when a
+       new sub-table should be started.  drop is zero when the root table is
+       being filled, and drop is root when sub-tables are being filled.
+
+       When a new sub-table is needed, it is necessary to look ahead in the
+       code lengths to determine what size sub-table is needed.  The length
+       counts are used for this, and so count[] is decremented as codes are
+       entered in the tables.
+
+       used keeps track of how many table entries have been allocated from the
+       provided *table space.  It is checked when a LENS table is being made
+       against the space in *table, ENOUGH, minus the maximum space needed by
+       the worst case distance code, MAXD.  This should never happen, but the
+       sufficiency of ENOUGH has not been proven exhaustively, hence the check.
+       This assumes that when type == LENS, bits == 9.
+
+       sym increments through all symbols, and the loop terminates when
+       all codes of length max, i.e. all codes, have been processed.  This
+       routine permits incomplete codes, so another loop after this one fills
+       in the rest of the decoding tables with invalid code markers.
+     */
+
+    /* set up for code type */
+    switch (type) {
+    case CODES:
+        base = extra = work;    /* dummy value--not used */
+        end = 19;
+        break;
+    case LENS:
+        base = lbase;
+        base -= 257;
+        extra = lext;
+        extra -= 257;
+        end = 256;
+        break;
+    default:            /* DISTS */
+        base = dbase;
+        extra = dext;
+        end = -1;
+    }
+
+    /* initialize state for loop */
+    huff = 0;                   /* starting code */
+    sym = 0;                    /* starting code symbol */
+    len = min;                  /* starting code length */
+    next = *table;              /* current table to fill in */
+    curr = root;                /* current table index bits */
+    drop = 0;                   /* current bits to drop from code for index */
+    low = (unsigned)(-1);       /* trigger new sub-table when len > root */
+    used = 1U << root;          /* use root table entries */
+    mask = used - 1;            /* mask for comparing low */
+
+    /* check available table space */
+    if (type == LENS && used >= ENOUGH - MAXD)
+        return 1;
+
+    /* process all codes and make table entries */
+    for (;;) {
+        /* create table entry */
+        this.bits = (unsigned char)(len - drop);
+        if ((int)(work[sym]) < end) {
+            this.op = (unsigned char)0;
+            this.val = work[sym];
+        }
+        else if ((int)(work[sym]) > end) {
+            this.op = (unsigned char)(extra[work[sym]]);
+            this.val = base[work[sym]];
+        }
+        else {
+            this.op = (unsigned char)(32 + 64);         /* end of block */
+            this.val = 0;
+        }
+
+        /* replicate for those indices with low len bits equal to huff */
+        incr = 1U << (len - drop);
+        fill = 1U << curr;
+        do {
+            fill -= incr;
+            next[(huff >> drop) + fill] = this;
+        } while (fill != 0);
+
+        /* backwards increment the len-bit code huff */
+        incr = 1U << (len - 1);
+        while (huff & incr)
+            incr >>= 1;
+        if (incr != 0) {
+            huff &= incr - 1;
+            huff += incr;
+        }
+        else
+            huff = 0;
+
+        /* go to next symbol, update count, len */
+        sym++;
+        if (--(count[len]) == 0) {
+            if (len == max) break;
+            len = lens[work[sym]];
+        }
+
+        /* create new sub-table if needed */
+        if (len > root && (huff & mask) != low) {
+            /* if first time, transition to sub-tables */
+            if (drop == 0)
+                drop = root;
+
+            /* increment past last table */
+            next += 1U << curr;
+
+            /* determine length of next table */
+            curr = len - drop;
+            left = (int)(1 << curr);
+            while (curr + drop < max) {
+                left -= count[curr + drop];
+                if (left <= 0) break;
+                curr++;
+                left <<= 1;
+            }
+
+            /* check for enough space */
+            used += 1U << curr;
+            if (type == LENS && used >= ENOUGH - MAXD)
+                return 1;
+
+            /* point entry in root table to sub-table */
+            low = huff & mask;
+            (*table)[low].op = (unsigned char)curr;
+            (*table)[low].bits = (unsigned char)root;
+            (*table)[low].val = (unsigned short)(next - *table);
+        }
+    }
+
+    /*
+       Fill in rest of table for incomplete codes.  This loop is similar to the
+       loop above in incrementing huff for table indices.  It is assumed that
+       len is equal to curr + drop, so there is no loop needed to increment
+       through high index bits.  When the current sub-table is filled, the loop
+       drops back to the root table to fill in any remaining entries there.
+     */
+    this.op = (unsigned char)64;                /* invalid code marker */
+    this.bits = (unsigned char)(len - drop);
+    this.val = (unsigned short)0;
+    while (huff != 0) {
+        /* when done with sub-table, drop back to root table */
+        if (drop != 0 && (huff & mask) != low) {
+            drop = 0;
+            len = root;
+            next = *table;
+            curr = root;
+            this.bits = (unsigned char)len;
+        }
+
+        /* put invalid code marker in table */
+        next[huff >> drop] = this;
+
+        /* backwards increment the len-bit code huff */
+        incr = 1U << (len - 1);
+        while (huff & incr)
+            incr >>= 1;
+        if (incr != 0) {
+            huff &= incr - 1;
+            huff += incr;
+        }
+        else
+            huff = 0;
+    }
+
+    /* set return parameters */
+    *table += used;
+    *bits = root;
+    return 0;
+}
diff --git a/updater/zlib123/contrib/infback9/inftree9.h b/updater/zlib123/contrib/infback9/inftree9.h
new file mode 100644
index 0000000..6e58571
--- /dev/null
+++ b/updater/zlib123/contrib/infback9/inftree9.h
@@ -0,0 +1,55 @@
+/* inftree9.h -- header to use inftree9.c
+ * Copyright (C) 1995-2003 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+   part of the implementation of the compression library and is
+   subject to change. Applications should only use zlib.h.
+ */
+
+/* Structure for decoding tables.  Each entry provides either the
+   information needed to do the operation requested by the code that
+   indexed that table entry, or it provides a pointer to another
+   table that indexes more bits of the code.  op indicates whether
+   the entry is a pointer to another table, a literal, a length or
+   distance, an end-of-block, or an invalid code.  For a table
+   pointer, the low four bits of op is the number of index bits of
+   that table.  For a length or distance, the low four bits of op
+   is the number of extra bits to get after the code.  bits is
+   the number of bits in this code or part of the code to drop off
+   of the bit buffer.  val is the actual byte to output in the case
+   of a literal, the base length or distance, or the offset from
+   the current table to the next table.  Each entry is four bytes. */
+typedef struct {
+    unsigned char op;           /* operation, extra bits, table bits */
+    unsigned char bits;         /* bits in this part of the code */
+    unsigned short val;         /* offset in table or code value */
+} code;
+
+/* op values as set by inflate_table():
+    00000000 - literal
+    0000tttt - table link, tttt != 0 is the number of table index bits
+    100eeeee - length or distance, eeee is the number of extra bits
+    01100000 - end of block
+    01000000 - invalid code
+ */
+
+/* Maximum size of dynamic tree.  The maximum found in a long but non-
+   exhaustive search was 1444 code structures (852 for length/literals
+   and 592 for distances, the latter actually the result of an
+   exhaustive search).  The true maximum is not known, but the value
+   below is more than safe. */
+#define ENOUGH 2048
+#define MAXD 592
+
+/* Type of code to build for inftable() */
+typedef enum {
+    CODES,
+    LENS,
+    DISTS
+} codetype;
+
+extern int inflate_table9 OF((codetype type, unsigned short FAR *lens,
+                             unsigned codes, code FAR * FAR *table,
+                             unsigned FAR *bits, unsigned short FAR *work));
diff --git a/updater/zlib123/contrib/inflate86/inffas86.c b/updater/zlib123/contrib/inflate86/inffas86.c
new file mode 100644
index 0000000..58d3c36
--- /dev/null
+++ b/updater/zlib123/contrib/inflate86/inffas86.c
@@ -0,0 +1,1157 @@
+/* inffas86.c is a hand tuned assembler version of
+ *
+ * inffast.c -- fast decoding
+ * Copyright (C) 1995-2003 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ *
+ * Copyright (C) 2003 Chris Anderson <christop@charm.net>
+ * Please use the copyright conditions above.
+ *
+ * Dec-29-2003 -- I added AMD64 inflate asm support.  This version is also
+ * slightly quicker on x86 systems because, instead of using rep movsb to copy
+ * data, it uses rep movsw, which moves data in 2-byte chunks instead of single
+ * bytes.  I've tested the AMD64 code on a Fedora Core 1 + the x86_64 updates
+ * from http://fedora.linux.duke.edu/fc1_x86_64
+ * which is running on an Athlon 64 3000+ / Gigabyte GA-K8VT800M system with
+ * 1GB ram.  The 64-bit version is about 4% faster than the 32-bit version,
+ * when decompressing mozilla-source-1.3.tar.gz.
+ *
+ * Mar-13-2003 -- Most of this is derived from inffast.S which is derived from
+ * the gcc -S output of zlib-1.2.0/inffast.c.  Zlib-1.2.0 is in beta release at
+ * the moment.  I have successfully compiled and tested this code with gcc2.96,
+ * gcc3.2, icc5.0, msvc6.0.  It is very close to the speed of inffast.S
+ * compiled with gcc -DNO_MMX, but inffast.S is still faster on the P3 with MMX
+ * enabled.  I will attempt to merge the MMX code into this version.  Newer
+ * versions of this and inffast.S can be found at
+ * http://www.eetbeetee.com/zlib/ and http://www.charm.net/~christop/zlib/
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+#include "inflate.h"
+#include "inffast.h"
+
+/* Mark Adler's comments from inffast.c: */
+
+/*
+   Decode literal, length, and distance codes and write out the resulting
+   literal and match bytes until either not enough input or output is
+   available, an end-of-block is encountered, or a data error is encountered.
+   When large enough input and output buffers are supplied to inflate(), for
+   example, a 16K input buffer and a 64K output buffer, more than 95% of the
+   inflate execution time is spent in this routine.
+
+   Entry assumptions:
+
+        state->mode == LEN
+        strm->avail_in >= 6
+        strm->avail_out >= 258
+        start >= strm->avail_out
+        state->bits < 8
+
+   On return, state->mode is one of:
+
+        LEN -- ran out of enough output space or enough available input
+        TYPE -- reached end of block code, inflate() to interpret next block
+        BAD -- error in block data
+
+   Notes:
+
+    - The maximum input bits used by a length/distance pair is 15 bits for the
+      length code, 5 bits for the length extra, 15 bits for the distance code,
+      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.
+      Therefore if strm->avail_in >= 6, then there is enough input to avoid
+      checking for available input while decoding.
+
+    - The maximum bytes that a single length/distance pair can output is 258
+      bytes, which is the maximum length that can be coded.  inflate_fast()
+      requires strm->avail_out >= 258 for each loop to avoid checking for
+      output space.
+ */
+void inflate_fast(strm, start)
+z_streamp strm;
+unsigned start;         /* inflate()'s starting value for strm->avail_out */
+{
+    struct inflate_state FAR *state;
+    struct inffast_ar {
+/* 64   32                               x86  x86_64 */
+/* ar offset                              register */
+/*  0    0 */ void *esp;                /* esp save */
+/*  8    4 */ void *ebp;                /* ebp save */
+/* 16    8 */ unsigned char FAR *in;    /* esi rsi  local strm->next_in */
+/* 24   12 */ unsigned char FAR *last;  /*     r9   while in < last */
+/* 32   16 */ unsigned char FAR *out;   /* edi rdi  local strm->next_out */
+/* 40   20 */ unsigned char FAR *beg;   /*          inflate()'s init next_out */
+/* 48   24 */ unsigned char FAR *end;   /*     r10  while out < end */
+/* 56   28 */ unsigned char FAR *window;/*          size of window, wsize!=0 */
+/* 64   32 */ code const FAR *lcode;    /* ebp rbp  local strm->lencode */
+/* 72   36 */ code const FAR *dcode;    /*     r11  local strm->distcode */
+/* 80   40 */ unsigned long hold;       /* edx rdx  local strm->hold */
+/* 88   44 */ unsigned bits;            /* ebx rbx  local strm->bits */
+/* 92   48 */ unsigned wsize;           /*          window size */
+/* 96   52 */ unsigned write;           /*          window write index */
+/*100   56 */ unsigned lmask;           /*     r12  mask for lcode */
+/*104   60 */ unsigned dmask;           /*     r13  mask for dcode */
+/*108   64 */ unsigned len;             /*     r14  match length */
+/*112   68 */ unsigned dist;            /*     r15  match distance */
+/*116   72 */ unsigned status;          /*          set when state chng*/
+    } ar;
+
+#if defined( __GNUC__ ) && defined( __amd64__ ) && ! defined( __i386 )
+#define PAD_AVAIL_IN 6
+#define PAD_AVAIL_OUT 258
+#else
+#define PAD_AVAIL_IN 5
+#define PAD_AVAIL_OUT 257
+#endif
+
+    /* copy state to local variables */
+    state = (struct inflate_state FAR *)strm->state;
+    ar.in = strm->next_in;
+    ar.last = ar.in + (strm->avail_in - PAD_AVAIL_IN);
+    ar.out = strm->next_out;
+    ar.beg = ar.out - (start - strm->avail_out);
+    ar.end = ar.out + (strm->avail_out - PAD_AVAIL_OUT);
+    ar.wsize = state->wsize;
+    ar.write = state->write;
+    ar.window = state->window;
+    ar.hold = state->hold;
+    ar.bits = state->bits;
+    ar.lcode = state->lencode;
+    ar.dcode = state->distcode;
+    ar.lmask = (1U << state->lenbits) - 1;
+    ar.dmask = (1U << state->distbits) - 1;
+
+    /* decode literals and length/distances until end-of-block or not enough
+       input data or output space */
+
+    /* align in on 1/2 hold size boundary */
+    while (((unsigned long)(void *)ar.in & (sizeof(ar.hold) / 2 - 1)) != 0) {
+        ar.hold += (unsigned long)*ar.in++ << ar.bits;
+        ar.bits += 8;
+    }
+
+#if defined( __GNUC__ ) && defined( __amd64__ ) && ! defined( __i386 )
+    __asm__ __volatile__ (
+"        leaq    %0, %%rax\n"
+"        movq    %%rbp, 8(%%rax)\n"       /* save regs rbp and rsp */
+"        movq    %%rsp, (%%rax)\n"
+"        movq    %%rax, %%rsp\n"          /* make rsp point to &ar */
+"        movq    16(%%rsp), %%rsi\n"      /* rsi  = in */
+"        movq    32(%%rsp), %%rdi\n"      /* rdi  = out */
+"        movq    24(%%rsp), %%r9\n"       /* r9   = last */
+"        movq    48(%%rsp), %%r10\n"      /* r10  = end */
+"        movq    64(%%rsp), %%rbp\n"      /* rbp  = lcode */
+"        movq    72(%%rsp), %%r11\n"      /* r11  = dcode */
+"        movq    80(%%rsp), %%rdx\n"      /* rdx  = hold */
+"        movl    88(%%rsp), %%ebx\n"      /* ebx  = bits */
+"        movl    100(%%rsp), %%r12d\n"    /* r12d = lmask */
+"        movl    104(%%rsp), %%r13d\n"    /* r13d = dmask */
+                                          /* r14d = len */
+                                          /* r15d = dist */
+"        cld\n"
+"        cmpq    %%rdi, %%r10\n"
+"        je      .L_one_time\n"           /* if only one decode left */
+"        cmpq    %%rsi, %%r9\n"
+"        je      .L_one_time\n"
+"        jmp     .L_do_loop\n"
+
+".L_one_time:\n"
+"        movq    %%r12, %%r8\n"           /* r8 = lmask */
+"        cmpb    $32, %%bl\n"
+"        ja      .L_get_length_code_one_time\n"
+
+"        lodsl\n"                         /* eax = *(uint *)in++ */
+"        movb    %%bl, %%cl\n"            /* cl = bits, needs it for shifting */
+"        addb    $32, %%bl\n"             /* bits += 32 */
+"        shlq    %%cl, %%rax\n"
+"        orq     %%rax, %%rdx\n"          /* hold |= *((uint *)in)++ << bits */
+"        jmp     .L_get_length_code_one_time\n"
+
+".align 32,0x90\n"
+".L_while_test:\n"
+"        cmpq    %%rdi, %%r10\n"
+"        jbe     .L_break_loop\n"
+"        cmpq    %%rsi, %%r9\n"
+"        jbe     .L_break_loop\n"
+
+".L_do_loop:\n"
+"        movq    %%r12, %%r8\n"           /* r8 = lmask */
+"        cmpb    $32, %%bl\n"
+"        ja      .L_get_length_code\n"    /* if (32 < bits) */
+
+"        lodsl\n"                         /* eax = *(uint *)in++ */
+"        movb    %%bl, %%cl\n"            /* cl = bits, needs it for shifting */
+"        addb    $32, %%bl\n"             /* bits += 32 */
+"        shlq    %%cl, %%rax\n"
+"        orq     %%rax, %%rdx\n"          /* hold |= *((uint *)in)++ << bits */
+
+".L_get_length_code:\n"
+"        andq    %%rdx, %%r8\n"            /* r8 &= hold */
+"        movl    (%%rbp,%%r8,4), %%eax\n"  /* eax = lcode[hold & lmask] */
+
+"        movb    %%ah, %%cl\n"            /* cl = this.bits */
+"        subb    %%ah, %%bl\n"            /* bits -= this.bits */
+"        shrq    %%cl, %%rdx\n"           /* hold >>= this.bits */
+
+"        testb   %%al, %%al\n"
+"        jnz     .L_test_for_length_base\n" /* if (op != 0) 45.7% */
+
+"        movq    %%r12, %%r8\n"            /* r8 = lmask */
+"        shrl    $16, %%eax\n"            /* output this.val char */
+"        stosb\n"
+
+".L_get_length_code_one_time:\n"
+"        andq    %%rdx, %%r8\n"            /* r8 &= hold */
+"        movl    (%%rbp,%%r8,4), %%eax\n" /* eax = lcode[hold & lmask] */
+
+".L_dolen:\n"
+"        movb    %%ah, %%cl\n"            /* cl = this.bits */
+"        subb    %%ah, %%bl\n"            /* bits -= this.bits */
+"        shrq    %%cl, %%rdx\n"           /* hold >>= this.bits */
+
+"        testb   %%al, %%al\n"
+"        jnz     .L_test_for_length_base\n" /* if (op != 0) 45.7% */
+
+"        shrl    $16, %%eax\n"            /* output this.val char */
+"        stosb\n"
+"        jmp     .L_while_test\n"
+
+".align 32,0x90\n"
+".L_test_for_length_base:\n"
+"        movl    %%eax, %%r14d\n"         /* len = this */
+"        shrl    $16, %%r14d\n"           /* len = this.val */
+"        movb    %%al, %%cl\n"
+
+"        testb   $16, %%al\n"
+"        jz      .L_test_for_second_level_length\n" /* if ((op & 16) == 0) 8% */
+"        andb    $15, %%cl\n"             /* op &= 15 */
+"        jz      .L_decode_distance\n"    /* if (!op) */
+
+".L_add_bits_to_len:\n"
+"        subb    %%cl, %%bl\n"
+"        xorl    %%eax, %%eax\n"
+"        incl    %%eax\n"
+"        shll    %%cl, %%eax\n"
+"        decl    %%eax\n"
+"        andl    %%edx, %%eax\n"          /* eax &= hold */
+"        shrq    %%cl, %%rdx\n"
+"        addl    %%eax, %%r14d\n"         /* len += hold & mask[op] */
+
+".L_decode_distance:\n"
+"        movq    %%r13, %%r8\n"           /* r8 = dmask */
+"        cmpb    $32, %%bl\n"
+"        ja      .L_get_distance_code\n"  /* if (32 < bits) */
+
+"        lodsl\n"                         /* eax = *(uint *)in++ */
+"        movb    %%bl, %%cl\n"            /* cl = bits, needs it for shifting */
+"        addb    $32, %%bl\n"             /* bits += 32 */
+"        shlq    %%cl, %%rax\n"
+"        orq     %%rax, %%rdx\n"          /* hold |= *((uint *)in)++ << bits */
+
+".L_get_distance_code:\n"
+"        andq    %%rdx, %%r8\n"           /* r8 &= hold */
+"        movl    (%%r11,%%r8,4), %%eax\n" /* eax = dcode[hold & dmask] */
+
+".L_dodist:\n"
+"        movl    %%eax, %%r15d\n"         /* dist = this */
+"        shrl    $16, %%r15d\n"           /* dist = this.val */
+"        movb    %%ah, %%cl\n"
+"        subb    %%ah, %%bl\n"            /* bits -= this.bits */
+"        shrq    %%cl, %%rdx\n"           /* hold >>= this.bits */
+"        movb    %%al, %%cl\n"            /* cl = this.op */
+
+"        testb   $16, %%al\n"             /* if ((op & 16) == 0) */
+"        jz      .L_test_for_second_level_dist\n"
+"        andb    $15, %%cl\n"             /* op &= 15 */
+"        jz      .L_check_dist_one\n"
+
+".L_add_bits_to_dist:\n"
+"        subb    %%cl, %%bl\n"
+"        xorl    %%eax, %%eax\n"
+"        incl    %%eax\n"
+"        shll    %%cl, %%eax\n"
+"        decl    %%eax\n"                 /* (1 << op) - 1 */
+"        andl    %%edx, %%eax\n"          /* eax &= hold */
+"        shrq    %%cl, %%rdx\n"
+"        addl    %%eax, %%r15d\n"         /* dist += hold & ((1 << op) - 1) */
+
+".L_check_window:\n"
+"        movq    %%rsi, %%r8\n"           /* save in so from can use it's reg */
+"        movq    %%rdi, %%rax\n"
+"        subq    40(%%rsp), %%rax\n"      /* nbytes = out - beg */
+
+"        cmpl    %%r15d, %%eax\n"
+"        jb      .L_clip_window\n"        /* if (dist > nbytes) 4.2% */
+
+"        movl    %%r14d, %%ecx\n"         /* ecx = len */
+"        movq    %%rdi, %%rsi\n"
+"        subq    %%r15, %%rsi\n"          /* from = out - dist */
+
+"        sarl    %%ecx\n"
+"        jnc     .L_copy_two\n"           /* if len % 2 == 0 */
+
+"        rep     movsw\n"
+"        movb    (%%rsi), %%al\n"
+"        movb    %%al, (%%rdi)\n"
+"        incq    %%rdi\n"
+
+"        movq    %%r8, %%rsi\n"           /* move in back to %rsi, toss from */
+"        jmp     .L_while_test\n"
+
+".L_copy_two:\n"
+"        rep     movsw\n"
+"        movq    %%r8, %%rsi\n"           /* move in back to %rsi, toss from */
+"        jmp     .L_while_test\n"
+
+".align 32,0x90\n"
+".L_check_dist_one:\n"
+"        cmpl    $1, %%r15d\n"            /* if dist 1, is a memset */
+"        jne     .L_check_window\n"
+"        cmpq    %%rdi, 40(%%rsp)\n"      /* if out == beg, outside window */
+"        je      .L_check_window\n"
+
+"        movl    %%r14d, %%ecx\n"         /* ecx = len */
+"        movb    -1(%%rdi), %%al\n"
+"        movb    %%al, %%ah\n"
+
+"        sarl    %%ecx\n"
+"        jnc     .L_set_two\n"
+"        movb    %%al, (%%rdi)\n"
+"        incq    %%rdi\n"
+
+".L_set_two:\n"
+"        rep     stosw\n"
+"        jmp     .L_while_test\n"
+
+".align 32,0x90\n"
+".L_test_for_second_level_length:\n"
+"        testb   $64, %%al\n"
+"        jnz     .L_test_for_end_of_block\n" /* if ((op & 64) != 0) */
+
+"        xorl    %%eax, %%eax\n"
+"        incl    %%eax\n"
+"        shll    %%cl, %%eax\n"
+"        decl    %%eax\n"
+"        andl    %%edx, %%eax\n"         /* eax &= hold */
+"        addl    %%r14d, %%eax\n"        /* eax += len */
+"        movl    (%%rbp,%%rax,4), %%eax\n" /* eax = lcode[val+(hold&mask[op])]*/
+"        jmp     .L_dolen\n"
+
+".align 32,0x90\n"
+".L_test_for_second_level_dist:\n"
+"        testb   $64, %%al\n"
+"        jnz     .L_invalid_distance_code\n" /* if ((op & 64) != 0) */
+
+"        xorl    %%eax, %%eax\n"
+"        incl    %%eax\n"
+"        shll    %%cl, %%eax\n"
+"        decl    %%eax\n"
+"        andl    %%edx, %%eax\n"         /* eax &= hold */
+"        addl    %%r15d, %%eax\n"        /* eax += dist */
+"        movl    (%%r11,%%rax,4), %%eax\n" /* eax = dcode[val+(hold&mask[op])]*/
+"        jmp     .L_dodist\n"
+
+".align 32,0x90\n"
+".L_clip_window:\n"
+"        movl    %%eax, %%ecx\n"         /* ecx = nbytes */
+"        movl    92(%%rsp), %%eax\n"     /* eax = wsize, prepare for dist cmp */
+"        negl    %%ecx\n"                /* nbytes = -nbytes */
+
+"        cmpl    %%r15d, %%eax\n"
+"        jb      .L_invalid_distance_too_far\n" /* if (dist > wsize) */
+
+"        addl    %%r15d, %%ecx\n"         /* nbytes = dist - nbytes */
+"        cmpl    $0, 96(%%rsp)\n"
+"        jne     .L_wrap_around_window\n" /* if (write != 0) */
+
+"        movq    56(%%rsp), %%rsi\n"     /* from  = window */
+"        subl    %%ecx, %%eax\n"         /* eax  -= nbytes */
+"        addq    %%rax, %%rsi\n"         /* from += wsize - nbytes */
+
+"        movl    %%r14d, %%eax\n"        /* eax = len */
+"        cmpl    %%ecx, %%r14d\n"
+"        jbe     .L_do_copy\n"           /* if (nbytes >= len) */
+
+"        subl    %%ecx, %%eax\n"         /* eax -= nbytes */
+"        rep     movsb\n"
+"        movq    %%rdi, %%rsi\n"
+"        subq    %%r15, %%rsi\n"         /* from = &out[ -dist ] */
+"        jmp     .L_do_copy\n"
+
+".align 32,0x90\n"
+".L_wrap_around_window:\n"
+"        movl    96(%%rsp), %%eax\n"     /* eax = write */
+"        cmpl    %%eax, %%ecx\n"
+"        jbe     .L_contiguous_in_window\n" /* if (write >= nbytes) */
+
+"        movl    92(%%rsp), %%esi\n"     /* from  = wsize */
+"        addq    56(%%rsp), %%rsi\n"     /* from += window */
+"        addq    %%rax, %%rsi\n"         /* from += write */
+"        subq    %%rcx, %%rsi\n"         /* from -= nbytes */
+"        subl    %%eax, %%ecx\n"         /* nbytes -= write */
+
+"        movl    %%r14d, %%eax\n"        /* eax = len */
+"        cmpl    %%ecx, %%eax\n"
+"        jbe     .L_do_copy\n"           /* if (nbytes >= len) */
+
+"        subl    %%ecx, %%eax\n"         /* len -= nbytes */
+"        rep     movsb\n"
+"        movq    56(%%rsp), %%rsi\n"     /* from = window */
+"        movl    96(%%rsp), %%ecx\n"     /* nbytes = write */
+"        cmpl    %%ecx, %%eax\n"
+"        jbe     .L_do_copy\n"           /* if (nbytes >= len) */
+
+"        subl    %%ecx, %%eax\n"         /* len -= nbytes */
+"        rep     movsb\n"
+"        movq    %%rdi, %%rsi\n"
+"        subq    %%r15, %%rsi\n"         /* from = out - dist */
+"        jmp     .L_do_copy\n"
+
+".align 32,0x90\n"
+".L_contiguous_in_window:\n"
+"        movq    56(%%rsp), %%rsi\n"     /* rsi = window */
+"        addq    %%rax, %%rsi\n"
+"        subq    %%rcx, %%rsi\n"         /* from += write - nbytes */
+
+"        movl    %%r14d, %%eax\n"        /* eax = len */
+"        cmpl    %%ecx, %%eax\n"
+"        jbe     .L_do_copy\n"           /* if (nbytes >= len) */
+
+"        subl    %%ecx, %%eax\n"         /* len -= nbytes */
+"        rep     movsb\n"
+"        movq    %%rdi, %%rsi\n"
+"        subq    %%r15, %%rsi\n"         /* from = out - dist */
+"        jmp     .L_do_copy\n"           /* if (nbytes >= len) */
+
+".align 32,0x90\n"
+".L_do_copy:\n"
+"        movl    %%eax, %%ecx\n"         /* ecx = len */
+"        rep     movsb\n"
+
+"        movq    %%r8, %%rsi\n"          /* move in back to %esi, toss from */
+"        jmp     .L_while_test\n"
+
+".L_test_for_end_of_block:\n"
+"        testb   $32, %%al\n"
+"        jz      .L_invalid_literal_length_code\n"
+"        movl    $1, 116(%%rsp)\n"
+"        jmp     .L_break_loop_with_status\n"
+
+".L_invalid_literal_length_code:\n"
+"        movl    $2, 116(%%rsp)\n"
+"        jmp     .L_break_loop_with_status\n"
+
+".L_invalid_distance_code:\n"
+"        movl    $3, 116(%%rsp)\n"
+"        jmp     .L_break_loop_with_status\n"
+
+".L_invalid_distance_too_far:\n"
+"        movl    $4, 116(%%rsp)\n"
+"        jmp     .L_break_loop_with_status\n"
+
+".L_break_loop:\n"
+"        movl    $0, 116(%%rsp)\n"
+
+".L_break_loop_with_status:\n"
+/* put in, out, bits, and hold back into ar and pop esp */
+"        movq    %%rsi, 16(%%rsp)\n"     /* in */
+"        movq    %%rdi, 32(%%rsp)\n"     /* out */
+"        movl    %%ebx, 88(%%rsp)\n"     /* bits */
+"        movq    %%rdx, 80(%%rsp)\n"     /* hold */
+"        movq    (%%rsp), %%rax\n"       /* restore rbp and rsp */
+"        movq    8(%%rsp), %%rbp\n"
+"        movq    %%rax, %%rsp\n"
+          :
+          : "m" (ar)
+          : "memory", "%rax", "%rbx", "%rcx", "%rdx", "%rsi", "%rdi",
+            "%r8", "%r9", "%r10", "%r11", "%r12", "%r13", "%r14", "%r15"
+    );
+#elif ( defined( __GNUC__ ) || defined( __ICC ) ) && defined( __i386 )
+    __asm__ __volatile__ (
+"        leal    %0, %%eax\n"
+"        movl    %%esp, (%%eax)\n"        /* save esp, ebp */
+"        movl    %%ebp, 4(%%eax)\n"
+"        movl    %%eax, %%esp\n"
+"        movl    8(%%esp), %%esi\n"       /* esi = in */
+"        movl    16(%%esp), %%edi\n"      /* edi = out */
+"        movl    40(%%esp), %%edx\n"      /* edx = hold */
+"        movl    44(%%esp), %%ebx\n"      /* ebx = bits */
+"        movl    32(%%esp), %%ebp\n"      /* ebp = lcode */
+
+"        cld\n"
+"        jmp     .L_do_loop\n"
+
+".align 32,0x90\n"
+".L_while_test:\n"
+"        cmpl    %%edi, 24(%%esp)\n"      /* out < end */
+"        jbe     .L_break_loop\n"
+"        cmpl    %%esi, 12(%%esp)\n"      /* in < last */
+"        jbe     .L_break_loop\n"
+
+".L_do_loop:\n"
+"        cmpb    $15, %%bl\n"
+"        ja      .L_get_length_code\n"    /* if (15 < bits) */
+
+"        xorl    %%eax, %%eax\n"
+"        lodsw\n"                         /* al = *(ushort *)in++ */
+"        movb    %%bl, %%cl\n"            /* cl = bits, needs it for shifting */
+"        addb    $16, %%bl\n"             /* bits += 16 */
+"        shll    %%cl, %%eax\n"
+"        orl     %%eax, %%edx\n"        /* hold |= *((ushort *)in)++ << bits */
+
+".L_get_length_code:\n"
+"        movl    56(%%esp), %%eax\n"      /* eax = lmask */
+"        andl    %%edx, %%eax\n"          /* eax &= hold */
+"        movl    (%%ebp,%%eax,4), %%eax\n" /* eax = lcode[hold & lmask] */
+
+".L_dolen:\n"
+"        movb    %%ah, %%cl\n"            /* cl = this.bits */
+"        subb    %%ah, %%bl\n"            /* bits -= this.bits */
+"        shrl    %%cl, %%edx\n"           /* hold >>= this.bits */
+
+"        testb   %%al, %%al\n"
+"        jnz     .L_test_for_length_base\n" /* if (op != 0) 45.7% */
+
+"        shrl    $16, %%eax\n"            /* output this.val char */
+"        stosb\n"
+"        jmp     .L_while_test\n"
+
+".align 32,0x90\n"
+".L_test_for_length_base:\n"
+"        movl    %%eax, %%ecx\n"          /* len = this */
+"        shrl    $16, %%ecx\n"            /* len = this.val */
+"        movl    %%ecx, 64(%%esp)\n"      /* save len */
+"        movb    %%al, %%cl\n"
+
+"        testb   $16, %%al\n"
+"        jz      .L_test_for_second_level_length\n" /* if ((op & 16) == 0) 8% */
+"        andb    $15, %%cl\n"             /* op &= 15 */
+"        jz      .L_decode_distance\n"    /* if (!op) */
+"        cmpb    %%cl, %%bl\n"
+"        jae     .L_add_bits_to_len\n"    /* if (op <= bits) */
+
+"        movb    %%cl, %%ch\n"            /* stash op in ch, freeing cl */
+"        xorl    %%eax, %%eax\n"
+"        lodsw\n"                         /* al = *(ushort *)in++ */
+"        movb    %%bl, %%cl\n"            /* cl = bits, needs it for shifting */
+"        addb    $16, %%bl\n"             /* bits += 16 */
+"        shll    %%cl, %%eax\n"
+"        orl     %%eax, %%edx\n"         /* hold |= *((ushort *)in)++ << bits */
+"        movb    %%ch, %%cl\n"            /* move op back to ecx */
+
+".L_add_bits_to_len:\n"
+"        subb    %%cl, %%bl\n"
+"        xorl    %%eax, %%eax\n"
+"        incl    %%eax\n"
+"        shll    %%cl, %%eax\n"
+"        decl    %%eax\n"
+"        andl    %%edx, %%eax\n"          /* eax &= hold */
+"        shrl    %%cl, %%edx\n"
+"        addl    %%eax, 64(%%esp)\n"      /* len += hold & mask[op] */
+
+".L_decode_distance:\n"
+"        cmpb    $15, %%bl\n"
+"        ja      .L_get_distance_code\n"  /* if (15 < bits) */
+
+"        xorl    %%eax, %%eax\n"
+"        lodsw\n"                         /* al = *(ushort *)in++ */
+"        movb    %%bl, %%cl\n"            /* cl = bits, needs it for shifting */
+"        addb    $16, %%bl\n"             /* bits += 16 */
+"        shll    %%cl, %%eax\n"
+"        orl     %%eax, %%edx\n"         /* hold |= *((ushort *)in)++ << bits */
+
+".L_get_distance_code:\n"
+"        movl    60(%%esp), %%eax\n"      /* eax = dmask */
+"        movl    36(%%esp), %%ecx\n"      /* ecx = dcode */
+"        andl    %%edx, %%eax\n"          /* eax &= hold */
+"        movl    (%%ecx,%%eax,4), %%eax\n"/* eax = dcode[hold & dmask] */
+
+".L_dodist:\n"
+"        movl    %%eax, %%ebp\n"          /* dist = this */
+"        shrl    $16, %%ebp\n"            /* dist = this.val */
+"        movb    %%ah, %%cl\n"
+"        subb    %%ah, %%bl\n"            /* bits -= this.bits */
+"        shrl    %%cl, %%edx\n"           /* hold >>= this.bits */
+"        movb    %%al, %%cl\n"            /* cl = this.op */
+
+"        testb   $16, %%al\n"             /* if ((op & 16) == 0) */
+"        jz      .L_test_for_second_level_dist\n"
+"        andb    $15, %%cl\n"             /* op &= 15 */
+"        jz      .L_check_dist_one\n"
+"        cmpb    %%cl, %%bl\n"
+"        jae     .L_add_bits_to_dist\n"   /* if (op <= bits) 97.6% */
+
+"        movb    %%cl, %%ch\n"            /* stash op in ch, freeing cl */
+"        xorl    %%eax, %%eax\n"
+"        lodsw\n"                         /* al = *(ushort *)in++ */
+"        movb    %%bl, %%cl\n"            /* cl = bits, needs it for shifting */
+"        addb    $16, %%bl\n"             /* bits += 16 */
+"        shll    %%cl, %%eax\n"
+"        orl     %%eax, %%edx\n"        /* hold |= *((ushort *)in)++ << bits */
+"        movb    %%ch, %%cl\n"            /* move op back to ecx */
+
+".L_add_bits_to_dist:\n"
+"        subb    %%cl, %%bl\n"
+"        xorl    %%eax, %%eax\n"
+"        incl    %%eax\n"
+"        shll    %%cl, %%eax\n"
+"        decl    %%eax\n"                 /* (1 << op) - 1 */
+"        andl    %%edx, %%eax\n"          /* eax &= hold */
+"        shrl    %%cl, %%edx\n"
+"        addl    %%eax, %%ebp\n"          /* dist += hold & ((1 << op) - 1) */
+
+".L_check_window:\n"
+"        movl    %%esi, 8(%%esp)\n"       /* save in so from can use it's reg */
+"        movl    %%edi, %%eax\n"
+"        subl    20(%%esp), %%eax\n"      /* nbytes = out - beg */
+
+"        cmpl    %%ebp, %%eax\n"
+"        jb      .L_clip_window\n"        /* if (dist > nbytes) 4.2% */
+
+"        movl    64(%%esp), %%ecx\n"      /* ecx = len */
+"        movl    %%edi, %%esi\n"
+"        subl    %%ebp, %%esi\n"          /* from = out - dist */
+
+"        sarl    %%ecx\n"
+"        jnc     .L_copy_two\n"           /* if len % 2 == 0 */
+
+"        rep     movsw\n"
+"        movb    (%%esi), %%al\n"
+"        movb    %%al, (%%edi)\n"
+"        incl    %%edi\n"
+
+"        movl    8(%%esp), %%esi\n"       /* move in back to %esi, toss from */
+"        movl    32(%%esp), %%ebp\n"      /* ebp = lcode */
+"        jmp     .L_while_test\n"
+
+".L_copy_two:\n"
+"        rep     movsw\n"
+"        movl    8(%%esp), %%esi\n"       /* move in back to %esi, toss from */
+"        movl    32(%%esp), %%ebp\n"      /* ebp = lcode */
+"        jmp     .L_while_test\n"
+
+".align 32,0x90\n"
+".L_check_dist_one:\n"
+"        cmpl    $1, %%ebp\n"            /* if dist 1, is a memset */
+"        jne     .L_check_window\n"
+"        cmpl    %%edi, 20(%%esp)\n"
+"        je      .L_check_window\n"      /* out == beg, if outside window */
+
+"        movl    64(%%esp), %%ecx\n"      /* ecx = len */
+"        movb    -1(%%edi), %%al\n"
+"        movb    %%al, %%ah\n"
+
+"        sarl    %%ecx\n"
+"        jnc     .L_set_two\n"
+"        movb    %%al, (%%edi)\n"
+"        incl    %%edi\n"
+
+".L_set_two:\n"
+"        rep     stosw\n"
+"        movl    32(%%esp), %%ebp\n"      /* ebp = lcode */
+"        jmp     .L_while_test\n"
+
+".align 32,0x90\n"
+".L_test_for_second_level_length:\n"
+"        testb   $64, %%al\n"
+"        jnz     .L_test_for_end_of_block\n" /* if ((op & 64) != 0) */
+
+"        xorl    %%eax, %%eax\n"
+"        incl    %%eax\n"
+"        shll    %%cl, %%eax\n"
+"        decl    %%eax\n"
+"        andl    %%edx, %%eax\n"         /* eax &= hold */
+"        addl    64(%%esp), %%eax\n"     /* eax += len */
+"        movl    (%%ebp,%%eax,4), %%eax\n" /* eax = lcode[val+(hold&mask[op])]*/
+"        jmp     .L_dolen\n"
+
+".align 32,0x90\n"
+".L_test_for_second_level_dist:\n"
+"        testb   $64, %%al\n"
+"        jnz     .L_invalid_distance_code\n" /* if ((op & 64) != 0) */
+
+"        xorl    %%eax, %%eax\n"
+"        incl    %%eax\n"
+"        shll    %%cl, %%eax\n"
+"        decl    %%eax\n"
+"        andl    %%edx, %%eax\n"         /* eax &= hold */
+"        addl    %%ebp, %%eax\n"         /* eax += dist */
+"        movl    36(%%esp), %%ecx\n"     /* ecx = dcode */
+"        movl    (%%ecx,%%eax,4), %%eax\n" /* eax = dcode[val+(hold&mask[op])]*/
+"        jmp     .L_dodist\n"
+
+".align 32,0x90\n"
+".L_clip_window:\n"
+"        movl    %%eax, %%ecx\n"
+"        movl    48(%%esp), %%eax\n"     /* eax = wsize */
+"        negl    %%ecx\n"                /* nbytes = -nbytes */
+"        movl    28(%%esp), %%esi\n"     /* from = window */
+
+"        cmpl    %%ebp, %%eax\n"
+"        jb      .L_invalid_distance_too_far\n" /* if (dist > wsize) */
+
+"        addl    %%ebp, %%ecx\n"         /* nbytes = dist - nbytes */
+"        cmpl    $0, 52(%%esp)\n"
+"        jne     .L_wrap_around_window\n" /* if (write != 0) */
+
+"        subl    %%ecx, %%eax\n"
+"        addl    %%eax, %%esi\n"         /* from += wsize - nbytes */
+
+"        movl    64(%%esp), %%eax\n"     /* eax = len */
+"        cmpl    %%ecx, %%eax\n"
+"        jbe     .L_do_copy\n"           /* if (nbytes >= len) */
+
+"        subl    %%ecx, %%eax\n"         /* len -= nbytes */
+"        rep     movsb\n"
+"        movl    %%edi, %%esi\n"
+"        subl    %%ebp, %%esi\n"         /* from = out - dist */
+"        jmp     .L_do_copy\n"
+
+".align 32,0x90\n"
+".L_wrap_around_window:\n"
+"        movl    52(%%esp), %%eax\n"     /* eax = write */
+"        cmpl    %%eax, %%ecx\n"
+"        jbe     .L_contiguous_in_window\n" /* if (write >= nbytes) */
+
+"        addl    48(%%esp), %%esi\n"     /* from += wsize */
+"        addl    %%eax, %%esi\n"         /* from += write */
+"        subl    %%ecx, %%esi\n"         /* from -= nbytes */
+"        subl    %%eax, %%ecx\n"         /* nbytes -= write */
+
+"        movl    64(%%esp), %%eax\n"     /* eax = len */
+"        cmpl    %%ecx, %%eax\n"
+"        jbe     .L_do_copy\n"           /* if (nbytes >= len) */
+
+"        subl    %%ecx, %%eax\n"         /* len -= nbytes */
+"        rep     movsb\n"
+"        movl    28(%%esp), %%esi\n"     /* from = window */
+"        movl    52(%%esp), %%ecx\n"     /* nbytes = write */
+"        cmpl    %%ecx, %%eax\n"
+"        jbe     .L_do_copy\n"           /* if (nbytes >= len) */
+
+"        subl    %%ecx, %%eax\n"         /* len -= nbytes */
+"        rep     movsb\n"
+"        movl    %%edi, %%esi\n"
+"        subl    %%ebp, %%esi\n"         /* from = out - dist */
+"        jmp     .L_do_copy\n"
+
+".align 32,0x90\n"
+".L_contiguous_in_window:\n"
+"        addl    %%eax, %%esi\n"
+"        subl    %%ecx, %%esi\n"         /* from += write - nbytes */
+
+"        movl    64(%%esp), %%eax\n"     /* eax = len */
+"        cmpl    %%ecx, %%eax\n"
+"        jbe     .L_do_copy\n"           /* if (nbytes >= len) */
+
+"        subl    %%ecx, %%eax\n"         /* len -= nbytes */
+"        rep     movsb\n"
+"        movl    %%edi, %%esi\n"
+"        subl    %%ebp, %%esi\n"         /* from = out - dist */
+"        jmp     .L_do_copy\n"           /* if (nbytes >= len) */
+
+".align 32,0x90\n"
+".L_do_copy:\n"
+"        movl    %%eax, %%ecx\n"
+"        rep     movsb\n"
+
+"        movl    8(%%esp), %%esi\n"      /* move in back to %esi, toss from */
+"        movl    32(%%esp), %%ebp\n"     /* ebp = lcode */
+"        jmp     .L_while_test\n"
+
+".L_test_for_end_of_block:\n"
+"        testb   $32, %%al\n"
+"        jz      .L_invalid_literal_length_code\n"
+"        movl    $1, 72(%%esp)\n"
+"        jmp     .L_break_loop_with_status\n"
+
+".L_invalid_literal_length_code:\n"
+"        movl    $2, 72(%%esp)\n"
+"        jmp     .L_break_loop_with_status\n"
+
+".L_invalid_distance_code:\n"
+"        movl    $3, 72(%%esp)\n"
+"        jmp     .L_break_loop_with_status\n"
+
+".L_invalid_distance_too_far:\n"
+"        movl    8(%%esp), %%esi\n"
+"        movl    $4, 72(%%esp)\n"
+"        jmp     .L_break_loop_with_status\n"
+
+".L_break_loop:\n"
+"        movl    $0, 72(%%esp)\n"
+
+".L_break_loop_with_status:\n"
+/* put in, out, bits, and hold back into ar and pop esp */
+"        movl    %%esi, 8(%%esp)\n"      /* save in */
+"        movl    %%edi, 16(%%esp)\n"     /* save out */
+"        movl    %%ebx, 44(%%esp)\n"     /* save bits */
+"        movl    %%edx, 40(%%esp)\n"     /* save hold */
+"        movl    4(%%esp), %%ebp\n"      /* restore esp, ebp */
+"        movl    (%%esp), %%esp\n"
+          :
+          : "m" (ar)
+          : "memory", "%eax", "%ebx", "%ecx", "%edx", "%esi", "%edi"
+    );
+#elif defined( _MSC_VER ) && ! defined( _M_AMD64 )
+    __asm {
+	lea	eax, ar
+	mov	[eax], esp         /* save esp, ebp */
+	mov	[eax+4], ebp
+	mov	esp, eax
+	mov	esi, [esp+8]       /* esi = in */
+	mov	edi, [esp+16]      /* edi = out */
+	mov	edx, [esp+40]      /* edx = hold */
+	mov	ebx, [esp+44]      /* ebx = bits */
+	mov	ebp, [esp+32]      /* ebp = lcode */
+
+	cld
+	jmp	L_do_loop
+
+ALIGN 4
+L_while_test:
+	cmp	[esp+24], edi
+	jbe	L_break_loop
+	cmp	[esp+12], esi
+	jbe	L_break_loop
+
+L_do_loop:
+	cmp	bl, 15
+	ja	L_get_length_code    /* if (15 < bits) */
+
+	xor	eax, eax
+	lodsw                         /* al = *(ushort *)in++ */
+	mov	cl, bl            /* cl = bits, needs it for shifting */
+	add	bl, 16             /* bits += 16 */
+	shl	eax, cl
+	or	edx, eax        /* hold |= *((ushort *)in)++ << bits */
+
+L_get_length_code:
+	mov	eax, [esp+56]      /* eax = lmask */
+	and	eax, edx          /* eax &= hold */
+	mov	eax, [ebp+eax*4] /* eax = lcode[hold & lmask] */
+
+L_dolen:
+	mov	cl, ah            /* cl = this.bits */
+	sub	bl, ah            /* bits -= this.bits */
+	shr	edx, cl           /* hold >>= this.bits */
+
+	test	al, al
+	jnz	L_test_for_length_base /* if (op != 0) 45.7% */
+
+	shr	eax, 16            /* output this.val char */
+	stosb
+	jmp	L_while_test
+
+ALIGN 4
+L_test_for_length_base:
+	mov	ecx, eax          /* len = this */
+	shr	ecx, 16            /* len = this.val */
+	mov	[esp+64], ecx      /* save len */
+	mov	cl, al
+
+	test	al, 16
+	jz	L_test_for_second_level_length /* if ((op & 16) == 0) 8% */
+	and	cl, 15             /* op &= 15 */
+	jz	L_decode_distance    /* if (!op) */
+	cmp	bl, cl
+	jae	L_add_bits_to_len    /* if (op <= bits) */
+
+	mov	ch, cl            /* stash op in ch, freeing cl */
+	xor	eax, eax
+	lodsw                         /* al = *(ushort *)in++ */
+	mov	cl, bl            /* cl = bits, needs it for shifting */
+	add	bl, 16             /* bits += 16 */
+	shl	eax, cl
+	or	edx, eax         /* hold |= *((ushort *)in)++ << bits */
+	mov	cl, ch            /* move op back to ecx */
+
+L_add_bits_to_len:
+	sub	bl, cl
+	xor	eax, eax
+	inc	eax
+	shl	eax, cl
+	dec	eax
+	and	eax, edx          /* eax &= hold */
+	shr	edx, cl
+	add	[esp+64], eax      /* len += hold & mask[op] */
+
+L_decode_distance:
+	cmp	bl, 15
+	ja	L_get_distance_code  /* if (15 < bits) */
+
+	xor	eax, eax
+	lodsw                         /* al = *(ushort *)in++ */
+	mov	cl, bl            /* cl = bits, needs it for shifting */
+	add	bl, 16             /* bits += 16 */
+	shl	eax, cl
+	or	edx, eax         /* hold |= *((ushort *)in)++ << bits */
+
+L_get_distance_code:
+	mov	eax, [esp+60]      /* eax = dmask */
+	mov	ecx, [esp+36]      /* ecx = dcode */
+	and	eax, edx          /* eax &= hold */
+	mov	eax, [ecx+eax*4]/* eax = dcode[hold & dmask] */
+
+L_dodist:
+	mov	ebp, eax          /* dist = this */
+	shr	ebp, 16            /* dist = this.val */
+	mov	cl, ah
+	sub	bl, ah            /* bits -= this.bits */
+	shr	edx, cl           /* hold >>= this.bits */
+	mov	cl, al            /* cl = this.op */
+
+	test	al, 16             /* if ((op & 16) == 0) */
+	jz	L_test_for_second_level_dist
+	and	cl, 15             /* op &= 15 */
+	jz	L_check_dist_one
+	cmp	bl, cl
+	jae	L_add_bits_to_dist   /* if (op <= bits) 97.6% */
+
+	mov	ch, cl            /* stash op in ch, freeing cl */
+	xor	eax, eax
+	lodsw                         /* al = *(ushort *)in++ */
+	mov	cl, bl            /* cl = bits, needs it for shifting */
+	add	bl, 16             /* bits += 16 */
+	shl	eax, cl
+	or	edx, eax        /* hold |= *((ushort *)in)++ << bits */
+	mov	cl, ch            /* move op back to ecx */
+
+L_add_bits_to_dist:
+	sub	bl, cl
+	xor	eax, eax
+	inc	eax
+	shl	eax, cl
+	dec	eax                 /* (1 << op) - 1 */
+	and	eax, edx          /* eax &= hold */
+	shr	edx, cl
+	add	ebp, eax          /* dist += hold & ((1 << op) - 1) */
+
+L_check_window:
+	mov	[esp+8], esi       /* save in so from can use it's reg */
+	mov	eax, edi
+	sub	eax, [esp+20]      /* nbytes = out - beg */
+
+	cmp	eax, ebp
+	jb	L_clip_window        /* if (dist > nbytes) 4.2% */
+
+	mov	ecx, [esp+64]      /* ecx = len */
+	mov	esi, edi
+	sub	esi, ebp          /* from = out - dist */
+
+	sar	ecx, 1
+	jnc	L_copy_two
+
+	rep     movsw
+	mov	al, [esi]
+	mov	[edi], al
+	inc	edi
+
+	mov	esi, [esp+8]      /* move in back to %esi, toss from */
+	mov	ebp, [esp+32]     /* ebp = lcode */
+	jmp	L_while_test
+
+L_copy_two:
+	rep     movsw
+	mov	esi, [esp+8]      /* move in back to %esi, toss from */
+	mov	ebp, [esp+32]     /* ebp = lcode */
+	jmp	L_while_test
+
+ALIGN 4
+L_check_dist_one:
+	cmp	ebp, 1            /* if dist 1, is a memset */
+	jne	L_check_window
+	cmp	[esp+20], edi
+	je	L_check_window    /* out == beg, if outside window */
+
+	mov	ecx, [esp+64]     /* ecx = len */
+	mov	al, [edi-1]
+	mov	ah, al
+
+	sar	ecx, 1
+	jnc	L_set_two
+	mov	[edi], al         /* memset out with from[-1] */
+	inc	edi
+
+L_set_two:
+	rep     stosw
+	mov	ebp, [esp+32]     /* ebp = lcode */
+	jmp	L_while_test
+
+ALIGN 4
+L_test_for_second_level_length:
+	test	al, 64
+	jnz	L_test_for_end_of_block /* if ((op & 64) != 0) */
+
+	xor	eax, eax
+	inc	eax
+	shl	eax, cl
+	dec	eax
+	and	eax, edx         /* eax &= hold */
+	add	eax, [esp+64]     /* eax += len */
+	mov	eax, [ebp+eax*4] /* eax = lcode[val+(hold&mask[op])]*/
+	jmp	L_dolen
+
+ALIGN 4
+L_test_for_second_level_dist:
+	test	al, 64
+	jnz	L_invalid_distance_code /* if ((op & 64) != 0) */
+
+	xor	eax, eax
+	inc	eax
+	shl	eax, cl
+	dec	eax
+	and	eax, edx         /* eax &= hold */
+	add	eax, ebp         /* eax += dist */
+	mov	ecx, [esp+36]     /* ecx = dcode */
+	mov	eax, [ecx+eax*4] /* eax = dcode[val+(hold&mask[op])]*/
+	jmp	L_dodist
+
+ALIGN 4
+L_clip_window:
+	mov	ecx, eax
+	mov	eax, [esp+48]     /* eax = wsize */
+	neg	ecx                /* nbytes = -nbytes */
+	mov	esi, [esp+28]     /* from = window */
+
+	cmp	eax, ebp
+	jb	L_invalid_distance_too_far /* if (dist > wsize) */
+
+	add	ecx, ebp         /* nbytes = dist - nbytes */
+	cmp	dword ptr [esp+52], 0
+	jne	L_wrap_around_window /* if (write != 0) */
+
+	sub	eax, ecx
+	add	esi, eax         /* from += wsize - nbytes */
+
+	mov	eax, [esp+64]    /* eax = len */
+	cmp	eax, ecx
+	jbe	L_do_copy          /* if (nbytes >= len) */
+
+	sub	eax, ecx         /* len -= nbytes */
+	rep     movsb
+	mov	esi, edi
+	sub	esi, ebp         /* from = out - dist */
+	jmp	L_do_copy
+
+ALIGN 4
+L_wrap_around_window:
+	mov	eax, [esp+52]    /* eax = write */
+	cmp	ecx, eax
+	jbe	L_contiguous_in_window /* if (write >= nbytes) */
+
+	add	esi, [esp+48]    /* from += wsize */
+	add	esi, eax         /* from += write */
+	sub	esi, ecx         /* from -= nbytes */
+	sub	ecx, eax         /* nbytes -= write */
+
+	mov	eax, [esp+64]    /* eax = len */
+	cmp	eax, ecx
+	jbe	L_do_copy          /* if (nbytes >= len) */
+
+	sub	eax, ecx         /* len -= nbytes */
+	rep     movsb
+	mov	esi, [esp+28]     /* from = window */
+	mov	ecx, [esp+52]     /* nbytes = write */
+	cmp	eax, ecx
+	jbe	L_do_copy          /* if (nbytes >= len) */
+
+	sub	eax, ecx         /* len -= nbytes */
+	rep     movsb
+	mov	esi, edi
+	sub	esi, ebp         /* from = out - dist */
+	jmp	L_do_copy
+
+ALIGN 4
+L_contiguous_in_window:
+	add	esi, eax
+	sub	esi, ecx         /* from += write - nbytes */
+
+	mov	eax, [esp+64]    /* eax = len */
+	cmp	eax, ecx
+	jbe	L_do_copy          /* if (nbytes >= len) */
+
+	sub	eax, ecx         /* len -= nbytes */
+	rep     movsb
+	mov	esi, edi
+	sub	esi, ebp         /* from = out - dist */
+	jmp	L_do_copy
+
+ALIGN 4
+L_do_copy:
+	mov	ecx, eax
+	rep     movsb
+
+	mov	esi, [esp+8]      /* move in back to %esi, toss from */
+	mov	ebp, [esp+32]     /* ebp = lcode */
+	jmp	L_while_test
+
+L_test_for_end_of_block:
+	test	al, 32
+	jz	L_invalid_literal_length_code
+	mov	dword ptr [esp+72], 1
+	jmp	L_break_loop_with_status
+
+L_invalid_literal_length_code:
+	mov	dword ptr [esp+72], 2
+	jmp	L_break_loop_with_status
+
+L_invalid_distance_code:
+	mov	dword ptr [esp+72], 3
+	jmp	L_break_loop_with_status
+
+L_invalid_distance_too_far:
+	mov	esi, [esp+4]
+	mov	dword ptr [esp+72], 4
+	jmp	L_break_loop_with_status
+
+L_break_loop:
+	mov	dword ptr [esp+72], 0
+
+L_break_loop_with_status:
+/* put in, out, bits, and hold back into ar and pop esp */
+	mov	[esp+8], esi     /* save in */
+	mov	[esp+16], edi    /* save out */
+	mov	[esp+44], ebx    /* save bits */
+	mov	[esp+40], edx    /* save hold */
+	mov	ebp, [esp+4]     /* restore esp, ebp */
+	mov	esp, [esp]
+    }
+#else
+#error "x86 architecture not defined"
+#endif
+
+    if (ar.status > 1) {
+        if (ar.status == 2)
+            strm->msg = "invalid literal/length code";
+        else if (ar.status == 3)
+            strm->msg = "invalid distance code";
+        else
+            strm->msg = "invalid distance too far back";
+        state->mode = BAD;
+    }
+    else if ( ar.status == 1 ) {
+        state->mode = TYPE;
+    }
+
+    /* return unused bytes (on entry, bits < 8, so in won't go too far back) */
+    ar.len = ar.bits >> 3;
+    ar.in -= ar.len;
+    ar.bits -= ar.len << 3;
+    ar.hold &= (1U << ar.bits) - 1;
+
+    /* update state and return */
+    strm->next_in = ar.in;
+    strm->next_out = ar.out;
+    strm->avail_in = (unsigned)(ar.in < ar.last ?
+                                PAD_AVAIL_IN + (ar.last - ar.in) :
+                                PAD_AVAIL_IN - (ar.in - ar.last));
+    strm->avail_out = (unsigned)(ar.out < ar.end ?
+                                 PAD_AVAIL_OUT + (ar.end - ar.out) :
+                                 PAD_AVAIL_OUT - (ar.out - ar.end));
+    state->hold = ar.hold;
+    state->bits = ar.bits;
+    return;
+}
+
diff --git a/updater/zlib123/contrib/inflate86/inffast.S b/updater/zlib123/contrib/inflate86/inffast.S
new file mode 100644
index 0000000..3df57ea
--- /dev/null
+++ b/updater/zlib123/contrib/inflate86/inffast.S
@@ -0,0 +1,1368 @@
+/*
+ * inffast.S is a hand tuned assembler version of:
+ *
+ * inffast.c -- fast decoding
+ * Copyright (C) 1995-2003 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ *
+ * Copyright (C) 2003 Chris Anderson <christop@charm.net>
+ * Please use the copyright conditions above.
+ *
+ * This version (Jan-23-2003) of inflate_fast was coded and tested under
+ * GNU/Linux on a pentium 3, using the gcc-3.2 compiler distribution.  On that
+ * machine, I found that gzip style archives decompressed about 20% faster than
+ * the gcc-3.2 -O3 -fomit-frame-pointer compiled version.  Your results will
+ * depend on how large of a buffer is used for z_stream.next_in & next_out
+ * (8K-32K worked best for my 256K cpu cache) and how much overhead there is in
+ * stream processing I/O and crc32/addler32.  In my case, this routine used
+ * 70% of the cpu time and crc32 used 20%.
+ *
+ * I am confident that this version will work in the general case, but I have
+ * not tested a wide variety of datasets or a wide variety of platforms.
+ *
+ * Jan-24-2003 -- Added -DUSE_MMX define for slightly faster inflating.
+ * It should be a runtime flag instead of compile time flag...
+ *
+ * Jan-26-2003 -- Added runtime check for MMX support with cpuid instruction.
+ * With -DUSE_MMX, only MMX code is compiled.  With -DNO_MMX, only non-MMX code
+ * is compiled.  Without either option, runtime detection is enabled.  Runtime
+ * detection should work on all modern cpus and the recomended algorithm (flip
+ * ID bit on eflags and then use the cpuid instruction) is used in many
+ * multimedia applications.  Tested under win2k with gcc-2.95 and gas-2.12
+ * distributed with cygwin3.  Compiling with gcc-2.95 -c inffast.S -o
+ * inffast.obj generates a COFF object which can then be linked with MSVC++
+ * compiled code.  Tested under FreeBSD 4.7 with gcc-2.95.
+ *
+ * Jan-28-2003 -- Tested Athlon XP... MMX mode is slower than no MMX (and
+ * slower than compiler generated code).  Adjusted cpuid check to use the MMX
+ * code only for Pentiums < P4 until I have more data on the P4.  Speed
+ * improvment is only about 15% on the Athlon when compared with code generated
+ * with MSVC++.  Not sure yet, but I think the P4 will also be slower using the
+ * MMX mode because many of it's x86 ALU instructions execute in .5 cycles and
+ * have less latency than MMX ops.  Added code to buffer the last 11 bytes of
+ * the input stream since the MMX code grabs bits in chunks of 32, which
+ * differs from the inffast.c algorithm.  I don't think there would have been
+ * read overruns where a page boundary was crossed (a segfault), but there
+ * could have been overruns when next_in ends on unaligned memory (unintialized
+ * memory read).
+ *
+ * Mar-13-2003 -- P4 MMX is slightly slower than P4 NO_MMX.  I created a C
+ * version of the non-MMX code so that it doesn't depend on zstrm and zstate
+ * structure offsets which are hard coded in this file.  This was last tested
+ * with zlib-1.2.0 which is currently in beta testing, newer versions of this
+ * and inffas86.c can be found at http://www.eetbeetee.com/zlib/ and
+ * http://www.charm.net/~christop/zlib/
+ */
+
+
+/*
+ * if you have underscore linking problems (_inflate_fast undefined), try
+ * using -DGAS_COFF
+ */
+#if ! defined( GAS_COFF ) && ! defined( GAS_ELF )
+
+#if defined( WIN32 ) || defined( __CYGWIN__ )
+#define GAS_COFF /* windows object format */
+#else
+#define GAS_ELF
+#endif
+
+#endif /* ! GAS_COFF && ! GAS_ELF */
+
+
+#if defined( GAS_COFF )
+
+/* coff externals have underscores */
+#define inflate_fast _inflate_fast
+#define inflate_fast_use_mmx _inflate_fast_use_mmx
+
+#endif /* GAS_COFF */
+
+
+.file "inffast.S"
+
+.globl inflate_fast
+
+.text
+.align 4,0
+.L_invalid_literal_length_code_msg:
+.string "invalid literal/length code"
+
+.align 4,0
+.L_invalid_distance_code_msg:
+.string "invalid distance code"
+
+.align 4,0
+.L_invalid_distance_too_far_msg:
+.string "invalid distance too far back"
+
+#if ! defined( NO_MMX )
+.align 4,0
+.L_mask: /* mask[N] = ( 1 << N ) - 1 */
+.long 0
+.long 1
+.long 3
+.long 7
+.long 15
+.long 31
+.long 63
+.long 127
+.long 255
+.long 511
+.long 1023
+.long 2047
+.long 4095
+.long 8191
+.long 16383
+.long 32767
+.long 65535
+.long 131071
+.long 262143
+.long 524287
+.long 1048575
+.long 2097151
+.long 4194303
+.long 8388607
+.long 16777215
+.long 33554431
+.long 67108863
+.long 134217727
+.long 268435455
+.long 536870911
+.long 1073741823
+.long 2147483647
+.long 4294967295
+#endif /* NO_MMX */
+
+.text
+
+/*
+ * struct z_stream offsets, in zlib.h
+ */
+#define next_in_strm   0   /* strm->next_in */
+#define avail_in_strm  4   /* strm->avail_in */
+#define next_out_strm  12  /* strm->next_out */
+#define avail_out_strm 16  /* strm->avail_out */
+#define msg_strm       24  /* strm->msg */
+#define state_strm     28  /* strm->state */
+
+/*
+ * struct inflate_state offsets, in inflate.h
+ */
+#define mode_state     0   /* state->mode */
+#define wsize_state    32  /* state->wsize */
+#define write_state    40  /* state->write */
+#define window_state   44  /* state->window */
+#define hold_state     48  /* state->hold */
+#define bits_state     52  /* state->bits */
+#define lencode_state  68  /* state->lencode */
+#define distcode_state 72  /* state->distcode */
+#define lenbits_state  76  /* state->lenbits */
+#define distbits_state 80  /* state->distbits */
+
+/*
+ * inflate_fast's activation record
+ */
+#define local_var_size 64 /* how much local space for vars */
+#define strm_sp        88 /* first arg: z_stream * (local_var_size + 24) */
+#define start_sp       92 /* second arg: unsigned int (local_var_size + 28) */
+
+/*
+ * offsets for local vars on stack
+ */
+#define out            60  /* unsigned char* */
+#define window         56  /* unsigned char* */
+#define wsize          52  /* unsigned int */
+#define write          48  /* unsigned int */
+#define in             44  /* unsigned char* */
+#define beg            40  /* unsigned char* */
+#define buf            28  /* char[ 12 ] */
+#define len            24  /* unsigned int */
+#define last           20  /* unsigned char* */
+#define end            16  /* unsigned char* */
+#define dcode          12  /* code* */
+#define lcode           8  /* code* */
+#define dmask           4  /* unsigned int */
+#define lmask           0  /* unsigned int */
+
+/*
+ * typedef enum inflate_mode consts, in inflate.h
+ */
+#define INFLATE_MODE_TYPE 11  /* state->mode flags enum-ed in inflate.h */
+#define INFLATE_MODE_BAD  26
+
+
+#if ! defined( USE_MMX ) && ! defined( NO_MMX )
+
+#define RUN_TIME_MMX
+
+#define CHECK_MMX    1
+#define DO_USE_MMX   2
+#define DONT_USE_MMX 3
+
+.globl inflate_fast_use_mmx
+
+.data
+
+.align 4,0
+inflate_fast_use_mmx: /* integer flag for run time control 1=check,2=mmx,3=no */
+.long CHECK_MMX
+
+#if defined( GAS_ELF )
+/* elf info */
+.type   inflate_fast_use_mmx,@object
+.size   inflate_fast_use_mmx,4
+#endif
+
+#endif /* RUN_TIME_MMX */
+
+#if defined( GAS_COFF )
+/* coff info: scl 2 = extern, type 32 = function */
+.def inflate_fast; .scl 2; .type 32; .endef
+#endif
+
+.text
+
+.align 32,0x90
+inflate_fast:
+        pushl   %edi
+        pushl   %esi
+        pushl   %ebp
+        pushl   %ebx
+        pushf   /* save eflags (strm_sp, state_sp assumes this is 32 bits) */
+        subl    $local_var_size, %esp
+        cld
+
+#define strm_r  %esi
+#define state_r %edi
+
+        movl    strm_sp(%esp), strm_r
+        movl    state_strm(strm_r), state_r
+
+        /* in = strm->next_in;
+         * out = strm->next_out;
+         * last = in + strm->avail_in - 11;
+         * beg = out - (start - strm->avail_out);
+         * end = out + (strm->avail_out - 257);
+         */
+        movl    avail_in_strm(strm_r), %edx
+        movl    next_in_strm(strm_r), %eax
+
+        addl    %eax, %edx      /* avail_in += next_in */
+        subl    $11, %edx       /* avail_in -= 11 */
+
+        movl    %eax, in(%esp)
+        movl    %edx, last(%esp)
+
+        movl    start_sp(%esp), %ebp
+        movl    avail_out_strm(strm_r), %ecx
+        movl    next_out_strm(strm_r), %ebx
+
+        subl    %ecx, %ebp      /* start -= avail_out */
+        negl    %ebp            /* start = -start */
+        addl    %ebx, %ebp      /* start += next_out */
+
+        subl    $257, %ecx      /* avail_out -= 257 */
+        addl    %ebx, %ecx      /* avail_out += out */
+
+        movl    %ebx, out(%esp)
+        movl    %ebp, beg(%esp)
+        movl    %ecx, end(%esp)
+
+        /* wsize = state->wsize;
+         * write = state->write;
+         * window = state->window;
+         * hold = state->hold;
+         * bits = state->bits;
+         * lcode = state->lencode;
+         * dcode = state->distcode;
+         * lmask = ( 1 << state->lenbits ) - 1;
+         * dmask = ( 1 << state->distbits ) - 1;
+         */
+
+        movl    lencode_state(state_r), %eax
+        movl    distcode_state(state_r), %ecx
+
+        movl    %eax, lcode(%esp)
+        movl    %ecx, dcode(%esp)
+
+        movl    $1, %eax
+        movl    lenbits_state(state_r), %ecx
+        shll    %cl, %eax
+        decl    %eax
+        movl    %eax, lmask(%esp)
+
+        movl    $1, %eax
+        movl    distbits_state(state_r), %ecx
+        shll    %cl, %eax
+        decl    %eax
+        movl    %eax, dmask(%esp)
+
+        movl    wsize_state(state_r), %eax
+        movl    write_state(state_r), %ecx
+        movl    window_state(state_r), %edx
+
+        movl    %eax, wsize(%esp)
+        movl    %ecx, write(%esp)
+        movl    %edx, window(%esp)
+
+        movl    hold_state(state_r), %ebp
+        movl    bits_state(state_r), %ebx
+
+#undef strm_r
+#undef state_r
+
+#define in_r       %esi
+#define from_r     %esi
+#define out_r      %edi
+
+        movl    in(%esp), in_r
+        movl    last(%esp), %ecx
+        cmpl    in_r, %ecx
+        ja      .L_align_long           /* if in < last */
+
+        addl    $11, %ecx               /* ecx = &in[ avail_in ] */
+        subl    in_r, %ecx              /* ecx = avail_in */
+        movl    $12, %eax
+        subl    %ecx, %eax              /* eax = 12 - avail_in */
+        leal    buf(%esp), %edi
+        rep     movsb                   /* memcpy( buf, in, avail_in ) */
+        movl    %eax, %ecx
+        xorl    %eax, %eax
+        rep     stosb         /* memset( &buf[ avail_in ], 0, 12 - avail_in ) */
+        leal    buf(%esp), in_r         /* in = buf */
+        movl    in_r, last(%esp)        /* last = in, do just one iteration */
+        jmp     .L_is_aligned
+
+        /* align in_r on long boundary */
+.L_align_long:
+        testl   $3, in_r
+        jz      .L_is_aligned
+        xorl    %eax, %eax
+        movb    (in_r), %al
+        incl    in_r
+        movl    %ebx, %ecx
+        addl    $8, %ebx
+        shll    %cl, %eax
+        orl     %eax, %ebp
+        jmp     .L_align_long
+
+.L_is_aligned:
+        movl    out(%esp), out_r
+
+#if defined( NO_MMX )
+        jmp     .L_do_loop
+#endif
+
+#if defined( USE_MMX )
+        jmp     .L_init_mmx
+#endif
+
+/*** Runtime MMX check ***/
+
+#if defined( RUN_TIME_MMX )
+.L_check_mmx:
+        cmpl    $DO_USE_MMX, inflate_fast_use_mmx
+        je      .L_init_mmx
+        ja      .L_do_loop /* > 2 */
+
+        pushl   %eax
+        pushl   %ebx
+        pushl   %ecx
+        pushl   %edx
+        pushf
+        movl    (%esp), %eax      /* copy eflags to eax */
+        xorl    $0x200000, (%esp) /* try toggling ID bit of eflags (bit 21)
+                                   * to see if cpu supports cpuid...
+                                   * ID bit method not supported by NexGen but
+                                   * bios may load a cpuid instruction and
+                                   * cpuid may be disabled on Cyrix 5-6x86 */
+        popf
+        pushf
+        popl    %edx              /* copy new eflags to edx */
+        xorl    %eax, %edx        /* test if ID bit is flipped */
+        jz      .L_dont_use_mmx   /* not flipped if zero */
+        xorl    %eax, %eax
+        cpuid
+        cmpl    $0x756e6547, %ebx /* check for GenuineIntel in ebx,ecx,edx */
+        jne     .L_dont_use_mmx
+        cmpl    $0x6c65746e, %ecx
+        jne     .L_dont_use_mmx
+        cmpl    $0x49656e69, %edx
+        jne     .L_dont_use_mmx
+        movl    $1, %eax
+        cpuid                     /* get cpu features */
+        shrl    $8, %eax
+        andl    $15, %eax
+        cmpl    $6, %eax          /* check for Pentium family, is 0xf for P4 */
+        jne     .L_dont_use_mmx
+        testl   $0x800000, %edx   /* test if MMX feature is set (bit 23) */
+        jnz     .L_use_mmx
+        jmp     .L_dont_use_mmx
+.L_use_mmx:
+        movl    $DO_USE_MMX, inflate_fast_use_mmx
+        jmp     .L_check_mmx_pop
+.L_dont_use_mmx:
+        movl    $DONT_USE_MMX, inflate_fast_use_mmx
+.L_check_mmx_pop:
+        popl    %edx
+        popl    %ecx
+        popl    %ebx
+        popl    %eax
+        jmp     .L_check_mmx
+#endif
+
+
+/*** Non-MMX code ***/
+
+#if defined ( NO_MMX ) || defined( RUN_TIME_MMX )
+
+#define hold_r     %ebp
+#define bits_r     %bl
+#define bitslong_r %ebx
+
+.align 32,0x90
+.L_while_test:
+        /* while (in < last && out < end)
+         */
+        cmpl    out_r, end(%esp)
+        jbe     .L_break_loop           /* if (out >= end) */
+
+        cmpl    in_r, last(%esp)
+        jbe     .L_break_loop
+
+.L_do_loop:
+        /* regs: %esi = in, %ebp = hold, %bl = bits, %edi = out
+         *
+         * do {
+         *   if (bits < 15) {
+         *     hold |= *((unsigned short *)in)++ << bits;
+         *     bits += 16
+         *   }
+         *   this = lcode[hold & lmask]
+         */
+        cmpb    $15, bits_r
+        ja      .L_get_length_code      /* if (15 < bits) */
+
+        xorl    %eax, %eax
+        lodsw                           /* al = *(ushort *)in++ */
+        movb    bits_r, %cl             /* cl = bits, needs it for shifting */
+        addb    $16, bits_r             /* bits += 16 */
+        shll    %cl, %eax
+        orl     %eax, hold_r            /* hold |= *((ushort *)in)++ << bits */
+
+.L_get_length_code:
+        movl    lmask(%esp), %edx       /* edx = lmask */
+        movl    lcode(%esp), %ecx       /* ecx = lcode */
+        andl    hold_r, %edx            /* edx &= hold */
+        movl    (%ecx,%edx,4), %eax     /* eax = lcode[hold & lmask] */
+
+.L_dolen:
+        /* regs: %esi = in, %ebp = hold, %bl = bits, %edi = out
+         *
+         * dolen:
+         *    bits -= this.bits;
+         *    hold >>= this.bits
+         */
+        movb    %ah, %cl                /* cl = this.bits */
+        subb    %ah, bits_r             /* bits -= this.bits */
+        shrl    %cl, hold_r             /* hold >>= this.bits */
+
+        /* check if op is a literal
+         * if (op == 0) {
+         *    PUP(out) = this.val;
+         *  }
+         */
+        testb   %al, %al
+        jnz     .L_test_for_length_base /* if (op != 0) 45.7% */
+
+        shrl    $16, %eax               /* output this.val char */
+        stosb
+        jmp     .L_while_test
+
+.L_test_for_length_base:
+        /* regs: %esi = in, %ebp = hold, %bl = bits, %edi = out, %edx = len
+         *
+         * else if (op & 16) {
+         *   len = this.val
+         *   op &= 15
+         *   if (op) {
+         *     if (op > bits) {
+         *       hold |= *((unsigned short *)in)++ << bits;
+         *       bits += 16
+         *     }
+         *     len += hold & mask[op];
+         *     bits -= op;
+         *     hold >>= op;
+         *   }
+         */
+#define len_r %edx
+        movl    %eax, len_r             /* len = this */
+        shrl    $16, len_r              /* len = this.val */
+        movb    %al, %cl
+
+        testb   $16, %al
+        jz      .L_test_for_second_level_length /* if ((op & 16) == 0) 8% */
+        andb    $15, %cl                /* op &= 15 */
+        jz      .L_save_len             /* if (!op) */
+        cmpb    %cl, bits_r
+        jae     .L_add_bits_to_len      /* if (op <= bits) */
+
+        movb    %cl, %ch                /* stash op in ch, freeing cl */
+        xorl    %eax, %eax
+        lodsw                           /* al = *(ushort *)in++ */
+        movb    bits_r, %cl             /* cl = bits, needs it for shifting */
+        addb    $16, bits_r             /* bits += 16 */
+        shll    %cl, %eax
+        orl     %eax, hold_r            /* hold |= *((ushort *)in)++ << bits */
+        movb    %ch, %cl                /* move op back to ecx */
+
+.L_add_bits_to_len:
+        movl    $1, %eax
+        shll    %cl, %eax
+        decl    %eax
+        subb    %cl, bits_r
+        andl    hold_r, %eax            /* eax &= hold */
+        shrl    %cl, hold_r
+        addl    %eax, len_r             /* len += hold & mask[op] */
+
+.L_save_len:
+        movl    len_r, len(%esp)        /* save len */
+#undef  len_r
+
+.L_decode_distance:
+        /* regs: %esi = in, %ebp = hold, %bl = bits, %edi = out, %edx = dist
+         *
+         *   if (bits < 15) {
+         *     hold |= *((unsigned short *)in)++ << bits;
+         *     bits += 16
+         *   }
+         *   this = dcode[hold & dmask];
+         * dodist:
+         *   bits -= this.bits;
+         *   hold >>= this.bits;
+         *   op = this.op;
+         */
+
+        cmpb    $15, bits_r
+        ja      .L_get_distance_code    /* if (15 < bits) */
+
+        xorl    %eax, %eax
+        lodsw                           /* al = *(ushort *)in++ */
+        movb    bits_r, %cl             /* cl = bits, needs it for shifting */
+        addb    $16, bits_r             /* bits += 16 */
+        shll    %cl, %eax
+        orl     %eax, hold_r            /* hold |= *((ushort *)in)++ << bits */
+
+.L_get_distance_code:
+        movl    dmask(%esp), %edx       /* edx = dmask */
+        movl    dcode(%esp), %ecx       /* ecx = dcode */
+        andl    hold_r, %edx            /* edx &= hold */
+        movl    (%ecx,%edx,4), %eax     /* eax = dcode[hold & dmask] */
+
+#define dist_r %edx
+.L_dodist:
+        movl    %eax, dist_r            /* dist = this */
+        shrl    $16, dist_r             /* dist = this.val */
+        movb    %ah, %cl
+        subb    %ah, bits_r             /* bits -= this.bits */
+        shrl    %cl, hold_r             /* hold >>= this.bits */
+
+        /* if (op & 16) {
+         *   dist = this.val
+         *   op &= 15
+         *   if (op > bits) {
+         *     hold |= *((unsigned short *)in)++ << bits;
+         *     bits += 16
+         *   }
+         *   dist += hold & mask[op];
+         *   bits -= op;
+         *   hold >>= op;
+         */
+        movb    %al, %cl                /* cl = this.op */
+
+        testb   $16, %al                /* if ((op & 16) == 0) */
+        jz      .L_test_for_second_level_dist
+        andb    $15, %cl                /* op &= 15 */
+        jz      .L_check_dist_one
+        cmpb    %cl, bits_r
+        jae     .L_add_bits_to_dist     /* if (op <= bits) 97.6% */
+
+        movb    %cl, %ch                /* stash op in ch, freeing cl */
+        xorl    %eax, %eax
+        lodsw                           /* al = *(ushort *)in++ */
+        movb    bits_r, %cl             /* cl = bits, needs it for shifting */
+        addb    $16, bits_r             /* bits += 16 */
+        shll    %cl, %eax
+        orl     %eax, hold_r            /* hold |= *((ushort *)in)++ << bits */
+        movb    %ch, %cl                /* move op back to ecx */
+
+.L_add_bits_to_dist:
+        movl    $1, %eax
+        shll    %cl, %eax
+        decl    %eax                    /* (1 << op) - 1 */
+        subb    %cl, bits_r
+        andl    hold_r, %eax            /* eax &= hold */
+        shrl    %cl, hold_r
+        addl    %eax, dist_r            /* dist += hold & ((1 << op) - 1) */
+        jmp     .L_check_window
+
+.L_check_window:
+        /* regs: %esi = from, %ebp = hold, %bl = bits, %edi = out, %edx = dist
+         *       %ecx = nbytes
+         *
+         * nbytes = out - beg;
+         * if (dist <= nbytes) {
+         *   from = out - dist;
+         *   do {
+         *     PUP(out) = PUP(from);
+         *   } while (--len > 0) {
+         * }
+         */
+
+        movl    in_r, in(%esp)          /* save in so from can use it's reg */
+        movl    out_r, %eax
+        subl    beg(%esp), %eax         /* nbytes = out - beg */
+
+        cmpl    dist_r, %eax
+        jb      .L_clip_window          /* if (dist > nbytes) 4.2% */
+
+        movl    len(%esp), %ecx
+        movl    out_r, from_r
+        subl    dist_r, from_r          /* from = out - dist */
+
+        subl    $3, %ecx
+        movb    (from_r), %al
+        movb    %al, (out_r)
+        movb    1(from_r), %al
+        movb    2(from_r), %dl
+        addl    $3, from_r
+        movb    %al, 1(out_r)
+        movb    %dl, 2(out_r)
+        addl    $3, out_r
+        rep     movsb
+
+        movl    in(%esp), in_r          /* move in back to %esi, toss from */
+        jmp     .L_while_test
+
+.align 16,0x90
+.L_check_dist_one:
+        cmpl    $1, dist_r
+        jne     .L_check_window
+        cmpl    out_r, beg(%esp)
+        je      .L_check_window
+
+        decl    out_r
+        movl    len(%esp), %ecx
+        movb    (out_r), %al
+        subl    $3, %ecx
+
+        movb    %al, 1(out_r)
+        movb    %al, 2(out_r)
+        movb    %al, 3(out_r)
+        addl    $4, out_r
+        rep     stosb
+
+        jmp     .L_while_test
+
+.align 16,0x90
+.L_test_for_second_level_length:
+        /* else if ((op & 64) == 0) {
+         *   this = lcode[this.val + (hold & mask[op])];
+         * }
+         */
+        testb   $64, %al
+        jnz     .L_test_for_end_of_block  /* if ((op & 64) != 0) */
+
+        movl    $1, %eax
+        shll    %cl, %eax
+        decl    %eax
+        andl    hold_r, %eax            /* eax &= hold */
+        addl    %edx, %eax              /* eax += this.val */
+        movl    lcode(%esp), %edx       /* edx = lcode */
+        movl    (%edx,%eax,4), %eax     /* eax = lcode[val + (hold&mask[op])] */
+        jmp     .L_dolen
+
+.align 16,0x90
+.L_test_for_second_level_dist:
+        /* else if ((op & 64) == 0) {
+         *   this = dcode[this.val + (hold & mask[op])];
+         * }
+         */
+        testb   $64, %al
+        jnz     .L_invalid_distance_code  /* if ((op & 64) != 0) */
+
+        movl    $1, %eax
+        shll    %cl, %eax
+        decl    %eax
+        andl    hold_r, %eax            /* eax &= hold */
+        addl    %edx, %eax              /* eax += this.val */
+        movl    dcode(%esp), %edx       /* edx = dcode */
+        movl    (%edx,%eax,4), %eax     /* eax = dcode[val + (hold&mask[op])] */
+        jmp     .L_dodist
+
+.align 16,0x90
+.L_clip_window:
+        /* regs: %esi = from, %ebp = hold, %bl = bits, %edi = out, %edx = dist
+         *       %ecx = nbytes
+         *
+         * else {
+         *   if (dist > wsize) {
+         *     invalid distance
+         *   }
+         *   from = window;
+         *   nbytes = dist - nbytes;
+         *   if (write == 0) {
+         *     from += wsize - nbytes;
+         */
+#define nbytes_r %ecx
+        movl    %eax, nbytes_r
+        movl    wsize(%esp), %eax       /* prepare for dist compare */
+        negl    nbytes_r                /* nbytes = -nbytes */
+        movl    window(%esp), from_r    /* from = window */
+
+        cmpl    dist_r, %eax
+        jb      .L_invalid_distance_too_far /* if (dist > wsize) */
+
+        addl    dist_r, nbytes_r        /* nbytes = dist - nbytes */
+        cmpl    $0, write(%esp)
+        jne     .L_wrap_around_window   /* if (write != 0) */
+
+        subl    nbytes_r, %eax
+        addl    %eax, from_r            /* from += wsize - nbytes */
+
+        /* regs: %esi = from, %ebp = hold, %bl = bits, %edi = out, %edx = dist
+         *       %ecx = nbytes, %eax = len
+         *
+         *     if (nbytes < len) {
+         *       len -= nbytes;
+         *       do {
+         *         PUP(out) = PUP(from);
+         *       } while (--nbytes);
+         *       from = out - dist;
+         *     }
+         *   }
+         */
+#define len_r %eax
+        movl    len(%esp), len_r
+        cmpl    nbytes_r, len_r
+        jbe     .L_do_copy1             /* if (nbytes >= len) */
+
+        subl    nbytes_r, len_r         /* len -= nbytes */
+        rep     movsb
+        movl    out_r, from_r
+        subl    dist_r, from_r          /* from = out - dist */
+        jmp     .L_do_copy1
+
+        cmpl    nbytes_r, len_r
+        jbe     .L_do_copy1             /* if (nbytes >= len) */
+
+        subl    nbytes_r, len_r         /* len -= nbytes */
+        rep     movsb
+        movl    out_r, from_r
+        subl    dist_r, from_r          /* from = out - dist */
+        jmp     .L_do_copy1
+
+.L_wrap_around_window:
+        /* regs: %esi = from, %ebp = hold, %bl = bits, %edi = out, %edx = dist
+         *       %ecx = nbytes, %eax = write, %eax = len
+         *
+         *   else if (write < nbytes) {
+         *     from += wsize + write - nbytes;
+         *     nbytes -= write;
+         *     if (nbytes < len) {
+         *       len -= nbytes;
+         *       do {
+         *         PUP(out) = PUP(from);
+         *       } while (--nbytes);
+         *       from = window;
+         *       nbytes = write;
+         *       if (nbytes < len) {
+         *         len -= nbytes;
+         *         do {
+         *           PUP(out) = PUP(from);
+         *         } while(--nbytes);
+         *         from = out - dist;
+         *       }
+         *     }
+         *   }
+         */
+#define write_r %eax
+        movl    write(%esp), write_r
+        cmpl    write_r, nbytes_r
+        jbe     .L_contiguous_in_window /* if (write >= nbytes) */
+
+        addl    wsize(%esp), from_r
+        addl    write_r, from_r
+        subl    nbytes_r, from_r        /* from += wsize + write - nbytes */
+        subl    write_r, nbytes_r       /* nbytes -= write */
+#undef write_r
+
+        movl    len(%esp), len_r
+        cmpl    nbytes_r, len_r
+        jbe     .L_do_copy1             /* if (nbytes >= len) */
+
+        subl    nbytes_r, len_r         /* len -= nbytes */
+        rep     movsb
+        movl    window(%esp), from_r    /* from = window */
+        movl    write(%esp), nbytes_r   /* nbytes = write */
+        cmpl    nbytes_r, len_r
+        jbe     .L_do_copy1             /* if (nbytes >= len) */
+
+        subl    nbytes_r, len_r         /* len -= nbytes */
+        rep     movsb
+        movl    out_r, from_r
+        subl    dist_r, from_r          /* from = out - dist */
+        jmp     .L_do_copy1
+
+.L_contiguous_in_window:
+        /* regs: %esi = from, %ebp = hold, %bl = bits, %edi = out, %edx = dist
+         *       %ecx = nbytes, %eax = write, %eax = len
+         *
+         *   else {
+         *     from += write - nbytes;
+         *     if (nbytes < len) {
+         *       len -= nbytes;
+         *       do {
+         *         PUP(out) = PUP(from);
+         *       } while (--nbytes);
+         *       from = out - dist;
+         *     }
+         *   }
+         */
+#define write_r %eax
+        addl    write_r, from_r
+        subl    nbytes_r, from_r        /* from += write - nbytes */
+#undef write_r
+
+        movl    len(%esp), len_r
+        cmpl    nbytes_r, len_r
+        jbe     .L_do_copy1             /* if (nbytes >= len) */
+
+        subl    nbytes_r, len_r         /* len -= nbytes */
+        rep     movsb
+        movl    out_r, from_r
+        subl    dist_r, from_r          /* from = out - dist */
+
+.L_do_copy1:
+        /* regs: %esi = from, %esi = in, %ebp = hold, %bl = bits, %edi = out
+         *       %eax = len
+         *
+         *     while (len > 0) {
+         *       PUP(out) = PUP(from);
+         *       len--;
+         *     }
+         *   }
+         * } while (in < last && out < end);
+         */
+#undef nbytes_r
+#define in_r %esi
+        movl    len_r, %ecx
+        rep     movsb
+
+        movl    in(%esp), in_r          /* move in back to %esi, toss from */
+        jmp     .L_while_test
+
+#undef len_r
+#undef dist_r
+
+#endif /* NO_MMX || RUN_TIME_MMX */
+
+
+/*** MMX code ***/
+
+#if defined( USE_MMX ) || defined( RUN_TIME_MMX )
+
+.align 32,0x90
+.L_init_mmx:
+        emms
+
+#undef  bits_r
+#undef  bitslong_r
+#define bitslong_r %ebp
+#define hold_mm    %mm0
+        movd    %ebp, hold_mm
+        movl    %ebx, bitslong_r
+
+#define used_mm   %mm1
+#define dmask2_mm %mm2
+#define lmask2_mm %mm3
+#define lmask_mm  %mm4
+#define dmask_mm  %mm5
+#define tmp_mm    %mm6
+
+        movd    lmask(%esp), lmask_mm
+        movq    lmask_mm, lmask2_mm
+        movd    dmask(%esp), dmask_mm
+        movq    dmask_mm, dmask2_mm
+        pxor    used_mm, used_mm
+        movl    lcode(%esp), %ebx       /* ebx = lcode */
+        jmp     .L_do_loop_mmx
+
+.align 32,0x90
+.L_while_test_mmx:
+        /* while (in < last && out < end)
+         */
+        cmpl    out_r, end(%esp)
+        jbe     .L_break_loop           /* if (out >= end) */
+
+        cmpl    in_r, last(%esp)
+        jbe     .L_break_loop
+
+.L_do_loop_mmx:
+        psrlq   used_mm, hold_mm        /* hold_mm >>= last bit length */
+
+        cmpl    $32, bitslong_r
+        ja      .L_get_length_code_mmx  /* if (32 < bits) */
+
+        movd    bitslong_r, tmp_mm
+        movd    (in_r), %mm7
+        addl    $4, in_r
+        psllq   tmp_mm, %mm7
+        addl    $32, bitslong_r
+        por     %mm7, hold_mm           /* hold_mm |= *((uint *)in)++ << bits */
+
+.L_get_length_code_mmx:
+        pand    hold_mm, lmask_mm
+        movd    lmask_mm, %eax
+        movq    lmask2_mm, lmask_mm
+        movl    (%ebx,%eax,4), %eax     /* eax = lcode[hold & lmask] */
+
+.L_dolen_mmx:
+        movzbl  %ah, %ecx               /* ecx = this.bits */
+        movd    %ecx, used_mm
+        subl    %ecx, bitslong_r        /* bits -= this.bits */
+
+        testb   %al, %al
+        jnz     .L_test_for_length_base_mmx /* if (op != 0) 45.7% */
+
+        shrl    $16, %eax               /* output this.val char */
+        stosb
+        jmp     .L_while_test_mmx
+
+.L_test_for_length_base_mmx:
+#define len_r  %edx
+        movl    %eax, len_r             /* len = this */
+        shrl    $16, len_r              /* len = this.val */
+
+        testb   $16, %al
+        jz      .L_test_for_second_level_length_mmx /* if ((op & 16) == 0) 8% */
+        andl    $15, %eax               /* op &= 15 */
+        jz      .L_decode_distance_mmx  /* if (!op) */
+
+        psrlq   used_mm, hold_mm        /* hold_mm >>= last bit length */
+        movd    %eax, used_mm
+        movd    hold_mm, %ecx
+        subl    %eax, bitslong_r
+        andl    .L_mask(,%eax,4), %ecx
+        addl    %ecx, len_r             /* len += hold & mask[op] */
+
+.L_decode_distance_mmx:
+        psrlq   used_mm, hold_mm        /* hold_mm >>= last bit length */
+
+        cmpl    $32, bitslong_r
+        ja      .L_get_dist_code_mmx    /* if (32 < bits) */
+
+        movd    bitslong_r, tmp_mm
+        movd    (in_r), %mm7
+        addl    $4, in_r
+        psllq   tmp_mm, %mm7
+        addl    $32, bitslong_r
+        por     %mm7, hold_mm           /* hold_mm |= *((uint *)in)++ << bits */
+
+.L_get_dist_code_mmx:
+        movl    dcode(%esp), %ebx       /* ebx = dcode */
+        pand    hold_mm, dmask_mm
+        movd    dmask_mm, %eax
+        movq    dmask2_mm, dmask_mm
+        movl    (%ebx,%eax,4), %eax     /* eax = dcode[hold & lmask] */
+
+.L_dodist_mmx:
+#define dist_r %ebx
+        movzbl  %ah, %ecx               /* ecx = this.bits */
+        movl    %eax, dist_r
+        shrl    $16, dist_r             /* dist  = this.val */
+        subl    %ecx, bitslong_r        /* bits -= this.bits */
+        movd    %ecx, used_mm
+
+        testb   $16, %al                /* if ((op & 16) == 0) */
+        jz      .L_test_for_second_level_dist_mmx
+        andl    $15, %eax               /* op &= 15 */
+        jz      .L_check_dist_one_mmx
+
+.L_add_bits_to_dist_mmx:
+        psrlq   used_mm, hold_mm        /* hold_mm >>= last bit length */
+        movd    %eax, used_mm           /* save bit length of current op */
+        movd    hold_mm, %ecx           /* get the next bits on input stream */
+        subl    %eax, bitslong_r        /* bits -= op bits */
+        andl    .L_mask(,%eax,4), %ecx  /* ecx   = hold & mask[op] */
+        addl    %ecx, dist_r            /* dist += hold & mask[op] */
+
+.L_check_window_mmx:
+        movl    in_r, in(%esp)          /* save in so from can use it's reg */
+        movl    out_r, %eax
+        subl    beg(%esp), %eax         /* nbytes = out - beg */
+
+        cmpl    dist_r, %eax
+        jb      .L_clip_window_mmx      /* if (dist > nbytes) 4.2% */
+
+        movl    len_r, %ecx
+        movl    out_r, from_r
+        subl    dist_r, from_r          /* from = out - dist */
+
+        subl    $3, %ecx
+        movb    (from_r), %al
+        movb    %al, (out_r)
+        movb    1(from_r), %al
+        movb    2(from_r), %dl
+        addl    $3, from_r
+        movb    %al, 1(out_r)
+        movb    %dl, 2(out_r)
+        addl    $3, out_r
+        rep     movsb
+
+        movl    in(%esp), in_r          /* move in back to %esi, toss from */
+        movl    lcode(%esp), %ebx       /* move lcode back to %ebx, toss dist */
+        jmp     .L_while_test_mmx
+
+.align 16,0x90
+.L_check_dist_one_mmx:
+        cmpl    $1, dist_r
+        jne     .L_check_window_mmx
+        cmpl    out_r, beg(%esp)
+        je      .L_check_window_mmx
+
+        decl    out_r
+        movl    len_r, %ecx
+        movb    (out_r), %al
+        subl    $3, %ecx
+
+        movb    %al, 1(out_r)
+        movb    %al, 2(out_r)
+        movb    %al, 3(out_r)
+        addl    $4, out_r
+        rep     stosb
+
+        movl    lcode(%esp), %ebx       /* move lcode back to %ebx, toss dist */
+        jmp     .L_while_test_mmx
+
+.align 16,0x90
+.L_test_for_second_level_length_mmx:
+        testb   $64, %al
+        jnz     .L_test_for_end_of_block  /* if ((op & 64) != 0) */
+
+        andl    $15, %eax
+        psrlq   used_mm, hold_mm        /* hold_mm >>= last bit length */
+        movd    hold_mm, %ecx
+        andl    .L_mask(,%eax,4), %ecx
+        addl    len_r, %ecx
+        movl    (%ebx,%ecx,4), %eax     /* eax = lcode[hold & lmask] */
+        jmp     .L_dolen_mmx
+
+.align 16,0x90
+.L_test_for_second_level_dist_mmx:
+        testb   $64, %al
+        jnz     .L_invalid_distance_code  /* if ((op & 64) != 0) */
+
+        andl    $15, %eax
+        psrlq   used_mm, hold_mm        /* hold_mm >>= last bit length */
+        movd    hold_mm, %ecx
+        andl    .L_mask(,%eax,4), %ecx
+        movl    dcode(%esp), %eax       /* ecx = dcode */
+        addl    dist_r, %ecx
+        movl    (%eax,%ecx,4), %eax     /* eax = lcode[hold & lmask] */
+        jmp     .L_dodist_mmx
+
+.align 16,0x90
+.L_clip_window_mmx:
+#define nbytes_r %ecx
+        movl    %eax, nbytes_r
+        movl    wsize(%esp), %eax       /* prepare for dist compare */
+        negl    nbytes_r                /* nbytes = -nbytes */
+        movl    window(%esp), from_r    /* from = window */
+
+        cmpl    dist_r, %eax
+        jb      .L_invalid_distance_too_far /* if (dist > wsize) */
+
+        addl    dist_r, nbytes_r        /* nbytes = dist - nbytes */
+        cmpl    $0, write(%esp)
+        jne     .L_wrap_around_window_mmx /* if (write != 0) */
+
+        subl    nbytes_r, %eax
+        addl    %eax, from_r            /* from += wsize - nbytes */
+
+        cmpl    nbytes_r, len_r
+        jbe     .L_do_copy1_mmx         /* if (nbytes >= len) */
+
+        subl    nbytes_r, len_r         /* len -= nbytes */
+        rep     movsb
+        movl    out_r, from_r
+        subl    dist_r, from_r          /* from = out - dist */
+        jmp     .L_do_copy1_mmx
+
+        cmpl    nbytes_r, len_r
+        jbe     .L_do_copy1_mmx         /* if (nbytes >= len) */
+
+        subl    nbytes_r, len_r         /* len -= nbytes */
+        rep     movsb
+        movl    out_r, from_r
+        subl    dist_r, from_r          /* from = out - dist */
+        jmp     .L_do_copy1_mmx
+
+.L_wrap_around_window_mmx:
+#define write_r %eax
+        movl    write(%esp), write_r
+        cmpl    write_r, nbytes_r
+        jbe     .L_contiguous_in_window_mmx /* if (write >= nbytes) */
+
+        addl    wsize(%esp), from_r
+        addl    write_r, from_r
+        subl    nbytes_r, from_r        /* from += wsize + write - nbytes */
+        subl    write_r, nbytes_r       /* nbytes -= write */
+#undef write_r
+
+        cmpl    nbytes_r, len_r
+        jbe     .L_do_copy1_mmx         /* if (nbytes >= len) */
+
+        subl    nbytes_r, len_r         /* len -= nbytes */
+        rep     movsb
+        movl    window(%esp), from_r    /* from = window */
+        movl    write(%esp), nbytes_r   /* nbytes = write */
+        cmpl    nbytes_r, len_r
+        jbe     .L_do_copy1_mmx         /* if (nbytes >= len) */
+
+        subl    nbytes_r, len_r         /* len -= nbytes */
+        rep     movsb
+        movl    out_r, from_r
+        subl    dist_r, from_r          /* from = out - dist */
+        jmp     .L_do_copy1_mmx
+
+.L_contiguous_in_window_mmx:
+#define write_r %eax
+        addl    write_r, from_r
+        subl    nbytes_r, from_r        /* from += write - nbytes */
+#undef write_r
+
+        cmpl    nbytes_r, len_r
+        jbe     .L_do_copy1_mmx         /* if (nbytes >= len) */
+
+        subl    nbytes_r, len_r         /* len -= nbytes */
+        rep     movsb
+        movl    out_r, from_r
+        subl    dist_r, from_r          /* from = out - dist */
+
+.L_do_copy1_mmx:
+#undef nbytes_r
+#define in_r %esi
+        movl    len_r, %ecx
+        rep     movsb
+
+        movl    in(%esp), in_r          /* move in back to %esi, toss from */
+        movl    lcode(%esp), %ebx       /* move lcode back to %ebx, toss dist */
+        jmp     .L_while_test_mmx
+
+#undef hold_r
+#undef bitslong_r
+
+#endif /* USE_MMX || RUN_TIME_MMX */
+
+
+/*** USE_MMX, NO_MMX, and RUNTIME_MMX from here on ***/
+
+.L_invalid_distance_code:
+        /* else {
+         *   strm->msg = "invalid distance code";
+         *   state->mode = BAD;
+         * }
+         */
+        movl    $.L_invalid_distance_code_msg, %ecx
+        movl    $INFLATE_MODE_BAD, %edx
+        jmp     .L_update_stream_state
+
+.L_test_for_end_of_block:
+        /* else if (op & 32) {
+         *   state->mode = TYPE;
+         *   break;
+         * }
+         */
+        testb   $32, %al
+        jz      .L_invalid_literal_length_code  /* if ((op & 32) == 0) */
+
+        movl    $0, %ecx
+        movl    $INFLATE_MODE_TYPE, %edx
+        jmp     .L_update_stream_state
+
+.L_invalid_literal_length_code:
+        /* else {
+         *   strm->msg = "invalid literal/length code";
+         *   state->mode = BAD;
+         * }
+         */
+        movl    $.L_invalid_literal_length_code_msg, %ecx
+        movl    $INFLATE_MODE_BAD, %edx
+        jmp     .L_update_stream_state
+
+.L_invalid_distance_too_far:
+        /* strm->msg = "invalid distance too far back";
+         * state->mode = BAD;
+         */
+        movl    in(%esp), in_r          /* from_r has in's reg, put in back */
+        movl    $.L_invalid_distance_too_far_msg, %ecx
+        movl    $INFLATE_MODE_BAD, %edx
+        jmp     .L_update_stream_state
+
+.L_update_stream_state:
+        /* set strm->msg = %ecx, strm->state->mode = %edx */
+        movl    strm_sp(%esp), %eax
+        testl   %ecx, %ecx              /* if (msg != NULL) */
+        jz      .L_skip_msg
+        movl    %ecx, msg_strm(%eax)    /* strm->msg = msg */
+.L_skip_msg:
+        movl    state_strm(%eax), %eax  /* state = strm->state */
+        movl    %edx, mode_state(%eax)  /* state->mode = edx (BAD | TYPE) */
+        jmp     .L_break_loop
+
+.align 32,0x90
+.L_break_loop:
+
+/*
+ * Regs:
+ *
+ * bits = %ebp when mmx, and in %ebx when non-mmx
+ * hold = %hold_mm when mmx, and in %ebp when non-mmx
+ * in   = %esi
+ * out  = %edi
+ */
+
+#if defined( USE_MMX ) || defined( RUN_TIME_MMX )
+
+#if defined( RUN_TIME_MMX )
+
+        cmpl    $DO_USE_MMX, inflate_fast_use_mmx
+        jne     .L_update_next_in
+
+#endif /* RUN_TIME_MMX */
+
+        movl    %ebp, %ebx
+
+.L_update_next_in:
+
+#endif
+
+#define strm_r  %eax
+#define state_r %edx
+
+        /* len = bits >> 3;
+         * in -= len;
+         * bits -= len << 3;
+         * hold &= (1U << bits) - 1;
+         * state->hold = hold;
+         * state->bits = bits;
+         * strm->next_in = in;
+         * strm->next_out = out;
+         */
+        movl    strm_sp(%esp), strm_r
+        movl    %ebx, %ecx
+        movl    state_strm(strm_r), state_r
+        shrl    $3, %ecx
+        subl    %ecx, in_r
+        shll    $3, %ecx
+        subl    %ecx, %ebx
+        movl    out_r, next_out_strm(strm_r)
+        movl    %ebx, bits_state(state_r)
+        movl    %ebx, %ecx
+
+        leal    buf(%esp), %ebx
+        cmpl    %ebx, last(%esp)
+        jne     .L_buf_not_used         /* if buf != last */
+
+        subl    %ebx, in_r              /* in -= buf */
+        movl    next_in_strm(strm_r), %ebx
+        movl    %ebx, last(%esp)        /* last = strm->next_in */
+        addl    %ebx, in_r              /* in += strm->next_in */
+        movl    avail_in_strm(strm_r), %ebx
+        subl    $11, %ebx
+        addl    %ebx, last(%esp)    /* last = &strm->next_in[ avail_in - 11 ] */
+
+.L_buf_not_used:
+        movl    in_r, next_in_strm(strm_r)
+
+        movl    $1, %ebx
+        shll    %cl, %ebx
+        decl    %ebx
+
+#if defined( USE_MMX ) || defined( RUN_TIME_MMX )
+
+#if defined( RUN_TIME_MMX )
+
+        cmpl    $DO_USE_MMX, inflate_fast_use_mmx
+        jne     .L_update_hold
+
+#endif /* RUN_TIME_MMX */
+
+        psrlq   used_mm, hold_mm        /* hold_mm >>= last bit length */
+        movd    hold_mm, %ebp
+
+        emms
+
+.L_update_hold:
+
+#endif /* USE_MMX || RUN_TIME_MMX */
+
+        andl    %ebx, %ebp
+        movl    %ebp, hold_state(state_r)
+
+#define last_r %ebx
+
+        /* strm->avail_in = in < last ? 11 + (last - in) : 11 - (in - last) */
+        movl    last(%esp), last_r
+        cmpl    in_r, last_r
+        jbe     .L_last_is_smaller     /* if (in >= last) */
+
+        subl    in_r, last_r           /* last -= in */
+        addl    $11, last_r            /* last += 11 */
+        movl    last_r, avail_in_strm(strm_r)
+        jmp     .L_fixup_out
+.L_last_is_smaller:
+        subl    last_r, in_r           /* in -= last */
+        negl    in_r                   /* in = -in */
+        addl    $11, in_r              /* in += 11 */
+        movl    in_r, avail_in_strm(strm_r)
+
+#undef last_r
+#define end_r %ebx
+
+.L_fixup_out:
+        /* strm->avail_out = out < end ? 257 + (end - out) : 257 - (out - end)*/
+        movl    end(%esp), end_r
+        cmpl    out_r, end_r
+        jbe     .L_end_is_smaller      /* if (out >= end) */
+
+        subl    out_r, end_r           /* end -= out */
+        addl    $257, end_r            /* end += 257 */
+        movl    end_r, avail_out_strm(strm_r)
+        jmp     .L_done
+.L_end_is_smaller:
+        subl    end_r, out_r           /* out -= end */
+        negl    out_r                  /* out = -out */
+        addl    $257, out_r            /* out += 257 */
+        movl    out_r, avail_out_strm(strm_r)
+
+#undef end_r
+#undef strm_r
+#undef state_r
+
+.L_done:
+        addl    $local_var_size, %esp
+        popf
+        popl    %ebx
+        popl    %ebp
+        popl    %esi
+        popl    %edi
+        ret
+
+#if defined( GAS_ELF )
+/* elf info */
+.type inflate_fast,@function
+.size inflate_fast,.-inflate_fast
+#endif
diff --git a/updater/zlib123/contrib/iostream/test.cpp b/updater/zlib123/contrib/iostream/test.cpp
new file mode 100644
index 0000000..063e3bf
--- /dev/null
+++ b/updater/zlib123/contrib/iostream/test.cpp
@@ -0,0 +1,24 @@
+
+#include "zfstream.h"
+
+int main() {
+
+  // Construct a stream object with this filebuffer.  Anything sent
+  // to this stream will go to standard out.
+  gzofstream os( 1, ios::out );
+
+  // This text is getting compressed and sent to stdout.
+  // To prove this, run 'test | zcat'.
+  os << "Hello, Mommy" << endl;
+
+  os << setcompressionlevel( Z_NO_COMPRESSION );
+  os << "hello, hello, hi, ho!" << endl;
+
+  setcompressionlevel( os, Z_DEFAULT_COMPRESSION )
+    << "I'm compressing again" << endl;
+
+  os.close();
+
+  return 0;
+
+}
diff --git a/updater/zlib123/contrib/iostream/zfstream.cpp b/updater/zlib123/contrib/iostream/zfstream.cpp
new file mode 100644
index 0000000..100e68f
--- /dev/null
+++ b/updater/zlib123/contrib/iostream/zfstream.cpp
@@ -0,0 +1,329 @@
+
+#include "zfstream.h"
+
+gzfilebuf::gzfilebuf() :
+  file(NULL),
+  mode(0),
+  own_file_descriptor(0)
+{ }
+
+gzfilebuf::~gzfilebuf() {
+
+  sync();
+  if ( own_file_descriptor )
+    close();
+
+}
+
+gzfilebuf *gzfilebuf::open( const char *name,
+                            int io_mode ) {
+
+  if ( is_open() )
+    return NULL;
+
+  char char_mode[10];
+  char *p = char_mode;
+
+  if ( io_mode & ios::in ) {
+    mode = ios::in;
+    *p++ = 'r';
+  } else if ( io_mode & ios::app ) {
+    mode = ios::app;
+    *p++ = 'a';
+  } else {
+    mode = ios::out;
+    *p++ = 'w';
+  }
+
+  if ( io_mode & ios::binary ) {
+    mode |= ios::binary;
+    *p++ = 'b';
+  }
+
+  // Hard code the compression level
+  if ( io_mode & (ios::out|ios::app )) {
+    *p++ = '9';
+  }
+
+  // Put the end-of-string indicator
+  *p = '\0';
+
+  if ( (file = gzopen(name, char_mode)) == NULL )
+    return NULL;
+
+  own_file_descriptor = 1;
+
+  return this;
+
+}
+
+gzfilebuf *gzfilebuf::attach( int file_descriptor,
+                              int io_mode ) {
+
+  if ( is_open() )
+    return NULL;
+
+  char char_mode[10];
+  char *p = char_mode;
+
+  if ( io_mode & ios::in ) {
+    mode = ios::in;
+    *p++ = 'r';
+  } else if ( io_mode & ios::app ) {
+    mode = ios::app;
+    *p++ = 'a';
+  } else {
+    mode = ios::out;
+    *p++ = 'w';
+  }
+
+  if ( io_mode & ios::binary ) {
+    mode |= ios::binary;
+    *p++ = 'b';
+  }
+
+  // Hard code the compression level
+  if ( io_mode & (ios::out|ios::app )) {
+    *p++ = '9';
+  }
+
+  // Put the end-of-string indicator
+  *p = '\0';
+
+  if ( (file = gzdopen(file_descriptor, char_mode)) == NULL )
+    return NULL;
+
+  own_file_descriptor = 0;
+
+  return this;
+
+}
+
+gzfilebuf *gzfilebuf::close() {
+
+  if ( is_open() ) {
+
+    sync();
+    gzclose( file );
+    file = NULL;
+
+  }
+
+  return this;
+
+}
+
+int gzfilebuf::setcompressionlevel( int comp_level ) {
+
+  return gzsetparams(file, comp_level, -2);
+
+}
+
+int gzfilebuf::setcompressionstrategy( int comp_strategy ) {
+
+  return gzsetparams(file, -2, comp_strategy);
+
+}
+
+
+streampos gzfilebuf::seekoff( streamoff off, ios::seek_dir dir, int which ) {
+
+  return streampos(EOF);
+
+}
+
+int gzfilebuf::underflow() {
+
+  // If the file hasn't been opened for reading, error.
+  if ( !is_open() || !(mode & ios::in) )
+    return EOF;
+
+  // if a buffer doesn't exists, allocate one.
+  if ( !base() ) {
+
+    if ( (allocate()) == EOF )
+      return EOF;
+    setp(0,0);
+
+  } else {
+
+    if ( in_avail() )
+      return (unsigned char) *gptr();
+
+    if ( out_waiting() ) {
+      if ( flushbuf() == EOF )
+        return EOF;
+    }
+
+  }
+
+  // Attempt to fill the buffer.
+
+  int result = fillbuf();
+  if ( result == EOF ) {
+    // disable get area
+    setg(0,0,0);
+    return EOF;
+  }
+
+  return (unsigned char) *gptr();
+
+}
+
+int gzfilebuf::overflow( int c ) {
+
+  if ( !is_open() || !(mode & ios::out) )
+    return EOF;
+
+  if ( !base() ) {
+    if ( allocate() == EOF )
+      return EOF;
+    setg(0,0,0);
+  } else {
+    if (in_avail()) {
+        return EOF;
+    }
+    if (out_waiting()) {
+      if (flushbuf() == EOF)
+        return EOF;
+    }
+  }
+
+  int bl = blen();
+  setp( base(), base() + bl);
+
+  if ( c != EOF ) {
+
+    *pptr() = c;
+    pbump(1);
+
+  }
+
+  return 0;
+
+}
+
+int gzfilebuf::sync() {
+
+  if ( !is_open() )
+    return EOF;
+
+  if ( out_waiting() )
+    return flushbuf();
+
+  return 0;
+
+}
+
+int gzfilebuf::flushbuf() {
+
+  int n;
+  char *q;
+
+  q = pbase();
+  n = pptr() - q;
+
+  if ( gzwrite( file, q, n) < n )
+    return EOF;
+
+  setp(0,0);
+
+  return 0;
+
+}
+
+int gzfilebuf::fillbuf() {
+
+  int required;
+  char *p;
+
+  p = base();
+
+  required = blen();
+
+  int t = gzread( file, p, required );
+
+  if ( t <= 0) return EOF;
+
+  setg( base(), base(), base()+t);
+
+  return t;
+
+}
+
+gzfilestream_common::gzfilestream_common() :
+  ios( gzfilestream_common::rdbuf() )
+{ }
+
+gzfilestream_common::~gzfilestream_common()
+{ }
+
+void gzfilestream_common::attach( int fd, int io_mode ) {
+
+  if ( !buffer.attach( fd, io_mode) )
+    clear( ios::failbit | ios::badbit );
+  else
+    clear();
+
+}
+
+void gzfilestream_common::open( const char *name, int io_mode ) {
+
+  if ( !buffer.open( name, io_mode ) )
+    clear( ios::failbit | ios::badbit );
+  else
+    clear();
+
+}
+
+void gzfilestream_common::close() {
+
+  if ( !buffer.close() )
+    clear( ios::failbit | ios::badbit );
+
+}
+
+gzfilebuf *gzfilestream_common::rdbuf()
+{
+  return &buffer;
+}
+
+gzifstream::gzifstream() :
+  ios( gzfilestream_common::rdbuf() )
+{
+  clear( ios::badbit );
+}
+
+gzifstream::gzifstream( const char *name, int io_mode ) :
+  ios( gzfilestream_common::rdbuf() )
+{
+  gzfilestream_common::open( name, io_mode );
+}
+
+gzifstream::gzifstream( int fd, int io_mode ) :
+  ios( gzfilestream_common::rdbuf() )
+{
+  gzfilestream_common::attach( fd, io_mode );
+}
+
+gzifstream::~gzifstream() { }
+
+gzofstream::gzofstream() :
+  ios( gzfilestream_common::rdbuf() )
+{
+  clear( ios::badbit );
+}
+
+gzofstream::gzofstream( const char *name, int io_mode ) :
+  ios( gzfilestream_common::rdbuf() )
+{
+  gzfilestream_common::open( name, io_mode );
+}
+
+gzofstream::gzofstream( int fd, int io_mode ) :
+  ios( gzfilestream_common::rdbuf() )
+{
+  gzfilestream_common::attach( fd, io_mode );
+}
+
+gzofstream::~gzofstream() { }
diff --git a/updater/zlib123/contrib/iostream/zfstream.h b/updater/zlib123/contrib/iostream/zfstream.h
new file mode 100644
index 0000000..96d7f6a
--- /dev/null
+++ b/updater/zlib123/contrib/iostream/zfstream.h
@@ -0,0 +1,128 @@
+
+#ifndef zfstream_h
+#define zfstream_h
+
+#include <fstream.h>
+#include "zlib.h"
+
+class gzfilebuf : public streambuf {
+
+public:
+
+  gzfilebuf( );
+  virtual ~gzfilebuf();
+
+  gzfilebuf *open( const char *name, int io_mode );
+  gzfilebuf *attach( int file_descriptor, int io_mode );
+  gzfilebuf *close();
+
+  int setcompressionlevel( int comp_level );
+  int setcompressionstrategy( int comp_strategy );
+
+  inline int is_open() const { return (file !=NULL); }
+
+  virtual streampos seekoff( streamoff, ios::seek_dir, int );
+
+  virtual int sync();
+
+protected:
+
+  virtual int underflow();
+  virtual int overflow( int = EOF );
+
+private:
+
+  gzFile file;
+  short mode;
+  short own_file_descriptor;
+
+  int flushbuf();
+  int fillbuf();
+
+};
+
+class gzfilestream_common : virtual public ios {
+
+  friend class gzifstream;
+  friend class gzofstream;
+  friend gzofstream &setcompressionlevel( gzofstream &, int );
+  friend gzofstream &setcompressionstrategy( gzofstream &, int );
+
+public:
+  virtual ~gzfilestream_common();
+
+  void attach( int fd, int io_mode );
+  void open( const char *name, int io_mode );
+  void close();
+
+protected:
+  gzfilestream_common();
+
+private:
+  gzfilebuf *rdbuf();
+
+  gzfilebuf buffer;
+
+};
+
+class gzifstream : public gzfilestream_common, public istream {
+
+public:
+
+  gzifstream();
+  gzifstream( const char *name, int io_mode = ios::in );
+  gzifstream( int fd, int io_mode = ios::in );
+
+  virtual ~gzifstream();
+
+};
+
+class gzofstream : public gzfilestream_common, public ostream {
+
+public:
+
+  gzofstream();
+  gzofstream( const char *name, int io_mode = ios::out );
+  gzofstream( int fd, int io_mode = ios::out );
+
+  virtual ~gzofstream();
+
+};
+
+template<class T> class gzomanip {
+  friend gzofstream &operator<<(gzofstream &, const gzomanip<T> &);
+public:
+  gzomanip(gzofstream &(*f)(gzofstream &, T), T v) : func(f), val(v) { }
+private:
+  gzofstream &(*func)(gzofstream &, T);
+  T val;
+};
+
+template<class T> gzofstream &operator<<(gzofstream &s, const gzomanip<T> &m)
+{
+  return (*m.func)(s, m.val);
+}
+
+inline gzofstream &setcompressionlevel( gzofstream &s, int l )
+{
+  (s.rdbuf())->setcompressionlevel(l);
+  return s;
+}
+
+inline gzofstream &setcompressionstrategy( gzofstream &s, int l )
+{
+  (s.rdbuf())->setcompressionstrategy(l);
+  return s;
+}
+
+inline gzomanip<int> setcompressionlevel(int l)
+{
+  return gzomanip<int>(&setcompressionlevel,l);
+}
+
+inline gzomanip<int> setcompressionstrategy(int l)
+{
+  return gzomanip<int>(&setcompressionstrategy,l);
+}
+
+#endif
diff --git a/updater/zlib123/contrib/iostream2/zstream.h b/updater/zlib123/contrib/iostream2/zstream.h
new file mode 100644
index 0000000..522371c
--- /dev/null
+++ b/updater/zlib123/contrib/iostream2/zstream.h
@@ -0,0 +1,307 @@
+/*
+ *
+ * Copyright (c) 1997
+ * Christian Michelsen Research AS
+ * Advanced Computing
+ * Fantoftvegen 38, 5036 BERGEN, Norway
+ * http://www.cmr.no
+ *
+ * Permission to use, copy, modify, distribute and sell this software
+ * and its documentation for any purpose is hereby granted without fee,
+ * provided that the above copyright notice appear in all copies and
+ * that both that copyright notice and this permission notice appear
+ * in supporting documentation.  Christian Michelsen Research AS makes no
+ * representations about the suitability of this software for any
+ * purpose.  It is provided "as is" without express or implied warranty.
+ *
+ */
+
+#ifndef ZSTREAM__H
+#define ZSTREAM__H
+
+/*
+ * zstream.h - C++ interface to the 'zlib' general purpose compression library
+ * $Id: zstream.h 1.1 1997-06-25 12:00:56+02 tyge Exp tyge $
+ */
+
+#include <strstream.h>
+#include <string.h>
+#include <stdio.h>
+#include "zlib.h"
+
+#if defined(_WIN32)
+#   include <fcntl.h>
+#   include <io.h>
+#   define SET_BINARY_MODE(file) setmode(fileno(file), O_BINARY)
+#else
+#   define SET_BINARY_MODE(file)
+#endif
+
+class zstringlen {
+public:
+    zstringlen(class izstream&);
+    zstringlen(class ozstream&, const char*);
+    size_t value() const { return val.word; }
+private:
+    struct Val { unsigned char byte; size_t word; } val;
+};
+
+//  ----------------------------- izstream -----------------------------
+
+class izstream
+{
+    public:
+        izstream() : m_fp(0) {}
+        izstream(FILE* fp) : m_fp(0) { open(fp); }
+        izstream(const char* name) : m_fp(0) { open(name); }
+        ~izstream() { close(); }
+
+        /* Opens a gzip (.gz) file for reading.
+         * open() can be used to read a file which is not in gzip format;
+         * in this case read() will directly read from the file without
+         * decompression. errno can be checked to distinguish two error
+         * cases (if errno is zero, the zlib error is Z_MEM_ERROR).
+         */
+        void open(const char* name) {
+            if (m_fp) close();
+            m_fp = ::gzopen(name, "rb");
+        }
+
+        void open(FILE* fp) {
+            SET_BINARY_MODE(fp);
+            if (m_fp) close();
+            m_fp = ::gzdopen(fileno(fp), "rb");
+        }
+
+        /* Flushes all pending input if necessary, closes the compressed file
+         * and deallocates all the (de)compression state. The return value is
+         * the zlib error number (see function error() below).
+         */
+        int close() {
+            int r = ::gzclose(m_fp);
+            m_fp = 0; return r;
+        }
+
+        /* Binary read the given number of bytes from the compressed file.
+         */
+        int read(void* buf, size_t len) {
+            return ::gzread(m_fp, buf, len);
+        }
+
+        /* Returns the error message for the last error which occurred on the
+         * given compressed file. errnum is set to zlib error number. If an
+         * error occurred in the file system and not in the compression library,
+         * errnum is set to Z_ERRNO and the application may consult errno
+         * to get the exact error code.
+         */
+        const char* error(int* errnum) {
+            return ::gzerror(m_fp, errnum);
+        }
+
+        gzFile fp() { return m_fp; }
+
+    private:
+        gzFile m_fp;
+};
+
+/*
+ * Binary read the given (array of) object(s) from the compressed file.
+ * If the input file was not in gzip format, read() copies the objects number
+ * of bytes into the buffer.
+ * returns the number of uncompressed bytes actually read
+ * (0 for end of file, -1 for error).
+ */
+template <class T, class Items>
+inline int read(izstream& zs, T* x, Items items) {
+    return ::gzread(zs.fp(), x, items*sizeof(T));
+}
+
+/*
+ * Binary input with the '>' operator.
+ */
+template <class T>
+inline izstream& operator>(izstream& zs, T& x) {
+    ::gzread(zs.fp(), &x, sizeof(T));
+    return zs;
+}
+
+
+inline zstringlen::zstringlen(izstream& zs) {
+    zs > val.byte;
+    if (val.byte == 255) zs > val.word;
+    else val.word = val.byte;
+}
+
+/*
+ * Read length of string + the string with the '>' operator.
+ */
+inline izstream& operator>(izstream& zs, char* x) {
+    zstringlen len(zs);
+    ::gzread(zs.fp(), x, len.value());
+    x[len.value()] = '\0';
+    return zs;
+}
+
+inline char* read_string(izstream& zs) {
+    zstringlen len(zs);
+    char* x = new char[len.value()+1];
+    ::gzread(zs.fp(), x, len.value());
+    x[len.value()] = '\0';
+    return x;
+}
+
+// ----------------------------- ozstream -----------------------------
+
+class ozstream
+{
+    public:
+        ozstream() : m_fp(0), m_os(0) {
+        }
+        ozstream(FILE* fp, int level = Z_DEFAULT_COMPRESSION)
+            : m_fp(0), m_os(0) {
+            open(fp, level);
+        }
+        ozstream(const char* name, int level = Z_DEFAULT_COMPRESSION)
+            : m_fp(0), m_os(0) {
+            open(name, level);
+        }
+        ~ozstream() {
+            close();
+        }
+
+        /* Opens a gzip (.gz) file for writing.
+         * The compression level parameter should be in 0..9
+         * errno can be checked to distinguish two error cases
+         * (if errno is zero, the zlib error is Z_MEM_ERROR).
+         */
+        void open(const char* name, int level = Z_DEFAULT_COMPRESSION) {
+            char mode[4] = "wb\0";
+            if (level != Z_DEFAULT_COMPRESSION) mode[2] = '0'+level;
+            if (m_fp) close();
+            m_fp = ::gzopen(name, mode);
+        }
+
+        /* open from a FILE pointer.
+         */
+        void open(FILE* fp, int level = Z_DEFAULT_COMPRESSION) {
+            SET_BINARY_MODE(fp);
+            char mode[4] = "wb\0";
+            if (level != Z_DEFAULT_COMPRESSION) mode[2] = '0'+level;
+            if (m_fp) close();
+            m_fp = ::gzdopen(fileno(fp), mode);
+        }
+
+        /* Flushes all pending output if necessary, closes the compressed file
+         * and deallocates all the (de)compression state. The return value is
+         * the zlib error number (see function error() below).
+         */
+        int close() {
+            if (m_os) {
+                ::gzwrite(m_fp, m_os->str(), m_os->pcount());
+                delete[] m_os->str(); delete m_os; m_os = 0;
+            }
+            int r = ::gzclose(m_fp); m_fp = 0; return r;
+        }
+
+        /* Binary write the given number of bytes into the compressed file.
+         */
+        int write(const void* buf, size_t len) {
+            return ::gzwrite(m_fp, (voidp) buf, len);
+        }
+
+        /* Flushes all pending output into the compressed file. The parameter
+         * _flush is as in the deflate() function. The return value is the zlib
+         * error number (see function gzerror below). flush() returns Z_OK if
+         * the flush_ parameter is Z_FINISH and all output could be flushed.
+         * flush() should be called only when strictly necessary because it can
+         * degrade compression.
+         */
+        int flush(int _flush) {
+            os_flush();
+            return ::gzflush(m_fp, _flush);
+        }
+
+        /* Returns the error message for the last error which occurred on the
+         * given compressed file. errnum is set to zlib error number. If an
+         * error occurred in the file system and not in the compression library,
+         * errnum is set to Z_ERRNO and the application may consult errno
+         * to get the exact error code.
+         */
+        const char* error(int* errnum) {
+            return ::gzerror(m_fp, errnum);
+        }
+
+        gzFile fp() { return m_fp; }
+
+        ostream& os() {
+            if (m_os == 0) m_os = new ostrstream;
+            return *m_os;
+        }
+
+        void os_flush() {
+            if (m_os && m_os->pcount()>0) {
+                ostrstream* oss = new ostrstream;
+                oss->fill(m_os->fill());
+                oss->flags(m_os->flags());
+                oss->precision(m_os->precision());
+                oss->width(m_os->width());
+                ::gzwrite(m_fp, m_os->str(), m_os->pcount());
+                delete[] m_os->str(); delete m_os; m_os = oss;
+            }
+        }
+
+    private:
+        gzFile m_fp;
+        ostrstream* m_os;
+};
+
+/*
+ * Binary write the given (array of) object(s) into the compressed file.
+ * returns the number of uncompressed bytes actually written
+ * (0 in case of error).
+ */
+template <class T, class Items>
+inline int write(ozstream& zs, const T* x, Items items) {
+    return ::gzwrite(zs.fp(), (voidp) x, items*sizeof(T));
+}
+
+/*
+ * Binary output with the '<' operator.
+ */
+template <class T>
+inline ozstream& operator<(ozstream& zs, const T& x) {
+    ::gzwrite(zs.fp(), (voidp) &x, sizeof(T));
+    return zs;
+}
+
+inline zstringlen::zstringlen(ozstream& zs, const char* x) {
+    val.byte = 255;  val.word = ::strlen(x);
+    if (val.word < 255) zs < (val.byte = val.word);
+    else zs < val;
+}
+
+/*
+ * Write length of string + the string with the '<' operator.
+ */
+inline ozstream& operator<(ozstream& zs, const char* x) {
+    zstringlen len(zs, x);
+    ::gzwrite(zs.fp(), (voidp) x, len.value());
+    return zs;
+}
+
+#ifdef _MSC_VER
+inline ozstream& operator<(ozstream& zs, char* const& x) {
+    return zs < (const char*) x;
+}
+#endif
+
+/*
+ * Ascii write with the << operator;
+ */
+template <class T>
+inline ostream& operator<<(ozstream& zs, const T& x) {
+    zs.os_flush();
+    return zs.os() << x;
+}
+
+#endif
diff --git a/updater/zlib123/contrib/iostream2/zstream_test.cpp b/updater/zlib123/contrib/iostream2/zstream_test.cpp
new file mode 100644
index 0000000..8f4d970
--- /dev/null
+++ b/updater/zlib123/contrib/iostream2/zstream_test.cpp
@@ -0,0 +1,25 @@
+#include "zstream.h"
+#include <math.h>
+#include <stdlib.h>
+#include <iomanip.h>
+
+void main() {
+    char h[256] = "Hello";
+    char* g = "Goodbye";
+    ozstream out("temp.gz");
+    out < "This works well" < h < g;
+    out.close();
+
+    izstream in("temp.gz"); // read it back
+    char *x = read_string(in), *y = new char[256], z[256];
+    in > y > z;
+    in.close();
+    cout << x << endl << y << endl << z << endl;
+
+    out.open("temp.gz"); // try ascii output; zcat temp.gz to see the results
+    out << setw(50) << setfill('#') << setprecision(20) << x << endl << y << endl << z << endl;
+    out << z << endl << y << endl << x << endl;
+    out << 1.1234567890123456789 << endl;
+
+    delete[] x; delete[] y;
+}
diff --git a/updater/zlib123/contrib/iostream3/README b/updater/zlib123/contrib/iostream3/README
new file mode 100644
index 0000000..1d18c96
--- /dev/null
+++ b/updater/zlib123/contrib/iostream3/README
@@ -0,0 +1,35 @@
+These classes provide a C++ stream interface to the zlib library. It allows you
+to do things like:
+
+  gzofstream outf("blah.gz");
+  outf << "These go into the gzip file " << 123 << endl;
+
+It does this by deriving a specialized stream buffer for gzipped files, which is
+the way Stroustrup would have done it. :->
+
+The gzifstream and gzofstream classes were originally written by Kevin Ruland
+and made available in the zlib contrib/iostream directory. The older version still
+compiles under gcc 2.xx, but not under gcc 3.xx, which sparked the development of
+this version.
+
+The new classes are as standard-compliant as possible, closely following the
+approach of the standard library's fstream classes. It compiles under gcc versions
+3.2 and 3.3, but not under gcc 2.xx. This is mainly due to changes in the standard
+library naming scheme. The new version of gzifstream/gzofstream/gzfilebuf differs
+from the previous one in the following respects:
+- added showmanyc
+- added setbuf, with support for unbuffered output via setbuf(0,0)
+- a few bug fixes of stream behavior
+- gzipped output file opened with default compression level instead of maximum level
+- setcompressionlevel()/strategy() members replaced by single setcompression()
+
+The code is provided "as is", with the permission to use, copy, modify, distribute
+and sell it for any purpose without fee.
+
+Ludwig Schwardt
+<schwardt@sun.ac.za>
+
+DSP Lab
+Electrical & Electronic Engineering Department
+University of Stellenbosch
+South Africa
diff --git a/updater/zlib123/contrib/iostream3/TODO b/updater/zlib123/contrib/iostream3/TODO
new file mode 100644
index 0000000..f2eb1a2
--- /dev/null
+++ b/updater/zlib123/contrib/iostream3/TODO
@@ -0,0 +1,17 @@
+Possible upgrades to gzfilebuf:
+
+- The ability to do putback (e.g. putbackfail)
+
+- The ability to seek (zlib supports this, but could be slow/tricky)
+
+- Simultaneous read/write access (does it make sense?)
+
+- Support for ios_base::ate open mode
+
+- Locale support?
+
+- Check public interface to see which calls give problems
+  (due to dependence on library internals)
+
+- Override operator<<(ostream&, gzfilebuf*) to allow direct copying
+  of stream buffer to stream ( i.e. os << is.rdbuf(); )
diff --git a/updater/zlib123/contrib/iostream3/test.cc b/updater/zlib123/contrib/iostream3/test.cc
new file mode 100644
index 0000000..a9acc21
--- /dev/null
+++ b/updater/zlib123/contrib/iostream3/test.cc
@@ -0,0 +1,50 @@
+/*
+ * Test program for gzifstream and gzofstream
+ *
+ * by Ludwig Schwardt <schwardt@sun.ac.za>
+ * original version by Kevin Ruland <kevin@rodin.wustl.edu>
+ */
+
+#include "zfstream.h"
+#include <iostream>      // for cout
+
+int main() {
+
+  gzofstream outf;
+  gzifstream inf;
+  char buf[80];
+
+  outf.open("test1.txt.gz");
+  outf << "The quick brown fox sidestepped the lazy canine\n"
+       << 1.3 << "\nPlan " << 9 << std::endl;
+  outf.close();
+  std::cout << "Wrote the following message to 'test1.txt.gz' (check with zcat or zless):\n"
+            << "The quick brown fox sidestepped the lazy canine\n"
+            << 1.3 << "\nPlan " << 9 << std::endl;
+
+  std::cout << "\nReading 'test1.txt.gz' (buffered) produces:\n";
+  inf.open("test1.txt.gz");
+  while (inf.getline(buf,80,'\n')) {
+    std::cout << buf << "\t(" << inf.rdbuf()->in_avail() << " chars left in buffer)\n";
+  }
+  inf.close();
+
+  outf.rdbuf()->pubsetbuf(0,0);
+  outf.open("test2.txt.gz");
+  outf << setcompression(Z_NO_COMPRESSION)
+       << "The quick brown fox sidestepped the lazy canine\n"
+       << 1.3 << "\nPlan " << 9 << std::endl;
+  outf.close();
+  std::cout << "\nWrote the same message to 'test2.txt.gz' in uncompressed form";
+
+  std::cout << "\nReading 'test2.txt.gz' (unbuffered) produces:\n";
+  inf.rdbuf()->pubsetbuf(0,0);
+  inf.open("test2.txt.gz");
+  while (inf.getline(buf,80,'\n')) {
+    std::cout << buf << "\t(" << inf.rdbuf()->in_avail() << " chars left in buffer)\n";
+  }
+  inf.close();
+
+  return 0;
+
+}
diff --git a/updater/zlib123/contrib/iostream3/zfstream.cc b/updater/zlib123/contrib/iostream3/zfstream.cc
new file mode 100644
index 0000000..62ed8ec
--- /dev/null
+++ b/updater/zlib123/contrib/iostream3/zfstream.cc
@@ -0,0 +1,479 @@
+/*
+ * A C++ I/O streams interface to the zlib gz* functions
+ *
+ * by Ludwig Schwardt <schwardt@sun.ac.za>
+ * original version by Kevin Ruland <kevin@rodin.wustl.edu>
+ *
+ * This version is standard-compliant and compatible with gcc 3.x.
+ */
+
+#include "zfstream.h"
+#include <cstring>          // for strcpy, strcat, strlen (mode strings)
+#include <cstdio>           // for BUFSIZ
+
+// Internal buffer sizes (default and "unbuffered" versions)
+#define BIGBUFSIZE BUFSIZ
+#define SMALLBUFSIZE 1
+
+/*****************************************************************************/
+
+// Default constructor
+gzfilebuf::gzfilebuf()
+: file(NULL), io_mode(std::ios_base::openmode(0)), own_fd(false),
+  buffer(NULL), buffer_size(BIGBUFSIZE), own_buffer(true)
+{
+  // No buffers to start with
+  this->disable_buffer();
+}
+
+// Destructor
+gzfilebuf::~gzfilebuf()
+{
+  // Sync output buffer and close only if responsible for file
+  // (i.e. attached streams should be left open at this stage)
+  this->sync();
+  if (own_fd)
+    this->close();
+  // Make sure internal buffer is deallocated
+  this->disable_buffer();
+}
+
+// Set compression level and strategy
+int
+gzfilebuf::setcompression(int comp_level,
+                          int comp_strategy)
+{
+  return gzsetparams(file, comp_level, comp_strategy);
+}
+
+// Open gzipped file
+gzfilebuf*
+gzfilebuf::open(const char *name,
+                std::ios_base::openmode mode)
+{
+  // Fail if file already open
+  if (this->is_open())
+    return NULL;
+  // Don't support simultaneous read/write access (yet)
+  if ((mode & std::ios_base::in) && (mode & std::ios_base::out))
+    return NULL;
+
+  // Build mode string for gzopen and check it [27.8.1.3.2]
+  char char_mode[6] = "\0\0\0\0\0";
+  if (!this->open_mode(mode, char_mode))
+    return NULL;
+
+  // Attempt to open file
+  if ((file = gzopen(name, char_mode)) == NULL)
+    return NULL;
+
+  // On success, allocate internal buffer and set flags
+  this->enable_buffer();
+  io_mode = mode;
+  own_fd = true;
+  return this;
+}
+
+// Attach to gzipped file
+gzfilebuf*
+gzfilebuf::attach(int fd,
+                  std::ios_base::openmode mode)
+{
+  // Fail if file already open
+  if (this->is_open())
+    return NULL;
+  // Don't support simultaneous read/write access (yet)
+  if ((mode & std::ios_base::in) && (mode & std::ios_base::out))
+    return NULL;
+
+  // Build mode string for gzdopen and check it [27.8.1.3.2]
+  char char_mode[6] = "\0\0\0\0\0";
+  if (!this->open_mode(mode, char_mode))
+    return NULL;
+
+  // Attempt to attach to file
+  if ((file = gzdopen(fd, char_mode)) == NULL)
+    return NULL;
+
+  // On success, allocate internal buffer and set flags
+  this->enable_buffer();
+  io_mode = mode;
+  own_fd = false;
+  return this;
+}
+
+// Close gzipped file
+gzfilebuf*
+gzfilebuf::close()
+{
+  // Fail immediately if no file is open
+  if (!this->is_open())
+    return NULL;
+  // Assume success
+  gzfilebuf* retval = this;
+  // Attempt to sync and close gzipped file
+  if (this->sync() == -1)
+    retval = NULL;
+  if (gzclose(file) < 0)
+    retval = NULL;
+  // File is now gone anyway (postcondition [27.8.1.3.8])
+  file = NULL;
+  own_fd = false;
+  // Destroy internal buffer if it exists
+  this->disable_buffer();
+  return retval;
+}
+
+/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
+
+// Convert int open mode to mode string
+bool
+gzfilebuf::open_mode(std::ios_base::openmode mode,
+                     char* c_mode) const
+{
+  bool testb = mode & std::ios_base::binary;
+  bool testi = mode & std::ios_base::in;
+  bool testo = mode & std::ios_base::out;
+  bool testt = mode & std::ios_base::trunc;
+  bool testa = mode & std::ios_base::app;
+
+  // Check for valid flag combinations - see [27.8.1.3.2] (Table 92)
+  // Original zfstream hardcoded the compression level to maximum here...
+  // Double the time for less than 1% size improvement seems
+  // excessive though - keeping it at the default level
+  // To change back, just append "9" to the next three mode strings
+  if (!testi && testo && !testt && !testa)
+    strcpy(c_mode, "w");
+  if (!testi && testo && !testt && testa)
+    strcpy(c_mode, "a");
+  if (!testi && testo && testt && !testa)
+    strcpy(c_mode, "w");
+  if (testi && !testo && !testt && !testa)
+    strcpy(c_mode, "r");
+  // No read/write mode yet
+//  if (testi && testo && !testt && !testa)
+//    strcpy(c_mode, "r+");
+//  if (testi && testo && testt && !testa)
+//    strcpy(c_mode, "w+");
+
+  // Mode string should be empty for invalid combination of flags
+  if (strlen(c_mode) == 0)
+    return false;
+  if (testb)
+    strcat(c_mode, "b");
+  return true;
+}
+
+// Determine number of characters in internal get buffer
+std::streamsize
+gzfilebuf::showmanyc()
+{
+  // Calls to underflow will fail if file not opened for reading
+  if (!this->is_open() || !(io_mode & std::ios_base::in))
+    return -1;
+  // Make sure get area is in use
+  if (this->gptr() && (this->gptr() < this->egptr()))
+    return std::streamsize(this->egptr() - this->gptr());
+  else
+    return 0;
+}
+
+// Fill get area from gzipped file
+gzfilebuf::int_type
+gzfilebuf::underflow()
+{
+  // If something is left in the get area by chance, return it
+  // (this shouldn't normally happen, as underflow is only supposed
+  // to be called when gptr >= egptr, but it serves as error check)
+  if (this->gptr() && (this->gptr() < this->egptr()))
+    return traits_type::to_int_type(*(this->gptr()));
+
+  // If the file hasn't been opened for reading, produce error
+  if (!this->is_open() || !(io_mode & std::ios_base::in))
+    return traits_type::eof();
+
+  // Attempt to fill internal buffer from gzipped file
+  // (buffer must be guaranteed to exist...)
+  int bytes_read = gzread(file, buffer, buffer_size);
+  // Indicates error or EOF
+  if (bytes_read <= 0)
+  {
+    // Reset get area
+    this->setg(buffer, buffer, buffer);
+    return traits_type::eof();
+  }
+  // Make all bytes read from file available as get area
+  this->setg(buffer, buffer, buffer + bytes_read);
+
+  // Return next character in get area
+  return traits_type::to_int_type(*(this->gptr()));
+}
+
+// Write put area to gzipped file
+gzfilebuf::int_type
+gzfilebuf::overflow(int_type c)
+{
+  // Determine whether put area is in use
+  if (this->pbase())
+  {
+    // Double-check pointer range
+    if (this->pptr() > this->epptr() || this->pptr() < this->pbase())
+      return traits_type::eof();
+    // Add extra character to buffer if not EOF
+    if (!traits_type::eq_int_type(c, traits_type::eof()))
+    {
+      *(this->pptr()) = traits_type::to_char_type(c);
+      this->pbump(1);
+    }
+    // Number of characters to write to file
+    int bytes_to_write = this->pptr() - this->pbase();
+    // Overflow doesn't fail if nothing is to be written
+    if (bytes_to_write > 0)
+    {
+      // If the file hasn't been opened for writing, produce error
+      if (!this->is_open() || !(io_mode & std::ios_base::out))
+        return traits_type::eof();
+      // If gzipped file won't accept all bytes written to it, fail
+      if (gzwrite(file, this->pbase(), bytes_to_write) != bytes_to_write)
+        return traits_type::eof();
+      // Reset next pointer to point to pbase on success
+      this->pbump(-bytes_to_write);
+    }
+  }
+  // Write extra character to file if not EOF
+  else if (!traits_type::eq_int_type(c, traits_type::eof()))
+  {
+    // If the file hasn't been opened for writing, produce error
+    if (!this->is_open() || !(io_mode & std::ios_base::out))
+      return traits_type::eof();
+    // Impromptu char buffer (allows "unbuffered" output)
+    char_type last_char = traits_type::to_char_type(c);
+    // If gzipped file won't accept this character, fail
+    if (gzwrite(file, &last_char, 1) != 1)
+      return traits_type::eof();
+  }
+
+  // If you got here, you have succeeded (even if c was EOF)
+  // The return value should therefore be non-EOF
+  if (traits_type::eq_int_type(c, traits_type::eof()))
+    return traits_type::not_eof(c);
+  else
+    return c;
+}
+
+// Assign new buffer
+std::streambuf*
+gzfilebuf::setbuf(char_type* p,
+                  std::streamsize n)
+{
+  // First make sure stuff is sync'ed, for safety
+  if (this->sync() == -1)
+    return NULL;
+  // If buffering is turned off on purpose via setbuf(0,0), still allocate one...
+  // "Unbuffered" only really refers to put [27.8.1.4.10], while get needs at
+  // least a buffer of size 1 (very inefficient though, therefore make it bigger?)
+  // This follows from [27.5.2.4.3]/12 (gptr needs to point at something, it seems)
+  if (!p || !n)
+  {
+    // Replace existing buffer (if any) with small internal buffer
+    this->disable_buffer();
+    buffer = NULL;
+    buffer_size = 0;
+    own_buffer = true;
+    this->enable_buffer();
+  }
+  else
+  {
+    // Replace existing buffer (if any) with external buffer
+    this->disable_buffer();
+    buffer = p;
+    buffer_size = n;
+    own_buffer = false;
+    this->enable_buffer();
+  }
+  return this;
+}
+
+// Write put area to gzipped file (i.e. ensures that put area is empty)
+int
+gzfilebuf::sync()
+{
+  return traits_type::eq_int_type(this->overflow(), traits_type::eof()) ? -1 : 0;
+}
+
+/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
+
+// Allocate internal buffer
+void
+gzfilebuf::enable_buffer()
+{
+  // If internal buffer required, allocate one
+  if (own_buffer && !buffer)
+  {
+    // Check for buffered vs. "unbuffered"
+    if (buffer_size > 0)
+    {
+      // Allocate internal buffer
+      buffer = new char_type[buffer_size];
+      // Get area starts empty and will be expanded by underflow as need arises
+      this->setg(buffer, buffer, buffer);
+      // Setup entire internal buffer as put area.
+      // The one-past-end pointer actually points to the last element of the buffer,
+      // so that overflow(c) can safely add the extra character c to the sequence.
+      // These pointers remain in place for the duration of the buffer
+      this->setp(buffer, buffer + buffer_size - 1);
+    }
+    else
+    {
+      // Even in "unbuffered" case, (small?) get buffer is still required
+      buffer_size = SMALLBUFSIZE;
+      buffer = new char_type[buffer_size];
+      this->setg(buffer, buffer, buffer);
+      // "Unbuffered" means no put buffer
+      this->setp(0, 0);
+    }
+  }
+  else
+  {
+    // If buffer already allocated, reset buffer pointers just to make sure no
+    // stale chars are lying around
+    this->setg(buffer, buffer, buffer);
+    this->setp(buffer, buffer + buffer_size - 1);
+  }
+}
+
+// Destroy internal buffer
+void
+gzfilebuf::disable_buffer()
+{
+  // If internal buffer exists, deallocate it
+  if (own_buffer && buffer)
+  {
+    // Preserve unbuffered status by zeroing size
+    if (!this->pbase())
+      buffer_size = 0;
+    delete[] buffer;
+    buffer = NULL;
+    this->setg(0, 0, 0);
+    this->setp(0, 0);
+  }
+  else
+  {
+    // Reset buffer pointers to initial state if external buffer exists
+    this->setg(buffer, buffer, buffer);
+    if (buffer)
+      this->setp(buffer, buffer + buffer_size - 1);
+    else
+      this->setp(0, 0);
+  }
+}
+
+/*****************************************************************************/
+
+// Default constructor initializes stream buffer
+gzifstream::gzifstream()
+: std::istream(NULL), sb()
+{ this->init(&sb); }
+
+// Initialize stream buffer and open file
+gzifstream::gzifstream(const char* name,
+                       std::ios_base::openmode mode)
+: std::istream(NULL), sb()
+{
+  this->init(&sb);
+  this->open(name, mode);
+}
+
+// Initialize stream buffer and attach to file
+gzifstream::gzifstream(int fd,
+                       std::ios_base::openmode mode)
+: std::istream(NULL), sb()
+{
+  this->init(&sb);
+  this->attach(fd, mode);
+}
+
+// Open file and go into fail() state if unsuccessful
+void
+gzifstream::open(const char* name,
+                 std::ios_base::openmode mode)
+{
+  if (!sb.open(name, mode | std::ios_base::in))
+    this->setstate(std::ios_base::failbit);
+  else
+    this->clear();
+}
+
+// Attach to file and go into fail() state if unsuccessful
+void
+gzifstream::attach(int fd,
+                   std::ios_base::openmode mode)
+{
+  if (!sb.attach(fd, mode | std::ios_base::in))
+    this->setstate(std::ios_base::failbit);
+  else
+    this->clear();
+}
+
+// Close file
+void
+gzifstream::close()
+{
+  if (!sb.close())
+    this->setstate(std::ios_base::failbit);
+}
+
+/*****************************************************************************/
+
+// Default constructor initializes stream buffer
+gzofstream::gzofstream()
+: std::ostream(NULL), sb()
+{ this->init(&sb); }
+
+// Initialize stream buffer and open file
+gzofstream::gzofstream(const char* name,
+                       std::ios_base::openmode mode)
+: std::ostream(NULL), sb()
+{
+  this->init(&sb);
+  this->open(name, mode);
+}
+
+// Initialize stream buffer and attach to file
+gzofstream::gzofstream(int fd,
+                       std::ios_base::openmode mode)
+: std::ostream(NULL), sb()
+{
+  this->init(&sb);
+  this->attach(fd, mode);
+}
+
+// Open file and go into fail() state if unsuccessful
+void
+gzofstream::open(const char* name,
+                 std::ios_base::openmode mode)
+{
+  if (!sb.open(name, mode | std::ios_base::out))
+    this->setstate(std::ios_base::failbit);
+  else
+    this->clear();
+}
+
+// Attach to file and go into fail() state if unsuccessful
+void
+gzofstream::attach(int fd,
+                   std::ios_base::openmode mode)
+{
+  if (!sb.attach(fd, mode | std::ios_base::out))
+    this->setstate(std::ios_base::failbit);
+  else
+    this->clear();
+}
+
+// Close file
+void
+gzofstream::close()
+{
+  if (!sb.close())
+    this->setstate(std::ios_base::failbit);
+}
diff --git a/updater/zlib123/contrib/iostream3/zfstream.h b/updater/zlib123/contrib/iostream3/zfstream.h
new file mode 100644
index 0000000..9db884a
--- /dev/null
+++ b/updater/zlib123/contrib/iostream3/zfstream.h
@@ -0,0 +1,466 @@
+/*
+ * A C++ I/O streams interface to the zlib gz* functions
+ *
+ * by Ludwig Schwardt <schwardt@sun.ac.za>
+ * original version by Kevin Ruland <kevin@rodin.wustl.edu>
+ *
+ * This version is standard-compliant and compatible with gcc 3.x.
+ */
+
+#ifndef ZFSTREAM_H
+#define ZFSTREAM_H
+
+#include <istream>  // not iostream, since we don't need cin/cout
+#include <ostream>
+#include "zlib.h"
+
+/*****************************************************************************/
+
+/**
+ *  @brief  Gzipped file stream buffer class.
+ *
+ *  This class implements basic_filebuf for gzipped files. It doesn't yet support
+ *  seeking (allowed by zlib but slow/limited), putback and read/write access
+ *  (tricky). Otherwise, it attempts to be a drop-in replacement for the standard
+ *  file streambuf.
+*/
+class gzfilebuf : public std::streambuf
+{
+public:
+  //  Default constructor.
+  gzfilebuf();
+
+  //  Destructor.
+  virtual
+  ~gzfilebuf();
+
+  /**
+   *  @brief  Set compression level and strategy on the fly.
+   *  @param  comp_level  Compression level (see zlib.h for allowed values)
+   *  @param  comp_strategy  Compression strategy (see zlib.h for allowed values)
+   *  @return  Z_OK on success, Z_STREAM_ERROR otherwise.
+   *
+   *  Unfortunately, these parameters cannot be modified separately, as the
+   *  previous zfstream version assumed. Since the strategy is seldom changed,
+   *  it can default and setcompression(level) then becomes like the old
+   *  setcompressionlevel(level).
+  */
+  int
+  setcompression(int comp_level,
+                 int comp_strategy = Z_DEFAULT_STRATEGY);
+
+  /**
+   *  @brief  Check if file is open.
+   *  @return  True if file is open.
+  */
+  bool
+  is_open() const { return (file != NULL); }
+
+  /**
+   *  @brief  Open gzipped file.
+   *  @param  name  File name.
+   *  @param  mode  Open mode flags.
+   *  @return  @c this on success, NULL on failure.
+  */
+  gzfilebuf*
+  open(const char* name,
+       std::ios_base::openmode mode);
+
+  /**
+   *  @brief  Attach to already open gzipped file.
+   *  @param  fd  File descriptor.
+   *  @param  mode  Open mode flags.
+   *  @return  @c this on success, NULL on failure.
+  */
+  gzfilebuf*
+  attach(int fd,
+         std::ios_base::openmode mode);
+
+  /**
+   *  @brief  Close gzipped file.
+   *  @return  @c this on success, NULL on failure.
+  */
+  gzfilebuf*
+  close();
+
+protected:
+  /**
+   *  @brief  Convert ios open mode int to mode string used by zlib.
+   *  @return  True if valid mode flag combination.
+  */
+  bool
+  open_mode(std::ios_base::openmode mode,
+            char* c_mode) const;
+
+  /**
+   *  @brief  Number of characters available in stream buffer.
+   *  @return  Number of characters.
+   *
+   *  This indicates number of characters in get area of stream buffer.
+   *  These characters can be read without accessing the gzipped file.
+  */
+  virtual std::streamsize
+  showmanyc();
+
+  /**
+   *  @brief  Fill get area from gzipped file.
+   *  @return  First character in get area on success, EOF on error.
+   *
+   *  This actually reads characters from gzipped file to stream
+   *  buffer. Always buffered.
+  */
+  virtual int_type
+  underflow();
+
+  /**
+   *  @brief  Write put area to gzipped file.
+   *  @param  c  Extra character to add to buffer contents.
+   *  @return  Non-EOF on success, EOF on error.
+   *
+   *  This actually writes characters in stream buffer to
+   *  gzipped file. With unbuffered output this is done one
+   *  character at a time.
+  */
+  virtual int_type
+  overflow(int_type c = traits_type::eof());
+
+  /**
+   *  @brief  Installs external stream buffer.
+   *  @param  p  Pointer to char buffer.
+   *  @param  n  Size of external buffer.
+   *  @return  @c this on success, NULL on failure.
+   *
+   *  Call setbuf(0,0) to enable unbuffered output.
+  */
+  virtual std::streambuf*
+  setbuf(char_type* p,
+         std::streamsize n);
+
+  /**
+   *  @brief  Flush stream buffer to file.
+   *  @return  0 on success, -1 on error.
+   *
+   *  This calls underflow(EOF) to do the job.
+  */
+  virtual int
+  sync();
+
+//
+// Some future enhancements
+//
+//  virtual int_type uflow();
+//  virtual int_type pbackfail(int_type c = traits_type::eof());
+//  virtual pos_type
+//  seekoff(off_type off,
+//          std::ios_base::seekdir way,
+//          std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
+//  virtual pos_type
+//  seekpos(pos_type sp,
+//          std::ios_base::openmode mode = std::ios_base::in|std::ios_base::out);
+
+private:
+  /**
+   *  @brief  Allocate internal buffer.
+   *
+   *  This function is safe to call multiple times. It will ensure
+   *  that a proper internal buffer exists if it is required. If the
+   *  buffer already exists or is external, the buffer pointers will be
+   *  reset to their original state.
+  */
+  void
+  enable_buffer();
+
+  /**
+   *  @brief  Destroy internal buffer.
+   *
+   *  This function is safe to call multiple times. It will ensure
+   *  that the internal buffer is deallocated if it exists. In any
+   *  case, it will also reset the buffer pointers.
+  */
+  void
+  disable_buffer();
+
+  /**
+   *  Underlying file pointer.
+  */
+  gzFile file;
+
+  /**
+   *  Mode in which file was opened.
+  */
+  std::ios_base::openmode io_mode;
+
+  /**
+   *  @brief  True if this object owns file descriptor.
+   *
+   *  This makes the class responsible for closing the file
+   *  upon destruction.
+  */
+  bool own_fd;
+
+  /**
+   *  @brief  Stream buffer.
+   *
+   *  For simplicity this remains allocated on the free store for the
+   *  entire life span of the gzfilebuf object, unless replaced by setbuf.
+  */
+  char_type* buffer;
+
+  /**
+   *  @brief  Stream buffer size.
+   *
+   *  Defaults to system default buffer size (typically 8192 bytes).
+   *  Modified by setbuf.
+  */
+  std::streamsize buffer_size;
+
+  /**
+   *  @brief  True if this object owns stream buffer.
+   *
+   *  This makes the class responsible for deleting the buffer
+   *  upon destruction.
+  */
+  bool own_buffer;
+};
+
+/*****************************************************************************/
+
+/**
+ *  @brief  Gzipped file input stream class.
+ *
+ *  This class implements ifstream for gzipped files. Seeking and putback
+ *  is not supported yet.
+*/
+class gzifstream : public std::istream
+{
+public:
+  //  Default constructor
+  gzifstream();
+
+  /**
+   *  @brief  Construct stream on gzipped file to be opened.
+   *  @param  name  File name.
+   *  @param  mode  Open mode flags (forced to contain ios::in).
+  */
+  explicit
+  gzifstream(const char* name,
+             std::ios_base::openmode mode = std::ios_base::in);
+
+  /**
+   *  @brief  Construct stream on already open gzipped file.
+   *  @param  fd    File descriptor.
+   *  @param  mode  Open mode flags (forced to contain ios::in).
+  */
+  explicit
+  gzifstream(int fd,
+             std::ios_base::openmode mode = std::ios_base::in);
+
+  /**
+   *  Obtain underlying stream buffer.
+  */
+  gzfilebuf*
+  rdbuf() const
+  { return const_cast<gzfilebuf*>(&sb); }
+
+  /**
+   *  @brief  Check if file is open.
+   *  @return  True if file is open.
+  */
+  bool
+  is_open() { return sb.is_open(); }
+
+  /**
+   *  @brief  Open gzipped file.
+   *  @param  name  File name.
+   *  @param  mode  Open mode flags (forced to contain ios::in).
+   *
+   *  Stream will be in state good() if file opens successfully;
+   *  otherwise in state fail(). This differs from the behavior of
+   *  ifstream, which never sets the state to good() and therefore
+   *  won't allow you to reuse the stream for a second file unless
+   *  you manually clear() the state. The choice is a matter of
+   *  convenience.
+  */
+  void
+  open(const char* name,
+       std::ios_base::openmode mode = std::ios_base::in);
+
+  /**
+   *  @brief  Attach to already open gzipped file.
+   *  @param  fd  File descriptor.
+   *  @param  mode  Open mode flags (forced to contain ios::in).
+   *
+   *  Stream will be in state good() if attach succeeded; otherwise
+   *  in state fail().
+  */
+  void
+  attach(int fd,
+         std::ios_base::openmode mode = std::ios_base::in);
+
+  /**
+   *  @brief  Close gzipped file.
+   *
+   *  Stream will be in state fail() if close failed.
+  */
+  void
+  close();
+
+private:
+  /**
+   *  Underlying stream buffer.
+  */
+  gzfilebuf sb;
+};
+
+/*****************************************************************************/
+
+/**
+ *  @brief  Gzipped file output stream class.
+ *
+ *  This class implements ofstream for gzipped files. Seeking and putback
+ *  is not supported yet.
+*/
+class gzofstream : public std::ostream
+{
+public:
+  //  Default constructor
+  gzofstream();
+
+  /**
+   *  @brief  Construct stream on gzipped file to be opened.
+   *  @param  name  File name.
+   *  @param  mode  Open mode flags (forced to contain ios::out).
+  */
+  explicit
+  gzofstream(const char* name,
+             std::ios_base::openmode mode = std::ios_base::out);
+
+  /**
+   *  @brief  Construct stream on already open gzipped file.
+   *  @param  fd    File descriptor.
+   *  @param  mode  Open mode flags (forced to contain ios::out).
+  */
+  explicit
+  gzofstream(int fd,
+             std::ios_base::openmode mode = std::ios_base::out);
+
+  /**
+   *  Obtain underlying stream buffer.
+  */
+  gzfilebuf*
+  rdbuf() const
+  { return const_cast<gzfilebuf*>(&sb); }
+
+  /**
+   *  @brief  Check if file is open.
+   *  @return  True if file is open.
+  */
+  bool
+  is_open() { return sb.is_open(); }
+
+  /**
+   *  @brief  Open gzipped file.
+   *  @param  name  File name.
+   *  @param  mode  Open mode flags (forced to contain ios::out).
+   *
+   *  Stream will be in state good() if file opens successfully;
+   *  otherwise in state fail(). This differs from the behavior of
+   *  ofstream, which never sets the state to good() and therefore
+   *  won't allow you to reuse the stream for a second file unless
+   *  you manually clear() the state. The choice is a matter of
+   *  convenience.
+  */
+  void
+  open(const char* name,
+       std::ios_base::openmode mode = std::ios_base::out);
+
+  /**
+   *  @brief  Attach to already open gzipped file.
+   *  @param  fd  File descriptor.
+   *  @param  mode  Open mode flags (forced to contain ios::out).
+   *
+   *  Stream will be in state good() if attach succeeded; otherwise
+   *  in state fail().
+  */
+  void
+  attach(int fd,
+         std::ios_base::openmode mode = std::ios_base::out);
+
+  /**
+   *  @brief  Close gzipped file.
+   *
+   *  Stream will be in state fail() if close failed.
+  */
+  void
+  close();
+
+private:
+  /**
+   *  Underlying stream buffer.
+  */
+  gzfilebuf sb;
+};
+
+/*****************************************************************************/
+
+/**
+ *  @brief  Gzipped file output stream manipulator class.
+ *
+ *  This class defines a two-argument manipulator for gzofstream. It is used
+ *  as base for the setcompression(int,int) manipulator.
+*/
+template<typename T1, typename T2>
+  class gzomanip2
+  {
+  public:
+    // Allows insertor to peek at internals
+    template <typename Ta, typename Tb>
+      friend gzofstream&
+      operator<<(gzofstream&,
+                 const gzomanip2<Ta,Tb>&);
+
+    // Constructor
+    gzomanip2(gzofstream& (*f)(gzofstream&, T1, T2),
+              T1 v1,
+              T2 v2);
+  private:
+    // Underlying manipulator function
+    gzofstream&
+    (*func)(gzofstream&, T1, T2);
+
+    // Arguments for manipulator function
+    T1 val1;
+    T2 val2;
+  };
+
+/*****************************************************************************/
+
+// Manipulator function thunks through to stream buffer
+inline gzofstream&
+setcompression(gzofstream &gzs, int l, int s = Z_DEFAULT_STRATEGY)
+{
+  (gzs.rdbuf())->setcompression(l, s);
+  return gzs;
+}
+
+// Manipulator constructor stores arguments
+template<typename T1, typename T2>
+  inline
+  gzomanip2<T1,T2>::gzomanip2(gzofstream &(*f)(gzofstream &, T1, T2),
+                              T1 v1,
+                              T2 v2)
+  : func(f), val1(v1), val2(v2)
+  { }
+
+// Insertor applies underlying manipulator function to stream
+template<typename T1, typename T2>
+  inline gzofstream&
+  operator<<(gzofstream& s, const gzomanip2<T1,T2>& m)
+  { return (*m.func)(s, m.val1, m.val2); }
+
+// Insert this onto stream to simplify setting of compression level
+inline gzomanip2<int,int>
+setcompression(int l, int s = Z_DEFAULT_STRATEGY)
+{ return gzomanip2<int,int>(&setcompression, l, s); }
+
+#endif // ZFSTREAM_H
diff --git a/updater/zlib123/contrib/masm686/match.asm b/updater/zlib123/contrib/masm686/match.asm
new file mode 100644
index 0000000..4b03a71
--- /dev/null
+++ b/updater/zlib123/contrib/masm686/match.asm
@@ -0,0 +1,413 @@
+
+; match.asm -- Pentium-Pro optimized version of longest_match()
+;
+; Updated for zlib 1.1.3 and converted to MASM 6.1x
+; Copyright (C) 2000 Dan Higdon <hdan@kinesoft.com>
+;                    and Chuck Walbourn <chuckw@kinesoft.com>
+; Corrections by Cosmin Truta <cosmint@cs.ubbcluj.ro>
+;
+; This is free software; you can redistribute it and/or modify it
+; under the terms of the GNU General Public License.
+
+; Based on match.S
+; Written for zlib 1.1.2
+; Copyright (C) 1998 Brian Raiter <breadbox@muppetlabs.com>
+;
+; Modified by Gilles Vollant (2005) for add gzhead and gzindex
+
+	.686P
+	.MODEL	FLAT
+
+;===========================================================================
+; EQUATES
+;===========================================================================
+
+MAX_MATCH	EQU 258
+MIN_MATCH	EQU 3
+MIN_LOOKAHEAD	EQU (MAX_MATCH + MIN_MATCH + 1)
+MAX_MATCH_8	EQU ((MAX_MATCH + 7) AND (NOT 7))
+
+;===========================================================================
+; STRUCTURES
+;===========================================================================
+
+; This STRUCT assumes a 4-byte alignment
+
+DEFLATE_STATE	STRUCT
+ds_strm			dd ?
+ds_status		dd ?
+ds_pending_buf		dd ?
+ds_pending_buf_size	dd ?
+ds_pending_out		dd ?
+ds_pending		dd ?
+ds_wrap			dd ?
+; gzhead and gzindex are added in zlib 1.2.2.2 (see deflate.h)
+ds_gzhead               dd ?
+ds_gzindex              dd ?
+ds_data_type		db ?
+ds_method		db ?
+			db ?	; padding
+			db ?	; padding
+ds_last_flush		dd ?
+ds_w_size		dd ?	; used
+ds_w_bits		dd ?
+ds_w_mask		dd ?	; used
+ds_window		dd ?	; used
+ds_window_size		dd ?
+ds_prev			dd ?	; used
+ds_head			dd ?
+ds_ins_h		dd ?
+ds_hash_size		dd ?
+ds_hash_bits		dd ?
+ds_hash_mask		dd ?
+ds_hash_shift		dd ?
+ds_block_start		dd ?
+ds_match_length		dd ?	; used
+ds_prev_match		dd ?	; used
+ds_match_available	dd ?
+ds_strstart		dd ?	; used
+ds_match_start		dd ?	; used
+ds_lookahead		dd ?	; used
+ds_prev_length		dd ?	; used
+ds_max_chain_length	dd ?	; used
+ds_max_laxy_match	dd ?
+ds_level		dd ?
+ds_strategy		dd ?
+ds_good_match		dd ?	; used
+ds_nice_match		dd ?	; used
+
+; Don't need anymore of the struct for match
+DEFLATE_STATE	ENDS
+
+;===========================================================================
+; CODE
+;===========================================================================
+_TEXT	SEGMENT
+
+;---------------------------------------------------------------------------
+; match_init
+;---------------------------------------------------------------------------
+	ALIGN	4
+PUBLIC	_match_init
+_match_init	PROC
+	; no initialization needed
+	ret
+_match_init	ENDP
+
+;---------------------------------------------------------------------------
+; uInt longest_match(deflate_state *deflatestate, IPos curmatch)
+;---------------------------------------------------------------------------
+	ALIGN	4
+
+PUBLIC	_longest_match
+_longest_match	PROC
+
+; Since this code uses EBP for a scratch register, the stack frame must
+; be manually constructed and referenced relative to the ESP register.
+
+; Stack image
+; Variables
+chainlenwmask	=  0	; high word: current chain len
+			; low word: s->wmask
+window		=  4	; local copy of s->window
+windowbestlen	=  8	; s->window + bestlen
+scanend		= 12	; last two bytes of string
+scanstart	= 16	; first two bytes of string
+scanalign	= 20	; dword-misalignment of string
+nicematch	= 24	; a good enough match size
+bestlen		= 28	; size of best match so far
+scan		= 32	; ptr to string wanting match
+varsize		= 36	; number of bytes (also offset to last saved register)
+
+; Saved Registers (actually pushed into place)
+ebx_save	= 36
+edi_save	= 40
+esi_save	= 44
+ebp_save	= 48
+
+; Parameters
+retaddr		= 52
+deflatestate	= 56
+curmatch	= 60
+
+; Save registers that the compiler may be using
+	push	ebp
+	push	edi
+	push	esi
+	push	ebx
+
+; Allocate local variable space
+	sub	esp,varsize
+
+; Retrieve the function arguments. ecx will hold cur_match
+; throughout the entire function. edx will hold the pointer to the
+; deflate_state structure during the function's setup (before
+; entering the main loop).
+
+	mov	edx, [esp+deflatestate]
+ASSUME	edx:PTR DEFLATE_STATE
+
+	mov	ecx, [esp+curmatch]
+
+; uInt wmask = s->w_mask;
+; unsigned chain_length = s->max_chain_length;
+; if (s->prev_length >= s->good_match) {
+;     chain_length >>= 2;
+; }
+
+	mov	eax, [edx].ds_prev_length
+	mov	ebx, [edx].ds_good_match
+	cmp	eax, ebx
+	mov	eax, [edx].ds_w_mask
+	mov	ebx, [edx].ds_max_chain_length
+	jl	SHORT LastMatchGood
+	shr	ebx, 2
+LastMatchGood:
+
+; chainlen is decremented once beforehand so that the function can
+; use the sign flag instead of the zero flag for the exit test.
+; It is then shifted into the high word, to make room for the wmask
+; value, which it will always accompany.
+
+	dec	ebx
+	shl	ebx, 16
+	or	ebx, eax
+	mov	[esp+chainlenwmask], ebx
+
+; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
+
+	mov	eax, [edx].ds_nice_match
+	mov	ebx, [edx].ds_lookahead
+	cmp	ebx, eax
+	jl	SHORT LookaheadLess
+	mov	ebx, eax
+LookaheadLess:
+	mov	[esp+nicematch], ebx
+
+;/* register Bytef *scan = s->window + s->strstart;                     */
+
+	mov	esi, [edx].ds_window
+	mov	[esp+window], esi
+	mov	ebp, [edx].ds_strstart
+	lea	edi, [esi+ebp]
+	mov	[esp+scan],edi
+
+;/* Determine how many bytes the scan ptr is off from being             */
+;/* dword-aligned.                                                      */
+
+	mov	eax, edi
+	neg	eax
+	and	eax, 3
+	mov	[esp+scanalign], eax
+
+;/* IPos limit = s->strstart > (IPos)MAX_DIST(s) ?                      */
+;/*     s->strstart - (IPos)MAX_DIST(s) : NIL;                          */
+
+	mov	eax, [edx].ds_w_size
+	sub	eax, MIN_LOOKAHEAD
+	sub	ebp, eax
+	jg	SHORT LimitPositive
+	xor	ebp, ebp
+LimitPositive:
+
+;/* int best_len = s->prev_length;                                      */
+
+	mov	eax, [edx].ds_prev_length
+	mov	[esp+bestlen], eax
+
+;/* Store the sum of s->window + best_len in %esi locally, and in %esi. */
+
+	add	esi, eax
+	mov	[esp+windowbestlen], esi
+
+;/* register ush scan_start = *(ushf*)scan;                             */
+;/* register ush scan_end   = *(ushf*)(scan+best_len-1);                */
+;/* Posf *prev = s->prev;                                               */
+
+	movzx	ebx, WORD PTR[edi]
+	mov	[esp+scanstart], ebx
+	movzx	ebx, WORD PTR[eax+edi-1]
+	mov	[esp+scanend], ebx
+	mov	edi, [edx].ds_prev
+
+;/* Jump into the main loop.                                            */
+
+	mov	edx, [esp+chainlenwmask]
+	jmp	SHORT LoopEntry
+
+;/* do {
+; *     match = s->window + cur_match;
+; *     if (*(ushf*)(match+best_len-1) != scan_end ||
+; *         *(ushf*)match != scan_start) continue;
+; *     [...]
+; * } while ((cur_match = prev[cur_match & wmask]) > limit
+; *          && --chain_length != 0);
+; *
+; * Here is the inner loop of the function. The function will spend the
+; * majority of its time in this loop, and majority of that time will
+; * be spent in the first ten instructions.
+; *
+; * Within this loop:
+; * %ebx = scanend
+; * %ecx = curmatch
+; * %edx = chainlenwmask - i.e., ((chainlen << 16) | wmask)
+; * %esi = windowbestlen - i.e., (window + bestlen)
+; * %edi = prev
+; * %ebp = limit
+; */
+
+	ALIGN	4
+LookupLoop:
+	and	ecx, edx
+	movzx	ecx, WORD PTR[edi+ecx*2]
+	cmp	ecx, ebp
+	jbe	LeaveNow
+	sub	edx, 000010000H
+	js	LeaveNow
+
+LoopEntry:
+	movzx	eax, WORD PTR[esi+ecx-1]
+	cmp	eax, ebx
+	jnz	SHORT LookupLoop
+
+	mov	eax, [esp+window]
+	movzx	eax, WORD PTR[eax+ecx]
+	cmp	eax, [esp+scanstart]
+	jnz	SHORT LookupLoop
+
+;/* Store the current value of chainlen.                                */
+
+	mov	[esp+chainlenwmask], edx
+
+;/* Point %edi to the string under scrutiny, and %esi to the string we  */
+;/* are hoping to match it up with. In actuality, %esi and %edi are     */
+;/* both pointed (MAX_MATCH_8 - scanalign) bytes ahead, and %edx is     */
+;/* initialized to -(MAX_MATCH_8 - scanalign).                          */
+
+	mov	esi, [esp+window]
+	mov	edi, [esp+scan]
+	add	esi, ecx
+	mov	eax, [esp+scanalign]
+	mov	edx, -MAX_MATCH_8
+	lea	edi, [edi+eax+MAX_MATCH_8]
+	lea	esi, [esi+eax+MAX_MATCH_8]
+
+;/* Test the strings for equality, 8 bytes at a time. At the end,
+; * adjust %edx so that it is offset to the exact byte that mismatched.
+; *
+; * We already know at this point that the first three bytes of the
+; * strings match each other, and they can be safely passed over before
+; * starting the compare loop. So what this code does is skip over 0-3
+; * bytes, as much as necessary in order to dword-align the %edi
+; * pointer. (%esi will still be misaligned three times out of four.)
+; *
+; * It should be confessed that this loop usually does not represent
+; * much of the total running time. Replacing it with a more
+; * straightforward "rep cmpsb" would not drastically degrade
+; * performance.
+; */
+
+LoopCmps:
+	mov	eax, DWORD PTR[esi+edx]
+	xor	eax, DWORD PTR[edi+edx]
+	jnz	SHORT LeaveLoopCmps
+
+	mov	eax, DWORD PTR[esi+edx+4]
+	xor	eax, DWORD PTR[edi+edx+4]
+	jnz	SHORT LeaveLoopCmps4
+
+	add	edx, 8
+	jnz	SHORT LoopCmps
+	jmp	LenMaximum
+	ALIGN	4
+
+LeaveLoopCmps4:
+	add	edx, 4
+
+LeaveLoopCmps:
+	test	eax, 00000FFFFH
+	jnz	SHORT LenLower
+
+	add	edx, 2
+	shr	eax, 16
+
+LenLower:
+	sub	al, 1
+	adc	edx, 0
+
+;/* Calculate the length of the match. If it is longer than MAX_MATCH,  */
+;/* then automatically accept it as the best possible match and leave.  */
+
+	lea	eax, [edi+edx]
+	mov	edi, [esp+scan]
+	sub	eax, edi
+	cmp	eax, MAX_MATCH
+	jge	SHORT LenMaximum
+
+;/* If the length of the match is not longer than the best match we     */
+;/* have so far, then forget it and return to the lookup loop.          */
+
+	mov	edx, [esp+deflatestate]
+	mov	ebx, [esp+bestlen]
+	cmp	eax, ebx
+	jg	SHORT LongerMatch
+	mov	esi, [esp+windowbestlen]
+	mov	edi, [edx].ds_prev
+	mov	ebx, [esp+scanend]
+	mov	edx, [esp+chainlenwmask]
+	jmp	LookupLoop
+	ALIGN	4
+
+;/*         s->match_start = cur_match;                                 */
+;/*         best_len = len;                                             */
+;/*         if (len >= nice_match) break;                               */
+;/*         scan_end = *(ushf*)(scan+best_len-1);                       */
+
+LongerMatch:
+	mov	ebx, [esp+nicematch]
+	mov	[esp+bestlen], eax
+	mov	[edx].ds_match_start, ecx
+	cmp	eax, ebx
+	jge	SHORT LeaveNow
+	mov	esi, [esp+window]
+	add	esi, eax
+	mov	[esp+windowbestlen], esi
+	movzx	ebx, WORD PTR[edi+eax-1]
+	mov	edi, [edx].ds_prev
+	mov	[esp+scanend], ebx
+	mov	edx, [esp+chainlenwmask]
+	jmp	LookupLoop
+	ALIGN	4
+
+;/* Accept the current string, with the maximum possible length.        */
+
+LenMaximum:
+	mov	edx, [esp+deflatestate]
+	mov	DWORD PTR[esp+bestlen], MAX_MATCH
+	mov	[edx].ds_match_start, ecx
+
+;/* if ((uInt)best_len <= s->lookahead) return (uInt)best_len;          */
+;/* return s->lookahead;                                                */
+
+LeaveNow:
+	mov	edx, [esp+deflatestate]
+	mov	ebx, [esp+bestlen]
+	mov	eax, [edx].ds_lookahead
+	cmp	ebx, eax
+	jg	SHORT LookaheadRet
+	mov	eax, ebx
+LookaheadRet:
+
+; Restore the stack and return from whence we came.
+
+	add	esp, varsize
+	pop	ebx
+	pop	esi
+	pop	edi
+	pop	ebp
+	ret
+
+_longest_match	ENDP
+
+_TEXT	ENDS
+END
diff --git a/updater/zlib123/contrib/masmx64/bld_ml64.bat b/updater/zlib123/contrib/masmx64/bld_ml64.bat
new file mode 100644
index 0000000..8f9343d
--- /dev/null
+++ b/updater/zlib123/contrib/masmx64/bld_ml64.bat
@@ -0,0 +1,2 @@
+ml64.exe /Flinffasx64 /c /Zi inffasx64.asm
+ml64.exe /Flgvmat64   /c /Zi gvmat64.asm
diff --git a/updater/zlib123/contrib/masmx64/gvmat64.asm b/updater/zlib123/contrib/masmx64/gvmat64.asm
new file mode 100644
index 0000000..790d655
--- /dev/null
+++ b/updater/zlib123/contrib/masmx64/gvmat64.asm
@@ -0,0 +1,513 @@
+;uInt longest_match_x64(
+;    deflate_state *s,
+;    IPos cur_match);                             /* current match */
+
+; gvmat64.asm -- Asm portion of the optimized longest_match for 32 bits x86
+; Copyright (C) 1995-2005 Jean-loup Gailly, Brian Raiter and Gilles Vollant.
+;
+; File written by Gilles Vollant, by converting to assembly the longest_match
+;  from Jean-loup Gailly in deflate.c of zLib and infoZip zip.
+;
+;  and by taking inspiration on asm686 with masm, optimised assembly code
+;        from Brian Raiter, written 1998
+;
+;         http://www.zlib.net
+;         http://www.winimage.com/zLibDll
+;         http://www.muppetlabs.com/~breadbox/software/assembly.html
+;
+; to compile this file for infozip Zip, I use option:
+;   ml64.exe /Flgvmat64 /c /Zi /DINFOZIP gvmat64.asm
+;
+; to compile this file for zLib, I use option:
+;   ml64.exe /Flgvmat64 /c /Zi gvmat64.asm
+; Be carrefull to adapt zlib1222add below to your version of zLib
+;   (if you use a version of zLib before 1.0.4 or after 1.2.2.2, change
+;    value of zlib1222add later)
+;
+; This file compile with Microsoft Macro Assembler (x64) for AMD64
+;
+;   ml64.exe is given with Visual Studio 2005 and Windows 2003 server DDK
+;
+;   (you can get Windows 2003 server DDK with ml64 and cl for AMD64 from
+;      http://www.microsoft.com/whdc/devtools/ddk/default.mspx for low price)
+;
+
+
+;uInt longest_match(s, cur_match)
+;    deflate_state *s;
+;    IPos cur_match;                             /* current match */
+.code
+longest_match PROC
+
+
+;LocalVarsSize   equ 88
+ LocalVarsSize   equ 72
+
+; register used : rax,rbx,rcx,rdx,rsi,rdi,r8,r9,r10,r11,r12
+; free register :  r14,r15
+; register can be saved : rsp
+
+ chainlenwmask   equ  rsp + 8 - LocalVarsSize    ; high word: current chain len
+                                                 ; low word: s->wmask
+;window          equ  rsp + xx - LocalVarsSize   ; local copy of s->window ; stored in r10
+;windowbestlen   equ  rsp + xx - LocalVarsSize   ; s->window + bestlen , use r10+r11
+;scanstart       equ  rsp + xx - LocalVarsSize   ; first two bytes of string ; stored in r12w
+;scanend         equ  rsp + xx - LocalVarsSize   ; last two bytes of string use ebx
+;scanalign       equ  rsp + xx - LocalVarsSize   ; dword-misalignment of string r13
+;bestlen         equ  rsp + xx - LocalVarsSize   ; size of best match so far -> r11d
+;scan            equ  rsp + xx - LocalVarsSize   ; ptr to string wanting match -> r9
+IFDEF INFOZIP
+ELSE
+ nicematch       equ  (rsp + 16 - LocalVarsSize) ; a good enough match size
+ENDIF
+
+save_rdi        equ  rsp + 24 - LocalVarsSize
+save_rsi        equ  rsp + 32 - LocalVarsSize
+save_rbx        equ  rsp + 40 - LocalVarsSize
+save_rbp        equ  rsp + 48 - LocalVarsSize
+save_r12        equ  rsp + 56 - LocalVarsSize
+save_r13        equ  rsp + 64 - LocalVarsSize
+;save_r14        equ  rsp + 72 - LocalVarsSize
+;save_r15        equ  rsp + 80 - LocalVarsSize
+
+
+
+;  all the +4 offsets are due to the addition of pending_buf_size (in zlib
+;  in the deflate_state structure since the asm code was first written
+;  (if you compile with zlib 1.0.4 or older, remove the +4).
+;  Note : these value are good with a 8 bytes boundary pack structure
+
+
+    MAX_MATCH           equ     258
+    MIN_MATCH           equ     3
+    MIN_LOOKAHEAD       equ     (MAX_MATCH+MIN_MATCH+1)
+
+
+;;; Offsets for fields in the deflate_state structure. These numbers
+;;; are calculated from the definition of deflate_state, with the
+;;; assumption that the compiler will dword-align the fields. (Thus,
+;;; changing the definition of deflate_state could easily cause this
+;;; program to crash horribly, without so much as a warning at
+;;; compile time. Sigh.)
+
+;  all the +zlib1222add offsets are due to the addition of fields
+;  in zlib in the deflate_state structure since the asm code was first written
+;  (if you compile with zlib 1.0.4 or older, use "zlib1222add equ (-4)").
+;  (if you compile with zlib between 1.0.5 and 1.2.2.1, use "zlib1222add equ 0").
+;  if you compile with zlib 1.2.2.2 or later , use "zlib1222add equ 8").
+
+
+IFDEF INFOZIP
+
+_DATA   SEGMENT
+COMM    window_size:DWORD
+; WMask ; 7fff
+COMM    window:BYTE:010040H
+COMM    prev:WORD:08000H
+; MatchLen : unused
+; PrevMatch : unused
+COMM    strstart:DWORD
+COMM    match_start:DWORD
+; Lookahead : ignore
+COMM    prev_length:DWORD ; PrevLen
+COMM    max_chain_length:DWORD
+COMM    good_match:DWORD
+COMM    nice_match:DWORD
+prev_ad equ OFFSET prev
+window_ad equ OFFSET window
+nicematch equ nice_match
+_DATA ENDS
+WMask equ 07fffh
+
+ELSE
+
+  IFNDEF zlib1222add
+    zlib1222add equ 8
+  ENDIF
+dsWSize         equ 56+zlib1222add+(zlib1222add/2)
+dsWMask         equ 64+zlib1222add+(zlib1222add/2)
+dsWindow        equ 72+zlib1222add
+dsPrev          equ 88+zlib1222add
+dsMatchLen      equ 128+zlib1222add
+dsPrevMatch     equ 132+zlib1222add
+dsStrStart      equ 140+zlib1222add
+dsMatchStart    equ 144+zlib1222add
+dsLookahead     equ 148+zlib1222add
+dsPrevLen       equ 152+zlib1222add
+dsMaxChainLen   equ 156+zlib1222add
+dsGoodMatch     equ 172+zlib1222add
+dsNiceMatch     equ 176+zlib1222add
+
+window_size     equ [ rcx + dsWSize]
+WMask           equ [ rcx + dsWMask]
+window_ad       equ [ rcx + dsWindow]
+prev_ad         equ [ rcx + dsPrev]
+strstart        equ [ rcx + dsStrStart]
+match_start     equ [ rcx + dsMatchStart]
+Lookahead       equ [ rcx + dsLookahead] ; 0ffffffffh on infozip
+prev_length     equ [ rcx + dsPrevLen]
+max_chain_length equ [ rcx + dsMaxChainLen]
+good_match      equ [ rcx + dsGoodMatch]
+nice_match      equ [ rcx + dsNiceMatch]
+ENDIF
+
+; parameter 1 in r8(deflate state s), param 2 in rdx (cur match)
+
+; see http://weblogs.asp.net/oldnewthing/archive/2004/01/14/58579.aspx and
+; http://msdn.microsoft.com/library/en-us/kmarch/hh/kmarch/64bitAMD_8e951dd2-ee77-4728-8702-55ce4b5dd24a.xml.asp
+;
+; All registers must be preserved across the call, except for
+;   rax, rcx, rdx, r8, r9, r10, and r11, which are scratch.
+
+
+
+;;; Save registers that the compiler may be using, and adjust esp to
+;;; make room for our stack frame.
+
+
+;;; Retrieve the function arguments. r8d will hold cur_match
+;;; throughout the entire function. edx will hold the pointer to the
+;;; deflate_state structure during the function's setup (before
+;;; entering the main loop.
+
+; parameter 1 in rcx (deflate_state* s), param 2 in edx -> r8 (cur match)
+
+; this clear high 32 bits of r8, which can be garbage in both r8 and rdx
+
+        mov [save_rdi],rdi
+        mov [save_rsi],rsi
+        mov [save_rbx],rbx
+        mov [save_rbp],rbp
+IFDEF INFOZIP
+        mov r8d,ecx
+ELSE
+        mov r8d,edx
+ENDIF
+        mov [save_r12],r12
+        mov [save_r13],r13
+;        mov [save_r14],r14
+;        mov [save_r15],r15
+
+
+;;; uInt wmask = s->w_mask;
+;;; unsigned chain_length = s->max_chain_length;
+;;; if (s->prev_length >= s->good_match) {
+;;;     chain_length >>= 2;
+;;; }
+
+        mov edi, prev_length
+        mov esi, good_match
+        mov eax, WMask
+        mov ebx, max_chain_length
+        cmp edi, esi
+        jl  LastMatchGood
+        shr ebx, 2
+LastMatchGood:
+
+;;; chainlen is decremented once beforehand so that the function can
+;;; use the sign flag instead of the zero flag for the exit test.
+;;; It is then shifted into the high word, to make room for the wmask
+;;; value, which it will always accompany.
+
+        dec ebx
+        shl ebx, 16
+        or  ebx, eax
+
+;;; on zlib only
+;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
+
+IFDEF INFOZIP
+        mov [chainlenwmask], ebx
+; on infozip nice_match = [nice_match]
+ELSE
+        mov eax, nice_match
+        mov [chainlenwmask], ebx
+        mov r10d, Lookahead
+        cmp r10d, eax
+        cmovnl r10d, eax
+        mov [nicematch],r10d
+ENDIF
+
+;;; register Bytef *scan = s->window + s->strstart;
+        mov r10, window_ad
+        mov ebp, strstart
+        lea r13, [r10 + rbp]
+
+;;; Determine how many bytes the scan ptr is off from being
+;;; dword-aligned.
+
+         mov r9,r13
+         neg r13
+         and r13,3
+
+;;; IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
+;;;     s->strstart - (IPos)MAX_DIST(s) : NIL;
+IFDEF INFOZIP
+        mov eax,07efah ; MAX_DIST = (WSIZE-MIN_LOOKAHEAD) (0x8000-(3+8+1))
+ELSE
+        mov eax, window_size
+        sub eax, MIN_LOOKAHEAD
+ENDIF
+        xor edi,edi
+        sub ebp, eax
+
+        mov r11d, prev_length
+
+        cmovng ebp,edi
+
+;;; int best_len = s->prev_length;
+
+
+;;; Store the sum of s->window + best_len in esi locally, and in esi.
+
+       lea  rsi,[r10+r11]
+
+;;; register ush scan_start = *(ushf*)scan;
+;;; register ush scan_end   = *(ushf*)(scan+best_len-1);
+;;; Posf *prev = s->prev;
+
+        movzx r12d,word ptr [r9]
+        movzx ebx, word ptr [r9 + r11 - 1]
+
+        mov rdi, prev_ad
+
+;;; Jump into the main loop.
+
+        mov edx, [chainlenwmask]
+
+        cmp bx,word ptr [rsi + r8 - 1]
+        jz  LookupLoopIsZero
+
+LookupLoop1:
+        and r8d, edx
+
+        movzx   r8d, word ptr [rdi + r8*2]
+        cmp r8d, ebp
+        jbe LeaveNow
+        sub edx, 00010000h
+        js  LeaveNow
+
+LoopEntry1:
+        cmp bx,word ptr [rsi + r8 - 1]
+        jz  LookupLoopIsZero
+
+LookupLoop2:
+        and r8d, edx
+
+        movzx   r8d, word ptr [rdi + r8*2]
+        cmp r8d, ebp
+        jbe LeaveNow
+        sub edx, 00010000h
+        js  LeaveNow
+
+LoopEntry2:
+        cmp bx,word ptr [rsi + r8 - 1]
+        jz  LookupLoopIsZero
+
+LookupLoop4:
+        and r8d, edx
+
+        movzx   r8d, word ptr [rdi + r8*2]
+        cmp r8d, ebp
+        jbe LeaveNow
+        sub edx, 00010000h
+        js  LeaveNow
+
+LoopEntry4:
+
+        cmp bx,word ptr [rsi + r8 - 1]
+        jnz LookupLoop1
+        jmp LookupLoopIsZero
+
+
+;;; do {
+;;;     match = s->window + cur_match;
+;;;     if (*(ushf*)(match+best_len-1) != scan_end ||
+;;;         *(ushf*)match != scan_start) continue;
+;;;     [...]
+;;; } while ((cur_match = prev[cur_match & wmask]) > limit
+;;;          && --chain_length != 0);
+;;;
+;;; Here is the inner loop of the function. The function will spend the
+;;; majority of its time in this loop, and majority of that time will
+;;; be spent in the first ten instructions.
+;;;
+;;; Within this loop:
+;;; ebx = scanend
+;;; r8d = curmatch
+;;; edx = chainlenwmask - i.e., ((chainlen << 16) | wmask)
+;;; esi = windowbestlen - i.e., (window + bestlen)
+;;; edi = prev
+;;; ebp = limit
+
+LookupLoop:
+        and r8d, edx
+
+        movzx   r8d, word ptr [rdi + r8*2]
+        cmp r8d, ebp
+        jbe LeaveNow
+        sub edx, 00010000h
+        js  LeaveNow
+
+LoopEntry:
+
+        cmp bx,word ptr [rsi + r8 - 1]
+        jnz LookupLoop1
+LookupLoopIsZero:
+        cmp     r12w, word ptr [r10 + r8]
+        jnz LookupLoop1
+
+
+;;; Store the current value of chainlen.
+        mov [chainlenwmask], edx
+
+;;; Point edi to the string under scrutiny, and esi to the string we
+;;; are hoping to match it up with. In actuality, esi and edi are
+;;; both pointed (MAX_MATCH_8 - scanalign) bytes ahead, and edx is
+;;; initialized to -(MAX_MATCH_8 - scanalign).
+
+        lea rsi,[r8+r10]
+        mov rdx, 0fffffffffffffef8h; -(MAX_MATCH_8)
+        lea rsi, [rsi + r13 + 0108h] ;MAX_MATCH_8]
+        lea rdi, [r9 + r13 + 0108h] ;MAX_MATCH_8]
+
+        prefetcht1 [rsi+rdx]
+        prefetcht1 [rdi+rdx]
+
+
+;;; Test the strings for equality, 8 bytes at a time. At the end,
+;;; adjust rdx so that it is offset to the exact byte that mismatched.
+;;;
+;;; We already know at this point that the first three bytes of the
+;;; strings match each other, and they can be safely passed over before
+;;; starting the compare loop. So what this code does is skip over 0-3
+;;; bytes, as much as necessary in order to dword-align the edi
+;;; pointer. (rsi will still be misaligned three times out of four.)
+;;;
+;;; It should be confessed that this loop usually does not represent
+;;; much of the total running time. Replacing it with a more
+;;; straightforward "rep cmpsb" would not drastically degrade
+;;; performance.
+
+
+LoopCmps:
+        mov rax, [rsi + rdx]
+        xor rax, [rdi + rdx]
+        jnz LeaveLoopCmps
+
+        mov rax, [rsi + rdx + 8]
+        xor rax, [rdi + rdx + 8]
+        jnz LeaveLoopCmps8
+
+
+        mov rax, [rsi + rdx + 8+8]
+        xor rax, [rdi + rdx + 8+8]
+        jnz LeaveLoopCmps16
+
+        add rdx,8+8+8
+
+        jmp short LoopCmps
+LeaveLoopCmps16: add rdx,8
+LeaveLoopCmps8: add rdx,8
+LeaveLoopCmps:
+
+        test    eax, 0000FFFFh
+        jnz LenLower
+
+        test eax,0ffffffffh
+
+        jnz LenLower32
+
+        add rdx,4
+        shr rax,32
+        or ax,ax
+        jnz LenLower
+
+LenLower32:
+        shr eax,16
+        add rdx,2
+LenLower:   sub al, 1
+        adc rdx, 0
+;;; Calculate the length of the match. If it is longer than MAX_MATCH,
+;;; then automatically accept it as the best possible match and leave.
+
+        lea rax, [rdi + rdx]
+        sub rax, r9
+        cmp eax, MAX_MATCH
+        jge LenMaximum
+
+;;; If the length of the match is not longer than the best match we
+;;; have so far, then forget it and return to the lookup loop.
+;///////////////////////////////////
+
+        cmp eax, r11d
+        jg  LongerMatch
+
+        lea rsi,[r10+r11]
+
+        mov rdi, prev_ad
+        mov edx, [chainlenwmask]
+        jmp LookupLoop
+
+;;;         s->match_start = cur_match;
+;;;         best_len = len;
+;;;         if (len >= nice_match) break;
+;;;         scan_end = *(ushf*)(scan+best_len-1);
+
+LongerMatch:
+        mov r11d, eax
+        mov match_start, r8d
+        cmp eax, [nicematch]
+        jge LeaveNow
+
+        lea rsi,[r10+rax]
+
+        movzx   ebx, word ptr [r9 + rax - 1]
+        mov rdi, prev_ad
+        mov edx, [chainlenwmask]
+        jmp LookupLoop
+
+;;; Accept the current string, with the maximum possible length.
+
+LenMaximum:
+        mov r11d,MAX_MATCH
+        mov match_start, r8d
+
+;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
+;;; return s->lookahead;
+
+LeaveNow:
+IFDEF INFOZIP
+        mov eax,r11d
+ELSE
+        mov eax, Lookahead
+        cmp r11d, eax
+        cmovng eax, r11d
+ENDIF
+
+;;; Restore the stack and return from whence we came.
+
+
+        mov rsi,[save_rsi]
+        mov rdi,[save_rdi]
+        mov rbx,[save_rbx]
+        mov rbp,[save_rbp]
+        mov r12,[save_r12]
+        mov r13,[save_r13]
+;        mov r14,[save_r14]
+;        mov r15,[save_r15]
+
+
+        ret 0
+; please don't remove this string !
+; Your can freely use gvmat64 in any free or commercial app
+; but it is far better don't remove the string in the binary!
+    db     0dh,0ah,"asm686 with masm, optimised assembly code from Brian Raiter, written 1998, converted to amd 64 by Gilles Vollant 2005",0dh,0ah,0
+longest_match   ENDP
+
+match_init PROC
+  ret 0
+match_init ENDP
+
+
+END
diff --git a/updater/zlib123/contrib/masmx64/gvmat64.obj b/updater/zlib123/contrib/masmx64/gvmat64.obj
new file mode 100644
index 0000000..a49ca02
--- /dev/null
+++ b/updater/zlib123/contrib/masmx64/gvmat64.obj
diff --git a/updater/zlib123/contrib/masmx64/inffas8664.c b/updater/zlib123/contrib/masmx64/inffas8664.c
new file mode 100644
index 0000000..3af764d
--- /dev/null
+++ b/updater/zlib123/contrib/masmx64/inffas8664.c
@@ -0,0 +1,186 @@
+/* inffas8664.c is a hand tuned assembler version of inffast.c - fast decoding
+ * version for AMD64 on Windows using Microsoft C compiler
+ *
+ * Copyright (C) 1995-2003 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ *
+ * Copyright (C) 2003 Chris Anderson <christop@charm.net>
+ * Please use the copyright conditions above.
+ *
+ * 2005 - Adaptation to Microsoft C Compiler for AMD64 by Gilles Vollant
+ *
+ * inffas8664.c call function inffas8664fnc in inffasx64.asm
+ *  inffasx64.asm is automatically convert from AMD64 portion of inffas86.c
+ *
+ * Dec-29-2003 -- I added AMD64 inflate asm support.  This version is also
+ * slightly quicker on x86 systems because, instead of using rep movsb to copy
+ * data, it uses rep movsw, which moves data in 2-byte chunks instead of single
+ * bytes.  I've tested the AMD64 code on a Fedora Core 1 + the x86_64 updates
+ * from http://fedora.linux.duke.edu/fc1_x86_64
+ * which is running on an Athlon 64 3000+ / Gigabyte GA-K8VT800M system with
+ * 1GB ram.  The 64-bit version is about 4% faster than the 32-bit version,
+ * when decompressing mozilla-source-1.3.tar.gz.
+ *
+ * Mar-13-2003 -- Most of this is derived from inffast.S which is derived from
+ * the gcc -S output of zlib-1.2.0/inffast.c.  Zlib-1.2.0 is in beta release at
+ * the moment.  I have successfully compiled and tested this code with gcc2.96,
+ * gcc3.2, icc5.0, msvc6.0.  It is very close to the speed of inffast.S
+ * compiled with gcc -DNO_MMX, but inffast.S is still faster on the P3 with MMX
+ * enabled.  I will attempt to merge the MMX code into this version.  Newer
+ * versions of this and inffast.S can be found at
+ * http://www.eetbeetee.com/zlib/ and http://www.charm.net/~christop/zlib/
+ *
+ */
+
+#include <stdio.h>
+#include "zutil.h"
+#include "inftrees.h"
+#include "inflate.h"
+#include "inffast.h"
+
+/* Mark Adler's comments from inffast.c: */
+
+/*
+   Decode literal, length, and distance codes and write out the resulting
+   literal and match bytes until either not enough input or output is
+   available, an end-of-block is encountered, or a data error is encountered.
+   When large enough input and output buffers are supplied to inflate(), for
+   example, a 16K input buffer and a 64K output buffer, more than 95% of the
+   inflate execution time is spent in this routine.
+
+   Entry assumptions:
+
+        state->mode == LEN
+        strm->avail_in >= 6
+        strm->avail_out >= 258
+        start >= strm->avail_out
+        state->bits < 8
+
+   On return, state->mode is one of:
+
+        LEN -- ran out of enough output space or enough available input
+        TYPE -- reached end of block code, inflate() to interpret next block
+        BAD -- error in block data
+
+   Notes:
+
+    - The maximum input bits used by a length/distance pair is 15 bits for the
+      length code, 5 bits for the length extra, 15 bits for the distance code,
+      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.
+      Therefore if strm->avail_in >= 6, then there is enough input to avoid
+      checking for available input while decoding.
+
+    - The maximum bytes that a single length/distance pair can output is 258
+      bytes, which is the maximum length that can be coded.  inflate_fast()
+      requires strm->avail_out >= 258 for each loop to avoid checking for
+      output space.
+ */
+
+
+
+    typedef struct inffast_ar {
+/* 64   32                               x86  x86_64 */
+/* ar offset                              register */
+/*  0    0 */ void *esp;                /* esp save */
+/*  8    4 */ void *ebp;                /* ebp save */
+/* 16    8 */ unsigned char FAR *in;    /* esi rsi  local strm->next_in */
+/* 24   12 */ unsigned char FAR *last;  /*     r9   while in < last */
+/* 32   16 */ unsigned char FAR *out;   /* edi rdi  local strm->next_out */
+/* 40   20 */ unsigned char FAR *beg;   /*          inflate()'s init next_out */
+/* 48   24 */ unsigned char FAR *end;   /*     r10  while out < end */
+/* 56   28 */ unsigned char FAR *window;/*          size of window, wsize!=0 */
+/* 64   32 */ code const FAR *lcode;    /* ebp rbp  local strm->lencode */
+/* 72   36 */ code const FAR *dcode;    /*     r11  local strm->distcode */
+/* 80   40 */ size_t /*unsigned long */hold;       /* edx rdx  local strm->hold */
+/* 88   44 */ unsigned bits;            /* ebx rbx  local strm->bits */
+/* 92   48 */ unsigned wsize;           /*          window size */
+/* 96   52 */ unsigned write;           /*          window write index */
+/*100   56 */ unsigned lmask;           /*     r12  mask for lcode */
+/*104   60 */ unsigned dmask;           /*     r13  mask for dcode */
+/*108   64 */ unsigned len;             /*     r14  match length */
+/*112   68 */ unsigned dist;            /*     r15  match distance */
+/*116   72 */ unsigned status;          /*          set when state chng*/
+    } type_ar;
+#ifdef ASMINF
+
+void inflate_fast(strm, start)
+z_streamp strm;
+unsigned start;         /* inflate()'s starting value for strm->avail_out */
+{
+    struct inflate_state FAR *state;
+    type_ar ar;
+    void inffas8664fnc(struct inffast_ar * par);
+
+    
+
+#if (defined( __GNUC__ ) && defined( __amd64__ ) && ! defined( __i386 )) || (defined(_MSC_VER) && defined(_M_AMD64))
+#define PAD_AVAIL_IN 6
+#define PAD_AVAIL_OUT 258    
+#else
+#define PAD_AVAIL_IN 5
+#define PAD_AVAIL_OUT 257
+#endif
+
+    /* copy state to local variables */
+    state = (struct inflate_state FAR *)strm->state;
+
+    ar.in = strm->next_in;
+    ar.last = ar.in + (strm->avail_in - PAD_AVAIL_IN);
+    ar.out = strm->next_out;
+    ar.beg = ar.out - (start - strm->avail_out);
+    ar.end = ar.out + (strm->avail_out - PAD_AVAIL_OUT);
+    ar.wsize = state->wsize;
+    ar.write = state->write;
+    ar.window = state->window;
+    ar.hold = state->hold;
+    ar.bits = state->bits;
+    ar.lcode = state->lencode;
+    ar.dcode = state->distcode;
+    ar.lmask = (1U << state->lenbits) - 1;
+    ar.dmask = (1U << state->distbits) - 1;
+
+    /* decode literals and length/distances until end-of-block or not enough
+       input data or output space */
+
+    /* align in on 1/2 hold size boundary */
+    while (((size_t)(void *)ar.in & (sizeof(ar.hold) / 2 - 1)) != 0) {
+        ar.hold += (unsigned long)*ar.in++ << ar.bits;
+        ar.bits += 8;
+    }
+
+    inffas8664fnc(&ar);
+
+    if (ar.status > 1) {
+        if (ar.status == 2)
+            strm->msg = "invalid literal/length code";
+        else if (ar.status == 3)
+            strm->msg = "invalid distance code";
+        else
+            strm->msg = "invalid distance too far back";
+        state->mode = BAD;
+    }
+    else if ( ar.status == 1 ) {
+        state->mode = TYPE;
+    }
+
+    /* return unused bytes (on entry, bits < 8, so in won't go too far back) */
+    ar.len = ar.bits >> 3;
+    ar.in -= ar.len;
+    ar.bits -= ar.len << 3;
+    ar.hold &= (1U << ar.bits) - 1;
+
+    /* update state and return */
+    strm->next_in = ar.in;
+    strm->next_out = ar.out;
+    strm->avail_in = (unsigned)(ar.in < ar.last ?
+                                PAD_AVAIL_IN + (ar.last - ar.in) :
+                                PAD_AVAIL_IN - (ar.in - ar.last));
+    strm->avail_out = (unsigned)(ar.out < ar.end ?
+                                 PAD_AVAIL_OUT + (ar.end - ar.out) :
+                                 PAD_AVAIL_OUT - (ar.out - ar.end));
+    state->hold = (unsigned long)ar.hold;
+    state->bits = ar.bits;
+    return;
+}
+
+#endif
diff --git a/updater/zlib123/contrib/masmx64/inffasx64.asm b/updater/zlib123/contrib/masmx64/inffasx64.asm
new file mode 100644
index 0000000..b5d93a2
--- /dev/null
+++ b/updater/zlib123/contrib/masmx64/inffasx64.asm
@@ -0,0 +1,392 @@
+; inffasx64.asm is a hand tuned assembler version of inffast.c - fast decoding
+; version for AMD64 on Windows using Microsoft C compiler
+;
+; inffasx64.asm is automatically convert from AMD64 portion of inffas86.c
+; inffasx64.asm is called by inffas8664.c, which contain more info.
+
+
+; to compile this file, I use option
+;   ml64.exe /Flinffasx64 /c /Zi inffasx64.asm
+;   with Microsoft Macro Assembler (x64) for AMD64
+;
+;   ml64.exe is given with Visual Studio 2005, Windows 2003 server DDK
+;
+;   (you can get Windows 2003 server DDK with ml64 and cl.exe for AMD64 from 
+;      http://www.microsoft.com/whdc/devtools/ddk/default.mspx for low price)
+;
+
+.code
+inffas8664fnc PROC
+
+; see http://weblogs.asp.net/oldnewthing/archive/2004/01/14/58579.aspx and
+; http://msdn.microsoft.com/library/en-us/kmarch/hh/kmarch/64bitAMD_8e951dd2-ee77-4728-8702-55ce4b5dd24a.xml.asp
+;
+; All registers must be preserved across the call, except for
+;   rax, rcx, rdx, r8, r-9, r10, and r11, which are scratch.
+
+
+	mov [rsp-8],rsi
+	mov [rsp-16],rdi
+	mov [rsp-24],r12
+	mov [rsp-32],r13
+	mov [rsp-40],r14
+	mov [rsp-48],r15
+	mov [rsp-56],rbx
+
+	mov rax,rcx
+
+	mov	[rax+8], rbp       ; /* save regs rbp and rsp */
+	mov	[rax], rsp
+
+	mov	rsp, rax          ; /* make rsp point to &ar */
+
+	mov	rsi, [rsp+16]      ; /* rsi  = in */
+	mov	rdi, [rsp+32]      ; /* rdi  = out */
+	mov	r9, [rsp+24]       ; /* r9   = last */
+	mov	r10, [rsp+48]      ; /* r10  = end */
+	mov	rbp, [rsp+64]      ; /* rbp  = lcode */
+	mov	r11, [rsp+72]      ; /* r11  = dcode */
+	mov	rdx, [rsp+80]      ; /* rdx  = hold */
+	mov	ebx, [rsp+88]      ; /* ebx  = bits */
+	mov	r12d, [rsp+100]    ; /* r12d = lmask */
+	mov	r13d, [rsp+104]    ; /* r13d = dmask */
+                                          ; /* r14d = len */
+                                          ; /* r15d = dist */
+
+
+	cld
+	cmp	r10, rdi
+	je	L_one_time           ; /* if only one decode left */
+	cmp	r9, rsi
+
+    jne L_do_loop
+
+
+L_one_time:
+	mov	r8, r12           ; /* r8 = lmask */
+	cmp	bl, 32
+	ja	L_get_length_code_one_time
+
+	lodsd                         ; /* eax = *(uint *)in++ */
+	mov	cl, bl            ; /* cl = bits, needs it for shifting */
+	add	bl, 32             ; /* bits += 32 */
+	shl	rax, cl
+	or	rdx, rax          ; /* hold |= *((uint *)in)++ << bits */
+	jmp	L_get_length_code_one_time
+
+ALIGN 4
+L_while_test:
+	cmp	r10, rdi
+	jbe	L_break_loop
+	cmp	r9, rsi
+	jbe	L_break_loop
+
+L_do_loop:
+	mov	r8, r12           ; /* r8 = lmask */
+	cmp	bl, 32
+	ja	L_get_length_code    ; /* if (32 < bits) */
+
+	lodsd                         ; /* eax = *(uint *)in++ */
+	mov	cl, bl            ; /* cl = bits, needs it for shifting */
+	add	bl, 32             ; /* bits += 32 */
+	shl	rax, cl
+	or	rdx, rax          ; /* hold |= *((uint *)in)++ << bits */
+
+L_get_length_code:
+	and	r8, rdx            ; /* r8 &= hold */
+	mov	eax, [rbp+r8*4]  ; /* eax = lcode[hold & lmask] */
+
+	mov	cl, ah            ; /* cl = this.bits */
+	sub	bl, ah            ; /* bits -= this.bits */
+	shr	rdx, cl           ; /* hold >>= this.bits */
+
+	test	al, al
+	jnz	L_test_for_length_base ; /* if (op != 0) 45.7% */
+
+	mov	r8, r12            ; /* r8 = lmask */
+	shr	eax, 16            ; /* output this.val char */
+	stosb
+
+L_get_length_code_one_time:
+	and	r8, rdx            ; /* r8 &= hold */
+	mov	eax, [rbp+r8*4] ; /* eax = lcode[hold & lmask] */
+
+L_dolen:
+	mov	cl, ah            ; /* cl = this.bits */
+	sub	bl, ah            ; /* bits -= this.bits */
+	shr	rdx, cl           ; /* hold >>= this.bits */
+
+	test	al, al
+	jnz	L_test_for_length_base ; /* if (op != 0) 45.7% */
+
+	shr	eax, 16            ; /* output this.val char */
+	stosb
+	jmp	L_while_test
+
+ALIGN 4
+L_test_for_length_base:
+	mov	r14d, eax         ; /* len = this */
+	shr	r14d, 16           ; /* len = this.val */
+	mov	cl, al
+
+	test	al, 16
+	jz	L_test_for_second_level_length ; /* if ((op & 16) == 0) 8% */
+	and	cl, 15             ; /* op &= 15 */
+	jz	L_decode_distance    ; /* if (!op) */
+
+L_add_bits_to_len:
+	sub	bl, cl
+	xor	eax, eax
+	inc	eax
+	shl	eax, cl
+	dec	eax
+	and	eax, edx          ; /* eax &= hold */
+	shr	rdx, cl
+	add	r14d, eax         ; /* len += hold & mask[op] */
+
+L_decode_distance:
+	mov	r8, r13           ; /* r8 = dmask */
+	cmp	bl, 32
+	ja	L_get_distance_code  ; /* if (32 < bits) */
+
+	lodsd                         ; /* eax = *(uint *)in++ */
+	mov	cl, bl            ; /* cl = bits, needs it for shifting */
+	add	bl, 32             ; /* bits += 32 */
+	shl	rax, cl
+	or	rdx, rax          ; /* hold |= *((uint *)in)++ << bits */
+
+L_get_distance_code:
+	and	r8, rdx           ; /* r8 &= hold */
+	mov	eax, [r11+r8*4] ; /* eax = dcode[hold & dmask] */
+
+L_dodist:
+	mov	r15d, eax         ; /* dist = this */
+	shr	r15d, 16           ; /* dist = this.val */
+	mov	cl, ah
+	sub	bl, ah            ; /* bits -= this.bits */
+	shr	rdx, cl           ; /* hold >>= this.bits */
+	mov	cl, al            ; /* cl = this.op */
+
+	test	al, 16             ; /* if ((op & 16) == 0) */
+	jz	L_test_for_second_level_dist
+	and	cl, 15             ; /* op &= 15 */
+	jz	L_check_dist_one
+
+L_add_bits_to_dist:
+	sub	bl, cl
+	xor	eax, eax
+	inc	eax
+	shl	eax, cl
+	dec	eax                 ; /* (1 << op) - 1 */
+	and	eax, edx          ; /* eax &= hold */
+	shr	rdx, cl
+	add	r15d, eax         ; /* dist += hold & ((1 << op) - 1) */
+
+L_check_window:
+	mov	r8, rsi           ; /* save in so from can use it's reg */
+	mov	rax, rdi
+	sub	rax, [rsp+40]      ; /* nbytes = out - beg */
+
+	cmp	eax, r15d
+	jb	L_clip_window        ; /* if (dist > nbytes) 4.2% */
+
+	mov	ecx, r14d         ; /* ecx = len */
+	mov	rsi, rdi
+	sub	rsi, r15          ; /* from = out - dist */
+
+	sar	ecx, 1
+	jnc	L_copy_two           ; /* if len % 2 == 0 */
+
+	rep     movsw
+	mov	al, [rsi]
+	mov	[rdi], al
+	inc	rdi
+
+	mov	rsi, r8           ; /* move in back to %rsi, toss from */
+	jmp	L_while_test
+
+L_copy_two:
+	rep     movsw
+	mov	rsi, r8           ; /* move in back to %rsi, toss from */
+	jmp	L_while_test
+
+ALIGN 4
+L_check_dist_one:
+	cmp	r15d, 1            ; /* if dist 1, is a memset */
+	jne	L_check_window
+	cmp	[rsp+40], rdi      ; /* if out == beg, outside window */
+	je	L_check_window
+
+	mov	ecx, r14d         ; /* ecx = len */
+	mov	al, [rdi-1]
+	mov	ah, al
+
+	sar	ecx, 1
+	jnc	L_set_two
+	mov	[rdi], al
+	inc	rdi
+
+L_set_two:
+	rep     stosw
+	jmp	L_while_test
+
+ALIGN 4
+L_test_for_second_level_length:
+	test	al, 64
+	jnz	L_test_for_end_of_block ; /* if ((op & 64) != 0) */
+
+	xor	eax, eax
+	inc	eax
+	shl	eax, cl
+	dec	eax
+	and	eax, edx         ; /* eax &= hold */
+	add	eax, r14d        ; /* eax += len */
+	mov	eax, [rbp+rax*4] ; /* eax = lcode[val+(hold&mask[op])]*/
+	jmp	L_dolen
+
+ALIGN 4
+L_test_for_second_level_dist:
+	test	al, 64
+	jnz	L_invalid_distance_code ; /* if ((op & 64) != 0) */
+
+	xor	eax, eax
+	inc	eax
+	shl	eax, cl
+	dec	eax
+	and	eax, edx         ; /* eax &= hold */
+	add	eax, r15d        ; /* eax += dist */
+	mov	eax, [r11+rax*4] ; /* eax = dcode[val+(hold&mask[op])]*/
+	jmp	L_dodist
+
+ALIGN 4
+L_clip_window:
+	mov	ecx, eax         ; /* ecx = nbytes */
+	mov	eax, [rsp+92]     ; /* eax = wsize, prepare for dist cmp */
+	neg	ecx                ; /* nbytes = -nbytes */
+
+	cmp	eax, r15d
+	jb	L_invalid_distance_too_far ; /* if (dist > wsize) */
+
+	add	ecx, r15d         ; /* nbytes = dist - nbytes */
+	cmp	dword ptr [rsp+96], 0
+	jne	L_wrap_around_window ; /* if (write != 0) */
+
+	mov	rsi, [rsp+56]     ; /* from  = window */
+	sub	eax, ecx         ; /* eax  -= nbytes */
+	add	rsi, rax         ; /* from += wsize - nbytes */
+
+	mov	eax, r14d        ; /* eax = len */
+	cmp	r14d, ecx
+	jbe	L_do_copy           ; /* if (nbytes >= len) */
+
+	sub	eax, ecx         ; /* eax -= nbytes */
+	rep     movsb
+	mov	rsi, rdi
+	sub	rsi, r15         ; /* from = &out[ -dist ] */
+	jmp	L_do_copy
+
+ALIGN 4
+L_wrap_around_window:
+	mov	eax, [rsp+96]     ; /* eax = write */
+	cmp	ecx, eax
+	jbe	L_contiguous_in_window ; /* if (write >= nbytes) */
+
+	mov	esi, [rsp+92]     ; /* from  = wsize */
+	add	rsi, [rsp+56]     ; /* from += window */
+	add	rsi, rax         ; /* from += write */
+	sub	rsi, rcx         ; /* from -= nbytes */
+	sub	ecx, eax         ; /* nbytes -= write */
+
+	mov	eax, r14d        ; /* eax = len */
+	cmp	eax, ecx
+	jbe	L_do_copy           ; /* if (nbytes >= len) */
+
+	sub	eax, ecx         ; /* len -= nbytes */
+	rep     movsb
+	mov	rsi, [rsp+56]     ; /* from = window */
+	mov	ecx, [rsp+96]     ; /* nbytes = write */
+	cmp	eax, ecx
+	jbe	L_do_copy           ; /* if (nbytes >= len) */
+
+	sub	eax, ecx         ; /* len -= nbytes */
+	rep     movsb
+	mov	rsi, rdi
+	sub	rsi, r15         ; /* from = out - dist */
+	jmp	L_do_copy
+
+ALIGN 4
+L_contiguous_in_window:
+	mov	rsi, [rsp+56]     ; /* rsi = window */
+	add	rsi, rax
+	sub	rsi, rcx         ; /* from += write - nbytes */
+
+	mov	eax, r14d        ; /* eax = len */
+	cmp	eax, ecx
+	jbe	L_do_copy           ; /* if (nbytes >= len) */
+
+	sub	eax, ecx         ; /* len -= nbytes */
+	rep     movsb
+	mov	rsi, rdi
+	sub	rsi, r15         ; /* from = out - dist */
+	jmp	L_do_copy           ; /* if (nbytes >= len) */
+
+ALIGN 4
+L_do_copy:
+	mov	ecx, eax         ; /* ecx = len */
+	rep     movsb
+
+	mov	rsi, r8          ; /* move in back to %esi, toss from */
+	jmp	L_while_test
+
+L_test_for_end_of_block:
+	test	al, 32
+	jz	L_invalid_literal_length_code
+	mov	dword ptr [rsp+116], 1
+	jmp	L_break_loop_with_status
+
+L_invalid_literal_length_code:
+	mov	dword ptr [rsp+116], 2
+	jmp	L_break_loop_with_status
+
+L_invalid_distance_code:
+	mov	dword ptr [rsp+116], 3
+	jmp	L_break_loop_with_status
+
+L_invalid_distance_too_far:
+	mov	dword ptr [rsp+116], 4
+	jmp	L_break_loop_with_status
+
+L_break_loop:
+	mov	dword ptr [rsp+116], 0
+
+L_break_loop_with_status:
+; /* put in, out, bits, and hold back into ar and pop esp */
+	mov	[rsp+16], rsi     ; /* in */
+	mov	[rsp+32], rdi     ; /* out */
+	mov	[rsp+88], ebx     ; /* bits */
+	mov	[rsp+80], rdx     ; /* hold */
+
+	mov	rax, [rsp]       ; /* restore rbp and rsp */
+	mov	rbp, [rsp+8]
+	mov	rsp, rax
+
+
+
+	mov rsi,[rsp-8]
+	mov rdi,[rsp-16]
+	mov r12,[rsp-24]
+	mov r13,[rsp-32]
+	mov r14,[rsp-40]
+	mov r15,[rsp-48]
+	mov rbx,[rsp-56]
+	
+    ret 0
+;          :
+;          : "m" (ar)
+;          : "memory", "%rax", "%rbx", "%rcx", "%rdx", "%rsi", "%rdi",
+;            "%r8", "%r9", "%r10", "%r11", "%r12", "%r13", "%r14", "%r15"
+;    );
+
+inffas8664fnc 	ENDP
+;_TEXT	ENDS
+END
diff --git a/updater/zlib123/contrib/masmx64/inffasx64.obj b/updater/zlib123/contrib/masmx64/inffasx64.obj
new file mode 100644
index 0000000..8df5d82
--- /dev/null
+++ b/updater/zlib123/contrib/masmx64/inffasx64.obj
diff --git a/updater/zlib123/contrib/masmx64/readme.txt b/updater/zlib123/contrib/masmx64/readme.txt
new file mode 100644
index 0000000..ee03115
--- /dev/null
+++ b/updater/zlib123/contrib/masmx64/readme.txt
@@ -0,0 +1,28 @@
+Summary
+-------
+This directory contains ASM implementations of the functions
+longest_match() and inflate_fast(), for 64 bits x86 (both AMD64 and Intel EM64t),
+for use with Microsoft Macro Assembler (x64) for AMD64 and Microsoft C++ 64 bits.
+
+gvmat64.asm is written by Gilles Vollant (2005), by using Brian Raiter 686/32 bits
+   assembly optimized version from Jean-loup Gailly original longest_match function
+
+inffasx64.asm and inffas8664.c were written by Chris Anderson, by optimizing
+   original function from Mark Adler
+
+Use instructions
+----------------
+Copy these files into the zlib source directory.
+
+define ASMV and ASMINF in your project. Include inffas8664.c in your source tree,
+and inffasx64.obj and gvmat64.obj as object to link.
+
+
+Build instructions
+------------------
+run bld_64.bat with Microsoft Macro Assembler (x64) for AMD64 (ml64.exe)
+
+ml64.exe is given with Visual Studio 2005, Windows 2003 server DDK
+
+You can get Windows 2003 server DDK with ml64 and cl for AMD64 from 
+  http://www.microsoft.com/whdc/devtools/ddk/default.mspx for low price)
diff --git a/updater/zlib123/contrib/masmx86/bld_ml32.bat b/updater/zlib123/contrib/masmx86/bld_ml32.bat
new file mode 100644
index 0000000..99144d0
--- /dev/null
+++ b/updater/zlib123/contrib/masmx86/bld_ml32.bat
@@ -0,0 +1,2 @@
+ml /coff /Zi /c /Flgvmat32.lst  gvmat32.asm 
+ml /coff /Zi /c /Flinffas32.lst inffas32.asm 
diff --git a/updater/zlib123/contrib/masmx86/gvmat32.asm b/updater/zlib123/contrib/masmx86/gvmat32.asm
new file mode 100644
index 0000000..874bb2d
--- /dev/null
+++ b/updater/zlib123/contrib/masmx86/gvmat32.asm
@@ -0,0 +1,972 @@
+; gvmat32.asm -- Asm portion of the optimized longest_match for 32 bits x86
+; Copyright (C) 1995-1996 Jean-loup Gailly and Gilles Vollant.
+; File written by Gilles Vollant, by modifiying the longest_match
+;  from Jean-loup Gailly in deflate.c
+;
+;         http://www.zlib.net
+;         http://www.winimage.com/zLibDll
+;         http://www.muppetlabs.com/~breadbox/software/assembly.html
+;
+; For Visual C++ 4.x and higher and ML 6.x and higher
+;   ml.exe is in directory \MASM611C of Win95 DDK
+;   ml.exe is also distributed in http://www.masm32.com/masmdl.htm
+;    and in VC++2003 toolkit at http://msdn.microsoft.com/visualc/vctoolkit2003/
+;
+; this file contain two implementation of longest_match
+;
+;  longest_match_7fff : written 1996 by Gilles Vollant optimized for 
+;            first Pentium. Assume s->w_mask == 0x7fff
+;  longest_match_686 : written by Brian raiter (1998), optimized for Pentium Pro
+;
+;  for using an seembly version of longest_match, you need define ASMV in project
+;  There is two way in using gvmat32.asm
+;
+;  A) Suggested method
+;    if you want include both longest_match_7fff and longest_match_686
+;    compile the asm file running
+;           ml /coff /Zi /Flgvmat32.lst /c gvmat32.asm
+;    and include gvmat32c.c in your project
+;    if you have an old cpu (386,486 or first Pentium) and s->w_mask==0x7fff,
+;        longest_match_7fff will be used
+;    if you have a more modern CPU (Pentium Pro, II and higher)
+;        longest_match_686 will be used
+;    on old cpu with s->w_mask!=0x7fff, longest_match_686 will be used,
+;        but this is not a sitation you'll find often
+;
+;  B) Alternative
+;    if you are not interresed in old cpu performance and want the smaller
+;       binaries possible
+;
+;    compile the asm file running
+;           ml /coff /Zi /c /Flgvmat32.lst /DNOOLDPENTIUMCODE gvmat32.asm
+;    and do not include gvmat32c.c in your project (ou define also 
+;              NOOLDPENTIUMCODE)
+;
+; note : as I known, longest_match_686 is very faster than longest_match_7fff
+;        on pentium Pro/II/III, faster (but less) in P4, but it seem
+;        longest_match_7fff can be faster (very very litte) on AMD Athlon64/K8
+;
+; see below : zlib1222add must be adjuster if you use a zlib version < 1.2.2.2
+
+;uInt longest_match_7fff(s, cur_match)
+;    deflate_state *s;
+;    IPos cur_match;                             /* current match */
+
+    NbStack         equ     76
+    cur_match       equ     dword ptr[esp+NbStack-0]
+    str_s           equ     dword ptr[esp+NbStack-4]
+; 5 dword on top (ret,ebp,esi,edi,ebx)
+    adrret          equ     dword ptr[esp+NbStack-8]
+    pushebp         equ     dword ptr[esp+NbStack-12]
+    pushedi         equ     dword ptr[esp+NbStack-16]
+    pushesi         equ     dword ptr[esp+NbStack-20]
+    pushebx         equ     dword ptr[esp+NbStack-24]
+
+    chain_length    equ     dword ptr [esp+NbStack-28]
+    limit           equ     dword ptr [esp+NbStack-32]
+    best_len        equ     dword ptr [esp+NbStack-36]
+    window          equ     dword ptr [esp+NbStack-40]
+    prev            equ     dword ptr [esp+NbStack-44]
+    scan_start      equ      word ptr [esp+NbStack-48]
+    wmask           equ     dword ptr [esp+NbStack-52]
+    match_start_ptr equ     dword ptr [esp+NbStack-56]
+    nice_match      equ     dword ptr [esp+NbStack-60]
+    scan            equ     dword ptr [esp+NbStack-64]
+
+    windowlen       equ     dword ptr [esp+NbStack-68]
+    match_start     equ     dword ptr [esp+NbStack-72]
+    strend          equ     dword ptr [esp+NbStack-76]
+    NbStackAdd      equ     (NbStack-24)
+
+    .386p
+
+    name    gvmatch
+    .MODEL  FLAT
+
+
+
+;  all the +zlib1222add offsets are due to the addition of fields
+;  in zlib in the deflate_state structure since the asm code was first written
+;  (if you compile with zlib 1.0.4 or older, use "zlib1222add equ (-4)").
+;  (if you compile with zlib between 1.0.5 and 1.2.2.1, use "zlib1222add equ 0").
+;  if you compile with zlib 1.2.2.2 or later , use "zlib1222add equ 8").
+
+    zlib1222add         equ     8
+
+;  Note : these value are good with a 8 bytes boundary pack structure
+    dep_chain_length    equ     74h+zlib1222add
+    dep_window          equ     30h+zlib1222add
+    dep_strstart        equ     64h+zlib1222add
+    dep_prev_length     equ     70h+zlib1222add
+    dep_nice_match      equ     88h+zlib1222add
+    dep_w_size          equ     24h+zlib1222add
+    dep_prev            equ     38h+zlib1222add
+    dep_w_mask          equ     2ch+zlib1222add
+    dep_good_match      equ     84h+zlib1222add
+    dep_match_start     equ     68h+zlib1222add
+    dep_lookahead       equ     6ch+zlib1222add
+
+
+_TEXT                   segment
+
+IFDEF NOUNDERLINE
+   IFDEF NOOLDPENTIUMCODE
+            public  longest_match
+            public  match_init
+   ELSE            
+            public  longest_match_7fff
+            public  cpudetect32
+            public  longest_match_686
+   ENDIF
+ELSE
+   IFDEF NOOLDPENTIUMCODE
+            public  _longest_match
+            public  _match_init
+   ELSE
+            public  _longest_match_7fff
+            public  _cpudetect32
+            public  _longest_match_686
+   ENDIF
+ENDIF
+
+    MAX_MATCH           equ     258
+    MIN_MATCH           equ     3
+    MIN_LOOKAHEAD       equ     (MAX_MATCH+MIN_MATCH+1)
+
+
+
+IFNDEF NOOLDPENTIUMCODE
+IFDEF NOUNDERLINE
+longest_match_7fff   proc near
+ELSE
+_longest_match_7fff  proc near
+ENDIF
+
+    mov     edx,[esp+4]
+
+
+
+    push    ebp
+    push    edi
+    push    esi
+    push    ebx
+
+    sub     esp,NbStackAdd
+
+; initialize or check the variables used in match.asm.
+    mov     ebp,edx
+
+; chain_length = s->max_chain_length
+; if (prev_length>=good_match) chain_length >>= 2
+    mov     edx,[ebp+dep_chain_length]
+    mov     ebx,[ebp+dep_prev_length]
+    cmp     [ebp+dep_good_match],ebx
+    ja      noshr
+    shr     edx,2
+noshr:
+; we increment chain_length because in the asm, the --chain_lenght is in the beginning of the loop
+    inc     edx
+    mov     edi,[ebp+dep_nice_match]
+    mov     chain_length,edx
+    mov     eax,[ebp+dep_lookahead]
+    cmp     eax,edi
+; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
+    jae     nolookaheadnicematch
+    mov     edi,eax
+nolookaheadnicematch:
+; best_len = s->prev_length
+    mov     best_len,ebx
+
+; window = s->window
+    mov     esi,[ebp+dep_window]
+    mov     ecx,[ebp+dep_strstart]
+    mov     window,esi
+
+    mov     nice_match,edi
+; scan = window + strstart
+    add     esi,ecx
+    mov     scan,esi
+; dx = *window
+    mov     dx,word ptr [esi]
+; bx = *(window+best_len-1)
+    mov     bx,word ptr [esi+ebx-1]
+    add     esi,MAX_MATCH-1
+; scan_start = *scan
+    mov     scan_start,dx
+; strend = scan + MAX_MATCH-1
+    mov     strend,esi
+; bx = scan_end = *(window+best_len-1)
+
+;    IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
+;        s->strstart - (IPos)MAX_DIST(s) : NIL;
+
+    mov     esi,[ebp+dep_w_size]
+    sub     esi,MIN_LOOKAHEAD
+; here esi = MAX_DIST(s)
+    sub     ecx,esi
+    ja      nodist
+    xor     ecx,ecx
+nodist:
+    mov     limit,ecx
+
+; prev = s->prev
+    mov     edx,[ebp+dep_prev]
+    mov     prev,edx
+
+;
+    mov     edx,dword ptr [ebp+dep_match_start]
+    mov     bp,scan_start
+    mov     eax,cur_match
+    mov     match_start,edx
+
+    mov     edx,window
+    mov     edi,edx
+    add     edi,best_len
+    mov     esi,prev
+    dec     edi
+; windowlen = window + best_len -1
+    mov     windowlen,edi
+
+    jmp     beginloop2
+    align   4
+
+; here, in the loop
+;       eax = ax = cur_match
+;       ecx = limit
+;        bx = scan_end
+;        bp = scan_start
+;       edi = windowlen (window + best_len -1)
+;       esi = prev
+
+
+;// here; chain_length <=16
+normalbeg0add16:
+    add     chain_length,16
+    jz      exitloop
+normalbeg0:
+    cmp     word ptr[edi+eax],bx
+    je      normalbeg2noroll
+rcontlabnoroll:
+; cur_match = prev[cur_match & wmask]
+    and     eax,7fffh
+    mov     ax,word ptr[esi+eax*2]
+; if cur_match > limit, go to exitloop
+    cmp     ecx,eax
+    jnb     exitloop
+; if --chain_length != 0, go to exitloop
+    dec     chain_length
+    jnz     normalbeg0
+    jmp     exitloop
+
+normalbeg2noroll:
+; if (scan_start==*(cur_match+window)) goto normalbeg2
+    cmp     bp,word ptr[edx+eax]
+    jne     rcontlabnoroll
+    jmp     normalbeg2
+
+contloop3:
+    mov     edi,windowlen
+
+; cur_match = prev[cur_match & wmask]
+    and     eax,7fffh
+    mov     ax,word ptr[esi+eax*2]
+; if cur_match > limit, go to exitloop
+    cmp     ecx,eax
+jnbexitloopshort1:
+    jnb     exitloop
+; if --chain_length != 0, go to exitloop
+
+
+; begin the main loop
+beginloop2:
+    sub     chain_length,16+1
+; if chain_length <=16, don't use the unrolled loop
+    jna     normalbeg0add16
+
+do16:
+    cmp     word ptr[edi+eax],bx
+    je      normalbeg2dc0
+
+maccn   MACRO   lab
+    and     eax,7fffh
+    mov     ax,word ptr[esi+eax*2]
+    cmp     ecx,eax
+    jnb     exitloop
+    cmp     word ptr[edi+eax],bx
+    je      lab
+    ENDM
+
+rcontloop0:
+    maccn   normalbeg2dc1
+
+rcontloop1:
+    maccn   normalbeg2dc2
+
+rcontloop2:
+    maccn   normalbeg2dc3
+
+rcontloop3:
+    maccn   normalbeg2dc4
+
+rcontloop4:
+    maccn   normalbeg2dc5
+
+rcontloop5:
+    maccn   normalbeg2dc6
+
+rcontloop6:
+    maccn   normalbeg2dc7
+
+rcontloop7:
+    maccn   normalbeg2dc8
+
+rcontloop8:
+    maccn   normalbeg2dc9
+
+rcontloop9:
+    maccn   normalbeg2dc10
+
+rcontloop10:
+    maccn   short normalbeg2dc11
+
+rcontloop11:
+    maccn   short normalbeg2dc12
+
+rcontloop12:
+    maccn   short normalbeg2dc13
+
+rcontloop13:
+    maccn   short normalbeg2dc14
+
+rcontloop14:
+    maccn   short normalbeg2dc15
+
+rcontloop15:
+    and     eax,7fffh
+    mov     ax,word ptr[esi+eax*2]
+    cmp     ecx,eax
+    jnb     exitloop
+
+    sub     chain_length,16
+    ja      do16
+    jmp     normalbeg0add16
+
+;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;
+
+normbeg MACRO   rcontlab,valsub
+; if we are here, we know that *(match+best_len-1) == scan_end
+    cmp     bp,word ptr[edx+eax]
+; if (match != scan_start) goto rcontlab
+    jne     rcontlab
+; calculate the good chain_length, and we'll compare scan and match string
+    add     chain_length,16-valsub
+    jmp     iseq
+    ENDM
+
+
+normalbeg2dc11:
+    normbeg rcontloop11,11
+
+normalbeg2dc12:
+    normbeg short rcontloop12,12
+
+normalbeg2dc13:
+    normbeg short rcontloop13,13
+
+normalbeg2dc14:
+    normbeg short rcontloop14,14
+
+normalbeg2dc15:
+    normbeg short rcontloop15,15
+
+normalbeg2dc10:
+    normbeg rcontloop10,10
+
+normalbeg2dc9:
+    normbeg rcontloop9,9
+
+normalbeg2dc8:
+    normbeg rcontloop8,8
+
+normalbeg2dc7:
+    normbeg rcontloop7,7
+
+normalbeg2dc6:
+    normbeg rcontloop6,6
+
+normalbeg2dc5:
+    normbeg rcontloop5,5
+
+normalbeg2dc4:
+    normbeg rcontloop4,4
+
+normalbeg2dc3:
+    normbeg rcontloop3,3
+
+normalbeg2dc2:
+    normbeg rcontloop2,2
+
+normalbeg2dc1:
+    normbeg rcontloop1,1
+
+normalbeg2dc0:
+    normbeg rcontloop0,0
+
+
+; we go in normalbeg2 because *(ushf*)(match+best_len-1) == scan_end
+
+normalbeg2:
+    mov     edi,window
+
+    cmp     bp,word ptr[edi+eax]
+    jne     contloop3                   ; if *(ushf*)match != scan_start, continue
+
+iseq:
+; if we are here, we know that *(match+best_len-1) == scan_end
+; and (match == scan_start)
+
+    mov     edi,edx
+    mov     esi,scan                    ; esi = scan
+    add     edi,eax                     ; edi = window + cur_match = match
+
+    mov     edx,[esi+3]                 ; compare manually dword at match+3
+    xor     edx,[edi+3]                 ; and scan +3
+
+    jz      begincompare                ; if equal, go to long compare
+
+; we will determine the unmatch byte and calculate len (in esi)
+    or      dl,dl
+    je      eq1rr
+    mov     esi,3
+    jmp     trfinval
+eq1rr:
+    or      dx,dx
+    je      eq1
+
+    mov     esi,4
+    jmp     trfinval
+eq1:
+    and     edx,0ffffffh
+    jz      eq11
+    mov     esi,5
+    jmp     trfinval
+eq11:
+    mov     esi,6
+    jmp     trfinval
+
+begincompare:
+    ; here we now scan and match begin same
+    add     edi,6
+    add     esi,6
+    mov     ecx,(MAX_MATCH-(2+4))/4     ; scan for at most MAX_MATCH bytes
+    repe    cmpsd                       ; loop until mismatch
+
+    je      trfin                       ; go to trfin if not unmatch
+; we determine the unmatch byte
+    sub     esi,4
+    mov     edx,[edi-4]
+    xor     edx,[esi]
+
+    or      dl,dl
+    jnz     trfin
+    inc     esi
+
+    or      dx,dx
+    jnz     trfin
+    inc     esi
+
+    and     edx,0ffffffh
+    jnz     trfin
+    inc     esi
+
+trfin:
+    sub     esi,scan          ; esi = len
+trfinval:
+; here we have finised compare, and esi contain len of equal string
+    cmp     esi,best_len        ; if len > best_len, go newbestlen
+    ja      short newbestlen
+; now we restore edx, ecx and esi, for the big loop
+    mov     esi,prev
+    mov     ecx,limit
+    mov     edx,window
+    jmp     contloop3
+
+newbestlen:
+    mov     best_len,esi        ; len become best_len
+
+    mov     match_start,eax     ; save new position as match_start
+    cmp     esi,nice_match      ; if best_len >= nice_match, exit
+    jae     exitloop
+    mov     ecx,scan
+    mov     edx,window          ; restore edx=window
+    add     ecx,esi
+    add     esi,edx
+
+    dec     esi
+    mov     windowlen,esi       ; windowlen = window + best_len-1
+    mov     bx,[ecx-1]          ; bx = *(scan+best_len-1) = scan_end
+
+; now we restore ecx and esi, for the big loop :
+    mov     esi,prev
+    mov     ecx,limit
+    jmp     contloop3
+
+exitloop:
+; exit : s->match_start=match_start
+    mov     ebx,match_start
+    mov     ebp,str_s
+    mov     ecx,best_len
+    mov     dword ptr [ebp+dep_match_start],ebx
+    mov     eax,dword ptr [ebp+dep_lookahead]
+    cmp     ecx,eax
+    ja      minexlo
+    mov     eax,ecx
+minexlo:
+; return min(best_len,s->lookahead)
+
+; restore stack and register ebx,esi,edi,ebp
+    add     esp,NbStackAdd
+
+    pop     ebx
+    pop     esi
+    pop     edi
+    pop     ebp
+    ret
+InfoAuthor:
+; please don't remove this string !
+; Your are free use gvmat32 in any fre or commercial apps if you don't remove the string in the binary!
+    db     0dh,0ah,"GVMat32 optimised assembly code written 1996-98 by Gilles Vollant",0dh,0ah
+
+
+
+IFDEF NOUNDERLINE
+longest_match_7fff   endp
+ELSE
+_longest_match_7fff  endp
+ENDIF
+
+
+IFDEF NOUNDERLINE
+cpudetect32     proc near
+ELSE
+_cpudetect32    proc near
+ENDIF
+
+    push    ebx
+
+    pushfd                  ; push original EFLAGS
+    pop     eax             ; get original EFLAGS
+    mov     ecx, eax        ; save original EFLAGS
+    xor     eax, 40000h     ; flip AC bit in EFLAGS
+    push    eax             ; save new EFLAGS value on stack
+    popfd                   ; replace current EFLAGS value
+    pushfd                  ; get new EFLAGS
+    pop     eax             ; store new EFLAGS in EAX
+    xor     eax, ecx        ; can�t toggle AC bit, processor=80386
+    jz      end_cpu_is_386  ; jump if 80386 processor
+    push    ecx
+    popfd                   ; restore AC bit in EFLAGS first
+
+    pushfd
+    pushfd
+    pop     ecx
+
+    mov     eax, ecx        ; get original EFLAGS
+    xor     eax, 200000h    ; flip ID bit in EFLAGS
+    push    eax             ; save new EFLAGS value on stack
+    popfd                   ; replace current EFLAGS value
+    pushfd                  ; get new EFLAGS
+    pop     eax             ; store new EFLAGS in EAX
+    popfd                   ; restore original EFLAGS
+    xor     eax, ecx        ; can�t toggle ID bit,
+    je      is_old_486      ; processor=old
+
+    mov     eax,1
+    db      0fh,0a2h        ;CPUID
+
+exitcpudetect:
+    pop ebx
+    ret
+
+end_cpu_is_386:
+    mov     eax,0300h
+    jmp     exitcpudetect
+
+is_old_486:
+    mov     eax,0400h
+    jmp     exitcpudetect
+
+IFDEF NOUNDERLINE
+cpudetect32     endp
+ELSE
+_cpudetect32    endp
+ENDIF
+ENDIF
+
+MAX_MATCH       equ     258
+MIN_MATCH       equ     3
+MIN_LOOKAHEAD   equ     (MAX_MATCH + MIN_MATCH + 1)
+MAX_MATCH_8_     equ     ((MAX_MATCH + 7) AND 0FFF0h)
+
+
+;;; stack frame offsets
+
+chainlenwmask   equ  esp + 0    ; high word: current chain len
+                    ; low word: s->wmask
+window      equ  esp + 4    ; local copy of s->window
+windowbestlen   equ  esp + 8    ; s->window + bestlen
+scanstart   equ  esp + 16   ; first two bytes of string
+scanend     equ  esp + 12   ; last two bytes of string
+scanalign   equ  esp + 20   ; dword-misalignment of string
+nicematch   equ  esp + 24   ; a good enough match size
+bestlen     equ  esp + 28   ; size of best match so far
+scan        equ  esp + 32   ; ptr to string wanting match
+
+LocalVarsSize   equ 36
+;   saved ebx   byte esp + 36
+;   saved edi   byte esp + 40
+;   saved esi   byte esp + 44
+;   saved ebp   byte esp + 48
+;   return address  byte esp + 52
+deflatestate    equ  esp + 56   ; the function arguments
+curmatch    equ  esp + 60
+
+;;; Offsets for fields in the deflate_state structure. These numbers
+;;; are calculated from the definition of deflate_state, with the
+;;; assumption that the compiler will dword-align the fields. (Thus,
+;;; changing the definition of deflate_state could easily cause this
+;;; program to crash horribly, without so much as a warning at
+;;; compile time. Sigh.)
+
+dsWSize     equ 36+zlib1222add
+dsWMask     equ 44+zlib1222add
+dsWindow    equ 48+zlib1222add
+dsPrev      equ 56+zlib1222add
+dsMatchLen  equ 88+zlib1222add
+dsPrevMatch equ 92+zlib1222add
+dsStrStart  equ 100+zlib1222add
+dsMatchStart    equ 104+zlib1222add
+dsLookahead equ 108+zlib1222add
+dsPrevLen   equ 112+zlib1222add
+dsMaxChainLen   equ 116+zlib1222add
+dsGoodMatch equ 132+zlib1222add
+dsNiceMatch equ 136+zlib1222add
+
+
+;;; match.asm -- Pentium-Pro-optimized version of longest_match()
+;;; Written for zlib 1.1.2
+;;; Copyright (C) 1998 Brian Raiter <breadbox@muppetlabs.com>
+;;; You can look at http://www.muppetlabs.com/~breadbox/software/assembly.html
+;;;
+;;; This is free software; you can redistribute it and/or modify it
+;;; under the terms of the GNU General Public License.
+
+;GLOBAL _longest_match, _match_init
+
+
+;SECTION    .text
+
+;;; uInt longest_match(deflate_state *deflatestate, IPos curmatch)
+
+;_longest_match:
+IFDEF NOOLDPENTIUMCODE
+    IFDEF NOUNDERLINE
+    longest_match       proc near
+    ELSE
+    _longest_match      proc near
+    ENDIF
+ELSE
+    IFDEF NOUNDERLINE
+    longest_match_686   proc near
+    ELSE
+    _longest_match_686  proc near
+    ENDIF
+ENDIF
+
+;;; Save registers that the compiler may be using, and adjust esp to
+;;; make room for our stack frame.
+
+        push    ebp
+        push    edi
+        push    esi
+        push    ebx
+        sub esp, LocalVarsSize
+
+;;; Retrieve the function arguments. ecx will hold cur_match
+;;; throughout the entire function. edx will hold the pointer to the
+;;; deflate_state structure during the function's setup (before
+;;; entering the main loop.
+
+        mov edx, [deflatestate]
+        mov ecx, [curmatch]
+
+;;; uInt wmask = s->w_mask;
+;;; unsigned chain_length = s->max_chain_length;
+;;; if (s->prev_length >= s->good_match) {
+;;;     chain_length >>= 2;
+;;; }
+
+        mov eax, [edx + dsPrevLen]
+        mov ebx, [edx + dsGoodMatch]
+        cmp eax, ebx
+        mov eax, [edx + dsWMask]
+        mov ebx, [edx + dsMaxChainLen]
+        jl  LastMatchGood
+        shr ebx, 2
+LastMatchGood:
+
+;;; chainlen is decremented once beforehand so that the function can
+;;; use the sign flag instead of the zero flag for the exit test.
+;;; It is then shifted into the high word, to make room for the wmask
+;;; value, which it will always accompany.
+
+        dec ebx
+        shl ebx, 16
+        or  ebx, eax
+        mov [chainlenwmask], ebx
+
+;;; if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
+
+        mov eax, [edx + dsNiceMatch]
+        mov ebx, [edx + dsLookahead]
+        cmp ebx, eax
+        jl  LookaheadLess
+        mov ebx, eax
+LookaheadLess:  mov [nicematch], ebx
+
+;;; register Bytef *scan = s->window + s->strstart;
+
+        mov esi, [edx + dsWindow]
+        mov [window], esi
+        mov ebp, [edx + dsStrStart]
+        lea edi, [esi + ebp]
+        mov [scan], edi
+
+;;; Determine how many bytes the scan ptr is off from being
+;;; dword-aligned.
+
+        mov eax, edi
+        neg eax
+        and eax, 3
+        mov [scanalign], eax
+
+;;; IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
+;;;     s->strstart - (IPos)MAX_DIST(s) : NIL;
+
+        mov eax, [edx + dsWSize]
+        sub eax, MIN_LOOKAHEAD
+        sub ebp, eax
+        jg  LimitPositive
+        xor ebp, ebp
+LimitPositive:
+
+;;; int best_len = s->prev_length;
+
+        mov eax, [edx + dsPrevLen]
+        mov [bestlen], eax
+
+;;; Store the sum of s->window + best_len in esi locally, and in esi.
+
+        add esi, eax
+        mov [windowbestlen], esi
+
+;;; register ush scan_start = *(ushf*)scan;
+;;; register ush scan_end   = *(ushf*)(scan+best_len-1);
+;;; Posf *prev = s->prev;
+
+        movzx   ebx, word ptr [edi]
+        mov [scanstart], ebx
+        movzx   ebx, word ptr [edi + eax - 1]
+        mov [scanend], ebx
+        mov edi, [edx + dsPrev]
+
+;;; Jump into the main loop.
+
+        mov edx, [chainlenwmask]
+        jmp short LoopEntry
+
+align 4
+
+;;; do {
+;;;     match = s->window + cur_match;
+;;;     if (*(ushf*)(match+best_len-1) != scan_end ||
+;;;         *(ushf*)match != scan_start) continue;
+;;;     [...]
+;;; } while ((cur_match = prev[cur_match & wmask]) > limit
+;;;          && --chain_length != 0);
+;;;
+;;; Here is the inner loop of the function. The function will spend the
+;;; majority of its time in this loop, and majority of that time will
+;;; be spent in the first ten instructions.
+;;;
+;;; Within this loop:
+;;; ebx = scanend
+;;; ecx = curmatch
+;;; edx = chainlenwmask - i.e., ((chainlen << 16) | wmask)
+;;; esi = windowbestlen - i.e., (window + bestlen)
+;;; edi = prev
+;;; ebp = limit
+
+LookupLoop:
+        and ecx, edx
+        movzx   ecx, word ptr [edi + ecx*2]
+        cmp ecx, ebp
+        jbe LeaveNow
+        sub edx, 00010000h
+        js  LeaveNow
+LoopEntry:  movzx   eax, word ptr [esi + ecx - 1]
+        cmp eax, ebx
+        jnz LookupLoop
+        mov eax, [window]
+        movzx   eax, word ptr [eax + ecx]
+        cmp eax, [scanstart]
+        jnz LookupLoop
+
+;;; Store the current value of chainlen.
+
+        mov [chainlenwmask], edx
+
+;;; Point edi to the string under scrutiny, and esi to the string we
+;;; are hoping to match it up with. In actuality, esi and edi are
+;;; both pointed (MAX_MATCH_8 - scanalign) bytes ahead, and edx is
+;;; initialized to -(MAX_MATCH_8 - scanalign).
+
+        mov esi, [window]
+        mov edi, [scan]
+        add esi, ecx
+        mov eax, [scanalign]
+        mov edx, 0fffffef8h; -(MAX_MATCH_8)
+        lea edi, [edi + eax + 0108h] ;MAX_MATCH_8]
+        lea esi, [esi + eax + 0108h] ;MAX_MATCH_8]
+
+;;; Test the strings for equality, 8 bytes at a time. At the end,
+;;; adjust edx so that it is offset to the exact byte that mismatched.
+;;;
+;;; We already know at this point that the first three bytes of the
+;;; strings match each other, and they can be safely passed over before
+;;; starting the compare loop. So what this code does is skip over 0-3
+;;; bytes, as much as necessary in order to dword-align the edi
+;;; pointer. (esi will still be misaligned three times out of four.)
+;;;
+;;; It should be confessed that this loop usually does not represent
+;;; much of the total running time. Replacing it with a more
+;;; straightforward "rep cmpsb" would not drastically degrade
+;;; performance.
+
+LoopCmps:
+        mov eax, [esi + edx]
+        xor eax, [edi + edx]
+        jnz LeaveLoopCmps
+        mov eax, [esi + edx + 4]
+        xor eax, [edi + edx + 4]
+        jnz LeaveLoopCmps4
+        add edx, 8
+        jnz LoopCmps
+        jmp short LenMaximum
+LeaveLoopCmps4: add edx, 4
+LeaveLoopCmps:  test    eax, 0000FFFFh
+        jnz LenLower
+        add edx,  2
+        shr eax, 16
+LenLower:   sub al, 1
+        adc edx, 0
+
+;;; Calculate the length of the match. If it is longer than MAX_MATCH,
+;;; then automatically accept it as the best possible match and leave.
+
+        lea eax, [edi + edx]
+        mov edi, [scan]
+        sub eax, edi
+        cmp eax, MAX_MATCH
+        jge LenMaximum
+
+;;; If the length of the match is not longer than the best match we
+;;; have so far, then forget it and return to the lookup loop.
+
+        mov edx, [deflatestate]
+        mov ebx, [bestlen]
+        cmp eax, ebx
+        jg  LongerMatch
+        mov esi, [windowbestlen]
+        mov edi, [edx + dsPrev]
+        mov ebx, [scanend]
+        mov edx, [chainlenwmask]
+        jmp LookupLoop
+
+;;;         s->match_start = cur_match;
+;;;         best_len = len;
+;;;         if (len >= nice_match) break;
+;;;         scan_end = *(ushf*)(scan+best_len-1);
+
+LongerMatch:    mov ebx, [nicematch]
+        mov [bestlen], eax
+        mov [edx + dsMatchStart], ecx
+        cmp eax, ebx
+        jge LeaveNow
+        mov esi, [window]
+        add esi, eax
+        mov [windowbestlen], esi
+        movzx   ebx, word ptr [edi + eax - 1]
+        mov edi, [edx + dsPrev]
+        mov [scanend], ebx
+        mov edx, [chainlenwmask]
+        jmp LookupLoop
+
+;;; Accept the current string, with the maximum possible length.
+
+LenMaximum: mov edx, [deflatestate]
+        mov dword ptr [bestlen], MAX_MATCH
+        mov [edx + dsMatchStart], ecx
+
+;;; if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
+;;; return s->lookahead;
+
+LeaveNow:
+        mov edx, [deflatestate]
+        mov ebx, [bestlen]
+        mov eax, [edx + dsLookahead]
+        cmp ebx, eax
+        jg  LookaheadRet
+        mov eax, ebx
+LookaheadRet:
+
+;;; Restore the stack and return from whence we came.
+
+        add esp, LocalVarsSize
+        pop ebx
+        pop esi
+        pop edi
+        pop ebp
+
+        ret
+; please don't remove this string !
+; Your can freely use gvmat32 in any free or commercial app if you don't remove the string in the binary!
+    db     0dh,0ah,"asm686 with masm, optimised assembly code from Brian Raiter, written 1998",0dh,0ah
+
+
+IFDEF NOOLDPENTIUMCODE
+    IFDEF NOUNDERLINE
+    longest_match       endp
+    ELSE
+    _longest_match      endp
+    ENDIF
+
+    IFDEF NOUNDERLINE
+    match_init      proc near
+                    ret
+    match_init      endp
+    ELSE
+    _match_init     proc near
+                    ret
+    _match_init     endp
+    ENDIF    
+ELSE
+    IFDEF NOUNDERLINE
+    longest_match_686   endp
+    ELSE
+    _longest_match_686  endp
+    ENDIF
+ENDIF
+
+_TEXT   ends
+end
diff --git a/updater/zlib123/contrib/masmx86/gvmat32.obj b/updater/zlib123/contrib/masmx86/gvmat32.obj
new file mode 100644
index 0000000..ebb3262
--- /dev/null
+++ b/updater/zlib123/contrib/masmx86/gvmat32.obj
diff --git a/updater/zlib123/contrib/masmx86/gvmat32c.c b/updater/zlib123/contrib/masmx86/gvmat32c.c
new file mode 100644
index 0000000..7ad2b27
--- /dev/null
+++ b/updater/zlib123/contrib/masmx86/gvmat32c.c
@@ -0,0 +1,62 @@
+/* gvmat32.c -- C portion of the optimized longest_match for 32 bits x86
+ * Copyright (C) 1995-1996 Jean-loup Gailly and Gilles Vollant.
+ * File written by Gilles Vollant, by modifiying the longest_match
+ *  from Jean-loup Gailly in deflate.c
+ *  it prepare all parameters and call the assembly longest_match_gvasm
+ *  longest_match execute standard C code is wmask != 0x7fff
+ *     (assembly code is faster with a fixed wmask)
+ *
+ * Read comment at beginning of gvmat32.asm for more information
+ */
+
+#if defined(ASMV) && (!defined(NOOLDPENTIUMCODE))
+#include "deflate.h"
+
+/* if your C compiler don't add underline before function name,
+        define ADD_UNDERLINE_ASMFUNC */
+#ifdef ADD_UNDERLINE_ASMFUNC
+#define longest_match_7fff _longest_match_7fff
+#define longest_match_686  _longest_match_686
+#define cpudetect32        _cpudetect32
+#endif
+
+
+unsigned long cpudetect32();
+
+uInt longest_match_c(
+    deflate_state *s,
+    IPos cur_match);                             /* current match */
+
+
+uInt longest_match_7fff(
+    deflate_state *s,
+    IPos cur_match);                             /* current match */
+
+uInt longest_match_686(
+    deflate_state *s,
+    IPos cur_match);                             /* current match */
+
+
+static uInt iIsPPro=2;
+
+void match_init ()
+{
+    iIsPPro = (((cpudetect32()/0x100)&0xf)>=6) ? 1 : 0;
+}
+
+uInt longest_match(
+    deflate_state *s,
+    IPos cur_match)                             /* current match */
+{
+    if (iIsPPro!=0)
+        return longest_match_686(s,cur_match);
+
+    if (s->w_mask != 0x7fff)
+        return longest_match_686(s,cur_match);
+
+    /* now ((s->w_mask == 0x7fff) && (iIsPPro==0)) */
+        return longest_match_7fff(s,cur_match);
+}
+
+
+#endif /* defined(ASMV) && (!defined(NOOLDPENTIUMCODE)) */
diff --git a/updater/zlib123/contrib/masmx86/inffas32.asm b/updater/zlib123/contrib/masmx86/inffas32.asm
new file mode 100644
index 0000000..4a20512
--- /dev/null
+++ b/updater/zlib123/contrib/masmx86/inffas32.asm
@@ -0,0 +1,1083 @@
+;/* inffas32.asm is a hand tuned assembler version of inffast.c -- fast decoding
+; *
+; * inffas32.asm is derivated from inffas86.c, with translation of assembly code
+; *
+; * Copyright (C) 1995-2003 Mark Adler
+; * For conditions of distribution and use, see copyright notice in zlib.h
+; *
+; * Copyright (C) 2003 Chris Anderson <christop@charm.net>
+; * Please use the copyright conditions above.
+; *
+; * Mar-13-2003 -- Most of this is derived from inffast.S which is derived from
+; * the gcc -S output of zlib-1.2.0/inffast.c.  Zlib-1.2.0 is in beta release at
+; * the moment.  I have successfully compiled and tested this code with gcc2.96,
+; * gcc3.2, icc5.0, msvc6.0.  It is very close to the speed of inffast.S
+; * compiled with gcc -DNO_MMX, but inffast.S is still faster on the P3 with MMX
+; * enabled.  I will attempt to merge the MMX code into this version.  Newer
+; * versions of this and inffast.S can be found at
+; * http://www.eetbeetee.com/zlib/ and http://www.charm.net/~christop/zlib/
+; * 
+; * 2005 : modification by Gilles Vollant
+; */
+; For Visual C++ 4.x and higher and ML 6.x and higher
+;   ml.exe is in directory \MASM611C of Win95 DDK
+;   ml.exe is also distributed in http://www.masm32.com/masmdl.htm
+;    and in VC++2003 toolkit at http://msdn.microsoft.com/visualc/vctoolkit2003/
+;
+;
+;   compile with command line option
+;   ml  /coff /Zi /c /Flinffas32.lst inffas32.asm
+
+;   if you define NO_GZIP (see inflate.h), compile with
+;   ml  /coff /Zi /c /Flinffas32.lst /DNO_GUNZIP inffas32.asm
+
+
+; zlib122sup is 0 fort zlib 1.2.2.1 and lower
+; zlib122sup is 8 fort zlib 1.2.2.2 and more (with addition of dmax and head 
+;        in inflate_state in inflate.h)
+zlib1222sup      equ    8
+
+
+IFDEF GUNZIP
+  INFLATE_MODE_TYPE    equ 11
+  INFLATE_MODE_BAD     equ 26
+ELSE
+  IFNDEF NO_GUNZIP
+    INFLATE_MODE_TYPE    equ 11
+    INFLATE_MODE_BAD     equ 26
+  ELSE
+    INFLATE_MODE_TYPE    equ 3
+    INFLATE_MODE_BAD     equ 17
+  ENDIF
+ENDIF
+
+
+; 75 "inffast.S"
+;FILE "inffast.S"
+
+;;;GLOBAL _inflate_fast
+
+;;;SECTION .text
+
+
+
+	.586p
+	.mmx
+
+	name	inflate_fast_x86
+	.MODEL	FLAT
+
+_DATA			segment
+inflate_fast_use_mmx:
+	dd	1
+
+
+_TEXT			segment
+PUBLIC _inflate_fast
+
+ALIGN 4
+_inflate_fast:
+	jmp inflate_fast_entry
+
+
+
+ALIGN 4
+	db	'Fast decoding Code from Chris Anderson'
+	db	0
+
+ALIGN 4
+invalid_literal_length_code_msg:
+	db	'invalid literal/length code'
+	db	0
+
+ALIGN 4
+invalid_distance_code_msg:
+	db	'invalid distance code'
+	db	0
+
+ALIGN 4
+invalid_distance_too_far_msg:
+	db	'invalid distance too far back'
+	db	0
+
+
+ALIGN 4
+inflate_fast_mask:
+dd	0
+dd	1
+dd	3
+dd	7
+dd	15
+dd	31
+dd	63
+dd	127
+dd	255
+dd	511
+dd	1023
+dd	2047
+dd	4095
+dd	8191
+dd	16383
+dd	32767
+dd	65535
+dd	131071
+dd	262143
+dd	524287
+dd	1048575
+dd	2097151
+dd	4194303
+dd	8388607
+dd	16777215
+dd	33554431
+dd	67108863
+dd	134217727
+dd	268435455
+dd	536870911
+dd	1073741823
+dd	2147483647
+dd	4294967295
+
+
+mode_state	 equ	0	;/* state->mode	*/
+wsize_state	 equ	(32+zlib1222sup)	;/* state->wsize */
+write_state	 equ	(36+4+zlib1222sup)	;/* state->write */
+window_state	 equ	(40+4+zlib1222sup)	;/* state->window */
+hold_state	 equ	(44+4+zlib1222sup)	;/* state->hold	*/
+bits_state	 equ	(48+4+zlib1222sup)	;/* state->bits	*/
+lencode_state	 equ	(64+4+zlib1222sup)	;/* state->lencode */
+distcode_state	 equ	(68+4+zlib1222sup)	;/* state->distcode */
+lenbits_state	 equ	(72+4+zlib1222sup)	;/* state->lenbits */
+distbits_state	 equ	(76+4+zlib1222sup)	;/* state->distbits */
+
+
+;;SECTION .text
+; 205 "inffast.S"
+;GLOBAL	inflate_fast_use_mmx
+
+;SECTION .data
+
+
+; GLOBAL inflate_fast_use_mmx:object
+;.size inflate_fast_use_mmx, 4
+; 226 "inffast.S"
+;SECTION .text
+
+ALIGN 4
+inflate_fast_entry:
+	push  edi
+	push  esi
+	push  ebp
+	push  ebx
+	pushfd
+	sub  esp,64
+	cld
+
+
+
+
+	mov  esi, [esp+88]
+	mov  edi, [esi+28]
+
+
+
+
+
+
+
+	mov  edx, [esi+4]
+	mov  eax, [esi+0]
+
+	add  edx,eax
+	sub  edx,11
+
+	mov  [esp+44],eax
+	mov  [esp+20],edx
+
+	mov  ebp, [esp+92]
+	mov  ecx, [esi+16]
+	mov  ebx, [esi+12]
+
+	sub  ebp,ecx
+	neg  ebp
+	add  ebp,ebx
+
+	sub  ecx,257
+	add  ecx,ebx
+
+	mov  [esp+60],ebx
+	mov  [esp+40],ebp
+	mov  [esp+16],ecx
+; 285 "inffast.S"
+	mov  eax, [edi+lencode_state]
+	mov  ecx, [edi+distcode_state]
+
+	mov  [esp+8],eax
+	mov  [esp+12],ecx
+
+	mov  eax,1
+	mov  ecx, [edi+lenbits_state]
+	shl  eax,cl
+	dec  eax
+	mov  [esp+0],eax
+
+	mov  eax,1
+	mov  ecx, [edi+distbits_state]
+	shl  eax,cl
+	dec  eax
+	mov  [esp+4],eax
+
+	mov  eax, [edi+wsize_state]
+	mov  ecx, [edi+write_state]
+	mov  edx, [edi+window_state]
+
+	mov  [esp+52],eax
+	mov  [esp+48],ecx
+	mov  [esp+56],edx
+
+	mov  ebp, [edi+hold_state]
+	mov  ebx, [edi+bits_state]
+; 321 "inffast.S"
+	mov  esi, [esp+44]
+	mov  ecx, [esp+20]
+	cmp  ecx,esi
+	ja   L_align_long
+
+	add  ecx,11
+	sub  ecx,esi
+	mov  eax,12
+	sub  eax,ecx
+	lea  edi, [esp+28]
+	rep movsb
+	mov  ecx,eax
+	xor  eax,eax
+	rep stosb
+	lea  esi, [esp+28]
+	mov  [esp+20],esi
+	jmp  L_is_aligned
+
+
+L_align_long:
+	test  esi,3
+	jz   L_is_aligned
+	xor  eax,eax
+	mov  al, [esi]
+	inc  esi
+	mov  ecx,ebx
+	add  ebx,8
+	shl  eax,cl
+	or  ebp,eax
+	jmp L_align_long
+
+L_is_aligned:
+	mov  edi, [esp+60]
+; 366 "inffast.S"
+L_check_mmx:
+	cmp  dword ptr [inflate_fast_use_mmx],2
+	je   L_init_mmx
+	ja   L_do_loop
+
+	push  eax
+	push  ebx
+	push  ecx
+	push  edx
+	pushfd
+	mov  eax, [esp]
+	xor  dword ptr [esp],0200000h
+
+
+
+
+	popfd
+	pushfd
+	pop  edx
+	xor  edx,eax
+	jz   L_dont_use_mmx
+	xor  eax,eax
+	cpuid
+	cmp  ebx,0756e6547h
+	jne  L_dont_use_mmx
+	cmp  ecx,06c65746eh
+	jne  L_dont_use_mmx
+	cmp  edx,049656e69h
+	jne  L_dont_use_mmx
+	mov  eax,1
+	cpuid
+	shr  eax,8
+	and  eax,15
+	cmp  eax,6
+	jne  L_dont_use_mmx
+	test  edx,0800000h
+	jnz  L_use_mmx
+	jmp  L_dont_use_mmx
+L_use_mmx:
+	mov  dword ptr [inflate_fast_use_mmx],2
+	jmp  L_check_mmx_pop
+L_dont_use_mmx:
+	mov  dword ptr [inflate_fast_use_mmx],3
+L_check_mmx_pop:
+	pop  edx
+	pop  ecx
+	pop  ebx
+	pop  eax
+	jmp  L_check_mmx
+; 426 "inffast.S"
+ALIGN 4
+L_do_loop:
+; 437 "inffast.S"
+	cmp  bl,15
+	ja   L_get_length_code
+
+	xor  eax,eax
+	lodsw
+	mov  cl,bl
+	add  bl,16
+	shl  eax,cl
+	or  ebp,eax
+
+L_get_length_code:
+	mov  edx, [esp+0]
+	mov  ecx, [esp+8]
+	and  edx,ebp
+	mov  eax, [ecx+edx*4]
+
+L_dolen:
+
+
+
+
+
+
+	mov  cl,ah
+	sub  bl,ah
+	shr  ebp,cl
+
+
+
+
+
+
+	test  al,al
+	jnz   L_test_for_length_base
+
+	shr  eax,16
+	stosb
+
+L_while_test:
+
+
+	cmp  [esp+16],edi
+	jbe  L_break_loop
+
+	cmp  [esp+20],esi
+	ja   L_do_loop
+	jmp  L_break_loop
+
+L_test_for_length_base:
+; 502 "inffast.S"
+	mov  edx,eax
+	shr  edx,16
+	mov  cl,al
+
+	test  al,16
+	jz   L_test_for_second_level_length
+	and  cl,15
+	jz   L_save_len
+	cmp  bl,cl
+	jae  L_add_bits_to_len
+
+	mov  ch,cl
+	xor  eax,eax
+	lodsw
+	mov  cl,bl
+	add  bl,16
+	shl  eax,cl
+	or  ebp,eax
+	mov  cl,ch
+
+L_add_bits_to_len:
+	mov  eax,1
+	shl  eax,cl
+	dec  eax
+	sub  bl,cl
+	and  eax,ebp
+	shr  ebp,cl
+	add  edx,eax
+
+L_save_len:
+	mov  [esp+24],edx
+
+
+L_decode_distance:
+; 549 "inffast.S"
+	cmp  bl,15
+	ja   L_get_distance_code
+
+	xor  eax,eax
+	lodsw
+	mov  cl,bl
+	add  bl,16
+	shl  eax,cl
+	or  ebp,eax
+
+L_get_distance_code:
+	mov  edx, [esp+4]
+	mov  ecx, [esp+12]
+	and  edx,ebp
+	mov  eax, [ecx+edx*4]
+
+
+L_dodist:
+	mov  edx,eax
+	shr  edx,16
+	mov  cl,ah
+	sub  bl,ah
+	shr  ebp,cl
+; 584 "inffast.S"
+	mov  cl,al
+
+	test  al,16
+	jz  L_test_for_second_level_dist
+	and  cl,15
+	jz  L_check_dist_one
+	cmp  bl,cl
+	jae  L_add_bits_to_dist
+
+	mov  ch,cl
+	xor  eax,eax
+	lodsw
+	mov  cl,bl
+	add  bl,16
+	shl  eax,cl
+	or  ebp,eax
+	mov  cl,ch
+
+L_add_bits_to_dist:
+	mov  eax,1
+	shl  eax,cl
+	dec  eax
+	sub  bl,cl
+	and  eax,ebp
+	shr  ebp,cl
+	add  edx,eax
+	jmp  L_check_window
+
+L_check_window:
+; 625 "inffast.S"
+	mov  [esp+44],esi
+	mov  eax,edi
+	sub  eax, [esp+40]
+
+	cmp  eax,edx
+	jb   L_clip_window
+
+	mov  ecx, [esp+24]
+	mov  esi,edi
+	sub  esi,edx
+
+	sub  ecx,3
+	mov  al, [esi]
+	mov  [edi],al
+	mov  al, [esi+1]
+	mov  dl, [esi+2]
+	add  esi,3
+	mov  [edi+1],al
+	mov  [edi+2],dl
+	add  edi,3
+	rep movsb
+
+	mov  esi, [esp+44]
+	jmp  L_while_test
+
+ALIGN 4
+L_check_dist_one:
+	cmp  edx,1
+	jne  L_check_window
+	cmp  [esp+40],edi
+	je  L_check_window
+
+	dec  edi
+	mov  ecx, [esp+24]
+	mov  al, [edi]
+	sub  ecx,3
+
+	mov  [edi+1],al
+	mov  [edi+2],al
+	mov  [edi+3],al
+	add  edi,4
+	rep stosb
+
+	jmp  L_while_test
+
+ALIGN 4
+L_test_for_second_level_length:
+
+
+
+
+	test  al,64
+	jnz   L_test_for_end_of_block
+
+	mov  eax,1
+	shl  eax,cl
+	dec  eax
+	and  eax,ebp
+	add  eax,edx
+	mov  edx, [esp+8]
+	mov  eax, [edx+eax*4]
+	jmp  L_dolen
+
+ALIGN 4
+L_test_for_second_level_dist:
+
+
+
+
+	test  al,64
+	jnz   L_invalid_distance_code
+
+	mov  eax,1
+	shl  eax,cl
+	dec  eax
+	and  eax,ebp
+	add  eax,edx
+	mov  edx, [esp+12]
+	mov  eax, [edx+eax*4]
+	jmp  L_dodist
+
+ALIGN 4
+L_clip_window:
+; 721 "inffast.S"
+	mov  ecx,eax
+	mov  eax, [esp+52]
+	neg  ecx
+	mov  esi, [esp+56]
+
+	cmp  eax,edx
+	jb   L_invalid_distance_too_far
+
+	add  ecx,edx
+	cmp  dword ptr [esp+48],0
+	jne  L_wrap_around_window
+
+	sub  eax,ecx
+	add  esi,eax
+; 749 "inffast.S"
+	mov  eax, [esp+24]
+	cmp  eax,ecx
+	jbe  L_do_copy1
+
+	sub  eax,ecx
+	rep movsb
+	mov  esi,edi
+	sub  esi,edx
+	jmp  L_do_copy1
+
+	cmp  eax,ecx
+	jbe  L_do_copy1
+
+	sub  eax,ecx
+	rep movsb
+	mov  esi,edi
+	sub  esi,edx
+	jmp  L_do_copy1
+
+L_wrap_around_window:
+; 793 "inffast.S"
+	mov  eax, [esp+48]
+	cmp  ecx,eax
+	jbe  L_contiguous_in_window
+
+	add  esi, [esp+52]
+	add  esi,eax
+	sub  esi,ecx
+	sub  ecx,eax
+
+
+	mov  eax, [esp+24]
+	cmp  eax,ecx
+	jbe  L_do_copy1
+
+	sub  eax,ecx
+	rep movsb
+	mov  esi, [esp+56]
+	mov  ecx, [esp+48]
+	cmp  eax,ecx
+	jbe  L_do_copy1
+
+	sub  eax,ecx
+	rep movsb
+	mov  esi,edi
+	sub  esi,edx
+	jmp  L_do_copy1
+
+L_contiguous_in_window:
+; 836 "inffast.S"
+	add  esi,eax
+	sub  esi,ecx
+
+
+	mov  eax, [esp+24]
+	cmp  eax,ecx
+	jbe  L_do_copy1
+
+	sub  eax,ecx
+	rep movsb
+	mov  esi,edi
+	sub  esi,edx
+
+L_do_copy1:
+; 862 "inffast.S"
+	mov  ecx,eax
+	rep movsb
+
+	mov  esi, [esp+44]
+	jmp  L_while_test
+; 878 "inffast.S"
+ALIGN 4
+L_init_mmx:
+	emms
+
+
+
+
+
+	movd mm0,ebp
+	mov  ebp,ebx
+; 896 "inffast.S"
+	movd mm4,[esp+0]
+	movq mm3,mm4
+	movd mm5,[esp+4]
+	movq mm2,mm5
+	pxor mm1,mm1
+	mov  ebx, [esp+8]
+	jmp  L_do_loop_mmx
+
+ALIGN 4
+L_do_loop_mmx:
+	psrlq mm0,mm1
+
+	cmp  ebp,32
+	ja  L_get_length_code_mmx
+
+	movd mm6,ebp
+	movd mm7,[esi]
+	add  esi,4
+	psllq mm7,mm6
+	add  ebp,32
+	por mm0,mm7
+
+L_get_length_code_mmx:
+	pand mm4,mm0
+	movd eax,mm4
+	movq mm4,mm3
+	mov  eax, [ebx+eax*4]
+
+L_dolen_mmx:
+	movzx  ecx,ah
+	movd mm1,ecx
+	sub  ebp,ecx
+
+	test  al,al
+	jnz L_test_for_length_base_mmx
+
+	shr  eax,16
+	stosb
+
+L_while_test_mmx:
+
+
+	cmp  [esp+16],edi
+	jbe L_break_loop
+
+	cmp  [esp+20],esi
+	ja L_do_loop_mmx
+	jmp L_break_loop
+
+L_test_for_length_base_mmx:
+
+	mov  edx,eax
+	shr  edx,16
+
+	test  al,16
+	jz  L_test_for_second_level_length_mmx
+	and  eax,15
+	jz L_decode_distance_mmx
+
+	psrlq mm0,mm1
+	movd mm1,eax
+	movd ecx,mm0
+	sub  ebp,eax
+	and  ecx, [inflate_fast_mask+eax*4]
+	add  edx,ecx
+
+L_decode_distance_mmx:
+	psrlq mm0,mm1
+
+	cmp  ebp,32
+	ja L_get_dist_code_mmx
+
+	movd mm6,ebp
+	movd mm7,[esi]
+	add  esi,4
+	psllq mm7,mm6
+	add  ebp,32
+	por mm0,mm7
+
+L_get_dist_code_mmx:
+	mov  ebx, [esp+12]
+	pand mm5,mm0
+	movd eax,mm5
+	movq mm5,mm2
+	mov  eax, [ebx+eax*4]
+
+L_dodist_mmx:
+
+	movzx  ecx,ah
+	mov  ebx,eax
+	shr  ebx,16
+	sub  ebp,ecx
+	movd mm1,ecx
+
+	test  al,16
+	jz L_test_for_second_level_dist_mmx
+	and  eax,15
+	jz L_check_dist_one_mmx
+
+L_add_bits_to_dist_mmx:
+	psrlq mm0,mm1
+	movd mm1,eax
+	movd ecx,mm0
+	sub  ebp,eax
+	and  ecx, [inflate_fast_mask+eax*4]
+	add  ebx,ecx
+
+L_check_window_mmx:
+	mov  [esp+44],esi
+	mov  eax,edi
+	sub  eax, [esp+40]
+
+	cmp  eax,ebx
+	jb L_clip_window_mmx
+
+	mov  ecx,edx
+	mov  esi,edi
+	sub  esi,ebx
+
+	sub  ecx,3
+	mov  al, [esi]
+	mov  [edi],al
+	mov  al, [esi+1]
+	mov  dl, [esi+2]
+	add  esi,3
+	mov  [edi+1],al
+	mov  [edi+2],dl
+	add  edi,3
+	rep movsb
+
+	mov  esi, [esp+44]
+	mov  ebx, [esp+8]
+	jmp  L_while_test_mmx
+
+ALIGN 4
+L_check_dist_one_mmx:
+	cmp  ebx,1
+	jne  L_check_window_mmx
+	cmp  [esp+40],edi
+	je   L_check_window_mmx
+
+	dec  edi
+	mov  ecx,edx
+	mov  al, [edi]
+	sub  ecx,3
+
+	mov  [edi+1],al
+	mov  [edi+2],al
+	mov  [edi+3],al
+	add  edi,4
+	rep stosb
+
+	mov  ebx, [esp+8]
+	jmp  L_while_test_mmx
+
+ALIGN 4
+L_test_for_second_level_length_mmx:
+	test  al,64
+	jnz L_test_for_end_of_block
+
+	and  eax,15
+	psrlq mm0,mm1
+	movd ecx,mm0
+	and  ecx, [inflate_fast_mask+eax*4]
+	add  ecx,edx
+	mov  eax, [ebx+ecx*4]
+	jmp L_dolen_mmx
+
+ALIGN 4
+L_test_for_second_level_dist_mmx:
+	test  al,64
+	jnz L_invalid_distance_code
+
+	and  eax,15
+	psrlq mm0,mm1
+	movd ecx,mm0
+	and  ecx, [inflate_fast_mask+eax*4]
+	mov  eax, [esp+12]
+	add  ecx,ebx
+	mov  eax, [eax+ecx*4]
+	jmp  L_dodist_mmx
+
+ALIGN 4
+L_clip_window_mmx:
+
+	mov  ecx,eax
+	mov  eax, [esp+52]
+	neg  ecx
+	mov  esi, [esp+56]
+
+	cmp  eax,ebx
+	jb  L_invalid_distance_too_far
+
+	add  ecx,ebx
+	cmp  dword ptr [esp+48],0
+	jne  L_wrap_around_window_mmx
+
+	sub  eax,ecx
+	add  esi,eax
+
+	cmp  edx,ecx
+	jbe  L_do_copy1_mmx
+
+	sub  edx,ecx
+	rep movsb
+	mov  esi,edi
+	sub  esi,ebx
+	jmp  L_do_copy1_mmx
+
+	cmp  edx,ecx
+	jbe  L_do_copy1_mmx
+
+	sub  edx,ecx
+	rep movsb
+	mov  esi,edi
+	sub  esi,ebx
+	jmp  L_do_copy1_mmx
+
+L_wrap_around_window_mmx:
+
+	mov  eax, [esp+48]
+	cmp  ecx,eax
+	jbe  L_contiguous_in_window_mmx
+
+	add  esi, [esp+52]
+	add  esi,eax
+	sub  esi,ecx
+	sub  ecx,eax
+
+
+	cmp  edx,ecx
+	jbe  L_do_copy1_mmx
+
+	sub  edx,ecx
+	rep movsb
+	mov  esi, [esp+56]
+	mov  ecx, [esp+48]
+	cmp  edx,ecx
+	jbe  L_do_copy1_mmx
+
+	sub  edx,ecx
+	rep movsb
+	mov  esi,edi
+	sub  esi,ebx
+	jmp  L_do_copy1_mmx
+
+L_contiguous_in_window_mmx:
+
+	add  esi,eax
+	sub  esi,ecx
+
+
+	cmp  edx,ecx
+	jbe  L_do_copy1_mmx
+
+	sub  edx,ecx
+	rep movsb
+	mov  esi,edi
+	sub  esi,ebx
+
+L_do_copy1_mmx:
+
+
+	mov  ecx,edx
+	rep movsb
+
+	mov  esi, [esp+44]
+	mov  ebx, [esp+8]
+	jmp  L_while_test_mmx
+; 1174 "inffast.S"
+L_invalid_distance_code:
+
+
+
+
+
+	mov  ecx, invalid_distance_code_msg
+	mov  edx,INFLATE_MODE_BAD
+	jmp  L_update_stream_state
+
+L_test_for_end_of_block:
+
+
+
+
+
+	test  al,32
+	jz  L_invalid_literal_length_code
+
+	mov  ecx,0
+	mov  edx,INFLATE_MODE_TYPE
+	jmp  L_update_stream_state
+
+L_invalid_literal_length_code:
+
+
+
+
+
+	mov  ecx, invalid_literal_length_code_msg
+	mov  edx,INFLATE_MODE_BAD
+	jmp  L_update_stream_state
+
+L_invalid_distance_too_far:
+
+
+
+	mov  esi, [esp+44]
+	mov  ecx, invalid_distance_too_far_msg
+	mov  edx,INFLATE_MODE_BAD
+	jmp  L_update_stream_state
+
+L_update_stream_state:
+
+	mov  eax, [esp+88]
+	test  ecx,ecx
+	jz  L_skip_msg
+	mov  [eax+24],ecx
+L_skip_msg:
+	mov  eax, [eax+28]
+	mov  [eax+mode_state],edx
+	jmp  L_break_loop
+
+ALIGN 4
+L_break_loop:
+; 1243 "inffast.S"
+	cmp  dword ptr [inflate_fast_use_mmx],2
+	jne  L_update_next_in
+
+
+
+	mov  ebx,ebp
+
+L_update_next_in:
+; 1266 "inffast.S"
+	mov  eax, [esp+88]
+	mov  ecx,ebx
+	mov  edx, [eax+28]
+	shr  ecx,3
+	sub  esi,ecx
+	shl  ecx,3
+	sub  ebx,ecx
+	mov  [eax+12],edi
+	mov  [edx+bits_state],ebx
+	mov  ecx,ebx
+
+	lea  ebx, [esp+28]
+	cmp  [esp+20],ebx
+	jne  L_buf_not_used
+
+	sub  esi,ebx
+	mov  ebx, [eax+0]
+	mov  [esp+20],ebx
+	add  esi,ebx
+	mov  ebx, [eax+4]
+	sub  ebx,11
+	add  [esp+20],ebx
+
+L_buf_not_used:
+	mov  [eax+0],esi
+
+	mov  ebx,1
+	shl  ebx,cl
+	dec  ebx
+
+
+
+
+
+	cmp  dword ptr [inflate_fast_use_mmx],2
+	jne  L_update_hold
+
+
+
+	psrlq mm0,mm1
+	movd ebp,mm0
+
+	emms
+
+L_update_hold:
+
+
+
+	and  ebp,ebx
+	mov  [edx+hold_state],ebp
+
+
+
+
+	mov  ebx, [esp+20]
+	cmp  ebx,esi
+	jbe  L_last_is_smaller
+
+	sub  ebx,esi
+	add  ebx,11
+	mov  [eax+4],ebx
+	jmp  L_fixup_out
+L_last_is_smaller:
+	sub  esi,ebx
+	neg  esi
+	add  esi,11
+	mov  [eax+4],esi
+
+
+
+
+L_fixup_out:
+
+	mov  ebx, [esp+16]
+	cmp  ebx,edi
+	jbe  L_end_is_smaller
+
+	sub  ebx,edi
+	add  ebx,257
+	mov  [eax+16],ebx
+	jmp  L_done
+L_end_is_smaller:
+	sub  edi,ebx
+	neg  edi
+	add  edi,257
+	mov  [eax+16],edi
+
+
+
+
+
+L_done:
+	add  esp,64
+	popfd
+	pop  ebx
+	pop  ebp
+	pop  esi
+	pop  edi
+	ret
+
+_TEXT	ends
+end
diff --git a/updater/zlib123/contrib/masmx86/inffas32.obj b/updater/zlib123/contrib/masmx86/inffas32.obj
new file mode 100644
index 0000000..bd6664d
--- /dev/null
+++ b/updater/zlib123/contrib/masmx86/inffas32.obj
diff --git a/updater/zlib123/contrib/masmx86/mkasm.bat b/updater/zlib123/contrib/masmx86/mkasm.bat
new file mode 100644
index 0000000..70a51f8
--- /dev/null
+++ b/updater/zlib123/contrib/masmx86/mkasm.bat
@@ -0,0 +1,3 @@
+cl /DASMV /I..\.. /O2 /c gvmat32c.c
+ml /coff /Zi /c /Flgvmat32.lst gvmat32.asm
+ml /coff /Zi /c /Flinffas32.lst inffas32.asm
diff --git a/updater/zlib123/contrib/masmx86/readme.txt b/updater/zlib123/contrib/masmx86/readme.txt
new file mode 100644
index 0000000..e2975c5
--- /dev/null
+++ b/updater/zlib123/contrib/masmx86/readme.txt
@@ -0,0 +1,21 @@
+
+Summary
+-------
+This directory contains ASM implementations of the functions
+longest_match() and inflate_fast().
+
+
+Use instructions
+----------------
+Copy these files into the zlib source directory, then run the
+appropriate makefile, as suggested below.
+
+
+Build instructions
+------------------
+* With Microsoft C and MASM:
+nmake -f win32/Makefile.msc LOC="-DASMV -DASMINF" OBJA="gvmat32c.obj gvmat32.obj inffas32.obj"
+
+* With Borland C and TASM:
+make -f win32/Makefile.bor LOCAL_ZLIB="-DASMV -DASMINF" OBJA="gvmat32c.obj gvmat32.obj inffas32.obj" OBJPA="+gvmat32c.obj+gvmat32.obj+inffas32.obj"
+
diff --git a/updater/zlib123/contrib/minizip/ChangeLogUnzip b/updater/zlib123/contrib/minizip/ChangeLogUnzip
new file mode 100644
index 0000000..e62af14
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/ChangeLogUnzip
@@ -0,0 +1,67 @@
+Change in 1.01e (12 feb 05)
+- Fix in zipOpen2 for globalcomment (Rolf Kalbermatter)
+- Fix possible memory leak in unzip.c (Zoran Stevanovic)
+
+Change in 1.01b (20 may 04)
+- Integrate patch from Debian package (submited by Mark Brown)
+- Add tools mztools from Xavier Roche
+
+Change in 1.01 (8 may 04)
+- fix buffer overrun risk in unzip.c (Xavier Roche)
+- fix a minor buffer insecurity in minizip.c (Mike Whittaker)
+
+Change in 1.00: (10 sept 03)
+- rename to 1.00
+- cosmetic code change
+
+Change in 0.22: (19 May 03)
+- crypting support (unless you define NOCRYPT)
+- append file in existing zipfile
+
+Change in 0.21: (10 Mar 03)
+- bug fixes
+
+Change in 0.17: (27 Jan 02)
+- bug fixes
+
+Change in 0.16: (19 Jan 02)
+- Support of ioapi for virtualize zip file access
+
+Change in 0.15: (19 Mar 98)
+- fix memory leak in minizip.c
+
+Change in 0.14: (10 Mar 98)
+- fix bugs in minizip.c sample for zipping big file
+- fix problem in month in date handling
+- fix bug in unzlocal_GetCurrentFileInfoInternal in unzip.c for
+    comment handling
+
+Change in 0.13: (6 Mar 98)
+- fix bugs in zip.c
+- add real minizip sample
+
+Change in 0.12: (4 Mar 98)
+- add zip.c and zip.h for creates .zip file
+- fix change_file_date in miniunz.c for Unix (Jean-loup Gailly)
+- fix miniunz.c for file without specific record for directory
+
+Change in 0.11: (3 Mar 98)
+- fix bug in unzGetCurrentFileInfo for get extra field and comment
+- enhance miniunz sample, remove the bad unztst.c sample
+
+Change in 0.10: (2 Mar 98)
+- fix bug in unzReadCurrentFile
+- rename unzip* to unz* function and structure
+- remove Windows-like hungary notation variable name
+- modify some structure in unzip.h
+- add somes comment in source
+- remove unzipGetcCurrentFile function
+- replace ZUNZEXPORT by ZEXPORT
+- add unzGetLocalExtrafield for get the local extrafield info
+- add a new sample, miniunz.c
+
+Change in 0.4: (25 Feb 98)
+- suppress the type unzipFileInZip.
+  Only on file in the zipfile can be open at the same time
+- fix somes typo in code
+- added tm_unz structure in unzip_file_info (date/time in readable format)
diff --git a/updater/zlib123/contrib/minizip/Makefile b/updater/zlib123/contrib/minizip/Makefile
new file mode 100644
index 0000000..fbba3ac
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/Makefile
@@ -0,0 +1,25 @@
+CC=cc
+CFLAGS=-O -I../..
+
+UNZ_OBJS = miniunz.o unzip.o ioapi.o ../../libz.a
+ZIP_OBJS = minizip.o zip.o   ioapi.o ../../libz.a
+
+.c.o:
+	$(CC) -c $(CFLAGS) $*.c
+
+all: miniunz minizip
+
+miniunz:  $(UNZ_OBJS)
+	$(CC) $(CFLAGS) -o $@ $(UNZ_OBJS)
+
+minizip:  $(ZIP_OBJS)
+	$(CC) $(CFLAGS) -o $@ $(ZIP_OBJS)
+
+test:	miniunz minizip
+	./minizip test readme.txt
+	./miniunz -l test.zip
+	mv readme.txt readme.old
+	./miniunz test.zip
+
+clean:
+	/bin/rm -f *.o *~ minizip miniunz
diff --git a/updater/zlib123/contrib/minizip/crypt.h b/updater/zlib123/contrib/minizip/crypt.h
new file mode 100644
index 0000000..f14a628
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/crypt.h
@@ -0,0 +1,132 @@
+/* crypt.h -- base code for crypt/uncrypt ZIPfile
+
+
+   Version 1.01e, February 12th, 2005
+
+   Copyright (C) 1998-2005 Gilles Vollant
+
+   This code is a modified version of crypting code in Infozip distribution
+
+   The encryption/decryption parts of this source code (as opposed to the
+   non-echoing password parts) were originally written in Europe.  The
+   whole source package can be freely distributed, including from the USA.
+   (Prior to January 2000, re-export from the US was a violation of US law.)
+
+   This encryption code is a direct transcription of the algorithm from
+   Roger Schlafly, described by Phil Katz in the file appnote.txt.  This
+   file (appnote.txt) is distributed with the PKZIP program (even in the
+   version without encryption capabilities).
+
+   If you don't need crypting in your application, just define symbols
+   NOCRYPT and NOUNCRYPT.
+
+   This code support the "Traditional PKWARE Encryption".
+
+   The new AES encryption added on Zip format by Winzip (see the page
+   http://www.winzip.com/aes_info.htm ) and PKWare PKZip 5.x Strong
+   Encryption is not supported.
+*/
+
+#define CRC32(c, b) ((*(pcrc_32_tab+(((int)(c) ^ (b)) & 0xff))) ^ ((c) >> 8))
+
+/***********************************************************************
+ * Return the next byte in the pseudo-random sequence
+ */
+static int decrypt_byte(unsigned long* pkeys, const unsigned long* pcrc_32_tab)
+{
+    unsigned temp;  /* POTENTIAL BUG:  temp*(temp^1) may overflow in an
+                     * unpredictable manner on 16-bit systems; not a problem
+                     * with any known compiler so far, though */
+
+    temp = ((unsigned)(*(pkeys+2)) & 0xffff) | 2;
+    return (int)(((temp * (temp ^ 1)) >> 8) & 0xff);
+}
+
+/***********************************************************************
+ * Update the encryption keys with the next byte of plain text
+ */
+static int update_keys(unsigned long* pkeys,const unsigned long* pcrc_32_tab,int c)
+{
+    (*(pkeys+0)) = CRC32((*(pkeys+0)), c);
+    (*(pkeys+1)) += (*(pkeys+0)) & 0xff;
+    (*(pkeys+1)) = (*(pkeys+1)) * 134775813L + 1;
+    {
+      register int keyshift = (int)((*(pkeys+1)) >> 24);
+      (*(pkeys+2)) = CRC32((*(pkeys+2)), keyshift);
+    }
+    return c;
+}
+
+
+/***********************************************************************
+ * Initialize the encryption keys and the random header according to
+ * the given password.
+ */
+static void init_keys(const char* passwd,unsigned long* pkeys,const unsigned long* pcrc_32_tab)
+{
+    *(pkeys+0) = 305419896L;
+    *(pkeys+1) = 591751049L;
+    *(pkeys+2) = 878082192L;
+    while (*passwd != '\0') {
+        update_keys(pkeys,pcrc_32_tab,(int)*passwd);
+        passwd++;
+    }
+}
+
+#define zdecode(pkeys,pcrc_32_tab,c) \
+    (update_keys(pkeys,pcrc_32_tab,c ^= decrypt_byte(pkeys,pcrc_32_tab)))
+
+#define zencode(pkeys,pcrc_32_tab,c,t) \
+    (t=decrypt_byte(pkeys,pcrc_32_tab), update_keys(pkeys,pcrc_32_tab,c), t^(c))
+
+#ifdef INCLUDECRYPTINGCODE_IFCRYPTALLOWED
+
+#define RAND_HEAD_LEN  12
+   /* "last resort" source for second part of crypt seed pattern */
+#  ifndef ZCR_SEED2
+#    define ZCR_SEED2 3141592654UL     /* use PI as default pattern */
+#  endif
+
+static int crypthead(passwd, buf, bufSize, pkeys, pcrc_32_tab, crcForCrypting)
+    const char *passwd;         /* password string */
+    unsigned char *buf;         /* where to write header */
+    int bufSize;
+    unsigned long* pkeys;
+    const unsigned long* pcrc_32_tab;
+    unsigned long crcForCrypting;
+{
+    int n;                       /* index in random header */
+    int t;                       /* temporary */
+    int c;                       /* random byte */
+    unsigned char header[RAND_HEAD_LEN-2]; /* random header */
+    static unsigned calls = 0;   /* ensure different random header each time */
+
+    if (bufSize<RAND_HEAD_LEN)
+      return 0;
+
+    /* First generate RAND_HEAD_LEN-2 random bytes. We encrypt the
+     * output of rand() to get less predictability, since rand() is
+     * often poorly implemented.
+     */
+    if (++calls == 1)
+    {
+        srand((unsigned)(time(NULL) ^ ZCR_SEED2));
+    }
+    init_keys(passwd, pkeys, pcrc_32_tab);
+    for (n = 0; n < RAND_HEAD_LEN-2; n++)
+    {
+        c = (rand() >> 7) & 0xff;
+        header[n] = (unsigned char)zencode(pkeys, pcrc_32_tab, c, t);
+    }
+    /* Encrypt random header (last two bytes is high word of crc) */
+    init_keys(passwd, pkeys, pcrc_32_tab);
+    for (n = 0; n < RAND_HEAD_LEN-2; n++)
+    {
+        buf[n] = (unsigned char)zencode(pkeys, pcrc_32_tab, header[n], t);
+    }
+    buf[n++] = zencode(pkeys, pcrc_32_tab, (int)(crcForCrypting >> 16) & 0xff, t);
+    buf[n++] = zencode(pkeys, pcrc_32_tab, (int)(crcForCrypting >> 24) & 0xff, t);
+    return n;
+}
+
+#endif
diff --git a/updater/zlib123/contrib/minizip/ioapi.c b/updater/zlib123/contrib/minizip/ioapi.c
new file mode 100644
index 0000000..d055ed0
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/ioapi.c
@@ -0,0 +1,177 @@
+/* ioapi.c -- IO base function header for compress/uncompress .zip
+   files using zlib + zip or unzip API
+
+   Version 1.01e, February 12th, 2005
+
+   Copyright (C) 1998-2005 Gilles Vollant
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+
+#include "zlib.h"
+#include "ioapi.h"
+
+
+
+/* I've found an old Unix (a SunOS 4.1.3_U1) without all SEEK_* defined.... */
+
+#ifndef SEEK_CUR
+#define SEEK_CUR    1
+#endif
+
+#ifndef SEEK_END
+#define SEEK_END    2
+#endif
+
+#ifndef SEEK_SET
+#define SEEK_SET    0
+#endif
+
+voidpf ZCALLBACK fopen_file_func OF((
+   voidpf opaque,
+   const char* filename,
+   int mode));
+
+uLong ZCALLBACK fread_file_func OF((
+   voidpf opaque,
+   voidpf stream,
+   void* buf,
+   uLong size));
+
+uLong ZCALLBACK fwrite_file_func OF((
+   voidpf opaque,
+   voidpf stream,
+   const void* buf,
+   uLong size));
+
+long ZCALLBACK ftell_file_func OF((
+   voidpf opaque,
+   voidpf stream));
+
+long ZCALLBACK fseek_file_func OF((
+   voidpf opaque,
+   voidpf stream,
+   uLong offset,
+   int origin));
+
+int ZCALLBACK fclose_file_func OF((
+   voidpf opaque,
+   voidpf stream));
+
+int ZCALLBACK ferror_file_func OF((
+   voidpf opaque,
+   voidpf stream));
+
+
+voidpf ZCALLBACK fopen_file_func (
+   voidpf opaque,
+   const char* filename,
+   int mode)
+{
+    FILE* file = NULL;
+    const char* mode_fopen = NULL;
+    if ((mode & ZLIB_FILEFUNC_MODE_READWRITEFILTER)==ZLIB_FILEFUNC_MODE_READ)
+        mode_fopen = "rb";
+    else
+    if (mode & ZLIB_FILEFUNC_MODE_EXISTING)
+        mode_fopen = "r+b";
+    else
+    if (mode & ZLIB_FILEFUNC_MODE_CREATE)
+        mode_fopen = "wb";
+
+    if ((filename!=NULL) && (mode_fopen != NULL))
+        file = fopen(filename, mode_fopen);
+    return file;
+}
+
+
+uLong ZCALLBACK fread_file_func (
+   voidpf opaque,
+   voidpf stream,
+   void* buf,
+   uLong size)
+{
+    uLong ret;
+    ret = (uLong)fread(buf, 1, (size_t)size, (FILE *)stream);
+    return ret;
+}
+
+
+uLong ZCALLBACK fwrite_file_func (
+   voidpf opaque,
+   voidpf stream,
+   const void* buf,
+   uLong size)
+{
+    uLong ret;
+    ret = (uLong)fwrite(buf, 1, (size_t)size, (FILE *)stream);
+    return ret;
+}
+
+long ZCALLBACK ftell_file_func (
+   voidpf opaque,
+   voidpf stream)
+{
+    long ret;
+    ret = ftell((FILE *)stream);
+    return ret;
+}
+
+long ZCALLBACK fseek_file_func (
+   voidpf opaque,
+   voidpf stream,
+   uLong offset,
+   int origin)
+{
+    int fseek_origin=0;
+    long ret;
+    switch (origin)
+    {
+    case ZLIB_FILEFUNC_SEEK_CUR :
+        fseek_origin = SEEK_CUR;
+        break;
+    case ZLIB_FILEFUNC_SEEK_END :
+        fseek_origin = SEEK_END;
+        break;
+    case ZLIB_FILEFUNC_SEEK_SET :
+        fseek_origin = SEEK_SET;
+        break;
+    default: return -1;
+    }
+    ret = 0;
+    fseek((FILE *)stream, offset, fseek_origin);
+    return ret;
+}
+
+int ZCALLBACK fclose_file_func (
+   voidpf opaque,
+   voidpf stream)
+{
+    int ret;
+    ret = fclose((FILE *)stream);
+    return ret;
+}
+
+int ZCALLBACK ferror_file_func (
+   voidpf opaque,
+   voidpf stream)
+{
+    int ret;
+    ret = ferror((FILE *)stream);
+    return ret;
+}
+
+void fill_fopen_filefunc (
+  zlib_filefunc_def* pzlib_filefunc_def)
+{
+    pzlib_filefunc_def->zopen_file = fopen_file_func;
+    pzlib_filefunc_def->zread_file = fread_file_func;
+    pzlib_filefunc_def->zwrite_file = fwrite_file_func;
+    pzlib_filefunc_def->ztell_file = ftell_file_func;
+    pzlib_filefunc_def->zseek_file = fseek_file_func;
+    pzlib_filefunc_def->zclose_file = fclose_file_func;
+    pzlib_filefunc_def->zerror_file = ferror_file_func;
+    pzlib_filefunc_def->opaque = NULL;
+}
diff --git a/updater/zlib123/contrib/minizip/ioapi.h b/updater/zlib123/contrib/minizip/ioapi.h
new file mode 100644
index 0000000..e73a3b2
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/ioapi.h
@@ -0,0 +1,75 @@
+/* ioapi.h -- IO base function header for compress/uncompress .zip
+   files using zlib + zip or unzip API
+
+   Version 1.01e, February 12th, 2005
+
+   Copyright (C) 1998-2005 Gilles Vollant
+*/
+
+#ifndef _ZLIBIOAPI_H
+#define _ZLIBIOAPI_H
+
+
+#define ZLIB_FILEFUNC_SEEK_CUR (1)
+#define ZLIB_FILEFUNC_SEEK_END (2)
+#define ZLIB_FILEFUNC_SEEK_SET (0)
+
+#define ZLIB_FILEFUNC_MODE_READ      (1)
+#define ZLIB_FILEFUNC_MODE_WRITE     (2)
+#define ZLIB_FILEFUNC_MODE_READWRITEFILTER (3)
+
+#define ZLIB_FILEFUNC_MODE_EXISTING (4)
+#define ZLIB_FILEFUNC_MODE_CREATE   (8)
+
+
+#ifndef ZCALLBACK
+
+#if (defined(WIN32) || defined (WINDOWS) || defined (_WINDOWS)) && defined(CALLBACK) && defined (USEWINDOWS_CALLBACK)
+#define ZCALLBACK CALLBACK
+#else
+#define ZCALLBACK
+#endif
+#endif
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+typedef voidpf (ZCALLBACK *open_file_func) OF((voidpf opaque, const char* filename, int mode));
+typedef uLong  (ZCALLBACK *read_file_func) OF((voidpf opaque, voidpf stream, void* buf, uLong size));
+typedef uLong  (ZCALLBACK *write_file_func) OF((voidpf opaque, voidpf stream, const void* buf, uLong size));
+typedef long   (ZCALLBACK *tell_file_func) OF((voidpf opaque, voidpf stream));
+typedef long   (ZCALLBACK *seek_file_func) OF((voidpf opaque, voidpf stream, uLong offset, int origin));
+typedef int    (ZCALLBACK *close_file_func) OF((voidpf opaque, voidpf stream));
+typedef int    (ZCALLBACK *testerror_file_func) OF((voidpf opaque, voidpf stream));
+
+typedef struct zlib_filefunc_def_s
+{
+    open_file_func      zopen_file;
+    read_file_func      zread_file;
+    write_file_func     zwrite_file;
+    tell_file_func      ztell_file;
+    seek_file_func      zseek_file;
+    close_file_func     zclose_file;
+    testerror_file_func zerror_file;
+    voidpf              opaque;
+} zlib_filefunc_def;
+
+
+
+void fill_fopen_filefunc OF((zlib_filefunc_def* pzlib_filefunc_def));
+
+#define ZREAD(filefunc,filestream,buf,size) ((*((filefunc).zread_file))((filefunc).opaque,filestream,buf,size))
+#define ZWRITE(filefunc,filestream,buf,size) ((*((filefunc).zwrite_file))((filefunc).opaque,filestream,buf,size))
+#define ZTELL(filefunc,filestream) ((*((filefunc).ztell_file))((filefunc).opaque,filestream))
+#define ZSEEK(filefunc,filestream,pos,mode) ((*((filefunc).zseek_file))((filefunc).opaque,filestream,pos,mode))
+#define ZCLOSE(filefunc,filestream) ((*((filefunc).zclose_file))((filefunc).opaque,filestream))
+#define ZERROR(filefunc,filestream) ((*((filefunc).zerror_file))((filefunc).opaque,filestream))
+
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
+
diff --git a/updater/zlib123/contrib/minizip/iowin32.c b/updater/zlib123/contrib/minizip/iowin32.c
new file mode 100644
index 0000000..6a7483c
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/iowin32.c
@@ -0,0 +1,270 @@
+/* iowin32.c -- IO base function header for compress/uncompress .zip
+   files using zlib + zip or unzip API
+   This IO API version uses the Win32 API (for Microsoft Windows)
+
+   Version 1.01e, February 12th, 2005
+
+   Copyright (C) 1998-2005 Gilles Vollant
+*/
+
+#include <stdlib.h>
+
+#include "zlib.h"
+#include "ioapi.h"
+#include "iowin32.h"
+
+#ifndef INVALID_HANDLE_VALUE
+#define INVALID_HANDLE_VALUE (0xFFFFFFFF)
+#endif
+
+#ifndef INVALID_SET_FILE_POINTER
+#define INVALID_SET_FILE_POINTER ((DWORD)-1)
+#endif
+
+voidpf ZCALLBACK win32_open_file_func OF((
+   voidpf opaque,
+   const char* filename,
+   int mode));
+
+uLong ZCALLBACK win32_read_file_func OF((
+   voidpf opaque,
+   voidpf stream,
+   void* buf,
+   uLong size));
+
+uLong ZCALLBACK win32_write_file_func OF((
+   voidpf opaque,
+   voidpf stream,
+   const void* buf,
+   uLong size));
+
+long ZCALLBACK win32_tell_file_func OF((
+   voidpf opaque,
+   voidpf stream));
+
+long ZCALLBACK win32_seek_file_func OF((
+   voidpf opaque,
+   voidpf stream,
+   uLong offset,
+   int origin));
+
+int ZCALLBACK win32_close_file_func OF((
+   voidpf opaque,
+   voidpf stream));
+
+int ZCALLBACK win32_error_file_func OF((
+   voidpf opaque,
+   voidpf stream));
+
+typedef struct
+{
+    HANDLE hf;
+    int error;
+} WIN32FILE_IOWIN;
+
+voidpf ZCALLBACK win32_open_file_func (
+   voidpf opaque,
+   const char* filename,
+   int mode)
+{
+    const char* mode_fopen = NULL;
+    DWORD dwDesiredAccess,dwCreationDisposition,dwShareMode,dwFlagsAndAttributes ;
+    HANDLE hFile = 0;
+    voidpf ret=NULL;
+
+    dwDesiredAccess = dwShareMode = dwFlagsAndAttributes = 0;
+
+    if ((mode & ZLIB_FILEFUNC_MODE_READWRITEFILTER)==ZLIB_FILEFUNC_MODE_READ)
+    {
+        dwDesiredAccess = GENERIC_READ;
+        dwCreationDisposition = OPEN_EXISTING;
+        dwShareMode = FILE_SHARE_READ;
+    }
+    else
+    if (mode & ZLIB_FILEFUNC_MODE_EXISTING)
+    {
+        dwDesiredAccess = GENERIC_WRITE | GENERIC_READ;
+        dwCreationDisposition = OPEN_EXISTING;
+    }
+    else
+    if (mode & ZLIB_FILEFUNC_MODE_CREATE)
+    {
+        dwDesiredAccess = GENERIC_WRITE | GENERIC_READ;
+        dwCreationDisposition = CREATE_ALWAYS;
+    }
+
+    if ((filename!=NULL) && (dwDesiredAccess != 0))
+        hFile = CreateFileA(filename, dwDesiredAccess, dwShareMode, NULL,
+                      dwCreationDisposition, dwFlagsAndAttributes, NULL);
+
+    if (hFile == INVALID_HANDLE_VALUE)
+        hFile = NULL;
+
+    if (hFile != NULL)
+    {
+        WIN32FILE_IOWIN w32fiow;
+        w32fiow.hf = hFile;
+        w32fiow.error = 0;
+        ret = malloc(sizeof(WIN32FILE_IOWIN));
+        if (ret==NULL)
+            CloseHandle(hFile);
+        else *((WIN32FILE_IOWIN*)ret) = w32fiow;
+    }
+    return ret;
+}
+
+
+uLong ZCALLBACK win32_read_file_func (
+   voidpf opaque,
+   voidpf stream,
+   void* buf,
+   uLong size)
+{
+    uLong ret=0;
+    HANDLE hFile = NULL;
+    if (stream!=NULL)
+        hFile = ((WIN32FILE_IOWIN*)stream) -> hf;
+    if (hFile != NULL)
+        if (!ReadFile(hFile, buf, size, &ret, NULL))
+        {
+            DWORD dwErr = GetLastError();
+            if (dwErr == ERROR_HANDLE_EOF)
+                dwErr = 0;
+            ((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr;
+        }
+
+    return ret;
+}
+
+
+uLong ZCALLBACK win32_write_file_func (
+   voidpf opaque,
+   voidpf stream,
+   const void* buf,
+   uLong size)
+{
+    uLong ret=0;
+    HANDLE hFile = NULL;
+    if (stream!=NULL)
+        hFile = ((WIN32FILE_IOWIN*)stream) -> hf;
+
+    if (hFile !=NULL)
+        if (!WriteFile(hFile, buf, size, &ret, NULL))
+        {
+            DWORD dwErr = GetLastError();
+            if (dwErr == ERROR_HANDLE_EOF)
+                dwErr = 0;
+            ((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr;
+        }
+
+    return ret;
+}
+
+long ZCALLBACK win32_tell_file_func (
+   voidpf opaque,
+   voidpf stream)
+{
+    long ret=-1;
+    HANDLE hFile = NULL;
+    if (stream!=NULL)
+        hFile = ((WIN32FILE_IOWIN*)stream) -> hf;
+    if (hFile != NULL)
+    {
+        DWORD dwSet = SetFilePointer(hFile, 0, NULL, FILE_CURRENT);
+        if (dwSet == INVALID_SET_FILE_POINTER)
+        {
+            DWORD dwErr = GetLastError();
+            ((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr;
+            ret = -1;
+        }
+        else
+            ret=(long)dwSet;
+    }
+    return ret;
+}
+
+long ZCALLBACK win32_seek_file_func (
+   voidpf opaque,
+   voidpf stream,
+   uLong offset,
+   int origin)
+{
+    DWORD dwMoveMethod=0xFFFFFFFF;
+    HANDLE hFile = NULL;
+
+    long ret=-1;
+    if (stream!=NULL)
+        hFile = ((WIN32FILE_IOWIN*)stream) -> hf;
+    switch (origin)
+    {
+    case ZLIB_FILEFUNC_SEEK_CUR :
+        dwMoveMethod = FILE_CURRENT;
+        break;
+    case ZLIB_FILEFUNC_SEEK_END :
+        dwMoveMethod = FILE_END;
+        break;
+    case ZLIB_FILEFUNC_SEEK_SET :
+        dwMoveMethod = FILE_BEGIN;
+        break;
+    default: return -1;
+    }
+
+    if (hFile != NULL)
+    {
+        DWORD dwSet = SetFilePointer(hFile, offset, NULL, dwMoveMethod);
+        if (dwSet == INVALID_SET_FILE_POINTER)
+        {
+            DWORD dwErr = GetLastError();
+            ((WIN32FILE_IOWIN*)stream) -> error=(int)dwErr;
+            ret = -1;
+        }
+        else
+            ret=0;
+    }
+    return ret;
+}
+
+int ZCALLBACK win32_close_file_func (
+   voidpf opaque,
+   voidpf stream)
+{
+    int ret=-1;
+
+    if (stream!=NULL)
+    {
+        HANDLE hFile;
+        hFile = ((WIN32FILE_IOWIN*)stream) -> hf;
+        if (hFile != NULL)
+        {
+            CloseHandle(hFile);
+            ret=0;
+        }
+        free(stream);
+    }
+    return ret;
+}
+
+int ZCALLBACK win32_error_file_func (
+   voidpf opaque,
+   voidpf stream)
+{
+    int ret=-1;
+    if (stream!=NULL)
+    {
+        ret = ((WIN32FILE_IOWIN*)stream) -> error;
+    }
+    return ret;
+}
+
+void fill_win32_filefunc (
+  zlib_filefunc_def* pzlib_filefunc_def)
+{
+    pzlib_filefunc_def->zopen_file = win32_open_file_func;
+    pzlib_filefunc_def->zread_file = win32_read_file_func;
+    pzlib_filefunc_def->zwrite_file = win32_write_file_func;
+    pzlib_filefunc_def->ztell_file = win32_tell_file_func;
+    pzlib_filefunc_def->zseek_file = win32_seek_file_func;
+    pzlib_filefunc_def->zclose_file = win32_close_file_func;
+    pzlib_filefunc_def->zerror_file = win32_error_file_func;
+    pzlib_filefunc_def->opaque=NULL;
+}
diff --git a/updater/zlib123/contrib/minizip/iowin32.h b/updater/zlib123/contrib/minizip/iowin32.h
new file mode 100644
index 0000000..e9c5f8b
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/iowin32.h
@@ -0,0 +1,21 @@
+/* iowin32.h -- IO base function header for compress/uncompress .zip
+   files using zlib + zip or unzip API
+   This IO API version uses the Win32 API (for Microsoft Windows)
+
+   Version 1.01e, February 12th, 2005
+
+   Copyright (C) 1998-2005 Gilles Vollant
+*/
+
+#include <windows.h>
+
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+void fill_win32_filefunc OF((zlib_filefunc_def* pzlib_filefunc_def));
+
+#ifdef __cplusplus
+}
+#endif
diff --git a/updater/zlib123/contrib/minizip/miniunz.c b/updater/zlib123/contrib/minizip/miniunz.c
new file mode 100644
index 0000000..f851c0a
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/miniunz.c
@@ -0,0 +1,648 @@
+/*
+   miniunz.c
+   Version 1.01e, February 12th, 2005
+
+   Copyright (C) 1998-2005 Gilles Vollant
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include <errno.h>
+#include <fcntl.h>
+
+#ifdef unix
+# include <unistd.h>
+# include <utime.h>
+#else
+# include <direct.h>
+# include <io.h>
+#endif
+
+#include "munzip.h"
+
+#define CASESENSITIVITY (0)
+#define WRITEBUFFERSIZE (8192)
+#define MAXFILENAME (256)
+
+#ifdef WIN32
+#define USEWIN32IOAPI
+#include "iowin32.h"
+#endif
+/*
+  mini unzip, demo of unzip package
+
+  usage :
+  Usage : miniunz [-exvlo] file.zip [file_to_extract] [-d extractdir]
+
+  list the file in the zipfile, and print the content of FILE_ID.ZIP or README.TXT
+    if it exists
+*/
+
+
+/* change_file_date : change the date/time of a file
+    filename : the filename of the file where date/time must be modified
+    dosdate : the new date at the MSDos format (4 bytes)
+    tmu_date : the SAME new date at the tm_unz format */
+void change_file_date(
+    const char *filename,
+    uLong dosdate,
+    tm_unz tmu_date)
+{
+#ifdef WIN32
+  HANDLE hFile;
+  FILETIME ftm,ftLocal,ftCreate,ftLastAcc,ftLastWrite;
+
+  hFile = CreateFileA(filename,GENERIC_READ | GENERIC_WRITE,
+                      0,NULL,OPEN_EXISTING,0,NULL);
+  GetFileTime(hFile,&ftCreate,&ftLastAcc,&ftLastWrite);
+  DosDateTimeToFileTime((WORD)(dosdate>>16),(WORD)dosdate,&ftLocal);
+  LocalFileTimeToFileTime(&ftLocal,&ftm);
+  SetFileTime(hFile,&ftm,&ftLastAcc,&ftm);
+  CloseHandle(hFile);
+#else
+#ifdef unix
+  struct utimbuf ut;
+  struct tm newdate;
+  newdate.tm_sec = tmu_date.tm_sec;
+  newdate.tm_min=tmu_date.tm_min;
+  newdate.tm_hour=tmu_date.tm_hour;
+  newdate.tm_mday=tmu_date.tm_mday;
+  newdate.tm_mon=tmu_date.tm_mon;
+  if (tmu_date.tm_year > 1900)
+      newdate.tm_year=tmu_date.tm_year - 1900;
+  else
+      newdate.tm_year=tmu_date.tm_year ;
+  newdate.tm_isdst=-1;
+
+  ut.actime=ut.modtime=mktime(&newdate);
+  utime(filename,&ut);
+#endif
+#endif
+}
+
+
+/* mymkdir and change_file_date are not 100 % portable
+   As I don't know well Unix, I wait feedback for the unix portion */
+
+int mymkdir(
+    const char* dirname)
+{
+    int ret=0;
+#ifdef WIN32
+    ret = _mkdir(dirname);
+#else
+#ifdef unix
+    ret = mkdir (dirname,0775);
+#endif
+#endif
+    return ret;
+}
+
+int makedir (
+    char *newdir)
+{
+  char *buffer ;
+  char *p;
+  int  len = (int)strlen(newdir);
+
+  if (len <= 0)
+    return 0;
+
+  buffer = (char*)malloc(len+1);
+ // strcpy_s(buffer,len + 1, newdir);
+  strncpy(buffer,newdir, len + 1);
+
+  if (buffer[len-1] == '/') {
+    buffer[len-1] = '\0';
+  }
+  if (mymkdir(buffer) == 0)
+    {
+      free(buffer);
+      return 1;
+    }
+
+  p = buffer+1;
+  while (1)
+    {
+      char hold;
+
+      while(*p && *p != '\\' && *p != '/')
+        p++;
+      hold = *p;
+      *p = 0;
+      if ((mymkdir(buffer) == -1) && (errno == ENOENT))
+        {
+          printf("couldn't create directory %s\n",buffer);
+          free(buffer);
+          return 0;
+        }
+      if (hold == 0)
+        break;
+      *p++ = hold;
+    }
+  free(buffer);
+  return 1;
+}
+
+void do_banner()
+{
+    printf("MiniUnz 1.01b, demo of zLib + Unz package written by Gilles Vollant\n");
+    printf("more info at http://www.winimage.com/zLibDll/unzip.html\n\n");
+}
+
+void do_help()
+{
+    printf("Usage : miniunz [-e] [-x] [-v] [-l] [-o] [-p password] file.zip [file_to_extr.] [-d extractdir]\n\n" \
+           "  -e  Extract without pathname (junk paths)\n" \
+           "  -x  Extract with pathname\n" \
+           "  -v  list files\n" \
+           "  -l  list files\n" \
+           "  -d  directory to extract into\n" \
+           "  -o  overwrite files without prompting\n" \
+           "  -p  extract crypted file using password\n\n");
+}
+
+
+int do_list(
+    unzFile uf)
+{
+    uLong i;
+    unz_global_info gi;
+    int err;
+
+    err = unzGetGlobalInfo (uf,&gi);
+    if (err!=UNZ_OK)
+        printf("error %d with zipfile in unzGetGlobalInfo \n",err);
+    printf(" Length  Method   Size  Ratio   Date    Time   CRC-32     Name\n");
+    printf(" ------  ------   ----  -----   ----    ----   ------     ----\n");
+    for (i=0;i<gi.number_entry;i++)
+    {
+        char filename_inzip[256];
+        unz_file_info file_info;
+        uLong ratio=0;
+        const char *string_method;
+        char charCrypt=' ';
+        err = unzGetCurrentFileInfo(uf,&file_info,filename_inzip,sizeof(filename_inzip),NULL,0,NULL,0);
+        if (err!=UNZ_OK)
+        {
+            printf("error %d with zipfile in unzGetCurrentFileInfo\n",err);
+            break;
+        }
+        if (file_info.uncompressed_size>0)
+            ratio = (file_info.compressed_size*100)/file_info.uncompressed_size;
+
+        /* display a '*' if the file is crypted */
+        if ((file_info.flag & 1) != 0)
+            charCrypt='*';
+
+        if (file_info.compression_method==0)
+            string_method="Stored";
+        else
+        if (file_info.compression_method==Z_DEFLATED)
+        {
+            uInt iLevel=(uInt)((file_info.flag & 0x6)/2);
+            if (iLevel==0)
+              string_method="Defl:N";
+            else if (iLevel==1)
+              string_method="Defl:X";
+            else if ((iLevel==2) || (iLevel==3))
+              string_method="Defl:F"; /* 2:fast , 3 : extra fast*/
+        }
+        else
+            string_method="Unkn. ";
+
+        printf("%7lu  %6s%c%7lu %3lu%%  %2.2lu-%2.2lu-%2.2lu  %2.2lu:%2.2lu  %8.8lx   %s\n",
+                file_info.uncompressed_size,string_method,
+                charCrypt,
+                file_info.compressed_size,
+                ratio,
+                (uLong)file_info.tmu_date.tm_mon + 1,
+                (uLong)file_info.tmu_date.tm_mday,
+                (uLong)file_info.tmu_date.tm_year % 100,
+                (uLong)file_info.tmu_date.tm_hour,(uLong)file_info.tmu_date.tm_min,
+                (uLong)file_info.crc,filename_inzip);
+        if ((i+1)<gi.number_entry)
+        {
+            err = unzGoToNextFile(uf);
+            if (err!=UNZ_OK)
+            {
+                printf("error %d with zipfile in unzGoToNextFile\n",err);
+                break;
+            }
+        }
+    }
+
+    return 0;
+}
+
+
+int do_extract_currentfile(
+    unzFile uf,
+    const int* popt_extract_without_path,
+    int* popt_overwrite,
+    const char* password)
+{
+    char filename_inzip[256];
+    char* filename_withoutpath;
+    char* p;
+    int err=UNZ_OK;
+    FILE *fout=NULL;
+    void* buf;
+    uInt size_buf;
+
+    unz_file_info file_info;
+    uLong ratio=0;
+    err = unzGetCurrentFileInfo(uf,&file_info,filename_inzip,sizeof(filename_inzip),NULL,0,NULL,0);
+
+    if (err!=UNZ_OK)
+    {
+        printf("error %d with zipfile in unzGetCurrentFileInfo\n",err);
+        return err;
+    }
+
+    size_buf = WRITEBUFFERSIZE;
+    buf = (void*)malloc(size_buf);
+    if (buf==NULL)
+    {
+        printf("Error allocating memory\n");
+        return UNZ_INTERNALERROR;
+    }
+
+    p = filename_withoutpath = filename_inzip;
+    while ((*p) != '\0')
+    {
+        if (((*p)=='/') || ((*p)=='\\'))
+            filename_withoutpath = p+1;
+        p++;
+    }
+
+    if ((*filename_withoutpath)=='\0')
+    {
+        if ((*popt_extract_without_path)==0)
+        {
+            printf("creating directory: %s\n",filename_inzip);
+            mymkdir(filename_inzip);
+        }
+    }
+    else
+    {
+        const char* write_filename;
+        int skip=0;
+
+        if ((*popt_extract_without_path)==0)
+            write_filename = filename_inzip;
+        else
+            write_filename = filename_withoutpath;
+
+        err = unzOpenCurrentFilePassword(uf,password);
+        if (err!=UNZ_OK)
+        {
+            printf("error %d with zipfile in unzOpenCurrentFilePassword\n",err);
+        }
+
+        if (((*popt_overwrite)==0) && (err==UNZ_OK))
+        {
+            char rep=0;
+            FILE* ftestexist;
+            ftestexist = fopen(write_filename,"rb");
+            if (ftestexist!=NULL)
+            {
+                fclose(ftestexist);
+                do
+                {
+                    char answer[128];
+                    int ret;
+
+                    printf("The file %s exists. Overwrite ? [y]es, [n]o, [A]ll: ",write_filename);
+                    ret = scanf("%1s",answer);
+                    if (ret != 1) 
+                    {
+                       exit(EXIT_FAILURE);
+                    }
+                    rep = answer[0] ;
+                    if ((rep>='a') && (rep<='z'))
+                        rep -= 0x20;
+                }
+                while ((rep!='Y') && (rep!='N') && (rep!='A'));
+            }
+
+            if (rep == 'N')
+                skip = 1;
+
+            if (rep == 'A')
+                *popt_overwrite=1;
+        }
+
+        if ((skip==0) && (err==UNZ_OK))
+        {
+            fout=fopen(write_filename,"wb");
+
+            /* some zipfile don't contain directory alone before file */
+            if ((fout==NULL) && ((*popt_extract_without_path)==0) &&
+                                (filename_withoutpath!=(char*)filename_inzip))
+            {
+                char c=*(filename_withoutpath-1);
+                *(filename_withoutpath-1)='\0';
+                makedir((char *)write_filename);
+                *(filename_withoutpath-1)=c;
+                fout=fopen(write_filename,"wb");
+            }
+
+            if (fout==NULL)
+            {
+                printf("error opening %s\n",write_filename);
+            }
+        }
+
+        if (fout!=NULL)
+        {
+            printf(" extracting: %s\n",write_filename);
+
+            do
+            {
+                err = unzReadCurrentFile(uf,buf,size_buf);
+                if (err<0)
+                {
+                    printf("error %d with zipfile in unzReadCurrentFile\n",err);
+                    break;
+                }
+                if (err>0)
+                    if (fwrite(buf,err,1,fout)!=1)
+                    {
+                        printf("error in writing extracted file\n");
+                        err=UNZ_ERRNO;
+                        break;
+                    }
+            }
+            while (err>0);
+            if (fout)
+                    fclose(fout);
+
+            if (err==0)
+                change_file_date(write_filename,file_info.dosDate,
+                                 file_info.tmu_date);
+        }
+
+        if (err==UNZ_OK)
+        {
+            err = unzCloseCurrentFile (uf);
+            if (err!=UNZ_OK)
+            {
+                printf("error %d with zipfile in unzCloseCurrentFile\n",err);
+            }
+        }
+        else
+            unzCloseCurrentFile(uf); /* don't lose the error */
+    }
+
+    free(buf);
+    return err;
+}
+
+
+int do_extract(
+    unzFile uf,
+    int opt_extract_without_path,
+    int opt_overwrite,
+    const char* password)
+{
+    uLong i;
+    unz_global_info gi;
+    int err;
+    FILE* fout=NULL;
+
+    err = unzGetGlobalInfo (uf,&gi);
+    if (err!=UNZ_OK)
+        printf("error %d with zipfile in unzGetGlobalInfo \n",err);
+
+    for (i=0;i<gi.number_entry;i++)
+    {
+        if (do_extract_currentfile(uf,&opt_extract_without_path,
+                                      &opt_overwrite,
+                                      password) != UNZ_OK)
+            break;
+
+        if ((i+1)<gi.number_entry)
+        {
+            err = unzGoToNextFile(uf);
+            if (err!=UNZ_OK)
+            {
+                printf("error %d with zipfile in unzGoToNextFile\n",err);
+                break;
+            }
+        }
+    }
+
+    return 0;
+}
+
+int do_extract_onefile(
+    unzFile uf,
+    const char* filename,
+    int opt_extract_without_path,
+    int opt_overwrite,
+    const char* password)
+{
+    int err = UNZ_OK;
+    if (unzLocateFile(uf,filename,CASESENSITIVITY)!=UNZ_OK)
+    {
+        printf("file %s not found in the zipfile\n",filename);
+        return 2;
+    }
+
+    if (do_extract_currentfile(uf,&opt_extract_without_path,
+                                      &opt_overwrite,
+                                      password) == UNZ_OK)
+        return 0;
+    else
+        return 1;
+}
+
+int unzip_file(const char *zipfilename, const char *out_dir) 
+{
+
+    char filename_try[MAXFILENAME+16] = "";
+	char current_dir[MAX_PATH];
+    unzFile uf=NULL;
+
+	int ret;
+
+    if (zipfilename!=NULL)
+    {
+
+#        ifdef USEWIN32IOAPI
+        zlib_filefunc_def ffunc;
+#        endif
+
+        strncpy(filename_try, zipfilename,MAXFILENAME-1);
+        /* strncpy doesnt append the trailing NULL, of the string is too long. */
+        filename_try[ MAXFILENAME ] = '\0';
+
+#        ifdef USEWIN32IOAPI
+        fill_win32_filefunc(&ffunc);
+        uf = unzOpen2(zipfilename,&ffunc);
+#        else
+        uf = unzOpen(zipfilename);
+#        endif
+        if (uf==NULL)
+        {
+            strcat(filename_try,".zip");
+#            ifdef USEWIN32IOAPI
+            uf = unzOpen2(filename_try,&ffunc);
+#            else
+            uf = unzOpen(filename_try);
+#            endif
+        }
+    }
+
+	getcwd(current_dir, MAX_PATH);
+    if (chdir(out_dir)) 
+    {
+		printf("Error changing into %s, aborting\n", out_dir);
+		return 1;
+    }
+
+    if (uf==NULL)
+    {
+        printf("Cannot open %s or %s.zip\n",zipfilename,zipfilename);
+        return 1;
+    }
+    printf("%s opened\n",filename_try);
+
+    ret = do_extract(uf,0,1,0);
+
+    unzClose(uf);
+
+	chdir(current_dir);
+
+	return ret;
+}
+
+#ifdef _MINIUNIPMIAN
+int main(argc,argv)
+    int argc;
+    char *argv[];
+{
+    const char *zipfilename=NULL;
+    const char *filename_to_extract=NULL;
+    const char *password=NULL;
+    char filename_try[MAXFILENAME+16] = "";
+    int i;
+    int opt_do_list=0;
+    int opt_do_extract=1;
+    int opt_do_extract_withoutpath=0;
+    int opt_overwrite=0;
+    int opt_extractdir=0;
+    const char *dirname=NULL;
+    unzFile uf=NULL;
+
+    do_banner();
+    if (argc==1)
+    {
+        do_help();
+        return 0;
+    }
+    else
+    {
+        for (i=1;i<argc;i++)
+        {
+            if ((*argv[i])=='-')
+            {
+                const char *p=argv[i]+1;
+
+                while ((*p)!='\0')
+                {
+                    char c=*(p++);;
+                    if ((c=='l') || (c=='L'))
+                        opt_do_list = 1;
+                    if ((c=='v') || (c=='V'))
+                        opt_do_list = 1;
+                    if ((c=='x') || (c=='X'))
+                        opt_do_extract = 1;
+                    if ((c=='e') || (c=='E'))
+                        opt_do_extract = opt_do_extract_withoutpath = 1;
+                    if ((c=='o') || (c=='O'))
+                        opt_overwrite=1;
+                    if ((c=='d') || (c=='D'))
+                    {
+                        opt_extractdir=1;
+                        dirname=argv[i+1];
+                    }
+
+                    if (((c=='p') || (c=='P')) && (i+1<argc))
+                    {
+                        password=argv[i+1];
+                        i++;
+                    }
+                }
+            }
+            else
+            {
+                if (zipfilename == NULL)
+                    zipfilename = argv[i];
+                else if ((filename_to_extract==NULL) && (!opt_extractdir))
+                        filename_to_extract = argv[i] ;
+            }
+        }
+    }
+
+    if (zipfilename!=NULL)
+    {
+
+#        ifdef USEWIN32IOAPI
+        zlib_filefunc_def ffunc;
+#        endif
+
+        strncpy(filename_try, zipfilename,MAXFILENAME-1);
+        /* strncpy doesnt append the trailing NULL, of the string is too long. */
+        filename_try[ MAXFILENAME ] = '\0';
+
+#        ifdef USEWIN32IOAPI
+        fill_win32_filefunc(&ffunc);
+        uf = unzOpen2(zipfilename,&ffunc);
+#        else
+        uf = unzOpen(zipfilename);
+#        endif
+        if (uf==NULL)
+        {
+            strcat(filename_try,".zip");
+#            ifdef USEWIN32IOAPI
+            uf = unzOpen2(filename_try,&ffunc);
+#            else
+            uf = unzOpen(filename_try);
+#            endif
+        }
+    }
+
+    if (uf==NULL)
+    {
+        printf("Cannot open %s or %s.zip\n",zipfilename,zipfilename);
+        return 1;
+    }
+    printf("%s opened\n",filename_try);
+
+    if (opt_do_list==1)
+        return do_list(uf);
+    else if (opt_do_extract==1)
+    {
+        if (opt_extractdir && chdir(dirname)) 
+        {
+          printf("Error changing into %s, aborting\n", dirname);
+          exit(-1);
+        }
+
+        if (filename_to_extract == NULL)
+            return do_extract(uf,opt_do_extract_withoutpath,opt_overwrite,password);
+        else
+            return do_extract_onefile(uf,filename_to_extract,
+                                      opt_do_extract_withoutpath,opt_overwrite,password);
+    }
+    unzCloseCurrentFile(uf);
+
+    return 0;
+}
+
+#endif
+\ No newline at end of file
diff --git a/updater/zlib123/contrib/minizip/minizip.c b/updater/zlib123/contrib/minizip/minizip.c
new file mode 100644
index 0000000..70fee02
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/minizip.c
@@ -0,0 +1,420 @@
+/*
+   minizip.c
+   Version 1.01e, February 12th, 2005
+
+   Copyright (C) 1998-2005 Gilles Vollant
+*/
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include <errno.h>
+#include <fcntl.h>
+
+#ifdef unix
+# include <unistd.h>
+# include <utime.h>
+# include <sys/types.h>
+# include <sys/stat.h>
+#else
+# include <direct.h>
+# include <io.h>
+#endif
+
+#include "zip.h"
+
+#ifdef WIN32
+#define USEWIN32IOAPI
+#include "iowin32.h"
+#endif
+
+
+
+#define WRITEBUFFERSIZE (16384)
+#define MAXFILENAME (256)
+
+#ifdef WIN32
+uLong filetime(f, tmzip, dt)
+    char *f;                /* name of file to get info on */
+    tm_zip *tmzip;             /* return value: access, modific. and creation times */
+    uLong *dt;             /* dostime */
+{
+  int ret = 0;
+  {
+      FILETIME ftLocal;
+      HANDLE hFind;
+      WIN32_FIND_DATA  ff32;
+
+      hFind = FindFirstFile(f,&ff32);
+      if (hFind != INVALID_HANDLE_VALUE)
+      {
+        FileTimeToLocalFileTime(&(ff32.ftLastWriteTime),&ftLocal);
+        FileTimeToDosDateTime(&ftLocal,((LPWORD)dt)+1,((LPWORD)dt)+0);
+        FindClose(hFind);
+        ret = 1;
+      }
+  }
+  return ret;
+}
+#else
+#ifdef unix
+uLong filetime(f, tmzip, dt)
+    char *f;               /* name of file to get info on */
+    tm_zip *tmzip;         /* return value: access, modific. and creation times */
+    uLong *dt;             /* dostime */
+{
+  int ret=0;
+  struct stat s;        /* results of stat() */
+  struct tm* filedate;
+  time_t tm_t=0;
+
+  if (strcmp(f,"-")!=0)
+  {
+    char name[MAXFILENAME+1];
+    int len = strlen(f);
+    if (len > MAXFILENAME)
+      len = MAXFILENAME;
+
+    strncpy(name, f,MAXFILENAME-1);
+    /* strncpy doesnt append the trailing NULL, of the string is too long. */
+    name[ MAXFILENAME ] = '\0';
+
+    if (name[len - 1] == '/')
+      name[len - 1] = '\0';
+    /* not all systems allow stat'ing a file with / appended */
+    if (stat(name,&s)==0)
+    {
+      tm_t = s.st_mtime;
+      ret = 1;
+    }
+  }
+  filedate = localtime(&tm_t);
+
+  tmzip->tm_sec  = filedate->tm_sec;
+  tmzip->tm_min  = filedate->tm_min;
+  tmzip->tm_hour = filedate->tm_hour;
+  tmzip->tm_mday = filedate->tm_mday;
+  tmzip->tm_mon  = filedate->tm_mon ;
+  tmzip->tm_year = filedate->tm_year;
+
+  return ret;
+}
+#else
+uLong filetime(f, tmzip, dt)
+    char *f;                /* name of file to get info on */
+    tm_zip *tmzip;             /* return value: access, modific. and creation times */
+    uLong *dt;             /* dostime */
+{
+    return 0;
+}
+#endif
+#endif
+
+
+
+
+int check_exist_file(filename)
+    const char* filename;
+{
+    FILE* ftestexist;
+    int ret = 1;
+    ftestexist = fopen(filename,"rb");
+    if (ftestexist==NULL)
+        ret = 0;
+    else
+        fclose(ftestexist);
+    return ret;
+}
+
+void do_banner()
+{
+    printf("MiniZip 1.01b, demo of zLib + Zip package written by Gilles Vollant\n");
+    printf("more info at http://www.winimage.com/zLibDll/unzip.html\n\n");
+}
+
+void do_help()
+{
+    printf("Usage : minizip [-o] [-a] [-0 to -9] [-p password] file.zip [files_to_add]\n\n" \
+           "  -o  Overwrite existing file.zip\n" \
+           "  -a  Append to existing file.zip\n" \
+           "  -0  Store only\n" \
+           "  -1  Compress faster\n" \
+           "  -9  Compress better\n\n");
+}
+
+/* calculate the CRC32 of a file,
+   because to encrypt a file, we need known the CRC32 of the file before */
+int getFileCrc(const char* filenameinzip,void*buf,unsigned long size_buf,unsigned long* result_crc)
+{
+   unsigned long calculate_crc=0;
+   int err=ZIP_OK;
+   FILE * fin = fopen(filenameinzip,"rb");
+   unsigned long size_read = 0;
+   unsigned long total_read = 0;
+   if (fin==NULL)
+   {
+       err = ZIP_ERRNO;
+   }
+
+    if (err == ZIP_OK)
+        do
+        {
+            err = ZIP_OK;
+            size_read = (int)fread(buf,1,size_buf,fin);
+            if (size_read < size_buf)
+                if (feof(fin)==0)
+            {
+                printf("error in reading %s\n",filenameinzip);
+                err = ZIP_ERRNO;
+            }
+
+            if (size_read>0)
+                calculate_crc = crc32(calculate_crc,buf,size_read);
+            total_read += size_read;
+
+        } while ((err == ZIP_OK) && (size_read>0));
+
+    if (fin)
+        fclose(fin);
+
+    *result_crc=calculate_crc;
+    printf("file %s crc %x\n",filenameinzip,calculate_crc);
+    return err;
+}
+
+int main(argc,argv)
+    int argc;
+    char *argv[];
+{
+    int i;
+    int opt_overwrite=0;
+    int opt_compress_level=Z_DEFAULT_COMPRESSION;
+    int zipfilenamearg = 0;
+    char filename_try[MAXFILENAME+16];
+    int zipok;
+    int err=0;
+    int size_buf=0;
+    void* buf=NULL;
+    const char* password=NULL;
+
+
+    do_banner();
+    if (argc==1)
+    {
+        do_help();
+        return 0;
+    }
+    else
+    {
+        for (i=1;i<argc;i++)
+        {
+            if ((*argv[i])=='-')
+            {
+                const char *p=argv[i]+1;
+
+                while ((*p)!='\0')
+                {
+                    char c=*(p++);;
+                    if ((c=='o') || (c=='O'))
+                        opt_overwrite = 1;
+                    if ((c=='a') || (c=='A'))
+                        opt_overwrite = 2;
+                    if ((c>='0') && (c<='9'))
+                        opt_compress_level = c-'0';
+
+                    if (((c=='p') || (c=='P')) && (i+1<argc))
+                    {
+                        password=argv[i+1];
+                        i++;
+                    }
+                }
+            }
+            else
+                if (zipfilenamearg == 0)
+                    zipfilenamearg = i ;
+        }
+    }
+
+    size_buf = WRITEBUFFERSIZE;
+    buf = (void*)malloc(size_buf);
+    if (buf==NULL)
+    {
+        printf("Error allocating memory\n");
+        return ZIP_INTERNALERROR;
+    }
+
+    if (zipfilenamearg==0)
+        zipok=0;
+    else
+    {
+        int i,len;
+        int dot_found=0;
+
+        zipok = 1 ;
+        strncpy(filename_try, argv[zipfilenamearg],MAXFILENAME-1);
+        /* strncpy doesnt append the trailing NULL, of the string is too long. */
+        filename_try[ MAXFILENAME ] = '\0';
+
+        len=(int)strlen(filename_try);
+        for (i=0;i<len;i++)
+            if (filename_try[i]=='.')
+                dot_found=1;
+
+        if (dot_found==0)
+            strcat(filename_try,".zip");
+
+        if (opt_overwrite==2)
+        {
+            /* if the file don't exist, we not append file */
+            if (check_exist_file(filename_try)==0)
+                opt_overwrite=1;
+        }
+        else
+        if (opt_overwrite==0)
+            if (check_exist_file(filename_try)!=0)
+            {
+                char rep=0;
+                do
+                {
+                    char answer[128];
+                    int ret;
+                    printf("The file %s exists. Overwrite ? [y]es, [n]o, [a]ppend : ",filename_try);
+                    ret = scanf("%1s",answer);
+                    if (ret != 1)
+                    {
+                       exit(EXIT_FAILURE);
+                    }
+                    rep = answer[0] ;
+                    if ((rep>='a') && (rep<='z'))
+                        rep -= 0x20;
+                }
+                while ((rep!='Y') && (rep!='N') && (rep!='A'));
+                if (rep=='N')
+                    zipok = 0;
+                if (rep=='A')
+                    opt_overwrite = 2;
+            }
+    }
+
+    if (zipok==1)
+    {
+        zipFile zf;
+        int errclose;
+#        ifdef USEWIN32IOAPI
+        zlib_filefunc_def ffunc;
+        fill_win32_filefunc(&ffunc);
+        zf = zipOpen2(filename_try,(opt_overwrite==2) ? 2 : 0,NULL,&ffunc);
+#        else
+        zf = zipOpen(filename_try,(opt_overwrite==2) ? 2 : 0);
+#        endif
+
+        if (zf == NULL)
+        {
+            printf("error opening %s\n",filename_try);
+            err= ZIP_ERRNO;
+        }
+        else
+            printf("creating %s\n",filename_try);
+
+        for (i=zipfilenamearg+1;(i<argc) && (err==ZIP_OK);i++)
+        {
+            if (!((((*(argv[i]))=='-') || ((*(argv[i]))=='/')) &&
+                  ((argv[i][1]=='o') || (argv[i][1]=='O') ||
+                   (argv[i][1]=='a') || (argv[i][1]=='A') ||
+                   (argv[i][1]=='p') || (argv[i][1]=='P') ||
+                   ((argv[i][1]>='0') || (argv[i][1]<='9'))) &&
+                  (strlen(argv[i]) == 2)))
+            {
+                FILE * fin;
+                int size_read;
+                const char* filenameinzip = argv[i];
+                zip_fileinfo zi;
+                unsigned long crcFile=0;
+
+                zi.tmz_date.tm_sec = zi.tmz_date.tm_min = zi.tmz_date.tm_hour =
+                zi.tmz_date.tm_mday = zi.tmz_date.tm_mon = zi.tmz_date.tm_year = 0;
+                zi.dosDate = 0;
+                zi.internal_fa = 0;
+                zi.external_fa = 0;
+                filetime(filenameinzip,&zi.tmz_date,&zi.dosDate);
+
+/*
+                err = zipOpenNewFileInZip(zf,filenameinzip,&zi,
+                                 NULL,0,NULL,0,NULL / * comment * /,
+                                 (opt_compress_level != 0) ? Z_DEFLATED : 0,
+                                 opt_compress_level);
+*/
+                if ((password != NULL) && (err==ZIP_OK))
+                    err = getFileCrc(filenameinzip,buf,size_buf,&crcFile);
+
+                err = zipOpenNewFileInZip3(zf,filenameinzip,&zi,
+                                 NULL,0,NULL,0,NULL /* comment*/,
+                                 (opt_compress_level != 0) ? Z_DEFLATED : 0,
+                                 opt_compress_level,0,
+                                 /* -MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY, */
+                                 -MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY,
+                                 password,crcFile);
+
+                if (err != ZIP_OK)
+                    printf("error in opening %s in zipfile\n",filenameinzip);
+                else
+                {
+                    fin = fopen(filenameinzip,"rb");
+                    if (fin==NULL)
+                    {
+                        err=ZIP_ERRNO;
+                        printf("error in opening %s for reading\n",filenameinzip);
+                    }
+                }
+
+                if (err == ZIP_OK)
+                    do
+                    {
+                        err = ZIP_OK;
+                        size_read = (int)fread(buf,1,size_buf,fin);
+                        if (size_read < size_buf)
+                            if (feof(fin)==0)
+                        {
+                            printf("error in reading %s\n",filenameinzip);
+                            err = ZIP_ERRNO;
+                        }
+
+                        if (size_read>0)
+                        {
+                            err = zipWriteInFileInZip (zf,buf,size_read);
+                            if (err<0)
+                            {
+                                printf("error in writing %s in the zipfile\n",
+                                                 filenameinzip);
+                            }
+
+                        }
+                    } while ((err == ZIP_OK) && (size_read>0));
+
+                if (fin)
+                    fclose(fin);
+
+                if (err<0)
+                    err=ZIP_ERRNO;
+                else
+                {
+                    err = zipCloseFileInZip(zf);
+                    if (err!=ZIP_OK)
+                        printf("error in closing %s in the zipfile\n",
+                                    filenameinzip);
+                }
+            }
+        }
+        errclose = zipClose(zf,NULL);
+        if (errclose != ZIP_OK)
+            printf("error in closing %s\n",filename_try);
+    }
+    else
+    {
+       do_help();
+    }
+
+    free(buf);
+    return 0;
+}
diff --git a/updater/zlib123/contrib/minizip/munzip.c b/updater/zlib123/contrib/minizip/munzip.c
new file mode 100644
index 0000000..1cacd92
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/munzip.c
@@ -0,0 +1,1585 @@
+/* unzip.c -- IO for uncompress .zip files using zlib
+   Version 1.01e, February 12th, 2005
+
+   Copyright (C) 1998-2005 Gilles Vollant
+
+   Read unzip.h for more info
+*/
+
+/* Decryption code comes from crypt.c by Info-ZIP but has been greatly reduced in terms of
+compatibility with older software. The following is from the original crypt.c. Code
+woven in by Terry Thorsen 1/2003.
+*/
+/*
+  Copyright (c) 1990-2000 Info-ZIP.  All rights reserved.
+
+  See the accompanying file LICENSE, version 2000-Apr-09 or later
+  (the contents of which are also included in zip.h) for terms of use.
+  If, for some reason, all these files are missing, the Info-ZIP license
+  also may be found at:  ftp://ftp.info-zip.org/pub/infozip/license.html
+*/
+/*
+  crypt.c (full version) by Info-ZIP.      Last revised:  [see crypt.h]
+
+  The encryption/decryption parts of this source code (as opposed to the
+  non-echoing password parts) were originally written in Europe.  The
+  whole source package can be freely distributed, including from the USA.
+  (Prior to January 2000, re-export from the US was a violation of US law.)
+ */
+
+/*
+  This encryption code is a direct transcription of the algorithm from
+  Roger Schlafly, described by Phil Katz in the file appnote.txt.  This
+  file (appnote.txt) is distributed with the PKZIP program (even in the
+  version without encryption capabilities).
+ */
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "zlib.h"
+#include "munzip.h"
+
+#ifdef STDC
+#  include <stddef.h>
+#  include <string.h>
+#  include <stdlib.h>
+#endif
+#ifdef NO_ERRNO_H
+    extern int errno;
+#else
+#   include <errno.h>
+#endif
+
+
+#ifndef local
+#  define local static
+#endif
+/* compile with -Dlocal if your debugger can't find static symbols */
+
+
+#ifndef CASESENSITIVITYDEFAULT_NO
+#  if !defined(unix) && !defined(CASESENSITIVITYDEFAULT_YES)
+#    define CASESENSITIVITYDEFAULT_NO
+#  endif
+#endif
+
+
+#ifndef UNZ_BUFSIZE
+#define UNZ_BUFSIZE (16384)
+#endif
+
+#ifndef UNZ_MAXFILENAMEINZIP
+#define UNZ_MAXFILENAMEINZIP (256)
+#endif
+
+#ifndef ALLOC
+# define ALLOC(size) (malloc(size))
+#endif
+#ifndef TRYFREE
+# define TRYFREE(p) {if (p) free(p);}
+#endif
+
+#define SIZECENTRALDIRITEM (0x2e)
+#define SIZEZIPLOCALHEADER (0x1e)
+
+
+
+
+const char unz_copyright[] =
+   " unzip 1.01 Copyright 1998-2004 Gilles Vollant - http://www.winimage.com/zLibDll";
+
+/* unz_file_info_interntal contain internal info about a file in zipfile*/
+typedef struct unz_file_info_internal_s
+{
+    uLong offset_curfile;/* relative offset of local header 4 bytes */
+} unz_file_info_internal;
+
+
+/* file_in_zip_read_info_s contain internal information about a file in zipfile,
+    when reading and decompress it */
+typedef struct
+{
+    char  *read_buffer;         /* internal buffer for compressed data */
+    z_stream stream;            /* zLib stream structure for inflate */
+
+    uLong pos_in_zipfile;       /* position in byte on the zipfile, for fseek*/
+    uLong stream_initialised;   /* flag set if stream structure is initialised*/
+
+    uLong offset_local_extrafield;/* offset of the local extra field */
+    uInt  size_local_extrafield;/* size of the local extra field */
+    uLong pos_local_extrafield;   /* position in the local extra field in read*/
+
+    uLong crc32;                /* crc32 of all data uncompressed */
+    uLong crc32_wait;           /* crc32 we must obtain after decompress all */
+    uLong rest_read_compressed; /* number of byte to be decompressed */
+    uLong rest_read_uncompressed;/*number of byte to be obtained after decomp*/
+    zlib_filefunc_def z_filefunc;
+    voidpf filestream;        /* io structore of the zipfile */
+    uLong compression_method;   /* compression method (0==store) */
+    uLong byte_before_the_zipfile;/* byte before the zipfile, (>0 for sfx)*/
+    int   raw;
+} file_in_zip_read_info_s;
+
+
+/* unz_s contain internal information about the zipfile
+*/
+typedef struct
+{
+    zlib_filefunc_def z_filefunc;
+    voidpf filestream;        /* io structore of the zipfile */
+    unz_global_info gi;       /* public global information */
+    uLong byte_before_the_zipfile;/* byte before the zipfile, (>0 for sfx)*/
+    uLong num_file;             /* number of the current file in the zipfile*/
+    uLong pos_in_central_dir;   /* pos of the current file in the central dir*/
+    uLong current_file_ok;      /* flag about the usability of the current file*/
+    uLong central_pos;          /* position of the beginning of the central dir*/
+
+    uLong size_central_dir;     /* size of the central directory  */
+    uLong offset_central_dir;   /* offset of start of central directory with
+                                   respect to the starting disk number */
+
+    unz_file_info cur_file_info; /* public info about the current file in zip*/
+    unz_file_info_internal cur_file_info_internal; /* private info about it*/
+    file_in_zip_read_info_s* pfile_in_zip_read; /* structure about the current
+                                        file if we are decompressing it */
+    int encrypted;
+#    ifndef NOUNCRYPT
+    unsigned long keys[3];     /* keys defining the pseudo-random sequence */
+    const unsigned long* pcrc_32_tab;
+#    endif
+} unz_s;
+
+
+#ifndef NOUNCRYPT
+#include "crypt.h"
+#endif
+
+/* ===========================================================================
+     Read a byte from a gz_stream; update next_in and avail_in. Return EOF
+   for end of file.
+   IN assertion: the stream s has been sucessfully opened for reading.
+*/
+
+
+local int unzlocal_getByte OF((
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream,
+    int *pi));
+
+local int unzlocal_getByte(
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream,
+    int *pi)
+{
+    unsigned char c;
+    int err = (int)ZREAD(*pzlib_filefunc_def,filestream,&c,1);
+    if (err==1)
+    {
+        *pi = (int)c;
+        return UNZ_OK;
+    }
+    else
+    {
+        if (ZERROR(*pzlib_filefunc_def,filestream))
+            return UNZ_ERRNO;
+        else
+            return UNZ_EOF;
+    }
+}
+
+
+/* ===========================================================================
+   Reads a long in LSB order from the given gz_stream. Sets
+*/
+local int unzlocal_getShort OF((
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream,
+    uLong *pX));
+
+local int unzlocal_getShort (
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream,
+    uLong *pX)
+{
+    uLong x ;
+    int i;
+    int err;
+
+    err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x = (uLong)i;
+
+    if (err==UNZ_OK)
+        err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x += ((uLong)i)<<8;
+
+    if (err==UNZ_OK)
+        *pX = x;
+    else
+        *pX = 0;
+    return err;
+}
+
+local int unzlocal_getLong OF((
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream,
+    uLong *pX));
+
+local int unzlocal_getLong (
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream,
+    uLong *pX)
+{
+    uLong x ;
+    int i;
+    int err;
+
+    err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x = (uLong)i;
+
+    if (err==UNZ_OK)
+        err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x += ((uLong)i)<<8;
+
+    if (err==UNZ_OK)
+        err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x += ((uLong)i)<<16;
+
+    if (err==UNZ_OK)
+        err = unzlocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x += ((uLong)i)<<24;
+
+    if (err==UNZ_OK)
+        *pX = x;
+    else
+        *pX = 0;
+    return err;
+}
+
+
+/* My own strcmpi / strcasecmp */
+local int strcmpcasenosensitive_internal (
+    const char* fileName1,
+    const char* fileName2)
+{
+    for (;;)
+    {
+        char c1=*(fileName1++);
+        char c2=*(fileName2++);
+        if ((c1>='a') && (c1<='z'))
+            c1 -= 0x20;
+        if ((c2>='a') && (c2<='z'))
+            c2 -= 0x20;
+        if (c1=='\0')
+            return ((c2=='\0') ? 0 : -1);
+        if (c2=='\0')
+            return 1;
+        if (c1<c2)
+            return -1;
+        if (c1>c2)
+            return 1;
+    }
+}
+
+
+#ifdef  CASESENSITIVITYDEFAULT_NO
+#define CASESENSITIVITYDEFAULTVALUE 2
+#else
+#define CASESENSITIVITYDEFAULTVALUE 1
+#endif
+
+#ifndef STRCMPCASENOSENTIVEFUNCTION
+#define STRCMPCASENOSENTIVEFUNCTION strcmpcasenosensitive_internal
+#endif
+
+/*
+   Compare two filename (fileName1,fileName2).
+   If iCaseSenisivity = 1, comparision is case sensitivity (like strcmp)
+   If iCaseSenisivity = 2, comparision is not case sensitivity (like strcmpi
+                                                                or strcasecmp)
+   If iCaseSenisivity = 0, case sensitivity is defaut of your operating system
+        (like 1 on Unix, 2 on Windows)
+
+*/
+extern int ZEXPORT unzStringFileNameCompare (
+    const char* fileName1,
+    const char* fileName2,
+    int iCaseSensitivity)
+{
+    if (iCaseSensitivity==0)
+        iCaseSensitivity=CASESENSITIVITYDEFAULTVALUE;
+
+    if (iCaseSensitivity==1)
+        return strcmp(fileName1,fileName2);
+
+    return STRCMPCASENOSENTIVEFUNCTION(fileName1,fileName2);
+}
+
+#ifndef BUFREADCOMMENT
+#define BUFREADCOMMENT (0x400)
+#endif
+
+/*
+  Locate the Central directory of a zipfile (at the end, just before
+    the global comment)
+*/
+local uLong unzlocal_SearchCentralDir OF((
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream));
+
+local uLong unzlocal_SearchCentralDir(
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream)
+{
+    unsigned char* buf;
+    uLong uSizeFile;
+    uLong uBackRead;
+    uLong uMaxBack=0xffff; /* maximum size of global comment */
+    uLong uPosFound=0;
+
+    if (ZSEEK(*pzlib_filefunc_def,filestream,0,ZLIB_FILEFUNC_SEEK_END) != 0)
+        return 0;
+
+
+    uSizeFile = ZTELL(*pzlib_filefunc_def,filestream);
+
+    if (uMaxBack>uSizeFile)
+        uMaxBack = uSizeFile;
+
+    buf = (unsigned char*)ALLOC(BUFREADCOMMENT+4);
+    if (buf==NULL)
+        return 0;
+
+    uBackRead = 4;
+    while (uBackRead<uMaxBack)
+    {
+        uLong uReadSize,uReadPos ;
+        int i;
+        if (uBackRead+BUFREADCOMMENT>uMaxBack)
+            uBackRead = uMaxBack;
+        else
+            uBackRead+=BUFREADCOMMENT;
+        uReadPos = uSizeFile-uBackRead ;
+
+        uReadSize = ((BUFREADCOMMENT+4) < (uSizeFile-uReadPos)) ?
+                     (BUFREADCOMMENT+4) : (uSizeFile-uReadPos);
+        if (ZSEEK(*pzlib_filefunc_def,filestream,uReadPos,ZLIB_FILEFUNC_SEEK_SET)!=0)
+            break;
+
+        if (ZREAD(*pzlib_filefunc_def,filestream,buf,uReadSize)!=uReadSize)
+            break;
+
+        for (i=(int)uReadSize-3; (i--)>0;)
+            if (((*(buf+i))==0x50) && ((*(buf+i+1))==0x4b) &&
+                ((*(buf+i+2))==0x05) && ((*(buf+i+3))==0x06))
+            {
+                uPosFound = uReadPos+i;
+                break;
+            }
+
+        if (uPosFound!=0)
+            break;
+    }
+    TRYFREE(buf);
+    return uPosFound;
+}
+
+/*
+  Open a Zip file. path contain the full pathname (by example,
+     on a Windows NT computer "c:\\test\\zlib114.zip" or on an Unix computer
+     "zlib/zlib114.zip".
+     If the zipfile cannot be opened (file doesn't exist or in not valid), the
+       return value is NULL.
+     Else, the return value is a unzFile Handle, usable with other function
+       of this unzip package.
+*/
+extern unzFile ZEXPORT unzOpen2 (
+    const char *path,
+    zlib_filefunc_def* pzlib_filefunc_def)
+{
+    unz_s us;
+    unz_s *s;
+    uLong central_pos,uL;
+
+    uLong number_disk;          /* number of the current dist, used for
+                                   spaning ZIP, unsupported, always 0*/
+    uLong number_disk_with_CD;  /* number the the disk with central dir, used
+                                   for spaning ZIP, unsupported, always 0*/
+    uLong number_entry_CD;      /* total number of entries in
+                                   the central dir
+                                   (same than number_entry on nospan) */
+
+    int err=UNZ_OK;
+
+    if (unz_copyright[0]!=' ')
+        return NULL;
+
+    if (pzlib_filefunc_def==NULL)
+        fill_fopen_filefunc(&us.z_filefunc);
+    else
+        us.z_filefunc = *pzlib_filefunc_def;
+
+    us.filestream= (*(us.z_filefunc.zopen_file))(us.z_filefunc.opaque,
+                                                 path,
+                                                 ZLIB_FILEFUNC_MODE_READ |
+                                                 ZLIB_FILEFUNC_MODE_EXISTING);
+    if (us.filestream==NULL)
+        return NULL;
+
+    central_pos = unzlocal_SearchCentralDir(&us.z_filefunc,us.filestream);
+    if (central_pos==0)
+        err=UNZ_ERRNO;
+
+    if (ZSEEK(us.z_filefunc, us.filestream,
+                                      central_pos,ZLIB_FILEFUNC_SEEK_SET)!=0)
+        err=UNZ_ERRNO;
+
+    /* the signature, already checked */
+    if (unzlocal_getLong(&us.z_filefunc, us.filestream,&uL)!=UNZ_OK)
+        err=UNZ_ERRNO;
+
+    /* number of this disk */
+    if (unzlocal_getShort(&us.z_filefunc, us.filestream,&number_disk)!=UNZ_OK)
+        err=UNZ_ERRNO;
+
+    /* number of the disk with the start of the central directory */
+    if (unzlocal_getShort(&us.z_filefunc, us.filestream,&number_disk_with_CD)!=UNZ_OK)
+        err=UNZ_ERRNO;
+
+    /* total number of entries in the central dir on this disk */
+    if (unzlocal_getShort(&us.z_filefunc, us.filestream,&us.gi.number_entry)!=UNZ_OK)
+        err=UNZ_ERRNO;
+
+    /* total number of entries in the central dir */
+    if (unzlocal_getShort(&us.z_filefunc, us.filestream,&number_entry_CD)!=UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if ((number_entry_CD!=us.gi.number_entry) ||
+        (number_disk_with_CD!=0) ||
+        (number_disk!=0))
+        err=UNZ_BADZIPFILE;
+
+    /* size of the central directory */
+    if (unzlocal_getLong(&us.z_filefunc, us.filestream,&us.size_central_dir)!=UNZ_OK)
+        err=UNZ_ERRNO;
+
+    /* offset of start of central directory with respect to the
+          starting disk number */
+    if (unzlocal_getLong(&us.z_filefunc, us.filestream,&us.offset_central_dir)!=UNZ_OK)
+        err=UNZ_ERRNO;
+
+    /* zipfile comment length */
+    if (unzlocal_getShort(&us.z_filefunc, us.filestream,&us.gi.size_comment)!=UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if ((central_pos<us.offset_central_dir+us.size_central_dir) &&
+        (err==UNZ_OK))
+        err=UNZ_BADZIPFILE;
+
+    if (err!=UNZ_OK)
+    {
+        ZCLOSE(us.z_filefunc, us.filestream);
+        return NULL;
+    }
+
+    us.byte_before_the_zipfile = central_pos -
+                            (us.offset_central_dir+us.size_central_dir);
+    us.central_pos = central_pos;
+    us.pfile_in_zip_read = NULL;
+    us.encrypted = 0;
+
+
+    s=(unz_s*)ALLOC(sizeof(unz_s));
+    *s=us;
+    unzGoToFirstFile((unzFile)s);
+    return (unzFile)s;
+}
+
+
+extern unzFile ZEXPORT unzOpen (
+    const char *path)
+{
+    return unzOpen2(path, NULL);
+}
+
+/*
+  Close a ZipFile opened with unzipOpen.
+  If there is files inside the .Zip opened with unzipOpenCurrentFile (see later),
+    these files MUST be closed with unzipCloseCurrentFile before call unzipClose.
+  return UNZ_OK if there is no problem. */
+extern int ZEXPORT unzClose (
+    unzFile file)
+{
+    unz_s* s;
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+
+    if (s->pfile_in_zip_read!=NULL)
+        unzCloseCurrentFile(file);
+
+    ZCLOSE(s->z_filefunc, s->filestream);
+    TRYFREE(s);
+    return UNZ_OK;
+}
+
+
+/*
+  Write info about the ZipFile in the *pglobal_info structure.
+  No preparation of the structure is needed
+  return UNZ_OK if there is no problem. */
+extern int ZEXPORT unzGetGlobalInfo (
+    unzFile file,
+    unz_global_info *pglobal_info)
+{
+    unz_s* s;
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    *pglobal_info=s->gi;
+    return UNZ_OK;
+}
+
+
+/*
+   Translate date/time from Dos format to tm_unz (readable more easilty)
+*/
+local void unzlocal_DosDateToTmuDate (
+    uLong ulDosDate,
+    tm_unz* ptm)
+{
+    uLong uDate;
+    uDate = (uLong)(ulDosDate>>16);
+    ptm->tm_mday = (uInt)(uDate&0x1f) ;
+    ptm->tm_mon =  (uInt)((((uDate)&0x1E0)/0x20)-1) ;
+    ptm->tm_year = (uInt)(((uDate&0x0FE00)/0x0200)+1980) ;
+
+    ptm->tm_hour = (uInt) ((ulDosDate &0xF800)/0x800);
+    ptm->tm_min =  (uInt) ((ulDosDate&0x7E0)/0x20) ;
+    ptm->tm_sec =  (uInt) (2*(ulDosDate&0x1f)) ;
+}
+
+/*
+  Get Info about the current file in the zipfile, with internal only info
+*/
+local int unzlocal_GetCurrentFileInfoInternal OF((unzFile file,
+                                                  unz_file_info *pfile_info,
+                                                  unz_file_info_internal
+                                                  *pfile_info_internal,
+                                                  char *szFileName,
+                                                  uLong fileNameBufferSize,
+                                                  void *extraField,
+                                                  uLong extraFieldBufferSize,
+                                                  char *szComment,
+                                                  uLong commentBufferSize));
+
+local int unzlocal_GetCurrentFileInfoInternal (
+    unzFile file,
+    unz_file_info *pfile_info,
+    unz_file_info_internal *pfile_info_internal,
+    char *szFileName,
+    uLong fileNameBufferSize,
+    void *extraField,
+    uLong extraFieldBufferSize,
+    char *szComment,
+    uLong commentBufferSize)
+{
+    unz_s* s;
+    unz_file_info file_info;
+    unz_file_info_internal file_info_internal;
+    int err=UNZ_OK;
+    uLong uMagic;
+    long lSeek=0;
+
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    if (ZSEEK(s->z_filefunc, s->filestream,
+              s->pos_in_central_dir+s->byte_before_the_zipfile,
+              ZLIB_FILEFUNC_SEEK_SET)!=0)
+        err=UNZ_ERRNO;
+
+
+    /* we check the magic */
+    if (err==UNZ_OK)
+        if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uMagic) != UNZ_OK)
+            err=UNZ_ERRNO;
+        else if (uMagic!=0x02014b50)
+            err=UNZ_BADZIPFILE;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.version) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.version_needed) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.flag) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.compression_method) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info.dosDate) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    unzlocal_DosDateToTmuDate(file_info.dosDate,&file_info.tmu_date);
+
+    if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info.crc) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info.compressed_size) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info.uncompressed_size) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.size_filename) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.size_file_extra) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.size_file_comment) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.disk_num_start) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&file_info.internal_fa) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info.external_fa) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getLong(&s->z_filefunc, s->filestream,&file_info_internal.offset_curfile) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    lSeek+=file_info.size_filename;
+    if ((err==UNZ_OK) && (szFileName!=NULL))
+    {
+        uLong uSizeRead ;
+        if (file_info.size_filename<fileNameBufferSize)
+        {
+            *(szFileName+file_info.size_filename)='\0';
+            uSizeRead = file_info.size_filename;
+        }
+        else
+            uSizeRead = fileNameBufferSize;
+
+        if ((file_info.size_filename>0) && (fileNameBufferSize>0))
+            if (ZREAD(s->z_filefunc, s->filestream,szFileName,uSizeRead)!=uSizeRead)
+                err=UNZ_ERRNO;
+        lSeek -= uSizeRead;
+    }
+
+
+    if ((err==UNZ_OK) && (extraField!=NULL))
+    {
+        uLong uSizeRead ;
+        if (file_info.size_file_extra<extraFieldBufferSize)
+            uSizeRead = file_info.size_file_extra;
+        else
+            uSizeRead = extraFieldBufferSize;
+
+        if (lSeek!=0)
+            if (ZSEEK(s->z_filefunc, s->filestream,lSeek,ZLIB_FILEFUNC_SEEK_CUR)==0)
+                lSeek=0;
+            else
+                err=UNZ_ERRNO;
+        if ((file_info.size_file_extra>0) && (extraFieldBufferSize>0))
+            if (ZREAD(s->z_filefunc, s->filestream,extraField,uSizeRead)!=uSizeRead)
+                err=UNZ_ERRNO;
+        lSeek += file_info.size_file_extra - uSizeRead;
+    }
+    else
+        lSeek+=file_info.size_file_extra;
+
+
+    if ((err==UNZ_OK) && (szComment!=NULL))
+    {
+        uLong uSizeRead ;
+        if (file_info.size_file_comment<commentBufferSize)
+        {
+            *(szComment+file_info.size_file_comment)='\0';
+            uSizeRead = file_info.size_file_comment;
+        }
+        else
+            uSizeRead = commentBufferSize;
+
+        if (lSeek!=0)
+            if (ZSEEK(s->z_filefunc, s->filestream,lSeek,ZLIB_FILEFUNC_SEEK_CUR)==0)
+                lSeek=0;
+            else
+                err=UNZ_ERRNO;
+        if ((file_info.size_file_comment>0) && (commentBufferSize>0))
+            if (ZREAD(s->z_filefunc, s->filestream,szComment,uSizeRead)!=uSizeRead)
+                err=UNZ_ERRNO;
+        lSeek+=file_info.size_file_comment - uSizeRead;
+    }
+    else
+        lSeek+=file_info.size_file_comment;
+
+    if ((err==UNZ_OK) && (pfile_info!=NULL))
+        *pfile_info=file_info;
+
+    if ((err==UNZ_OK) && (pfile_info_internal!=NULL))
+        *pfile_info_internal=file_info_internal;
+
+    return err;
+}
+
+
+
+/*
+  Write info about the ZipFile in the *pglobal_info structure.
+  No preparation of the structure is needed
+  return UNZ_OK if there is no problem.
+*/
+extern int ZEXPORT unzGetCurrentFileInfo (
+    unzFile file,
+    unz_file_info *pfile_info,
+    char *szFileName,
+    uLong fileNameBufferSize,
+    void *extraField,
+    uLong extraFieldBufferSize,
+    char *szComment,
+    uLong commentBufferSize)
+{
+    return unzlocal_GetCurrentFileInfoInternal(file,pfile_info,NULL,
+                                                szFileName,fileNameBufferSize,
+                                                extraField,extraFieldBufferSize,
+                                                szComment,commentBufferSize);
+}
+
+/*
+  Set the current file of the zipfile to the first file.
+  return UNZ_OK if there is no problem
+*/
+extern int ZEXPORT unzGoToFirstFile (
+    unzFile file)
+{
+    int err=UNZ_OK;
+    unz_s* s;
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    s->pos_in_central_dir=s->offset_central_dir;
+    s->num_file=0;
+    err=unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info,
+                                             &s->cur_file_info_internal,
+                                             NULL,0,NULL,0,NULL,0);
+    s->current_file_ok = (err == UNZ_OK);
+    return err;
+}
+
+/*
+  Set the current file of the zipfile to the next file.
+  return UNZ_OK if there is no problem
+  return UNZ_END_OF_LIST_OF_FILE if the actual file was the latest.
+*/
+extern int ZEXPORT unzGoToNextFile (unzFile file)
+{
+    unz_s* s;
+    int err;
+
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    if (!s->current_file_ok)
+        return UNZ_END_OF_LIST_OF_FILE;
+    if (s->gi.number_entry != 0xffff)    /* 2^16 files overflow hack */
+      if (s->num_file+1==s->gi.number_entry)
+        return UNZ_END_OF_LIST_OF_FILE;
+
+    s->pos_in_central_dir += SIZECENTRALDIRITEM + s->cur_file_info.size_filename +
+            s->cur_file_info.size_file_extra + s->cur_file_info.size_file_comment ;
+    s->num_file++;
+    err = unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info,
+                                               &s->cur_file_info_internal,
+                                               NULL,0,NULL,0,NULL,0);
+    s->current_file_ok = (err == UNZ_OK);
+    return err;
+}
+
+
+/*
+  Try locate the file szFileName in the zipfile.
+  For the iCaseSensitivity signification, see unzipStringFileNameCompare
+
+  return value :
+  UNZ_OK if the file is found. It becomes the current file.
+  UNZ_END_OF_LIST_OF_FILE if the file is not found
+*/
+extern int ZEXPORT unzLocateFile (
+    unzFile file,
+    const char *szFileName,
+    int iCaseSensitivity)
+{
+    unz_s* s;
+    int err;
+
+    /* We remember the 'current' position in the file so that we can jump
+     * back there if we fail.
+     */
+    unz_file_info cur_file_infoSaved;
+    unz_file_info_internal cur_file_info_internalSaved;
+    uLong num_fileSaved;
+    uLong pos_in_central_dirSaved;
+
+
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+
+    if (strlen(szFileName)>=UNZ_MAXFILENAMEINZIP)
+        return UNZ_PARAMERROR;
+
+    s=(unz_s*)file;
+    if (!s->current_file_ok)
+        return UNZ_END_OF_LIST_OF_FILE;
+
+    /* Save the current state */
+    num_fileSaved = s->num_file;
+    pos_in_central_dirSaved = s->pos_in_central_dir;
+    cur_file_infoSaved = s->cur_file_info;
+    cur_file_info_internalSaved = s->cur_file_info_internal;
+
+    err = unzGoToFirstFile(file);
+
+    while (err == UNZ_OK)
+    {
+        char szCurrentFileName[UNZ_MAXFILENAMEINZIP+1];
+        err = unzGetCurrentFileInfo(file,NULL,
+                                    szCurrentFileName,sizeof(szCurrentFileName)-1,
+                                    NULL,0,NULL,0);
+        if (err == UNZ_OK)
+        {
+            if (unzStringFileNameCompare(szCurrentFileName,
+                                            szFileName,iCaseSensitivity)==0)
+                return UNZ_OK;
+            err = unzGoToNextFile(file);
+        }
+    }
+
+    /* We failed, so restore the state of the 'current file' to where we
+     * were.
+     */
+    s->num_file = num_fileSaved ;
+    s->pos_in_central_dir = pos_in_central_dirSaved ;
+    s->cur_file_info = cur_file_infoSaved;
+    s->cur_file_info_internal = cur_file_info_internalSaved;
+    return err;
+}
+
+
+/*
+///////////////////////////////////////////
+// Contributed by Ryan Haksi (mailto://cryogen@infoserve.net)
+// I need random access
+//
+// Further optimization could be realized by adding an ability
+// to cache the directory in memory. The goal being a single
+// comprehensive file read to put the file I need in a memory.
+*/
+
+/*
+typedef struct unz_file_pos_s
+{
+    uLong pos_in_zip_directory;   // offset in file
+    uLong num_of_file;            // # of file
+} unz_file_pos;
+*/
+
+extern int ZEXPORT unzGetFilePos(unzFile file,
+    unz_file_pos* file_pos)
+{
+    unz_s* s;
+
+    if (file==NULL || file_pos==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    if (!s->current_file_ok)
+        return UNZ_END_OF_LIST_OF_FILE;
+
+    file_pos->pos_in_zip_directory  = s->pos_in_central_dir;
+    file_pos->num_of_file           = s->num_file;
+
+    return UNZ_OK;
+}
+
+extern int ZEXPORT unzGoToFilePos(
+    unzFile file,
+    unz_file_pos* file_pos)
+{
+    unz_s* s;
+    int err;
+
+    if (file==NULL || file_pos==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+
+    /* jump to the right spot */
+    s->pos_in_central_dir = file_pos->pos_in_zip_directory;
+    s->num_file           = file_pos->num_of_file;
+
+    /* set the current file */
+    err = unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info,
+                                               &s->cur_file_info_internal,
+                                               NULL,0,NULL,0,NULL,0);
+    /* return results */
+    s->current_file_ok = (err == UNZ_OK);
+    return err;
+}
+
+/*
+// Unzip Helper Functions - should be here?
+///////////////////////////////////////////
+*/
+
+/*
+  Read the local header of the current zipfile
+  Check the coherency of the local header and info in the end of central
+        directory about this file
+  store in *piSizeVar the size of extra info in local header
+        (filename and size of extra field data)
+*/
+local int unzlocal_CheckCurrentFileCoherencyHeader (
+    unz_s* s,
+    uInt* piSizeVar,
+    uLong *poffset_local_extrafield,
+    uInt  *psize_local_extrafield)
+{
+    uLong uMagic,uData,uFlags;
+    uLong size_filename;
+    uLong size_extra_field;
+    int err=UNZ_OK;
+
+    *piSizeVar = 0;
+    *poffset_local_extrafield = 0;
+    *psize_local_extrafield = 0;
+
+    if (ZSEEK(s->z_filefunc, s->filestream,s->cur_file_info_internal.offset_curfile +
+                                s->byte_before_the_zipfile,ZLIB_FILEFUNC_SEEK_SET)!=0)
+        return UNZ_ERRNO;
+
+
+    if (err==UNZ_OK)
+        if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uMagic) != UNZ_OK)
+            err=UNZ_ERRNO;
+        else if (uMagic!=0x04034b50)
+            err=UNZ_BADZIPFILE;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&uData) != UNZ_OK)
+        err=UNZ_ERRNO;
+/*
+    else if ((err==UNZ_OK) && (uData!=s->cur_file_info.wVersion))
+        err=UNZ_BADZIPFILE;
+*/
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&uFlags) != UNZ_OK)
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&uData) != UNZ_OK)
+        err=UNZ_ERRNO;
+    else if ((err==UNZ_OK) && (uData!=s->cur_file_info.compression_method))
+        err=UNZ_BADZIPFILE;
+
+    if ((err==UNZ_OK) && (s->cur_file_info.compression_method!=0) &&
+                         (s->cur_file_info.compression_method!=Z_DEFLATED))
+        err=UNZ_BADZIPFILE;
+
+    if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uData) != UNZ_OK) /* date/time */
+        err=UNZ_ERRNO;
+
+    if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uData) != UNZ_OK) /* crc */
+        err=UNZ_ERRNO;
+    else if ((err==UNZ_OK) && (uData!=s->cur_file_info.crc) &&
+                              ((uFlags & 8)==0))
+        err=UNZ_BADZIPFILE;
+
+    if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uData) != UNZ_OK) /* size compr */
+        err=UNZ_ERRNO;
+    else if ((err==UNZ_OK) && (uData!=s->cur_file_info.compressed_size) &&
+                              ((uFlags & 8)==0))
+        err=UNZ_BADZIPFILE;
+
+    if (unzlocal_getLong(&s->z_filefunc, s->filestream,&uData) != UNZ_OK) /* size uncompr */
+        err=UNZ_ERRNO;
+    else if ((err==UNZ_OK) && (uData!=s->cur_file_info.uncompressed_size) &&
+                              ((uFlags & 8)==0))
+        err=UNZ_BADZIPFILE;
+
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&size_filename) != UNZ_OK)
+        err=UNZ_ERRNO;
+    else if ((err==UNZ_OK) && (size_filename!=s->cur_file_info.size_filename))
+        err=UNZ_BADZIPFILE;
+
+    *piSizeVar += (uInt)size_filename;
+
+    if (unzlocal_getShort(&s->z_filefunc, s->filestream,&size_extra_field) != UNZ_OK)
+        err=UNZ_ERRNO;
+    *poffset_local_extrafield= s->cur_file_info_internal.offset_curfile +
+                                    SIZEZIPLOCALHEADER + size_filename;
+    *psize_local_extrafield = (uInt)size_extra_field;
+
+    *piSizeVar += (uInt)size_extra_field;
+
+    return err;
+}
+
+/*
+  Open for reading data the current file in the zipfile.
+  If there is no error and the file is opened, the return value is UNZ_OK.
+*/
+extern int ZEXPORT unzOpenCurrentFile3 (
+    unzFile file,
+    int* method,
+    int* level,
+    int raw,
+    const char* password)
+{
+    int err=UNZ_OK;
+    uInt iSizeVar;
+    unz_s* s;
+    file_in_zip_read_info_s* pfile_in_zip_read_info;
+    uLong offset_local_extrafield;  /* offset of the local extra field */
+    uInt  size_local_extrafield;    /* size of the local extra field */
+#    ifndef NOUNCRYPT
+    char source[12];
+#    else
+    if (password != NULL)
+        return UNZ_PARAMERROR;
+#    endif
+
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    if (!s->current_file_ok)
+        return UNZ_PARAMERROR;
+
+    if (s->pfile_in_zip_read != NULL)
+        unzCloseCurrentFile(file);
+
+    if (unzlocal_CheckCurrentFileCoherencyHeader(s,&iSizeVar,
+                &offset_local_extrafield,&size_local_extrafield)!=UNZ_OK)
+        return UNZ_BADZIPFILE;
+
+    pfile_in_zip_read_info = (file_in_zip_read_info_s*)
+                                        ALLOC(sizeof(file_in_zip_read_info_s));
+    if (pfile_in_zip_read_info==NULL)
+        return UNZ_INTERNALERROR;
+
+    pfile_in_zip_read_info->read_buffer=(char*)ALLOC(UNZ_BUFSIZE);
+    pfile_in_zip_read_info->offset_local_extrafield = offset_local_extrafield;
+    pfile_in_zip_read_info->size_local_extrafield = size_local_extrafield;
+    pfile_in_zip_read_info->pos_local_extrafield=0;
+    pfile_in_zip_read_info->raw=raw;
+
+    if (pfile_in_zip_read_info->read_buffer==NULL)
+    {
+        TRYFREE(pfile_in_zip_read_info);
+        return UNZ_INTERNALERROR;
+    }
+
+    pfile_in_zip_read_info->stream_initialised=0;
+
+    if (method!=NULL)
+        *method = (int)s->cur_file_info.compression_method;
+
+    if (level!=NULL)
+    {
+        *level = 6;
+        switch (s->cur_file_info.flag & 0x06)
+        {
+          case 6 : *level = 1; break;
+          case 4 : *level = 2; break;
+          case 2 : *level = 9; break;
+        }
+    }
+
+    if ((s->cur_file_info.compression_method!=0) &&
+        (s->cur_file_info.compression_method!=Z_DEFLATED))
+        err=UNZ_BADZIPFILE;
+
+    pfile_in_zip_read_info->crc32_wait=s->cur_file_info.crc;
+    pfile_in_zip_read_info->crc32=0;
+    pfile_in_zip_read_info->compression_method =
+            s->cur_file_info.compression_method;
+    pfile_in_zip_read_info->filestream=s->filestream;
+    pfile_in_zip_read_info->z_filefunc=s->z_filefunc;
+    pfile_in_zip_read_info->byte_before_the_zipfile=s->byte_before_the_zipfile;
+
+    pfile_in_zip_read_info->stream.total_out = 0;
+
+    if ((s->cur_file_info.compression_method==Z_DEFLATED) &&
+        (!raw))
+    {
+      pfile_in_zip_read_info->stream.zalloc = (alloc_func)0;
+      pfile_in_zip_read_info->stream.zfree = (free_func)0;
+      pfile_in_zip_read_info->stream.opaque = (voidpf)0;
+      pfile_in_zip_read_info->stream.next_in = (Bytef*)0;
+      pfile_in_zip_read_info->stream.avail_in = 0;
+
+      err=inflateInit2(&pfile_in_zip_read_info->stream, -MAX_WBITS);
+      if (err == Z_OK)
+        pfile_in_zip_read_info->stream_initialised=1;
+      else
+      {
+        TRYFREE(pfile_in_zip_read_info);
+        return err;
+      }
+        /* windowBits is passed < 0 to tell that there is no zlib header.
+         * Note that in this case inflate *requires* an extra "dummy" byte
+         * after the compressed stream in order to complete decompression and
+         * return Z_STREAM_END.
+         * In unzip, i don't wait absolutely Z_STREAM_END because I known the
+         * size of both compressed and uncompressed data
+         */
+    }
+    pfile_in_zip_read_info->rest_read_compressed =
+            s->cur_file_info.compressed_size ;
+    pfile_in_zip_read_info->rest_read_uncompressed =
+            s->cur_file_info.uncompressed_size ;
+
+
+    pfile_in_zip_read_info->pos_in_zipfile =
+            s->cur_file_info_internal.offset_curfile + SIZEZIPLOCALHEADER +
+              iSizeVar;
+
+    pfile_in_zip_read_info->stream.avail_in = (uInt)0;
+
+    s->pfile_in_zip_read = pfile_in_zip_read_info;
+
+#    ifndef NOUNCRYPT
+    if (password != NULL)
+    {
+        int i;
+        s->pcrc_32_tab = get_crc_table();
+        init_keys(password,s->keys,s->pcrc_32_tab);
+        if (ZSEEK(s->z_filefunc, s->filestream,
+                  s->pfile_in_zip_read->pos_in_zipfile +
+                     s->pfile_in_zip_read->byte_before_the_zipfile,
+                  SEEK_SET)!=0)
+            return UNZ_INTERNALERROR;
+        if(ZREAD(s->z_filefunc, s->filestream,source, 12)<12)
+            return UNZ_INTERNALERROR;
+
+        for (i = 0; i<12; i++)
+            zdecode(s->keys,s->pcrc_32_tab,source[i]);
+
+        s->pfile_in_zip_read->pos_in_zipfile+=12;
+        s->encrypted=1;
+    }
+#    endif
+
+
+    return UNZ_OK;
+}
+
+extern int ZEXPORT unzOpenCurrentFile (
+    unzFile file)
+{
+    return unzOpenCurrentFile3(file, NULL, NULL, 0, NULL);
+}
+
+extern int ZEXPORT unzOpenCurrentFilePassword (
+    unzFile file,
+    const char* password)
+{
+    return unzOpenCurrentFile3(file, NULL, NULL, 0, password);
+}
+
+extern int ZEXPORT unzOpenCurrentFile2 (
+    unzFile file,
+    int* method,
+    int* level,
+    int raw)
+{
+    return unzOpenCurrentFile3(file, method, level, raw, NULL);
+}
+
+/*
+  Read bytes from the current file.
+  buf contain buffer where data must be copied
+  len the size of buf.
+
+  return the number of byte copied if somes bytes are copied
+  return 0 if the end of file was reached
+  return <0 with error code if there is an error
+    (UNZ_ERRNO for IO error, or zLib error for uncompress error)
+*/
+extern int ZEXPORT unzReadCurrentFile  (
+    unzFile file,
+    voidp buf,
+    unsigned len)
+{
+    int err=UNZ_OK;
+    uInt iRead = 0;
+    unz_s* s;
+    file_in_zip_read_info_s* pfile_in_zip_read_info;
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+    if (pfile_in_zip_read_info==NULL)
+        return UNZ_PARAMERROR;
+
+
+    if ((pfile_in_zip_read_info->read_buffer == NULL))
+        return UNZ_END_OF_LIST_OF_FILE;
+    if (len==0)
+        return 0;
+
+    pfile_in_zip_read_info->stream.next_out = (Bytef*)buf;
+
+    pfile_in_zip_read_info->stream.avail_out = (uInt)len;
+
+    if ((len>pfile_in_zip_read_info->rest_read_uncompressed) &&
+        (!(pfile_in_zip_read_info->raw)))
+        pfile_in_zip_read_info->stream.avail_out =
+            (uInt)pfile_in_zip_read_info->rest_read_uncompressed;
+
+    if ((len>pfile_in_zip_read_info->rest_read_compressed+
+           pfile_in_zip_read_info->stream.avail_in) &&
+         (pfile_in_zip_read_info->raw))
+        pfile_in_zip_read_info->stream.avail_out =
+            (uInt)pfile_in_zip_read_info->rest_read_compressed+
+            pfile_in_zip_read_info->stream.avail_in;
+
+    while (pfile_in_zip_read_info->stream.avail_out>0)
+    {
+        if ((pfile_in_zip_read_info->stream.avail_in==0) &&
+            (pfile_in_zip_read_info->rest_read_compressed>0))
+        {
+            uInt uReadThis = UNZ_BUFSIZE;
+            if (pfile_in_zip_read_info->rest_read_compressed<uReadThis)
+                uReadThis = (uInt)pfile_in_zip_read_info->rest_read_compressed;
+            if (uReadThis == 0)
+                return UNZ_EOF;
+            if (ZSEEK(pfile_in_zip_read_info->z_filefunc,
+                      pfile_in_zip_read_info->filestream,
+                      pfile_in_zip_read_info->pos_in_zipfile +
+                         pfile_in_zip_read_info->byte_before_the_zipfile,
+                         ZLIB_FILEFUNC_SEEK_SET)!=0)
+                return UNZ_ERRNO;
+            if (ZREAD(pfile_in_zip_read_info->z_filefunc,
+                      pfile_in_zip_read_info->filestream,
+                      pfile_in_zip_read_info->read_buffer,
+                      uReadThis)!=uReadThis)
+                return UNZ_ERRNO;
+
+
+#            ifndef NOUNCRYPT
+            if(s->encrypted)
+            {
+                uInt i;
+                for(i=0;i<uReadThis;i++)
+                  pfile_in_zip_read_info->read_buffer[i] =
+                      zdecode(s->keys,s->pcrc_32_tab,
+                              pfile_in_zip_read_info->read_buffer[i]);
+            }
+#            endif
+
+
+            pfile_in_zip_read_info->pos_in_zipfile += uReadThis;
+
+            pfile_in_zip_read_info->rest_read_compressed-=uReadThis;
+
+            pfile_in_zip_read_info->stream.next_in =
+                (Bytef*)pfile_in_zip_read_info->read_buffer;
+            pfile_in_zip_read_info->stream.avail_in = (uInt)uReadThis;
+        }
+
+        if ((pfile_in_zip_read_info->compression_method==0) || (pfile_in_zip_read_info->raw))
+        {
+            uInt uDoCopy,i ;
+
+            if ((pfile_in_zip_read_info->stream.avail_in == 0) &&
+                (pfile_in_zip_read_info->rest_read_compressed == 0))
+                return (iRead==0) ? UNZ_EOF : iRead;
+
+            if (pfile_in_zip_read_info->stream.avail_out <
+                            pfile_in_zip_read_info->stream.avail_in)
+                uDoCopy = pfile_in_zip_read_info->stream.avail_out ;
+            else
+                uDoCopy = pfile_in_zip_read_info->stream.avail_in ;
+
+            for (i=0;i<uDoCopy;i++)
+                *(pfile_in_zip_read_info->stream.next_out+i) =
+                        *(pfile_in_zip_read_info->stream.next_in+i);
+
+            pfile_in_zip_read_info->crc32 = crc32(pfile_in_zip_read_info->crc32,
+                                pfile_in_zip_read_info->stream.next_out,
+                                uDoCopy);
+            pfile_in_zip_read_info->rest_read_uncompressed-=uDoCopy;
+            pfile_in_zip_read_info->stream.avail_in -= uDoCopy;
+            pfile_in_zip_read_info->stream.avail_out -= uDoCopy;
+            pfile_in_zip_read_info->stream.next_out += uDoCopy;
+            pfile_in_zip_read_info->stream.next_in += uDoCopy;
+            pfile_in_zip_read_info->stream.total_out += uDoCopy;
+            iRead += uDoCopy;
+        }
+        else
+        {
+            uLong uTotalOutBefore,uTotalOutAfter;
+            const Bytef *bufBefore;
+            uLong uOutThis;
+            int flush=Z_SYNC_FLUSH;
+
+            uTotalOutBefore = pfile_in_zip_read_info->stream.total_out;
+            bufBefore = pfile_in_zip_read_info->stream.next_out;
+
+            /*
+            if ((pfile_in_zip_read_info->rest_read_uncompressed ==
+                     pfile_in_zip_read_info->stream.avail_out) &&
+                (pfile_in_zip_read_info->rest_read_compressed == 0))
+                flush = Z_FINISH;
+            */
+            err=inflate(&pfile_in_zip_read_info->stream,flush);
+
+            if ((err>=0) && (pfile_in_zip_read_info->stream.msg!=NULL))
+              err = Z_DATA_ERROR;
+
+            uTotalOutAfter = pfile_in_zip_read_info->stream.total_out;
+            uOutThis = uTotalOutAfter-uTotalOutBefore;
+
+            pfile_in_zip_read_info->crc32 =
+                crc32(pfile_in_zip_read_info->crc32,bufBefore,
+                        (uInt)(uOutThis));
+
+            pfile_in_zip_read_info->rest_read_uncompressed -=
+                uOutThis;
+
+            iRead += (uInt)(uTotalOutAfter - uTotalOutBefore);
+
+            if (err==Z_STREAM_END)
+                return (iRead==0) ? UNZ_EOF : iRead;
+            if (err!=Z_OK)
+                break;
+        }
+    }
+
+    if (err==Z_OK)
+        return iRead;
+    return err;
+}
+
+
+/*
+  Give the current position in uncompressed data
+*/
+extern z_off_t ZEXPORT unztell (
+    unzFile file)
+{
+    unz_s* s;
+    file_in_zip_read_info_s* pfile_in_zip_read_info;
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+    if (pfile_in_zip_read_info==NULL)
+        return UNZ_PARAMERROR;
+
+    return (z_off_t)pfile_in_zip_read_info->stream.total_out;
+}
+
+
+/*
+  return 1 if the end of file was reached, 0 elsewhere
+*/
+extern int ZEXPORT unzeof (
+    unzFile file)
+{
+    unz_s* s;
+    file_in_zip_read_info_s* pfile_in_zip_read_info;
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+    if (pfile_in_zip_read_info==NULL)
+        return UNZ_PARAMERROR;
+
+    if (pfile_in_zip_read_info->rest_read_uncompressed == 0)
+        return 1;
+    else
+        return 0;
+}
+
+
+
+/*
+  Read extra field from the current file (opened by unzOpenCurrentFile)
+  This is the local-header version of the extra field (sometimes, there is
+    more info in the local-header version than in the central-header)
+
+  if buf==NULL, it return the size of the local extra field that can be read
+
+  if buf!=NULL, len is the size of the buffer, the extra header is copied in
+    buf.
+  the return value is the number of bytes copied in buf, or (if <0)
+    the error code
+*/
+extern int ZEXPORT unzGetLocalExtrafield (
+    unzFile file,
+    voidp buf,
+    unsigned len)
+{
+    unz_s* s;
+    file_in_zip_read_info_s* pfile_in_zip_read_info;
+    uInt read_now;
+    uLong size_to_read;
+
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+    if (pfile_in_zip_read_info==NULL)
+        return UNZ_PARAMERROR;
+
+    size_to_read = (pfile_in_zip_read_info->size_local_extrafield -
+                pfile_in_zip_read_info->pos_local_extrafield);
+
+    if (buf==NULL)
+        return (int)size_to_read;
+
+    if (len>size_to_read)
+        read_now = (uInt)size_to_read;
+    else
+        read_now = (uInt)len ;
+
+    if (read_now==0)
+        return 0;
+
+    if (ZSEEK(pfile_in_zip_read_info->z_filefunc,
+              pfile_in_zip_read_info->filestream,
+              pfile_in_zip_read_info->offset_local_extrafield +
+              pfile_in_zip_read_info->pos_local_extrafield,
+              ZLIB_FILEFUNC_SEEK_SET)!=0)
+        return UNZ_ERRNO;
+
+    if (ZREAD(pfile_in_zip_read_info->z_filefunc,
+              pfile_in_zip_read_info->filestream,
+              buf,read_now)!=read_now)
+        return UNZ_ERRNO;
+
+    return (int)read_now;
+}
+
+/*
+  Close the file in zip opened with unzipOpenCurrentFile
+  Return UNZ_CRCERROR if all the file was read but the CRC is not good
+*/
+extern int ZEXPORT unzCloseCurrentFile (
+    unzFile file)
+{
+    int err=UNZ_OK;
+
+    unz_s* s;
+    file_in_zip_read_info_s* pfile_in_zip_read_info;
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+    if (pfile_in_zip_read_info==NULL)
+        return UNZ_PARAMERROR;
+
+
+    if ((pfile_in_zip_read_info->rest_read_uncompressed == 0) &&
+        (!pfile_in_zip_read_info->raw))
+    {
+        if (pfile_in_zip_read_info->crc32 != pfile_in_zip_read_info->crc32_wait)
+            err=UNZ_CRCERROR;
+    }
+
+
+    TRYFREE(pfile_in_zip_read_info->read_buffer);
+    pfile_in_zip_read_info->read_buffer = NULL;
+    if (pfile_in_zip_read_info->stream_initialised)
+        inflateEnd(&pfile_in_zip_read_info->stream);
+
+    pfile_in_zip_read_info->stream_initialised = 0;
+    TRYFREE(pfile_in_zip_read_info);
+
+    s->pfile_in_zip_read=NULL;
+
+    return err;
+}
+
+
+/*
+  Get the global comment string of the ZipFile, in the szComment buffer.
+  uSizeBuf is the size of the szComment buffer.
+  return the number of byte copied or an error code <0
+*/
+extern int ZEXPORT unzGetGlobalComment (
+    unzFile file,
+    char *szComment,
+    uLong uSizeBuf)
+{
+    int err=UNZ_OK;
+    unz_s* s;
+    uLong uReadThis ;
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+
+    uReadThis = uSizeBuf;
+    if (uReadThis>s->gi.size_comment)
+        uReadThis = s->gi.size_comment;
+
+    if (ZSEEK(s->z_filefunc,s->filestream,s->central_pos+22,ZLIB_FILEFUNC_SEEK_SET)!=0)
+        return UNZ_ERRNO;
+
+    if (uReadThis>0)
+    {
+      *szComment='\0';
+      if (ZREAD(s->z_filefunc,s->filestream,szComment,uReadThis)!=uReadThis)
+        return UNZ_ERRNO;
+    }
+
+    if ((szComment != NULL) && (uSizeBuf > s->gi.size_comment))
+        *(szComment+s->gi.size_comment)='\0';
+    return (int)uReadThis;
+}
+
+/* Additions by RX '2004 */
+extern uLong ZEXPORT unzGetOffset (
+    unzFile file)
+{
+    unz_s* s;
+
+    if (file==NULL)
+          return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+    if (!s->current_file_ok)
+      return 0;
+    if (s->gi.number_entry != 0 && s->gi.number_entry != 0xffff)
+      if (s->num_file==s->gi.number_entry)
+         return 0;
+    return s->pos_in_central_dir;
+}
+
+extern int ZEXPORT unzSetOffset (
+        unzFile file,
+        uLong pos)
+{
+    unz_s* s;
+    int err;
+
+    if (file==NULL)
+        return UNZ_PARAMERROR;
+    s=(unz_s*)file;
+
+    s->pos_in_central_dir = pos;
+    s->num_file = s->gi.number_entry;      /* hack */
+    err = unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info,
+                                              &s->cur_file_info_internal,
+                                              NULL,0,NULL,0,NULL,0);
+    s->current_file_ok = (err == UNZ_OK);
+    return err;
+}
diff --git a/updater/zlib123/contrib/minizip/munzip.h b/updater/zlib123/contrib/minizip/munzip.h
new file mode 100644
index 0000000..1c23a9a
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/munzip.h
@@ -0,0 +1,355 @@
+/* unzip.h -- IO for uncompress .zip files using zlib
+   Version 1.01e, February 12th, 2005
+
+   Copyright (C) 1998-2005 Gilles Vollant
+
+   This unzip package allow extract file from .ZIP file, compatible with PKZip 2.04g
+     WinZip, InfoZip tools and compatible.
+
+   Multi volume ZipFile (span) are not supported.
+   Encryption compatible with pkzip 2.04g only supported
+   Old compressions used by old PKZip 1.x are not supported
+
+
+   I WAIT FEEDBACK at mail info@winimage.com
+   Visit also http://www.winimage.com/zLibDll/unzip.htm for evolution
+
+   Condition of use and distribution are the same than zlib :
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the authors be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+
+*/
+
+/* for more info about .ZIP format, see
+      http://www.info-zip.org/pub/infozip/doc/appnote-981119-iz.zip
+      http://www.info-zip.org/pub/infozip/doc/
+   PkWare has also a specification at :
+      ftp://ftp.pkware.com/probdesc.zip
+*/
+
+#ifndef _unz_H
+#define _unz_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#ifndef _ZLIB_H
+#include "zlib.h"
+#endif
+
+#ifndef _ZLIBIOAPI_H
+#include "ioapi.h"
+#endif
+
+#if defined(STRICTUNZIP) || defined(STRICTZIPUNZIP)
+/* like the STRICT of WIN32, we define a pointer that cannot be converted
+    from (void*) without cast */
+typedef struct TagunzFile__ { int unused; } unzFile__;
+typedef unzFile__ *unzFile;
+#else
+typedef voidp unzFile;
+#endif
+
+
+#define UNZ_OK                          (0)
+#define UNZ_END_OF_LIST_OF_FILE         (-100)
+#define UNZ_ERRNO                       (Z_ERRNO)
+#define UNZ_EOF                         (0)
+#define UNZ_PARAMERROR                  (-102)
+#define UNZ_BADZIPFILE                  (-103)
+#define UNZ_INTERNALERROR               (-104)
+#define UNZ_CRCERROR                    (-105)
+
+/* tm_unz contain date/time info */
+typedef struct tm_unz_s
+{
+    uInt tm_sec;            /* seconds after the minute - [0,59] */
+    uInt tm_min;            /* minutes after the hour - [0,59] */
+    uInt tm_hour;           /* hours since midnight - [0,23] */
+    uInt tm_mday;           /* day of the month - [1,31] */
+    uInt tm_mon;            /* months since January - [0,11] */
+    uInt tm_year;           /* years - [1980..2044] */
+} tm_unz;
+
+/* unz_global_info structure contain global data about the ZIPfile
+   These data comes from the end of central dir */
+typedef struct unz_global_info_s
+{
+    uLong number_entry;         /* total number of entries in
+                       the central dir on this disk */
+    uLong size_comment;         /* size of the global comment of the zipfile */
+} unz_global_info;
+
+
+/* unz_file_info contain information about a file in the zipfile */
+typedef struct unz_file_info_s
+{
+    uLong version;              /* version made by                 2 bytes */
+    uLong version_needed;       /* version needed to extract       2 bytes */
+    uLong flag;                 /* general purpose bit flag        2 bytes */
+    uLong compression_method;   /* compression method              2 bytes */
+    uLong dosDate;              /* last mod file date in Dos fmt   4 bytes */
+    uLong crc;                  /* crc-32                          4 bytes */
+    uLong compressed_size;      /* compressed size                 4 bytes */
+    uLong uncompressed_size;    /* uncompressed size               4 bytes */
+    uLong size_filename;        /* filename length                 2 bytes */
+    uLong size_file_extra;      /* extra field length              2 bytes */
+    uLong size_file_comment;    /* file comment length             2 bytes */
+
+    uLong disk_num_start;       /* disk number start               2 bytes */
+    uLong internal_fa;          /* internal file attributes        2 bytes */
+    uLong external_fa;          /* external file attributes        4 bytes */
+
+    tm_unz tmu_date;
+} unz_file_info;
+
+extern int ZEXPORT unzStringFileNameCompare OF ((const char* fileName1,
+                                                 const char* fileName2,
+                                                 int iCaseSensitivity));
+/*
+   Compare two filename (fileName1,fileName2).
+   If iCaseSenisivity = 1, comparision is case sensitivity (like strcmp)
+   If iCaseSenisivity = 2, comparision is not case sensitivity (like strcmpi
+                                or strcasecmp)
+   If iCaseSenisivity = 0, case sensitivity is defaut of your operating system
+    (like 1 on Unix, 2 on Windows)
+*/
+
+
+extern unzFile ZEXPORT unzOpen OF((const char *path));
+/*
+  Open a Zip file. path contain the full pathname (by example,
+     on a Windows XP computer "c:\\zlib\\zlib113.zip" or on an Unix computer
+     "zlib/zlib113.zip".
+     If the zipfile cannot be opened (file don't exist or in not valid), the
+       return value is NULL.
+     Else, the return value is a unzFile Handle, usable with other function
+       of this unzip package.
+*/
+
+extern unzFile ZEXPORT unzOpen2 OF((const char *path,
+                                    zlib_filefunc_def* pzlib_filefunc_def));
+/*
+   Open a Zip file, like unzOpen, but provide a set of file low level API
+      for read/write the zip file (see ioapi.h)
+*/
+
+extern int ZEXPORT unzClose OF((unzFile file));
+/*
+  Close a ZipFile opened with unzipOpen.
+  If there is files inside the .Zip opened with unzOpenCurrentFile (see later),
+    these files MUST be closed with unzipCloseCurrentFile before call unzipClose.
+  return UNZ_OK if there is no problem. */
+
+extern int ZEXPORT unzGetGlobalInfo OF((unzFile file,
+                                        unz_global_info *pglobal_info));
+/*
+  Write info about the ZipFile in the *pglobal_info structure.
+  No preparation of the structure is needed
+  return UNZ_OK if there is no problem. */
+
+
+extern int ZEXPORT unzGetGlobalComment OF((unzFile file,
+                                           char *szComment,
+                                           uLong uSizeBuf));
+/*
+  Get the global comment string of the ZipFile, in the szComment buffer.
+  uSizeBuf is the size of the szComment buffer.
+  return the number of byte copied or an error code <0
+*/
+
+
+/***************************************************************************/
+/* Unzip package allow you browse the directory of the zipfile */
+
+extern int ZEXPORT unzGoToFirstFile OF((unzFile file));
+/*
+  Set the current file of the zipfile to the first file.
+  return UNZ_OK if there is no problem
+*/
+
+extern int ZEXPORT unzGoToNextFile OF((unzFile file));
+/*
+  Set the current file of the zipfile to the next file.
+  return UNZ_OK if there is no problem
+  return UNZ_END_OF_LIST_OF_FILE if the actual file was the latest.
+*/
+
+extern int ZEXPORT unzLocateFile OF((unzFile file,
+                     const char *szFileName,
+                     int iCaseSensitivity));
+/*
+  Try locate the file szFileName in the zipfile.
+  For the iCaseSensitivity signification, see unzStringFileNameCompare
+
+  return value :
+  UNZ_OK if the file is found. It becomes the current file.
+  UNZ_END_OF_LIST_OF_FILE if the file is not found
+*/
+
+
+/* ****************************************** */
+/* Ryan supplied functions */
+/* unz_file_info contain information about a file in the zipfile */
+typedef struct unz_file_pos_s
+{
+    uLong pos_in_zip_directory;   /* offset in zip file directory */
+    uLong num_of_file;            /* # of file */
+} unz_file_pos;
+
+extern int ZEXPORT unzGetFilePos(
+    unzFile file,
+    unz_file_pos* file_pos);
+
+extern int ZEXPORT unzGoToFilePos(
+    unzFile file,
+    unz_file_pos* file_pos);
+
+/* ****************************************** */
+
+extern int ZEXPORT unzGetCurrentFileInfo OF((unzFile file,
+                         unz_file_info *pfile_info,
+                         char *szFileName,
+                         uLong fileNameBufferSize,
+                         void *extraField,
+                         uLong extraFieldBufferSize,
+                         char *szComment,
+                         uLong commentBufferSize));
+/*
+  Get Info about the current file
+  if pfile_info!=NULL, the *pfile_info structure will contain somes info about
+        the current file
+  if szFileName!=NULL, the filemane string will be copied in szFileName
+            (fileNameBufferSize is the size of the buffer)
+  if extraField!=NULL, the extra field information will be copied in extraField
+            (extraFieldBufferSize is the size of the buffer).
+            This is the Central-header version of the extra field
+  if szComment!=NULL, the comment string of the file will be copied in szComment
+            (commentBufferSize is the size of the buffer)
+*/
+
+/***************************************************************************/
+/* for reading the content of the current zipfile, you can open it, read data
+   from it, and close it (you can close it before reading all the file)
+   */
+
+extern int ZEXPORT unzOpenCurrentFile OF((unzFile file));
+/*
+  Open for reading data the current file in the zipfile.
+  If there is no error, the return value is UNZ_OK.
+*/
+
+extern int ZEXPORT unzOpenCurrentFilePassword OF((unzFile file,
+                                                  const char* password));
+/*
+  Open for reading data the current file in the zipfile.
+  password is a crypting password
+  If there is no error, the return value is UNZ_OK.
+*/
+
+extern int ZEXPORT unzOpenCurrentFile2 OF((unzFile file,
+                                           int* method,
+                                           int* level,
+                                           int raw));
+/*
+  Same than unzOpenCurrentFile, but open for read raw the file (not uncompress)
+    if raw==1
+  *method will receive method of compression, *level will receive level of
+     compression
+  note : you can set level parameter as NULL (if you did not want known level,
+         but you CANNOT set method parameter as NULL
+*/
+
+extern int ZEXPORT unzOpenCurrentFile3 OF((unzFile file,
+                                           int* method,
+                                           int* level,
+                                           int raw,
+                                           const char* password));
+/*
+  Same than unzOpenCurrentFile, but open for read raw the file (not uncompress)
+    if raw==1
+  *method will receive method of compression, *level will receive level of
+     compression
+  note : you can set level parameter as NULL (if you did not want known level,
+         but you CANNOT set method parameter as NULL
+*/
+
+
+extern int ZEXPORT unzCloseCurrentFile OF((unzFile file));
+/*
+  Close the file in zip opened with unzOpenCurrentFile
+  Return UNZ_CRCERROR if all the file was read but the CRC is not good
+*/
+
+extern int ZEXPORT unzReadCurrentFile OF((unzFile file,
+                      voidp buf,
+                      unsigned len));
+/*
+  Read bytes from the current file (opened by unzOpenCurrentFile)
+  buf contain buffer where data must be copied
+  len the size of buf.
+
+  return the number of byte copied if somes bytes are copied
+  return 0 if the end of file was reached
+  return <0 with error code if there is an error
+    (UNZ_ERRNO for IO error, or zLib error for uncompress error)
+*/
+
+extern z_off_t ZEXPORT unztell OF((unzFile file));
+/*
+  Give the current position in uncompressed data
+*/
+
+extern int ZEXPORT unzeof OF((unzFile file));
+/*
+  return 1 if the end of file was reached, 0 elsewhere
+*/
+
+extern int ZEXPORT unzGetLocalExtrafield OF((unzFile file,
+                                             voidp buf,
+                                             unsigned len));
+/*
+  Read extra field from the current file (opened by unzOpenCurrentFile)
+  This is the local-header version of the extra field (sometimes, there is
+    more info in the local-header version than in the central-header)
+
+  if buf==NULL, it return the size of the local extra field
+
+  if buf!=NULL, len is the size of the buffer, the extra header is copied in
+    buf.
+  the return value is the number of bytes copied in buf, or (if <0)
+    the error code
+*/
+
+/***************************************************************************/
+
+/* Get the current file offset */
+extern uLong ZEXPORT unzGetOffset (unzFile file);
+
+/* Set the current file offset */
+extern int ZEXPORT unzSetOffset (unzFile file, uLong pos);
+
+
+extern int ZEXPORT unzip_file(const char *zipfilename, const char *out_dir);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* _unz_H */
diff --git a/updater/zlib123/contrib/minizip/mzip.c b/updater/zlib123/contrib/minizip/mzip.c
new file mode 100644
index 0000000..400e2ba
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/mzip.c
@@ -0,0 +1,1219 @@
+/* zip.c -- IO on .zip files using zlib
+   Version 1.01e, February 12th, 2005
+
+   27 Dec 2004 Rolf Kalbermatter
+   Modification to zipOpen2 to support globalComment retrieval.
+
+   Copyright (C) 1998-2005 Gilles Vollant
+
+   Read zip.h for more info
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include "zlib.h"
+#include "zip.h"
+
+#ifdef STDC
+#  include <stddef.h>
+#  include <string.h>
+#  include <stdlib.h>
+#endif
+#ifdef NO_ERRNO_H
+    extern int errno;
+#else
+#   include <errno.h>
+#endif
+
+
+#ifndef local
+#  define local static
+#endif
+/* compile with -Dlocal if your debugger can't find static symbols */
+
+#ifndef VERSIONMADEBY
+# define VERSIONMADEBY   (0x0) /* platform depedent */
+#endif
+
+#ifndef Z_BUFSIZE
+#define Z_BUFSIZE (16384)
+#endif
+
+#ifndef Z_MAXFILENAMEINZIP
+#define Z_MAXFILENAMEINZIP (256)
+#endif
+
+#ifndef ALLOC
+# define ALLOC(size) (malloc(size))
+#endif
+#ifndef TRYFREE
+# define TRYFREE(p) {if (p) free(p);}
+#endif
+
+/*
+#define SIZECENTRALDIRITEM (0x2e)
+#define SIZEZIPLOCALHEADER (0x1e)
+*/
+
+/* I've found an old Unix (a SunOS 4.1.3_U1) without all SEEK_* defined.... */
+
+#ifndef SEEK_CUR
+#define SEEK_CUR    1
+#endif
+
+#ifndef SEEK_END
+#define SEEK_END    2
+#endif
+
+#ifndef SEEK_SET
+#define SEEK_SET    0
+#endif
+
+#ifndef DEF_MEM_LEVEL
+#if MAX_MEM_LEVEL >= 8
+#  define DEF_MEM_LEVEL 8
+#else
+#  define DEF_MEM_LEVEL  MAX_MEM_LEVEL
+#endif
+#endif
+const char zip_copyright[] =
+   " zip 1.01 Copyright 1998-2004 Gilles Vollant - http://www.winimage.com/zLibDll";
+
+
+#define SIZEDATA_INDATABLOCK (4096-(4*4))
+
+#define LOCALHEADERMAGIC    (0x04034b50)
+#define CENTRALHEADERMAGIC  (0x02014b50)
+#define ENDHEADERMAGIC      (0x06054b50)
+
+#define FLAG_LOCALHEADER_OFFSET (0x06)
+#define CRC_LOCALHEADER_OFFSET  (0x0e)
+
+#define SIZECENTRALHEADER (0x2e) /* 46 */
+
+typedef struct linkedlist_datablock_internal_s
+{
+  struct linkedlist_datablock_internal_s* next_datablock;
+  uLong  avail_in_this_block;
+  uLong  filled_in_this_block;
+  uLong  unused; /* for future use and alignement */
+  unsigned char data[SIZEDATA_INDATABLOCK];
+} linkedlist_datablock_internal;
+
+typedef struct linkedlist_data_s
+{
+    linkedlist_datablock_internal* first_block;
+    linkedlist_datablock_internal* last_block;
+} linkedlist_data;
+
+
+typedef struct
+{
+    z_stream stream;            /* zLib stream structure for inflate */
+    int  stream_initialised;    /* 1 is stream is initialised */
+    uInt pos_in_buffered_data;  /* last written byte in buffered_data */
+
+    uLong pos_local_header;     /* offset of the local header of the file
+                                     currenty writing */
+    char* central_header;       /* central header data for the current file */
+    uLong size_centralheader;   /* size of the central header for cur file */
+    uLong flag;                 /* flag of the file currently writing */
+
+    int  method;                /* compression method of file currenty wr.*/
+    int  raw;                   /* 1 for directly writing raw data */
+    Byte buffered_data[Z_BUFSIZE];/* buffer contain compressed data to be writ*/
+    uLong dosDate;
+    uLong crc32;
+    int  encrypt;
+#ifndef NOCRYPT
+    unsigned long keys[3];     /* keys defining the pseudo-random sequence */
+    const unsigned long* pcrc_32_tab;
+    int crypt_header_size;
+#endif
+} curfile_info;
+
+typedef struct
+{
+    zlib_filefunc_def z_filefunc;
+    voidpf filestream;        /* io structore of the zipfile */
+    linkedlist_data central_dir;/* datablock with central dir in construction*/
+    int  in_opened_file_inzip;  /* 1 if a file in the zip is currently writ.*/
+    curfile_info ci;            /* info on the file curretly writing */
+
+    uLong begin_pos;            /* position of the beginning of the zipfile */
+    uLong add_position_when_writting_offset;
+    uLong number_entry;
+#ifndef NO_ADDFILEINEXISTINGZIP
+    char *globalcomment;
+#endif
+} zip_internal;
+
+
+
+#ifndef NOCRYPT
+#define INCLUDECRYPTINGCODE_IFCRYPTALLOWED
+#include "crypt.h"
+#endif
+
+local linkedlist_datablock_internal* allocate_new_datablock()
+{
+    linkedlist_datablock_internal* ldi;
+    ldi = (linkedlist_datablock_internal*)
+                 ALLOC(sizeof(linkedlist_datablock_internal));
+    if (ldi!=NULL)
+    {
+        ldi->next_datablock = NULL ;
+        ldi->filled_in_this_block = 0 ;
+        ldi->avail_in_this_block = SIZEDATA_INDATABLOCK ;
+    }
+    return ldi;
+}
+
+local void free_datablock(ldi)
+    linkedlist_datablock_internal* ldi;
+{
+    while (ldi!=NULL)
+    {
+        linkedlist_datablock_internal* ldinext = ldi->next_datablock;
+        TRYFREE(ldi);
+        ldi = ldinext;
+    }
+}
+
+local void init_linkedlist(ll)
+    linkedlist_data* ll;
+{
+    ll->first_block = ll->last_block = NULL;
+}
+
+local void free_linkedlist(ll)
+    linkedlist_data* ll;
+{
+    free_datablock(ll->first_block);
+    ll->first_block = ll->last_block = NULL;
+}
+
+
+local int add_data_in_datablock(ll,buf,len)
+    linkedlist_data* ll;
+    const void* buf;
+    uLong len;
+{
+    linkedlist_datablock_internal* ldi;
+    const unsigned char* from_copy;
+
+    if (ll==NULL)
+        return ZIP_INTERNALERROR;
+
+    if (ll->last_block == NULL)
+    {
+        ll->first_block = ll->last_block = allocate_new_datablock();
+        if (ll->first_block == NULL)
+            return ZIP_INTERNALERROR;
+    }
+
+    ldi = ll->last_block;
+    from_copy = (unsigned char*)buf;
+
+    while (len>0)
+    {
+        uInt copy_this;
+        uInt i;
+        unsigned char* to_copy;
+
+        if (ldi->avail_in_this_block==0)
+        {
+            ldi->next_datablock = allocate_new_datablock();
+            if (ldi->next_datablock == NULL)
+                return ZIP_INTERNALERROR;
+            ldi = ldi->next_datablock ;
+            ll->last_block = ldi;
+        }
+
+        if (ldi->avail_in_this_block < len)
+            copy_this = (uInt)ldi->avail_in_this_block;
+        else
+            copy_this = (uInt)len;
+
+        to_copy = &(ldi->data[ldi->filled_in_this_block]);
+
+        for (i=0;i<copy_this;i++)
+            *(to_copy+i)=*(from_copy+i);
+
+        ldi->filled_in_this_block += copy_this;
+        ldi->avail_in_this_block -= copy_this;
+        from_copy += copy_this ;
+        len -= copy_this;
+    }
+    return ZIP_OK;
+}
+
+
+
+/****************************************************************************/
+
+#ifndef NO_ADDFILEINEXISTINGZIP
+/* ===========================================================================
+   Inputs a long in LSB order to the given file
+   nbByte == 1, 2 or 4 (byte, short or long)
+*/
+
+local int ziplocal_putValue OF((const zlib_filefunc_def* pzlib_filefunc_def,
+                                voidpf filestream, uLong x, int nbByte));
+local int ziplocal_putValue (pzlib_filefunc_def, filestream, x, nbByte)
+    const zlib_filefunc_def* pzlib_filefunc_def;
+    voidpf filestream;
+    uLong x;
+    int nbByte;
+{
+    unsigned char buf[4];
+    int n;
+    for (n = 0; n < nbByte; n++)
+    {
+        buf[n] = (unsigned char)(x & 0xff);
+        x >>= 8;
+    }
+    if (x != 0)
+      {     /* data overflow - hack for ZIP64 (X Roche) */
+      for (n = 0; n < nbByte; n++)
+        {
+          buf[n] = 0xff;
+        }
+      }
+
+    if (ZWRITE(*pzlib_filefunc_def,filestream,buf,nbByte)!=(uLong)nbByte)
+        return ZIP_ERRNO;
+    else
+        return ZIP_OK;
+}
+
+local void ziplocal_putValue_inmemory OF((void* dest, uLong x, int nbByte));
+local void ziplocal_putValue_inmemory (dest, x, nbByte)
+    void* dest;
+    uLong x;
+    int nbByte;
+{
+    unsigned char* buf=(unsigned char*)dest;
+    int n;
+    for (n = 0; n < nbByte; n++) {
+        buf[n] = (unsigned char)(x & 0xff);
+        x >>= 8;
+    }
+
+    if (x != 0)
+    {     /* data overflow - hack for ZIP64 */
+       for (n = 0; n < nbByte; n++)
+       {
+          buf[n] = 0xff;
+       }
+    }
+}
+
+/****************************************************************************/
+
+
+local uLong ziplocal_TmzDateToDosDate(ptm,dosDate)
+    const tm_zip* ptm;
+    uLong dosDate;
+{
+    uLong year = (uLong)ptm->tm_year;
+    if (year>1980)
+        year-=1980;
+    else if (year>80)
+        year-=80;
+    return
+      (uLong) (((ptm->tm_mday) + (32 * (ptm->tm_mon+1)) + (512 * year)) << 16) |
+        ((ptm->tm_sec/2) + (32* ptm->tm_min) + (2048 * (uLong)ptm->tm_hour));
+}
+
+
+/****************************************************************************/
+
+local int ziplocal_getByte OF((
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream,
+    int *pi));
+
+local int ziplocal_getByte(pzlib_filefunc_def,filestream,pi)
+    const zlib_filefunc_def* pzlib_filefunc_def;
+    voidpf filestream;
+    int *pi;
+{
+    unsigned char c;
+    int err = (int)ZREAD(*pzlib_filefunc_def,filestream,&c,1);
+    if (err==1)
+    {
+        *pi = (int)c;
+        return ZIP_OK;
+    }
+    else
+    {
+        if (ZERROR(*pzlib_filefunc_def,filestream))
+            return ZIP_ERRNO;
+        else
+            return ZIP_EOF;
+    }
+}
+
+
+/* ===========================================================================
+   Reads a long in LSB order from the given gz_stream. Sets
+*/
+local int ziplocal_getShort OF((
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream,
+    uLong *pX));
+
+local int ziplocal_getShort (pzlib_filefunc_def,filestream,pX)
+    const zlib_filefunc_def* pzlib_filefunc_def;
+    voidpf filestream;
+    uLong *pX;
+{
+    uLong x ;
+    int i;
+    int err;
+
+    err = ziplocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x = (uLong)i;
+
+    if (err==ZIP_OK)
+        err = ziplocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x += ((uLong)i)<<8;
+
+    if (err==ZIP_OK)
+        *pX = x;
+    else
+        *pX = 0;
+    return err;
+}
+
+local int ziplocal_getLong OF((
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream,
+    uLong *pX));
+
+local int ziplocal_getLong (pzlib_filefunc_def,filestream,pX)
+    const zlib_filefunc_def* pzlib_filefunc_def;
+    voidpf filestream;
+    uLong *pX;
+{
+    uLong x ;
+    int i;
+    int err;
+
+    err = ziplocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x = (uLong)i;
+
+    if (err==ZIP_OK)
+        err = ziplocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x += ((uLong)i)<<8;
+
+    if (err==ZIP_OK)
+        err = ziplocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x += ((uLong)i)<<16;
+
+    if (err==ZIP_OK)
+        err = ziplocal_getByte(pzlib_filefunc_def,filestream,&i);
+    x += ((uLong)i)<<24;
+
+    if (err==ZIP_OK)
+        *pX = x;
+    else
+        *pX = 0;
+    return err;
+}
+
+#ifndef BUFREADCOMMENT
+#define BUFREADCOMMENT (0x400)
+#endif
+/*
+  Locate the Central directory of a zipfile (at the end, just before
+    the global comment)
+*/
+local uLong ziplocal_SearchCentralDir OF((
+    const zlib_filefunc_def* pzlib_filefunc_def,
+    voidpf filestream));
+
+local uLong ziplocal_SearchCentralDir(pzlib_filefunc_def,filestream)
+    const zlib_filefunc_def* pzlib_filefunc_def;
+    voidpf filestream;
+{
+    unsigned char* buf;
+    uLong uSizeFile;
+    uLong uBackRead;
+    uLong uMaxBack=0xffff; /* maximum size of global comment */
+    uLong uPosFound=0;
+
+    if (ZSEEK(*pzlib_filefunc_def,filestream,0,ZLIB_FILEFUNC_SEEK_END) != 0)
+        return 0;
+
+
+    uSizeFile = ZTELL(*pzlib_filefunc_def,filestream);
+
+    if (uMaxBack>uSizeFile)
+        uMaxBack = uSizeFile;
+
+    buf = (unsigned char*)ALLOC(BUFREADCOMMENT+4);
+    if (buf==NULL)
+        return 0;
+
+    uBackRead = 4;
+    while (uBackRead<uMaxBack)
+    {
+        uLong uReadSize,uReadPos ;
+        int i;
+        if (uBackRead+BUFREADCOMMENT>uMaxBack)
+            uBackRead = uMaxBack;
+        else
+            uBackRead+=BUFREADCOMMENT;
+        uReadPos = uSizeFile-uBackRead ;
+
+        uReadSize = ((BUFREADCOMMENT+4) < (uSizeFile-uReadPos)) ?
+                     (BUFREADCOMMENT+4) : (uSizeFile-uReadPos);
+        if (ZSEEK(*pzlib_filefunc_def,filestream,uReadPos,ZLIB_FILEFUNC_SEEK_SET)!=0)
+            break;
+
+        if (ZREAD(*pzlib_filefunc_def,filestream,buf,uReadSize)!=uReadSize)
+            break;
+
+        for (i=(int)uReadSize-3; (i--)>0;)
+            if (((*(buf+i))==0x50) && ((*(buf+i+1))==0x4b) &&
+                ((*(buf+i+2))==0x05) && ((*(buf+i+3))==0x06))
+            {
+                uPosFound = uReadPos+i;
+                break;
+            }
+
+        if (uPosFound!=0)
+            break;
+    }
+    TRYFREE(buf);
+    return uPosFound;
+}
+#endif /* !NO_ADDFILEINEXISTINGZIP*/
+
+/************************************************************/
+extern zipFile ZEXPORT zipOpen2 (pathname, append, globalcomment, pzlib_filefunc_def)
+    const char *pathname;
+    int append;
+    zipcharpc* globalcomment;
+    zlib_filefunc_def* pzlib_filefunc_def;
+{
+    zip_internal ziinit;
+    zip_internal* zi;
+    int err=ZIP_OK;
+
+
+    if (pzlib_filefunc_def==NULL)
+        fill_fopen_filefunc(&ziinit.z_filefunc);
+    else
+        ziinit.z_filefunc = *pzlib_filefunc_def;
+
+    ziinit.filestream = (*(ziinit.z_filefunc.zopen_file))
+                 (ziinit.z_filefunc.opaque,
+                  pathname,
+                  (append == APPEND_STATUS_CREATE) ?
+                  (ZLIB_FILEFUNC_MODE_READ | ZLIB_FILEFUNC_MODE_WRITE | ZLIB_FILEFUNC_MODE_CREATE) :
+                    (ZLIB_FILEFUNC_MODE_READ | ZLIB_FILEFUNC_MODE_WRITE | ZLIB_FILEFUNC_MODE_EXISTING));
+
+    if (ziinit.filestream == NULL)
+        return NULL;
+    ziinit.begin_pos = ZTELL(ziinit.z_filefunc,ziinit.filestream);
+    ziinit.in_opened_file_inzip = 0;
+    ziinit.ci.stream_initialised = 0;
+    ziinit.number_entry = 0;
+    ziinit.add_position_when_writting_offset = 0;
+    init_linkedlist(&(ziinit.central_dir));
+
+
+    zi = (zip_internal*)ALLOC(sizeof(zip_internal));
+    if (zi==NULL)
+    {
+        ZCLOSE(ziinit.z_filefunc,ziinit.filestream);
+        return NULL;
+    }
+
+    /* now we add file in a zipfile */
+#    ifndef NO_ADDFILEINEXISTINGZIP
+    ziinit.globalcomment = NULL;
+    if (append == APPEND_STATUS_ADDINZIP)
+    {
+        uLong byte_before_the_zipfile;/* byte before the zipfile, (>0 for sfx)*/
+
+        uLong size_central_dir;     /* size of the central directory  */
+        uLong offset_central_dir;   /* offset of start of central directory */
+        uLong central_pos,uL;
+
+        uLong number_disk;          /* number of the current dist, used for
+                                    spaning ZIP, unsupported, always 0*/
+        uLong number_disk_with_CD;  /* number the the disk with central dir, used
+                                    for spaning ZIP, unsupported, always 0*/
+        uLong number_entry;
+        uLong number_entry_CD;      /* total number of entries in
+                                    the central dir
+                                    (same than number_entry on nospan) */
+        uLong size_comment;
+
+        central_pos = ziplocal_SearchCentralDir(&ziinit.z_filefunc,ziinit.filestream);
+        if (central_pos==0)
+            err=ZIP_ERRNO;
+
+        if (ZSEEK(ziinit.z_filefunc, ziinit.filestream,
+                                        central_pos,ZLIB_FILEFUNC_SEEK_SET)!=0)
+            err=ZIP_ERRNO;
+
+        /* the signature, already checked */
+        if (ziplocal_getLong(&ziinit.z_filefunc, ziinit.filestream,&uL)!=ZIP_OK)
+            err=ZIP_ERRNO;
+
+        /* number of this disk */
+        if (ziplocal_getShort(&ziinit.z_filefunc, ziinit.filestream,&number_disk)!=ZIP_OK)
+            err=ZIP_ERRNO;
+
+        /* number of the disk with the start of the central directory */
+        if (ziplocal_getShort(&ziinit.z_filefunc, ziinit.filestream,&number_disk_with_CD)!=ZIP_OK)
+            err=ZIP_ERRNO;
+
+        /* total number of entries in the central dir on this disk */
+        if (ziplocal_getShort(&ziinit.z_filefunc, ziinit.filestream,&number_entry)!=ZIP_OK)
+            err=ZIP_ERRNO;
+
+        /* total number of entries in the central dir */
+        if (ziplocal_getShort(&ziinit.z_filefunc, ziinit.filestream,&number_entry_CD)!=ZIP_OK)
+            err=ZIP_ERRNO;
+
+        if ((number_entry_CD!=number_entry) ||
+            (number_disk_with_CD!=0) ||
+            (number_disk!=0))
+            err=ZIP_BADZIPFILE;
+
+        /* size of the central directory */
+        if (ziplocal_getLong(&ziinit.z_filefunc, ziinit.filestream,&size_central_dir)!=ZIP_OK)
+            err=ZIP_ERRNO;
+
+        /* offset of start of central directory with respect to the
+            starting disk number */
+        if (ziplocal_getLong(&ziinit.z_filefunc, ziinit.filestream,&offset_central_dir)!=ZIP_OK)
+            err=ZIP_ERRNO;
+
+        /* zipfile global comment length */
+        if (ziplocal_getShort(&ziinit.z_filefunc, ziinit.filestream,&size_comment)!=ZIP_OK)
+            err=ZIP_ERRNO;
+
+        if ((central_pos<offset_central_dir+size_central_dir) &&
+            (err==ZIP_OK))
+            err=ZIP_BADZIPFILE;
+
+        if (err!=ZIP_OK)
+        {
+            ZCLOSE(ziinit.z_filefunc, ziinit.filestream);
+            return NULL;
+        }
+
+        if (size_comment>0)
+        {
+            ziinit.globalcomment = ALLOC(size_comment+1);
+            if (ziinit.globalcomment)
+            {
+               size_comment = ZREAD(ziinit.z_filefunc, ziinit.filestream,ziinit.globalcomment,size_comment);
+               ziinit.globalcomment[size_comment]=0;
+            }
+        }
+
+        byte_before_the_zipfile = central_pos -
+                                (offset_central_dir+size_central_dir);
+        ziinit.add_position_when_writting_offset = byte_before_the_zipfile;
+
+        {
+            uLong size_central_dir_to_read = size_central_dir;
+            size_t buf_size = SIZEDATA_INDATABLOCK;
+            void* buf_read = (void*)ALLOC(buf_size);
+            if (ZSEEK(ziinit.z_filefunc, ziinit.filestream,
+                  offset_central_dir + byte_before_the_zipfile,
+                  ZLIB_FILEFUNC_SEEK_SET) != 0)
+                  err=ZIP_ERRNO;
+
+            while ((size_central_dir_to_read>0) && (err==ZIP_OK))
+            {
+                uLong read_this = SIZEDATA_INDATABLOCK;
+                if (read_this > size_central_dir_to_read)
+                    read_this = size_central_dir_to_read;
+                if (ZREAD(ziinit.z_filefunc, ziinit.filestream,buf_read,read_this) != read_this)
+                    err=ZIP_ERRNO;
+
+                if (err==ZIP_OK)
+                    err = add_data_in_datablock(&ziinit.central_dir,buf_read,
+                                                (uLong)read_this);
+                size_central_dir_to_read-=read_this;
+            }
+            TRYFREE(buf_read);
+        }
+        ziinit.begin_pos = byte_before_the_zipfile;
+        ziinit.number_entry = number_entry_CD;
+
+        if (ZSEEK(ziinit.z_filefunc, ziinit.filestream,
+                  offset_central_dir+byte_before_the_zipfile,ZLIB_FILEFUNC_SEEK_SET)!=0)
+            err=ZIP_ERRNO;
+    }
+
+    if (globalcomment)
+    {
+      *globalcomment = ziinit.globalcomment;
+    }
+#    endif /* !NO_ADDFILEINEXISTINGZIP*/
+
+    if (err != ZIP_OK)
+    {
+#    ifndef NO_ADDFILEINEXISTINGZIP
+        TRYFREE(ziinit.globalcomment);
+#    endif /* !NO_ADDFILEINEXISTINGZIP*/
+        TRYFREE(zi);
+        return NULL;
+    }
+    else
+    {
+        *zi = ziinit;
+        return (zipFile)zi;
+    }
+}
+
+extern zipFile ZEXPORT zipOpen (pathname, append)
+    const char *pathname;
+    int append;
+{
+    return zipOpen2(pathname,append,NULL,NULL);
+}
+
+extern int ZEXPORT zipOpenNewFileInZip3 (file, filename, zipfi,
+                                         extrafield_local, size_extrafield_local,
+                                         extrafield_global, size_extrafield_global,
+                                         comment, method, level, raw,
+                                         windowBits, memLevel, strategy,
+                                         password, crcForCrypting)
+    zipFile file;
+    const char* filename;
+    const zip_fileinfo* zipfi;
+    const void* extrafield_local;
+    uInt size_extrafield_local;
+    const void* extrafield_global;
+    uInt size_extrafield_global;
+    const char* comment;
+    int method;
+    int level;
+    int raw;
+    int windowBits;
+    int memLevel;
+    int strategy;
+    const char* password;
+    uLong crcForCrypting;
+{
+    zip_internal* zi;
+    uInt size_filename;
+    uInt size_comment;
+    uInt i;
+    int err = ZIP_OK;
+
+#    ifdef NOCRYPT
+    if (password != NULL)
+        return ZIP_PARAMERROR;
+#    endif
+
+    if (file == NULL)
+        return ZIP_PARAMERROR;
+    if ((method!=0) && (method!=Z_DEFLATED))
+        return ZIP_PARAMERROR;
+
+    zi = (zip_internal*)file;
+
+    if (zi->in_opened_file_inzip == 1)
+    {
+        err = zipCloseFileInZip (file);
+        if (err != ZIP_OK)
+            return err;
+    }
+
+
+    if (filename==NULL)
+        filename="-";
+
+    if (comment==NULL)
+        size_comment = 0;
+    else
+        size_comment = (uInt)strlen(comment);
+
+    size_filename = (uInt)strlen(filename);
+
+    if (zipfi == NULL)
+        zi->ci.dosDate = 0;
+    else
+    {
+        if (zipfi->dosDate != 0)
+            zi->ci.dosDate = zipfi->dosDate;
+        else zi->ci.dosDate = ziplocal_TmzDateToDosDate(&zipfi->tmz_date,zipfi->dosDate);
+    }
+
+    zi->ci.flag = 0;
+    if ((level==8) || (level==9))
+      zi->ci.flag |= 2;
+    if ((level==2))
+      zi->ci.flag |= 4;
+    if ((level==1))
+      zi->ci.flag |= 6;
+    if (password != NULL)
+      zi->ci.flag |= 1;
+
+    zi->ci.crc32 = 0;
+    zi->ci.method = method;
+    zi->ci.encrypt = 0;
+    zi->ci.stream_initialised = 0;
+    zi->ci.pos_in_buffered_data = 0;
+    zi->ci.raw = raw;
+    zi->ci.pos_local_header = ZTELL(zi->z_filefunc,zi->filestream) ;
+    zi->ci.size_centralheader = SIZECENTRALHEADER + size_filename +
+                                      size_extrafield_global + size_comment;
+    zi->ci.central_header = (char*)ALLOC((uInt)zi->ci.size_centralheader);
+
+    ziplocal_putValue_inmemory(zi->ci.central_header,(uLong)CENTRALHEADERMAGIC,4);
+    /* version info */
+    ziplocal_putValue_inmemory(zi->ci.central_header+4,(uLong)VERSIONMADEBY,2);
+    ziplocal_putValue_inmemory(zi->ci.central_header+6,(uLong)20,2);
+    ziplocal_putValue_inmemory(zi->ci.central_header+8,(uLong)zi->ci.flag,2);
+    ziplocal_putValue_inmemory(zi->ci.central_header+10,(uLong)zi->ci.method,2);
+    ziplocal_putValue_inmemory(zi->ci.central_header+12,(uLong)zi->ci.dosDate,4);
+    ziplocal_putValue_inmemory(zi->ci.central_header+16,(uLong)0,4); /*crc*/
+    ziplocal_putValue_inmemory(zi->ci.central_header+20,(uLong)0,4); /*compr size*/
+    ziplocal_putValue_inmemory(zi->ci.central_header+24,(uLong)0,4); /*uncompr size*/
+    ziplocal_putValue_inmemory(zi->ci.central_header+28,(uLong)size_filename,2);
+    ziplocal_putValue_inmemory(zi->ci.central_header+30,(uLong)size_extrafield_global,2);
+    ziplocal_putValue_inmemory(zi->ci.central_header+32,(uLong)size_comment,2);
+    ziplocal_putValue_inmemory(zi->ci.central_header+34,(uLong)0,2); /*disk nm start*/
+
+    if (zipfi==NULL)
+        ziplocal_putValue_inmemory(zi->ci.central_header+36,(uLong)0,2);
+    else
+        ziplocal_putValue_inmemory(zi->ci.central_header+36,(uLong)zipfi->internal_fa,2);
+
+    if (zipfi==NULL)
+        ziplocal_putValue_inmemory(zi->ci.central_header+38,(uLong)0,4);
+    else
+        ziplocal_putValue_inmemory(zi->ci.central_header+38,(uLong)zipfi->external_fa,4);
+
+    ziplocal_putValue_inmemory(zi->ci.central_header+42,(uLong)zi->ci.pos_local_header- zi->add_position_when_writting_offset,4);
+
+    for (i=0;i<size_filename;i++)
+        *(zi->ci.central_header+SIZECENTRALHEADER+i) = *(filename+i);
+
+    for (i=0;i<size_extrafield_global;i++)
+        *(zi->ci.central_header+SIZECENTRALHEADER+size_filename+i) =
+              *(((const char*)extrafield_global)+i);
+
+    for (i=0;i<size_comment;i++)
+        *(zi->ci.central_header+SIZECENTRALHEADER+size_filename+
+              size_extrafield_global+i) = *(comment+i);
+    if (zi->ci.central_header == NULL)
+        return ZIP_INTERNALERROR;
+
+    /* write the local header */
+    err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)LOCALHEADERMAGIC,4);
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)20,2);/* version needed to extract */
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)zi->ci.flag,2);
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)zi->ci.method,2);
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)zi->ci.dosDate,4);
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)0,4); /* crc 32, unknown */
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)0,4); /* compressed size, unknown */
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)0,4); /* uncompressed size, unknown */
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)size_filename,2);
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)size_extrafield_local,2);
+
+    if ((err==ZIP_OK) && (size_filename>0))
+        if (ZWRITE(zi->z_filefunc,zi->filestream,filename,size_filename)!=size_filename)
+                err = ZIP_ERRNO;
+
+    if ((err==ZIP_OK) && (size_extrafield_local>0))
+        if (ZWRITE(zi->z_filefunc,zi->filestream,extrafield_local,size_extrafield_local)
+                                                                           !=size_extrafield_local)
+                err = ZIP_ERRNO;
+
+    zi->ci.stream.avail_in = (uInt)0;
+    zi->ci.stream.avail_out = (uInt)Z_BUFSIZE;
+    zi->ci.stream.next_out = zi->ci.buffered_data;
+    zi->ci.stream.total_in = 0;
+    zi->ci.stream.total_out = 0;
+
+    if ((err==ZIP_OK) && (zi->ci.method == Z_DEFLATED) && (!zi->ci.raw))
+    {
+        zi->ci.stream.zalloc = (alloc_func)0;
+        zi->ci.stream.zfree = (free_func)0;
+        zi->ci.stream.opaque = (voidpf)0;
+
+        if (windowBits>0)
+            windowBits = -windowBits;
+
+        err = deflateInit2(&zi->ci.stream, level,
+               Z_DEFLATED, windowBits, memLevel, strategy);
+
+        if (err==Z_OK)
+            zi->ci.stream_initialised = 1;
+    }
+#    ifndef NOCRYPT
+    zi->ci.crypt_header_size = 0;
+    if ((err==Z_OK) && (password != NULL))
+    {
+        unsigned char bufHead[RAND_HEAD_LEN];
+        unsigned int sizeHead;
+        zi->ci.encrypt = 1;
+        zi->ci.pcrc_32_tab = get_crc_table();
+        /*init_keys(password,zi->ci.keys,zi->ci.pcrc_32_tab);*/
+
+        sizeHead=crypthead(password,bufHead,RAND_HEAD_LEN,zi->ci.keys,zi->ci.pcrc_32_tab,crcForCrypting);
+        zi->ci.crypt_header_size = sizeHead;
+
+        if (ZWRITE(zi->z_filefunc,zi->filestream,bufHead,sizeHead) != sizeHead)
+                err = ZIP_ERRNO;
+    }
+#    endif
+
+    if (err==Z_OK)
+        zi->in_opened_file_inzip = 1;
+    return err;
+}
+
+extern int ZEXPORT zipOpenNewFileInZip2(file, filename, zipfi,
+                                        extrafield_local, size_extrafield_local,
+                                        extrafield_global, size_extrafield_global,
+                                        comment, method, level, raw)
+    zipFile file;
+    const char* filename;
+    const zip_fileinfo* zipfi;
+    const void* extrafield_local;
+    uInt size_extrafield_local;
+    const void* extrafield_global;
+    uInt size_extrafield_global;
+    const char* comment;
+    int method;
+    int level;
+    int raw;
+{
+    return zipOpenNewFileInZip3 (file, filename, zipfi,
+                                 extrafield_local, size_extrafield_local,
+                                 extrafield_global, size_extrafield_global,
+                                 comment, method, level, raw,
+                                 -MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY,
+                                 NULL, 0);
+}
+
+extern int ZEXPORT zipOpenNewFileInZip (file, filename, zipfi,
+                                        extrafield_local, size_extrafield_local,
+                                        extrafield_global, size_extrafield_global,
+                                        comment, method, level)
+    zipFile file;
+    const char* filename;
+    const zip_fileinfo* zipfi;
+    const void* extrafield_local;
+    uInt size_extrafield_local;
+    const void* extrafield_global;
+    uInt size_extrafield_global;
+    const char* comment;
+    int method;
+    int level;
+{
+    return zipOpenNewFileInZip2 (file, filename, zipfi,
+                                 extrafield_local, size_extrafield_local,
+                                 extrafield_global, size_extrafield_global,
+                                 comment, method, level, 0);
+}
+
+local int zipFlushWriteBuffer(zi)
+  zip_internal* zi;
+{
+    int err=ZIP_OK;
+
+    if (zi->ci.encrypt != 0)
+    {
+#ifndef NOCRYPT
+        uInt i;
+        int t;
+        for (i=0;i<zi->ci.pos_in_buffered_data;i++)
+            zi->ci.buffered_data[i] = zencode(zi->ci.keys, zi->ci.pcrc_32_tab,
+                                       zi->ci.buffered_data[i],t);
+#endif
+    }
+    if (ZWRITE(zi->z_filefunc,zi->filestream,zi->ci.buffered_data,zi->ci.pos_in_buffered_data)
+                                                                    !=zi->ci.pos_in_buffered_data)
+      err = ZIP_ERRNO;
+    zi->ci.pos_in_buffered_data = 0;
+    return err;
+}
+
+extern int ZEXPORT zipWriteInFileInZip (file, buf, len)
+    zipFile file;
+    const void* buf;
+    unsigned len;
+{
+    zip_internal* zi;
+    int err=ZIP_OK;
+
+    if (file == NULL)
+        return ZIP_PARAMERROR;
+    zi = (zip_internal*)file;
+
+    if (zi->in_opened_file_inzip == 0)
+        return ZIP_PARAMERROR;
+
+    zi->ci.stream.next_in = (void*)buf;
+    zi->ci.stream.avail_in = len;
+    zi->ci.crc32 = crc32(zi->ci.crc32,buf,len);
+
+    while ((err==ZIP_OK) && (zi->ci.stream.avail_in>0))
+    {
+        if (zi->ci.stream.avail_out == 0)
+        {
+            if (zipFlushWriteBuffer(zi) == ZIP_ERRNO)
+                err = ZIP_ERRNO;
+            zi->ci.stream.avail_out = (uInt)Z_BUFSIZE;
+            zi->ci.stream.next_out = zi->ci.buffered_data;
+        }
+
+
+        if(err != ZIP_OK)
+            break;
+
+        if ((zi->ci.method == Z_DEFLATED) && (!zi->ci.raw))
+        {
+            uLong uTotalOutBefore = zi->ci.stream.total_out;
+            err=deflate(&zi->ci.stream,  Z_NO_FLUSH);
+            zi->ci.pos_in_buffered_data += (uInt)(zi->ci.stream.total_out - uTotalOutBefore) ;
+
+        }
+        else
+        {
+            uInt copy_this,i;
+            if (zi->ci.stream.avail_in < zi->ci.stream.avail_out)
+                copy_this = zi->ci.stream.avail_in;
+            else
+                copy_this = zi->ci.stream.avail_out;
+            for (i=0;i<copy_this;i++)
+                *(((char*)zi->ci.stream.next_out)+i) =
+                    *(((const char*)zi->ci.stream.next_in)+i);
+            {
+                zi->ci.stream.avail_in -= copy_this;
+                zi->ci.stream.avail_out-= copy_this;
+                zi->ci.stream.next_in+= copy_this;
+                zi->ci.stream.next_out+= copy_this;
+                zi->ci.stream.total_in+= copy_this;
+                zi->ci.stream.total_out+= copy_this;
+                zi->ci.pos_in_buffered_data += copy_this;
+            }
+        }
+    }
+
+    return err;
+}
+
+extern int ZEXPORT zipCloseFileInZipRaw (file, uncompressed_size, crc32)
+    zipFile file;
+    uLong uncompressed_size;
+    uLong crc32;
+{
+    zip_internal* zi;
+    uLong compressed_size;
+    int err=ZIP_OK;
+
+    if (file == NULL)
+        return ZIP_PARAMERROR;
+    zi = (zip_internal*)file;
+
+    if (zi->in_opened_file_inzip == 0)
+        return ZIP_PARAMERROR;
+    zi->ci.stream.avail_in = 0;
+
+    if ((zi->ci.method == Z_DEFLATED) && (!zi->ci.raw))
+        while (err==ZIP_OK)
+    {
+        uLong uTotalOutBefore;
+        if (zi->ci.stream.avail_out == 0)
+        {
+            if (zipFlushWriteBuffer(zi) == ZIP_ERRNO)
+                err = ZIP_ERRNO;
+            zi->ci.stream.avail_out = (uInt)Z_BUFSIZE;
+            zi->ci.stream.next_out = zi->ci.buffered_data;
+        }
+        uTotalOutBefore = zi->ci.stream.total_out;
+        err=deflate(&zi->ci.stream,  Z_FINISH);
+        zi->ci.pos_in_buffered_data += (uInt)(zi->ci.stream.total_out - uTotalOutBefore) ;
+    }
+
+    if (err==Z_STREAM_END)
+        err=ZIP_OK; /* this is normal */
+
+    if ((zi->ci.pos_in_buffered_data>0) && (err==ZIP_OK))
+        if (zipFlushWriteBuffer(zi)==ZIP_ERRNO)
+            err = ZIP_ERRNO;
+
+    if ((zi->ci.method == Z_DEFLATED) && (!zi->ci.raw))
+    {
+        err=deflateEnd(&zi->ci.stream);
+        zi->ci.stream_initialised = 0;
+    }
+
+    if (!zi->ci.raw)
+    {
+        crc32 = (uLong)zi->ci.crc32;
+        uncompressed_size = (uLong)zi->ci.stream.total_in;
+    }
+    compressed_size = (uLong)zi->ci.stream.total_out;
+#    ifndef NOCRYPT
+    compressed_size += zi->ci.crypt_header_size;
+#    endif
+
+    ziplocal_putValue_inmemory(zi->ci.central_header+16,crc32,4); /*crc*/
+    ziplocal_putValue_inmemory(zi->ci.central_header+20,
+                                compressed_size,4); /*compr size*/
+    if (zi->ci.stream.data_type == Z_ASCII)
+        ziplocal_putValue_inmemory(zi->ci.central_header+36,(uLong)Z_ASCII,2);
+    ziplocal_putValue_inmemory(zi->ci.central_header+24,
+                                uncompressed_size,4); /*uncompr size*/
+
+    if (err==ZIP_OK)
+        err = add_data_in_datablock(&zi->central_dir,zi->ci.central_header,
+                                       (uLong)zi->ci.size_centralheader);
+    free(zi->ci.central_header);
+
+    if (err==ZIP_OK)
+    {
+        long cur_pos_inzip = ZTELL(zi->z_filefunc,zi->filestream);
+        if (ZSEEK(zi->z_filefunc,zi->filestream,
+                  zi->ci.pos_local_header + 14,ZLIB_FILEFUNC_SEEK_SET)!=0)
+            err = ZIP_ERRNO;
+
+        if (err==ZIP_OK)
+            err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,crc32,4); /* crc 32, unknown */
+
+        if (err==ZIP_OK) /* compressed size, unknown */
+            err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,compressed_size,4);
+
+        if (err==ZIP_OK) /* uncompressed size, unknown */
+            err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,uncompressed_size,4);
+
+        if (ZSEEK(zi->z_filefunc,zi->filestream,
+                  cur_pos_inzip,ZLIB_FILEFUNC_SEEK_SET)!=0)
+            err = ZIP_ERRNO;
+    }
+
+    zi->number_entry ++;
+    zi->in_opened_file_inzip = 0;
+
+    return err;
+}
+
+extern int ZEXPORT zipCloseFileInZip (file)
+    zipFile file;
+{
+    return zipCloseFileInZipRaw (file,0,0);
+}
+
+extern int ZEXPORT zipClose (file, global_comment)
+    zipFile file;
+    const char* global_comment;
+{
+    zip_internal* zi;
+    int err = 0;
+    uLong size_centraldir = 0;
+    uLong centraldir_pos_inzip;
+    uInt size_global_comment;
+    if (file == NULL)
+        return ZIP_PARAMERROR;
+    zi = (zip_internal*)file;
+
+    if (zi->in_opened_file_inzip == 1)
+    {
+        err = zipCloseFileInZip (file);
+    }
+
+#ifndef NO_ADDFILEINEXISTINGZIP
+    if (global_comment==NULL)
+        global_comment = zi->globalcomment;
+#endif
+    if (global_comment==NULL)
+        size_global_comment = 0;
+    else
+        size_global_comment = (uInt)strlen(global_comment);
+
+    centraldir_pos_inzip = ZTELL(zi->z_filefunc,zi->filestream);
+    if (err==ZIP_OK)
+    {
+        linkedlist_datablock_internal* ldi = zi->central_dir.first_block ;
+        while (ldi!=NULL)
+        {
+            if ((err==ZIP_OK) && (ldi->filled_in_this_block>0))
+                if (ZWRITE(zi->z_filefunc,zi->filestream,
+                           ldi->data,ldi->filled_in_this_block)
+                              !=ldi->filled_in_this_block )
+                    err = ZIP_ERRNO;
+
+            size_centraldir += ldi->filled_in_this_block;
+            ldi = ldi->next_datablock;
+        }
+    }
+    free_datablock(zi->central_dir.first_block);
+
+    if (err==ZIP_OK) /* Magic End */
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)ENDHEADERMAGIC,4);
+
+    if (err==ZIP_OK) /* number of this disk */
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)0,2);
+
+    if (err==ZIP_OK) /* number of the disk with the start of the central directory */
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)0,2);
+
+    if (err==ZIP_OK) /* total number of entries in the central dir on this disk */
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)zi->number_entry,2);
+
+    if (err==ZIP_OK) /* total number of entries in the central dir */
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)zi->number_entry,2);
+
+    if (err==ZIP_OK) /* size of the central directory */
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)size_centraldir,4);
+
+    if (err==ZIP_OK) /* offset of start of central directory with respect to the
+                            starting disk number */
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,
+                                (uLong)(centraldir_pos_inzip - zi->add_position_when_writting_offset),4);
+
+    if (err==ZIP_OK) /* zipfile comment length */
+        err = ziplocal_putValue(&zi->z_filefunc,zi->filestream,(uLong)size_global_comment,2);
+
+    if ((err==ZIP_OK) && (size_global_comment>0))
+        if (ZWRITE(zi->z_filefunc,zi->filestream,
+                   global_comment,size_global_comment) != size_global_comment)
+                err = ZIP_ERRNO;
+
+    if (ZCLOSE(zi->z_filefunc,zi->filestream) != 0)
+        if (err == ZIP_OK)
+            err = ZIP_ERRNO;
+
+#ifndef NO_ADDFILEINEXISTINGZIP
+    TRYFREE(zi->globalcomment);
+#endif
+    TRYFREE(zi);
+
+    return err;
+}
diff --git a/updater/zlib123/contrib/minizip/mzip.h b/updater/zlib123/contrib/minizip/mzip.h
new file mode 100644
index 0000000..cd38b67
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/mzip.h
@@ -0,0 +1,235 @@
+/* zip.h -- IO for compress .zip files using zlib
+   Version 1.01e, February 12th, 2005
+
+   Copyright (C) 1998-2005 Gilles Vollant
+
+   This unzip package allow creates .ZIP file, compatible with PKZip 2.04g
+     WinZip, InfoZip tools and compatible.
+   Multi volume ZipFile (span) are not supported.
+   Encryption compatible with pkzip 2.04g only supported
+   Old compressions used by old PKZip 1.x are not supported
+
+  For uncompress .zip file, look at unzip.h
+
+
+   I WAIT FEEDBACK at mail info@winimage.com
+   Visit also http://www.winimage.com/zLibDll/unzip.html for evolution
+
+   Condition of use and distribution are the same than zlib :
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the authors be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+
+*/
+
+/* for more info about .ZIP format, see
+      http://www.info-zip.org/pub/infozip/doc/appnote-981119-iz.zip
+      http://www.info-zip.org/pub/infozip/doc/
+   PkWare has also a specification at :
+      ftp://ftp.pkware.com/probdesc.zip
+*/
+
+#ifndef _zip_H
+#define _zip_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#ifndef _ZLIB_H
+#include "zlib.h"
+#endif
+
+#ifndef _ZLIBIOAPI_H
+#include "ioapi.h"
+#endif
+
+#if defined(STRICTZIP) || defined(STRICTZIPUNZIP)
+/* like the STRICT of WIN32, we define a pointer that cannot be converted
+    from (void*) without cast */
+typedef struct TagzipFile__ { int unused; } zipFile__;
+typedef zipFile__ *zipFile;
+#else
+typedef voidp zipFile;
+#endif
+
+#define ZIP_OK                          (0)
+#define ZIP_EOF                         (0)
+#define ZIP_ERRNO                       (Z_ERRNO)
+#define ZIP_PARAMERROR                  (-102)
+#define ZIP_BADZIPFILE                  (-103)
+#define ZIP_INTERNALERROR               (-104)
+
+#ifndef DEF_MEM_LEVEL
+#  if MAX_MEM_LEVEL >= 8
+#    define DEF_MEM_LEVEL 8
+#  else
+#    define DEF_MEM_LEVEL  MAX_MEM_LEVEL
+#  endif
+#endif
+/* default memLevel */
+
+/* tm_zip contain date/time info */
+typedef struct tm_zip_s
+{
+    uInt tm_sec;            /* seconds after the minute - [0,59] */
+    uInt tm_min;            /* minutes after the hour - [0,59] */
+    uInt tm_hour;           /* hours since midnight - [0,23] */
+    uInt tm_mday;           /* day of the month - [1,31] */
+    uInt tm_mon;            /* months since January - [0,11] */
+    uInt tm_year;           /* years - [1980..2044] */
+} tm_zip;
+
+typedef struct
+{
+    tm_zip      tmz_date;       /* date in understandable format           */
+    uLong       dosDate;       /* if dos_date == 0, tmu_date is used      */
+/*    uLong       flag;        */   /* general purpose bit flag        2 bytes */
+
+    uLong       internal_fa;    /* internal file attributes        2 bytes */
+    uLong       external_fa;    /* external file attributes        4 bytes */
+} zip_fileinfo;
+
+typedef const char* zipcharpc;
+
+
+#define APPEND_STATUS_CREATE        (0)
+#define APPEND_STATUS_CREATEAFTER   (1)
+#define APPEND_STATUS_ADDINZIP      (2)
+
+extern zipFile ZEXPORT zipOpen OF((const char *pathname, int append));
+/*
+  Create a zipfile.
+     pathname contain on Windows XP a filename like "c:\\zlib\\zlib113.zip" or on
+       an Unix computer "zlib/zlib113.zip".
+     if the file pathname exist and append==APPEND_STATUS_CREATEAFTER, the zip
+       will be created at the end of the file.
+         (useful if the file contain a self extractor code)
+     if the file pathname exist and append==APPEND_STATUS_ADDINZIP, we will
+       add files in existing zip (be sure you don't add file that doesn't exist)
+     If the zipfile cannot be opened, the return value is NULL.
+     Else, the return value is a zipFile Handle, usable with other function
+       of this zip package.
+*/
+
+/* Note : there is no delete function into a zipfile.
+   If you want delete file into a zipfile, you must open a zipfile, and create another
+   Of couse, you can use RAW reading and writing to copy the file you did not want delte
+*/
+
+extern zipFile ZEXPORT zipOpen2 OF((const char *pathname,
+                                   int append,
+                                   zipcharpc* globalcomment,
+                                   zlib_filefunc_def* pzlib_filefunc_def));
+
+extern int ZEXPORT zipOpenNewFileInZip OF((zipFile file,
+                       const char* filename,
+                       const zip_fileinfo* zipfi,
+                       const void* extrafield_local,
+                       uInt size_extrafield_local,
+                       const void* extrafield_global,
+                       uInt size_extrafield_global,
+                       const char* comment,
+                       int method,
+                       int level));
+/*
+  Open a file in the ZIP for writing.
+  filename : the filename in zip (if NULL, '-' without quote will be used
+  *zipfi contain supplemental information
+  if extrafield_local!=NULL and size_extrafield_local>0, extrafield_local
+    contains the extrafield data the the local header
+  if extrafield_global!=NULL and size_extrafield_global>0, extrafield_global
+    contains the extrafield data the the local header
+  if comment != NULL, comment contain the comment string
+  method contain the compression method (0 for store, Z_DEFLATED for deflate)
+  level contain the level of compression (can be Z_DEFAULT_COMPRESSION)
+*/
+
+
+extern int ZEXPORT zipOpenNewFileInZip2 OF((zipFile file,
+                                            const char* filename,
+                                            const zip_fileinfo* zipfi,
+                                            const void* extrafield_local,
+                                            uInt size_extrafield_local,
+                                            const void* extrafield_global,
+                                            uInt size_extrafield_global,
+                                            const char* comment,
+                                            int method,
+                                            int level,
+                                            int raw));
+
+/*
+  Same than zipOpenNewFileInZip, except if raw=1, we write raw file
+ */
+
+extern int ZEXPORT zipOpenNewFileInZip3 OF((zipFile file,
+                                            const char* filename,
+                                            const zip_fileinfo* zipfi,
+                                            const void* extrafield_local,
+                                            uInt size_extrafield_local,
+                                            const void* extrafield_global,
+                                            uInt size_extrafield_global,
+                                            const char* comment,
+                                            int method,
+                                            int level,
+                                            int raw,
+                                            int windowBits,
+                                            int memLevel,
+                                            int strategy,
+                                            const char* password,
+                                            uLong crcForCtypting));
+
+/*
+  Same than zipOpenNewFileInZip2, except
+    windowBits,memLevel,,strategy : see parameter strategy in deflateInit2
+    password : crypting password (NULL for no crypting)
+    crcForCtypting : crc of file to compress (needed for crypting)
+ */
+
+
+extern int ZEXPORT zipWriteInFileInZip OF((zipFile file,
+                       const void* buf,
+                       unsigned len));
+/*
+  Write data in the zipfile
+*/
+
+extern int ZEXPORT zipCloseFileInZip OF((zipFile file));
+/*
+  Close the current file in the zipfile
+*/
+
+extern int ZEXPORT zipCloseFileInZipRaw OF((zipFile file,
+                                            uLong uncompressed_size,
+                                            uLong crc32));
+/*
+  Close the current file in the zipfile, for fiel opened with
+    parameter raw=1 in zipOpenNewFileInZip2
+  uncompressed_size and crc32 are value for the uncompressed size
+*/
+
+extern int ZEXPORT zipClose OF((zipFile file,
+                const char* global_comment));
+/*
+  Close the zipfile
+*/
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* _zip_H */
diff --git a/updater/zlib123/contrib/minizip/mztools.c b/updater/zlib123/contrib/minizip/mztools.c
new file mode 100644
index 0000000..bc5c798
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/mztools.c
@@ -0,0 +1,281 @@
+/*
+  Additional tools for Minizip
+  Code: Xavier Roche '2004
+  License: Same as ZLIB (www.gzip.org)
+*/
+
+/* Code */
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "zlib.h"
+#include "unzip.h"
+
+#define READ_8(adr)  ((unsigned char)*(adr))
+#define READ_16(adr) ( READ_8(adr) | (READ_8(adr+1) << 8) )
+#define READ_32(adr) ( READ_16(adr) | (READ_16((adr)+2) << 16) )
+
+#define WRITE_8(buff, n) do { \
+  *((unsigned char*)(buff)) = (unsigned char) ((n) & 0xff); \
+} while(0)
+#define WRITE_16(buff, n) do { \
+  WRITE_8((unsigned char*)(buff), n); \
+  WRITE_8(((unsigned char*)(buff)) + 1, (n) >> 8); \
+} while(0)
+#define WRITE_32(buff, n) do { \
+  WRITE_16((unsigned char*)(buff), (n) & 0xffff); \
+  WRITE_16((unsigned char*)(buff) + 2, (n) >> 16); \
+} while(0)
+
+extern int ZEXPORT unzRepair(file, fileOut, fileOutTmp, nRecovered, bytesRecovered)
+const char* file;
+const char* fileOut;
+const char* fileOutTmp;
+uLong* nRecovered;
+uLong* bytesRecovered;
+{
+  int err = Z_OK;
+  FILE* fpZip = fopen(file, "rb");
+  FILE* fpOut = fopen(fileOut, "wb");
+  FILE* fpOutCD = fopen(fileOutTmp, "wb");
+  if (fpZip != NULL &&  fpOut != NULL) {
+    int entries = 0;
+    uLong totalBytes = 0;
+    char header[30];
+    char filename[256];
+    char extra[1024];
+    int offset = 0;
+    int offsetCD = 0;
+    while ( fread(header, 1, 30, fpZip) == 30 ) {
+      int currentOffset = offset;
+
+      /* File entry */
+      if (READ_32(header) == 0x04034b50) {
+        unsigned int version = READ_16(header + 4);
+        unsigned int gpflag = READ_16(header + 6);
+        unsigned int method = READ_16(header + 8);
+        unsigned int filetime = READ_16(header + 10);
+        unsigned int filedate = READ_16(header + 12);
+        unsigned int crc = READ_32(header + 14); /* crc */
+        unsigned int cpsize = READ_32(header + 18); /* compressed size */
+        unsigned int uncpsize = READ_32(header + 22); /* uncompressed sz */
+        unsigned int fnsize = READ_16(header + 26); /* file name length */
+        unsigned int extsize = READ_16(header + 28); /* extra field length */
+        filename[0] = extra[0] = '\0';
+        
+        /* Header */
+        if (fwrite(header, 1, 30, fpOut) == 30) {
+          offset += 30;
+        } else {
+          err = Z_ERRNO;
+          break;
+        }
+        
+        /* Filename */
+        if (fnsize > 0) {
+          if (fread(filename, 1, fnsize, fpZip) == fnsize) {
+            if (fwrite(filename, 1, fnsize, fpOut) == fnsize) {
+              offset += fnsize;
+            } else {
+              err = Z_ERRNO;
+              break;
+            }
+          } else {
+            err = Z_ERRNO;
+            break;
+          }
+        } else {
+          err = Z_STREAM_ERROR;
+          break;
+        }
+
+        /* Extra field */
+        if (extsize > 0) {
+          if (fread(extra, 1, extsize, fpZip) == extsize) {
+            if (fwrite(extra, 1, extsize, fpOut) == extsize) {
+              offset += extsize;
+            } else {
+              err = Z_ERRNO;
+              break;
+            }
+          } else {
+            err = Z_ERRNO;
+            break;
+          }
+        }
+        
+        /* Data */
+        {
+          int dataSize = cpsize;
+          if (dataSize == 0) {
+            dataSize = uncpsize;
+          }
+          if (dataSize > 0) {
+            char* data = malloc(dataSize);
+            if (data != NULL) {
+              if ((int)fread(data, 1, dataSize, fpZip) == dataSize) {
+                if ((int)fwrite(data, 1, dataSize, fpOut) == dataSize) {
+                  offset += dataSize;
+                  totalBytes += dataSize;
+                } else {
+                  err = Z_ERRNO;
+                }
+              } else {
+                err = Z_ERRNO;
+              }
+              free(data);
+              if (err != Z_OK) {
+                break;
+              }
+            } else {
+              err = Z_MEM_ERROR;
+              break;
+            }
+          }
+        }
+        
+        /* Central directory entry */
+        {
+          char header[46];
+          char* comment = "";
+          int comsize = (int) strlen(comment);
+          WRITE_32(header, 0x02014b50);
+          WRITE_16(header + 4, version);
+          WRITE_16(header + 6, version);
+          WRITE_16(header + 8, gpflag);
+          WRITE_16(header + 10, method);
+          WRITE_16(header + 12, filetime);
+          WRITE_16(header + 14, filedate);
+          WRITE_32(header + 16, crc);
+          WRITE_32(header + 20, cpsize);
+          WRITE_32(header + 24, uncpsize);
+          WRITE_16(header + 28, fnsize);
+          WRITE_16(header + 30, extsize);
+          WRITE_16(header + 32, comsize);
+          WRITE_16(header + 34, 0);     /* disk # */
+          WRITE_16(header + 36, 0);     /* int attrb */
+          WRITE_32(header + 38, 0);     /* ext attrb */
+          WRITE_32(header + 42, currentOffset);
+          /* Header */
+          if (fwrite(header, 1, 46, fpOutCD) == 46) {
+            offsetCD += 46;
+            
+            /* Filename */
+            if (fnsize > 0) {
+              if (fwrite(filename, 1, fnsize, fpOutCD) == fnsize) {
+                offsetCD += fnsize;
+              } else {
+                err = Z_ERRNO;
+                break;
+              }
+            } else {
+              err = Z_STREAM_ERROR;
+              break;
+            }
+            
+            /* Extra field */
+            if (extsize > 0) {
+              if (fwrite(extra, 1, extsize, fpOutCD) == extsize) {
+                offsetCD += extsize;
+              } else {
+                err = Z_ERRNO;
+                break;
+              }
+            }
+            
+            /* Comment field */
+            if (comsize > 0) {
+              if ((int)fwrite(comment, 1, comsize, fpOutCD) == comsize) {
+                offsetCD += comsize;
+              } else {
+                err = Z_ERRNO;
+                break;
+              }
+            }
+            
+            
+          } else {
+            err = Z_ERRNO;
+            break;
+          }
+        }
+
+        /* Success */
+        entries++;
+
+      } else {
+        break;
+      }
+    }
+
+    /* Final central directory  */
+    {
+      int entriesZip = entries;
+      char header[22];
+      char* comment = ""; // "ZIP File recovered by zlib/minizip/mztools";
+      int comsize = (int) strlen(comment);
+      if (entriesZip > 0xffff) {
+        entriesZip = 0xffff;
+      }
+      WRITE_32(header, 0x06054b50);
+      WRITE_16(header + 4, 0);    /* disk # */
+      WRITE_16(header + 6, 0);    /* disk # */
+      WRITE_16(header + 8, entriesZip);   /* hack */
+      WRITE_16(header + 10, entriesZip);  /* hack */
+      WRITE_32(header + 12, offsetCD);    /* size of CD */
+      WRITE_32(header + 16, offset);      /* offset to CD */
+      WRITE_16(header + 20, comsize);     /* comment */
+      
+      /* Header */
+      if (fwrite(header, 1, 22, fpOutCD) == 22) {
+        
+        /* Comment field */
+        if (comsize > 0) {
+          if ((int)fwrite(comment, 1, comsize, fpOutCD) != comsize) {
+            err = Z_ERRNO;
+          }
+        }
+        
+      } else {
+        err = Z_ERRNO;
+      }
+    }
+
+    /* Final merge (file + central directory) */
+    fclose(fpOutCD);
+    if (err == Z_OK) {
+      fpOutCD = fopen(fileOutTmp, "rb");
+      if (fpOutCD != NULL) {
+        int nRead;
+        char buffer[8192];
+        while ( (nRead = (int)fread(buffer, 1, sizeof(buffer), fpOutCD)) > 0) {
+          if ((int)fwrite(buffer, 1, nRead, fpOut) != nRead) {
+            err = Z_ERRNO;
+            break;
+          }
+        }
+        fclose(fpOutCD);
+      }
+    }
+    
+    /* Close */
+    fclose(fpZip);
+    fclose(fpOut);
+    
+    /* Wipe temporary file */
+    (void)remove(fileOutTmp);
+    
+    /* Number of recovered entries */
+    if (err == Z_OK) {
+      if (nRecovered != NULL) {
+        *nRecovered = entries;
+      }
+      if (bytesRecovered != NULL) {
+        *bytesRecovered = totalBytes;
+      }
+    }
+  } else {
+    err = Z_STREAM_ERROR;
+  }
+  return err;
+}
diff --git a/updater/zlib123/contrib/minizip/mztools.h b/updater/zlib123/contrib/minizip/mztools.h
new file mode 100644
index 0000000..82d1597
--- /dev/null
+++ b/updater/zlib123/contrib/minizip/mztools.h
@@ -0,0 +1,31 @@
+/*
+  Additional tools for Minizip
+  Code: Xavier Roche '2004
+  License: Same as ZLIB (www.gzip.org)
+*/
+
+#ifndef _zip_tools_H
+#define _zip_tools_H
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#ifndef _ZLIB_H
+#include "zlib.h"
+#endif
+
+#include "unzip.h"
+
+/* Repair a ZIP file (missing central directory) 
+   file: file to recover
+   fileOut: output file after recovery
+   fileOutTmp: temporary file name used for recovery
+*/
+extern int ZEXPORT unzRepair(const char* file, 
+                             const char* fileOut, 
+                             const char* fileOutTmp, 
+                             uLong* nRecovered,
+                             uLong* bytesRecovered);
+
+#endif
diff --git a/updater/zlib123/contrib/pascal/example.pas b/updater/zlib123/contrib/pascal/example.pas
new file mode 100644
index 0000000..bb04099
--- /dev/null
+++ b/updater/zlib123/contrib/pascal/example.pas
@@ -0,0 +1,599 @@
+(* example.c -- usage example of the zlib compression library
+ * Copyright (C) 1995-2003 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ *
+ * Pascal translation
+ * Copyright (C) 1998 by Jacques Nomssi Nzali.
+ * For conditions of distribution and use, see copyright notice in readme.txt
+ *
+ * Adaptation to the zlibpas interface
+ * Copyright (C) 2003 by Cosmin Truta.
+ * For conditions of distribution and use, see copyright notice in readme.txt
+ *)
+
+program example;
+
+{$DEFINE TEST_COMPRESS}
+{DO NOT $DEFINE TEST_GZIO}
+{$DEFINE TEST_DEFLATE}
+{$DEFINE TEST_INFLATE}
+{$DEFINE TEST_FLUSH}
+{$DEFINE TEST_SYNC}
+{$DEFINE TEST_DICT}
+
+uses SysUtils, zlibpas;
+
+const TESTFILE = 'foo.gz';
+
+(* "hello world" would be more standard, but the repeated "hello"
+ * stresses the compression code better, sorry...
+ *)
+const hello: PChar = 'hello, hello!';
+
+const dictionary: PChar = 'hello';
+
+var dictId: LongInt; (* Adler32 value of the dictionary *)
+
+procedure CHECK_ERR(err: Integer; msg: String);
+begin
+  if err <> Z_OK then
+  begin
+    WriteLn(msg, ' error: ', err);
+    Halt(1);
+  end;
+end;
+
+procedure EXIT_ERR(const msg: String);
+begin
+  WriteLn('Error: ', msg);
+  Halt(1);
+end;
+
+(* ===========================================================================
+ * Test compress and uncompress
+ *)
+{$IFDEF TEST_COMPRESS}
+procedure test_compress(compr: Pointer; comprLen: LongInt;
+                        uncompr: Pointer; uncomprLen: LongInt);
+var err: Integer;
+    len: LongInt;
+begin
+  len := StrLen(hello)+1;
+
+  err := compress(compr, comprLen, hello, len);
+  CHECK_ERR(err, 'compress');
+
+  StrCopy(PChar(uncompr), 'garbage');
+
+  err := uncompress(uncompr, uncomprLen, compr, comprLen);
+  CHECK_ERR(err, 'uncompress');
+
+  if StrComp(PChar(uncompr), hello) <> 0 then
+    EXIT_ERR('bad uncompress')
+  else
+    WriteLn('uncompress(): ', PChar(uncompr));
+end;
+{$ENDIF}
+
+(* ===========================================================================
+ * Test read/write of .gz files
+ *)
+{$IFDEF TEST_GZIO}
+procedure test_gzio(const fname: PChar; (* compressed file name *)
+                    uncompr: Pointer;
+                    uncomprLen: LongInt);
+var err: Integer;
+    len: Integer;
+    zfile: gzFile;
+    pos: LongInt;
+begin
+  len := StrLen(hello)+1;
+
+  zfile := gzopen(fname, 'wb');
+  if zfile = NIL then
+  begin
+    WriteLn('gzopen error');
+    Halt(1);
+  end;
+  gzputc(zfile, 'h');
+  if gzputs(zfile, 'ello') <> 4 then
+  begin
+    WriteLn('gzputs err: ', gzerror(zfile, err));
+    Halt(1);
+  end;
+  {$IFDEF GZ_FORMAT_STRING}
+  if gzprintf(zfile, ', %s!', 'hello') <> 8 then
+  begin
+    WriteLn('gzprintf err: ', gzerror(zfile, err));
+    Halt(1);
+  end;
+  {$ELSE}
+  if gzputs(zfile, ', hello!') <> 8 then
+  begin
+    WriteLn('gzputs err: ', gzerror(zfile, err));
+    Halt(1);
+  end;
+  {$ENDIF}
+  gzseek(zfile, 1, SEEK_CUR); (* add one zero byte *)
+  gzclose(zfile);
+
+  zfile := gzopen(fname, 'rb');
+  if zfile = NIL then
+  begin
+    WriteLn('gzopen error');
+    Halt(1);
+  end;
+
+  StrCopy(PChar(uncompr), 'garbage');
+
+  if gzread(zfile, uncompr, uncomprLen) <> len then
+  begin
+    WriteLn('gzread err: ', gzerror(zfile, err));
+    Halt(1);
+  end;
+  if StrComp(PChar(uncompr), hello) <> 0 then
+  begin
+    WriteLn('bad gzread: ', PChar(uncompr));
+    Halt(1);
+  end
+  else
+    WriteLn('gzread(): ', PChar(uncompr));
+
+  pos := gzseek(zfile, -8, SEEK_CUR);
+  if (pos <> 6) or (gztell(zfile) <> pos) then
+  begin
+    WriteLn('gzseek error, pos=', pos, ', gztell=', gztell(zfile));
+    Halt(1);
+  end;
+
+  if gzgetc(zfile) <> ' ' then
+  begin
+    WriteLn('gzgetc error');
+    Halt(1);
+  end;
+
+  if gzungetc(' ', zfile) <> ' ' then
+  begin
+    WriteLn('gzungetc error');
+    Halt(1);
+  end;
+
+  gzgets(zfile, PChar(uncompr), uncomprLen);
+  uncomprLen := StrLen(PChar(uncompr));
+  if uncomprLen <> 7 then (* " hello!" *)
+  begin
+    WriteLn('gzgets err after gzseek: ', gzerror(zfile, err));
+    Halt(1);
+  end;
+  if StrComp(PChar(uncompr), hello + 6) <> 0 then
+  begin
+    WriteLn('bad gzgets after gzseek');
+    Halt(1);
+  end
+  else
+    WriteLn('gzgets() after gzseek: ', PChar(uncompr));
+
+  gzclose(zfile);
+end;
+{$ENDIF}
+
+(* ===========================================================================
+ * Test deflate with small buffers
+ *)
+{$IFDEF TEST_DEFLATE}
+procedure test_deflate(compr: Pointer; comprLen: LongInt);
+var c_stream: z_stream; (* compression stream *)
+    err: Integer;
+    len: LongInt;
+begin
+  len := StrLen(hello)+1;
+
+  c_stream.zalloc := NIL;
+  c_stream.zfree := NIL;
+  c_stream.opaque := NIL;
+
+  err := deflateInit(c_stream, Z_DEFAULT_COMPRESSION);
+  CHECK_ERR(err, 'deflateInit');
+
+  c_stream.next_in := hello;
+  c_stream.next_out := compr;
+
+  while (c_stream.total_in <> len) and
+        (c_stream.total_out < comprLen) do
+  begin
+    c_stream.avail_out := 1; { force small buffers }
+    c_stream.avail_in := 1;
+    err := deflate(c_stream, Z_NO_FLUSH);
+    CHECK_ERR(err, 'deflate');
+  end;
+
+  (* Finish the stream, still forcing small buffers: *)
+  while TRUE do
+  begin
+    c_stream.avail_out := 1;
+    err := deflate(c_stream, Z_FINISH);
+    if err = Z_STREAM_END then
+      break;
+    CHECK_ERR(err, 'deflate');
+  end;
+
+  err := deflateEnd(c_stream);
+  CHECK_ERR(err, 'deflateEnd');
+end;
+{$ENDIF}
+
+(* ===========================================================================
+ * Test inflate with small buffers
+ *)
+{$IFDEF TEST_INFLATE}
+procedure test_inflate(compr: Pointer; comprLen : LongInt;
+                       uncompr: Pointer; uncomprLen : LongInt);
+var err: Integer;
+    d_stream: z_stream; (* decompression stream *)
+begin
+  StrCopy(PChar(uncompr), 'garbage');
+
+  d_stream.zalloc := NIL;
+  d_stream.zfree := NIL;
+  d_stream.opaque := NIL;
+
+  d_stream.next_in := compr;
+  d_stream.avail_in := 0;
+  d_stream.next_out := uncompr;
+
+  err := inflateInit(d_stream);
+  CHECK_ERR(err, 'inflateInit');
+
+  while (d_stream.total_out < uncomprLen) and
+        (d_stream.total_in < comprLen) do
+  begin
+    d_stream.avail_out := 1; (* force small buffers *)
+    d_stream.avail_in := 1;
+    err := inflate(d_stream, Z_NO_FLUSH);
+    if err = Z_STREAM_END then
+      break;
+    CHECK_ERR(err, 'inflate');
+  end;
+
+  err := inflateEnd(d_stream);
+  CHECK_ERR(err, 'inflateEnd');
+
+  if StrComp(PChar(uncompr), hello) <> 0 then
+    EXIT_ERR('bad inflate')
+  else
+    WriteLn('inflate(): ', PChar(uncompr));
+end;
+{$ENDIF}
+
+(* ===========================================================================
+ * Test deflate with large buffers and dynamic change of compression level
+ *)
+{$IFDEF TEST_DEFLATE}
+procedure test_large_deflate(compr: Pointer; comprLen: LongInt;
+                             uncompr: Pointer; uncomprLen: LongInt);
+var c_stream: z_stream; (* compression stream *)
+    err: Integer;
+begin
+  c_stream.zalloc := NIL;
+  c_stream.zfree := NIL;
+  c_stream.opaque := NIL;
+
+  err := deflateInit(c_stream, Z_BEST_SPEED);
+  CHECK_ERR(err, 'deflateInit');
+
+  c_stream.next_out := compr;
+  c_stream.avail_out := Integer(comprLen);
+
+  (* At this point, uncompr is still mostly zeroes, so it should compress
+   * very well:
+   *)
+  c_stream.next_in := uncompr;
+  c_stream.avail_in := Integer(uncomprLen);
+  err := deflate(c_stream, Z_NO_FLUSH);
+  CHECK_ERR(err, 'deflate');
+  if c_stream.avail_in <> 0 then
+    EXIT_ERR('deflate not greedy');
+
+  (* Feed in already compressed data and switch to no compression: *)
+  deflateParams(c_stream, Z_NO_COMPRESSION, Z_DEFAULT_STRATEGY);
+  c_stream.next_in := compr;
+  c_stream.avail_in := Integer(comprLen div 2);
+  err := deflate(c_stream, Z_NO_FLUSH);
+  CHECK_ERR(err, 'deflate');
+
+  (* Switch back to compressing mode: *)
+  deflateParams(c_stream, Z_BEST_COMPRESSION, Z_FILTERED);
+  c_stream.next_in := uncompr;
+  c_stream.avail_in := Integer(uncomprLen);
+  err := deflate(c_stream, Z_NO_FLUSH);
+  CHECK_ERR(err, 'deflate');
+
+  err := deflate(c_stream, Z_FINISH);
+  if err <> Z_STREAM_END then
+    EXIT_ERR('deflate should report Z_STREAM_END');
+
+  err := deflateEnd(c_stream);
+  CHECK_ERR(err, 'deflateEnd');
+end;
+{$ENDIF}
+
+(* ===========================================================================
+ * Test inflate with large buffers
+ *)
+{$IFDEF TEST_INFLATE}
+procedure test_large_inflate(compr: Pointer; comprLen: LongInt;
+                             uncompr: Pointer; uncomprLen: LongInt);
+var err: Integer;
+    d_stream: z_stream; (* decompression stream *)
+begin
+  StrCopy(PChar(uncompr), 'garbage');
+
+  d_stream.zalloc := NIL;
+  d_stream.zfree := NIL;
+  d_stream.opaque := NIL;
+
+  d_stream.next_in := compr;
+  d_stream.avail_in := Integer(comprLen);
+
+  err := inflateInit(d_stream);
+  CHECK_ERR(err, 'inflateInit');
+
+  while TRUE do
+  begin
+    d_stream.next_out := uncompr;            (* discard the output *)
+    d_stream.avail_out := Integer(uncomprLen);
+    err := inflate(d_stream, Z_NO_FLUSH);
+    if err = Z_STREAM_END then
+      break;
+    CHECK_ERR(err, 'large inflate');
+  end;
+
+  err := inflateEnd(d_stream);
+  CHECK_ERR(err, 'inflateEnd');
+
+  if d_stream.total_out <> 2 * uncomprLen + comprLen div 2 then
+  begin
+    WriteLn('bad large inflate: ', d_stream.total_out);
+    Halt(1);
+  end
+  else
+    WriteLn('large_inflate(): OK');
+end;
+{$ENDIF}
+
+(* ===========================================================================
+ * Test deflate with full flush
+ *)
+{$IFDEF TEST_FLUSH}
+procedure test_flush(compr: Pointer; var comprLen : LongInt);
+var c_stream: z_stream; (* compression stream *)
+    err: Integer;
+    len: Integer;
+begin
+  len := StrLen(hello)+1;
+
+  c_stream.zalloc := NIL;
+  c_stream.zfree := NIL;
+  c_stream.opaque := NIL;
+
+  err := deflateInit(c_stream, Z_DEFAULT_COMPRESSION);
+  CHECK_ERR(err, 'deflateInit');
+
+  c_stream.next_in := hello;
+  c_stream.next_out := compr;
+  c_stream.avail_in := 3;
+  c_stream.avail_out := Integer(comprLen);
+  err := deflate(c_stream, Z_FULL_FLUSH);
+  CHECK_ERR(err, 'deflate');
+
+  Inc(PByteArray(compr)^[3]); (* force an error in first compressed block *)
+  c_stream.avail_in := len - 3;
+
+  err := deflate(c_stream, Z_FINISH);
+  if err <> Z_STREAM_END then
+    CHECK_ERR(err, 'deflate');
+
+  err := deflateEnd(c_stream);
+  CHECK_ERR(err, 'deflateEnd');
+
+  comprLen := c_stream.total_out;
+end;
+{$ENDIF}
+
+(* ===========================================================================
+ * Test inflateSync()
+ *)
+{$IFDEF TEST_SYNC}
+procedure test_sync(compr: Pointer; comprLen: LongInt;
+                    uncompr: Pointer; uncomprLen : LongInt);
+var err: Integer;
+    d_stream: z_stream; (* decompression stream *)
+begin
+  StrCopy(PChar(uncompr), 'garbage');
+
+  d_stream.zalloc := NIL;
+  d_stream.zfree := NIL;
+  d_stream.opaque := NIL;
+
+  d_stream.next_in := compr;
+  d_stream.avail_in := 2; (* just read the zlib header *)
+
+  err := inflateInit(d_stream);
+  CHECK_ERR(err, 'inflateInit');
+
+  d_stream.next_out := uncompr;
+  d_stream.avail_out := Integer(uncomprLen);
+
+  inflate(d_stream, Z_NO_FLUSH);
+  CHECK_ERR(err, 'inflate');
+
+  d_stream.avail_in := Integer(comprLen-2);   (* read all compressed data *)
+  err := inflateSync(d_stream);               (* but skip the damaged part *)
+  CHECK_ERR(err, 'inflateSync');
+
+  err := inflate(d_stream, Z_FINISH);
+  if err <> Z_DATA_ERROR then
+    EXIT_ERR('inflate should report DATA_ERROR');
+    (* Because of incorrect adler32 *)
+
+  err := inflateEnd(d_stream);
+  CHECK_ERR(err, 'inflateEnd');
+
+  WriteLn('after inflateSync(): hel', PChar(uncompr));
+end;
+{$ENDIF}
+
+(* ===========================================================================
+ * Test deflate with preset dictionary
+ *)
+{$IFDEF TEST_DICT}
+procedure test_dict_deflate(compr: Pointer; comprLen: LongInt);
+var c_stream: z_stream; (* compression stream *)
+    err: Integer;
+begin
+  c_stream.zalloc := NIL;
+  c_stream.zfree := NIL;
+  c_stream.opaque := NIL;
+
+  err := deflateInit(c_stream, Z_BEST_COMPRESSION);
+  CHECK_ERR(err, 'deflateInit');
+
+  err := deflateSetDictionary(c_stream, dictionary, StrLen(dictionary));
+  CHECK_ERR(err, 'deflateSetDictionary');
+
+  dictId := c_stream.adler;
+  c_stream.next_out := compr;
+  c_stream.avail_out := Integer(comprLen);
+
+  c_stream.next_in := hello;
+  c_stream.avail_in := StrLen(hello)+1;
+
+  err := deflate(c_stream, Z_FINISH);
+  if err <> Z_STREAM_END then
+    EXIT_ERR('deflate should report Z_STREAM_END');
+
+  err := deflateEnd(c_stream);
+  CHECK_ERR(err, 'deflateEnd');
+end;
+{$ENDIF}
+
+(* ===========================================================================
+ * Test inflate with a preset dictionary
+ *)
+{$IFDEF TEST_DICT}
+procedure test_dict_inflate(compr: Pointer; comprLen: LongInt;
+                            uncompr: Pointer; uncomprLen: LongInt);
+var err: Integer;
+    d_stream: z_stream; (* decompression stream *)
+begin
+  StrCopy(PChar(uncompr), 'garbage');
+
+  d_stream.zalloc := NIL;
+  d_stream.zfree := NIL;
+  d_stream.opaque := NIL;
+
+  d_stream.next_in := compr;
+  d_stream.avail_in := Integer(comprLen);
+
+  err := inflateInit(d_stream);
+  CHECK_ERR(err, 'inflateInit');
+
+  d_stream.next_out := uncompr;
+  d_stream.avail_out := Integer(uncomprLen);
+
+  while TRUE do
+  begin
+    err := inflate(d_stream, Z_NO_FLUSH);
+    if err = Z_STREAM_END then
+      break;
+    if err = Z_NEED_DICT then
+    begin
+      if d_stream.adler <> dictId then
+        EXIT_ERR('unexpected dictionary');
+      err := inflateSetDictionary(d_stream, dictionary, StrLen(dictionary));
+    end;
+    CHECK_ERR(err, 'inflate with dict');
+  end;
+
+  err := inflateEnd(d_stream);
+  CHECK_ERR(err, 'inflateEnd');
+
+  if StrComp(PChar(uncompr), hello) <> 0 then
+    EXIT_ERR('bad inflate with dict')
+  else
+    WriteLn('inflate with dictionary: ', PChar(uncompr));
+end;
+{$ENDIF}
+
+var compr, uncompr: Pointer;
+    comprLen, uncomprLen: LongInt;
+
+begin
+  if zlibVersion^ <> ZLIB_VERSION[1] then
+    EXIT_ERR('Incompatible zlib version');
+
+  WriteLn('zlib version: ', zlibVersion);
+  WriteLn('zlib compile flags: ', Format('0x%x', [zlibCompileFlags]));
+
+  comprLen := 10000 * SizeOf(Integer); (* don't overflow on MSDOS *)
+  uncomprLen := comprLen;
+  GetMem(compr, comprLen);
+  GetMem(uncompr, uncomprLen);
+  if (compr = NIL) or (uncompr = NIL) then
+    EXIT_ERR('Out of memory');
+  (* compr and uncompr are cleared to avoid reading uninitialized
+   * data and to ensure that uncompr compresses well.
+   *)
+  FillChar(compr^, comprLen, 0);
+  FillChar(uncompr^, uncomprLen, 0);
+
+  {$IFDEF TEST_COMPRESS}
+  WriteLn('** Testing compress');
+  test_compress(compr, comprLen, uncompr, uncomprLen);
+  {$ENDIF}
+
+  {$IFDEF TEST_GZIO}
+  WriteLn('** Testing gzio');
+  if ParamCount >= 1 then
+    test_gzio(ParamStr(1), uncompr, uncomprLen)
+  else
+    test_gzio(TESTFILE, uncompr, uncomprLen);
+  {$ENDIF}
+
+  {$IFDEF TEST_DEFLATE}
+  WriteLn('** Testing deflate with small buffers');
+  test_deflate(compr, comprLen);
+  {$ENDIF}
+  {$IFDEF TEST_INFLATE}
+  WriteLn('** Testing inflate with small buffers');
+  test_inflate(compr, comprLen, uncompr, uncomprLen);
+  {$ENDIF}
+
+  {$IFDEF TEST_DEFLATE}
+  WriteLn('** Testing deflate with large buffers');
+  test_large_deflate(compr, comprLen, uncompr, uncomprLen);
+  {$ENDIF}
+  {$IFDEF TEST_INFLATE}
+  WriteLn('** Testing inflate with large buffers');
+  test_large_inflate(compr, comprLen, uncompr, uncomprLen);
+  {$ENDIF}
+
+  {$IFDEF TEST_FLUSH}
+  WriteLn('** Testing deflate with full flush');
+  test_flush(compr, comprLen);
+  {$ENDIF}
+  {$IFDEF TEST_SYNC}
+  WriteLn('** Testing inflateSync');
+  test_sync(compr, comprLen, uncompr, uncomprLen);
+  {$ENDIF}
+  comprLen := uncomprLen;
+
+  {$IFDEF TEST_DICT}
+  WriteLn('** Testing deflate and inflate with preset dictionary');
+  test_dict_deflate(compr, comprLen);
+  test_dict_inflate(compr, comprLen, uncompr, uncomprLen);
+  {$ENDIF}
+
+  FreeMem(compr, comprLen);
+  FreeMem(uncompr, uncomprLen);
+end.
diff --git a/updater/zlib123/contrib/pascal/readme.txt b/updater/zlib123/contrib/pascal/readme.txt
new file mode 100644
index 0000000..573a4a0
--- /dev/null
+++ b/updater/zlib123/contrib/pascal/readme.txt
@@ -0,0 +1,76 @@
+
+This directory contains a Pascal (Delphi, Kylix) interface to the
+zlib data compression library.
+
+
+Directory listing
+=================
+
+zlibd32.mak     makefile for Borland C++
+example.pas     usage example of zlib
+zlibpas.pas     the Pascal interface to zlib
+readme.txt      this file
+
+
+Compatibility notes
+===================
+
+- Although the name "zlib" would have been more normal for the
+  zlibpas unit, this name is already taken by Borland's ZLib unit.
+  This is somehow unfortunate, because that unit is not a genuine
+  interface to the full-fledged zlib functionality, but a suite of
+  class wrappers around zlib streams.  Other essential features,
+  such as checksums, are missing.
+  It would have been more appropriate for that unit to have a name
+  like "ZStreams", or something similar.
+
+- The C and zlib-supplied types int, uInt, long, uLong, etc. are
+  translated directly into Pascal types of similar sizes (Integer,
+  LongInt, etc.), to avoid namespace pollution.  In particular,
+  there is no conversion of unsigned int into a Pascal unsigned
+  integer.  The Word type is non-portable and has the same size
+  (16 bits) both in a 16-bit and in a 32-bit environment, unlike
+  Integer.  Even if there is a 32-bit Cardinal type, there is no
+  real need for unsigned int in zlib under a 32-bit environment.
+
+- Except for the callbacks, the zlib function interfaces are
+  assuming the calling convention normally used in Pascal
+  (__pascal for DOS and Windows16, __fastcall for Windows32).
+  Since the cdecl keyword is used, the old Turbo Pascal does
+  not work with this interface.
+
+- The gz* function interfaces are not translated, to avoid
+  interfacing problems with the C runtime library.  Besides,
+    gzprintf(gzFile file, const char *format, ...)
+  cannot be translated into Pascal.
+
+
+Legal issues
+============
+
+The zlibpas interface is:
+  Copyright (C) 1995-2003 Jean-loup Gailly and Mark Adler.
+  Copyright (C) 1998 by Bob Dellaca.
+  Copyright (C) 2003 by Cosmin Truta.
+
+The example program is:
+  Copyright (C) 1995-2003 by Jean-loup Gailly.
+  Copyright (C) 1998,1999,2000 by Jacques Nomssi Nzali.
+  Copyright (C) 2003 by Cosmin Truta.
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the author be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
diff --git a/updater/zlib123/contrib/pascal/zlibd32.mak b/updater/zlib123/contrib/pascal/zlibd32.mak
new file mode 100644
index 0000000..6fb10e4
--- /dev/null
+++ b/updater/zlib123/contrib/pascal/zlibd32.mak
@@ -0,0 +1,93 @@
+# Makefile for zlib
+# For use with Delphi and C++ Builder under Win32
+# Updated for zlib 1.2.x by Cosmin Truta
+
+# ------------ Borland C++ ------------
+
+# This project uses the Delphi (fastcall/register) calling convention:
+LOC = -DZEXPORT=__fastcall -DZEXPORTVA=__cdecl
+
+CC = bcc32
+LD = bcc32
+AR = tlib
+# do not use "-pr" in CFLAGS
+CFLAGS = -a -d -k- -O2 $(LOC)
+LDFLAGS =
+
+
+# variables
+ZLIB_LIB = zlib.lib
+
+OBJ1 = adler32.obj compress.obj crc32.obj deflate.obj gzio.obj infback.obj
+OBJ2 = inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
+OBJP1 = +adler32.obj+compress.obj+crc32.obj+deflate.obj+gzio.obj+infback.obj
+OBJP2 = +inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
+
+
+# targets
+all: $(ZLIB_LIB) example.exe minigzip.exe
+
+.c.obj:
+	$(CC) -c $(CFLAGS) $*.c
+
+adler32.obj: adler32.c zlib.h zconf.h
+
+compress.obj: compress.c zlib.h zconf.h
+
+crc32.obj: crc32.c zlib.h zconf.h crc32.h
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+
+infback.obj: infback.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+
+trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+
+example.obj: example.c zlib.h zconf.h
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+
+
+# For the sake of the old Borland make,
+# the command line is cut to fit in the MS-DOS 128 byte limit:
+$(ZLIB_LIB): $(OBJ1) $(OBJ2)
+	-del $(ZLIB_LIB)
+	$(AR) $(ZLIB_LIB) $(OBJP1)
+	$(AR) $(ZLIB_LIB) $(OBJP2)
+
+
+# testing
+test: example.exe minigzip.exe
+	example
+	echo hello world | minigzip | minigzip -d
+
+example.exe: example.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) example.obj $(ZLIB_LIB)
+
+minigzip.exe: minigzip.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) minigzip.obj $(ZLIB_LIB)
+
+
+# cleanup
+clean:
+	-del *.obj
+	-del *.exe
+	-del *.lib
+	-del *.tds
+	-del zlib.bak
+	-del foo.gz
+
diff --git a/updater/zlib123/contrib/pascal/zlibpas.pas b/updater/zlib123/contrib/pascal/zlibpas.pas
new file mode 100644
index 0000000..e67c44b
--- /dev/null
+++ b/updater/zlib123/contrib/pascal/zlibpas.pas
@@ -0,0 +1,236 @@
+(* zlibpas -- Pascal interface to the zlib data compression library
+ *
+ * Copyright (C) 2003 Cosmin Truta.
+ * Derived from original sources by Bob Dellaca.
+ * For conditions of distribution and use, see copyright notice in readme.txt
+ *)
+
+unit zlibpas;
+
+interface
+
+const
+  ZLIB_VERSION = '1.2.3';
+
+type
+  alloc_func = function(opaque: Pointer; items, size: Integer): Pointer;
+                 cdecl;
+  free_func  = procedure(opaque, address: Pointer);
+                 cdecl;
+
+  in_func    = function(opaque: Pointer; var buf: PByte): Integer;
+                 cdecl;
+  out_func   = function(opaque: Pointer; buf: PByte; size: Integer): Integer;
+                 cdecl;
+
+  z_streamp = ^z_stream;
+  z_stream = packed record
+    next_in: PChar;       (* next input byte *)
+    avail_in: Integer;    (* number of bytes available at next_in *)
+    total_in: LongInt;    (* total nb of input bytes read so far *)
+
+    next_out: PChar;      (* next output byte should be put there *)
+    avail_out: Integer;   (* remaining free space at next_out *)
+    total_out: LongInt;   (* total nb of bytes output so far *)
+
+    msg: PChar;           (* last error message, NULL if no error *)
+    state: Pointer;       (* not visible by applications *)
+
+    zalloc: alloc_func;   (* used to allocate the internal state *)
+    zfree: free_func;     (* used to free the internal state *)
+    opaque: Pointer;      (* private data object passed to zalloc and zfree *)
+
+    data_type: Integer;   (* best guess about the data type: ascii or binary *)
+    adler: LongInt;       (* adler32 value of the uncompressed data *)
+    reserved: LongInt;    (* reserved for future use *)
+  end;
+
+(* constants *)
+const
+  Z_NO_FLUSH      = 0;
+  Z_PARTIAL_FLUSH = 1;
+  Z_SYNC_FLUSH    = 2;
+  Z_FULL_FLUSH    = 3;
+  Z_FINISH        = 4;
+
+  Z_OK            =  0;
+  Z_STREAM_END    =  1;
+  Z_NEED_DICT     =  2;
+  Z_ERRNO         = -1;
+  Z_STREAM_ERROR  = -2;
+  Z_DATA_ERROR    = -3;
+  Z_MEM_ERROR     = -4;
+  Z_BUF_ERROR     = -5;
+  Z_VERSION_ERROR = -6;
+
+  Z_NO_COMPRESSION       =  0;
+  Z_BEST_SPEED           =  1;
+  Z_BEST_COMPRESSION     =  9;
+  Z_DEFAULT_COMPRESSION  = -1;
+
+  Z_FILTERED            = 1;
+  Z_HUFFMAN_ONLY        = 2;
+  Z_RLE                 = 3;
+  Z_DEFAULT_STRATEGY    = 0;
+
+  Z_BINARY   = 0;
+  Z_ASCII    = 1;
+  Z_UNKNOWN  = 2;
+
+  Z_DEFLATED = 8;
+
+(* basic functions *)
+function zlibVersion: PChar;
+function deflateInit(var strm: z_stream; level: Integer): Integer;
+function deflate(var strm: z_stream; flush: Integer): Integer;
+function deflateEnd(var strm: z_stream): Integer;
+function inflateInit(var strm: z_stream): Integer;
+function inflate(var strm: z_stream; flush: Integer): Integer;
+function inflateEnd(var strm: z_stream): Integer;
+
+(* advanced functions *)
+function deflateInit2(var strm: z_stream; level, method, windowBits,
+                      memLevel, strategy: Integer): Integer;
+function deflateSetDictionary(var strm: z_stream; const dictionary: PChar;
+                              dictLength: Integer): Integer;
+function deflateCopy(var dest, source: z_stream): Integer;
+function deflateReset(var strm: z_stream): Integer;
+function deflateParams(var strm: z_stream; level, strategy: Integer): Integer;
+function deflateBound(var strm: z_stream; sourceLen: LongInt): LongInt;
+function deflatePrime(var strm: z_stream; bits, value: Integer): Integer;
+function inflateInit2(var strm: z_stream; windowBits: Integer): Integer;
+function inflateSetDictionary(var strm: z_stream; const dictionary: PChar;
+                              dictLength: Integer): Integer;
+function inflateSync(var strm: z_stream): Integer;
+function inflateCopy(var dest, source: z_stream): Integer;
+function inflateReset(var strm: z_stream): Integer;
+function inflateBackInit(var strm: z_stream;
+                         windowBits: Integer; window: PChar): Integer;
+function inflateBack(var strm: z_stream; in_fn: in_func; in_desc: Pointer;
+                     out_fn: out_func; out_desc: Pointer): Integer;
+function inflateBackEnd(var strm: z_stream): Integer;
+function zlibCompileFlags: LongInt;
+
+(* utility functions *)
+function compress(dest: PChar; var destLen: LongInt;
+                  const source: PChar; sourceLen: LongInt): Integer;
+function compress2(dest: PChar; var destLen: LongInt;
+                  const source: PChar; sourceLen: LongInt;
+                  level: Integer): Integer;
+function compressBound(sourceLen: LongInt): LongInt;
+function uncompress(dest: PChar; var destLen: LongInt;
+                    const source: PChar; sourceLen: LongInt): Integer;
+
+(* checksum functions *)
+function adler32(adler: LongInt; const buf: PChar; len: Integer): LongInt;
+function crc32(crc: LongInt; const buf: PChar; len: Integer): LongInt;
+
+(* various hacks, don't look :) *)
+function deflateInit_(var strm: z_stream; level: Integer;
+                      const version: PChar; stream_size: Integer): Integer;
+function inflateInit_(var strm: z_stream; const version: PChar;
+                      stream_size: Integer): Integer;
+function deflateInit2_(var strm: z_stream;
+                       level, method, windowBits, memLevel, strategy: Integer;
+                       const version: PChar; stream_size: Integer): Integer;
+function inflateInit2_(var strm: z_stream; windowBits: Integer;
+                       const version: PChar; stream_size: Integer): Integer;
+function inflateBackInit_(var strm: z_stream;
+                          windowBits: Integer; window: PChar;
+                          const version: PChar; stream_size: Integer): Integer;
+
+
+implementation
+
+{$L adler32.obj}
+{$L compress.obj}
+{$L crc32.obj}
+{$L deflate.obj}
+{$L infback.obj}
+{$L inffast.obj}
+{$L inflate.obj}
+{$L inftrees.obj}
+{$L trees.obj}
+{$L uncompr.obj}
+{$L zutil.obj}
+
+function adler32; external;
+function compress; external;
+function compress2; external;
+function compressBound; external;
+function crc32; external;
+function deflate; external;
+function deflateBound; external;
+function deflateCopy; external;
+function deflateEnd; external;
+function deflateInit_; external;
+function deflateInit2_; external;
+function deflateParams; external;
+function deflatePrime; external;
+function deflateReset; external;
+function deflateSetDictionary; external;
+function inflate; external;
+function inflateBack; external;
+function inflateBackEnd; external;
+function inflateBackInit_; external;
+function inflateCopy; external;
+function inflateEnd; external;
+function inflateInit_; external;
+function inflateInit2_; external;
+function inflateReset; external;
+function inflateSetDictionary; external;
+function inflateSync; external;
+function uncompress; external;
+function zlibCompileFlags; external;
+function zlibVersion; external;
+
+function deflateInit(var strm: z_stream; level: Integer): Integer;
+begin
+  Result := deflateInit_(strm, level, ZLIB_VERSION, sizeof(z_stream));
+end;
+
+function deflateInit2(var strm: z_stream; level, method, windowBits, memLevel,
+                      strategy: Integer): Integer;
+begin
+  Result := deflateInit2_(strm, level, method, windowBits, memLevel, strategy,
+                          ZLIB_VERSION, sizeof(z_stream));
+end;
+
+function inflateInit(var strm: z_stream): Integer;
+begin
+  Result := inflateInit_(strm, ZLIB_VERSION, sizeof(z_stream));
+end;
+
+function inflateInit2(var strm: z_stream; windowBits: Integer): Integer;
+begin
+  Result := inflateInit2_(strm, windowBits, ZLIB_VERSION, sizeof(z_stream));
+end;
+
+function inflateBackInit(var strm: z_stream;
+                         windowBits: Integer; window: PChar): Integer;
+begin
+  Result := inflateBackInit_(strm, windowBits, window,
+                             ZLIB_VERSION, sizeof(z_stream));
+end;
+
+function _malloc(Size: Integer): Pointer; cdecl;
+begin
+  GetMem(Result, Size);
+end;
+
+procedure _free(Block: Pointer); cdecl;
+begin
+  FreeMem(Block);
+end;
+
+procedure _memset(P: Pointer; B: Byte; count: Integer); cdecl;
+begin
+  FillChar(P^, count, B);
+end;
+
+procedure _memcpy(dest, source: Pointer; count: Integer); cdecl;
+begin
+  Move(source^, dest^, count);
+end;
+
+end.
diff --git a/updater/zlib123/contrib/puff/Makefile b/updater/zlib123/contrib/puff/Makefile
new file mode 100644
index 0000000..0c6c7b9
--- /dev/null
+++ b/updater/zlib123/contrib/puff/Makefile
@@ -0,0 +1,8 @@
+puff: puff.c puff.h
+	cc -DTEST -o puff puff.c
+
+test: puff
+	puff zeros.raw
+
+clean:
+	rm -f puff puff.o
diff --git a/updater/zlib123/contrib/puff/README b/updater/zlib123/contrib/puff/README
new file mode 100644
index 0000000..1dbbc21
--- /dev/null
+++ b/updater/zlib123/contrib/puff/README
@@ -0,0 +1,63 @@
+Puff -- A Simple Inflate
+3 Mar 2003
+Mark Adler
+madler@alumni.caltech.edu
+
+What this is --
+
+puff.c provides the routine puff() to decompress the deflate data format.  It
+does so more slowly than zlib, but the code is about one-fifth the size of the
+inflate code in zlib, and written to be very easy to read.
+
+Why I wrote this --
+
+puff.c was written to document the deflate format unambiguously, by virtue of
+being working C code.  It is meant to supplement RFC 1951, which formally
+describes the deflate format.  I have received many questions on details of the
+deflate format, and I hope that reading this code will answer those questions.
+puff.c is heavily commented with details of the deflate format, especially
+those little nooks and cranies of the format that might not be obvious from a
+specification.
+
+puff.c may also be useful in applications where code size or memory usage is a
+very limited resource, and speed is not as important.
+
+How to use it --
+
+Well, most likely you should just be reading puff.c and using zlib for actual
+applications, but if you must ...
+
+Include puff.h in your code, which provides this prototype:
+
+int puff(unsigned char *dest,           /* pointer to destination pointer */
+         unsigned long *destlen,        /* amount of output space */
+         unsigned char *source,         /* pointer to source data pointer */
+         unsigned long *sourcelen);     /* amount of input available */
+
+Then you can call puff() to decompress a deflate stream that is in memory in
+its entirety at source, to a sufficiently sized block of memory for the
+decompressed data at dest.  puff() is the only external symbol in puff.c  The
+only C library functions that puff.c needs are setjmp() and longjmp(), which
+are used to simplify error checking in the code to improve readabilty.  puff.c
+does no memory allocation, and uses less than 2K bytes off of the stack.
+
+If destlen is not enough space for the uncompressed data, then inflate will
+return an error without writing more than destlen bytes.  Note that this means
+that in order to decompress the deflate data successfully, you need to know
+the size of the uncompressed data ahead of time.
+
+If needed, puff() can determine the size of the uncompressed data with no
+output space.  This is done by passing dest equal to (unsigned char *)0.  Then
+the initial value of *destlen is ignored and *destlen is set to the length of
+the uncompressed data.  So if the size of the uncompressed data is not known,
+then two passes of puff() can be used--first to determine the size, and second
+to do the actual inflation after allocating the appropriate memory.  Not
+pretty, but it works.  (This is one of the reasons you should be using zlib.)
+
+The deflate format is self-terminating.  If the deflate stream does not end
+in *sourcelen bytes, puff() will return an error without reading at or past
+endsource.
+
+On return, *sourcelen is updated to the amount of input data consumed, and
+*destlen is updated to the size of the uncompressed data.  See the comments
+in puff.c for the possible return codes for puff().
diff --git a/updater/zlib123/contrib/puff/puff.c b/updater/zlib123/contrib/puff/puff.c
new file mode 100644
index 0000000..39d0cdb
--- /dev/null
+++ b/updater/zlib123/contrib/puff/puff.c
@@ -0,0 +1,837 @@
+/*
+ * puff.c
+ * Copyright (C) 2002-2004 Mark Adler
+ * For conditions of distribution and use, see copyright notice in puff.h
+ * version 1.8, 9 Jan 2004
+ *
+ * puff.c is a simple inflate written to be an unambiguous way to specify the
+ * deflate format.  It is not written for speed but rather simplicity.  As a
+ * side benefit, this code might actually be useful when small code is more
+ * important than speed, such as bootstrap applications.  For typical deflate
+ * data, zlib's inflate() is about four times as fast as puff().  zlib's
+ * inflate compiles to around 20K on my machine, whereas puff.c compiles to
+ * around 4K on my machine (a PowerPC using GNU cc).  If the faster decode()
+ * function here is used, then puff() is only twice as slow as zlib's
+ * inflate().
+ *
+ * All dynamically allocated memory comes from the stack.  The stack required
+ * is less than 2K bytes.  This code is compatible with 16-bit int's and
+ * assumes that long's are at least 32 bits.  puff.c uses the short data type,
+ * assumed to be 16 bits, for arrays in order to to conserve memory.  The code
+ * works whether integers are stored big endian or little endian.
+ *
+ * In the comments below are "Format notes" that describe the inflate process
+ * and document some of the less obvious aspects of the format.  This source
+ * code is meant to supplement RFC 1951, which formally describes the deflate
+ * format:
+ *
+ *    http://www.zlib.org/rfc-deflate.html
+ */
+
+/*
+ * Change history:
+ *
+ * 1.0  10 Feb 2002     - First version
+ * 1.1  17 Feb 2002     - Clarifications of some comments and notes
+ *                      - Update puff() dest and source pointers on negative
+ *                        errors to facilitate debugging deflators
+ *                      - Remove longest from struct huffman -- not needed
+ *                      - Simplify offs[] index in construct()
+ *                      - Add input size and checking, using longjmp() to
+ *                        maintain easy readability
+ *                      - Use short data type for large arrays
+ *                      - Use pointers instead of long to specify source and
+ *                        destination sizes to avoid arbitrary 4 GB limits
+ * 1.2  17 Mar 2002     - Add faster version of decode(), doubles speed (!),
+ *                        but leave simple version for readabilty
+ *                      - Make sure invalid distances detected if pointers
+ *                        are 16 bits
+ *                      - Fix fixed codes table error
+ *                      - Provide a scanning mode for determining size of
+ *                        uncompressed data
+ * 1.3  20 Mar 2002     - Go back to lengths for puff() parameters [Jean-loup]
+ *                      - Add a puff.h file for the interface
+ *                      - Add braces in puff() for else do [Jean-loup]
+ *                      - Use indexes instead of pointers for readability
+ * 1.4  31 Mar 2002     - Simplify construct() code set check
+ *                      - Fix some comments
+ *                      - Add FIXLCODES #define
+ * 1.5   6 Apr 2002     - Minor comment fixes
+ * 1.6   7 Aug 2002     - Minor format changes
+ * 1.7   3 Mar 2003     - Added test code for distribution
+ *                      - Added zlib-like license
+ * 1.8   9 Jan 2004     - Added some comments on no distance codes case
+ */
+
+#include <setjmp.h>             /* for setjmp(), longjmp(), and jmp_buf */
+#include "puff.h"               /* prototype for puff() */
+
+#define local static            /* for local function definitions */
+#define NIL ((unsigned char *)0)        /* for no output option */
+
+/*
+ * Maximums for allocations and loops.  It is not useful to change these --
+ * they are fixed by the deflate format.
+ */
+#define MAXBITS 15              /* maximum bits in a code */
+#define MAXLCODES 286           /* maximum number of literal/length codes */
+#define MAXDCODES 30            /* maximum number of distance codes */
+#define MAXCODES (MAXLCODES+MAXDCODES)  /* maximum codes lengths to read */
+#define FIXLCODES 288           /* number of fixed literal/length codes */
+
+/* input and output state */
+struct state {
+    /* output state */
+    unsigned char *out;         /* output buffer */
+    unsigned long outlen;       /* available space at out */
+    unsigned long outcnt;       /* bytes written to out so far */
+
+    /* input state */
+    unsigned char *in;          /* input buffer */
+    unsigned long inlen;        /* available input at in */
+    unsigned long incnt;        /* bytes read so far */
+    int bitbuf;                 /* bit buffer */
+    int bitcnt;                 /* number of bits in bit buffer */
+
+    /* input limit error return state for bits() and decode() */
+    jmp_buf env;
+};
+
+/*
+ * Return need bits from the input stream.  This always leaves less than
+ * eight bits in the buffer.  bits() works properly for need == 0.
+ *
+ * Format notes:
+ *
+ * - Bits are stored in bytes from the least significant bit to the most
+ *   significant bit.  Therefore bits are dropped from the bottom of the bit
+ *   buffer, using shift right, and new bytes are appended to the top of the
+ *   bit buffer, using shift left.
+ */
+local int bits(struct state *s, int need)
+{
+    long val;           /* bit accumulator (can use up to 20 bits) */
+
+    /* load at least need bits into val */
+    val = s->bitbuf;
+    while (s->bitcnt < need) {
+        if (s->incnt == s->inlen) longjmp(s->env, 1);   /* out of input */
+        val |= (long)(s->in[s->incnt++]) << s->bitcnt;  /* load eight bits */
+        s->bitcnt += 8;
+    }
+
+    /* drop need bits and update buffer, always zero to seven bits left */
+    s->bitbuf = (int)(val >> need);
+    s->bitcnt -= need;
+
+    /* return need bits, zeroing the bits above that */
+    return (int)(val & ((1L << need) - 1));
+}
+
+/*
+ * Process a stored block.
+ *
+ * Format notes:
+ *
+ * - After the two-bit stored block type (00), the stored block length and
+ *   stored bytes are byte-aligned for fast copying.  Therefore any leftover
+ *   bits in the byte that has the last bit of the type, as many as seven, are
+ *   discarded.  The value of the discarded bits are not defined and should not
+ *   be checked against any expectation.
+ *
+ * - The second inverted copy of the stored block length does not have to be
+ *   checked, but it's probably a good idea to do so anyway.
+ *
+ * - A stored block can have zero length.  This is sometimes used to byte-align
+ *   subsets of the compressed data for random access or partial recovery.
+ */
+local int stored(struct state *s)
+{
+    unsigned len;       /* length of stored block */
+
+    /* discard leftover bits from current byte (assumes s->bitcnt < 8) */
+    s->bitbuf = 0;
+    s->bitcnt = 0;
+
+    /* get length and check against its one's complement */
+    if (s->incnt + 4 > s->inlen) return 2;      /* not enough input */
+    len = s->in[s->incnt++];
+    len |= s->in[s->incnt++] << 8;
+    if (s->in[s->incnt++] != (~len & 0xff) ||
+        s->in[s->incnt++] != ((~len >> 8) & 0xff))
+        return -2;                              /* didn't match complement! */
+
+    /* copy len bytes from in to out */
+    if (s->incnt + len > s->inlen) return 2;    /* not enough input */
+    if (s->out != NIL) {
+        if (s->outcnt + len > s->outlen)
+            return 1;                           /* not enough output space */
+        while (len--)
+            s->out[s->outcnt++] = s->in[s->incnt++];
+    }
+    else {                                      /* just scanning */
+        s->outcnt += len;
+        s->incnt += len;
+    }
+
+    /* done with a valid stored block */
+    return 0;
+}
+
+/*
+ * Huffman code decoding tables.  count[1..MAXBITS] is the number of symbols of
+ * each length, which for a canonical code are stepped through in order.
+ * symbol[] are the symbol values in canonical order, where the number of
+ * entries is the sum of the counts in count[].  The decoding process can be
+ * seen in the function decode() below.
+ */
+struct huffman {
+    short *count;       /* number of symbols of each length */
+    short *symbol;      /* canonically ordered symbols */
+};
+
+/*
+ * Decode a code from the stream s using huffman table h.  Return the symbol or
+ * a negative value if there is an error.  If all of the lengths are zero, i.e.
+ * an empty code, or if the code is incomplete and an invalid code is received,
+ * then -9 is returned after reading MAXBITS bits.
+ *
+ * Format notes:
+ *
+ * - The codes as stored in the compressed data are bit-reversed relative to
+ *   a simple integer ordering of codes of the same lengths.  Hence below the
+ *   bits are pulled from the compressed data one at a time and used to
+ *   build the code value reversed from what is in the stream in order to
+ *   permit simple integer comparisons for decoding.  A table-based decoding
+ *   scheme (as used in zlib) does not need to do this reversal.
+ *
+ * - The first code for the shortest length is all zeros.  Subsequent codes of
+ *   the same length are simply integer increments of the previous code.  When
+ *   moving up a length, a zero bit is appended to the code.  For a complete
+ *   code, the last code of the longest length will be all ones.
+ *
+ * - Incomplete codes are handled by this decoder, since they are permitted
+ *   in the deflate format.  See the format notes for fixed() and dynamic().
+ */
+#ifdef SLOW
+local int decode(struct state *s, struct huffman *h)
+{
+    int len;            /* current number of bits in code */
+    int code;           /* len bits being decoded */
+    int first;          /* first code of length len */
+    int count;          /* number of codes of length len */
+    int index;          /* index of first code of length len in symbol table */
+
+    code = first = index = 0;
+    for (len = 1; len <= MAXBITS; len++) {
+        code |= bits(s, 1);             /* get next bit */
+        count = h->count[len];
+        if (code < first + count)       /* if length len, return symbol */
+            return h->symbol[index + (code - first)];
+        index += count;                 /* else update for next length */
+        first += count;
+        first <<= 1;
+        code <<= 1;
+    }
+    return -9;                          /* ran out of codes */
+}
+
+/*
+ * A faster version of decode() for real applications of this code.   It's not
+ * as readable, but it makes puff() twice as fast.  And it only makes the code
+ * a few percent larger.
+ */
+#else /* !SLOW */
+local int decode(struct state *s, struct huffman *h)
+{
+    int len;            /* current number of bits in code */
+    int code;           /* len bits being decoded */
+    int first;          /* first code of length len */
+    int count;          /* number of codes of length len */
+    int index;          /* index of first code of length len in symbol table */
+    int bitbuf;         /* bits from stream */
+    int left;           /* bits left in next or left to process */
+    short *next;        /* next number of codes */
+
+    bitbuf = s->bitbuf;
+    left = s->bitcnt;
+    code = first = index = 0;
+    len = 1;
+    next = h->count + 1;
+    while (1) {
+        while (left--) {
+            code |= bitbuf & 1;
+            bitbuf >>= 1;
+            count = *next++;
+            if (code < first + count) { /* if length len, return symbol */
+                s->bitbuf = bitbuf;
+                s->bitcnt = (s->bitcnt - len) & 7;
+                return h->symbol[index + (code - first)];
+            }
+            index += count;             /* else update for next length */
+            first += count;
+            first <<= 1;
+            code <<= 1;
+            len++;
+        }
+        left = (MAXBITS+1) - len;
+        if (left == 0) break;
+        if (s->incnt == s->inlen) longjmp(s->env, 1);   /* out of input */
+        bitbuf = s->in[s->incnt++];
+        if (left > 8) left = 8;
+    }
+    return -9;                          /* ran out of codes */
+}
+#endif /* SLOW */
+
+/*
+ * Given the list of code lengths length[0..n-1] representing a canonical
+ * Huffman code for n symbols, construct the tables required to decode those
+ * codes.  Those tables are the number of codes of each length, and the symbols
+ * sorted by length, retaining their original order within each length.  The
+ * return value is zero for a complete code set, negative for an over-
+ * subscribed code set, and positive for an incomplete code set.  The tables
+ * can be used if the return value is zero or positive, but they cannot be used
+ * if the return value is negative.  If the return value is zero, it is not
+ * possible for decode() using that table to return an error--any stream of
+ * enough bits will resolve to a symbol.  If the return value is positive, then
+ * it is possible for decode() using that table to return an error for received
+ * codes past the end of the incomplete lengths.
+ *
+ * Not used by decode(), but used for error checking, h->count[0] is the number
+ * of the n symbols not in the code.  So n - h->count[0] is the number of
+ * codes.  This is useful for checking for incomplete codes that have more than
+ * one symbol, which is an error in a dynamic block.
+ *
+ * Assumption: for all i in 0..n-1, 0 <= length[i] <= MAXBITS
+ * This is assured by the construction of the length arrays in dynamic() and
+ * fixed() and is not verified by construct().
+ *
+ * Format notes:
+ *
+ * - Permitted and expected examples of incomplete codes are one of the fixed
+ *   codes and any code with a single symbol which in deflate is coded as one
+ *   bit instead of zero bits.  See the format notes for fixed() and dynamic().
+ *
+ * - Within a given code length, the symbols are kept in ascending order for
+ *   the code bits definition.
+ */
+local int construct(struct huffman *h, short *length, int n)
+{
+    int symbol;         /* current symbol when stepping through length[] */
+    int len;            /* current length when stepping through h->count[] */
+    int left;           /* number of possible codes left of current length */
+    short offs[MAXBITS+1];      /* offsets in symbol table for each length */
+
+    /* count number of codes of each length */
+    for (len = 0; len <= MAXBITS; len++)
+        h->count[len] = 0;
+    for (symbol = 0; symbol < n; symbol++)
+        (h->count[length[symbol]])++;   /* assumes lengths are within bounds */
+    if (h->count[0] == n)               /* no codes! */
+        return 0;                       /* complete, but decode() will fail */
+
+    /* check for an over-subscribed or incomplete set of lengths */
+    left = 1;                           /* one possible code of zero length */
+    for (len = 1; len <= MAXBITS; len++) {
+        left <<= 1;                     /* one more bit, double codes left */
+        left -= h->count[len];          /* deduct count from possible codes */
+        if (left < 0) return left;      /* over-subscribed--return negative */
+    }                                   /* left > 0 means incomplete */
+
+    /* generate offsets into symbol table for each length for sorting */
+    offs[1] = 0;
+    for (len = 1; len < MAXBITS; len++)
+        offs[len + 1] = offs[len] + h->count[len];
+
+    /*
+     * put symbols in table sorted by length, by symbol order within each
+     * length
+     */
+    for (symbol = 0; symbol < n; symbol++)
+        if (length[symbol] != 0)
+            h->symbol[offs[length[symbol]]++] = symbol;
+
+    /* return zero for complete set, positive for incomplete set */
+    return left;
+}
+
+/*
+ * Decode literal/length and distance codes until an end-of-block code.
+ *
+ * Format notes:
+ *
+ * - Compressed data that is after the block type if fixed or after the code
+ *   description if dynamic is a combination of literals and length/distance
+ *   pairs terminated by and end-of-block code.  Literals are simply Huffman
+ *   coded bytes.  A length/distance pair is a coded length followed by a
+ *   coded distance to represent a string that occurs earlier in the
+ *   uncompressed data that occurs again at the current location.
+ *
+ * - Literals, lengths, and the end-of-block code are combined into a single
+ *   code of up to 286 symbols.  They are 256 literals (0..255), 29 length
+ *   symbols (257..285), and the end-of-block symbol (256).
+ *
+ * - There are 256 possible lengths (3..258), and so 29 symbols are not enough
+ *   to represent all of those.  Lengths 3..10 and 258 are in fact represented
+ *   by just a length symbol.  Lengths 11..257 are represented as a symbol and
+ *   some number of extra bits that are added as an integer to the base length
+ *   of the length symbol.  The number of extra bits is determined by the base
+ *   length symbol.  These are in the static arrays below, lens[] for the base
+ *   lengths and lext[] for the corresponding number of extra bits.
+ *
+ * - The reason that 258 gets its own symbol is that the longest length is used
+ *   often in highly redundant files.  Note that 258 can also be coded as the
+ *   base value 227 plus the maximum extra value of 31.  While a good deflate
+ *   should never do this, it is not an error, and should be decoded properly.
+ *
+ * - If a length is decoded, including its extra bits if any, then it is
+ *   followed a distance code.  There are up to 30 distance symbols.  Again
+ *   there are many more possible distances (1..32768), so extra bits are added
+ *   to a base value represented by the symbol.  The distances 1..4 get their
+ *   own symbol, but the rest require extra bits.  The base distances and
+ *   corresponding number of extra bits are below in the static arrays dist[]
+ *   and dext[].
+ *
+ * - Literal bytes are simply written to the output.  A length/distance pair is
+ *   an instruction to copy previously uncompressed bytes to the output.  The
+ *   copy is from distance bytes back in the output stream, copying for length
+ *   bytes.
+ *
+ * - Distances pointing before the beginning of the output data are not
+ *   permitted.
+ *
+ * - Overlapped copies, where the length is greater than the distance, are
+ *   allowed and common.  For example, a distance of one and a length of 258
+ *   simply copies the last byte 258 times.  A distance of four and a length of
+ *   twelve copies the last four bytes three times.  A simple forward copy
+ *   ignoring whether the length is greater than the distance or not implements
+ *   this correctly.  You should not use memcpy() since its behavior is not
+ *   defined for overlapped arrays.  You should not use memmove() or bcopy()
+ *   since though their behavior -is- defined for overlapping arrays, it is
+ *   defined to do the wrong thing in this case.
+ */
+local int codes(struct state *s,
+                struct huffman *lencode,
+                struct huffman *distcode)
+{
+    int symbol;         /* decoded symbol */
+    int len;            /* length for copy */
+    unsigned dist;      /* distance for copy */
+    static const short lens[29] = { /* Size base for length codes 257..285 */
+        3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
+        35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258};
+    static const short lext[29] = { /* Extra bits for length codes 257..285 */
+        0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2,
+        3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0};
+    static const short dists[30] = { /* Offset base for distance codes 0..29 */
+        1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
+        257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
+        8193, 12289, 16385, 24577};
+    static const short dext[30] = { /* Extra bits for distance codes 0..29 */
+        0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6,
+        7, 7, 8, 8, 9, 9, 10, 10, 11, 11,
+        12, 12, 13, 13};
+
+    /* decode literals and length/distance pairs */
+    do {
+        symbol = decode(s, lencode);
+        if (symbol < 0) return symbol;  /* invalid symbol */
+        if (symbol < 256) {             /* literal: symbol is the byte */
+            /* write out the literal */
+            if (s->out != NIL) {
+                if (s->outcnt == s->outlen) return 1;
+                s->out[s->outcnt] = symbol;
+            }
+            s->outcnt++;
+        }
+        else if (symbol > 256) {        /* length */
+            /* get and compute length */
+            symbol -= 257;
+            if (symbol >= 29) return -9;        /* invalid fixed code */
+            len = lens[symbol] + bits(s, lext[symbol]);
+
+            /* get and check distance */
+            symbol = decode(s, distcode);
+            if (symbol < 0) return symbol;      /* invalid symbol */
+            dist = dists[symbol] + bits(s, dext[symbol]);
+            if (dist > s->outcnt)
+                return -10;     /* distance too far back */
+
+            /* copy length bytes from distance bytes back */
+            if (s->out != NIL) {
+                if (s->outcnt + len > s->outlen) return 1;
+                while (len--) {
+                    s->out[s->outcnt] = s->out[s->outcnt - dist];
+                    s->outcnt++;
+                }
+            }
+            else
+                s->outcnt += len;
+        }
+    } while (symbol != 256);            /* end of block symbol */
+
+    /* done with a valid fixed or dynamic block */
+    return 0;
+}
+
+/*
+ * Process a fixed codes block.
+ *
+ * Format notes:
+ *
+ * - This block type can be useful for compressing small amounts of data for
+ *   which the size of the code descriptions in a dynamic block exceeds the
+ *   benefit of custom codes for that block.  For fixed codes, no bits are
+ *   spent on code descriptions.  Instead the code lengths for literal/length
+ *   codes and distance codes are fixed.  The specific lengths for each symbol
+ *   can be seen in the "for" loops below.
+ *
+ * - The literal/length code is complete, but has two symbols that are invalid
+ *   and should result in an error if received.  This cannot be implemented
+ *   simply as an incomplete code since those two symbols are in the "middle"
+ *   of the code.  They are eight bits long and the longest literal/length\
+ *   code is nine bits.  Therefore the code must be constructed with those
+ *   symbols, and the invalid symbols must be detected after decoding.
+ *
+ * - The fixed distance codes also have two invalid symbols that should result
+ *   in an error if received.  Since all of the distance codes are the same
+ *   length, this can be implemented as an incomplete code.  Then the invalid
+ *   codes are detected while decoding.
+ */
+local int fixed(struct state *s)
+{
+    static int virgin = 1;
+    static short lencnt[MAXBITS+1], lensym[FIXLCODES];
+    static short distcnt[MAXBITS+1], distsym[MAXDCODES];
+    static struct huffman lencode = {lencnt, lensym};
+    static struct huffman distcode = {distcnt, distsym};
+
+    /* build fixed huffman tables if first call (may not be thread safe) */
+    if (virgin) {
+        int symbol;
+        short lengths[FIXLCODES];
+
+        /* literal/length table */
+        for (symbol = 0; symbol < 144; symbol++)
+            lengths[symbol] = 8;
+        for (; symbol < 256; symbol++)
+            lengths[symbol] = 9;
+        for (; symbol < 280; symbol++)
+            lengths[symbol] = 7;
+        for (; symbol < FIXLCODES; symbol++)
+            lengths[symbol] = 8;
+        construct(&lencode, lengths, FIXLCODES);
+
+        /* distance table */
+        for (symbol = 0; symbol < MAXDCODES; symbol++)
+            lengths[symbol] = 5;
+        construct(&distcode, lengths, MAXDCODES);
+
+        /* do this just once */
+        virgin = 0;
+    }
+
+    /* decode data until end-of-block code */
+    return codes(s, &lencode, &distcode);
+}
+
+/*
+ * Process a dynamic codes block.
+ *
+ * Format notes:
+ *
+ * - A dynamic block starts with a description of the literal/length and
+ *   distance codes for that block.  New dynamic blocks allow the compressor to
+ *   rapidly adapt to changing data with new codes optimized for that data.
+ *
+ * - The codes used by the deflate format are "canonical", which means that
+ *   the actual bits of the codes are generated in an unambiguous way simply
+ *   from the number of bits in each code.  Therefore the code descriptions
+ *   are simply a list of code lengths for each symbol.
+ *
+ * - The code lengths are stored in order for the symbols, so lengths are
+ *   provided for each of the literal/length symbols, and for each of the
+ *   distance symbols.
+ *
+ * - If a symbol is not used in the block, this is represented by a zero as
+ *   as the code length.  This does not mean a zero-length code, but rather
+ *   that no code should be created for this symbol.  There is no way in the
+ *   deflate format to represent a zero-length code.
+ *
+ * - The maximum number of bits in a code is 15, so the possible lengths for
+ *   any code are 1..15.
+ *
+ * - The fact that a length of zero is not permitted for a code has an
+ *   interesting consequence.  Normally if only one symbol is used for a given
+ *   code, then in fact that code could be represented with zero bits.  However
+ *   in deflate, that code has to be at least one bit.  So for example, if
+ *   only a single distance base symbol appears in a block, then it will be
+ *   represented by a single code of length one, in particular one 0 bit.  This
+ *   is an incomplete code, since if a 1 bit is received, it has no meaning,
+ *   and should result in an error.  So incomplete distance codes of one symbol
+ *   should be permitted, and the receipt of invalid codes should be handled.
+ *
+ * - It is also possible to have a single literal/length code, but that code
+ *   must be the end-of-block code, since every dynamic block has one.  This
+ *   is not the most efficient way to create an empty block (an empty fixed
+ *   block is fewer bits), but it is allowed by the format.  So incomplete
+ *   literal/length codes of one symbol should also be permitted.
+ *
+ * - If there are only literal codes and no lengths, then there are no distance
+ *   codes.  This is represented by one distance code with zero bits.
+ *
+ * - The list of up to 286 length/literal lengths and up to 30 distance lengths
+ *   are themselves compressed using Huffman codes and run-length encoding.  In
+ *   the list of code lengths, a 0 symbol means no code, a 1..15 symbol means
+ *   that length, and the symbols 16, 17, and 18 are run-length instructions.
+ *   Each of 16, 17, and 18 are follwed by extra bits to define the length of
+ *   the run.  16 copies the last length 3 to 6 times.  17 represents 3 to 10
+ *   zero lengths, and 18 represents 11 to 138 zero lengths.  Unused symbols
+ *   are common, hence the special coding for zero lengths.
+ *
+ * - The symbols for 0..18 are Huffman coded, and so that code must be
+ *   described first.  This is simply a sequence of up to 19 three-bit values
+ *   representing no code (0) or the code length for that symbol (1..7).
+ *
+ * - A dynamic block starts with three fixed-size counts from which is computed
+ *   the number of literal/length code lengths, the number of distance code
+ *   lengths, and the number of code length code lengths (ok, you come up with
+ *   a better name!) in the code descriptions.  For the literal/length and
+ *   distance codes, lengths after those provided are considered zero, i.e. no
+ *   code.  The code length code lengths are received in a permuted order (see
+ *   the order[] array below) to make a short code length code length list more
+ *   likely.  As it turns out, very short and very long codes are less likely
+ *   to be seen in a dynamic code description, hence what may appear initially
+ *   to be a peculiar ordering.
+ *
+ * - Given the number of literal/length code lengths (nlen) and distance code
+ *   lengths (ndist), then they are treated as one long list of nlen + ndist
+ *   code lengths.  Therefore run-length coding can and often does cross the
+ *   boundary between the two sets of lengths.
+ *
+ * - So to summarize, the code description at the start of a dynamic block is
+ *   three counts for the number of code lengths for the literal/length codes,
+ *   the distance codes, and the code length codes.  This is followed by the
+ *   code length code lengths, three bits each.  This is used to construct the
+ *   code length code which is used to read the remainder of the lengths.  Then
+ *   the literal/length code lengths and distance lengths are read as a single
+ *   set of lengths using the code length codes.  Codes are constructed from
+ *   the resulting two sets of lengths, and then finally you can start
+ *   decoding actual compressed data in the block.
+ *
+ * - For reference, a "typical" size for the code description in a dynamic
+ *   block is around 80 bytes.
+ */
+local int dynamic(struct state *s)
+{
+    int nlen, ndist, ncode;             /* number of lengths in descriptor */
+    int index;                          /* index of lengths[] */
+    int err;                            /* construct() return value */
+    short lengths[MAXCODES];            /* descriptor code lengths */
+    short lencnt[MAXBITS+1], lensym[MAXLCODES];         /* lencode memory */
+    short distcnt[MAXBITS+1], distsym[MAXDCODES];       /* distcode memory */
+    struct huffman lencode = {lencnt, lensym};          /* length code */
+    struct huffman distcode = {distcnt, distsym};       /* distance code */
+    static const short order[19] =      /* permutation of code length codes */
+        {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
+
+    /* get number of lengths in each table, check lengths */
+    nlen = bits(s, 5) + 257;
+    ndist = bits(s, 5) + 1;
+    ncode = bits(s, 4) + 4;
+    if (nlen > MAXLCODES || ndist > MAXDCODES)
+        return -3;                      /* bad counts */
+
+    /* read code length code lengths (really), missing lengths are zero */
+    for (index = 0; index < ncode; index++)
+        lengths[order[index]] = bits(s, 3);
+    for (; index < 19; index++)
+        lengths[order[index]] = 0;
+
+    /* build huffman table for code lengths codes (use lencode temporarily) */
+    err = construct(&lencode, lengths, 19);
+    if (err != 0) return -4;            /* require complete code set here */
+
+    /* read length/literal and distance code length tables */
+    index = 0;
+    while (index < nlen + ndist) {
+        int symbol;             /* decoded value */
+        int len;                /* last length to repeat */
+
+        symbol = decode(s, &lencode);
+        if (symbol < 16)                /* length in 0..15 */
+            lengths[index++] = symbol;
+        else {                          /* repeat instruction */
+            len = 0;                    /* assume repeating zeros */
+            if (symbol == 16) {         /* repeat last length 3..6 times */
+                if (index == 0) return -5;      /* no last length! */
+                len = lengths[index - 1];       /* last length */
+                symbol = 3 + bits(s, 2);
+            }
+            else if (symbol == 17)      /* repeat zero 3..10 times */
+                symbol = 3 + bits(s, 3);
+            else                        /* == 18, repeat zero 11..138 times */
+                symbol = 11 + bits(s, 7);
+            if (index + symbol > nlen + ndist)
+                return -6;              /* too many lengths! */
+            while (symbol--)            /* repeat last or zero symbol times */
+                lengths[index++] = len;
+        }
+    }
+
+    /* build huffman table for literal/length codes */
+    err = construct(&lencode, lengths, nlen);
+    if (err < 0 || (err > 0 && nlen - lencode.count[0] != 1))
+        return -7;      /* only allow incomplete codes if just one code */
+
+    /* build huffman table for distance codes */
+    err = construct(&distcode, lengths + nlen, ndist);
+    if (err < 0 || (err > 0 && ndist - distcode.count[0] != 1))
+        return -8;      /* only allow incomplete codes if just one code */
+
+    /* decode data until end-of-block code */
+    return codes(s, &lencode, &distcode);
+}
+
+/*
+ * Inflate source to dest.  On return, destlen and sourcelen are updated to the
+ * size of the uncompressed data and the size of the deflate data respectively.
+ * On success, the return value of puff() is zero.  If there is an error in the
+ * source data, i.e. it is not in the deflate format, then a negative value is
+ * returned.  If there is not enough input available or there is not enough
+ * output space, then a positive error is returned.  In that case, destlen and
+ * sourcelen are not updated to facilitate retrying from the beginning with the
+ * provision of more input data or more output space.  In the case of invalid
+ * inflate data (a negative error), the dest and source pointers are updated to
+ * facilitate the debugging of deflators.
+ *
+ * puff() also has a mode to determine the size of the uncompressed output with
+ * no output written.  For this dest must be (unsigned char *)0.  In this case,
+ * the input value of *destlen is ignored, and on return *destlen is set to the
+ * size of the uncompressed output.
+ *
+ * The return codes are:
+ *
+ *   2:  available inflate data did not terminate
+ *   1:  output space exhausted before completing inflate
+ *   0:  successful inflate
+ *  -1:  invalid block type (type == 3)
+ *  -2:  stored block length did not match one's complement
+ *  -3:  dynamic block code description: too many length or distance codes
+ *  -4:  dynamic block code description: code lengths codes incomplete
+ *  -5:  dynamic block code description: repeat lengths with no first length
+ *  -6:  dynamic block code description: repeat more than specified lengths
+ *  -7:  dynamic block code description: invalid literal/length code lengths
+ *  -8:  dynamic block code description: invalid distance code lengths
+ *  -9:  invalid literal/length or distance code in fixed or dynamic block
+ * -10:  distance is too far back in fixed or dynamic block
+ *
+ * Format notes:
+ *
+ * - Three bits are read for each block to determine the kind of block and
+ *   whether or not it is the last block.  Then the block is decoded and the
+ *   process repeated if it was not the last block.
+ *
+ * - The leftover bits in the last byte of the deflate data after the last
+ *   block (if it was a fixed or dynamic block) are undefined and have no
+ *   expected values to check.
+ */
+int puff(unsigned char *dest,           /* pointer to destination pointer */
+         unsigned long *destlen,        /* amount of output space */
+         unsigned char *source,         /* pointer to source data pointer */
+         unsigned long *sourcelen)      /* amount of input available */
+{
+    struct state s;             /* input/output state */
+    int last, type;             /* block information */
+    int err;                    /* return value */
+
+    /* initialize output state */
+    s.out = dest;
+    s.outlen = *destlen;                /* ignored if dest is NIL */
+    s.outcnt = 0;
+
+    /* initialize input state */
+    s.in = source;
+    s.inlen = *sourcelen;
+    s.incnt = 0;
+    s.bitbuf = 0;
+    s.bitcnt = 0;
+
+    /* return if bits() or decode() tries to read past available input */
+    if (setjmp(s.env) != 0)             /* if came back here via longjmp() */
+        err = 2;                        /* then skip do-loop, return error */
+    else {
+        /* process blocks until last block or error */
+        do {
+            last = bits(&s, 1);         /* one if last block */
+            type = bits(&s, 2);         /* block type 0..3 */
+            err = type == 0 ? stored(&s) :
+                  (type == 1 ? fixed(&s) :
+                   (type == 2 ? dynamic(&s) :
+                    -1));               /* type == 3, invalid */
+            if (err != 0) break;        /* return with error */
+        } while (!last);
+    }
+
+    /* update the lengths and return */
+    if (err <= 0) {
+        *destlen = s.outcnt;
+        *sourcelen = s.incnt;
+    }
+    return err;
+}
+
+#ifdef TEST
+/* Example of how to use puff() */
+#include <stdio.h>
+#include <stdlib.h>
+#include <sys/types.h>
+#include <sys/stat.h>
+
+local unsigned char *yank(char *name, unsigned long *len)
+{
+    unsigned long size;
+    unsigned char *buf;
+    FILE *in;
+    struct stat s;
+
+    *len = 0;
+    if (stat(name, &s)) return NULL;
+    if ((s.st_mode & S_IFMT) != S_IFREG) return NULL;
+    size = (unsigned long)(s.st_size);
+    if (size == 0 || (off_t)size != s.st_size) return NULL;
+    in = fopen(name, "r");
+    if (in == NULL) return NULL;
+    buf = malloc(size);
+    if (buf != NULL && fread(buf, 1, size, in) != size) {
+        free(buf);
+        buf = NULL;
+    }
+    fclose(in);
+    *len = size;
+    return buf;
+}
+
+int main(int argc, char **argv)
+{
+    int ret;
+    unsigned char *source;
+    unsigned long len, sourcelen, destlen;
+
+    if (argc < 2) return 2;
+    source = yank(argv[1], &len);
+    if (source == NULL) return 2;
+    sourcelen = len;
+    ret = puff(NIL, &destlen, source, &sourcelen);
+    if (ret)
+        printf("puff() failed with return code %d\n", ret);
+    else {
+        printf("puff() succeeded uncompressing %lu bytes\n", destlen);
+        if (sourcelen < len) printf("%lu compressed bytes unused\n",
+                                    len - sourcelen);
+    }
+    free(source);
+    return ret;
+}
+#endif
diff --git a/updater/zlib123/contrib/puff/puff.h b/updater/zlib123/contrib/puff/puff.h
new file mode 100644
index 0000000..4d5bdc7
--- /dev/null
+++ b/updater/zlib123/contrib/puff/puff.h
@@ -0,0 +1,31 @@
+/* puff.h
+  Copyright (C) 2002, 2003 Mark Adler, all rights reserved
+  version 1.7, 3 Mar 2002
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the author be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Mark Adler    madler@alumni.caltech.edu
+ */
+
+
+/*
+ * See puff.c for purpose and usage.
+ */
+int puff(unsigned char *dest,           /* pointer to destination pointer */
+         unsigned long *destlen,        /* amount of output space */
+         unsigned char *source,         /* pointer to source data pointer */
+         unsigned long *sourcelen);     /* amount of input available */
diff --git a/updater/zlib123/contrib/puff/zeros.raw b/updater/zlib123/contrib/puff/zeros.raw
new file mode 100644
index 0000000..637b7be
--- /dev/null
+++ b/updater/zlib123/contrib/puff/zeros.raw
diff --git a/updater/zlib123/contrib/testzlib/testzlib.c b/updater/zlib123/contrib/testzlib/testzlib.c
new file mode 100644
index 0000000..e5574f4
--- /dev/null
+++ b/updater/zlib123/contrib/testzlib/testzlib.c
@@ -0,0 +1,275 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <windows.h>
+
+#include "zlib.h"
+
+
+void MyDoMinus64(LARGE_INTEGER *R,LARGE_INTEGER A,LARGE_INTEGER B)
+{
+    R->HighPart = A.HighPart - B.HighPart;
+    if (A.LowPart >= B.LowPart)
+        R->LowPart = A.LowPart - B.LowPart;
+    else
+    {
+        R->LowPart = A.LowPart - B.LowPart;
+        R->HighPart --;
+    }
+}
+
+#ifdef _M_X64
+// see http://msdn2.microsoft.com/library/twchhe95(en-us,vs.80).aspx for __rdtsc
+unsigned __int64 __rdtsc(void);
+void BeginCountRdtsc(LARGE_INTEGER * pbeginTime64)
+{
+ //   printf("rdtsc = %I64x\n",__rdtsc());
+   pbeginTime64->QuadPart=__rdtsc();
+}
+
+LARGE_INTEGER GetResRdtsc(LARGE_INTEGER beginTime64,BOOL fComputeTimeQueryPerf)
+{
+    LARGE_INTEGER LIres;
+    unsigned _int64 res=__rdtsc()-((unsigned _int64)(beginTime64.QuadPart));
+    LIres.QuadPart=res;
+   // printf("rdtsc = %I64x\n",__rdtsc());
+    return LIres;
+}
+#else
+#ifdef _M_IX86
+void myGetRDTSC32(LARGE_INTEGER * pbeginTime64)
+{
+    DWORD dwEdx,dwEax;
+    _asm
+    {
+        rdtsc
+        mov dwEax,eax
+        mov dwEdx,edx
+    }
+    pbeginTime64->LowPart=dwEax;
+    pbeginTime64->HighPart=dwEdx;
+}
+
+void BeginCountRdtsc(LARGE_INTEGER * pbeginTime64)
+{
+    myGetRDTSC32(pbeginTime64);
+}
+
+LARGE_INTEGER GetResRdtsc(LARGE_INTEGER beginTime64,BOOL fComputeTimeQueryPerf)
+{
+    LARGE_INTEGER LIres,endTime64;
+    myGetRDTSC32(&endTime64);
+
+    LIres.LowPart=LIres.HighPart=0;
+    MyDoMinus64(&LIres,endTime64,beginTime64);
+    return LIres;
+}
+#else
+void myGetRDTSC32(LARGE_INTEGER * pbeginTime64)
+{
+}
+
+void BeginCountRdtsc(LARGE_INTEGER * pbeginTime64)
+{
+}
+
+LARGE_INTEGER GetResRdtsc(LARGE_INTEGER beginTime64,BOOL fComputeTimeQueryPerf)
+{
+    LARGE_INTEGER lr;
+    lr.QuadPart=0;
+    return lr;
+}
+#endif
+#endif
+
+void BeginCountPerfCounter(LARGE_INTEGER * pbeginTime64,BOOL fComputeTimeQueryPerf)
+{
+    if ((!fComputeTimeQueryPerf) || (!QueryPerformanceCounter(pbeginTime64)))
+    {
+        pbeginTime64->LowPart = GetTickCount();
+        pbeginTime64->HighPart = 0;
+    }
+}
+
+DWORD GetMsecSincePerfCounter(LARGE_INTEGER beginTime64,BOOL fComputeTimeQueryPerf)
+{
+    LARGE_INTEGER endTime64,ticksPerSecond,ticks;
+    DWORDLONG ticksShifted,tickSecShifted;
+    DWORD dwLog=16+0;
+    DWORD dwRet;
+    if ((!fComputeTimeQueryPerf) || (!QueryPerformanceCounter(&endTime64)))
+        dwRet = (GetTickCount() - beginTime64.LowPart)*1;
+    else
+    {
+        MyDoMinus64(&ticks,endTime64,beginTime64);
+        QueryPerformanceFrequency(&ticksPerSecond);
+
+    
+        {
+            ticksShifted = Int64ShrlMod32(*(DWORDLONG*)&ticks,dwLog);
+            tickSecShifted = Int64ShrlMod32(*(DWORDLONG*)&ticksPerSecond,dwLog);
+        
+        } 
+
+        dwRet = (DWORD)((((DWORD)ticksShifted)*1000)/(DWORD)(tickSecShifted));
+        dwRet *=1;
+    }
+    return dwRet;
+}
+
+int ReadFileMemory(const char* filename,long* plFileSize,void** pFilePtr)
+{
+    FILE* stream;
+    void* ptr;
+    int retVal=1;
+    stream=fopen(filename, "rb");
+    if (stream==NULL)
+        return 0;
+
+    fseek(stream,0,SEEK_END);
+
+    *plFileSize=ftell(stream);
+    fseek(stream,0,SEEK_SET);
+    ptr=malloc((*plFileSize)+1);
+    if (ptr==NULL)
+        retVal=0;
+    else
+    {
+        if (fread(ptr, 1, *plFileSize,stream) != (*plFileSize))
+            retVal=0;
+    }
+    fclose(stream);
+    *pFilePtr=ptr;
+    return retVal;
+}
+
+int main(int argc, char *argv[])
+{
+    int BlockSizeCompress=0x8000;
+    int BlockSizeUncompress=0x8000;
+    int cprLevel=Z_DEFAULT_COMPRESSION ;
+    long lFileSize;
+    unsigned char* FilePtr;
+    long lBufferSizeCpr;
+    long lBufferSizeUncpr;
+    long lCompressedSize=0;
+    unsigned char* CprPtr;
+    unsigned char* UncprPtr;
+    long lSizeCpr,lSizeUncpr;
+    DWORD dwGetTick,dwMsecQP;
+    LARGE_INTEGER li_qp,li_rdtsc,dwResRdtsc;
+
+    if (argc<=1)
+    {
+        printf("run TestZlib <File> [BlockSizeCompress] [BlockSizeUncompress] [compres. level]\n");
+        return 0;
+    }
+
+    if (ReadFileMemory(argv[1],&lFileSize,&FilePtr)==0)
+    {
+        printf("error reading %s\n",argv[1]);
+        return 1;
+    }
+    else printf("file %s read, %u bytes\n",argv[1],lFileSize);
+
+    if (argc>=3)
+        BlockSizeCompress=atol(argv[2]);
+
+    if (argc>=4)
+        BlockSizeUncompress=atol(argv[3]);
+
+    if (argc>=5)
+        cprLevel=(int)atol(argv[4]);
+
+    lBufferSizeCpr = lFileSize + (lFileSize/0x10) + 0x200;
+    lBufferSizeUncpr = lBufferSizeCpr;
+
+    CprPtr=(unsigned char*)malloc(lBufferSizeCpr + BlockSizeCompress);
+
+    BeginCountPerfCounter(&li_qp,TRUE);
+    dwGetTick=GetTickCount();
+    BeginCountRdtsc(&li_rdtsc);
+    {
+        z_stream zcpr;
+        int ret=Z_OK;
+        long lOrigToDo = lFileSize;
+        long lOrigDone = 0;
+        int step=0;
+        memset(&zcpr,0,sizeof(z_stream));
+        deflateInit(&zcpr,cprLevel);
+
+        zcpr.next_in = FilePtr;
+        zcpr.next_out = CprPtr;
+
+
+        do
+        {
+            long all_read_before = zcpr.total_in;
+            zcpr.avail_in = min(lOrigToDo,BlockSizeCompress);
+            zcpr.avail_out = BlockSizeCompress;
+            ret=deflate(&zcpr,(zcpr.avail_in==lOrigToDo) ? Z_FINISH : Z_SYNC_FLUSH);
+            lOrigDone += (zcpr.total_in-all_read_before);
+            lOrigToDo -= (zcpr.total_in-all_read_before);
+            step++;
+        } while (ret==Z_OK);
+
+        lSizeCpr=zcpr.total_out;
+        deflateEnd(&zcpr);
+        dwGetTick=GetTickCount()-dwGetTick;
+        dwMsecQP=GetMsecSincePerfCounter(li_qp,TRUE);
+        dwResRdtsc=GetResRdtsc(li_rdtsc,TRUE);
+        printf("total compress size = %u, in %u step\n",lSizeCpr,step);
+        printf("time = %u msec = %f sec\n",dwGetTick,dwGetTick/(double)1000.);
+        printf("defcpr time QP = %u msec = %f sec\n",dwMsecQP,dwMsecQP/(double)1000.);
+        printf("defcpr result rdtsc = %I64x\n\n",dwResRdtsc.QuadPart);
+    }
+
+    CprPtr=(unsigned char*)realloc(CprPtr,lSizeCpr);
+    UncprPtr=(unsigned char*)malloc(lBufferSizeUncpr + BlockSizeUncompress);
+
+    BeginCountPerfCounter(&li_qp,TRUE);
+    dwGetTick=GetTickCount();
+    BeginCountRdtsc(&li_rdtsc);
+    {
+        z_stream zcpr;
+        int ret=Z_OK;
+        long lOrigToDo = lSizeCpr;
+        long lOrigDone = 0;
+        int step=0;
+        memset(&zcpr,0,sizeof(z_stream));
+        inflateInit(&zcpr);
+
+        zcpr.next_in = CprPtr;
+        zcpr.next_out = UncprPtr;
+
+
+        do
+        {
+            long all_read_before = zcpr.total_in;
+            zcpr.avail_in = min(lOrigToDo,BlockSizeUncompress);
+            zcpr.avail_out = BlockSizeUncompress;
+            ret=inflate(&zcpr,Z_SYNC_FLUSH);
+            lOrigDone += (zcpr.total_in-all_read_before);
+            lOrigToDo -= (zcpr.total_in-all_read_before);
+            step++;
+        } while (ret==Z_OK);
+
+        lSizeUncpr=zcpr.total_out;
+        inflateEnd(&zcpr);
+        dwGetTick=GetTickCount()-dwGetTick;
+        dwMsecQP=GetMsecSincePerfCounter(li_qp,TRUE);
+        dwResRdtsc=GetResRdtsc(li_rdtsc,TRUE);
+        printf("total uncompress size = %u, in %u step\n",lSizeUncpr,step);
+        printf("time = %u msec = %f sec\n",dwGetTick,dwGetTick/(double)1000.);
+        printf("uncpr  time QP = %u msec = %f sec\n",dwMsecQP,dwMsecQP/(double)1000.);
+        printf("uncpr  result rdtsc = %I64x\n\n",dwResRdtsc.QuadPart);
+    }
+
+    if (lSizeUncpr==lFileSize)
+    {
+        if (memcmp(FilePtr,UncprPtr,lFileSize)==0)
+            printf("compare ok\n");
+
+    }
+
+    return 0;
+}
diff --git a/updater/zlib123/contrib/testzlib/testzlib.txt b/updater/zlib123/contrib/testzlib/testzlib.txt
new file mode 100644
index 0000000..62258f1
--- /dev/null
+++ b/updater/zlib123/contrib/testzlib/testzlib.txt
@@ -0,0 +1,10 @@
+To build testzLib with Visual Studio 2005:
+
+copy to a directory file from :
+- root of zLib tree
+- contrib/testzlib
+- contrib/masmx86
+- contrib/masmx64
+- contrib/vstudio/vc7
+
+and open testzlib8.sln
+\ No newline at end of file
diff --git a/updater/zlib123/contrib/untgz/Makefile b/updater/zlib123/contrib/untgz/Makefile
new file mode 100644
index 0000000..8fd12a0
--- /dev/null
+++ b/updater/zlib123/contrib/untgz/Makefile
@@ -0,0 +1,14 @@
+CC=cc
+CFLAGS=-g
+
+untgz: untgz.o ../../libz.a
+	$(CC) $(CFLAGS) -o untgz untgz.o -L../.. -lz
+
+untgz.o: untgz.c ../../zlib.h
+	$(CC) $(CFLAGS) -c -I../.. untgz.c
+
+../../libz.a:
+	cd ../..; ./configure; make
+
+clean:
+	rm -f untgz untgz.o *~
diff --git a/updater/zlib123/contrib/untgz/Makefile.msc b/updater/zlib123/contrib/untgz/Makefile.msc
new file mode 100644
index 0000000..786779a
--- /dev/null
+++ b/updater/zlib123/contrib/untgz/Makefile.msc
@@ -0,0 +1,17 @@
+CC=cl
+CFLAGS=-MD
+
+untgz.exe: untgz.obj ..\..\zlib.lib
+	$(CC) $(CFLAGS) untgz.obj ..\..\zlib.lib
+
+untgz.obj: untgz.c ..\..\zlib.h
+	$(CC) $(CFLAGS) -c -I..\.. untgz.c
+
+..\..\zlib.lib:
+	cd ..\..
+	$(MAKE) -f win32\makefile.msc
+	cd contrib\untgz
+
+clean:
+	-del untgz.obj
+	-del untgz.exe
diff --git a/updater/zlib123/contrib/untgz/untgz.c b/updater/zlib123/contrib/untgz/untgz.c
new file mode 100644
index 0000000..bd56033
--- /dev/null
+++ b/updater/zlib123/contrib/untgz/untgz.c
@@ -0,0 +1,674 @@
+/*
+ * untgz.c -- Display contents and extract files from a gzip'd TAR file
+ *
+ * written by Pedro A. Aranda Gutierrez <paag@tid.es>
+ * adaptation to Unix by Jean-loup Gailly <jloup@gzip.org>
+ * various fixes by Cosmin Truta <cosmint@cs.ubbcluj.ro>
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include <errno.h>
+
+#include "zlib.h"
+
+#ifdef unix
+#  include <unistd.h>
+#else
+#  include <direct.h>
+#  include <io.h>
+#endif
+
+#ifdef WIN32
+#include <windows.h>
+#  ifndef F_OK
+#    define F_OK  0
+#  endif
+#  define mkdir(dirname,mode)   _mkdir(dirname)
+#  ifdef _MSC_VER
+#    define access(path,mode)   _access(path,mode)
+#    define chmod(path,mode)    _chmod(path,mode)
+#    define strdup(str)         _strdup(str)
+#  endif
+#else
+#  include <utime.h>
+#endif
+
+
+/* values used in typeflag field */
+
+#define REGTYPE  '0'            /* regular file */
+#define AREGTYPE '\0'           /* regular file */
+#define LNKTYPE  '1'            /* link */
+#define SYMTYPE  '2'            /* reserved */
+#define CHRTYPE  '3'            /* character special */
+#define BLKTYPE  '4'            /* block special */
+#define DIRTYPE  '5'            /* directory */
+#define FIFOTYPE '6'            /* FIFO special */
+#define CONTTYPE '7'            /* reserved */
+
+/* GNU tar extensions */
+
+#define GNUTYPE_DUMPDIR  'D'    /* file names from dumped directory */
+#define GNUTYPE_LONGLINK 'K'    /* long link name */
+#define GNUTYPE_LONGNAME 'L'    /* long file name */
+#define GNUTYPE_MULTIVOL 'M'    /* continuation of file from another volume */
+#define GNUTYPE_NAMES    'N'    /* file name that does not fit into main hdr */
+#define GNUTYPE_SPARSE   'S'    /* sparse file */
+#define GNUTYPE_VOLHDR   'V'    /* tape/volume header */
+
+
+/* tar header */
+
+#define BLOCKSIZE     512
+#define SHORTNAMESIZE 100
+
+struct tar_header
+{                               /* byte offset */
+  char name[100];               /*   0 */
+  char mode[8];                 /* 100 */
+  char uid[8];                  /* 108 */
+  char gid[8];                  /* 116 */
+  char size[12];                /* 124 */
+  char mtime[12];               /* 136 */
+  char chksum[8];               /* 148 */
+  char typeflag;                /* 156 */
+  char linkname[100];           /* 157 */
+  char magic[6];                /* 257 */
+  char version[2];              /* 263 */
+  char uname[32];               /* 265 */
+  char gname[32];               /* 297 */
+  char devmajor[8];             /* 329 */
+  char devminor[8];             /* 337 */
+  char prefix[155];             /* 345 */
+                                /* 500 */
+};
+
+union tar_buffer
+{
+  char               buffer[BLOCKSIZE];
+  struct tar_header  header;
+};
+
+struct attr_item
+{
+  struct attr_item  *next;
+  char              *fname;
+  int                mode;
+  time_t             time;
+};
+
+enum { TGZ_EXTRACT, TGZ_LIST, TGZ_INVALID };
+
+char *TGZfname          OF((const char *));
+void TGZnotfound        OF((const char *));
+
+int getoct              OF((char *, int));
+char *strtime           OF((time_t *));
+int setfiletime         OF((char *, time_t));
+void push_attr          OF((struct attr_item **, char *, int, time_t));
+void restore_attr       OF((struct attr_item **));
+
+int ExprMatch           OF((char *, char *));
+
+int makedir             OF((char *));
+int matchname           OF((int, int, char **, char *));
+
+void error              OF((const char *));
+int tar                 OF((gzFile, int, int, int, char **));
+
+void help               OF((int));
+int main                OF((int, char **));
+
+char *prog;
+
+const char *TGZsuffix[] = { "\0", ".tar", ".tar.gz", ".taz", ".tgz", NULL };
+
+/* return the file name of the TGZ archive */
+/* or NULL if it does not exist */
+
+char *TGZfname (const char *arcname)
+{
+  static char buffer[1024];
+  int origlen,i;
+
+  strcpy(buffer,arcname);
+  origlen = strlen(buffer);
+
+  for (i=0; TGZsuffix[i]; i++)
+    {
+       strcpy(buffer+origlen,TGZsuffix[i]);
+       if (access(buffer,F_OK) == 0)
+         return buffer;
+    }
+  return NULL;
+}
+
+
+/* error message for the filename */
+
+void TGZnotfound (const char *arcname)
+{
+  int i;
+
+  fprintf(stderr,"%s: Couldn't find ",prog);
+  for (i=0;TGZsuffix[i];i++)
+    fprintf(stderr,(TGZsuffix[i+1]) ? "%s%s, " : "or %s%s\n",
+            arcname,
+            TGZsuffix[i]);
+  exit(1);
+}
+
+
+/* convert octal digits to int */
+/* on error return -1 */
+
+int getoct (char *p,int width)
+{
+  int result = 0;
+  char c;
+
+  while (width--)
+    {
+      c = *p++;
+      if (c == 0)
+        break;
+      if (c == ' ')
+        continue;
+      if (c < '0' || c > '7')
+        return -1;
+      result = result * 8 + (c - '0');
+    }
+  return result;
+}
+
+
+/* convert time_t to string */
+/* use the "YYYY/MM/DD hh:mm:ss" format */
+
+char *strtime (time_t *t)
+{
+  struct tm   *local;
+  static char result[32];
+
+  local = localtime(t);
+  sprintf(result,"%4d/%02d/%02d %02d:%02d:%02d",
+          local->tm_year+1900, local->tm_mon+1, local->tm_mday,
+          local->tm_hour, local->tm_min, local->tm_sec);
+  return result;
+}
+
+
+/* set file time */
+
+int setfiletime (char *fname,time_t ftime)
+{
+#ifdef WIN32
+  static int isWinNT = -1;
+  SYSTEMTIME st;
+  FILETIME locft, modft;
+  struct tm *loctm;
+  HANDLE hFile;
+  int result;
+
+  loctm = localtime(&ftime);
+  if (loctm == NULL)
+    return -1;
+
+  st.wYear         = (WORD)loctm->tm_year + 1900;
+  st.wMonth        = (WORD)loctm->tm_mon + 1;
+  st.wDayOfWeek    = (WORD)loctm->tm_wday;
+  st.wDay          = (WORD)loctm->tm_mday;
+  st.wHour         = (WORD)loctm->tm_hour;
+  st.wMinute       = (WORD)loctm->tm_min;
+  st.wSecond       = (WORD)loctm->tm_sec;
+  st.wMilliseconds = 0;
+  if (!SystemTimeToFileTime(&st, &locft) ||
+      !LocalFileTimeToFileTime(&locft, &modft))
+    return -1;
+
+  if (isWinNT < 0)
+    isWinNT = (GetVersion() < 0x80000000) ? 1 : 0;
+  hFile = CreateFile(fname, GENERIC_WRITE, 0, NULL, OPEN_EXISTING,
+                     (isWinNT ? FILE_FLAG_BACKUP_SEMANTICS : 0),
+                     NULL);
+  if (hFile == INVALID_HANDLE_VALUE)
+    return -1;
+  result = SetFileTime(hFile, NULL, NULL, &modft) ? 0 : -1;
+  CloseHandle(hFile);
+  return result;
+#else
+  struct utimbuf settime;
+
+  settime.actime = settime.modtime = ftime;
+  return utime(fname,&settime);
+#endif
+}
+
+
+/* push file attributes */
+
+void push_attr(struct attr_item **list,char *fname,int mode,time_t time)
+{
+  struct attr_item *item;
+
+  item = (struct attr_item *)malloc(sizeof(struct attr_item));
+  if (item == NULL)
+    error("Out of memory");
+  item->fname = strdup(fname);
+  item->mode  = mode;
+  item->time  = time;
+  item->next  = *list;
+  *list       = item;
+}
+
+
+/* restore file attributes */
+
+void restore_attr(struct attr_item **list)
+{
+  struct attr_item *item, *prev;
+
+  for (item = *list; item != NULL; )
+    {
+      setfiletime(item->fname,item->time);
+      chmod(item->fname,item->mode);
+      prev = item;
+      item = item->next;
+      free(prev);
+    }
+  *list = NULL;
+}
+
+
+/* match regular expression */
+
+#define ISSPECIAL(c) (((c) == '*') || ((c) == '/'))
+
+int ExprMatch (char *string,char *expr)
+{
+  while (1)
+    {
+      if (ISSPECIAL(*expr))
+        {
+          if (*expr == '/')
+            {
+              if (*string != '\\' && *string != '/')
+                return 0;
+              string ++; expr++;
+            }
+          else if (*expr == '*')
+            {
+              if (*expr ++ == 0)
+                return 1;
+              while (*++string != *expr)
+                if (*string == 0)
+                  return 0;
+            }
+        }
+      else
+        {
+          if (*string != *expr)
+            return 0;
+          if (*expr++ == 0)
+            return 1;
+          string++;
+        }
+    }
+}
+
+
+/* recursive mkdir */
+/* abort on ENOENT; ignore other errors like "directory already exists" */
+/* return 1 if OK */
+/*        0 on error */
+
+int makedir (char *newdir)
+{
+  char *buffer = strdup(newdir);
+  char *p;
+  int  len = strlen(buffer);
+
+  if (len <= 0) {
+    free(buffer);
+    return 0;
+  }
+  if (buffer[len-1] == '/') {
+    buffer[len-1] = '\0';
+  }
+  if (mkdir(buffer, 0755) == 0)
+    {
+      free(buffer);
+      return 1;
+    }
+
+  p = buffer+1;
+  while (1)
+    {
+      char hold;
+
+      while(*p && *p != '\\' && *p != '/')
+        p++;
+      hold = *p;
+      *p = 0;
+      if ((mkdir(buffer, 0755) == -1) && (errno == ENOENT))
+        {
+          fprintf(stderr,"%s: Couldn't create directory %s\n",prog,buffer);
+          free(buffer);
+          return 0;
+        }
+      if (hold == 0)
+        break;
+      *p++ = hold;
+    }
+  free(buffer);
+  return 1;
+}
+
+
+int matchname (int arg,int argc,char **argv,char *fname)
+{
+  if (arg == argc)      /* no arguments given (untgz tgzarchive) */
+    return 1;
+
+  while (arg < argc)
+    if (ExprMatch(fname,argv[arg++]))
+      return 1;
+
+  return 0; /* ignore this for the moment being */
+}
+
+
+/* tar file list or extract */
+
+int tar (gzFile in,int action,int arg,int argc,char **argv)
+{
+  union  tar_buffer buffer;
+  int    len;
+  int    err;
+  int    getheader = 1;
+  int    remaining = 0;
+  FILE   *outfile = NULL;
+  char   fname[BLOCKSIZE];
+  int    tarmode;
+  time_t tartime;
+  struct attr_item *attributes = NULL;
+
+  if (action == TGZ_LIST)
+    printf("    date      time     size                       file\n"
+           " ---------- -------- --------- -------------------------------------\n");
+  while (1)
+    {
+      len = gzread(in, &buffer, BLOCKSIZE);
+      if (len < 0)
+        error(gzerror(in, &err));
+      /*
+       * Always expect complete blocks to process
+       * the tar information.
+       */
+      if (len != BLOCKSIZE)
+        {
+          action = TGZ_INVALID; /* force error exit */
+          remaining = 0;        /* force I/O cleanup */
+        }
+
+      /*
+       * If we have to get a tar header
+       */
+      if (getheader >= 1)
+        {
+          /*
+           * if we met the end of the tar
+           * or the end-of-tar block,
+           * we are done
+           */
+          if (len == 0 || buffer.header.name[0] == 0)
+            break;
+
+          tarmode = getoct(buffer.header.mode,8);
+          tartime = (time_t)getoct(buffer.header.mtime,12);
+          if (tarmode == -1 || tartime == (time_t)-1)
+            {
+              buffer.header.name[0] = 0;
+              action = TGZ_INVALID;
+            }
+
+          if (getheader == 1)
+            {
+              strncpy(fname,buffer.header.name,SHORTNAMESIZE);
+              if (fname[SHORTNAMESIZE-1] != 0)
+                  fname[SHORTNAMESIZE] = 0;
+            }
+          else
+            {
+              /*
+               * The file name is longer than SHORTNAMESIZE
+               */
+              if (strncmp(fname,buffer.header.name,SHORTNAMESIZE-1) != 0)
+                  error("bad long name");
+              getheader = 1;
+            }
+
+          /*
+           * Act according to the type flag
+           */
+          switch (buffer.header.typeflag)
+            {
+            case DIRTYPE:
+              if (action == TGZ_LIST)
+                printf(" %s     <dir> %s\n",strtime(&tartime),fname);
+              if (action == TGZ_EXTRACT)
+                {
+                  makedir(fname);
+                  push_attr(&attributes,fname,tarmode,tartime);
+                }
+              break;
+            case REGTYPE:
+            case AREGTYPE:
+              remaining = getoct(buffer.header.size,12);
+              if (remaining == -1)
+                {
+                  action = TGZ_INVALID;
+                  break;
+                }
+              if (action == TGZ_LIST)
+                printf(" %s %9d %s\n",strtime(&tartime),remaining,fname);
+              else if (action == TGZ_EXTRACT)
+                {
+                  if (matchname(arg,argc,argv,fname))
+                    {
+                      outfile = fopen(fname,"wb");
+                      if (outfile == NULL) {
+                        /* try creating directory */
+                        char *p = strrchr(fname, '/');
+                        if (p != NULL) {
+                          *p = '\0';
+                          makedir(fname);
+                          *p = '/';
+                          outfile = fopen(fname,"wb");
+                        }
+                      }
+                      if (outfile != NULL)
+                        printf("Extracting %s\n",fname);
+                      else
+                        fprintf(stderr, "%s: Couldn't create %s",prog,fname);
+                    }
+                  else
+                    outfile = NULL;
+                }
+              getheader = 0;
+              break;
+            case GNUTYPE_LONGLINK:
+            case GNUTYPE_LONGNAME:
+              remaining = getoct(buffer.header.size,12);
+              if (remaining < 0 || remaining >= BLOCKSIZE)
+                {
+                  action = TGZ_INVALID;
+                  break;
+                }
+              len = gzread(in, fname, BLOCKSIZE);
+              if (len < 0)
+                error(gzerror(in, &err));
+              if (fname[BLOCKSIZE-1] != 0 || (int)strlen(fname) > remaining)
+                {
+                  action = TGZ_INVALID;
+                  break;
+                }
+              getheader = 2;
+              break;
+            default:
+              if (action == TGZ_LIST)
+                printf(" %s     <---> %s\n",strtime(&tartime),fname);
+              break;
+            }
+        }
+      else
+        {
+          unsigned int bytes = (remaining > BLOCKSIZE) ? BLOCKSIZE : remaining;
+
+          if (outfile != NULL)
+            {
+              if (fwrite(&buffer,sizeof(char),bytes,outfile) != bytes)
+                {
+                  fprintf(stderr,
+                    "%s: Error writing %s -- skipping\n",prog,fname);
+                  fclose(outfile);
+                  outfile = NULL;
+                  remove(fname);
+                }
+            }
+          remaining -= bytes;
+        }
+
+      if (remaining == 0)
+        {
+          getheader = 1;
+          if (outfile != NULL)
+            {
+              fclose(outfile);
+              outfile = NULL;
+              if (action != TGZ_INVALID)
+                push_attr(&attributes,fname,tarmode,tartime);
+            }
+        }
+
+      /*
+       * Abandon if errors are found
+       */
+      if (action == TGZ_INVALID)
+        {
+          error("broken archive");
+          break;
+        }
+    }
+
+  /*
+   * Restore file modes and time stamps
+   */
+  restore_attr(&attributes);
+
+  if (gzclose(in) != Z_OK)
+    error("failed gzclose");
+
+  return 0;
+}
+
+
+/* ============================================================ */
+
+void help(int exitval)
+{
+  printf("untgz version 0.2.1\n"
+         "  using zlib version %s\n\n",
+         zlibVersion());
+  printf("Usage: untgz file.tgz            extract all files\n"
+         "       untgz file.tgz fname ...  extract selected files\n"
+         "       untgz -l file.tgz         list archive contents\n"
+         "       untgz -h                  display this help\n");
+  exit(exitval);
+}
+
+void error(const char *msg)
+{
+  fprintf(stderr, "%s: %s\n", prog, msg);
+  exit(1);
+}
+
+
+/* ============================================================ */
+
+#if defined(WIN32) && defined(__GNUC__)
+int _CRT_glob = 0;      /* disable argument globbing in MinGW */
+#endif
+
+int main(int argc,char **argv)
+{
+    int         action = TGZ_EXTRACT;
+    int         arg = 1;
+    char        *TGZfile;
+    gzFile      *f;
+
+    prog = strrchr(argv[0],'\\');
+    if (prog == NULL)
+      {
+        prog = strrchr(argv[0],'/');
+        if (prog == NULL)
+          {
+            prog = strrchr(argv[0],':');
+            if (prog == NULL)
+              prog = argv[0];
+            else
+              prog++;
+          }
+        else
+          prog++;
+      }
+    else
+      prog++;
+
+    if (argc == 1)
+      help(0);
+
+    if (strcmp(argv[arg],"-l") == 0)
+      {
+        action = TGZ_LIST;
+        if (argc == ++arg)
+          help(0);
+      }
+    else if (strcmp(argv[arg],"-h") == 0)
+      {
+        help(0);
+      }
+
+    if ((TGZfile = TGZfname(argv[arg])) == NULL)
+      TGZnotfound(argv[arg]);
+
+    ++arg;
+    if ((action == TGZ_LIST) && (arg != argc))
+      help(1);
+
+/*
+ *  Process the TGZ file
+ */
+    switch(action)
+      {
+      case TGZ_LIST:
+      case TGZ_EXTRACT:
+        f = gzopen(TGZfile,"rb");
+        if (f == NULL)
+          {
+            fprintf(stderr,"%s: Couldn't gzopen %s\n",prog,TGZfile);
+            return 1;
+          }
+        exit(tar(f, action, arg, argc, argv));
+      break;
+
+      default:
+        error("Unknown option");
+        exit(1);
+      }
+
+    return 0;
+}
diff --git a/updater/zlib123/contrib/vstudio/readme.txt b/updater/zlib123/contrib/vstudio/readme.txt
new file mode 100644
index 0000000..16159f9
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/readme.txt
@@ -0,0 +1,73 @@
+Building instructions for the DLL versions of Zlib 1.2.3
+========================================================
+
+This directory contains projects that build zlib and minizip using
+Microsoft Visual C++ 7.0/7.1, and Visual C++ .
+
+You don't need to build these projects yourself. You can download the
+binaries from:
+  http://www.winimage.com/zLibDll
+
+More information can be found at this site.
+
+
+Build instructions for Visual Studio 7.x (32 bits)
+--------------------------------------------------
+- Uncompress current zlib, including all contrib/* files
+- Download the crtdll library from
+    http://www.winimage.com/zLibDll/crtdll.zip
+  Unzip crtdll.zip to extract crtdll.lib on contrib\vstudio\vc7.
+- Open contrib\vstudio\vc7\zlibvc.sln with Microsoft Visual C++ 7.x
+  (Visual Studio .Net 2002 or 2003).
+
+Build instructions for Visual Studio 2005 (32 bits or 64 bits)
+--------------------------------------------------------------
+- Uncompress current zlib, including all contrib/* files
+- For 32 bits only: download the crtdll library from
+    http://www.winimage.com/zLibDll/crtdll.zip
+  Unzip crtdll.zip to extract crtdll.lib on contrib\vstudio\vc8.
+- Open contrib\vstudio\vc8\zlibvc.sln with Microsoft Visual C++ 8.0
+
+Build instructions for Visual Studio 2005 64 bits, PSDK compiler
+----------------------------------------------------------------
+at the time of writing this text file, Visual Studio 2005 (and 
+  Microsoft Visual C++ 8.0) is on the beta 2 stage.
+Using you can get the free 64 bits compiler from Platform SDK, 
+  which is NOT a beta, and compile using the Visual studio 2005 IDE
+see http://www.winimage.com/misc/sdk64onvs2005/ for instruction
+
+- Uncompress current zlib, including all contrib/* files
+- start Visual Studio 2005 from a platform SDK command prompt, using
+  the /useenv switch
+- Open contrib\vstudio\vc8\zlibvc.sln with Microsoft Visual C++ 8.0
+
+
+Important
+---------
+- To use zlibwapi.dll in your application, you must define the
+  macro ZLIB_WINAPI when compiling your application's source files.
+
+
+Additional notes
+----------------
+- This DLL, named zlibwapi.dll, is compatible to the old zlib.dll built
+  by Gilles Vollant from the zlib 1.1.x sources, and distributed at
+    http://www.winimage.com/zLibDll
+  It uses the WINAPI calling convention for the exported functions, and
+  includes the minizip functionality. If your application needs that
+  particular build of zlib.dll, you can rename zlibwapi.dll to zlib.dll.
+
+- The new DLL was renamed because there exist several incompatible
+  versions of zlib.dll on the Internet.
+
+- There is also an official DLL build of zlib, named zlib1.dll. This one
+  is exporting the functions using the CDECL convention. See the file
+  win32\DLL_FAQ.txt found in this zlib distribution.
+
+- There used to be a ZLIB_DLL macro in zlib 1.1.x, but now this symbol
+  has a slightly different effect. To avoid compatibility problems, do
+  not define it here.
+
+
+Gilles Vollant
+info@winimage.com
diff --git a/updater/zlib123/contrib/vstudio/vc7/miniunz.vcproj b/updater/zlib123/contrib/vstudio/vc7/miniunz.vcproj
new file mode 100644
index 0000000..ad5117c
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc7/miniunz.vcproj
@@ -0,0 +1,126 @@
+<?xml version="1.0" encoding = "Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="7.00"
+	Name="miniunz"
+	ProjectGUID="{C52F9E7B-498A-42BE-8DB4-85A15694382A}"
+	Keyword="Win32Proj">
+	<Platforms>
+		<Platform
+			Name="Win32"/>
+	</Platforms>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="Debug"
+			IntermediateDirectory="Debug"
+			ConfigurationType="1"
+			CharacterSet="2">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;_DEBUG;_CONSOLE"
+				MinimalRebuild="TRUE"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="5"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="TRUE"
+				DebugInformationFormat="4"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/miniunz.exe"
+				LinkIncremental="2"
+				GenerateDebugInformation="TRUE"
+				ProgramDatabaseFile="$(OutDir)/miniunz.pdb"
+				SubSystem="1"
+				TargetMachine="1"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="Release"
+			IntermediateDirectory="Release"
+			ConfigurationType="1"
+			CharacterSet="2">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="TRUE"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;NDEBUG;_CONSOLE"
+				StringPooling="TRUE"
+				RuntimeLibrary="4"
+				EnableFunctionLevelLinking="TRUE"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="TRUE"
+				DebugInformationFormat="3"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/miniunz.exe"
+				LinkIncremental="1"
+				GenerateDebugInformation="TRUE"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="1"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+	</Configurations>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm">
+			<File
+				RelativePath="..\..\minizip\miniunz.c">
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;inc">
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe">
+		</Filter>
+		<File
+			RelativePath="ReleaseDll\zlibwapi.lib">
+		</File>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/contrib/vstudio/vc7/minizip.vcproj b/updater/zlib123/contrib/vstudio/vc7/minizip.vcproj
new file mode 100644
index 0000000..fb5b632
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc7/minizip.vcproj
@@ -0,0 +1,126 @@
+<?xml version="1.0" encoding = "Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="7.00"
+	Name="minizip"
+	ProjectGUID="{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}"
+	Keyword="Win32Proj">
+	<Platforms>
+		<Platform
+			Name="Win32"/>
+	</Platforms>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="Debug"
+			IntermediateDirectory="Debug"
+			ConfigurationType="1"
+			CharacterSet="2">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;_DEBUG;_CONSOLE"
+				MinimalRebuild="TRUE"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="5"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="TRUE"
+				DebugInformationFormat="4"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/minizip.exe"
+				LinkIncremental="2"
+				GenerateDebugInformation="TRUE"
+				ProgramDatabaseFile="$(OutDir)/minizip.pdb"
+				SubSystem="1"
+				TargetMachine="1"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="Release"
+			IntermediateDirectory="Release"
+			ConfigurationType="1"
+			CharacterSet="2">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="TRUE"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;NDEBUG;_CONSOLE"
+				StringPooling="TRUE"
+				RuntimeLibrary="4"
+				EnableFunctionLevelLinking="TRUE"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="TRUE"
+				DebugInformationFormat="3"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/minizip.exe"
+				LinkIncremental="1"
+				GenerateDebugInformation="TRUE"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="1"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+	</Configurations>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm">
+			<File
+				RelativePath="..\..\minizip\minizip.c">
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;inc">
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe">
+		</Filter>
+		<File
+			RelativePath="ReleaseDll\zlibwapi.lib">
+		</File>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/contrib/vstudio/vc7/testzlib.vcproj b/updater/zlib123/contrib/vstudio/vc7/testzlib.vcproj
new file mode 100644
index 0000000..97bc3e8
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc7/testzlib.vcproj
@@ -0,0 +1,126 @@
+<?xml version="1.0" encoding = "Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="7.00"
+	Name="testZlibDll"
+	ProjectGUID="{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}"
+	Keyword="Win32Proj">
+	<Platforms>
+		<Platform
+			Name="Win32"/>
+	</Platforms>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="Debug"
+			IntermediateDirectory="Debug"
+			ConfigurationType="1"
+			CharacterSet="2">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;_DEBUG;_CONSOLE"
+				MinimalRebuild="TRUE"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="5"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="TRUE"
+				DebugInformationFormat="4"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="2"
+				GenerateDebugInformation="TRUE"
+				ProgramDatabaseFile="$(OutDir)/testzlib.pdb"
+				SubSystem="1"
+				TargetMachine="1"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="Release"
+			IntermediateDirectory="Release"
+			ConfigurationType="1"
+			CharacterSet="2">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="TRUE"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;NDEBUG;_CONSOLE"
+				StringPooling="TRUE"
+				RuntimeLibrary="4"
+				EnableFunctionLevelLinking="TRUE"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="TRUE"
+				DebugInformationFormat="3"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="1"
+				GenerateDebugInformation="TRUE"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="1"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+	</Configurations>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm">
+			<File
+				RelativePath="..\..\testzlib\testzlib.c">
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;inc">
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe">
+		</Filter>
+		<File
+			RelativePath="ReleaseDll\zlibwapi.lib">
+		</File>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/contrib/vstudio/vc7/zlib.rc b/updater/zlib123/contrib/vstudio/vc7/zlib.rc
new file mode 100644
index 0000000..72cb8b4
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc7/zlib.rc
@@ -0,0 +1,32 @@
+#include <windows.h>
+
+#define IDR_VERSION1  1
+IDR_VERSION1	VERSIONINFO	MOVEABLE IMPURE LOADONCALL DISCARDABLE
+  FILEVERSION	 1,2,3,0
+  PRODUCTVERSION 1,2,3,0
+  FILEFLAGSMASK	VS_FFI_FILEFLAGSMASK
+  FILEFLAGS	0
+  FILEOS	VOS_DOS_WINDOWS32
+  FILETYPE	VFT_DLL
+  FILESUBTYPE	0	// not used
+BEGIN
+  BLOCK "StringFileInfo"
+  BEGIN
+    BLOCK "040904E4"
+    //language ID = U.S. English, char set = Windows, Multilingual
+
+    BEGIN
+      VALUE "FileDescription", "zlib data compression library\0"
+      VALUE "FileVersion",	"1.2.3.0\0"
+      VALUE "InternalName",	"zlib\0"
+      VALUE "OriginalFilename",	"zlib.dll\0"
+      VALUE "ProductName",	"ZLib.DLL\0"
+      VALUE "Comments","DLL support by Alessandro Iacopetti & Gilles Vollant\0"
+      VALUE "LegalCopyright", "(C) 1995-2003 Jean-loup Gailly & Mark Adler\0"
+    END
+  END
+  BLOCK "VarFileInfo"
+  BEGIN
+    VALUE "Translation", 0x0409, 1252
+  END
+END
diff --git a/updater/zlib123/contrib/vstudio/vc7/zlibstat.vcproj b/updater/zlib123/contrib/vstudio/vc7/zlibstat.vcproj
new file mode 100644
index 0000000..766d7a4
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc7/zlibstat.vcproj
@@ -0,0 +1,246 @@
+<?xml version="1.0" encoding = "Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="7.00"
+	Name="zlibstat"
+	SccProjectName=""
+	SccLocalPath="">
+	<Platforms>
+		<Platform
+			Name="Win32"/>
+	</Platforms>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory=".\zlibstatDebug"
+			IntermediateDirectory=".\zlibstatDebug"
+			ConfigurationType="4"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI"
+				ExceptionHandling="FALSE"
+				RuntimeLibrary="5"
+				PrecompiledHeaderFile=".\zlibstatDebug/zlibstat.pch"
+				AssemblerListingLocation=".\zlibstatDebug/"
+				ObjectFile=".\zlibstatDebug/"
+				ProgramDataBaseFileName=".\zlibstatDebug/"
+				WarningLevel="3"
+				SuppressStartupBanner="TRUE"
+				DebugInformationFormat="1"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/NODEFAULTLIB "
+				OutputFile=".\zlibstatDebug\zlibstat.lib"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseAxp|Win32"
+			OutputDirectory=".\zlibsta0"
+			IntermediateDirectory=".\zlibsta0"
+			ConfigurationType="4"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE">
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI"
+				StringPooling="TRUE"
+				ExceptionHandling="FALSE"
+				RuntimeLibrary="4"
+				EnableFunctionLevelLinking="TRUE"
+				PrecompiledHeaderFile=".\zlibsta0/zlibstat.pch"
+				AssemblerListingLocation=".\zlibsta0/"
+				ObjectFile=".\zlibsta0/"
+				ProgramDataBaseFileName=".\zlibsta0/"
+				WarningLevel="3"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/NODEFAULTLIB "
+				OutputFile=".\zlibsta0\zlibstat.lib"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory=".\zlibstat"
+			IntermediateDirectory=".\zlibstat"
+			ConfigurationType="4"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE">
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;ASMV;ASMINF"
+				StringPooling="TRUE"
+				ExceptionHandling="FALSE"
+				RuntimeLibrary="4"
+				EnableFunctionLevelLinking="TRUE"
+				PrecompiledHeaderFile=".\zlibstat/zlibstat.pch"
+				AssemblerListingLocation=".\zlibstat/"
+				ObjectFile=".\zlibstat/"
+				ProgramDataBaseFileName=".\zlibstat/"
+				WarningLevel="3"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="..\..\masmx86\gvmat32.obj ..\..\masmx86\inffas32.obj /NODEFAULTLIB "
+				OutputFile=".\zlibstat\zlibstat.lib"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|Win32"
+			OutputDirectory="zlibstatWithoutAsm"
+			IntermediateDirectory="zlibstatWithoutAsm"
+			ConfigurationType="4"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE">
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI"
+				StringPooling="TRUE"
+				ExceptionHandling="FALSE"
+				RuntimeLibrary="4"
+				EnableFunctionLevelLinking="TRUE"
+				PrecompiledHeaderFile=".\zlibstat/zlibstat.pch"
+				AssemblerListingLocation=".\zlibstatWithoutAsm/"
+				ObjectFile=".\zlibstatWithoutAsm/"
+				ProgramDataBaseFileName=".\zlibstatWithoutAsm/"
+				WarningLevel="3"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions=" /NODEFAULTLIB "
+				OutputFile=".\zlibstatWithoutAsm\zlibstat.lib"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+		</Configuration>
+	</Configurations>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="">
+			<File
+				RelativePath="..\..\..\adler32.c">
+			</File>
+			<File
+				RelativePath="..\..\..\compress.c">
+			</File>
+			<File
+				RelativePath="..\..\..\crc32.c">
+			</File>
+			<File
+				RelativePath="..\..\..\deflate.c">
+			</File>
+			<File
+				RelativePath="..\..\masmx86\gvmat32c.c">
+			</File>
+			<File
+				RelativePath="..\..\..\gzio.c">
+			</File>
+			<File
+				RelativePath="..\..\..\infback.c">
+			</File>
+			<File
+				RelativePath="..\..\..\inffast.c">
+			</File>
+			<File
+				RelativePath="..\..\..\inflate.c">
+			</File>
+			<File
+				RelativePath="..\..\..\inftrees.c">
+			</File>
+			<File
+				RelativePath="..\..\minizip\ioapi.c">
+			</File>
+			<File
+				RelativePath="..\..\..\trees.c">
+			</File>
+			<File
+				RelativePath="..\..\..\uncompr.c">
+			</File>
+			<File
+				RelativePath="..\..\minizip\unzip.c">
+			</File>
+			<File
+				RelativePath="..\..\minizip\zip.c">
+			</File>
+			<File
+				RelativePath=".\zlib.rc">
+			</File>
+			<File
+				RelativePath=".\zlibvc.def">
+			</File>
+			<File
+				RelativePath="..\..\..\zutil.c">
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/contrib/vstudio/vc7/zlibvc.def b/updater/zlib123/contrib/vstudio/vc7/zlibvc.def
new file mode 100644
index 0000000..a40e715
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc7/zlibvc.def
@@ -0,0 +1,92 @@
+
+VERSION		1.23
+
+HEAPSIZE	1048576,8192
+
+EXPORTS
+        adler32                                  @1
+        compress                                 @2
+        crc32                                    @3
+        deflate                                  @4
+        deflateCopy                              @5
+        deflateEnd                               @6
+        deflateInit2_                            @7
+        deflateInit_                             @8
+        deflateParams                            @9
+        deflateReset                             @10
+        deflateSetDictionary                     @11
+        gzclose                                  @12
+        gzdopen                                  @13
+        gzerror                                  @14
+        gzflush                                  @15
+        gzopen                                   @16
+        gzread                                   @17
+        gzwrite                                  @18
+        inflate                                  @19
+        inflateEnd                               @20
+        inflateInit2_                            @21
+        inflateInit_                             @22
+        inflateReset                             @23
+        inflateSetDictionary                     @24
+        inflateSync                              @25
+        uncompress                               @26
+        zlibVersion                              @27
+        gzprintf                                 @28
+        gzputc                                   @29
+        gzgetc                                   @30
+        gzseek                                   @31
+        gzrewind                                 @32
+        gztell                                   @33
+        gzeof                                    @34
+        gzsetparams                              @35
+        zError                                   @36
+        inflateSyncPoint                         @37
+        get_crc_table                            @38
+        compress2                                @39
+        gzputs                                   @40
+        gzgets                                   @41
+        inflateCopy                              @42
+        inflateBackInit_                         @43
+        inflateBack                              @44
+        inflateBackEnd                           @45
+        compressBound                            @46
+        deflateBound                             @47
+        gzclearerr                               @48
+        gzungetc                                 @49
+        zlibCompileFlags                         @50
+        deflatePrime                             @51
+
+        unzOpen                                  @61
+        unzClose                                 @62
+        unzGetGlobalInfo                         @63
+        unzGetCurrentFileInfo                    @64
+        unzGoToFirstFile                         @65
+        unzGoToNextFile                          @66
+        unzOpenCurrentFile                       @67
+        unzReadCurrentFile                       @68
+        unzOpenCurrentFile3                      @69
+        unztell                                  @70
+        unzeof                                   @71
+        unzCloseCurrentFile                      @72
+        unzGetGlobalComment                      @73
+        unzStringFileNameCompare                 @74
+        unzLocateFile                            @75
+        unzGetLocalExtrafield                    @76
+        unzOpen2                                 @77
+        unzOpenCurrentFile2                      @78
+        unzOpenCurrentFilePassword               @79
+
+        zipOpen                                  @80
+        zipOpenNewFileInZip                      @81
+        zipWriteInFileInZip                      @82
+        zipCloseFileInZip                        @83
+        zipClose                                 @84
+        zipOpenNewFileInZip2                     @86
+        zipCloseFileInZipRaw                     @87
+        zipOpen2                                 @88
+        zipOpenNewFileInZip3                     @89
+
+        unzGetFilePos                            @100
+        unzGoToFilePos                           @101
+
+        fill_win32_filefunc                      @110
diff --git a/updater/zlib123/contrib/vstudio/vc7/zlibvc.sln b/updater/zlib123/contrib/vstudio/vc7/zlibvc.sln
new file mode 100644
index 0000000..927b42b
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc7/zlibvc.sln
@@ -0,0 +1,78 @@
+Microsoft Visual Studio Solution File, Format Version 7.00
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "zlibstat", "zlibstat.vcproj", "{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}"
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "zlibvc", "zlibvc.vcproj", "{8FD826F8-3739-44E6-8CC8-997122E53B8D}"
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "minizip", "minizip.vcproj", "{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}"
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "miniunz", "miniunz.vcproj", "{C52F9E7B-498A-42BE-8DB4-85A15694382A}"
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "testZlibDll", "testzlib.vcproj", "{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}"
+EndProject
+Global
+	GlobalSection(SolutionConfiguration) = preSolution
+		ConfigName.0 = Debug
+		ConfigName.1 = Release
+		ConfigName.2 = ReleaseAxp
+		ConfigName.3 = ReleaseWithoutAsm
+		ConfigName.4 = ReleaseWithoutCrtdll
+	EndGlobalSection
+	GlobalSection(ProjectDependencies) = postSolution
+	EndGlobalSection
+	GlobalSection(ProjectConfiguration) = postSolution
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Debug.ActiveCfg = Debug|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Debug.Build.0 = Debug|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Release.ActiveCfg = Release|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Release.Build.0 = Release|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseAxp.ActiveCfg = ReleaseAxp|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseAxp.Build.0 = ReleaseAxp|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseWithoutAsm.ActiveCfg = ReleaseWithoutAsm|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseWithoutAsm.Build.0 = ReleaseWithoutAsm|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseWithoutCrtdll.ActiveCfg = ReleaseAxp|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseWithoutCrtdll.Build.0 = ReleaseAxp|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Debug.ActiveCfg = Debug|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Debug.Build.0 = Debug|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Release.ActiveCfg = Release|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Release.Build.0 = Release|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseAxp.ActiveCfg = ReleaseAxp|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseAxp.Build.0 = ReleaseAxp|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseWithoutAsm.ActiveCfg = ReleaseWithoutAsm|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseWithoutAsm.Build.0 = ReleaseWithoutAsm|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseWithoutCrtdll.ActiveCfg = ReleaseWithoutCrtdll|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseWithoutCrtdll.Build.0 = ReleaseWithoutCrtdll|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Debug.ActiveCfg = Debug|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Debug.Build.0 = Debug|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Release.ActiveCfg = Release|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Release.Build.0 = Release|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.ReleaseAxp.ActiveCfg = Release|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.ReleaseAxp.Build.0 = Release|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm.ActiveCfg = Release|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm.Build.0 = Release|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutCrtdll.ActiveCfg = Release|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutCrtdll.Build.0 = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Debug.ActiveCfg = Debug|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Debug.Build.0 = Debug|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Release.ActiveCfg = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Release.Build.0 = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.ReleaseAxp.ActiveCfg = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.ReleaseAxp.Build.0 = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.ReleaseWithoutAsm.ActiveCfg = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.ReleaseWithoutAsm.Build.0 = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.ReleaseWithoutCrtdll.ActiveCfg = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.ReleaseWithoutCrtdll.Build.0 = Release|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}.Debug.ActiveCfg = Debug|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}.Debug.Build.0 = Debug|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}.Release.ActiveCfg = Release|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}.Release.Build.0 = Release|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}.ReleaseAxp.ActiveCfg = Release|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}.ReleaseAxp.Build.0 = Release|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}.ReleaseWithoutAsm.ActiveCfg = Release|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}.ReleaseWithoutAsm.Build.0 = Release|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}.ReleaseWithoutCrtdll.ActiveCfg = Release|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654C}.ReleaseWithoutCrtdll.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(ExtensibilityGlobals) = postSolution
+	EndGlobalSection
+	GlobalSection(ExtensibilityAddIns) = postSolution
+	EndGlobalSection
+EndGlobal
diff --git a/updater/zlib123/contrib/vstudio/vc7/zlibvc.vcproj b/updater/zlib123/contrib/vstudio/vc7/zlibvc.vcproj
new file mode 100644
index 0000000..8533b49
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc7/zlibvc.vcproj
@@ -0,0 +1,445 @@
+<?xml version="1.0" encoding = "Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="7.00"
+	Name="zlibvc"
+	SccProjectName=""
+	SccLocalPath="">
+	<Platforms>
+		<Platform
+			Name="Win32"/>
+	</Platforms>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory=".\DebugDll"
+			IntermediateDirectory=".\DebugDll"
+			ConfigurationType="2"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32,ZLIB_WINAPI,ASMV,ASMINF"
+				ExceptionHandling="FALSE"
+				RuntimeLibrary="1"
+				PrecompiledHeaderFile=".\DebugDll/zlibvc.pch"
+				AssemblerListingLocation=".\DebugDll/"
+				ObjectFile=".\DebugDll/"
+				ProgramDataBaseFileName=".\DebugDll/"
+				WarningLevel="3"
+				SuppressStartupBanner="TRUE"
+				DebugInformationFormat="4"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalOptions="/MACHINE:I386"
+				AdditionalDependencies="..\..\masmx86\gvmat32.obj ..\..\masmx86\inffas32.obj"
+				OutputFile=".\DebugDll\zlibwapi.dll"
+				LinkIncremental="2"
+				SuppressStartupBanner="TRUE"
+				ModuleDefinitionFile=".\zlibvc.def"
+				GenerateDebugInformation="TRUE"
+				ProgramDatabaseFile=".\DebugDll/zlibwapi.pdb"
+				SubSystem="2"
+				ImportLibrary=".\DebugDll/zlibwapi.lib"/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="_DEBUG"
+				MkTypLibCompatible="TRUE"
+				SuppressStartupBanner="TRUE"
+				TargetEnvironment="1"
+				TypeLibraryName=".\DebugDll/zlibvc.tlb"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+				Culture="1036"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|Win32"
+			OutputDirectory=".\zlibDllWithoutAsm"
+			IntermediateDirectory=".\zlibDllWithoutAsm"
+			ConfigurationType="2"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE"
+			WholeProgramOptimization="TRUE">
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32,ZLIB_WINAPI"
+				StringPooling="TRUE"
+				ExceptionHandling="FALSE"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="TRUE"
+				PrecompiledHeaderFile=".\zlibDllWithoutAsm/zlibvc.pch"
+				AssemblerOutput="2"
+				AssemblerListingLocation=".\zlibDllWithoutAsm/"
+				ObjectFile=".\zlibDllWithoutAsm/"
+				ProgramDataBaseFileName=".\zlibDllWithoutAsm/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalOptions="/MACHINE:I386"
+				AdditionalDependencies="crtdll.lib"
+				OutputFile=".\zlibDllWithoutAsm\zlibwapi.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="TRUE"
+				IgnoreAllDefaultLibraries="TRUE"
+				ModuleDefinitionFile=".\zlibvc.def"
+				ProgramDatabaseFile=".\zlibDllWithoutAsm/zlibwapi.pdb"
+				GenerateMapFile="TRUE"
+				MapFileName=".\zlibDllWithoutAsm/zlibwapi.map"
+				SubSystem="2"
+				OptimizeForWindows98="1"
+				ImportLibrary=".\zlibDllWithoutAsm/zlibwapi.lib"/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="TRUE"
+				SuppressStartupBanner="TRUE"
+				TargetEnvironment="1"
+				TypeLibraryName=".\zlibDllWithoutAsm/zlibvc.tlb"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1036"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutCrtdll|Win32"
+			OutputDirectory=".\zlibDllWithoutCrtDll"
+			IntermediateDirectory=".\zlibDllWithoutCrtDll"
+			ConfigurationType="2"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE"
+			WholeProgramOptimization="TRUE">
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32,ZLIB_WINAPI,ASMV,ASMINF"
+				StringPooling="TRUE"
+				ExceptionHandling="FALSE"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="TRUE"
+				PrecompiledHeaderFile=".\zlibDllWithoutCrtDll/zlibvc.pch"
+				AssemblerOutput="2"
+				AssemblerListingLocation=".\zlibDllWithoutCrtDll/"
+				ObjectFile=".\zlibDllWithoutCrtDll/"
+				ProgramDataBaseFileName=".\zlibDllWithoutCrtDll/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalOptions="/MACHINE:I386"
+				AdditionalDependencies="..\..\masmx86\gvmat32.obj ..\..\masmx86\inffas32.obj "
+				OutputFile=".\zlibDllWithoutCrtDll\zlibwapi.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="TRUE"
+				IgnoreAllDefaultLibraries="FALSE"
+				ModuleDefinitionFile=".\zlibvc.def"
+				ProgramDatabaseFile=".\zlibDllWithoutCrtDll/zlibwapi.pdb"
+				GenerateMapFile="TRUE"
+				MapFileName=".\zlibDllWithoutCrtDll/zlibwapi.map"
+				SubSystem="2"
+				OptimizeForWindows98="1"
+				ImportLibrary=".\zlibDllWithoutCrtDll/zlibwapi.lib"/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="TRUE"
+				SuppressStartupBanner="TRUE"
+				TargetEnvironment="1"
+				TypeLibraryName=".\zlibDllWithoutCrtDll/zlibvc.tlb"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1036"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseAxp|Win32"
+			OutputDirectory=".\zlibvc__"
+			IntermediateDirectory=".\zlibvc__"
+			ConfigurationType="2"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE"
+			WholeProgramOptimization="TRUE">
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32,ZLIB_WINAPI"
+				StringPooling="TRUE"
+				ExceptionHandling="FALSE"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="TRUE"
+				PrecompiledHeaderFile=".\zlibvc__/zlibvc.pch"
+				AssemblerOutput="2"
+				AssemblerListingLocation=".\zlibvc__/"
+				ObjectFile=".\zlibvc__/"
+				ProgramDataBaseFileName=".\zlibvc__/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="crtdll.lib"
+				OutputFile="zlibvc__\zlibwapi.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="TRUE"
+				IgnoreAllDefaultLibraries="TRUE"
+				ModuleDefinitionFile=".\zlibvc.def"
+				ProgramDatabaseFile=".\zlibvc__/zlibwapi.pdb"
+				GenerateMapFile="TRUE"
+				MapFileName=".\zlibvc__/zlibwapi.map"
+				SubSystem="2"
+				ImportLibrary=".\zlibvc__/zlibwapi.lib"/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="TRUE"
+				SuppressStartupBanner="TRUE"
+				TargetEnvironment="1"
+				TypeLibraryName=".\zlibvc__/zlibvc.tlb"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1036"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory=".\ReleaseDll"
+			IntermediateDirectory=".\ReleaseDll"
+			ConfigurationType="2"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE"
+			WholeProgramOptimization="TRUE">
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32,ZLIB_WINAPI,ASMV,ASMINF"
+				StringPooling="TRUE"
+				ExceptionHandling="FALSE"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="TRUE"
+				PrecompiledHeaderFile=".\ReleaseDll/zlibvc.pch"
+				AssemblerOutput="2"
+				AssemblerListingLocation=".\ReleaseDll/"
+				ObjectFile=".\ReleaseDll/"
+				ProgramDataBaseFileName=".\ReleaseDll/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="TRUE"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalOptions="/MACHINE:I386"
+				AdditionalDependencies="..\..\masmx86\gvmat32.obj ..\..\masmx86\inffas32.obj crtdll.lib"
+				OutputFile=".\ReleaseDll\zlibwapi.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="TRUE"
+				IgnoreAllDefaultLibraries="TRUE"
+				ModuleDefinitionFile=".\zlibvc.def"
+				ProgramDatabaseFile=".\ReleaseDll/zlibwapi.pdb"
+				GenerateMapFile="TRUE"
+				MapFileName=".\ReleaseDll/zlibwapi.map"
+				SubSystem="2"
+				OptimizeForWindows98="1"
+				ImportLibrary=".\ReleaseDll/zlibwapi.lib"/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="TRUE"
+				SuppressStartupBanner="TRUE"
+				TargetEnvironment="1"
+				TypeLibraryName=".\Release/zlibvc.tlb"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1036"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+		</Configuration>
+	</Configurations>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;rc;def;r;odl;hpj;bat;for;f90">
+			<File
+				RelativePath="..\..\..\adler32.c">
+			</File>
+			<File
+				RelativePath="..\..\..\compress.c">
+			</File>
+			<File
+				RelativePath="..\..\..\crc32.c">
+			</File>
+			<File
+				RelativePath="..\..\..\deflate.c">
+			</File>
+			<File
+				RelativePath="..\..\masmx86\gvmat32c.c">
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Win32"
+					ExcludedFromBuild="TRUE">
+					<Tool
+						Name="VCCLCompilerTool"/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="..\..\..\gzio.c">
+			</File>
+			<File
+				RelativePath="..\..\..\infback.c">
+			</File>
+			<File
+				RelativePath="..\..\..\inffast.c">
+			</File>
+			<File
+				RelativePath="..\..\..\inflate.c">
+			</File>
+			<File
+				RelativePath="..\..\..\inftrees.c">
+			</File>
+			<File
+				RelativePath="..\..\minizip\ioapi.c">
+			</File>
+			<File
+				RelativePath="..\..\minizip\iowin32.c">
+			</File>
+			<File
+				RelativePath="..\..\..\trees.c">
+			</File>
+			<File
+				RelativePath="..\..\..\uncompr.c">
+			</File>
+			<File
+				RelativePath="..\..\minizip\unzip.c">
+				<FileConfiguration
+					Name="Release|Win32">
+					<Tool
+						Name="VCCLCompilerTool"
+						AdditionalIncludeDirectories=""
+						PreprocessorDefinitions="ZLIB_INTERNAL"/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="..\..\minizip\zip.c">
+				<FileConfiguration
+					Name="Release|Win32">
+					<Tool
+						Name="VCCLCompilerTool"
+						AdditionalIncludeDirectories=""
+						PreprocessorDefinitions="ZLIB_INTERNAL"/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath=".\zlib.rc">
+			</File>
+			<File
+				RelativePath=".\zlibvc.def">
+			</File>
+			<File
+				RelativePath="..\..\..\zutil.c">
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;fi;fd">
+			<File
+				RelativePath="..\..\..\deflate.h">
+			</File>
+			<File
+				RelativePath="..\..\..\infblock.h">
+			</File>
+			<File
+				RelativePath="..\..\..\infcodes.h">
+			</File>
+			<File
+				RelativePath="..\..\..\inffast.h">
+			</File>
+			<File
+				RelativePath="..\..\..\inftrees.h">
+			</File>
+			<File
+				RelativePath="..\..\..\infutil.h">
+			</File>
+			<File
+				RelativePath="..\..\..\zconf.h">
+			</File>
+			<File
+				RelativePath="..\..\..\zlib.h">
+			</File>
+			<File
+				RelativePath="..\..\..\zutil.h">
+			</File>
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="ico;cur;bmp;dlg;rc2;rct;bin;cnt;rtf;gif;jpg;jpeg;jpe">
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/contrib/vstudio/vc8/miniunz.vcproj b/updater/zlib123/contrib/vstudio/vc8/miniunz.vcproj
new file mode 100644
index 0000000..4af53e8
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc8/miniunz.vcproj
@@ -0,0 +1,566 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8,00"
+	Name="miniunz"
+	ProjectGUID="{C52F9E7B-498A-42BE-8DB4-85A15694382A}"
+	Keyword="Win32Proj"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+		<Platform
+			Name="x64"
+		/>
+		<Platform
+			Name="Itanium"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="x86\MiniUnzip$(ConfigurationName)"
+			IntermediateDirectory="x86\MiniUnzip$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="WIN32;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;_DEBUG;_CONSOLE"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="1"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x86\ZlibDllDebug\zlibwapi.lib"
+				OutputFile="$(OutDir)/miniunz.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/miniunz.pdb"
+				SubSystem="1"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|x64"
+			OutputDirectory="x64\MiniUnzip$(ConfigurationName)"
+			IntermediateDirectory="x64\MiniUnzip$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;_DEBUG;_CONSOLE;WIN64"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x64\ZlibDllDebug\zlibwapi.lib"
+				OutputFile="$(OutDir)/miniunz.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/miniunz.pdb"
+				SubSystem="1"
+				TargetMachine="17"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|Itanium"
+			OutputDirectory="ia64\MiniUnzip$(ConfigurationName)"
+			IntermediateDirectory="ia64\MiniUnzip$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;_DEBUG;_CONSOLE;WIN64"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="ia64\ZlibDllDebug\zlibwapi.lib"
+				OutputFile="$(OutDir)/miniunz.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/miniunz.pdb"
+				SubSystem="1"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="x86\MiniUnzip$(ConfigurationName)"
+			IntermediateDirectory="x86\MiniUnzip$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="WIN32;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;NDEBUG;_CONSOLE"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="0"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x86\ZlibDllRelease\zlibwapi.lib"
+				OutputFile="$(OutDir)/miniunz.exe"
+				LinkIncremental="1"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|x64"
+			OutputDirectory="x64\MiniUnzip$(ConfigurationName)"
+			IntermediateDirectory="x64\MiniUnzip$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;NDEBUG;_CONSOLE;WIN64"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x64\ZlibDllRelease\zlibwapi.lib"
+				OutputFile="$(OutDir)/miniunz.exe"
+				LinkIncremental="1"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="17"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Itanium"
+			OutputDirectory="ia64\MiniUnzip$(ConfigurationName)"
+			IntermediateDirectory="ia64\MiniUnzip$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;NDEBUG;_CONSOLE;WIN64"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="ia64\ZlibDllRelease\zlibwapi.lib"
+				OutputFile="$(OutDir)/miniunz.exe"
+				LinkIncremental="1"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm"
+			>
+			<File
+				RelativePath="..\..\minizip\miniunz.c"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;inc"
+			>
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+			>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/contrib/vstudio/vc8/minizip.vcproj b/updater/zlib123/contrib/vstudio/vc8/minizip.vcproj
new file mode 100644
index 0000000..85f64c4
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc8/minizip.vcproj
@@ -0,0 +1,563 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8,00"
+	Name="minizip"
+	ProjectGUID="{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}"
+	Keyword="Win32Proj"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+		<Platform
+			Name="x64"
+		/>
+		<Platform
+			Name="Itanium"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="x86\MiniZip$(ConfigurationName)"
+			IntermediateDirectory="x86\MiniZip$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="WIN32;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;_DEBUG;_CONSOLE"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="1"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x86\ZlibDllDebug\zlibwapi.lib"
+				OutputFile="$(OutDir)/minizip.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/minizip.pdb"
+				SubSystem="1"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|x64"
+			OutputDirectory="x64\$(ConfigurationName)"
+			IntermediateDirectory="x64\$(ConfigurationName)"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;_DEBUG;_CONSOLE;WIN64"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x64\ZlibDllDebug\zlibwapi.lib"
+				OutputFile="$(OutDir)/minizip.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/minizip.pdb"
+				SubSystem="1"
+				TargetMachine="17"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|Itanium"
+			OutputDirectory="ia64\$(ConfigurationName)"
+			IntermediateDirectory="ia64\$(ConfigurationName)"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;_DEBUG;_CONSOLE;WIN64"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="ia64\ZlibDllDebug\zlibwapi.lib"
+				OutputFile="$(OutDir)/minizip.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/minizip.pdb"
+				SubSystem="1"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="x86\MiniZip$(ConfigurationName)"
+			IntermediateDirectory="x86\MiniZip$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="WIN32;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;NDEBUG;_CONSOLE"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="0"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x86\ZlibDllRelease\zlibwapi.lib"
+				OutputFile="$(OutDir)/minizip.exe"
+				LinkIncremental="1"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|x64"
+			OutputDirectory="x64\$(ConfigurationName)"
+			IntermediateDirectory="x64\$(ConfigurationName)"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;NDEBUG;_CONSOLE;WIN64"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x64\ZlibDllRelease\zlibwapi.lib"
+				OutputFile="$(OutDir)/minizip.exe"
+				LinkIncremental="1"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="17"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Itanium"
+			OutputDirectory="ia64\$(ConfigurationName)"
+			IntermediateDirectory="ia64\$(ConfigurationName)"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;NDEBUG;_CONSOLE;WIN64"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="ia64\ZlibDllRelease\zlibwapi.lib"
+				OutputFile="$(OutDir)/minizip.exe"
+				LinkIncremental="1"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm"
+			>
+			<File
+				RelativePath="..\..\minizip\minizip.c"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;inc"
+			>
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+			>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/contrib/vstudio/vc8/testzlib.vcproj b/updater/zlib123/contrib/vstudio/vc8/testzlib.vcproj
new file mode 100644
index 0000000..68c3539
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc8/testzlib.vcproj
@@ -0,0 +1,948 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8,00"
+	Name="testzlib"
+	ProjectGUID="{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}"
+	RootNamespace="testzlib"
+	Keyword="Win32Proj"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+		<Platform
+			Name="x64"
+		/>
+		<Platform
+			Name="Itanium"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="x86\TestZlib$(ConfigurationName)"
+			IntermediateDirectory="x86\TestZlib$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="ASMV;ASMINF;WIN32;ZLIB_WINAPI;_DEBUG;_CONSOLE;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="1"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerOutput="4"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="..\..\masmx86\gvmat32.obj ..\..\masmx86\inffas32.obj"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/testzlib.pdb"
+				SubSystem="1"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|x64"
+			OutputDirectory="x64\TestZlib$(ConfigurationName)"
+			IntermediateDirectory="x64\TestZlib$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="ASMV;ASMINF;WIN32;ZLIB_WINAPI;_DEBUG;_CONSOLE;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				AssemblerListingLocation="$(IntDir)\"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="..\..\masmx64\gvmat64.obj ..\..\masmx64\inffasx64.obj"
+				GenerateManifest="false"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|Itanium"
+			OutputDirectory="ia64\TestZlib$(ConfigurationName)"
+			IntermediateDirectory="ia64\TestZlib$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="ZLIB_WINAPI;_DEBUG;_CONSOLE;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;WIN64"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerOutput="4"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/testzlib.pdb"
+				SubSystem="1"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|Win32"
+			OutputDirectory="x86\TestZlib$(ConfigurationName)"
+			IntermediateDirectory="x86\TestZlib$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			CharacterSet="2"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;NDEBUG;_CONSOLE;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="0"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="1"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|x64"
+			OutputDirectory="x64\TestZlib$(ConfigurationName)"
+			IntermediateDirectory="x64\TestZlib$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;NDEBUG;_CONSOLE;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				AssemblerListingLocation="$(IntDir)\"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies=""
+				GenerateManifest="false"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|Itanium"
+			OutputDirectory="ia64\TestZlib$(ConfigurationName)"
+			IntermediateDirectory="ia64\TestZlib$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			CharacterSet="2"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="ZLIB_WINAPI;NDEBUG;_CONSOLE;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;WIN64"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="1"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="x86\TestZlib$(ConfigurationName)"
+			IntermediateDirectory="x86\TestZlib$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			CharacterSet="2"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="ASMV;ASMINF;WIN32;ZLIB_WINAPI;NDEBUG;_CONSOLE;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="0"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="..\..\masmx86\gvmat32.obj ..\..\masmx86\inffas32.obj"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="1"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|x64"
+			OutputDirectory="x64\TestZlib$(ConfigurationName)"
+			IntermediateDirectory="x64\TestZlib$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="ASMV;ASMINF;WIN32;ZLIB_WINAPI;NDEBUG;_CONSOLE;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				AssemblerListingLocation="$(IntDir)\"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="..\..\masmx64\gvmat64.obj ..\..\masmx64\inffasx64.obj"
+				GenerateManifest="false"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Itanium"
+			OutputDirectory="ia64\TestZlib$(ConfigurationName)"
+			IntermediateDirectory="ia64\TestZlib$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			CharacterSet="2"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\.."
+				PreprocessorDefinitions="ZLIB_WINAPI;NDEBUG;_CONSOLE;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;WIN64"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="1"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm"
+			>
+			<File
+				RelativePath="..\..\..\adler32.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\compress.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\crc32.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\deflate.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\masmx86\gvmat32c.c"
+				>
+				<FileConfiguration
+					Name="Debug|x64"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|x64"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|x64"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Win64 (AMD64)"
+					ExcludedFromBuild="TRUE"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win64 (AMD64)"
+					ExcludedFromBuild="TRUE"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseAsm|Win64 (AMD64)"
+					ExcludedFromBuild="TRUE"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="..\..\..\infback.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\masmx64\inffas8664.c"
+				>
+				<FileConfiguration
+					Name="Debug|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="..\..\..\inffast.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\inflate.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\inftrees.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\testzlib\testzlib.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\trees.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\uncompr.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\zutil.c"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;inc"
+			>
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+			>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/contrib/vstudio/vc8/testzlibdll.vcproj b/updater/zlib123/contrib/vstudio/vc8/testzlibdll.vcproj
new file mode 100644
index 0000000..f38ab5e
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc8/testzlibdll.vcproj
@@ -0,0 +1,567 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8,00"
+	Name="TestZlibDll"
+	ProjectGUID="{C52F9E7B-498A-42BE-8DB4-85A15694366A}"
+	Keyword="Win32Proj"
+	SignManifests="true"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+		<Platform
+			Name="x64"
+		/>
+		<Platform
+			Name="Itanium"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="x86\TestZlibDll$(ConfigurationName)"
+			IntermediateDirectory="x86\TestZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="WIN32;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;_DEBUG;_CONSOLE"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="1"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x86\ZlibDllDebug\zlibwapi.lib"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/testzlib.pdb"
+				SubSystem="1"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|x64"
+			OutputDirectory="x64\TestZlibDll$(ConfigurationName)"
+			IntermediateDirectory="x64\TestZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;_DEBUG;_CONSOLE;WIN64"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x64\ZlibDllDebug\zlibwapi.lib"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/testzlib.pdb"
+				SubSystem="1"
+				TargetMachine="17"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|Itanium"
+			OutputDirectory="ia64\TestZlibDll$(ConfigurationName)"
+			IntermediateDirectory="ia64\TestZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;_DEBUG;_CONSOLE;WIN64"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="ia64\ZlibDllDebug\zlibwapi.lib"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="2"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/testzlib.pdb"
+				SubSystem="1"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="x86\TestZlibDll$(ConfigurationName)"
+			IntermediateDirectory="x86\TestZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="WIN32;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;NDEBUG;_CONSOLE"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="0"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x86\ZlibDllRelease\zlibwapi.lib"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="1"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|x64"
+			OutputDirectory="x64\TestZlibDll$(ConfigurationName)"
+			IntermediateDirectory="x64\TestZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;NDEBUG;_CONSOLE;WIN64"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="x64\ZlibDllRelease\zlibwapi.lib"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="1"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="17"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Itanium"
+			OutputDirectory="ia64\TestZlibDll$(ConfigurationName)"
+			IntermediateDirectory="ia64\TestZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="1"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				OmitFramePointers="true"
+				AdditionalIncludeDirectories="..\..\..;..\..\minizip"
+				PreprocessorDefinitions="_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;NDEBUG;_CONSOLE;WIN64"
+				StringPooling="true"
+				BasicRuntimeChecks="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				UsePrecompiledHeader="0"
+				AssemblerListingLocation="$(IntDir)\"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="ia64\ZlibDllRelease\zlibwapi.lib"
+				OutputFile="$(OutDir)/testzlib.exe"
+				LinkIncremental="1"
+				GenerateManifest="false"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				OptimizeForWindows98="1"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm"
+			>
+			<File
+				RelativePath="..\..\testzlib\testzlib.c"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;inc"
+			>
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="rc;ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+			>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/contrib/vstudio/vc8/zlib.rc b/updater/zlib123/contrib/vstudio/vc8/zlib.rc
new file mode 100644
index 0000000..72cb8b4
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc8/zlib.rc
@@ -0,0 +1,32 @@
+#include <windows.h>
+
+#define IDR_VERSION1  1
+IDR_VERSION1	VERSIONINFO	MOVEABLE IMPURE LOADONCALL DISCARDABLE
+  FILEVERSION	 1,2,3,0
+  PRODUCTVERSION 1,2,3,0
+  FILEFLAGSMASK	VS_FFI_FILEFLAGSMASK
+  FILEFLAGS	0
+  FILEOS	VOS_DOS_WINDOWS32
+  FILETYPE	VFT_DLL
+  FILESUBTYPE	0	// not used
+BEGIN
+  BLOCK "StringFileInfo"
+  BEGIN
+    BLOCK "040904E4"
+    //language ID = U.S. English, char set = Windows, Multilingual
+
+    BEGIN
+      VALUE "FileDescription", "zlib data compression library\0"
+      VALUE "FileVersion",	"1.2.3.0\0"
+      VALUE "InternalName",	"zlib\0"
+      VALUE "OriginalFilename",	"zlib.dll\0"
+      VALUE "ProductName",	"ZLib.DLL\0"
+      VALUE "Comments","DLL support by Alessandro Iacopetti & Gilles Vollant\0"
+      VALUE "LegalCopyright", "(C) 1995-2003 Jean-loup Gailly & Mark Adler\0"
+    END
+  END
+  BLOCK "VarFileInfo"
+  BEGIN
+    VALUE "Translation", 0x0409, 1252
+  END
+END
diff --git a/updater/zlib123/contrib/vstudio/vc8/zlibstat.vcproj b/updater/zlib123/contrib/vstudio/vc8/zlibstat.vcproj
new file mode 100644
index 0000000..fb97037
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc8/zlibstat.vcproj
@@ -0,0 +1,870 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8,00"
+	Name="zlibstat"
+	ProjectGUID="{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+		<Platform
+			Name="x64"
+		/>
+		<Platform
+			Name="Itanium"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="x86\ZlibStat$(ConfigurationName)"
+			IntermediateDirectory="x86\ZlibStat$(ConfigurationName)\Tmp"
+			ConfigurationType="4"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE"
+				ExceptionHandling="0"
+				RuntimeLibrary="1"
+				BufferSecurityCheck="false"
+				PrecompiledHeaderFile="$(IntDir)/zlibstat.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="1"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/MACHINE:X86 /NODEFAULTLIB"
+				OutputFile="$(OutDir)\zlibstat.lib"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|x64"
+			OutputDirectory="x64\ZlibStat$(ConfigurationName)"
+			IntermediateDirectory="x64\ZlibStat$(ConfigurationName)\Tmp"
+			ConfigurationType="4"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="ZLIB_WINAPI;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;WIN64"
+				ExceptionHandling="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				PrecompiledHeaderFile="$(IntDir)/zlibstat.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="1"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/MACHINE:AMD64 /NODEFAULTLIB"
+				OutputFile="$(OutDir)\zlibstat.lib"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|Itanium"
+			OutputDirectory="ia64\ZlibStat$(ConfigurationName)"
+			IntermediateDirectory="ia64\ZlibStat$(ConfigurationName)\Tmp"
+			ConfigurationType="4"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="ZLIB_WINAPI;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;WIN64"
+				ExceptionHandling="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				PrecompiledHeaderFile="$(IntDir)/zlibstat.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="1"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/MACHINE:IA64 /NODEFAULTLIB"
+				OutputFile="$(OutDir)\zlibstat.lib"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="x86\ZlibStat$(ConfigurationName)"
+			IntermediateDirectory="x86\ZlibStat$(ConfigurationName)\Tmp"
+			ConfigurationType="4"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ASMV;ASMINF"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="0"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibstat.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/MACHINE:X86 /NODEFAULTLIB"
+				AdditionalDependencies="..\..\masmx86\gvmat32.obj ..\..\masmx86\inffas32.obj "
+				OutputFile="$(OutDir)\zlibstat.lib"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|x64"
+			OutputDirectory="x64\ZlibStat$(ConfigurationName)"
+			IntermediateDirectory="x64\ZlibStat$(ConfigurationName)\Tmp"
+			ConfigurationType="4"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="ZLIB_WINAPI;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;ASMV;ASMINF;WIN64"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibstat.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/MACHINE:AMD64 /NODEFAULTLIB"
+				AdditionalDependencies="..\..\masmx64\gvmat64.obj ..\..\masmx64\inffasx64.obj "
+				OutputFile="$(OutDir)\zlibstat.lib"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Itanium"
+			OutputDirectory="ia64\ZlibStat$(ConfigurationName)"
+			IntermediateDirectory="ia64\ZlibStat$(ConfigurationName)\Tmp"
+			ConfigurationType="4"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="ZLIB_WINAPI;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;WIN64"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibstat.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/MACHINE:IA64 /NODEFAULTLIB"
+				OutputFile="$(OutDir)\zlibstat.lib"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|Win32"
+			OutputDirectory="x86\ZlibStat$(ConfigurationName)"
+			IntermediateDirectory="x86\ZlibStat$(ConfigurationName)\Tmp"
+			ConfigurationType="4"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32;ZLIB_WINAPI;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="0"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibstat.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/MACHINE:X86 /NODEFAULTLIB"
+				OutputFile="$(OutDir)\zlibstat.lib"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|x64"
+			OutputDirectory="x64\ZlibStat$(ConfigurationName)"
+			IntermediateDirectory="x64\ZlibStat$(ConfigurationName)\Tmp"
+			ConfigurationType="4"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="3"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="ZLIB_WINAPI;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;WIN64"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibstat.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/MACHINE:AMD64 /NODEFAULTLIB"
+				OutputFile="$(OutDir)\zlibstat.lib"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|Itanium"
+			OutputDirectory="ia64\ZlibStat$(ConfigurationName)"
+			IntermediateDirectory="ia64\ZlibStat$(ConfigurationName)\Tmp"
+			ConfigurationType="4"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TargetEnvironment="2"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="ZLIB_WINAPI;_CRT_NONSTDC_NO_DEPRECATE;_CRT_SECURE_NO_DEPRECATE;WIN64"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibstat.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLibrarianTool"
+				AdditionalOptions="/MACHINE:IA64 /NODEFAULTLIB"
+				OutputFile="$(OutDir)\zlibstat.lib"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			>
+			<File
+				RelativePath="..\..\..\adler32.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\compress.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\crc32.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\deflate.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\masmx86\gvmat32c.c"
+				>
+				<FileConfiguration
+					Name="Debug|x64"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|x64"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|x64"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="..\..\..\gzio.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\infback.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\masmx64\inffas8664.c"
+				>
+				<FileConfiguration
+					Name="Debug|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="..\..\..\inffast.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\inflate.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\inftrees.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\minizip\ioapi.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\trees.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\uncompr.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\minizip\unzip.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\minizip\zip.c"
+				>
+			</File>
+			<File
+				RelativePath=".\zlib.rc"
+				>
+			</File>
+			<File
+				RelativePath=".\zlibvc.def"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\zutil.c"
+				>
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/contrib/vstudio/vc8/zlibvc.def b/updater/zlib123/contrib/vstudio/vc8/zlibvc.def
new file mode 100644
index 0000000..a40e715
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc8/zlibvc.def
@@ -0,0 +1,92 @@
+
+VERSION		1.23
+
+HEAPSIZE	1048576,8192
+
+EXPORTS
+        adler32                                  @1
+        compress                                 @2
+        crc32                                    @3
+        deflate                                  @4
+        deflateCopy                              @5
+        deflateEnd                               @6
+        deflateInit2_                            @7
+        deflateInit_                             @8
+        deflateParams                            @9
+        deflateReset                             @10
+        deflateSetDictionary                     @11
+        gzclose                                  @12
+        gzdopen                                  @13
+        gzerror                                  @14
+        gzflush                                  @15
+        gzopen                                   @16
+        gzread                                   @17
+        gzwrite                                  @18
+        inflate                                  @19
+        inflateEnd                               @20
+        inflateInit2_                            @21
+        inflateInit_                             @22
+        inflateReset                             @23
+        inflateSetDictionary                     @24
+        inflateSync                              @25
+        uncompress                               @26
+        zlibVersion                              @27
+        gzprintf                                 @28
+        gzputc                                   @29
+        gzgetc                                   @30
+        gzseek                                   @31
+        gzrewind                                 @32
+        gztell                                   @33
+        gzeof                                    @34
+        gzsetparams                              @35
+        zError                                   @36
+        inflateSyncPoint                         @37
+        get_crc_table                            @38
+        compress2                                @39
+        gzputs                                   @40
+        gzgets                                   @41
+        inflateCopy                              @42
+        inflateBackInit_                         @43
+        inflateBack                              @44
+        inflateBackEnd                           @45
+        compressBound                            @46
+        deflateBound                             @47
+        gzclearerr                               @48
+        gzungetc                                 @49
+        zlibCompileFlags                         @50
+        deflatePrime                             @51
+
+        unzOpen                                  @61
+        unzClose                                 @62
+        unzGetGlobalInfo                         @63
+        unzGetCurrentFileInfo                    @64
+        unzGoToFirstFile                         @65
+        unzGoToNextFile                          @66
+        unzOpenCurrentFile                       @67
+        unzReadCurrentFile                       @68
+        unzOpenCurrentFile3                      @69
+        unztell                                  @70
+        unzeof                                   @71
+        unzCloseCurrentFile                      @72
+        unzGetGlobalComment                      @73
+        unzStringFileNameCompare                 @74
+        unzLocateFile                            @75
+        unzGetLocalExtrafield                    @76
+        unzOpen2                                 @77
+        unzOpenCurrentFile2                      @78
+        unzOpenCurrentFilePassword               @79
+
+        zipOpen                                  @80
+        zipOpenNewFileInZip                      @81
+        zipWriteInFileInZip                      @82
+        zipCloseFileInZip                        @83
+        zipClose                                 @84
+        zipOpenNewFileInZip2                     @86
+        zipCloseFileInZipRaw                     @87
+        zipOpen2                                 @88
+        zipOpenNewFileInZip3                     @89
+
+        unzGetFilePos                            @100
+        unzGoToFilePos                           @101
+
+        fill_win32_filefunc                      @110
diff --git a/updater/zlib123/contrib/vstudio/vc8/zlibvc.sln b/updater/zlib123/contrib/vstudio/vc8/zlibvc.sln
new file mode 100644
index 0000000..a815a55
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc8/zlibvc.sln
@@ -0,0 +1,144 @@
+
+Microsoft Visual Studio Solution File, Format Version 9.00
+# Visual Studio 2005
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "zlibvc", "zlibvc.vcproj", "{8FD826F8-3739-44E6-8CC8-997122E53B8D}"
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "zlibstat", "zlibstat.vcproj", "{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}"
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "testzlib", "testzlib.vcproj", "{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}"
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "TestZlibDll", "testzlibdll.vcproj", "{C52F9E7B-498A-42BE-8DB4-85A15694366A}"
+	ProjectSection(ProjectDependencies) = postProject
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D} = {8FD826F8-3739-44E6-8CC8-997122E53B8D}
+	EndProjectSection
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "minizip", "minizip.vcproj", "{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}"
+	ProjectSection(ProjectDependencies) = postProject
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D} = {8FD826F8-3739-44E6-8CC8-997122E53B8D}
+	EndProjectSection
+EndProject
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "miniunz", "miniunz.vcproj", "{C52F9E7B-498A-42BE-8DB4-85A15694382A}"
+	ProjectSection(ProjectDependencies) = postProject
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D} = {8FD826F8-3739-44E6-8CC8-997122E53B8D}
+	EndProjectSection
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Itanium = Debug|Itanium
+		Debug|Win32 = Debug|Win32
+		Debug|x64 = Debug|x64
+		Release|Itanium = Release|Itanium
+		Release|Win32 = Release|Win32
+		Release|x64 = Release|x64
+		ReleaseWithoutAsm|Itanium = ReleaseWithoutAsm|Itanium
+		ReleaseWithoutAsm|Win32 = ReleaseWithoutAsm|Win32
+		ReleaseWithoutAsm|x64 = ReleaseWithoutAsm|x64
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Debug|Itanium.ActiveCfg = Debug|Itanium
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Debug|Itanium.Build.0 = Debug|Itanium
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Debug|Win32.ActiveCfg = Debug|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Debug|Win32.Build.0 = Debug|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Debug|x64.ActiveCfg = Debug|x64
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Debug|x64.Build.0 = Debug|x64
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Release|Itanium.ActiveCfg = Release|Itanium
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Release|Itanium.Build.0 = Release|Itanium
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Release|Win32.ActiveCfg = Release|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Release|Win32.Build.0 = Release|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Release|x64.ActiveCfg = ReleaseWithoutAsm|x64
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.Release|x64.Build.0 = ReleaseWithoutAsm|x64
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseWithoutAsm|Itanium.ActiveCfg = ReleaseWithoutAsm|Itanium
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseWithoutAsm|Itanium.Build.0 = ReleaseWithoutAsm|Itanium
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseWithoutAsm|Win32.ActiveCfg = ReleaseWithoutAsm|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseWithoutAsm|Win32.Build.0 = ReleaseWithoutAsm|Win32
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseWithoutAsm|x64.ActiveCfg = ReleaseWithoutAsm|x64
+		{8FD826F8-3739-44E6-8CC8-997122E53B8D}.ReleaseWithoutAsm|x64.Build.0 = ReleaseWithoutAsm|x64
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Debug|Itanium.ActiveCfg = Debug|Itanium
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Debug|Itanium.Build.0 = Debug|Itanium
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Debug|Win32.ActiveCfg = Debug|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Debug|Win32.Build.0 = Debug|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Debug|x64.ActiveCfg = Debug|x64
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Debug|x64.Build.0 = Debug|x64
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Release|Itanium.ActiveCfg = Release|Itanium
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Release|Itanium.Build.0 = Release|Itanium
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Release|Win32.ActiveCfg = Release|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Release|Win32.Build.0 = Release|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Release|x64.ActiveCfg = Release|x64
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.Release|x64.Build.0 = Release|x64
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseWithoutAsm|Itanium.ActiveCfg = ReleaseWithoutAsm|Itanium
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseWithoutAsm|Itanium.Build.0 = ReleaseWithoutAsm|Itanium
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseWithoutAsm|Win32.ActiveCfg = ReleaseWithoutAsm|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseWithoutAsm|Win32.Build.0 = ReleaseWithoutAsm|Win32
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseWithoutAsm|x64.ActiveCfg = ReleaseWithoutAsm|x64
+		{745DEC58-EBB3-47A9-A9B8-4C6627C01BF8}.ReleaseWithoutAsm|x64.Build.0 = ReleaseWithoutAsm|x64
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Debug|Itanium.ActiveCfg = Debug|Itanium
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Debug|Itanium.Build.0 = Debug|Itanium
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Debug|Win32.ActiveCfg = Debug|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Debug|Win32.Build.0 = Debug|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Debug|x64.ActiveCfg = Debug|x64
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Debug|x64.Build.0 = Debug|x64
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Release|Itanium.ActiveCfg = Release|Itanium
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Release|Itanium.Build.0 = Release|Itanium
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Release|Win32.ActiveCfg = Release|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Release|Win32.Build.0 = Release|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Release|x64.ActiveCfg = Release|x64
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.Release|x64.Build.0 = Release|x64
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm|Itanium.ActiveCfg = ReleaseWithoutAsm|Itanium
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm|Itanium.Build.0 = ReleaseWithoutAsm|Itanium
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm|Win32.ActiveCfg = ReleaseWithoutAsm|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm|Win32.Build.0 = ReleaseWithoutAsm|Win32
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm|x64.ActiveCfg = ReleaseWithoutAsm|x64
+		{AA6666AA-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm|x64.Build.0 = ReleaseWithoutAsm|x64
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Debug|Itanium.ActiveCfg = Debug|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Debug|Itanium.Build.0 = Debug|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Debug|Win32.ActiveCfg = Debug|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Debug|Win32.Build.0 = Debug|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Debug|x64.ActiveCfg = Debug|x64
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Debug|x64.Build.0 = Debug|x64
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Release|Itanium.ActiveCfg = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Release|Itanium.Build.0 = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Release|Win32.ActiveCfg = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Release|Win32.Build.0 = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Release|x64.ActiveCfg = Release|x64
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.Release|x64.Build.0 = Release|x64
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.ReleaseWithoutAsm|Itanium.ActiveCfg = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.ReleaseWithoutAsm|Itanium.Build.0 = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.ReleaseWithoutAsm|Win32.ActiveCfg = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694366A}.ReleaseWithoutAsm|x64.ActiveCfg = Release|Itanium
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Debug|Itanium.ActiveCfg = Debug|Itanium
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Debug|Itanium.Build.0 = Debug|Itanium
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Debug|Win32.ActiveCfg = Debug|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Debug|Win32.Build.0 = Debug|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Debug|x64.ActiveCfg = Debug|x64
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Debug|x64.Build.0 = Debug|x64
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Release|Itanium.ActiveCfg = Release|Itanium
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Release|Itanium.Build.0 = Release|Itanium
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Release|Win32.ActiveCfg = Release|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Release|Win32.Build.0 = Release|Win32
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Release|x64.ActiveCfg = Release|x64
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.Release|x64.Build.0 = Release|x64
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm|Itanium.ActiveCfg = Release|Itanium
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm|Itanium.Build.0 = Release|Itanium
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm|Win32.ActiveCfg = Release|Itanium
+		{48CDD9DC-E09F-4135-9C0C-4FE50C3C654B}.ReleaseWithoutAsm|x64.ActiveCfg = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Debug|Itanium.ActiveCfg = Debug|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Debug|Itanium.Build.0 = Debug|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Debug|Win32.ActiveCfg = Debug|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Debug|Win32.Build.0 = Debug|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Debug|x64.ActiveCfg = Debug|x64
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Debug|x64.Build.0 = Debug|x64
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Release|Itanium.ActiveCfg = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Release|Itanium.Build.0 = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Release|Win32.ActiveCfg = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Release|Win32.Build.0 = Release|Win32
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Release|x64.ActiveCfg = Release|x64
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.Release|x64.Build.0 = Release|x64
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.ReleaseWithoutAsm|Itanium.ActiveCfg = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.ReleaseWithoutAsm|Itanium.Build.0 = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.ReleaseWithoutAsm|Win32.ActiveCfg = Release|Itanium
+		{C52F9E7B-498A-42BE-8DB4-85A15694382A}.ReleaseWithoutAsm|x64.ActiveCfg = Release|Itanium
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/updater/zlib123/contrib/vstudio/vc8/zlibvc.vcproj b/updater/zlib123/contrib/vstudio/vc8/zlibvc.vcproj
new file mode 100644
index 0000000..e717011
--- /dev/null
+++ b/updater/zlib123/contrib/vstudio/vc8/zlibvc.vcproj
@@ -0,0 +1,1219 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8,00"
+	Name="zlibvc"
+	ProjectGUID="{8FD826F8-3739-44E6-8CC8-997122E53B8D}"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+		<Platform
+			Name="x64"
+		/>
+		<Platform
+			Name="Itanium"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="x86\ZlibDll$(ConfigurationName)"
+			IntermediateDirectory="x86\ZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="2"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="_DEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="1"
+				TypeLibraryName="$(OutDir)/zlibvc.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32,_CRT_SECURE_NO_DEPRECATE,ZLIB_WINAPI,ASMV,ASMINF"
+				ExceptionHandling="0"
+				RuntimeLibrary="1"
+				BufferSecurityCheck="false"
+				PrecompiledHeaderFile="$(IntDir)/zlibvc.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				BrowseInformation="0"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalOptions="/MACHINE:I386"
+				AdditionalDependencies="..\..\masmx86\gvmat32.obj ..\..\masmx86\inffas32.obj"
+				OutputFile="$(OutDir)\zlibwapi.dll"
+				LinkIncremental="2"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				ModuleDefinitionFile=".\zlibvc.def"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/zlibwapi.pdb"
+				GenerateMapFile="true"
+				MapFileName="$(OutDir)/zlibwapi.map"
+				SubSystem="2"
+				ImportLibrary="$(OutDir)/zlibwapi.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|x64"
+			OutputDirectory="x64\ZlibDll$(ConfigurationName)"
+			IntermediateDirectory="x64\ZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="2"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="_DEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="3"
+				TypeLibraryName="$(OutDir)/zlibvc.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32,_CRT_SECURE_NO_DEPRECATE,ZLIB_WINAPI,ASMV,ASMINF;WIN64"
+				ExceptionHandling="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				PrecompiledHeaderFile="$(IntDir)/zlibvc.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				BrowseInformation="0"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="..\..\masmx64\gvmat64.obj ..\..\masmx64\inffasx64.obj "
+				OutputFile="$(OutDir)\zlibwapi.dll"
+				LinkIncremental="2"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				ModuleDefinitionFile=".\zlibvc.def"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/zlibwapi.pdb"
+				GenerateMapFile="true"
+				MapFileName="$(OutDir)/zlibwapi.map"
+				SubSystem="2"
+				ImportLibrary="$(OutDir)/zlibwapi.lib"
+				TargetMachine="17"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Debug|Itanium"
+			OutputDirectory="ia64\ZlibDll$(ConfigurationName)"
+			IntermediateDirectory="ia64\ZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="2"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="_DEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="2"
+				TypeLibraryName="$(OutDir)/zlibvc.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;WIN64"
+				ExceptionHandling="0"
+				RuntimeLibrary="3"
+				BufferSecurityCheck="false"
+				PrecompiledHeaderFile="$(IntDir)/zlibvc.pch"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				BrowseInformation="0"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)\zlibwapi.dll"
+				LinkIncremental="2"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				ModuleDefinitionFile=".\zlibvc.def"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/zlibwapi.pdb"
+				GenerateMapFile="true"
+				MapFileName="$(OutDir)/zlibwapi.map"
+				SubSystem="2"
+				ImportLibrary="$(OutDir)/zlibwapi.lib"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|Win32"
+			OutputDirectory="x86\ZlibDll$(ConfigurationName)"
+			IntermediateDirectory="x86\ZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="2"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="1"
+				TypeLibraryName="$(OutDir)/zlibvc.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32,_CRT_SECURE_NO_DEPRECATE,ZLIB_WINAPI"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibvc.pch"
+				AssemblerOutput="2"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				BrowseInformation="0"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalOptions="/MACHINE:I386"
+				OutputFile="$(OutDir)\zlibwapi.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				IgnoreAllDefaultLibraries="false"
+				ModuleDefinitionFile=".\zlibvc.def"
+				ProgramDatabaseFile="$(OutDir)/zlibwapi.pdb"
+				GenerateMapFile="true"
+				MapFileName="$(OutDir)/zlibwapi.map"
+				SubSystem="2"
+				OptimizeForWindows98="1"
+				ImportLibrary="$(OutDir)/zlibwapi.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|x64"
+			OutputDirectory="x64\ZlibDll$(ConfigurationName)"
+			IntermediateDirectory="x64\ZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="2"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="3"
+				TypeLibraryName="$(OutDir)/zlibvc.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32,_CRT_SECURE_NO_DEPRECATE,ZLIB_WINAPI;WIN64"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibvc.pch"
+				AssemblerOutput="2"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				BrowseInformation="0"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)\zlibwapi.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				IgnoreAllDefaultLibraries="false"
+				ModuleDefinitionFile=".\zlibvc.def"
+				ProgramDatabaseFile="$(OutDir)/zlibwapi.pdb"
+				GenerateMapFile="true"
+				MapFileName="$(OutDir)/zlibwapi.map"
+				SubSystem="2"
+				OptimizeForWindows98="1"
+				ImportLibrary="$(OutDir)/zlibwapi.lib"
+				TargetMachine="17"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="ReleaseWithoutAsm|Itanium"
+			OutputDirectory="ia64\ZlibDll$(ConfigurationName)"
+			IntermediateDirectory="ia64\ZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="2"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="2"
+				TypeLibraryName="$(OutDir)/zlibvc.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32,_CRT_SECURE_NO_DEPRECATE,ZLIB_WINAPI;WIN64"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibvc.pch"
+				AssemblerOutput="2"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				BrowseInformation="0"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)\zlibwapi.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				IgnoreAllDefaultLibraries="false"
+				ModuleDefinitionFile=".\zlibvc.def"
+				ProgramDatabaseFile="$(OutDir)/zlibwapi.pdb"
+				GenerateMapFile="true"
+				MapFileName="$(OutDir)/zlibwapi.map"
+				SubSystem="2"
+				OptimizeForWindows98="1"
+				ImportLibrary="$(OutDir)/zlibwapi.lib"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="x86\ZlibDll$(ConfigurationName)"
+			IntermediateDirectory="x86\ZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="2"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="1"
+				TypeLibraryName="$(OutDir)/zlibvc.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="WIN32;_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;ASMV;ASMINF"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibvc.pch"
+				AssemblerOutput="2"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				BrowseInformation="0"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalOptions="/MACHINE:I386"
+				AdditionalDependencies="..\..\masmx86\gvmat32.obj ..\..\masmx86\inffas32.obj "
+				OutputFile="$(OutDir)\zlibwapi.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				IgnoreAllDefaultLibraries="false"
+				ModuleDefinitionFile=".\zlibvc.def"
+				ProgramDatabaseFile="$(OutDir)/zlibwapi.pdb"
+				GenerateMapFile="true"
+				MapFileName="$(OutDir)/zlibwapi.map"
+				SubSystem="2"
+				OptimizeForWindows98="1"
+				ImportLibrary="$(OutDir)/zlibwapi.lib"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|x64"
+			OutputDirectory="x64\ZlibDll$(ConfigurationName)"
+			IntermediateDirectory="x64\ZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="2"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="3"
+				TypeLibraryName="$(OutDir)/zlibvc.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;ASMV;ASMINF;WIN64"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibvc.pch"
+				AssemblerOutput="2"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				BrowseInformation="0"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="..\..\masmx64\gvmat64.obj ..\..\masmx64\inffasx64.obj "
+				OutputFile="$(OutDir)\zlibwapi.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				IgnoreAllDefaultLibraries="false"
+				ModuleDefinitionFile=".\zlibvc.def"
+				ProgramDatabaseFile="$(OutDir)/zlibwapi.pdb"
+				GenerateMapFile="true"
+				MapFileName="$(OutDir)/zlibwapi.map"
+				SubSystem="2"
+				OptimizeForWindows98="1"
+				ImportLibrary="$(OutDir)/zlibwapi.lib"
+				TargetMachine="17"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Itanium"
+			OutputDirectory="ia64\ZlibDll$(ConfigurationName)"
+			IntermediateDirectory="ia64\ZlibDll$(ConfigurationName)\Tmp"
+			ConfigurationType="2"
+			InheritedPropertySheets="UpgradeFromVC70.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			WholeProgramOptimization="1"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				PreprocessorDefinitions="NDEBUG"
+				MkTypLibCompatible="true"
+				SuppressStartupBanner="true"
+				TargetEnvironment="2"
+				TypeLibraryName="$(OutDir)/zlibvc.tlb"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="..\..\..;..\..\masmx86"
+				PreprocessorDefinitions="_CRT_SECURE_NO_DEPRECATE;ZLIB_WINAPI;WIN64"
+				StringPooling="true"
+				ExceptionHandling="0"
+				RuntimeLibrary="2"
+				BufferSecurityCheck="false"
+				EnableFunctionLevelLinking="true"
+				PrecompiledHeaderFile="$(IntDir)/zlibvc.pch"
+				AssemblerOutput="2"
+				AssemblerListingLocation="$(IntDir)\"
+				ObjectFile="$(IntDir)\"
+				ProgramDataBaseFileName="$(OutDir)\"
+				BrowseInformation="0"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1036"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)\zlibwapi.dll"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				GenerateManifest="false"
+				IgnoreAllDefaultLibraries="false"
+				ModuleDefinitionFile=".\zlibvc.def"
+				ProgramDatabaseFile="$(OutDir)/zlibwapi.pdb"
+				GenerateMapFile="true"
+				MapFileName="$(OutDir)/zlibwapi.map"
+				SubSystem="2"
+				OptimizeForWindows98="1"
+				ImportLibrary="$(OutDir)/zlibwapi.lib"
+				TargetMachine="5"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCWebDeploymentTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;rc;def;r;odl;hpj;bat;for;f90"
+			>
+			<File
+				RelativePath="..\..\..\adler32.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\compress.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\crc32.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\deflate.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\masmx86\gvmat32c.c"
+				>
+				<FileConfiguration
+					Name="Debug|x64"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|x64"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|x64"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="..\..\..\gzio.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\infback.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\masmx64\inffas8664.c"
+				>
+				<FileConfiguration
+					Name="Debug|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Debug|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="ReleaseWithoutAsm|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Itanium"
+					ExcludedFromBuild="true"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="..\..\..\inffast.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\inflate.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\inftrees.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\minizip\ioapi.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\minizip\iowin32.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\trees.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\uncompr.c"
+				>
+			</File>
+			<File
+				RelativePath="..\..\minizip\unzip.c"
+				>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						AdditionalIncludeDirectories=""
+						PreprocessorDefinitions="ZLIB_INTERNAL"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|x64"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						AdditionalIncludeDirectories=""
+						PreprocessorDefinitions="ZLIB_INTERNAL"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Itanium"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						AdditionalIncludeDirectories=""
+						PreprocessorDefinitions="ZLIB_INTERNAL"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath="..\..\minizip\zip.c"
+				>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						AdditionalIncludeDirectories=""
+						PreprocessorDefinitions="ZLIB_INTERNAL"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|x64"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						AdditionalIncludeDirectories=""
+						PreprocessorDefinitions="ZLIB_INTERNAL"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Itanium"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						AdditionalIncludeDirectories=""
+						PreprocessorDefinitions="ZLIB_INTERNAL"
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath=".\zlib.rc"
+				>
+			</File>
+			<File
+				RelativePath=".\zlibvc.def"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\zutil.c"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl;fi;fd"
+			>
+			<File
+				RelativePath="..\..\..\deflate.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\infblock.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\infcodes.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\inffast.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\inftrees.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\infutil.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\zconf.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\zlib.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\zutil.h"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Resource Files"
+			Filter="ico;cur;bmp;dlg;rc2;rct;bin;cnt;rtf;gif;jpg;jpeg;jpe"
+			>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/updater/zlib123/crc32.c b/updater/zlib123/crc32.c
new file mode 100644
index 0000000..abe4d67
--- /dev/null
+++ b/updater/zlib123/crc32.c
@@ -0,0 +1,407 @@
+/* crc32.c -- compute the CRC-32 of a data stream
+ * Copyright (C) 1995-2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ *
+ * Thanks to Rodney Brown <rbrown64@csc.com.au> for his contribution of faster
+ * CRC methods: exclusive-oring 32 bits of data at a time, and pre-computing
+ * tables for updating the shift register in one step with three exclusive-ors
+ * instead of four steps with four exclusive-ors.  This results in about a
+ * factor of two increase in speed on a Power PC G4 (PPC7455) using gcc -O3.
+ */
+
+/* @(#) $Id$ */
+
+/*
+  Note on the use of DYNAMIC_CRC_TABLE: there is no mutex or semaphore
+  protection on the static variables used to control the first-use generation
+  of the crc tables.  Therefore, if you #define DYNAMIC_CRC_TABLE, you should
+  first call get_crc_table() to initialize the tables before allowing more than
+  one thread to use crc32().
+ */
+
+#ifdef MAKECRCH
+#  include <stdio.h>
+#  ifndef DYNAMIC_CRC_TABLE
+#    define DYNAMIC_CRC_TABLE
+#  endif /* !DYNAMIC_CRC_TABLE */
+#endif /* MAKECRCH */
+
+#include "zutil.h"      /* for STDC and FAR definitions */
+
+#define local static
+
+/* Find a four-byte integer type for crc32_little() and crc32_big(). */
+#ifndef NOBYFOUR
+#  ifdef STDC           /* need ANSI C limits.h to determine sizes */
+#    include <limits.h>
+#    define BYFOUR
+#    if (UINT_MAX == 0xffffffffUL)
+       typedef unsigned int u4;
+#    else
+#      if (ULONG_MAX == 0xffffffffUL)
+         typedef unsigned long u4;
+#      else
+#        if (USHRT_MAX == 0xffffffffUL)
+           typedef unsigned short u4;
+#        else
+#          undef BYFOUR     /* can't find a four-byte integer type! */
+#        endif
+#      endif
+#    endif
+#  endif /* STDC */
+#endif /* !NOBYFOUR */
+
+/* Definitions for doing the crc four data bytes at a time. */
+#ifdef BYFOUR
+#  define REV(w) (((w)>>24)+(((w)>>8)&0xff00)+ \
+                (((w)&0xff00)<<8)+(((w)&0xff)<<24))
+   local unsigned long crc32_little OF((unsigned long,
+                        const unsigned char FAR *, unsigned));
+   local unsigned long crc32_big OF((unsigned long,
+                        const unsigned char FAR *, unsigned));
+#  define TBLS 8
+#else
+#  define TBLS 1
+#endif /* BYFOUR */
+
+/* Local functions for crc concatenation */
+local unsigned long gf2_matrix_times OF((unsigned long *mat,
+                                         unsigned long vec));
+local void gf2_matrix_square OF((unsigned long *square, unsigned long *mat));
+
+#ifdef DYNAMIC_CRC_TABLE
+
+local volatile int crc_table_empty = 1;
+local unsigned long FAR crc_table[TBLS][256];
+local void make_crc_table OF((void));
+#ifdef MAKECRCH
+   local void write_table OF((FILE *, const unsigned long FAR *));
+#endif /* MAKECRCH */
+/*
+  Generate tables for a byte-wise 32-bit CRC calculation on the polynomial:
+  x^32+x^26+x^23+x^22+x^16+x^12+x^11+x^10+x^8+x^7+x^5+x^4+x^2+x+1.
+
+  Polynomials over GF(2) are represented in binary, one bit per coefficient,
+  with the lowest powers in the most significant bit.  Then adding polynomials
+  is just exclusive-or, and multiplying a polynomial by x is a right shift by
+  one.  If we call the above polynomial p, and represent a byte as the
+  polynomial q, also with the lowest power in the most significant bit (so the
+  byte 0xb1 is the polynomial x^7+x^3+x+1), then the CRC is (q*x^32) mod p,
+  where a mod b means the remainder after dividing a by b.
+
+  This calculation is done using the shift-register method of multiplying and
+  taking the remainder.  The register is initialized to zero, and for each
+  incoming bit, x^32 is added mod p to the register if the bit is a one (where
+  x^32 mod p is p+x^32 = x^26+...+1), and the register is multiplied mod p by
+  x (which is shifting right by one and adding x^32 mod p if the bit shifted
+  out is a one).  We start with the highest power (least significant bit) of
+  q and repeat for all eight bits of q.
+
+  The first table is simply the CRC of all possible eight bit values.  This is
+  all the information needed to generate CRCs on data a byte at a time for all
+  combinations of CRC register values and incoming bytes.  The remaining tables
+  allow for word-at-a-time CRC calculation for both big-endian and little-
+  endian machines, where a word is four bytes.
+*/
+local void make_crc_table()
+{
+    unsigned long c;
+    int n, k;
+    unsigned long poly;                 /* polynomial exclusive-or pattern */
+    /* terms of polynomial defining this crc (except x^32): */
+    static volatile int first = 1;      /* flag to limit concurrent making */
+    static const unsigned char p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};
+
+    /* See if another task is already doing this (not thread-safe, but better
+       than nothing -- significantly reduces duration of vulnerability in
+       case the advice about DYNAMIC_CRC_TABLE is ignored) */
+    if (first) {
+        first = 0;
+
+        /* make exclusive-or pattern from polynomial (0xedb88320UL) */
+        poly = 0UL;
+        for (n = 0; n < sizeof(p)/sizeof(unsigned char); n++)
+            poly |= 1UL << (31 - p[n]);
+
+        /* generate a crc for every 8-bit value */
+        for (n = 0; n < 256; n++) {
+            c = (unsigned long)n;
+            for (k = 0; k < 8; k++)
+                c = c & 1 ? poly ^ (c >> 1) : c >> 1;
+            crc_table[0][n] = c;
+        }
+
+#ifdef BYFOUR
+        /* generate crc for each value followed by one, two, and three zeros,
+           and then the byte reversal of those as well as the first table */
+        for (n = 0; n < 256; n++) {
+            c = crc_table[0][n];
+            crc_table[4][n] = REV(c);
+            for (k = 1; k < 4; k++) {
+                c = crc_table[0][c & 0xff] ^ (c >> 8);
+                crc_table[k][n] = c;
+                crc_table[k + 4][n] = REV(c);
+            }
+        }
+#endif /* BYFOUR */
+
+        crc_table_empty = 0;
+    }
+    else {      /* not first */
+        /* wait for the other guy to finish (not efficient, but rare) */
+        while (crc_table_empty)
+            ;
+    }
+
+#ifdef MAKECRCH
+    /* write out CRC tables to crc32.h */
+    {
+        FILE *out;
+
+        out = fopen("crc32.h", "w");
+        if (out == NULL) return;
+        fprintf(out, "/* crc32.h -- tables for rapid CRC calculation\n");
+        fprintf(out, " * Generated automatically by crc32.c\n */\n\n");
+        fprintf(out, "local const unsigned long FAR ");
+        fprintf(out, "crc_table[TBLS][256] =\n{\n  {\n");
+        write_table(out, crc_table[0]);
+#  ifdef BYFOUR
+        fprintf(out, "#ifdef BYFOUR\n");
+        for (k = 1; k < 8; k++) {
+            fprintf(out, "  },\n  {\n");
+            write_table(out, crc_table[k]);
+        }
+        fprintf(out, "#endif\n");
+#  endif /* BYFOUR */
+        fprintf(out, "  }\n};\n");
+        fclose(out);
+    }
+#endif /* MAKECRCH */
+}
+
+#ifdef MAKECRCH
+local void write_table(out, table)
+    FILE *out;
+    const unsigned long FAR *table;
+{
+    int n;
+
+    for (n = 0; n < 256; n++)
+        fprintf(out, "%s0x%08lxUL%s", n % 5 ? "" : "    ", table[n],
+                n == 255 ? "\n" : (n % 5 == 4 ? ",\n" : ", "));
+}
+#endif /* MAKECRCH */
+
+#else /* !DYNAMIC_CRC_TABLE */
+/* ========================================================================
+ * Tables of CRC-32s of all single-byte values, made by make_crc_table().
+ */
+#include "crc32.h"
+#endif /* DYNAMIC_CRC_TABLE */
+
+/* =========================================================================
+ * This function can be used by asm versions of crc32()
+ */
+const unsigned long FAR * ZEXPORT get_crc_table()
+{
+#ifdef DYNAMIC_CRC_TABLE
+    if (crc_table_empty)
+        make_crc_table();
+#endif /* DYNAMIC_CRC_TABLE */
+    return (const unsigned long FAR *)crc_table;
+}
+
+/* ========================================================================= */
+#define DO1 crc = crc_table[0][((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8)
+#define DO8 DO1; DO1; DO1; DO1; DO1; DO1; DO1; DO1
+
+/* ========================================================================= */
+unsigned long ZEXPORT crc32(unsigned long crc, const unsigned char FAR *buf, unsigned len)
+{
+    if (buf == Z_NULL) return 0UL;
+
+#ifdef DYNAMIC_CRC_TABLE
+    if (crc_table_empty)
+        make_crc_table();
+#endif /* DYNAMIC_CRC_TABLE */
+
+#ifdef BYFOUR
+    if (sizeof(void *) == sizeof(ptrdiff_t)) {
+        u4 endian;
+
+        endian = 1;
+        if (*((unsigned char *)(&endian)))
+            return crc32_little(crc, buf, len);
+        else
+            return crc32_big(crc, buf, len);
+    }
+#endif /* BYFOUR */
+    crc = crc ^ 0xffffffffUL;
+    while (len >= 8) {
+        DO8;
+        len -= 8;
+    }
+    if (len) do {
+        DO1;
+    } while (--len);
+    return crc ^ 0xffffffffUL;
+}
+
+#ifdef BYFOUR
+
+/* ========================================================================= */
+#define DOLIT4 c ^= *buf4++; \
+        c = crc_table[3][c & 0xff] ^ crc_table[2][(c >> 8) & 0xff] ^ \
+            crc_table[1][(c >> 16) & 0xff] ^ crc_table[0][c >> 24]
+#define DOLIT32 DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4; DOLIT4
+
+/* ========================================================================= */
+local unsigned long crc32_little(unsigned long crc, const unsigned char FAR *buf, unsigned len) 
+{
+    register u4 c;
+    register const u4 FAR *buf4;
+
+    c = (u4)crc;
+    c = ~c;
+    while (len && ((ptrdiff_t)buf & 3)) {
+        c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);
+        len--;
+    }
+
+    buf4 = (const u4 FAR *)(const void FAR *)buf;
+    while (len >= 32) {
+        DOLIT32;
+        len -= 32;
+    }
+    while (len >= 4) {
+        DOLIT4;
+        len -= 4;
+    }
+    buf = (const unsigned char FAR *)buf4;
+
+    if (len) do {
+        c = crc_table[0][(c ^ *buf++) & 0xff] ^ (c >> 8);
+    } while (--len);
+    c = ~c;
+    return (unsigned long)c;
+}
+
+/* ========================================================================= */
+#define DOBIG4 c ^= *++buf4; \
+        c = crc_table[4][c & 0xff] ^ crc_table[5][(c >> 8) & 0xff] ^ \
+            crc_table[6][(c >> 16) & 0xff] ^ crc_table[7][c >> 24]
+#define DOBIG32 DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4; DOBIG4
+
+/* ========================================================================= */
+local unsigned long crc32_big(unsigned long crc, const unsigned char FAR *buf, unsigned len)
+{
+    register u4 c;
+    register const u4 FAR *buf4;
+
+    c = REV((u4)crc);
+    c = ~c;
+    while (len && ((ptrdiff_t)buf & 3)) {
+        c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);
+        len--;
+    }
+
+    buf4 = (const u4 FAR *)(const void FAR *)buf;
+    buf4--;
+    while (len >= 32) {
+        DOBIG32;
+        len -= 32;
+    }
+    while (len >= 4) {
+        DOBIG4;
+        len -= 4;
+    }
+    buf4++;
+    buf = (const unsigned char FAR *)buf4;
+
+    if (len) do {
+        c = crc_table[4][(c >> 24) ^ *buf++] ^ (c << 8);
+    } while (--len);
+    c = ~c;
+    return (unsigned long)(REV(c));
+}
+
+#endif /* BYFOUR */
+
+#define GF2_DIM 32      /* dimension of GF(2) vectors (length of CRC) */
+
+/* ========================================================================= */
+local unsigned long gf2_matrix_times(unsigned long *mat, unsigned long vec)
+{
+    unsigned long sum;
+
+    sum = 0;
+    while (vec) {
+        if (vec & 1)
+            sum ^= *mat;
+        vec >>= 1;
+        mat++;
+    }
+    return sum;
+}
+
+/* ========================================================================= */
+local void gf2_matrix_square(unsigned long *square, unsigned long *mat)
+{
+    int n;
+
+    for (n = 0; n < GF2_DIM; n++)
+        square[n] = gf2_matrix_times(mat, mat[n]);
+}
+
+/* ========================================================================= */
+uLong ZEXPORT crc32_combine(uLong crc1, uLong crc2, z_off_t len2)
+{
+    int n;
+    unsigned long row;
+    unsigned long even[GF2_DIM];    /* even-power-of-two zeros operator */
+    unsigned long odd[GF2_DIM];     /* odd-power-of-two zeros operator */
+
+    /* degenerate case */
+    if (len2 == 0)
+        return crc1;
+
+    /* put operator for one zero bit in odd */
+    odd[0] = 0xedb88320L;           /* CRC-32 polynomial */
+    row = 1;
+    for (n = 1; n < GF2_DIM; n++) {
+        odd[n] = row;
+        row <<= 1;
+    }
+
+    /* put operator for two zero bits in even */
+    gf2_matrix_square(even, odd);
+
+    /* put operator for four zero bits in odd */
+    gf2_matrix_square(odd, even);
+
+    /* apply len2 zeros to crc1 (first square will put the operator for one
+       zero byte, eight zero bits, in even) */
+    do {
+        /* apply zeros operator for this bit of len2 */
+        gf2_matrix_square(even, odd);
+        if (len2 & 1)
+            crc1 = gf2_matrix_times(even, crc1);
+        len2 >>= 1;
+
+        /* if no more bits set, then done */
+        if (len2 == 0)
+            break;
+
+        /* another iteration of the loop with odd and even swapped */
+        gf2_matrix_square(odd, even);
+        if (len2 & 1)
+            crc1 = gf2_matrix_times(odd, crc1);
+        len2 >>= 1;
+
+        /* if no more bits set, then done */
+    } while (len2 != 0);
+
+    /* return combined crc */
+    crc1 ^= crc2;
+    return crc1;
+}
diff --git a/updater/zlib123/crc32.h b/updater/zlib123/crc32.h
new file mode 100644
index 0000000..5de49bc
--- /dev/null
+++ b/updater/zlib123/crc32.h
@@ -0,0 +1,441 @@
+/* crc32.h -- tables for rapid CRC calculation
+ * Generated automatically by crc32.c
+ */
+
+local const unsigned long FAR crc_table[TBLS][256] =
+{
+  {
+    0x00000000UL, 0x77073096UL, 0xee0e612cUL, 0x990951baUL, 0x076dc419UL,
+    0x706af48fUL, 0xe963a535UL, 0x9e6495a3UL, 0x0edb8832UL, 0x79dcb8a4UL,
+    0xe0d5e91eUL, 0x97d2d988UL, 0x09b64c2bUL, 0x7eb17cbdUL, 0xe7b82d07UL,
+    0x90bf1d91UL, 0x1db71064UL, 0x6ab020f2UL, 0xf3b97148UL, 0x84be41deUL,
+    0x1adad47dUL, 0x6ddde4ebUL, 0xf4d4b551UL, 0x83d385c7UL, 0x136c9856UL,
+    0x646ba8c0UL, 0xfd62f97aUL, 0x8a65c9ecUL, 0x14015c4fUL, 0x63066cd9UL,
+    0xfa0f3d63UL, 0x8d080df5UL, 0x3b6e20c8UL, 0x4c69105eUL, 0xd56041e4UL,
+    0xa2677172UL, 0x3c03e4d1UL, 0x4b04d447UL, 0xd20d85fdUL, 0xa50ab56bUL,
+    0x35b5a8faUL, 0x42b2986cUL, 0xdbbbc9d6UL, 0xacbcf940UL, 0x32d86ce3UL,
+    0x45df5c75UL, 0xdcd60dcfUL, 0xabd13d59UL, 0x26d930acUL, 0x51de003aUL,
+    0xc8d75180UL, 0xbfd06116UL, 0x21b4f4b5UL, 0x56b3c423UL, 0xcfba9599UL,
+    0xb8bda50fUL, 0x2802b89eUL, 0x5f058808UL, 0xc60cd9b2UL, 0xb10be924UL,
+    0x2f6f7c87UL, 0x58684c11UL, 0xc1611dabUL, 0xb6662d3dUL, 0x76dc4190UL,
+    0x01db7106UL, 0x98d220bcUL, 0xefd5102aUL, 0x71b18589UL, 0x06b6b51fUL,
+    0x9fbfe4a5UL, 0xe8b8d433UL, 0x7807c9a2UL, 0x0f00f934UL, 0x9609a88eUL,
+    0xe10e9818UL, 0x7f6a0dbbUL, 0x086d3d2dUL, 0x91646c97UL, 0xe6635c01UL,
+    0x6b6b51f4UL, 0x1c6c6162UL, 0x856530d8UL, 0xf262004eUL, 0x6c0695edUL,
+    0x1b01a57bUL, 0x8208f4c1UL, 0xf50fc457UL, 0x65b0d9c6UL, 0x12b7e950UL,
+    0x8bbeb8eaUL, 0xfcb9887cUL, 0x62dd1ddfUL, 0x15da2d49UL, 0x8cd37cf3UL,
+    0xfbd44c65UL, 0x4db26158UL, 0x3ab551ceUL, 0xa3bc0074UL, 0xd4bb30e2UL,
+    0x4adfa541UL, 0x3dd895d7UL, 0xa4d1c46dUL, 0xd3d6f4fbUL, 0x4369e96aUL,
+    0x346ed9fcUL, 0xad678846UL, 0xda60b8d0UL, 0x44042d73UL, 0x33031de5UL,
+    0xaa0a4c5fUL, 0xdd0d7cc9UL, 0x5005713cUL, 0x270241aaUL, 0xbe0b1010UL,
+    0xc90c2086UL, 0x5768b525UL, 0x206f85b3UL, 0xb966d409UL, 0xce61e49fUL,
+    0x5edef90eUL, 0x29d9c998UL, 0xb0d09822UL, 0xc7d7a8b4UL, 0x59b33d17UL,
+    0x2eb40d81UL, 0xb7bd5c3bUL, 0xc0ba6cadUL, 0xedb88320UL, 0x9abfb3b6UL,
+    0x03b6e20cUL, 0x74b1d29aUL, 0xead54739UL, 0x9dd277afUL, 0x04db2615UL,
+    0x73dc1683UL, 0xe3630b12UL, 0x94643b84UL, 0x0d6d6a3eUL, 0x7a6a5aa8UL,
+    0xe40ecf0bUL, 0x9309ff9dUL, 0x0a00ae27UL, 0x7d079eb1UL, 0xf00f9344UL,
+    0x8708a3d2UL, 0x1e01f268UL, 0x6906c2feUL, 0xf762575dUL, 0x806567cbUL,
+    0x196c3671UL, 0x6e6b06e7UL, 0xfed41b76UL, 0x89d32be0UL, 0x10da7a5aUL,
+    0x67dd4accUL, 0xf9b9df6fUL, 0x8ebeeff9UL, 0x17b7be43UL, 0x60b08ed5UL,
+    0xd6d6a3e8UL, 0xa1d1937eUL, 0x38d8c2c4UL, 0x4fdff252UL, 0xd1bb67f1UL,
+    0xa6bc5767UL, 0x3fb506ddUL, 0x48b2364bUL, 0xd80d2bdaUL, 0xaf0a1b4cUL,
+    0x36034af6UL, 0x41047a60UL, 0xdf60efc3UL, 0xa867df55UL, 0x316e8eefUL,
+    0x4669be79UL, 0xcb61b38cUL, 0xbc66831aUL, 0x256fd2a0UL, 0x5268e236UL,
+    0xcc0c7795UL, 0xbb0b4703UL, 0x220216b9UL, 0x5505262fUL, 0xc5ba3bbeUL,
+    0xb2bd0b28UL, 0x2bb45a92UL, 0x5cb36a04UL, 0xc2d7ffa7UL, 0xb5d0cf31UL,
+    0x2cd99e8bUL, 0x5bdeae1dUL, 0x9b64c2b0UL, 0xec63f226UL, 0x756aa39cUL,
+    0x026d930aUL, 0x9c0906a9UL, 0xeb0e363fUL, 0x72076785UL, 0x05005713UL,
+    0x95bf4a82UL, 0xe2b87a14UL, 0x7bb12baeUL, 0x0cb61b38UL, 0x92d28e9bUL,
+    0xe5d5be0dUL, 0x7cdcefb7UL, 0x0bdbdf21UL, 0x86d3d2d4UL, 0xf1d4e242UL,
+    0x68ddb3f8UL, 0x1fda836eUL, 0x81be16cdUL, 0xf6b9265bUL, 0x6fb077e1UL,
+    0x18b74777UL, 0x88085ae6UL, 0xff0f6a70UL, 0x66063bcaUL, 0x11010b5cUL,
+    0x8f659effUL, 0xf862ae69UL, 0x616bffd3UL, 0x166ccf45UL, 0xa00ae278UL,
+    0xd70dd2eeUL, 0x4e048354UL, 0x3903b3c2UL, 0xa7672661UL, 0xd06016f7UL,
+    0x4969474dUL, 0x3e6e77dbUL, 0xaed16a4aUL, 0xd9d65adcUL, 0x40df0b66UL,
+    0x37d83bf0UL, 0xa9bcae53UL, 0xdebb9ec5UL, 0x47b2cf7fUL, 0x30b5ffe9UL,
+    0xbdbdf21cUL, 0xcabac28aUL, 0x53b39330UL, 0x24b4a3a6UL, 0xbad03605UL,
+    0xcdd70693UL, 0x54de5729UL, 0x23d967bfUL, 0xb3667a2eUL, 0xc4614ab8UL,
+    0x5d681b02UL, 0x2a6f2b94UL, 0xb40bbe37UL, 0xc30c8ea1UL, 0x5a05df1bUL,
+    0x2d02ef8dUL
+#ifdef BYFOUR
+  },
+  {
+    0x00000000UL, 0x191b3141UL, 0x32366282UL, 0x2b2d53c3UL, 0x646cc504UL,
+    0x7d77f445UL, 0x565aa786UL, 0x4f4196c7UL, 0xc8d98a08UL, 0xd1c2bb49UL,
+    0xfaefe88aUL, 0xe3f4d9cbUL, 0xacb54f0cUL, 0xb5ae7e4dUL, 0x9e832d8eUL,
+    0x87981ccfUL, 0x4ac21251UL, 0x53d92310UL, 0x78f470d3UL, 0x61ef4192UL,
+    0x2eaed755UL, 0x37b5e614UL, 0x1c98b5d7UL, 0x05838496UL, 0x821b9859UL,
+    0x9b00a918UL, 0xb02dfadbUL, 0xa936cb9aUL, 0xe6775d5dUL, 0xff6c6c1cUL,
+    0xd4413fdfUL, 0xcd5a0e9eUL, 0x958424a2UL, 0x8c9f15e3UL, 0xa7b24620UL,
+    0xbea97761UL, 0xf1e8e1a6UL, 0xe8f3d0e7UL, 0xc3de8324UL, 0xdac5b265UL,
+    0x5d5daeaaUL, 0x44469febUL, 0x6f6bcc28UL, 0x7670fd69UL, 0x39316baeUL,
+    0x202a5aefUL, 0x0b07092cUL, 0x121c386dUL, 0xdf4636f3UL, 0xc65d07b2UL,
+    0xed705471UL, 0xf46b6530UL, 0xbb2af3f7UL, 0xa231c2b6UL, 0x891c9175UL,
+    0x9007a034UL, 0x179fbcfbUL, 0x0e848dbaUL, 0x25a9de79UL, 0x3cb2ef38UL,
+    0x73f379ffUL, 0x6ae848beUL, 0x41c51b7dUL, 0x58de2a3cUL, 0xf0794f05UL,
+    0xe9627e44UL, 0xc24f2d87UL, 0xdb541cc6UL, 0x94158a01UL, 0x8d0ebb40UL,
+    0xa623e883UL, 0xbf38d9c2UL, 0x38a0c50dUL, 0x21bbf44cUL, 0x0a96a78fUL,
+    0x138d96ceUL, 0x5ccc0009UL, 0x45d73148UL, 0x6efa628bUL, 0x77e153caUL,
+    0xbabb5d54UL, 0xa3a06c15UL, 0x888d3fd6UL, 0x91960e97UL, 0xded79850UL,
+    0xc7cca911UL, 0xece1fad2UL, 0xf5facb93UL, 0x7262d75cUL, 0x6b79e61dUL,
+    0x4054b5deUL, 0x594f849fUL, 0x160e1258UL, 0x0f152319UL, 0x243870daUL,
+    0x3d23419bUL, 0x65fd6ba7UL, 0x7ce65ae6UL, 0x57cb0925UL, 0x4ed03864UL,
+    0x0191aea3UL, 0x188a9fe2UL, 0x33a7cc21UL, 0x2abcfd60UL, 0xad24e1afUL,
+    0xb43fd0eeUL, 0x9f12832dUL, 0x8609b26cUL, 0xc94824abUL, 0xd05315eaUL,
+    0xfb7e4629UL, 0xe2657768UL, 0x2f3f79f6UL, 0x362448b7UL, 0x1d091b74UL,
+    0x04122a35UL, 0x4b53bcf2UL, 0x52488db3UL, 0x7965de70UL, 0x607eef31UL,
+    0xe7e6f3feUL, 0xfefdc2bfUL, 0xd5d0917cUL, 0xcccba03dUL, 0x838a36faUL,
+    0x9a9107bbUL, 0xb1bc5478UL, 0xa8a76539UL, 0x3b83984bUL, 0x2298a90aUL,
+    0x09b5fac9UL, 0x10aecb88UL, 0x5fef5d4fUL, 0x46f46c0eUL, 0x6dd93fcdUL,
+    0x74c20e8cUL, 0xf35a1243UL, 0xea412302UL, 0xc16c70c1UL, 0xd8774180UL,
+    0x9736d747UL, 0x8e2de606UL, 0xa500b5c5UL, 0xbc1b8484UL, 0x71418a1aUL,
+    0x685abb5bUL, 0x4377e898UL, 0x5a6cd9d9UL, 0x152d4f1eUL, 0x0c367e5fUL,
+    0x271b2d9cUL, 0x3e001cddUL, 0xb9980012UL, 0xa0833153UL, 0x8bae6290UL,
+    0x92b553d1UL, 0xddf4c516UL, 0xc4eff457UL, 0xefc2a794UL, 0xf6d996d5UL,
+    0xae07bce9UL, 0xb71c8da8UL, 0x9c31de6bUL, 0x852aef2aUL, 0xca6b79edUL,
+    0xd37048acUL, 0xf85d1b6fUL, 0xe1462a2eUL, 0x66de36e1UL, 0x7fc507a0UL,
+    0x54e85463UL, 0x4df36522UL, 0x02b2f3e5UL, 0x1ba9c2a4UL, 0x30849167UL,
+    0x299fa026UL, 0xe4c5aeb8UL, 0xfdde9ff9UL, 0xd6f3cc3aUL, 0xcfe8fd7bUL,
+    0x80a96bbcUL, 0x99b25afdUL, 0xb29f093eUL, 0xab84387fUL, 0x2c1c24b0UL,
+    0x350715f1UL, 0x1e2a4632UL, 0x07317773UL, 0x4870e1b4UL, 0x516bd0f5UL,
+    0x7a468336UL, 0x635db277UL, 0xcbfad74eUL, 0xd2e1e60fUL, 0xf9ccb5ccUL,
+    0xe0d7848dUL, 0xaf96124aUL, 0xb68d230bUL, 0x9da070c8UL, 0x84bb4189UL,
+    0x03235d46UL, 0x1a386c07UL, 0x31153fc4UL, 0x280e0e85UL, 0x674f9842UL,
+    0x7e54a903UL, 0x5579fac0UL, 0x4c62cb81UL, 0x8138c51fUL, 0x9823f45eUL,
+    0xb30ea79dUL, 0xaa1596dcUL, 0xe554001bUL, 0xfc4f315aUL, 0xd7626299UL,
+    0xce7953d8UL, 0x49e14f17UL, 0x50fa7e56UL, 0x7bd72d95UL, 0x62cc1cd4UL,
+    0x2d8d8a13UL, 0x3496bb52UL, 0x1fbbe891UL, 0x06a0d9d0UL, 0x5e7ef3ecUL,
+    0x4765c2adUL, 0x6c48916eUL, 0x7553a02fUL, 0x3a1236e8UL, 0x230907a9UL,
+    0x0824546aUL, 0x113f652bUL, 0x96a779e4UL, 0x8fbc48a5UL, 0xa4911b66UL,
+    0xbd8a2a27UL, 0xf2cbbce0UL, 0xebd08da1UL, 0xc0fdde62UL, 0xd9e6ef23UL,
+    0x14bce1bdUL, 0x0da7d0fcUL, 0x268a833fUL, 0x3f91b27eUL, 0x70d024b9UL,
+    0x69cb15f8UL, 0x42e6463bUL, 0x5bfd777aUL, 0xdc656bb5UL, 0xc57e5af4UL,
+    0xee530937UL, 0xf7483876UL, 0xb809aeb1UL, 0xa1129ff0UL, 0x8a3fcc33UL,
+    0x9324fd72UL
+  },
+  {
+    0x00000000UL, 0x01c26a37UL, 0x0384d46eUL, 0x0246be59UL, 0x0709a8dcUL,
+    0x06cbc2ebUL, 0x048d7cb2UL, 0x054f1685UL, 0x0e1351b8UL, 0x0fd13b8fUL,
+    0x0d9785d6UL, 0x0c55efe1UL, 0x091af964UL, 0x08d89353UL, 0x0a9e2d0aUL,
+    0x0b5c473dUL, 0x1c26a370UL, 0x1de4c947UL, 0x1fa2771eUL, 0x1e601d29UL,
+    0x1b2f0bacUL, 0x1aed619bUL, 0x18abdfc2UL, 0x1969b5f5UL, 0x1235f2c8UL,
+    0x13f798ffUL, 0x11b126a6UL, 0x10734c91UL, 0x153c5a14UL, 0x14fe3023UL,
+    0x16b88e7aUL, 0x177ae44dUL, 0x384d46e0UL, 0x398f2cd7UL, 0x3bc9928eUL,
+    0x3a0bf8b9UL, 0x3f44ee3cUL, 0x3e86840bUL, 0x3cc03a52UL, 0x3d025065UL,
+    0x365e1758UL, 0x379c7d6fUL, 0x35dac336UL, 0x3418a901UL, 0x3157bf84UL,
+    0x3095d5b3UL, 0x32d36beaUL, 0x331101ddUL, 0x246be590UL, 0x25a98fa7UL,
+    0x27ef31feUL, 0x262d5bc9UL, 0x23624d4cUL, 0x22a0277bUL, 0x20e69922UL,
+    0x2124f315UL, 0x2a78b428UL, 0x2bbade1fUL, 0x29fc6046UL, 0x283e0a71UL,
+    0x2d711cf4UL, 0x2cb376c3UL, 0x2ef5c89aUL, 0x2f37a2adUL, 0x709a8dc0UL,
+    0x7158e7f7UL, 0x731e59aeUL, 0x72dc3399UL, 0x7793251cUL, 0x76514f2bUL,
+    0x7417f172UL, 0x75d59b45UL, 0x7e89dc78UL, 0x7f4bb64fUL, 0x7d0d0816UL,
+    0x7ccf6221UL, 0x798074a4UL, 0x78421e93UL, 0x7a04a0caUL, 0x7bc6cafdUL,
+    0x6cbc2eb0UL, 0x6d7e4487UL, 0x6f38fadeUL, 0x6efa90e9UL, 0x6bb5866cUL,
+    0x6a77ec5bUL, 0x68315202UL, 0x69f33835UL, 0x62af7f08UL, 0x636d153fUL,
+    0x612bab66UL, 0x60e9c151UL, 0x65a6d7d4UL, 0x6464bde3UL, 0x662203baUL,
+    0x67e0698dUL, 0x48d7cb20UL, 0x4915a117UL, 0x4b531f4eUL, 0x4a917579UL,
+    0x4fde63fcUL, 0x4e1c09cbUL, 0x4c5ab792UL, 0x4d98dda5UL, 0x46c49a98UL,
+    0x4706f0afUL, 0x45404ef6UL, 0x448224c1UL, 0x41cd3244UL, 0x400f5873UL,
+    0x4249e62aUL, 0x438b8c1dUL, 0x54f16850UL, 0x55330267UL, 0x5775bc3eUL,
+    0x56b7d609UL, 0x53f8c08cUL, 0x523aaabbUL, 0x507c14e2UL, 0x51be7ed5UL,
+    0x5ae239e8UL, 0x5b2053dfUL, 0x5966ed86UL, 0x58a487b1UL, 0x5deb9134UL,
+    0x5c29fb03UL, 0x5e6f455aUL, 0x5fad2f6dUL, 0xe1351b80UL, 0xe0f771b7UL,
+    0xe2b1cfeeUL, 0xe373a5d9UL, 0xe63cb35cUL, 0xe7fed96bUL, 0xe5b86732UL,
+    0xe47a0d05UL, 0xef264a38UL, 0xeee4200fUL, 0xeca29e56UL, 0xed60f461UL,
+    0xe82fe2e4UL, 0xe9ed88d3UL, 0xebab368aUL, 0xea695cbdUL, 0xfd13b8f0UL,
+    0xfcd1d2c7UL, 0xfe976c9eUL, 0xff5506a9UL, 0xfa1a102cUL, 0xfbd87a1bUL,
+    0xf99ec442UL, 0xf85cae75UL, 0xf300e948UL, 0xf2c2837fUL, 0xf0843d26UL,
+    0xf1465711UL, 0xf4094194UL, 0xf5cb2ba3UL, 0xf78d95faUL, 0xf64fffcdUL,
+    0xd9785d60UL, 0xd8ba3757UL, 0xdafc890eUL, 0xdb3ee339UL, 0xde71f5bcUL,
+    0xdfb39f8bUL, 0xddf521d2UL, 0xdc374be5UL, 0xd76b0cd8UL, 0xd6a966efUL,
+    0xd4efd8b6UL, 0xd52db281UL, 0xd062a404UL, 0xd1a0ce33UL, 0xd3e6706aUL,
+    0xd2241a5dUL, 0xc55efe10UL, 0xc49c9427UL, 0xc6da2a7eUL, 0xc7184049UL,
+    0xc25756ccUL, 0xc3953cfbUL, 0xc1d382a2UL, 0xc011e895UL, 0xcb4dafa8UL,
+    0xca8fc59fUL, 0xc8c97bc6UL, 0xc90b11f1UL, 0xcc440774UL, 0xcd866d43UL,
+    0xcfc0d31aUL, 0xce02b92dUL, 0x91af9640UL, 0x906dfc77UL, 0x922b422eUL,
+    0x93e92819UL, 0x96a63e9cUL, 0x976454abUL, 0x9522eaf2UL, 0x94e080c5UL,
+    0x9fbcc7f8UL, 0x9e7eadcfUL, 0x9c381396UL, 0x9dfa79a1UL, 0x98b56f24UL,
+    0x99770513UL, 0x9b31bb4aUL, 0x9af3d17dUL, 0x8d893530UL, 0x8c4b5f07UL,
+    0x8e0de15eUL, 0x8fcf8b69UL, 0x8a809decUL, 0x8b42f7dbUL, 0x89044982UL,
+    0x88c623b5UL, 0x839a6488UL, 0x82580ebfUL, 0x801eb0e6UL, 0x81dcdad1UL,
+    0x8493cc54UL, 0x8551a663UL, 0x8717183aUL, 0x86d5720dUL, 0xa9e2d0a0UL,
+    0xa820ba97UL, 0xaa6604ceUL, 0xaba46ef9UL, 0xaeeb787cUL, 0xaf29124bUL,
+    0xad6fac12UL, 0xacadc625UL, 0xa7f18118UL, 0xa633eb2fUL, 0xa4755576UL,
+    0xa5b73f41UL, 0xa0f829c4UL, 0xa13a43f3UL, 0xa37cfdaaUL, 0xa2be979dUL,
+    0xb5c473d0UL, 0xb40619e7UL, 0xb640a7beUL, 0xb782cd89UL, 0xb2cddb0cUL,
+    0xb30fb13bUL, 0xb1490f62UL, 0xb08b6555UL, 0xbbd72268UL, 0xba15485fUL,
+    0xb853f606UL, 0xb9919c31UL, 0xbcde8ab4UL, 0xbd1ce083UL, 0xbf5a5edaUL,
+    0xbe9834edUL
+  },
+  {
+    0x00000000UL, 0xb8bc6765UL, 0xaa09c88bUL, 0x12b5afeeUL, 0x8f629757UL,
+    0x37def032UL, 0x256b5fdcUL, 0x9dd738b9UL, 0xc5b428efUL, 0x7d084f8aUL,
+    0x6fbde064UL, 0xd7018701UL, 0x4ad6bfb8UL, 0xf26ad8ddUL, 0xe0df7733UL,
+    0x58631056UL, 0x5019579fUL, 0xe8a530faUL, 0xfa109f14UL, 0x42acf871UL,
+    0xdf7bc0c8UL, 0x67c7a7adUL, 0x75720843UL, 0xcdce6f26UL, 0x95ad7f70UL,
+    0x2d111815UL, 0x3fa4b7fbUL, 0x8718d09eUL, 0x1acfe827UL, 0xa2738f42UL,
+    0xb0c620acUL, 0x087a47c9UL, 0xa032af3eUL, 0x188ec85bUL, 0x0a3b67b5UL,
+    0xb28700d0UL, 0x2f503869UL, 0x97ec5f0cUL, 0x8559f0e2UL, 0x3de59787UL,
+    0x658687d1UL, 0xdd3ae0b4UL, 0xcf8f4f5aUL, 0x7733283fUL, 0xeae41086UL,
+    0x525877e3UL, 0x40edd80dUL, 0xf851bf68UL, 0xf02bf8a1UL, 0x48979fc4UL,
+    0x5a22302aUL, 0xe29e574fUL, 0x7f496ff6UL, 0xc7f50893UL, 0xd540a77dUL,
+    0x6dfcc018UL, 0x359fd04eUL, 0x8d23b72bUL, 0x9f9618c5UL, 0x272a7fa0UL,
+    0xbafd4719UL, 0x0241207cUL, 0x10f48f92UL, 0xa848e8f7UL, 0x9b14583dUL,
+    0x23a83f58UL, 0x311d90b6UL, 0x89a1f7d3UL, 0x1476cf6aUL, 0xaccaa80fUL,
+    0xbe7f07e1UL, 0x06c36084UL, 0x5ea070d2UL, 0xe61c17b7UL, 0xf4a9b859UL,
+    0x4c15df3cUL, 0xd1c2e785UL, 0x697e80e0UL, 0x7bcb2f0eUL, 0xc377486bUL,
+    0xcb0d0fa2UL, 0x73b168c7UL, 0x6104c729UL, 0xd9b8a04cUL, 0x446f98f5UL,
+    0xfcd3ff90UL, 0xee66507eUL, 0x56da371bUL, 0x0eb9274dUL, 0xb6054028UL,
+    0xa4b0efc6UL, 0x1c0c88a3UL, 0x81dbb01aUL, 0x3967d77fUL, 0x2bd27891UL,
+    0x936e1ff4UL, 0x3b26f703UL, 0x839a9066UL, 0x912f3f88UL, 0x299358edUL,
+    0xb4446054UL, 0x0cf80731UL, 0x1e4da8dfUL, 0xa6f1cfbaUL, 0xfe92dfecUL,
+    0x462eb889UL, 0x549b1767UL, 0xec277002UL, 0x71f048bbUL, 0xc94c2fdeUL,
+    0xdbf98030UL, 0x6345e755UL, 0x6b3fa09cUL, 0xd383c7f9UL, 0xc1366817UL,
+    0x798a0f72UL, 0xe45d37cbUL, 0x5ce150aeUL, 0x4e54ff40UL, 0xf6e89825UL,
+    0xae8b8873UL, 0x1637ef16UL, 0x048240f8UL, 0xbc3e279dUL, 0x21e91f24UL,
+    0x99557841UL, 0x8be0d7afUL, 0x335cb0caUL, 0xed59b63bUL, 0x55e5d15eUL,
+    0x47507eb0UL, 0xffec19d5UL, 0x623b216cUL, 0xda874609UL, 0xc832e9e7UL,
+    0x708e8e82UL, 0x28ed9ed4UL, 0x9051f9b1UL, 0x82e4565fUL, 0x3a58313aUL,
+    0xa78f0983UL, 0x1f336ee6UL, 0x0d86c108UL, 0xb53aa66dUL, 0xbd40e1a4UL,
+    0x05fc86c1UL, 0x1749292fUL, 0xaff54e4aUL, 0x322276f3UL, 0x8a9e1196UL,
+    0x982bbe78UL, 0x2097d91dUL, 0x78f4c94bUL, 0xc048ae2eUL, 0xd2fd01c0UL,
+    0x6a4166a5UL, 0xf7965e1cUL, 0x4f2a3979UL, 0x5d9f9697UL, 0xe523f1f2UL,
+    0x4d6b1905UL, 0xf5d77e60UL, 0xe762d18eUL, 0x5fdeb6ebUL, 0xc2098e52UL,
+    0x7ab5e937UL, 0x680046d9UL, 0xd0bc21bcUL, 0x88df31eaUL, 0x3063568fUL,
+    0x22d6f961UL, 0x9a6a9e04UL, 0x07bda6bdUL, 0xbf01c1d8UL, 0xadb46e36UL,
+    0x15080953UL, 0x1d724e9aUL, 0xa5ce29ffUL, 0xb77b8611UL, 0x0fc7e174UL,
+    0x9210d9cdUL, 0x2aacbea8UL, 0x38191146UL, 0x80a57623UL, 0xd8c66675UL,
+    0x607a0110UL, 0x72cfaefeUL, 0xca73c99bUL, 0x57a4f122UL, 0xef189647UL,
+    0xfdad39a9UL, 0x45115eccUL, 0x764dee06UL, 0xcef18963UL, 0xdc44268dUL,
+    0x64f841e8UL, 0xf92f7951UL, 0x41931e34UL, 0x5326b1daUL, 0xeb9ad6bfUL,
+    0xb3f9c6e9UL, 0x0b45a18cUL, 0x19f00e62UL, 0xa14c6907UL, 0x3c9b51beUL,
+    0x842736dbUL, 0x96929935UL, 0x2e2efe50UL, 0x2654b999UL, 0x9ee8defcUL,
+    0x8c5d7112UL, 0x34e11677UL, 0xa9362eceUL, 0x118a49abUL, 0x033fe645UL,
+    0xbb838120UL, 0xe3e09176UL, 0x5b5cf613UL, 0x49e959fdUL, 0xf1553e98UL,
+    0x6c820621UL, 0xd43e6144UL, 0xc68bceaaUL, 0x7e37a9cfUL, 0xd67f4138UL,
+    0x6ec3265dUL, 0x7c7689b3UL, 0xc4caeed6UL, 0x591dd66fUL, 0xe1a1b10aUL,
+    0xf3141ee4UL, 0x4ba87981UL, 0x13cb69d7UL, 0xab770eb2UL, 0xb9c2a15cUL,
+    0x017ec639UL, 0x9ca9fe80UL, 0x241599e5UL, 0x36a0360bUL, 0x8e1c516eUL,
+    0x866616a7UL, 0x3eda71c2UL, 0x2c6fde2cUL, 0x94d3b949UL, 0x090481f0UL,
+    0xb1b8e695UL, 0xa30d497bUL, 0x1bb12e1eUL, 0x43d23e48UL, 0xfb6e592dUL,
+    0xe9dbf6c3UL, 0x516791a6UL, 0xccb0a91fUL, 0x740cce7aUL, 0x66b96194UL,
+    0xde0506f1UL
+  },
+  {
+    0x00000000UL, 0x96300777UL, 0x2c610eeeUL, 0xba510999UL, 0x19c46d07UL,
+    0x8ff46a70UL, 0x35a563e9UL, 0xa395649eUL, 0x3288db0eUL, 0xa4b8dc79UL,
+    0x1ee9d5e0UL, 0x88d9d297UL, 0x2b4cb609UL, 0xbd7cb17eUL, 0x072db8e7UL,
+    0x911dbf90UL, 0x6410b71dUL, 0xf220b06aUL, 0x4871b9f3UL, 0xde41be84UL,
+    0x7dd4da1aUL, 0xebe4dd6dUL, 0x51b5d4f4UL, 0xc785d383UL, 0x56986c13UL,
+    0xc0a86b64UL, 0x7af962fdUL, 0xecc9658aUL, 0x4f5c0114UL, 0xd96c0663UL,
+    0x633d0ffaUL, 0xf50d088dUL, 0xc8206e3bUL, 0x5e10694cUL, 0xe44160d5UL,
+    0x727167a2UL, 0xd1e4033cUL, 0x47d4044bUL, 0xfd850dd2UL, 0x6bb50aa5UL,
+    0xfaa8b535UL, 0x6c98b242UL, 0xd6c9bbdbUL, 0x40f9bcacUL, 0xe36cd832UL,
+    0x755cdf45UL, 0xcf0dd6dcUL, 0x593dd1abUL, 0xac30d926UL, 0x3a00de51UL,
+    0x8051d7c8UL, 0x1661d0bfUL, 0xb5f4b421UL, 0x23c4b356UL, 0x9995bacfUL,
+    0x0fa5bdb8UL, 0x9eb80228UL, 0x0888055fUL, 0xb2d90cc6UL, 0x24e90bb1UL,
+    0x877c6f2fUL, 0x114c6858UL, 0xab1d61c1UL, 0x3d2d66b6UL, 0x9041dc76UL,
+    0x0671db01UL, 0xbc20d298UL, 0x2a10d5efUL, 0x8985b171UL, 0x1fb5b606UL,
+    0xa5e4bf9fUL, 0x33d4b8e8UL, 0xa2c90778UL, 0x34f9000fUL, 0x8ea80996UL,
+    0x18980ee1UL, 0xbb0d6a7fUL, 0x2d3d6d08UL, 0x976c6491UL, 0x015c63e6UL,
+    0xf4516b6bUL, 0x62616c1cUL, 0xd8306585UL, 0x4e0062f2UL, 0xed95066cUL,
+    0x7ba5011bUL, 0xc1f40882UL, 0x57c40ff5UL, 0xc6d9b065UL, 0x50e9b712UL,
+    0xeab8be8bUL, 0x7c88b9fcUL, 0xdf1ddd62UL, 0x492dda15UL, 0xf37cd38cUL,
+    0x654cd4fbUL, 0x5861b24dUL, 0xce51b53aUL, 0x7400bca3UL, 0xe230bbd4UL,
+    0x41a5df4aUL, 0xd795d83dUL, 0x6dc4d1a4UL, 0xfbf4d6d3UL, 0x6ae96943UL,
+    0xfcd96e34UL, 0x468867adUL, 0xd0b860daUL, 0x732d0444UL, 0xe51d0333UL,
+    0x5f4c0aaaUL, 0xc97c0dddUL, 0x3c710550UL, 0xaa410227UL, 0x10100bbeUL,
+    0x86200cc9UL, 0x25b56857UL, 0xb3856f20UL, 0x09d466b9UL, 0x9fe461ceUL,
+    0x0ef9de5eUL, 0x98c9d929UL, 0x2298d0b0UL, 0xb4a8d7c7UL, 0x173db359UL,
+    0x810db42eUL, 0x3b5cbdb7UL, 0xad6cbac0UL, 0x2083b8edUL, 0xb6b3bf9aUL,
+    0x0ce2b603UL, 0x9ad2b174UL, 0x3947d5eaUL, 0xaf77d29dUL, 0x1526db04UL,
+    0x8316dc73UL, 0x120b63e3UL, 0x843b6494UL, 0x3e6a6d0dUL, 0xa85a6a7aUL,
+    0x0bcf0ee4UL, 0x9dff0993UL, 0x27ae000aUL, 0xb19e077dUL, 0x44930ff0UL,
+    0xd2a30887UL, 0x68f2011eUL, 0xfec20669UL, 0x5d5762f7UL, 0xcb676580UL,
+    0x71366c19UL, 0xe7066b6eUL, 0x761bd4feUL, 0xe02bd389UL, 0x5a7ada10UL,
+    0xcc4add67UL, 0x6fdfb9f9UL, 0xf9efbe8eUL, 0x43beb717UL, 0xd58eb060UL,
+    0xe8a3d6d6UL, 0x7e93d1a1UL, 0xc4c2d838UL, 0x52f2df4fUL, 0xf167bbd1UL,
+    0x6757bca6UL, 0xdd06b53fUL, 0x4b36b248UL, 0xda2b0dd8UL, 0x4c1b0aafUL,
+    0xf64a0336UL, 0x607a0441UL, 0xc3ef60dfUL, 0x55df67a8UL, 0xef8e6e31UL,
+    0x79be6946UL, 0x8cb361cbUL, 0x1a8366bcUL, 0xa0d26f25UL, 0x36e26852UL,
+    0x95770cccUL, 0x03470bbbUL, 0xb9160222UL, 0x2f260555UL, 0xbe3bbac5UL,
+    0x280bbdb2UL, 0x925ab42bUL, 0x046ab35cUL, 0xa7ffd7c2UL, 0x31cfd0b5UL,
+    0x8b9ed92cUL, 0x1daede5bUL, 0xb0c2649bUL, 0x26f263ecUL, 0x9ca36a75UL,
+    0x0a936d02UL, 0xa906099cUL, 0x3f360eebUL, 0x85670772UL, 0x13570005UL,
+    0x824abf95UL, 0x147ab8e2UL, 0xae2bb17bUL, 0x381bb60cUL, 0x9b8ed292UL,
+    0x0dbed5e5UL, 0xb7efdc7cUL, 0x21dfdb0bUL, 0xd4d2d386UL, 0x42e2d4f1UL,
+    0xf8b3dd68UL, 0x6e83da1fUL, 0xcd16be81UL, 0x5b26b9f6UL, 0xe177b06fUL,
+    0x7747b718UL, 0xe65a0888UL, 0x706a0fffUL, 0xca3b0666UL, 0x5c0b0111UL,
+    0xff9e658fUL, 0x69ae62f8UL, 0xd3ff6b61UL, 0x45cf6c16UL, 0x78e20aa0UL,
+    0xeed20dd7UL, 0x5483044eUL, 0xc2b30339UL, 0x612667a7UL, 0xf71660d0UL,
+    0x4d476949UL, 0xdb776e3eUL, 0x4a6ad1aeUL, 0xdc5ad6d9UL, 0x660bdf40UL,
+    0xf03bd837UL, 0x53aebca9UL, 0xc59ebbdeUL, 0x7fcfb247UL, 0xe9ffb530UL,
+    0x1cf2bdbdUL, 0x8ac2bacaUL, 0x3093b353UL, 0xa6a3b424UL, 0x0536d0baUL,
+    0x9306d7cdUL, 0x2957de54UL, 0xbf67d923UL, 0x2e7a66b3UL, 0xb84a61c4UL,
+    0x021b685dUL, 0x942b6f2aUL, 0x37be0bb4UL, 0xa18e0cc3UL, 0x1bdf055aUL,
+    0x8def022dUL
+  },
+  {
+    0x00000000UL, 0x41311b19UL, 0x82623632UL, 0xc3532d2bUL, 0x04c56c64UL,
+    0x45f4777dUL, 0x86a75a56UL, 0xc796414fUL, 0x088ad9c8UL, 0x49bbc2d1UL,
+    0x8ae8effaUL, 0xcbd9f4e3UL, 0x0c4fb5acUL, 0x4d7eaeb5UL, 0x8e2d839eUL,
+    0xcf1c9887UL, 0x5112c24aUL, 0x1023d953UL, 0xd370f478UL, 0x9241ef61UL,
+    0x55d7ae2eUL, 0x14e6b537UL, 0xd7b5981cUL, 0x96848305UL, 0x59981b82UL,
+    0x18a9009bUL, 0xdbfa2db0UL, 0x9acb36a9UL, 0x5d5d77e6UL, 0x1c6c6cffUL,
+    0xdf3f41d4UL, 0x9e0e5acdUL, 0xa2248495UL, 0xe3159f8cUL, 0x2046b2a7UL,
+    0x6177a9beUL, 0xa6e1e8f1UL, 0xe7d0f3e8UL, 0x2483dec3UL, 0x65b2c5daUL,
+    0xaaae5d5dUL, 0xeb9f4644UL, 0x28cc6b6fUL, 0x69fd7076UL, 0xae6b3139UL,
+    0xef5a2a20UL, 0x2c09070bUL, 0x6d381c12UL, 0xf33646dfUL, 0xb2075dc6UL,
+    0x715470edUL, 0x30656bf4UL, 0xf7f32abbUL, 0xb6c231a2UL, 0x75911c89UL,
+    0x34a00790UL, 0xfbbc9f17UL, 0xba8d840eUL, 0x79dea925UL, 0x38efb23cUL,
+    0xff79f373UL, 0xbe48e86aUL, 0x7d1bc541UL, 0x3c2ade58UL, 0x054f79f0UL,
+    0x447e62e9UL, 0x872d4fc2UL, 0xc61c54dbUL, 0x018a1594UL, 0x40bb0e8dUL,
+    0x83e823a6UL, 0xc2d938bfUL, 0x0dc5a038UL, 0x4cf4bb21UL, 0x8fa7960aUL,
+    0xce968d13UL, 0x0900cc5cUL, 0x4831d745UL, 0x8b62fa6eUL, 0xca53e177UL,
+    0x545dbbbaUL, 0x156ca0a3UL, 0xd63f8d88UL, 0x970e9691UL, 0x5098d7deUL,
+    0x11a9ccc7UL, 0xd2fae1ecUL, 0x93cbfaf5UL, 0x5cd76272UL, 0x1de6796bUL,
+    0xdeb55440UL, 0x9f844f59UL, 0x58120e16UL, 0x1923150fUL, 0xda703824UL,
+    0x9b41233dUL, 0xa76bfd65UL, 0xe65ae67cUL, 0x2509cb57UL, 0x6438d04eUL,
+    0xa3ae9101UL, 0xe29f8a18UL, 0x21cca733UL, 0x60fdbc2aUL, 0xafe124adUL,
+    0xeed03fb4UL, 0x2d83129fUL, 0x6cb20986UL, 0xab2448c9UL, 0xea1553d0UL,
+    0x29467efbUL, 0x687765e2UL, 0xf6793f2fUL, 0xb7482436UL, 0x741b091dUL,
+    0x352a1204UL, 0xf2bc534bUL, 0xb38d4852UL, 0x70de6579UL, 0x31ef7e60UL,
+    0xfef3e6e7UL, 0xbfc2fdfeUL, 0x7c91d0d5UL, 0x3da0cbccUL, 0xfa368a83UL,
+    0xbb07919aUL, 0x7854bcb1UL, 0x3965a7a8UL, 0x4b98833bUL, 0x0aa99822UL,
+    0xc9fab509UL, 0x88cbae10UL, 0x4f5def5fUL, 0x0e6cf446UL, 0xcd3fd96dUL,
+    0x8c0ec274UL, 0x43125af3UL, 0x022341eaUL, 0xc1706cc1UL, 0x804177d8UL,
+    0x47d73697UL, 0x06e62d8eUL, 0xc5b500a5UL, 0x84841bbcUL, 0x1a8a4171UL,
+    0x5bbb5a68UL, 0x98e87743UL, 0xd9d96c5aUL, 0x1e4f2d15UL, 0x5f7e360cUL,
+    0x9c2d1b27UL, 0xdd1c003eUL, 0x120098b9UL, 0x533183a0UL, 0x9062ae8bUL,
+    0xd153b592UL, 0x16c5f4ddUL, 0x57f4efc4UL, 0x94a7c2efUL, 0xd596d9f6UL,
+    0xe9bc07aeUL, 0xa88d1cb7UL, 0x6bde319cUL, 0x2aef2a85UL, 0xed796bcaUL,
+    0xac4870d3UL, 0x6f1b5df8UL, 0x2e2a46e1UL, 0xe136de66UL, 0xa007c57fUL,
+    0x6354e854UL, 0x2265f34dUL, 0xe5f3b202UL, 0xa4c2a91bUL, 0x67918430UL,
+    0x26a09f29UL, 0xb8aec5e4UL, 0xf99fdefdUL, 0x3accf3d6UL, 0x7bfde8cfUL,
+    0xbc6ba980UL, 0xfd5ab299UL, 0x3e099fb2UL, 0x7f3884abUL, 0xb0241c2cUL,
+    0xf1150735UL, 0x32462a1eUL, 0x73773107UL, 0xb4e17048UL, 0xf5d06b51UL,
+    0x3683467aUL, 0x77b25d63UL, 0x4ed7facbUL, 0x0fe6e1d2UL, 0xccb5ccf9UL,
+    0x8d84d7e0UL, 0x4a1296afUL, 0x0b238db6UL, 0xc870a09dUL, 0x8941bb84UL,
+    0x465d2303UL, 0x076c381aUL, 0xc43f1531UL, 0x850e0e28UL, 0x42984f67UL,
+    0x03a9547eUL, 0xc0fa7955UL, 0x81cb624cUL, 0x1fc53881UL, 0x5ef42398UL,
+    0x9da70eb3UL, 0xdc9615aaUL, 0x1b0054e5UL, 0x5a314ffcUL, 0x996262d7UL,
+    0xd85379ceUL, 0x174fe149UL, 0x567efa50UL, 0x952dd77bUL, 0xd41ccc62UL,
+    0x138a8d2dUL, 0x52bb9634UL, 0x91e8bb1fUL, 0xd0d9a006UL, 0xecf37e5eUL,
+    0xadc26547UL, 0x6e91486cUL, 0x2fa05375UL, 0xe836123aUL, 0xa9070923UL,
+    0x6a542408UL, 0x2b653f11UL, 0xe479a796UL, 0xa548bc8fUL, 0x661b91a4UL,
+    0x272a8abdUL, 0xe0bccbf2UL, 0xa18dd0ebUL, 0x62defdc0UL, 0x23efe6d9UL,
+    0xbde1bc14UL, 0xfcd0a70dUL, 0x3f838a26UL, 0x7eb2913fUL, 0xb924d070UL,
+    0xf815cb69UL, 0x3b46e642UL, 0x7a77fd5bUL, 0xb56b65dcUL, 0xf45a7ec5UL,
+    0x370953eeUL, 0x763848f7UL, 0xb1ae09b8UL, 0xf09f12a1UL, 0x33cc3f8aUL,
+    0x72fd2493UL
+  },
+  {
+    0x00000000UL, 0x376ac201UL, 0x6ed48403UL, 0x59be4602UL, 0xdca80907UL,
+    0xebc2cb06UL, 0xb27c8d04UL, 0x85164f05UL, 0xb851130eUL, 0x8f3bd10fUL,
+    0xd685970dUL, 0xe1ef550cUL, 0x64f91a09UL, 0x5393d808UL, 0x0a2d9e0aUL,
+    0x3d475c0bUL, 0x70a3261cUL, 0x47c9e41dUL, 0x1e77a21fUL, 0x291d601eUL,
+    0xac0b2f1bUL, 0x9b61ed1aUL, 0xc2dfab18UL, 0xf5b56919UL, 0xc8f23512UL,
+    0xff98f713UL, 0xa626b111UL, 0x914c7310UL, 0x145a3c15UL, 0x2330fe14UL,
+    0x7a8eb816UL, 0x4de47a17UL, 0xe0464d38UL, 0xd72c8f39UL, 0x8e92c93bUL,
+    0xb9f80b3aUL, 0x3cee443fUL, 0x0b84863eUL, 0x523ac03cUL, 0x6550023dUL,
+    0x58175e36UL, 0x6f7d9c37UL, 0x36c3da35UL, 0x01a91834UL, 0x84bf5731UL,
+    0xb3d59530UL, 0xea6bd332UL, 0xdd011133UL, 0x90e56b24UL, 0xa78fa925UL,
+    0xfe31ef27UL, 0xc95b2d26UL, 0x4c4d6223UL, 0x7b27a022UL, 0x2299e620UL,
+    0x15f32421UL, 0x28b4782aUL, 0x1fdeba2bUL, 0x4660fc29UL, 0x710a3e28UL,
+    0xf41c712dUL, 0xc376b32cUL, 0x9ac8f52eUL, 0xada2372fUL, 0xc08d9a70UL,
+    0xf7e75871UL, 0xae591e73UL, 0x9933dc72UL, 0x1c259377UL, 0x2b4f5176UL,
+    0x72f11774UL, 0x459bd575UL, 0x78dc897eUL, 0x4fb64b7fUL, 0x16080d7dUL,
+    0x2162cf7cUL, 0xa4748079UL, 0x931e4278UL, 0xcaa0047aUL, 0xfdcac67bUL,
+    0xb02ebc6cUL, 0x87447e6dUL, 0xdefa386fUL, 0xe990fa6eUL, 0x6c86b56bUL,
+    0x5bec776aUL, 0x02523168UL, 0x3538f369UL, 0x087faf62UL, 0x3f156d63UL,
+    0x66ab2b61UL, 0x51c1e960UL, 0xd4d7a665UL, 0xe3bd6464UL, 0xba032266UL,
+    0x8d69e067UL, 0x20cbd748UL, 0x17a11549UL, 0x4e1f534bUL, 0x7975914aUL,
+    0xfc63de4fUL, 0xcb091c4eUL, 0x92b75a4cUL, 0xa5dd984dUL, 0x989ac446UL,
+    0xaff00647UL, 0xf64e4045UL, 0xc1248244UL, 0x4432cd41UL, 0x73580f40UL,
+    0x2ae64942UL, 0x1d8c8b43UL, 0x5068f154UL, 0x67023355UL, 0x3ebc7557UL,
+    0x09d6b756UL, 0x8cc0f853UL, 0xbbaa3a52UL, 0xe2147c50UL, 0xd57ebe51UL,
+    0xe839e25aUL, 0xdf53205bUL, 0x86ed6659UL, 0xb187a458UL, 0x3491eb5dUL,
+    0x03fb295cUL, 0x5a456f5eUL, 0x6d2fad5fUL, 0x801b35e1UL, 0xb771f7e0UL,
+    0xeecfb1e2UL, 0xd9a573e3UL, 0x5cb33ce6UL, 0x6bd9fee7UL, 0x3267b8e5UL,
+    0x050d7ae4UL, 0x384a26efUL, 0x0f20e4eeUL, 0x569ea2ecUL, 0x61f460edUL,
+    0xe4e22fe8UL, 0xd388ede9UL, 0x8a36abebUL, 0xbd5c69eaUL, 0xf0b813fdUL,
+    0xc7d2d1fcUL, 0x9e6c97feUL, 0xa90655ffUL, 0x2c101afaUL, 0x1b7ad8fbUL,
+    0x42c49ef9UL, 0x75ae5cf8UL, 0x48e900f3UL, 0x7f83c2f2UL, 0x263d84f0UL,
+    0x115746f1UL, 0x944109f4UL, 0xa32bcbf5UL, 0xfa958df7UL, 0xcdff4ff6UL,
+    0x605d78d9UL, 0x5737bad8UL, 0x0e89fcdaUL, 0x39e33edbUL, 0xbcf571deUL,
+    0x8b9fb3dfUL, 0xd221f5ddUL, 0xe54b37dcUL, 0xd80c6bd7UL, 0xef66a9d6UL,
+    0xb6d8efd4UL, 0x81b22dd5UL, 0x04a462d0UL, 0x33cea0d1UL, 0x6a70e6d3UL,
+    0x5d1a24d2UL, 0x10fe5ec5UL, 0x27949cc4UL, 0x7e2adac6UL, 0x494018c7UL,
+    0xcc5657c2UL, 0xfb3c95c3UL, 0xa282d3c1UL, 0x95e811c0UL, 0xa8af4dcbUL,
+    0x9fc58fcaUL, 0xc67bc9c8UL, 0xf1110bc9UL, 0x740744ccUL, 0x436d86cdUL,
+    0x1ad3c0cfUL, 0x2db902ceUL, 0x4096af91UL, 0x77fc6d90UL, 0x2e422b92UL,
+    0x1928e993UL, 0x9c3ea696UL, 0xab546497UL, 0xf2ea2295UL, 0xc580e094UL,
+    0xf8c7bc9fUL, 0xcfad7e9eUL, 0x9613389cUL, 0xa179fa9dUL, 0x246fb598UL,
+    0x13057799UL, 0x4abb319bUL, 0x7dd1f39aUL, 0x3035898dUL, 0x075f4b8cUL,
+    0x5ee10d8eUL, 0x698bcf8fUL, 0xec9d808aUL, 0xdbf7428bUL, 0x82490489UL,
+    0xb523c688UL, 0x88649a83UL, 0xbf0e5882UL, 0xe6b01e80UL, 0xd1dadc81UL,
+    0x54cc9384UL, 0x63a65185UL, 0x3a181787UL, 0x0d72d586UL, 0xa0d0e2a9UL,
+    0x97ba20a8UL, 0xce0466aaUL, 0xf96ea4abUL, 0x7c78ebaeUL, 0x4b1229afUL,
+    0x12ac6fadUL, 0x25c6adacUL, 0x1881f1a7UL, 0x2feb33a6UL, 0x765575a4UL,
+    0x413fb7a5UL, 0xc429f8a0UL, 0xf3433aa1UL, 0xaafd7ca3UL, 0x9d97bea2UL,
+    0xd073c4b5UL, 0xe71906b4UL, 0xbea740b6UL, 0x89cd82b7UL, 0x0cdbcdb2UL,
+    0x3bb10fb3UL, 0x620f49b1UL, 0x55658bb0UL, 0x6822d7bbUL, 0x5f4815baUL,
+    0x06f653b8UL, 0x319c91b9UL, 0xb48adebcUL, 0x83e01cbdUL, 0xda5e5abfUL,
+    0xed3498beUL
+  },
+  {
+    0x00000000UL, 0x6567bcb8UL, 0x8bc809aaUL, 0xeeafb512UL, 0x5797628fUL,
+    0x32f0de37UL, 0xdc5f6b25UL, 0xb938d79dUL, 0xef28b4c5UL, 0x8a4f087dUL,
+    0x64e0bd6fUL, 0x018701d7UL, 0xb8bfd64aUL, 0xddd86af2UL, 0x3377dfe0UL,
+    0x56106358UL, 0x9f571950UL, 0xfa30a5e8UL, 0x149f10faUL, 0x71f8ac42UL,
+    0xc8c07bdfUL, 0xada7c767UL, 0x43087275UL, 0x266fcecdUL, 0x707fad95UL,
+    0x1518112dUL, 0xfbb7a43fUL, 0x9ed01887UL, 0x27e8cf1aUL, 0x428f73a2UL,
+    0xac20c6b0UL, 0xc9477a08UL, 0x3eaf32a0UL, 0x5bc88e18UL, 0xb5673b0aUL,
+    0xd00087b2UL, 0x6938502fUL, 0x0c5fec97UL, 0xe2f05985UL, 0x8797e53dUL,
+    0xd1878665UL, 0xb4e03addUL, 0x5a4f8fcfUL, 0x3f283377UL, 0x8610e4eaUL,
+    0xe3775852UL, 0x0dd8ed40UL, 0x68bf51f8UL, 0xa1f82bf0UL, 0xc49f9748UL,
+    0x2a30225aUL, 0x4f579ee2UL, 0xf66f497fUL, 0x9308f5c7UL, 0x7da740d5UL,
+    0x18c0fc6dUL, 0x4ed09f35UL, 0x2bb7238dUL, 0xc518969fUL, 0xa07f2a27UL,
+    0x1947fdbaUL, 0x7c204102UL, 0x928ff410UL, 0xf7e848a8UL, 0x3d58149bUL,
+    0x583fa823UL, 0xb6901d31UL, 0xd3f7a189UL, 0x6acf7614UL, 0x0fa8caacUL,
+    0xe1077fbeUL, 0x8460c306UL, 0xd270a05eUL, 0xb7171ce6UL, 0x59b8a9f4UL,
+    0x3cdf154cUL, 0x85e7c2d1UL, 0xe0807e69UL, 0x0e2fcb7bUL, 0x6b4877c3UL,
+    0xa20f0dcbUL, 0xc768b173UL, 0x29c70461UL, 0x4ca0b8d9UL, 0xf5986f44UL,
+    0x90ffd3fcUL, 0x7e5066eeUL, 0x1b37da56UL, 0x4d27b90eUL, 0x284005b6UL,
+    0xc6efb0a4UL, 0xa3880c1cUL, 0x1ab0db81UL, 0x7fd76739UL, 0x9178d22bUL,
+    0xf41f6e93UL, 0x03f7263bUL, 0x66909a83UL, 0x883f2f91UL, 0xed589329UL,
+    0x546044b4UL, 0x3107f80cUL, 0xdfa84d1eUL, 0xbacff1a6UL, 0xecdf92feUL,
+    0x89b82e46UL, 0x67179b54UL, 0x027027ecUL, 0xbb48f071UL, 0xde2f4cc9UL,
+    0x3080f9dbUL, 0x55e74563UL, 0x9ca03f6bUL, 0xf9c783d3UL, 0x176836c1UL,
+    0x720f8a79UL, 0xcb375de4UL, 0xae50e15cUL, 0x40ff544eUL, 0x2598e8f6UL,
+    0x73888baeUL, 0x16ef3716UL, 0xf8408204UL, 0x9d273ebcUL, 0x241fe921UL,
+    0x41785599UL, 0xafd7e08bUL, 0xcab05c33UL, 0x3bb659edUL, 0x5ed1e555UL,
+    0xb07e5047UL, 0xd519ecffUL, 0x6c213b62UL, 0x094687daUL, 0xe7e932c8UL,
+    0x828e8e70UL, 0xd49eed28UL, 0xb1f95190UL, 0x5f56e482UL, 0x3a31583aUL,
+    0x83098fa7UL, 0xe66e331fUL, 0x08c1860dUL, 0x6da63ab5UL, 0xa4e140bdUL,
+    0xc186fc05UL, 0x2f294917UL, 0x4a4ef5afUL, 0xf3762232UL, 0x96119e8aUL,
+    0x78be2b98UL, 0x1dd99720UL, 0x4bc9f478UL, 0x2eae48c0UL, 0xc001fdd2UL,
+    0xa566416aUL, 0x1c5e96f7UL, 0x79392a4fUL, 0x97969f5dUL, 0xf2f123e5UL,
+    0x05196b4dUL, 0x607ed7f5UL, 0x8ed162e7UL, 0xebb6de5fUL, 0x528e09c2UL,
+    0x37e9b57aUL, 0xd9460068UL, 0xbc21bcd0UL, 0xea31df88UL, 0x8f566330UL,
+    0x61f9d622UL, 0x049e6a9aUL, 0xbda6bd07UL, 0xd8c101bfUL, 0x366eb4adUL,
+    0x53090815UL, 0x9a4e721dUL, 0xff29cea5UL, 0x11867bb7UL, 0x74e1c70fUL,
+    0xcdd91092UL, 0xa8beac2aUL, 0x46111938UL, 0x2376a580UL, 0x7566c6d8UL,
+    0x10017a60UL, 0xfeaecf72UL, 0x9bc973caUL, 0x22f1a457UL, 0x479618efUL,
+    0xa939adfdUL, 0xcc5e1145UL, 0x06ee4d76UL, 0x6389f1ceUL, 0x8d2644dcUL,
+    0xe841f864UL, 0x51792ff9UL, 0x341e9341UL, 0xdab12653UL, 0xbfd69aebUL,
+    0xe9c6f9b3UL, 0x8ca1450bUL, 0x620ef019UL, 0x07694ca1UL, 0xbe519b3cUL,
+    0xdb362784UL, 0x35999296UL, 0x50fe2e2eUL, 0x99b95426UL, 0xfcdee89eUL,
+    0x12715d8cUL, 0x7716e134UL, 0xce2e36a9UL, 0xab498a11UL, 0x45e63f03UL,
+    0x208183bbUL, 0x7691e0e3UL, 0x13f65c5bUL, 0xfd59e949UL, 0x983e55f1UL,
+    0x2106826cUL, 0x44613ed4UL, 0xaace8bc6UL, 0xcfa9377eUL, 0x38417fd6UL,
+    0x5d26c36eUL, 0xb389767cUL, 0xd6eecac4UL, 0x6fd61d59UL, 0x0ab1a1e1UL,
+    0xe41e14f3UL, 0x8179a84bUL, 0xd769cb13UL, 0xb20e77abUL, 0x5ca1c2b9UL,
+    0x39c67e01UL, 0x80fea99cUL, 0xe5991524UL, 0x0b36a036UL, 0x6e511c8eUL,
+    0xa7166686UL, 0xc271da3eUL, 0x2cde6f2cUL, 0x49b9d394UL, 0xf0810409UL,
+    0x95e6b8b1UL, 0x7b490da3UL, 0x1e2eb11bUL, 0x483ed243UL, 0x2d596efbUL,
+    0xc3f6dbe9UL, 0xa6916751UL, 0x1fa9b0ccUL, 0x7ace0c74UL, 0x9461b966UL,
+    0xf10605deUL
+#endif
+  }
+};
diff --git a/updater/zlib123/deflate.c b/updater/zlib123/deflate.c
new file mode 100644
index 0000000..b94560a
--- /dev/null
+++ b/updater/zlib123/deflate.c
@@ -0,0 +1,1674 @@
+/* deflate.c -- compress data using the deflation algorithm
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/*
+ *  ALGORITHM
+ *
+ *      The "deflation" process depends on being able to identify portions
+ *      of the input text which are identical to earlier input (within a
+ *      sliding window trailing behind the input currently being processed).
+ *
+ *      The most straightforward technique turns out to be the fastest for
+ *      most input files: try all possible matches and select the longest.
+ *      The key feature of this algorithm is that insertions into the string
+ *      dictionary are very simple and thus fast, and deletions are avoided
+ *      completely. Insertions are performed at each input character, whereas
+ *      string matches are performed only when the previous match ends. So it
+ *      is preferable to spend more time in matches to allow very fast string
+ *      insertions and avoid deletions. The matching algorithm for small
+ *      strings is inspired from that of Rabin & Karp. A brute force approach
+ *      is used to find longer strings when a small match has been found.
+ *      A similar algorithm is used in comic (by Jan-Mark Wams) and freeze
+ *      (by Leonid Broukhis).
+ *         A previous version of this file used a more sophisticated algorithm
+ *      (by Fiala and Greene) which is guaranteed to run in linear amortized
+ *      time, but has a larger average cost, uses more memory and is patented.
+ *      However the F&G algorithm may be faster for some highly redundant
+ *      files if the parameter max_chain_length (described below) is too large.
+ *
+ *  ACKNOWLEDGEMENTS
+ *
+ *      The idea of lazy evaluation of matches is due to Jan-Mark Wams, and
+ *      I found it in 'freeze' written by Leonid Broukhis.
+ *      Thanks to many people for bug reports and testing.
+ *
+ *  REFERENCES
+ *
+ *      Deutsch, L.P.,"DEFLATE Compressed Data Format Specification".
+ *      Available in http://www.ietf.org/rfc/rfc1951.txt
+ *
+ *      A description of the Rabin and Karp algorithm is given in the book
+ *         "Algorithms" by R. Sedgewick, Addison-Wesley, p252.
+ *
+ *      Fiala,E.R., and Greene,D.H.
+ *         Data Compression with Finite Windows, Comm.ACM, 32,4 (1989) 490-595
+ *
+ */
+
+/* @(#) $Id$ */
+
+#include "deflate.h"
+
+const char deflate_copyright[] =
+   " deflate 1.2.3 Copyright 1995-2005 Jean-loup Gailly ";
+/*
+  If you use the zlib library in a product, an acknowledgment is welcome
+  in the documentation of your product. If for some reason you cannot
+  include such an acknowledgment, I would appreciate that you keep this
+  copyright string in the executable of your product.
+ */
+
+/* ===========================================================================
+ *  Function prototypes.
+ */
+typedef enum {
+    need_more,      /* block not completed, need more input or more output */
+    block_done,     /* block flush performed */
+    finish_started, /* finish started, need only more output at next deflate */
+    finish_done     /* finish done, accept no more input or output */
+} block_state;
+
+typedef block_state (*compress_func) OF((deflate_state *s, int flush));
+/* Compression function. Returns the block state after the call. */
+
+local void fill_window    OF((deflate_state *s));
+local block_state deflate_stored OF((deflate_state *s, int flush));
+local block_state deflate_fast   OF((deflate_state *s, int flush));
+#ifndef FASTEST
+local block_state deflate_slow   OF((deflate_state *s, int flush));
+#endif
+local void lm_init        OF((deflate_state *s));
+local void putShortMSB    OF((deflate_state *s, uInt b));
+local void flush_pending  OF((z_streamp strm));
+local int read_buf        OF((z_streamp strm, Bytef *buf, unsigned size));
+#ifndef FASTEST
+#ifdef ASMV
+      void match_init OF((void)); /* asm code initialization */
+      uInt longest_match  OF((deflate_state *s, IPos cur_match));
+#else
+local uInt longest_match  OF((deflate_state *s, IPos cur_match));
+#endif
+#endif
+local uInt longest_match_fast OF((deflate_state *s, IPos cur_match));
+
+#ifdef DEBUG
+local  void check_match OF((deflate_state *s, IPos start, IPos match,
+                            int length));
+#endif
+
+/* ===========================================================================
+ * Local data
+ */
+
+#define NIL 0
+/* Tail of hash chains */
+
+#ifndef TOO_FAR
+#  define TOO_FAR 4096
+#endif
+/* Matches of length 3 are discarded if their distance exceeds TOO_FAR */
+
+#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
+/* Minimum amount of lookahead, except at the end of the input file.
+ * See deflate.c for comments about the MIN_MATCH+1.
+ */
+
+/* Values for max_lazy_match, good_match and max_chain_length, depending on
+ * the desired pack level (0..9). The values given below have been tuned to
+ * exclude worst case performance for pathological files. Better values may be
+ * found for specific files.
+ */
+typedef struct config_s {
+   ush good_length; /* reduce lazy search above this match length */
+   ush max_lazy;    /* do not perform lazy search above this match length */
+   ush nice_length; /* quit search above this match length */
+   ush max_chain;
+   compress_func func;
+} config;
+
+#ifdef FASTEST
+local const config configuration_table[2] = {
+/*      good lazy nice chain */
+/* 0 */ {0,    0,  0,    0, deflate_stored},  /* store only */
+/* 1 */ {4,    4,  8,    4, deflate_fast}}; /* max speed, no lazy matches */
+#else
+local const config configuration_table[10] = {
+/*      good lazy nice chain */
+/* 0 */ {0,    0,  0,    0, deflate_stored},  /* store only */
+/* 1 */ {4,    4,  8,    4, deflate_fast}, /* max speed, no lazy matches */
+/* 2 */ {4,    5, 16,    8, deflate_fast},
+/* 3 */ {4,    6, 32,   32, deflate_fast},
+
+/* 4 */ {4,    4, 16,   16, deflate_slow},  /* lazy matches */
+/* 5 */ {8,   16, 32,   32, deflate_slow},
+/* 6 */ {8,   16, 128, 128, deflate_slow},
+/* 7 */ {8,   32, 128, 256, deflate_slow},
+/* 8 */ {32, 128, 258, 1024, deflate_slow},
+/* 9 */ {32, 258, 258, 4096, deflate_slow}}; /* max compression */
+#endif
+
+/* Note: the deflate() code requires max_lazy >= MIN_MATCH and max_chain >= 4
+ * For deflate_fast() (levels <= 3) good is ignored and lazy has a different
+ * meaning.
+ */
+
+#define EQUAL 0
+/* result of memcmp for equal strings */
+
+#ifndef NO_DUMMY_DECL
+struct static_tree_desc_s {int dummy;}; /* for buggy compilers */
+#endif
+
+/* ===========================================================================
+ * Update a hash value with the given input byte
+ * IN  assertion: all calls to to UPDATE_HASH are made with consecutive
+ *    input characters, so that a running hash key can be computed from the
+ *    previous key instead of complete recalculation each time.
+ */
+#define UPDATE_HASH(s,h,c) (h = (((h)<<s->hash_shift) ^ (c)) & s->hash_mask)
+
+
+/* ===========================================================================
+ * Insert string str in the dictionary and set match_head to the previous head
+ * of the hash chain (the most recent string with same hash key). Return
+ * the previous length of the hash chain.
+ * If this file is compiled with -DFASTEST, the compression level is forced
+ * to 1, and no hash chains are maintained.
+ * IN  assertion: all calls to to INSERT_STRING are made with consecutive
+ *    input characters and the first MIN_MATCH bytes of str are valid
+ *    (except for the last MIN_MATCH-1 bytes of the input file).
+ */
+#ifdef FASTEST
+#define INSERT_STRING(s, str, match_head) \
+   (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
+    match_head = s->head[s->ins_h], \
+    s->head[s->ins_h] = (Pos)(str))
+#else
+#define INSERT_STRING(s, str, match_head) \
+   (UPDATE_HASH(s, s->ins_h, s->window[(str) + (MIN_MATCH-1)]), \
+    match_head = s->prev[(str) & s->w_mask] = s->head[s->ins_h], \
+    s->head[s->ins_h] = (Pos)(str))
+#endif
+
+/* ===========================================================================
+ * Initialize the hash table (avoiding 64K overflow for 16 bit systems).
+ * prev[] will be initialized on the fly.
+ */
+#define CLEAR_HASH(s) \
+    s->head[s->hash_size-1] = NIL; \
+    zmemzero((Bytef *)s->head, (unsigned)(s->hash_size-1)*sizeof(*s->head));
+
+/* ========================================================================= */
+int ZEXPORT deflateInit_(z_streamp strm, int level, const char *version, int stream_size)
+{
+    return deflateInit2_(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL,
+                         Z_DEFAULT_STRATEGY, version, stream_size);
+    /* To do: ignore strm->next_in if we use it as window */
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateInit2_(z_streamp strm, int  level, int  method, int  windowBits, int memLevel, int strategy, const char *version, int stream_size)
+{
+    deflate_state *s;
+    int wrap = 1;
+    static const char my_version[] = ZLIB_VERSION;
+
+    ushf *overlay;
+    /* We overlay pending_buf and d_buf+l_buf. This works since the average
+     * output size for (length,distance) codes is <= 24 bits.
+     */
+
+    if (version == Z_NULL || version[0] != my_version[0] ||
+        stream_size != sizeof(z_stream)) {
+        return Z_VERSION_ERROR;
+    }
+    if (strm == Z_NULL) return Z_STREAM_ERROR;
+
+    strm->msg = Z_NULL;
+    if (strm->zalloc == (alloc_func)0) {
+        strm->zalloc = zcalloc;
+        strm->opaque = (voidpf)0;
+    }
+    if (strm->zfree == (free_func)0) strm->zfree = zcfree;
+
+#ifdef FASTEST
+    if (level != 0) level = 1;
+#else
+    if (level == Z_DEFAULT_COMPRESSION) level = 6;
+#endif
+
+    if (windowBits < 0) { /* suppress zlib wrapper */
+        wrap = 0;
+        windowBits = -windowBits;
+    }
+#ifdef GZIP
+    else if (windowBits > 15) {
+        wrap = 2;       /* write gzip wrapper instead */
+        windowBits -= 16;
+    }
+#endif
+    if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED ||
+        windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||
+        strategy < 0 || strategy > Z_FIXED) {
+        return Z_STREAM_ERROR;
+    }
+    if (windowBits == 8) windowBits = 9;  /* until 256-byte window bug fixed */
+    s = (deflate_state *) ZALLOC(strm, 1, sizeof(deflate_state));
+    if (s == Z_NULL) return Z_MEM_ERROR;
+    strm->state = (struct internal_state FAR *)s;
+    s->strm = strm;
+
+    s->wrap = wrap;
+    s->gzhead = Z_NULL;
+    s->w_bits = windowBits;
+    s->w_size = 1 << s->w_bits;
+    s->w_mask = s->w_size - 1;
+
+    s->hash_bits = memLevel + 7;
+    s->hash_size = 1 << s->hash_bits;
+    s->hash_mask = s->hash_size - 1;
+    s->hash_shift =  ((s->hash_bits+MIN_MATCH-1)/MIN_MATCH);
+
+    s->window = (Bytef *) ZALLOC(strm, s->w_size, 2*sizeof(Byte));
+    s->prev   = (Posf *)  ZALLOC(strm, s->w_size, sizeof(Pos));
+    s->head   = (Posf *)  ZALLOC(strm, s->hash_size, sizeof(Pos));
+
+    s->lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */
+
+    overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);
+    s->pending_buf = (uchf *) overlay;
+    s->pending_buf_size = (ulg)s->lit_bufsize * (sizeof(ush)+2L);
+
+    if (s->window == Z_NULL || s->prev == Z_NULL || s->head == Z_NULL ||
+        s->pending_buf == Z_NULL) {
+        s->status = FINISH_STATE;
+        strm->msg = (char*)ERR_MSG(Z_MEM_ERROR);
+        deflateEnd (strm);
+        return Z_MEM_ERROR;
+    }
+    s->d_buf = overlay + s->lit_bufsize/sizeof(ush);
+    s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;
+
+    s->level = level;
+    s->strategy = strategy;
+    s->method = (Byte)method;
+
+    return deflateReset(strm);
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateSetDictionary (z_streamp strm, const Bytef *dictionary, uInt  dictLength)
+{
+    deflate_state *s;
+    uInt length = dictLength;
+    uInt n;
+    IPos hash_head = 0;
+
+    if (strm == Z_NULL || strm->state == Z_NULL || dictionary == Z_NULL ||
+        strm->state->wrap == 2 ||
+        (strm->state->wrap == 1 && strm->state->status != INIT_STATE))
+        return Z_STREAM_ERROR;
+
+    s = strm->state;
+    if (s->wrap)
+        strm->adler = adler32(strm->adler, dictionary, dictLength);
+
+    if (length < MIN_MATCH) return Z_OK;
+    if (length > MAX_DIST(s)) {
+        length = MAX_DIST(s);
+        dictionary += dictLength - length; /* use the tail of the dictionary */
+    }
+    zmemcpy(s->window, dictionary, length);
+    s->strstart = length;
+    s->block_start = (long)length;
+
+    /* Insert all strings in the hash table (except for the last two bytes).
+     * s->lookahead stays null, so s->ins_h will be recomputed at the next
+     * call of fill_window.
+     */
+    s->ins_h = s->window[0];
+    UPDATE_HASH(s, s->ins_h, s->window[1]);
+    for (n = 0; n <= length - MIN_MATCH; n++) {
+        INSERT_STRING(s, n, hash_head);
+    }
+    if (hash_head) hash_head = 0;  /* to make compiler happy */
+    return Z_OK;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateReset (z_streamp strm)
+{
+    deflate_state *s;
+
+    if (strm == Z_NULL || strm->state == Z_NULL ||
+        strm->zalloc == (alloc_func)0 || strm->zfree == (free_func)0) {
+        return Z_STREAM_ERROR;
+    }
+
+    strm->total_in = strm->total_out = 0;
+    strm->msg = Z_NULL; /* use zfree if we ever allocate msg dynamically */
+    strm->data_type = Z_UNKNOWN;
+
+    s = (deflate_state *)strm->state;
+    s->pending = 0;
+    s->pending_out = s->pending_buf;
+
+    if (s->wrap < 0) {
+        s->wrap = -s->wrap; /* was made negative by deflate(..., Z_FINISH); */
+    }
+    s->status = s->wrap ? INIT_STATE : BUSY_STATE;
+    strm->adler =
+#ifdef GZIP
+        s->wrap == 2 ? crc32(0L, Z_NULL, 0) :
+#endif
+        adler32(0L, Z_NULL, 0);
+    s->last_flush = Z_NO_FLUSH;
+
+    _tr_init(s);
+    lm_init(s);
+
+    return Z_OK;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateSetHeader (z_streamp strm, gz_headerp head)
+{
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+    if (strm->state->wrap != 2) return Z_STREAM_ERROR;
+    strm->state->gzhead = head;
+    return Z_OK;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflatePrime (z_streamp strm, int bits, int value)
+{
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+    strm->state->bi_valid = bits;
+    strm->state->bi_buf = (ush)(value & ((1 << bits) - 1));
+    return Z_OK;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateParams(z_streamp strm, int level, int strategy)
+{
+    deflate_state *s;
+    compress_func func;
+    int err = Z_OK;
+
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+    s = strm->state;
+
+#ifdef FASTEST
+    if (level != 0) level = 1;
+#else
+    if (level == Z_DEFAULT_COMPRESSION) level = 6;
+#endif
+    if (level < 0 || level > 9 || strategy < 0 || strategy > Z_FIXED) {
+        return Z_STREAM_ERROR;
+    }
+    func = configuration_table[s->level].func;
+
+    if (func != configuration_table[level].func && strm->total_in != 0) {
+        /* Flush the last buffer: */
+        err = deflate(strm, Z_PARTIAL_FLUSH);
+    }
+    if (s->level != level) {
+        s->level = level;
+        s->max_lazy_match   = configuration_table[level].max_lazy;
+        s->good_match       = configuration_table[level].good_length;
+        s->nice_match       = configuration_table[level].nice_length;
+        s->max_chain_length = configuration_table[level].max_chain;
+    }
+    s->strategy = strategy;
+    return err;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateTune(z_streamp strm, int good_length, int max_lazy, int nice_length, int max_chain)
+{
+    deflate_state *s;
+
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+    s = strm->state;
+    s->good_match = good_length;
+    s->max_lazy_match = max_lazy;
+    s->nice_match = nice_length;
+    s->max_chain_length = max_chain;
+    return Z_OK;
+}
+
+/* =========================================================================
+ * For the default windowBits of 15 and memLevel of 8, this function returns
+ * a close to exact, as well as small, upper bound on the compressed size.
+ * They are coded as constants here for a reason--if the #define's are
+ * changed, then this function needs to be changed as well.  The return
+ * value for 15 and 8 only works for those exact settings.
+ *
+ * For any setting other than those defaults for windowBits and memLevel,
+ * the value returned is a conservative worst case for the maximum expansion
+ * resulting from using fixed blocks instead of stored blocks, which deflate
+ * can emit on compressed data for some combinations of the parameters.
+ *
+ * This function could be more sophisticated to provide closer upper bounds
+ * for every combination of windowBits and memLevel, as well as wrap.
+ * But even the conservative upper bound of about 14% expansion does not
+ * seem onerous for output buffer allocation.
+ */uLong ZEXPORT deflateBound(z_streamp strm, uLong sourceLen)
+{
+    deflate_state *s;
+    uLong destLen;
+
+    /* conservative upper bound */
+    destLen = sourceLen +
+              ((sourceLen + 7) >> 3) + ((sourceLen + 63) >> 6) + 11;
+
+    /* if can't get parameters, return conservative bound */
+    if (strm == Z_NULL || strm->state == Z_NULL)
+        return destLen;
+
+    /* if not default parameters, return conservative bound */
+    s = strm->state;
+    if (s->w_bits != 15 || s->hash_bits != 8 + 7)
+        return destLen;
+
+    /* default settings: return tight bound for that case */
+    return compressBound(sourceLen);
+}
+
+/* =========================================================================
+ * Put a short in the pending buffer. The 16-bit value is put in MSB order.
+ * IN assertion: the stream state is correct and there is enough room in
+ * pending_buf.
+ */
+local void putShortMSB (deflate_state *s, uInt b)
+{
+    put_byte(s, (Byte)(b >> 8));
+    put_byte(s, (Byte)(b & 0xff));
+}
+
+/* =========================================================================
+ * Flush as much pending output as possible. All deflate() output goes
+ * through this function so some applications may wish to modify it
+ * to avoid allocating a large strm->next_out buffer and copying into it.
+ * (See also read_buf()).
+ */
+local void flush_pending(z_streamp strm)
+{
+    unsigned len = strm->state->pending;
+
+    if (len > strm->avail_out) len = strm->avail_out;
+    if (len == 0) return;
+
+    zmemcpy(strm->next_out, strm->state->pending_out, len);
+    strm->next_out  += len;
+    strm->state->pending_out  += len;
+    strm->total_out += len;
+    strm->avail_out  -= len;
+    strm->state->pending -= len;
+    if (strm->state->pending == 0) {
+        strm->state->pending_out = strm->state->pending_buf;
+    }
+}
+
+/* ========================================================================= */
+int ZEXPORT deflate (z_streamp strm, int flush)
+{
+    int old_flush; /* value of flush param for previous deflate call */
+    deflate_state *s;
+
+    if (strm == Z_NULL || strm->state == Z_NULL ||
+        flush > Z_FINISH || flush < 0) {
+        return Z_STREAM_ERROR;
+    }
+    s = strm->state;
+
+    if (strm->next_out == Z_NULL ||
+        (strm->next_in == Z_NULL && strm->avail_in != 0) ||
+        (s->status == FINISH_STATE && flush != Z_FINISH)) {
+        ERR_RETURN(strm, Z_STREAM_ERROR);
+    }
+    if (strm->avail_out == 0) ERR_RETURN(strm, Z_BUF_ERROR);
+
+    s->strm = strm; /* just in case */
+    old_flush = s->last_flush;
+    s->last_flush = flush;
+
+    /* Write the header */
+    if (s->status == INIT_STATE) {
+#ifdef GZIP
+        if (s->wrap == 2) {
+            strm->adler = crc32(0L, Z_NULL, 0);
+            put_byte(s, 31);
+            put_byte(s, 139);
+            put_byte(s, 8);
+            if (s->gzhead == NULL) {
+                put_byte(s, 0);
+                put_byte(s, 0);
+                put_byte(s, 0);
+                put_byte(s, 0);
+                put_byte(s, 0);
+                put_byte(s, s->level == 9 ? 2 :
+                            (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
+                             4 : 0));
+                put_byte(s, OS_CODE);
+                s->status = BUSY_STATE;
+            }
+            else {
+                put_byte(s, (s->gzhead->text ? 1 : 0) +
+                            (s->gzhead->hcrc ? 2 : 0) +
+                            (s->gzhead->extra == Z_NULL ? 0 : 4) +
+                            (s->gzhead->name == Z_NULL ? 0 : 8) +
+                            (s->gzhead->comment == Z_NULL ? 0 : 16)
+                        );
+                put_byte(s, (Byte)(s->gzhead->time & 0xff));
+                put_byte(s, (Byte)((s->gzhead->time >> 8) & 0xff));
+                put_byte(s, (Byte)((s->gzhead->time >> 16) & 0xff));
+                put_byte(s, (Byte)((s->gzhead->time >> 24) & 0xff));
+                put_byte(s, s->level == 9 ? 2 :
+                            (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2 ?
+                             4 : 0));
+                put_byte(s, s->gzhead->os & 0xff);
+                if (s->gzhead->extra != NULL) {
+                    put_byte(s, s->gzhead->extra_len & 0xff);
+                    put_byte(s, (s->gzhead->extra_len >> 8) & 0xff);
+                }
+                if (s->gzhead->hcrc)
+                    strm->adler = crc32(strm->adler, s->pending_buf,
+                                        s->pending);
+                s->gzindex = 0;
+                s->status = EXTRA_STATE;
+            }
+        }
+        else
+#endif
+        {
+            uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;
+            uInt level_flags;
+
+            if (s->strategy >= Z_HUFFMAN_ONLY || s->level < 2)
+                level_flags = 0;
+            else if (s->level < 6)
+                level_flags = 1;
+            else if (s->level == 6)
+                level_flags = 2;
+            else
+                level_flags = 3;
+            header |= (level_flags << 6);
+            if (s->strstart != 0) header |= PRESET_DICT;
+            header += 31 - (header % 31);
+
+            s->status = BUSY_STATE;
+            putShortMSB(s, header);
+
+            /* Save the adler32 of the preset dictionary: */
+            if (s->strstart != 0) {
+                putShortMSB(s, (uInt)(strm->adler >> 16));
+                putShortMSB(s, (uInt)(strm->adler & 0xffff));
+            }
+            strm->adler = adler32(0L, Z_NULL, 0);
+        }
+    }
+#ifdef GZIP
+    if (s->status == EXTRA_STATE) {
+        if (s->gzhead->extra != NULL) {
+            uInt beg = s->pending;  /* start of bytes to update crc */
+
+            while (s->gzindex < (s->gzhead->extra_len & 0xffff)) {
+                if (s->pending == s->pending_buf_size) {
+                    if (s->gzhead->hcrc && s->pending > beg)
+                        strm->adler = crc32(strm->adler, s->pending_buf + beg,
+                                            s->pending - beg);
+                    flush_pending(strm);
+                    beg = s->pending;
+                    if (s->pending == s->pending_buf_size)
+                        break;
+                }
+                put_byte(s, s->gzhead->extra[s->gzindex]);
+                s->gzindex++;
+            }
+            if (s->gzhead->hcrc && s->pending > beg)
+                strm->adler = crc32(strm->adler, s->pending_buf + beg,
+                                    s->pending - beg);
+            if (s->gzindex == s->gzhead->extra_len) {
+                s->gzindex = 0;
+                s->status = NAME_STATE;
+            }
+        }
+        else
+            s->status = NAME_STATE;
+    }
+    if (s->status == NAME_STATE) {
+        if (s->gzhead->name != NULL) {
+            uInt beg = s->pending;  /* start of bytes to update crc */
+            int val;
+
+            do {
+                if (s->pending == s->pending_buf_size) {
+                    if (s->gzhead->hcrc && s->pending > beg)
+                        strm->adler = crc32(strm->adler, s->pending_buf + beg,
+                                            s->pending - beg);
+                    flush_pending(strm);
+                    beg = s->pending;
+                    if (s->pending == s->pending_buf_size) {
+                        val = 1;
+                        break;
+                    }
+                }
+                val = s->gzhead->name[s->gzindex++];
+                put_byte(s, val);
+            } while (val != 0);
+            if (s->gzhead->hcrc && s->pending > beg)
+                strm->adler = crc32(strm->adler, s->pending_buf + beg,
+                                    s->pending - beg);
+            if (val == 0) {
+                s->gzindex = 0;
+                s->status = COMMENT_STATE;
+            }
+        }
+        else
+            s->status = COMMENT_STATE;
+    }
+    if (s->status == COMMENT_STATE) {
+        if (s->gzhead->comment != NULL) {
+            uInt beg = s->pending;  /* start of bytes to update crc */
+            int val;
+
+            do {
+                if (s->pending == s->pending_buf_size) {
+                    if (s->gzhead->hcrc && s->pending > beg)
+                        strm->adler = crc32(strm->adler, s->pending_buf + beg,
+                                            s->pending - beg);
+                    flush_pending(strm);
+                    beg = s->pending;
+                    if (s->pending == s->pending_buf_size) {
+                        val = 1;
+                        break;
+                    }
+                }
+                val = s->gzhead->comment[s->gzindex++];
+                put_byte(s, val);
+            } while (val != 0);
+            if (s->gzhead->hcrc && s->pending > beg)
+                strm->adler = crc32(strm->adler, s->pending_buf + beg,
+                                    s->pending - beg);
+            if (val == 0)
+                s->status = HCRC_STATE;
+        }
+        else
+            s->status = HCRC_STATE;
+    }
+    if (s->status == HCRC_STATE) {
+        if (s->gzhead->hcrc) {
+            if (s->pending + 2 > s->pending_buf_size)
+                flush_pending(strm);
+            if (s->pending + 2 <= s->pending_buf_size) {
+                put_byte(s, (Byte)(strm->adler & 0xff));
+                put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
+                strm->adler = crc32(0L, Z_NULL, 0);
+                s->status = BUSY_STATE;
+            }
+        }
+        else
+            s->status = BUSY_STATE;
+    }
+#endif
+
+    /* Flush as much pending output as possible */
+    if (s->pending != 0) {
+        flush_pending(strm);
+        if (strm->avail_out == 0) {
+            /* Since avail_out is 0, deflate will be called again with
+             * more output space, but possibly with both pending and
+             * avail_in equal to zero. There won't be anything to do,
+             * but this is not an error situation so make sure we
+             * return OK instead of BUF_ERROR at next call of deflate:
+             */
+            s->last_flush = -1;
+            return Z_OK;
+        }
+
+    /* Make sure there is something to do and avoid duplicate consecutive
+     * flushes. For repeated and useless calls with Z_FINISH, we keep
+     * returning Z_STREAM_END instead of Z_BUF_ERROR.
+     */
+    } else if (strm->avail_in == 0 && flush <= old_flush &&
+               flush != Z_FINISH) {
+        ERR_RETURN(strm, Z_BUF_ERROR);
+    }
+
+    /* User must not provide more input after the first FINISH: */
+    if (s->status == FINISH_STATE && strm->avail_in != 0) {
+        ERR_RETURN(strm, Z_BUF_ERROR);
+    }
+
+    /* Start a new block or continue the current one.
+     */
+    if (strm->avail_in != 0 || s->lookahead != 0 ||
+        (flush != Z_NO_FLUSH && s->status != FINISH_STATE)) {
+        block_state bstate;
+
+        bstate = (*(configuration_table[s->level].func))(s, flush);
+
+        if (bstate == finish_started || bstate == finish_done) {
+            s->status = FINISH_STATE;
+        }
+        if (bstate == need_more || bstate == finish_started) {
+            if (strm->avail_out == 0) {
+                s->last_flush = -1; /* avoid BUF_ERROR next call, see above */
+            }
+            return Z_OK;
+            /* If flush != Z_NO_FLUSH && avail_out == 0, the next call
+             * of deflate should use the same flush parameter to make sure
+             * that the flush is complete. So we don't have to output an
+             * empty block here, this will be done at next call. This also
+             * ensures that for a very small output buffer, we emit at most
+             * one empty block.
+             */
+        }
+        if (bstate == block_done) {
+            if (flush == Z_PARTIAL_FLUSH) {
+                _tr_align(s);
+            } else { /* FULL_FLUSH or SYNC_FLUSH */
+                _tr_stored_block(s, (char*)0, 0L, 0);
+                /* For a full flush, this empty block will be recognized
+                 * as a special marker by inflate_sync().
+                 */
+                if (flush == Z_FULL_FLUSH) {
+                    CLEAR_HASH(s);             /* forget history */
+                }
+            }
+            flush_pending(strm);
+            if (strm->avail_out == 0) {
+              s->last_flush = -1; /* avoid BUF_ERROR at next call, see above */
+              return Z_OK;
+            }
+        }
+    }
+    Assert(strm->avail_out > 0, "bug2");
+
+    if (flush != Z_FINISH) return Z_OK;
+    if (s->wrap <= 0) return Z_STREAM_END;
+
+    /* Write the trailer */
+#ifdef GZIP
+    if (s->wrap == 2) {
+        put_byte(s, (Byte)(strm->adler & 0xff));
+        put_byte(s, (Byte)((strm->adler >> 8) & 0xff));
+        put_byte(s, (Byte)((strm->adler >> 16) & 0xff));
+        put_byte(s, (Byte)((strm->adler >> 24) & 0xff));
+        put_byte(s, (Byte)(strm->total_in & 0xff));
+        put_byte(s, (Byte)((strm->total_in >> 8) & 0xff));
+        put_byte(s, (Byte)((strm->total_in >> 16) & 0xff));
+        put_byte(s, (Byte)((strm->total_in >> 24) & 0xff));
+    }
+    else
+#endif
+    {
+        putShortMSB(s, (uInt)(strm->adler >> 16));
+        putShortMSB(s, (uInt)(strm->adler & 0xffff));
+    }
+    flush_pending(strm);
+    /* If avail_out is zero, the application will call deflate again
+     * to flush the rest.
+     */
+    if (s->wrap > 0) s->wrap = -s->wrap; /* write the trailer only once! */
+    return s->pending != 0 ? Z_OK : Z_STREAM_END;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateEnd (z_streamp strm)
+{
+    int status;
+
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+
+    status = strm->state->status;
+    if (status != INIT_STATE &&
+        status != EXTRA_STATE &&
+        status != NAME_STATE &&
+        status != COMMENT_STATE &&
+        status != HCRC_STATE &&
+        status != BUSY_STATE &&
+        status != FINISH_STATE) {
+      return Z_STREAM_ERROR;
+    }
+
+    /* Deallocate in reverse order of allocations: */
+    TRY_FREE(strm, strm->state->pending_buf);
+    TRY_FREE(strm, strm->state->head);
+    TRY_FREE(strm, strm->state->prev);
+    TRY_FREE(strm, strm->state->window);
+
+    ZFREE(strm, strm->state);
+    strm->state = Z_NULL;
+
+    return status == BUSY_STATE ? Z_DATA_ERROR : Z_OK;
+}
+
+/* =========================================================================
+ * Copy the source state to the destination state.
+ * To simplify the source, this is not supported for 16-bit MSDOS (which
+ * doesn't have enough memory anyway to duplicate compression states).
+ */
+int ZEXPORT deflateCopy (z_streamp dest, z_streamp source)
+{
+#ifdef MAXSEG_64K
+    return Z_STREAM_ERROR;
+#else
+    deflate_state *ds;
+    deflate_state *ss;
+    ushf *overlay;
+
+
+    if (source == Z_NULL || dest == Z_NULL || source->state == Z_NULL) {
+        return Z_STREAM_ERROR;
+    }
+
+    ss = source->state;
+
+    zmemcpy(dest, source, sizeof(z_stream));
+
+    ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state));
+    if (ds == Z_NULL) return Z_MEM_ERROR;
+    dest->state = (struct internal_state FAR *) ds;
+    zmemcpy(ds, ss, sizeof(deflate_state));
+    ds->strm = dest;
+
+    ds->window = (Bytef *) ZALLOC(dest, ds->w_size, 2*sizeof(Byte));
+    ds->prev   = (Posf *)  ZALLOC(dest, ds->w_size, sizeof(Pos));
+    ds->head   = (Posf *)  ZALLOC(dest, ds->hash_size, sizeof(Pos));
+    overlay = (ushf *) ZALLOC(dest, ds->lit_bufsize, sizeof(ush)+2);
+    ds->pending_buf = (uchf *) overlay;
+    if (ds->window == Z_NULL || ds->prev == Z_NULL || ds->head == Z_NULL ||
+        ds->pending_buf == Z_NULL) {
+        deflateEnd (dest);
+        return Z_MEM_ERROR;
+    }
+    /* following zmemcpy do not work for 16-bit MSDOS */
+    zmemcpy(ds->window, ss->window, ds->w_size * 2 * sizeof(Byte));
+    zmemcpy(ds->prev, ss->prev, ds->w_size * sizeof(Pos));
+    zmemcpy(ds->head, ss->head, ds->hash_size * sizeof(Pos));
+    zmemcpy(ds->pending_buf, ss->pending_buf, (uInt)ds->pending_buf_size);
+
+    ds->pending_out = ds->pending_buf + (ss->pending_out - ss->pending_buf);
+    ds->d_buf = overlay + ds->lit_bufsize/sizeof(ush);
+    ds->l_buf = ds->pending_buf + (1+sizeof(ush))*ds->lit_bufsize;
+
+    ds->l_desc.dyn_tree = ds->dyn_ltree;
+    ds->d_desc.dyn_tree = ds->dyn_dtree;
+    ds->bl_desc.dyn_tree = ds->bl_tree;
+
+    return Z_OK;
+#endif /* MAXSEG_64K */
+}
+
+/* ===========================================================================
+ * Read a new buffer from the current input stream, update the adler32
+ * and total number of bytes read.  All deflate() input goes through
+ * this function so some applications may wish to modify it to avoid
+ * allocating a large strm->next_in buffer and copying from it.
+ * (See also flush_pending()).
+ */
+local int read_buf(z_streamp strm, Bytef *buf, unsigned size)
+{
+    unsigned len = strm->avail_in;
+
+    if (len > size) len = size;
+    if (len == 0) return 0;
+
+    strm->avail_in  -= len;
+
+    if (strm->state->wrap == 1) {
+        strm->adler = adler32(strm->adler, strm->next_in, len);
+    }
+#ifdef GZIP
+    else if (strm->state->wrap == 2) {
+        strm->adler = crc32(strm->adler, strm->next_in, len);
+    }
+#endif
+    zmemcpy(buf, strm->next_in, len);
+    strm->next_in  += len;
+    strm->total_in += len;
+
+    return (int)len;
+}
+
+/* ===========================================================================
+ * Initialize the "longest match" routines for a new zlib stream
+ */
+local void lm_init (deflate_state *s)
+{
+    s->window_size = (ulg)2L*s->w_size;
+
+    CLEAR_HASH(s);
+
+    /* Set the default configuration parameters:
+     */
+    s->max_lazy_match   = configuration_table[s->level].max_lazy;
+    s->good_match       = configuration_table[s->level].good_length;
+    s->nice_match       = configuration_table[s->level].nice_length;
+    s->max_chain_length = configuration_table[s->level].max_chain;
+
+    s->strstart = 0;
+    s->block_start = 0L;
+    s->lookahead = 0;
+    s->match_length = s->prev_length = MIN_MATCH-1;
+    s->match_available = 0;
+    s->ins_h = 0;
+#ifndef FASTEST
+#ifdef ASMV
+    match_init(); /* initialize the asm code */
+#endif
+#endif
+}
+
+#ifndef FASTEST
+/* ===========================================================================
+ * Set match_start to the longest match starting at the given string and
+ * return its length. Matches shorter or equal to prev_length are discarded,
+ * in which case the result is equal to prev_length and match_start is
+ * garbage.
+ * IN assertions: cur_match is the head of the hash chain for the current
+ *   string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1
+ * OUT assertion: the match length is not greater than s->lookahead.
+ */
+#ifndef ASMV
+/* For 80x86 and 680x0, an optimized version will be provided in match.asm or
+ * match.S. The code will be functionally equivalent.
+ */
+local uInt longest_match(deflate_state *s, IPos cur_match)                             /* current match */
+{
+    unsigned chain_length = s->max_chain_length;/* max hash chain length */
+    register Bytef *scan = s->window + s->strstart; /* current string */
+    register Bytef *match;                       /* matched string */
+    register int len;                           /* length of current match */
+    int best_len = s->prev_length;              /* best match length so far */
+    int nice_match = s->nice_match;             /* stop if match long enough */
+    IPos limit = s->strstart > (IPos)MAX_DIST(s) ?
+        s->strstart - (IPos)MAX_DIST(s) : NIL;
+    /* Stop when cur_match becomes <= limit. To simplify the code,
+     * we prevent matches with the string of window index 0.
+     */
+    Posf *prev = s->prev;
+    uInt wmask = s->w_mask;
+
+#ifdef UNALIGNED_OK
+    /* Compare two bytes at a time. Note: this is not always beneficial.
+     * Try with and without -DUNALIGNED_OK to check.
+     */
+    register Bytef *strend = s->window + s->strstart + MAX_MATCH - 1;
+    register ush scan_start = *(ushf*)scan;
+    register ush scan_end   = *(ushf*)(scan+best_len-1);
+#else
+    register Bytef *strend = s->window + s->strstart + MAX_MATCH;
+    register Byte scan_end1  = scan[best_len-1];
+    register Byte scan_end   = scan[best_len];
+#endif
+
+    /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
+     * It is easy to get rid of this optimization if necessary.
+     */
+    Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
+
+    /* Do not waste too much time if we already have a good match: */
+    if (s->prev_length >= s->good_match) {
+        chain_length >>= 2;
+    }
+    /* Do not look for matches beyond the end of the input. This is necessary
+     * to make deflate deterministic.
+     */
+    if ((uInt)nice_match > s->lookahead) nice_match = s->lookahead;
+
+    Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
+
+    do {
+        Assert(cur_match < s->strstart, "no future");
+        match = s->window + cur_match;
+
+        /* Skip to next match if the match length cannot increase
+         * or if the match length is less than 2.  Note that the checks below
+         * for insufficient lookahead only occur occasionally for performance
+         * reasons.  Therefore uninitialized memory will be accessed, and
+         * conditional jumps will be made that depend on those values.
+         * However the length of the match is limited to the lookahead, so
+         * the output of deflate is not affected by the uninitialized values.
+         */
+#if (defined(UNALIGNED_OK) && MAX_MATCH == 258)
+        /* This code assumes sizeof(unsigned short) == 2. Do not use
+         * UNALIGNED_OK if your compiler uses a different size.
+         */
+        if (*(ushf*)(match+best_len-1) != scan_end ||
+            *(ushf*)match != scan_start) continue;
+
+        /* It is not necessary to compare scan[2] and match[2] since they are
+         * always equal when the other bytes match, given that the hash keys
+         * are equal and that HASH_BITS >= 8. Compare 2 bytes at a time at
+         * strstart+3, +5, ... up to strstart+257. We check for insufficient
+         * lookahead only every 4th comparison; the 128th check will be made
+         * at strstart+257. If MAX_MATCH-2 is not a multiple of 8, it is
+         * necessary to put more guard bytes at the end of the window, or
+         * to check more often for insufficient lookahead.
+         */
+        Assert(scan[2] == match[2], "scan[2]?");
+        scan++, match++;
+        do {
+        } while (*(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
+                 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
+                 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
+                 *(ushf*)(scan+=2) == *(ushf*)(match+=2) &&
+                 scan < strend);
+        /* The funny "do {}" generates better code on most compilers */
+
+        /* Here, scan <= window+strstart+257 */
+        Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
+        if (*scan == *match) scan++;
+
+        len = (MAX_MATCH - 1) - (int)(strend-scan);
+        scan = strend - (MAX_MATCH-1);
+
+#else /* UNALIGNED_OK */
+
+        if (match[best_len]   != scan_end  ||
+            match[best_len-1] != scan_end1 ||
+            *match            != *scan     ||
+            *++match          != scan[1])      continue;
+
+        /* The check at best_len-1 can be removed because it will be made
+         * again later. (This heuristic is not always a win.)
+         * It is not necessary to compare scan[2] and match[2] since they
+         * are always equal when the other bytes match, given that
+         * the hash keys are equal and that HASH_BITS >= 8.
+         */
+        scan += 2, match++;
+        Assert(*scan == *match, "match[2]?");
+
+        /* We check for insufficient lookahead only every 8th comparison;
+         * the 256th check will be made at strstart+258.
+         */
+        do {
+        } while (*++scan == *++match && *++scan == *++match &&
+                 *++scan == *++match && *++scan == *++match &&
+                 *++scan == *++match && *++scan == *++match &&
+                 *++scan == *++match && *++scan == *++match &&
+                 scan < strend);
+
+        Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
+
+        len = MAX_MATCH - (int)(strend - scan);
+        scan = strend - MAX_MATCH;
+
+#endif /* UNALIGNED_OK */
+
+        if (len > best_len) {
+            s->match_start = cur_match;
+            best_len = len;
+            if (len >= nice_match) break;
+#ifdef UNALIGNED_OK
+            scan_end = *(ushf*)(scan+best_len-1);
+#else
+            scan_end1  = scan[best_len-1];
+            scan_end   = scan[best_len];
+#endif
+        }
+    } while ((cur_match = prev[cur_match & wmask]) > limit
+             && --chain_length != 0);
+
+    if ((uInt)best_len <= s->lookahead) return (uInt)best_len;
+    return s->lookahead;
+}
+#endif /* ASMV */
+#endif /* FASTEST */
+
+/* ---------------------------------------------------------------------------
+ * Optimized version for level == 1 or strategy == Z_RLE only
+ */
+local uInt longest_match_fast(deflate_state *s, IPos cur_match)                             /* current match */
+{
+    register Bytef *scan = s->window + s->strstart; /* current string */
+    register Bytef *match;                       /* matched string */
+    register int len;                           /* length of current match */
+    register Bytef *strend = s->window + s->strstart + MAX_MATCH;
+
+    /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16.
+     * It is easy to get rid of this optimization if necessary.
+     */
+    Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever");
+
+    Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead");
+
+    Assert(cur_match < s->strstart, "no future");
+
+    match = s->window + cur_match;
+
+    /* Return failure if the match length is less than 2:
+     */
+    if (match[0] != scan[0] || match[1] != scan[1]) return MIN_MATCH-1;
+
+    /* The check at best_len-1 can be removed because it will be made
+     * again later. (This heuristic is not always a win.)
+     * It is not necessary to compare scan[2] and match[2] since they
+     * are always equal when the other bytes match, given that
+     * the hash keys are equal and that HASH_BITS >= 8.
+     */
+    scan += 2, match += 2;
+    Assert(*scan == *match, "match[2]?");
+
+    /* We check for insufficient lookahead only every 8th comparison;
+     * the 256th check will be made at strstart+258.
+     */
+    do {
+    } while (*++scan == *++match && *++scan == *++match &&
+             *++scan == *++match && *++scan == *++match &&
+             *++scan == *++match && *++scan == *++match &&
+             *++scan == *++match && *++scan == *++match &&
+             scan < strend);
+
+    Assert(scan <= s->window+(unsigned)(s->window_size-1), "wild scan");
+
+    len = MAX_MATCH - (int)(strend - scan);
+
+    if (len < MIN_MATCH) return MIN_MATCH - 1;
+
+    s->match_start = cur_match;
+    return (uInt)len <= s->lookahead ? (uInt)len : s->lookahead;
+}
+
+#ifdef DEBUG
+/* ===========================================================================
+ * Check that the match at match_start is indeed a match.
+ */
+local void check_match(deflate_state *s, IPos start, IPos match, int length)
+{
+    /* check that the match is indeed a match */
+    if (zmemcmp(s->window + match,
+                s->window + start, length) != EQUAL) {
+        fprintf(stderr, " start %u, match %u, length %d\n",
+                start, match, length);
+        do {
+            fprintf(stderr, "%c%c", s->window[match++], s->window[start++]);
+        } while (--length != 0);
+        z_error("invalid match");
+    }
+    if (z_verbose > 1) {
+        fprintf(stderr,"\\[%d,%d]", start-match, length);
+        do { putc(s->window[start++], stderr); } while (--length != 0);
+    }
+}
+#else
+#  define check_match(s, start, match, length)
+#endif /* DEBUG */
+
+/* ===========================================================================
+ * Fill the window when the lookahead becomes insufficient.
+ * Updates strstart and lookahead.
+ *
+ * IN assertion: lookahead < MIN_LOOKAHEAD
+ * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD
+ *    At least one byte has been read, or avail_in == 0; reads are
+ *    performed for at least two bytes (required for the zip translate_eol
+ *    option -- not supported here).
+ */
+local void fill_window(deflate_state *s)
+{
+    register unsigned n, m;
+    register Posf *p;
+    unsigned more;    /* Amount of free space at the end of the window. */
+    uInt wsize = s->w_size;
+
+    do {
+        more = (unsigned)(s->window_size -(ulg)s->lookahead -(ulg)s->strstart);
+
+        /* Deal with !@#$% 64K limit: */
+        if (sizeof(int) <= 2) {
+            if (more == 0 && s->strstart == 0 && s->lookahead == 0) {
+                more = wsize;
+
+            } else if (more == (unsigned)(-1)) {
+                /* Very unlikely, but possible on 16 bit machine if
+                 * strstart == 0 && lookahead == 1 (input done a byte at time)
+                 */
+                more--;
+            }
+        }
+
+        /* If the window is almost full and there is insufficient lookahead,
+         * move the upper half to the lower one to make room in the upper half.
+         */
+        if (s->strstart >= wsize+MAX_DIST(s)) {
+
+            zmemcpy(s->window, s->window+wsize, (unsigned)wsize);
+            s->match_start -= wsize;
+            s->strstart    -= wsize; /* we now have strstart >= MAX_DIST */
+            s->block_start -= (long) wsize;
+
+            /* Slide the hash table (could be avoided with 32 bit values
+               at the expense of memory usage). We slide even when level == 0
+               to keep the hash table consistent if we switch back to level > 0
+               later. (Using level 0 permanently is not an optimal usage of
+               zlib, so we don't care about this pathological case.)
+             */
+            /* %%% avoid this when Z_RLE */
+            n = s->hash_size;
+            p = &s->head[n];
+            do {
+                m = *--p;
+                *p = (Pos)(m >= wsize ? m-wsize : NIL);
+            } while (--n);
+
+            n = wsize;
+#ifndef FASTEST
+            p = &s->prev[n];
+            do {
+                m = *--p;
+                *p = (Pos)(m >= wsize ? m-wsize : NIL);
+                /* If n is not on any hash chain, prev[n] is garbage but
+                 * its value will never be used.
+                 */
+            } while (--n);
+#endif
+            more += wsize;
+        }
+        if (s->strm->avail_in == 0) return;
+
+        /* If there was no sliding:
+         *    strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 &&
+         *    more == window_size - lookahead - strstart
+         * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1)
+         * => more >= window_size - 2*WSIZE + 2
+         * In the BIG_MEM or MMAP case (not yet supported),
+         *   window_size == input_size + MIN_LOOKAHEAD  &&
+         *   strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD.
+         * Otherwise, window_size == 2*WSIZE so more >= 2.
+         * If there was sliding, more >= WSIZE. So in all cases, more >= 2.
+         */
+        Assert(more >= 2, "more < 2");
+
+        n = read_buf(s->strm, s->window + s->strstart + s->lookahead, more);
+        s->lookahead += n;
+
+        /* Initialize the hash value now that we have some input: */
+        if (s->lookahead >= MIN_MATCH) {
+            s->ins_h = s->window[s->strstart];
+            UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
+#if MIN_MATCH != 3
+            Call UPDATE_HASH() MIN_MATCH-3 more times
+#endif
+        }
+        /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage,
+         * but this is not important since only literal bytes will be emitted.
+         */
+
+    } while (s->lookahead < MIN_LOOKAHEAD && s->strm->avail_in != 0);
+}
+
+/* ===========================================================================
+ * Flush the current block, with given end-of-file flag.
+ * IN assertion: strstart is set to the end of the current match.
+ */
+#define FLUSH_BLOCK_ONLY(s, eof) { \
+   _tr_flush_block(s, (s->block_start >= 0L ? \
+                   (charf *)&s->window[(unsigned)s->block_start] : \
+                   (charf *)Z_NULL), \
+                (ulg)((long)s->strstart - s->block_start), \
+                (eof)); \
+   s->block_start = s->strstart; \
+   flush_pending(s->strm); \
+   Tracev((stderr,"[FLUSH]")); \
+}
+
+/* Same but force premature exit if necessary. */
+#define FLUSH_BLOCK(s, eof) { \
+   FLUSH_BLOCK_ONLY(s, eof); \
+   if (s->strm->avail_out == 0) return (eof) ? finish_started : need_more; \
+}
+
+/* ===========================================================================
+ * Copy without compression as much as possible from the input stream, return
+ * the current block state.
+ * This function does not insert new strings in the dictionary since
+ * uncompressible data is probably not useful. This function is used
+ * only for the level=0 compression option.
+ * NOTE: this function should be optimized to avoid extra copying from
+ * window to pending_buf.
+ */
+local block_state deflate_stored(deflate_state *s, int flush)
+{
+    /* Stored blocks are limited to 0xffff bytes, pending_buf is limited
+     * to pending_buf_size, and each stored block has a 5 byte header:
+     */
+    ulg max_block_size = 0xffff;
+    ulg max_start;
+
+    if (max_block_size > s->pending_buf_size - 5) {
+        max_block_size = s->pending_buf_size - 5;
+    }
+
+    /* Copy as much as possible from input to output: */
+    for (;;) {
+        /* Fill the window as much as possible: */
+        if (s->lookahead <= 1) {
+
+            Assert(s->strstart < s->w_size+MAX_DIST(s) ||
+                   s->block_start >= (long)s->w_size, "slide too late");
+
+            fill_window(s);
+            if (s->lookahead == 0 && flush == Z_NO_FLUSH) return need_more;
+
+            if (s->lookahead == 0) break; /* flush the current block */
+        }
+        Assert(s->block_start >= 0L, "block gone");
+
+        s->strstart += s->lookahead;
+        s->lookahead = 0;
+
+        /* Emit a stored block if pending_buf will be full: */
+        max_start = s->block_start + max_block_size;
+        if (s->strstart == 0 || (ulg)s->strstart >= max_start) {
+            /* strstart == 0 is possible when wraparound on 16-bit machine */
+            s->lookahead = (uInt)(s->strstart - max_start);
+            s->strstart = (uInt)max_start;
+            FLUSH_BLOCK(s, 0);
+        }
+        /* Flush if we may have to slide, otherwise block_start may become
+         * negative and the data will be gone:
+         */
+        if (s->strstart - (uInt)s->block_start >= MAX_DIST(s)) {
+            FLUSH_BLOCK(s, 0);
+        }
+    }
+    FLUSH_BLOCK(s, flush == Z_FINISH);
+    return flush == Z_FINISH ? finish_done : block_done;
+}
+
+/* ===========================================================================
+ * Compress as much as possible from the input stream, return the current
+ * block state.
+ * This function does not perform lazy evaluation of matches and inserts
+ * new strings in the dictionary only for unmatched strings or for short
+ * matches. It is used only for the fast compression options.
+ */
+local block_state deflate_fast(deflate_state *s, int flush)
+{
+    IPos hash_head = NIL; /* head of the hash chain */
+    int bflush;           /* set if current block must be flushed */
+
+    for (;;) {
+        /* Make sure that we always have enough lookahead, except
+         * at the end of the input file. We need MAX_MATCH bytes
+         * for the next match, plus MIN_MATCH bytes to insert the
+         * string following the next match.
+         */
+        if (s->lookahead < MIN_LOOKAHEAD) {
+            fill_window(s);
+            if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
+                return need_more;
+            }
+            if (s->lookahead == 0) break; /* flush the current block */
+        }
+
+        /* Insert the string window[strstart .. strstart+2] in the
+         * dictionary, and set hash_head to the head of the hash chain:
+         */
+        if (s->lookahead >= MIN_MATCH) {
+            INSERT_STRING(s, s->strstart, hash_head);
+        }
+
+        /* Find the longest match, discarding those <= prev_length.
+         * At this point we have always match_length < MIN_MATCH
+         */
+        if (hash_head != NIL && s->strstart - hash_head <= MAX_DIST(s)) {
+            /* To simplify the code, we prevent matches with the string
+             * of window index 0 (in particular we have to avoid a match
+             * of the string with itself at the start of the input file).
+             */
+#ifdef FASTEST
+            if ((s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) ||
+                (s->strategy == Z_RLE && s->strstart - hash_head == 1)) {
+                s->match_length = longest_match_fast (s, hash_head);
+            }
+#else
+            if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {
+                s->match_length = longest_match (s, hash_head);
+            } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
+                s->match_length = longest_match_fast (s, hash_head);
+            }
+#endif
+            /* longest_match() or longest_match_fast() sets match_start */
+        }
+        if (s->match_length >= MIN_MATCH) {
+            check_match(s, s->strstart, s->match_start, s->match_length);
+
+            _tr_tally_dist(s, s->strstart - s->match_start,
+                           s->match_length - MIN_MATCH, bflush);
+
+            s->lookahead -= s->match_length;
+
+            /* Insert new strings in the hash table only if the match length
+             * is not too large. This saves time but degrades compression.
+             */
+#ifndef FASTEST
+            if (s->match_length <= s->max_insert_length &&
+                s->lookahead >= MIN_MATCH) {
+                s->match_length--; /* string at strstart already in table */
+                do {
+                    s->strstart++;
+                    INSERT_STRING(s, s->strstart, hash_head);
+                    /* strstart never exceeds WSIZE-MAX_MATCH, so there are
+                     * always MIN_MATCH bytes ahead.
+                     */
+                } while (--s->match_length != 0);
+                s->strstart++;
+            } else
+#endif
+            {
+                s->strstart += s->match_length;
+                s->match_length = 0;
+                s->ins_h = s->window[s->strstart];
+                UPDATE_HASH(s, s->ins_h, s->window[s->strstart+1]);
+#if MIN_MATCH != 3
+                Call UPDATE_HASH() MIN_MATCH-3 more times
+#endif
+                /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not
+                 * matter since it will be recomputed at next deflate call.
+                 */
+            }
+        } else {
+            /* No match, output a literal byte */
+            Tracevv((stderr,"%c", s->window[s->strstart]));
+            _tr_tally_lit (s, s->window[s->strstart], bflush);
+            s->lookahead--;
+            s->strstart++;
+        }
+        if (bflush) FLUSH_BLOCK(s, 0);
+    }
+    FLUSH_BLOCK(s, flush == Z_FINISH);
+    return flush == Z_FINISH ? finish_done : block_done;
+}
+
+#ifndef FASTEST
+/* ===========================================================================
+ * Same as above, but achieves better compression. We use a lazy
+ * evaluation for matches: a match is finally adopted only if there is
+ * no better match at the next window position.
+ */
+local block_state deflate_slow(deflate_state *s,  int flush)
+{
+    IPos hash_head = NIL;    /* head of hash chain */
+    int bflush;              /* set if current block must be flushed */
+
+    /* Process the input block. */
+    for (;;) {
+        /* Make sure that we always have enough lookahead, except
+         * at the end of the input file. We need MAX_MATCH bytes
+         * for the next match, plus MIN_MATCH bytes to insert the
+         * string following the next match.
+         */
+        if (s->lookahead < MIN_LOOKAHEAD) {
+            fill_window(s);
+            if (s->lookahead < MIN_LOOKAHEAD && flush == Z_NO_FLUSH) {
+                return need_more;
+            }
+            if (s->lookahead == 0) break; /* flush the current block */
+        }
+
+        /* Insert the string window[strstart .. strstart+2] in the
+         * dictionary, and set hash_head to the head of the hash chain:
+         */
+        if (s->lookahead >= MIN_MATCH) {
+            INSERT_STRING(s, s->strstart, hash_head);
+        }
+
+        /* Find the longest match, discarding those <= prev_length.
+         */
+        s->prev_length = s->match_length, s->prev_match = s->match_start;
+        s->match_length = MIN_MATCH-1;
+
+        if (hash_head != NIL && s->prev_length < s->max_lazy_match &&
+            s->strstart - hash_head <= MAX_DIST(s)) {
+            /* To simplify the code, we prevent matches with the string
+             * of window index 0 (in particular we have to avoid a match
+             * of the string with itself at the start of the input file).
+             */
+            if (s->strategy != Z_HUFFMAN_ONLY && s->strategy != Z_RLE) {
+                s->match_length = longest_match (s, hash_head);
+            } else if (s->strategy == Z_RLE && s->strstart - hash_head == 1) {
+                s->match_length = longest_match_fast (s, hash_head);
+            }
+            /* longest_match() or longest_match_fast() sets match_start */
+
+            if (s->match_length <= 5 && (s->strategy == Z_FILTERED
+#if TOO_FAR <= 32767
+                || (s->match_length == MIN_MATCH &&
+                    s->strstart - s->match_start > TOO_FAR)
+#endif
+                )) {
+
+                /* If prev_match is also MIN_MATCH, match_start is garbage
+                 * but we will ignore the current match anyway.
+                 */
+                s->match_length = MIN_MATCH-1;
+            }
+        }
+        /* If there was a match at the previous step and the current
+         * match is not better, output the previous match:
+         */
+        if (s->prev_length >= MIN_MATCH && s->match_length <= s->prev_length) {
+            uInt max_insert = s->strstart + s->lookahead - MIN_MATCH;
+            /* Do not insert strings in hash table beyond this. */
+
+            check_match(s, s->strstart-1, s->prev_match, s->prev_length);
+
+            _tr_tally_dist(s, s->strstart -1 - s->prev_match,
+                           s->prev_length - MIN_MATCH, bflush);
+
+            /* Insert in hash table all strings up to the end of the match.
+             * strstart-1 and strstart are already inserted. If there is not
+             * enough lookahead, the last two strings are not inserted in
+             * the hash table.
+             */
+            s->lookahead -= s->prev_length-1;
+            s->prev_length -= 2;
+            do {
+                if (++s->strstart <= max_insert) {
+                    INSERT_STRING(s, s->strstart, hash_head);
+                }
+            } while (--s->prev_length != 0);
+            s->match_available = 0;
+            s->match_length = MIN_MATCH-1;
+            s->strstart++;
+
+            if (bflush) FLUSH_BLOCK(s, 0);
+
+        } else if (s->match_available) {
+            /* If there was no match at the previous position, output a
+             * single literal. If there was a match but the current match
+             * is longer, truncate the previous match to a single literal.
+             */
+            Tracevv((stderr,"%c", s->window[s->strstart-1]));
+            _tr_tally_lit(s, s->window[s->strstart-1], bflush);
+            if (bflush) {
+                FLUSH_BLOCK_ONLY(s, 0);
+            }
+            s->strstart++;
+            s->lookahead--;
+            if (s->strm->avail_out == 0) return need_more;
+        } else {
+            /* There is no previous match to compare with, wait for
+             * the next step to decide.
+             */
+            s->match_available = 1;
+            s->strstart++;
+            s->lookahead--;
+        }
+    }
+    Assert (flush != Z_NO_FLUSH, "no flush?");
+    if (s->match_available) {
+        Tracevv((stderr,"%c", s->window[s->strstart-1]));
+        _tr_tally_lit(s, s->window[s->strstart-1], bflush);
+        s->match_available = 0;
+    }
+    FLUSH_BLOCK(s, flush == Z_FINISH);
+    return flush == Z_FINISH ? finish_done : block_done;
+}
+#endif /* FASTEST */
+
+#if 0
+/* ===========================================================================
+ * For Z_RLE, simply look for runs of bytes, generate matches only of distance
+ * one.  Do not maintain a hash table.  (It will be regenerated if this run of
+ * deflate switches away from Z_RLE.)
+ */
+local block_state deflate_rle(deflate_state *s, int flush)
+{
+    int bflush;         /* set if current block must be flushed */
+    uInt run;           /* length of run */
+    uInt max;           /* maximum length of run */
+    uInt prev;          /* byte at distance one to match */
+    Bytef *scan;        /* scan for end of run */
+
+    for (;;) {
+        /* Make sure that we always have enough lookahead, except
+         * at the end of the input file. We need MAX_MATCH bytes
+         * for the longest encodable run.
+         */
+        if (s->lookahead < MAX_MATCH) {
+            fill_window(s);
+            if (s->lookahead < MAX_MATCH && flush == Z_NO_FLUSH) {
+                return need_more;
+            }
+            if (s->lookahead == 0) break; /* flush the current block */
+        }
+
+        /* See how many times the previous byte repeats */
+        run = 0;
+        if (s->strstart > 0) {      /* if there is a previous byte, that is */
+            max = s->lookahead < MAX_MATCH ? s->lookahead : MAX_MATCH;
+            scan = s->window + s->strstart - 1;
+            prev = *scan++;
+            do {
+                if (*scan++ != prev)
+                    break;
+            } while (++run < max);
+        }
+
+        /* Emit match if have run of MIN_MATCH or longer, else emit literal */
+        if (run >= MIN_MATCH) {
+            check_match(s, s->strstart, s->strstart - 1, run);
+            _tr_tally_dist(s, 1, run - MIN_MATCH, bflush);
+            s->lookahead -= run;
+            s->strstart += run;
+        } else {
+            /* No match, output a literal byte */
+            Tracevv((stderr,"%c", s->window[s->strstart]));
+            _tr_tally_lit (s, s->window[s->strstart], bflush);
+            s->lookahead--;
+            s->strstart++;
+        }
+        if (bflush) FLUSH_BLOCK(s, 0);
+    }
+    FLUSH_BLOCK(s, flush == Z_FINISH);
+    return flush == Z_FINISH ? finish_done : block_done;
+}
+#endif
diff --git a/updater/zlib123/deflate.h b/updater/zlib123/deflate.h
new file mode 100644
index 0000000..222c53e
--- /dev/null
+++ b/updater/zlib123/deflate.h
@@ -0,0 +1,331 @@
+/* deflate.h -- internal compression state
+ * Copyright (C) 1995-2004 Jean-loup Gailly
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+   part of the implementation of the compression library and is
+   subject to change. Applications should only use zlib.h.
+ */
+
+/* @(#) $Id$ */
+
+#ifndef DEFLATE_H
+#define DEFLATE_H
+
+#include "zutil.h"
+
+/* define NO_GZIP when compiling if you want to disable gzip header and
+   trailer creation by deflate().  NO_GZIP would be used to avoid linking in
+   the crc code when it is not needed.  For shared libraries, gzip encoding
+   should be left enabled. */
+#ifndef NO_GZIP
+#  define GZIP
+#endif
+
+/* ===========================================================================
+ * Internal compression state.
+ */
+
+#define LENGTH_CODES 29
+/* number of length codes, not counting the special END_BLOCK code */
+
+#define LITERALS  256
+/* number of literal bytes 0..255 */
+
+#define L_CODES (LITERALS+1+LENGTH_CODES)
+/* number of Literal or Length codes, including the END_BLOCK code */
+
+#define D_CODES   30
+/* number of distance codes */
+
+#define BL_CODES  19
+/* number of codes used to transfer the bit lengths */
+
+#define HEAP_SIZE (2*L_CODES+1)
+/* maximum heap size */
+
+#define MAX_BITS 15
+/* All codes must not exceed MAX_BITS bits */
+
+#define INIT_STATE    42
+#define EXTRA_STATE   69
+#define NAME_STATE    73
+#define COMMENT_STATE 91
+#define HCRC_STATE   103
+#define BUSY_STATE   113
+#define FINISH_STATE 666
+/* Stream status */
+
+
+/* Data structure describing a single value and its code string. */
+typedef struct ct_data_s {
+    union {
+        ush  freq;       /* frequency count */
+        ush  code;       /* bit string */
+    } fc;
+    union {
+        ush  dad;        /* father node in Huffman tree */
+        ush  len;        /* length of bit string */
+    } dl;
+} FAR ct_data;
+
+#define Freq fc.freq
+#define Code fc.code
+#define Dad  dl.dad
+#define Len  dl.len
+
+typedef struct static_tree_desc_s  static_tree_desc;
+
+typedef struct tree_desc_s {
+    ct_data *dyn_tree;           /* the dynamic tree */
+    int     max_code;            /* largest code with non zero frequency */
+    static_tree_desc *stat_desc; /* the corresponding static tree */
+} FAR tree_desc;
+
+typedef ush Pos;
+typedef Pos FAR Posf;
+typedef unsigned IPos;
+
+/* A Pos is an index in the character window. We use short instead of int to
+ * save space in the various tables. IPos is used only for parameter passing.
+ */
+
+typedef struct internal_state {
+    z_streamp strm;      /* pointer back to this zlib stream */
+    int   status;        /* as the name implies */
+    Bytef *pending_buf;  /* output still pending */
+    ulg   pending_buf_size; /* size of pending_buf */
+    Bytef *pending_out;  /* next pending byte to output to the stream */
+    uInt   pending;      /* nb of bytes in the pending buffer */
+    int   wrap;          /* bit 0 true for zlib, bit 1 true for gzip */
+    gz_headerp  gzhead;  /* gzip header information to write */
+    uInt   gzindex;      /* where in extra, name, or comment */
+    Byte  method;        /* STORED (for zip only) or DEFLATED */
+    int   last_flush;    /* value of flush param for previous deflate call */
+
+                /* used by deflate.c: */
+
+    uInt  w_size;        /* LZ77 window size (32K by default) */
+    uInt  w_bits;        /* log2(w_size)  (8..16) */
+    uInt  w_mask;        /* w_size - 1 */
+
+    Bytef *window;
+    /* Sliding window. Input bytes are read into the second half of the window,
+     * and move to the first half later to keep a dictionary of at least wSize
+     * bytes. With this organization, matches are limited to a distance of
+     * wSize-MAX_MATCH bytes, but this ensures that IO is always
+     * performed with a length multiple of the block size. Also, it limits
+     * the window size to 64K, which is quite useful on MSDOS.
+     * To do: use the user input buffer as sliding window.
+     */
+
+    ulg window_size;
+    /* Actual size of window: 2*wSize, except when the user input buffer
+     * is directly used as sliding window.
+     */
+
+    Posf *prev;
+    /* Link to older string with same hash index. To limit the size of this
+     * array to 64K, this link is maintained only for the last 32K strings.
+     * An index in this array is thus a window index modulo 32K.
+     */
+
+    Posf *head; /* Heads of the hash chains or NIL. */
+
+    uInt  ins_h;          /* hash index of string to be inserted */
+    uInt  hash_size;      /* number of elements in hash table */
+    uInt  hash_bits;      /* log2(hash_size) */
+    uInt  hash_mask;      /* hash_size-1 */
+
+    uInt  hash_shift;
+    /* Number of bits by which ins_h must be shifted at each input
+     * step. It must be such that after MIN_MATCH steps, the oldest
+     * byte no longer takes part in the hash key, that is:
+     *   hash_shift * MIN_MATCH >= hash_bits
+     */
+
+    long block_start;
+    /* Window position at the beginning of the current output block. Gets
+     * negative when the window is moved backwards.
+     */
+
+    uInt match_length;           /* length of best match */
+    IPos prev_match;             /* previous match */
+    int match_available;         /* set if previous match exists */
+    uInt strstart;               /* start of string to insert */
+    uInt match_start;            /* start of matching string */
+    uInt lookahead;              /* number of valid bytes ahead in window */
+
+    uInt prev_length;
+    /* Length of the best match at previous step. Matches not greater than this
+     * are discarded. This is used in the lazy match evaluation.
+     */
+
+    uInt max_chain_length;
+    /* To speed up deflation, hash chains are never searched beyond this
+     * length.  A higher limit improves compression ratio but degrades the
+     * speed.
+     */
+
+    uInt max_lazy_match;
+    /* Attempt to find a better match only when the current match is strictly
+     * smaller than this value. This mechanism is used only for compression
+     * levels >= 4.
+     */
+#   define max_insert_length  max_lazy_match
+    /* Insert new strings in the hash table only if the match length is not
+     * greater than this length. This saves time but degrades compression.
+     * max_insert_length is used only for compression levels <= 3.
+     */
+
+    int level;    /* compression level (1..9) */
+    int strategy; /* favor or force Huffman coding*/
+
+    uInt good_match;
+    /* Use a faster search when the previous match is longer than this */
+
+    int nice_match; /* Stop searching when current match exceeds this */
+
+                /* used by trees.c: */
+    /* Didn't use ct_data typedef below to supress compiler warning */
+    struct ct_data_s dyn_ltree[HEAP_SIZE];   /* literal and length tree */
+    struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */
+    struct ct_data_s bl_tree[2*BL_CODES+1];  /* Huffman tree for bit lengths */
+
+    struct tree_desc_s l_desc;               /* desc. for literal tree */
+    struct tree_desc_s d_desc;               /* desc. for distance tree */
+    struct tree_desc_s bl_desc;              /* desc. for bit length tree */
+
+    ush bl_count[MAX_BITS+1];
+    /* number of codes at each bit length for an optimal tree */
+
+    int heap[2*L_CODES+1];      /* heap used to build the Huffman trees */
+    int heap_len;               /* number of elements in the heap */
+    int heap_max;               /* element of largest frequency */
+    /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used.
+     * The same heap array is used to build all trees.
+     */
+
+    uch depth[2*L_CODES+1];
+    /* Depth of each subtree used as tie breaker for trees of equal frequency
+     */
+
+    uchf *l_buf;          /* buffer for literals or lengths */
+
+    uInt  lit_bufsize;
+    /* Size of match buffer for literals/lengths.  There are 4 reasons for
+     * limiting lit_bufsize to 64K:
+     *   - frequencies can be kept in 16 bit counters
+     *   - if compression is not successful for the first block, all input
+     *     data is still in the window so we can still emit a stored block even
+     *     when input comes from standard input.  (This can also be done for
+     *     all blocks if lit_bufsize is not greater than 32K.)
+     *   - if compression is not successful for a file smaller than 64K, we can
+     *     even emit a stored file instead of a stored block (saving 5 bytes).
+     *     This is applicable only for zip (not gzip or zlib).
+     *   - creating new Huffman trees less frequently may not provide fast
+     *     adaptation to changes in the input data statistics. (Take for
+     *     example a binary file with poorly compressible code followed by
+     *     a highly compressible string table.) Smaller buffer sizes give
+     *     fast adaptation but have of course the overhead of transmitting
+     *     trees more frequently.
+     *   - I can't count above 4
+     */
+
+    uInt last_lit;      /* running index in l_buf */
+
+    ushf *d_buf;
+    /* Buffer for distances. To simplify the code, d_buf and l_buf have
+     * the same number of elements. To use different lengths, an extra flag
+     * array would be necessary.
+     */
+
+    ulg opt_len;        /* bit length of current block with optimal trees */
+    ulg static_len;     /* bit length of current block with static trees */
+    uInt matches;       /* number of string matches in current block */
+    int last_eob_len;   /* bit length of EOB code for last block */
+
+#ifdef DEBUG
+    ulg compressed_len; /* total bit length of compressed file mod 2^32 */
+    ulg bits_sent;      /* bit length of compressed data sent mod 2^32 */
+#endif
+
+    ush bi_buf;
+    /* Output buffer. bits are inserted starting at the bottom (least
+     * significant bits).
+     */
+    int bi_valid;
+    /* Number of valid bits in bi_buf.  All bits above the last valid bit
+     * are always zero.
+     */
+
+} FAR deflate_state;
+
+/* Output a byte on the stream.
+ * IN assertion: there is enough room in pending_buf.
+ */
+#define put_byte(s, c) {s->pending_buf[s->pending++] = (c);}
+
+
+#define MIN_LOOKAHEAD (MAX_MATCH+MIN_MATCH+1)
+/* Minimum amount of lookahead, except at the end of the input file.
+ * See deflate.c for comments about the MIN_MATCH+1.
+ */
+
+#define MAX_DIST(s)  ((s)->w_size-MIN_LOOKAHEAD)
+/* In order to simplify the code, particularly on 16 bit machines, match
+ * distances are limited to MAX_DIST instead of WSIZE.
+ */
+
+        /* in trees.c */
+void _tr_init         OF((deflate_state *s));
+int  _tr_tally        OF((deflate_state *s, unsigned dist, unsigned lc));
+void _tr_flush_block  OF((deflate_state *s, charf *buf, ulg stored_len,
+                          int eof));
+void _tr_align        OF((deflate_state *s));
+void _tr_stored_block OF((deflate_state *s, charf *buf, ulg stored_len,
+                          int eof));
+
+#define d_code(dist) \
+   ((dist) < 256 ? _dist_code[dist] : _dist_code[256+((dist)>>7)])
+/* Mapping from a distance to a distance code. dist is the distance - 1 and
+ * must not have side effects. _dist_code[256] and _dist_code[257] are never
+ * used.
+ */
+
+#ifndef DEBUG
+/* Inline versions of _tr_tally for speed: */
+
+#if defined(GEN_TREES_H) || !defined(STDC)
+  extern uch _length_code[];
+  extern uch _dist_code[];
+#else
+  extern const uch _length_code[];
+  extern const uch _dist_code[];
+#endif
+
+# define _tr_tally_lit(s, c, flush) \
+  { uch cc = (c); \
+    s->d_buf[s->last_lit] = 0; \
+    s->l_buf[s->last_lit++] = cc; \
+    s->dyn_ltree[cc].Freq++; \
+    flush = (s->last_lit == s->lit_bufsize-1); \
+   }
+# define _tr_tally_dist(s, distance, length, flush) \
+  { uch len = (length); \
+    ush dist = (distance); \
+    s->d_buf[s->last_lit] = dist; \
+    s->l_buf[s->last_lit++] = len; \
+    dist--; \
+    s->dyn_ltree[_length_code[len]+LITERALS+1].Freq++; \
+    s->dyn_dtree[d_code(dist)].Freq++; \
+    flush = (s->last_lit == s->lit_bufsize-1); \
+  }
+#else
+# define _tr_tally_lit(s, c, flush) flush = _tr_tally(s, 0, c)
+# define _tr_tally_dist(s, distance, length, flush) \
+              flush = _tr_tally(s, distance, length)
+#endif
+
+#endif /* DEFLATE_H */
diff --git a/updater/zlib123/example.c b/updater/zlib123/example.c
new file mode 100644
index 0000000..455a1d0
--- /dev/null
+++ b/updater/zlib123/example.c
@@ -0,0 +1,565 @@
+/* example.c -- usage example of the zlib compression library
+ * Copyright (C) 1995-2004 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#include <stdio.h>
+#include "zlib.h"
+
+#ifdef STDC
+#  include <string.h>
+#  include <stdlib.h>
+#endif
+
+#if defined(VMS) || defined(RISCOS)
+#  define TESTFILE "foo-gz"
+#else
+#  define TESTFILE "foo.gz"
+#endif
+
+#define CHECK_ERR(err, msg) { \
+    if (err != Z_OK) { \
+        fprintf(stderr, "%s error: %d\n", msg, err); \
+        exit(1); \
+    } \
+}
+
+const char hello[] = "hello, hello!";
+/* "hello world" would be more standard, but the repeated "hello"
+ * stresses the compression code better, sorry...
+ */
+
+const char dictionary[] = "hello";
+uLong dictId; /* Adler32 value of the dictionary */
+
+void test_compress      OF((Byte *compr, uLong comprLen,
+                            Byte *uncompr, uLong uncomprLen));
+void test_gzio          OF((const char *fname,
+                            Byte *uncompr, uLong uncomprLen));
+void test_deflate       OF((Byte *compr, uLong comprLen));
+void test_inflate       OF((Byte *compr, uLong comprLen,
+                            Byte *uncompr, uLong uncomprLen));
+void test_large_deflate OF((Byte *compr, uLong comprLen,
+                            Byte *uncompr, uLong uncomprLen));
+void test_large_inflate OF((Byte *compr, uLong comprLen,
+                            Byte *uncompr, uLong uncomprLen));
+void test_flush         OF((Byte *compr, uLong *comprLen));
+void test_sync          OF((Byte *compr, uLong comprLen,
+                            Byte *uncompr, uLong uncomprLen));
+void test_dict_deflate  OF((Byte *compr, uLong comprLen));
+void test_dict_inflate  OF((Byte *compr, uLong comprLen,
+                            Byte *uncompr, uLong uncomprLen));
+int  main               OF((int argc, char *argv[]));
+
+/* ===========================================================================
+ * Test compress() and uncompress()
+ */
+void test_compress(compr, comprLen, uncompr, uncomprLen)
+    Byte *compr, *uncompr;
+    uLong comprLen, uncomprLen;
+{
+    int err;
+    uLong len = (uLong)strlen(hello)+1;
+
+    err = compress(compr, &comprLen, (const Bytef*)hello, len);
+    CHECK_ERR(err, "compress");
+
+    strcpy((char*)uncompr, "garbage");
+
+    err = uncompress(uncompr, &uncomprLen, compr, comprLen);
+    CHECK_ERR(err, "uncompress");
+
+    if (strcmp((char*)uncompr, hello)) {
+        fprintf(stderr, "bad uncompress\n");
+        exit(1);
+    } else {
+        printf("uncompress(): %s\n", (char *)uncompr);
+    }
+}
+
+/* ===========================================================================
+ * Test read/write of .gz files
+ */
+void test_gzio(fname, uncompr, uncomprLen)
+    const char *fname; /* compressed file name */
+    Byte *uncompr;
+    uLong uncomprLen;
+{
+#ifdef NO_GZCOMPRESS
+    fprintf(stderr, "NO_GZCOMPRESS -- gz* functions cannot compress\n");
+#else
+    int err;
+    int len = (int)strlen(hello)+1;
+    gzFile file;
+    z_off_t pos;
+
+    file = gzopen(fname, "wb");
+    if (file == NULL) {
+        fprintf(stderr, "gzopen error\n");
+        exit(1);
+    }
+    gzputc(file, 'h');
+    if (gzputs(file, "ello") != 4) {
+        fprintf(stderr, "gzputs err: %s\n", gzerror(file, &err));
+        exit(1);
+    }
+    if (gzprintf(file, ", %s!", "hello") != 8) {
+        fprintf(stderr, "gzprintf err: %s\n", gzerror(file, &err));
+        exit(1);
+    }
+    gzseek(file, 1L, SEEK_CUR); /* add one zero byte */
+    gzclose(file);
+
+    file = gzopen(fname, "rb");
+    if (file == NULL) {
+        fprintf(stderr, "gzopen error\n");
+        exit(1);
+    }
+    strcpy((char*)uncompr, "garbage");
+
+    if (gzread(file, uncompr, (unsigned)uncomprLen) != len) {
+        fprintf(stderr, "gzread err: %s\n", gzerror(file, &err));
+        exit(1);
+    }
+    if (strcmp((char*)uncompr, hello)) {
+        fprintf(stderr, "bad gzread: %s\n", (char*)uncompr);
+        exit(1);
+    } else {
+        printf("gzread(): %s\n", (char*)uncompr);
+    }
+
+    pos = gzseek(file, -8L, SEEK_CUR);
+    if (pos != 6 || gztell(file) != pos) {
+        fprintf(stderr, "gzseek error, pos=%ld, gztell=%ld\n",
+                (long)pos, (long)gztell(file));
+        exit(1);
+    }
+
+    if (gzgetc(file) != ' ') {
+        fprintf(stderr, "gzgetc error\n");
+        exit(1);
+    }
+
+    if (gzungetc(' ', file) != ' ') {
+        fprintf(stderr, "gzungetc error\n");
+        exit(1);
+    }
+
+    gzgets(file, (char*)uncompr, (int)uncomprLen);
+    if (strlen((char*)uncompr) != 7) { /* " hello!" */
+        fprintf(stderr, "gzgets err after gzseek: %s\n", gzerror(file, &err));
+        exit(1);
+    }
+    if (strcmp((char*)uncompr, hello + 6)) {
+        fprintf(stderr, "bad gzgets after gzseek\n");
+        exit(1);
+    } else {
+        printf("gzgets() after gzseek: %s\n", (char*)uncompr);
+    }
+
+    gzclose(file);
+#endif
+}
+
+/* ===========================================================================
+ * Test deflate() with small buffers
+ */
+void test_deflate(compr, comprLen)
+    Byte *compr;
+    uLong comprLen;
+{
+    z_stream c_stream; /* compression stream */
+    int err;
+    uLong len = (uLong)strlen(hello)+1;
+
+    c_stream.zalloc = (alloc_func)0;
+    c_stream.zfree = (free_func)0;
+    c_stream.opaque = (voidpf)0;
+
+    err = deflateInit(&c_stream, Z_DEFAULT_COMPRESSION);
+    CHECK_ERR(err, "deflateInit");
+
+    c_stream.next_in  = (Bytef*)hello;
+    c_stream.next_out = compr;
+
+    while (c_stream.total_in != len && c_stream.total_out < comprLen) {
+        c_stream.avail_in = c_stream.avail_out = 1; /* force small buffers */
+        err = deflate(&c_stream, Z_NO_FLUSH);
+        CHECK_ERR(err, "deflate");
+    }
+    /* Finish the stream, still forcing small buffers: */
+    for (;;) {
+        c_stream.avail_out = 1;
+        err = deflate(&c_stream, Z_FINISH);
+        if (err == Z_STREAM_END) break;
+        CHECK_ERR(err, "deflate");
+    }
+
+    err = deflateEnd(&c_stream);
+    CHECK_ERR(err, "deflateEnd");
+}
+
+/* ===========================================================================
+ * Test inflate() with small buffers
+ */
+void test_inflate(compr, comprLen, uncompr, uncomprLen)
+    Byte *compr, *uncompr;
+    uLong comprLen, uncomprLen;
+{
+    int err;
+    z_stream d_stream; /* decompression stream */
+
+    strcpy((char*)uncompr, "garbage");
+
+    d_stream.zalloc = (alloc_func)0;
+    d_stream.zfree = (free_func)0;
+    d_stream.opaque = (voidpf)0;
+
+    d_stream.next_in  = compr;
+    d_stream.avail_in = 0;
+    d_stream.next_out = uncompr;
+
+    err = inflateInit(&d_stream);
+    CHECK_ERR(err, "inflateInit");
+
+    while (d_stream.total_out < uncomprLen && d_stream.total_in < comprLen) {
+        d_stream.avail_in = d_stream.avail_out = 1; /* force small buffers */
+        err = inflate(&d_stream, Z_NO_FLUSH);
+        if (err == Z_STREAM_END) break;
+        CHECK_ERR(err, "inflate");
+    }
+
+    err = inflateEnd(&d_stream);
+    CHECK_ERR(err, "inflateEnd");
+
+    if (strcmp((char*)uncompr, hello)) {
+        fprintf(stderr, "bad inflate\n");
+        exit(1);
+    } else {
+        printf("inflate(): %s\n", (char *)uncompr);
+    }
+}
+
+/* ===========================================================================
+ * Test deflate() with large buffers and dynamic change of compression level
+ */
+void test_large_deflate(compr, comprLen, uncompr, uncomprLen)
+    Byte *compr, *uncompr;
+    uLong comprLen, uncomprLen;
+{
+    z_stream c_stream; /* compression stream */
+    int err;
+
+    c_stream.zalloc = (alloc_func)0;
+    c_stream.zfree = (free_func)0;
+    c_stream.opaque = (voidpf)0;
+
+    err = deflateInit(&c_stream, Z_BEST_SPEED);
+    CHECK_ERR(err, "deflateInit");
+
+    c_stream.next_out = compr;
+    c_stream.avail_out = (uInt)comprLen;
+
+    /* At this point, uncompr is still mostly zeroes, so it should compress
+     * very well:
+     */
+    c_stream.next_in = uncompr;
+    c_stream.avail_in = (uInt)uncomprLen;
+    err = deflate(&c_stream, Z_NO_FLUSH);
+    CHECK_ERR(err, "deflate");
+    if (c_stream.avail_in != 0) {
+        fprintf(stderr, "deflate not greedy\n");
+        exit(1);
+    }
+
+    /* Feed in already compressed data and switch to no compression: */
+    deflateParams(&c_stream, Z_NO_COMPRESSION, Z_DEFAULT_STRATEGY);
+    c_stream.next_in = compr;
+    c_stream.avail_in = (uInt)comprLen/2;
+    err = deflate(&c_stream, Z_NO_FLUSH);
+    CHECK_ERR(err, "deflate");
+
+    /* Switch back to compressing mode: */
+    deflateParams(&c_stream, Z_BEST_COMPRESSION, Z_FILTERED);
+    c_stream.next_in = uncompr;
+    c_stream.avail_in = (uInt)uncomprLen;
+    err = deflate(&c_stream, Z_NO_FLUSH);
+    CHECK_ERR(err, "deflate");
+
+    err = deflate(&c_stream, Z_FINISH);
+    if (err != Z_STREAM_END) {
+        fprintf(stderr, "deflate should report Z_STREAM_END\n");
+        exit(1);
+    }
+    err = deflateEnd(&c_stream);
+    CHECK_ERR(err, "deflateEnd");
+}
+
+/* ===========================================================================
+ * Test inflate() with large buffers
+ */
+void test_large_inflate(compr, comprLen, uncompr, uncomprLen)
+    Byte *compr, *uncompr;
+    uLong comprLen, uncomprLen;
+{
+    int err;
+    z_stream d_stream; /* decompression stream */
+
+    strcpy((char*)uncompr, "garbage");
+
+    d_stream.zalloc = (alloc_func)0;
+    d_stream.zfree = (free_func)0;
+    d_stream.opaque = (voidpf)0;
+
+    d_stream.next_in  = compr;
+    d_stream.avail_in = (uInt)comprLen;
+
+    err = inflateInit(&d_stream);
+    CHECK_ERR(err, "inflateInit");
+
+    for (;;) {
+        d_stream.next_out = uncompr;            /* discard the output */
+        d_stream.avail_out = (uInt)uncomprLen;
+        err = inflate(&d_stream, Z_NO_FLUSH);
+        if (err == Z_STREAM_END) break;
+        CHECK_ERR(err, "large inflate");
+    }
+
+    err = inflateEnd(&d_stream);
+    CHECK_ERR(err, "inflateEnd");
+
+    if (d_stream.total_out != 2*uncomprLen + comprLen/2) {
+        fprintf(stderr, "bad large inflate: %ld\n", d_stream.total_out);
+        exit(1);
+    } else {
+        printf("large_inflate(): OK\n");
+    }
+}
+
+/* ===========================================================================
+ * Test deflate() with full flush
+ */
+void test_flush(compr, comprLen)
+    Byte *compr;
+    uLong *comprLen;
+{
+    z_stream c_stream; /* compression stream */
+    int err;
+    uInt len = (uInt)strlen(hello)+1;
+
+    c_stream.zalloc = (alloc_func)0;
+    c_stream.zfree = (free_func)0;
+    c_stream.opaque = (voidpf)0;
+
+    err = deflateInit(&c_stream, Z_DEFAULT_COMPRESSION);
+    CHECK_ERR(err, "deflateInit");
+
+    c_stream.next_in  = (Bytef*)hello;
+    c_stream.next_out = compr;
+    c_stream.avail_in = 3;
+    c_stream.avail_out = (uInt)*comprLen;
+    err = deflate(&c_stream, Z_FULL_FLUSH);
+    CHECK_ERR(err, "deflate");
+
+    compr[3]++; /* force an error in first compressed block */
+    c_stream.avail_in = len - 3;
+
+    err = deflate(&c_stream, Z_FINISH);
+    if (err != Z_STREAM_END) {
+        CHECK_ERR(err, "deflate");
+    }
+    err = deflateEnd(&c_stream);
+    CHECK_ERR(err, "deflateEnd");
+
+    *comprLen = c_stream.total_out;
+}
+
+/* ===========================================================================
+ * Test inflateSync()
+ */
+void test_sync(compr, comprLen, uncompr, uncomprLen)
+    Byte *compr, *uncompr;
+    uLong comprLen, uncomprLen;
+{
+    int err;
+    z_stream d_stream; /* decompression stream */
+
+    strcpy((char*)uncompr, "garbage");
+
+    d_stream.zalloc = (alloc_func)0;
+    d_stream.zfree = (free_func)0;
+    d_stream.opaque = (voidpf)0;
+
+    d_stream.next_in  = compr;
+    d_stream.avail_in = 2; /* just read the zlib header */
+
+    err = inflateInit(&d_stream);
+    CHECK_ERR(err, "inflateInit");
+
+    d_stream.next_out = uncompr;
+    d_stream.avail_out = (uInt)uncomprLen;
+
+    inflate(&d_stream, Z_NO_FLUSH);
+    CHECK_ERR(err, "inflate");
+
+    d_stream.avail_in = (uInt)comprLen-2;   /* read all compressed data */
+    err = inflateSync(&d_stream);           /* but skip the damaged part */
+    CHECK_ERR(err, "inflateSync");
+
+    err = inflate(&d_stream, Z_FINISH);
+    if (err != Z_DATA_ERROR) {
+        fprintf(stderr, "inflate should report DATA_ERROR\n");
+        /* Because of incorrect adler32 */
+        exit(1);
+    }
+    err = inflateEnd(&d_stream);
+    CHECK_ERR(err, "inflateEnd");
+
+    printf("after inflateSync(): hel%s\n", (char *)uncompr);
+}
+
+/* ===========================================================================
+ * Test deflate() with preset dictionary
+ */
+void test_dict_deflate(compr, comprLen)
+    Byte *compr;
+    uLong comprLen;
+{
+    z_stream c_stream; /* compression stream */
+    int err;
+
+    c_stream.zalloc = (alloc_func)0;
+    c_stream.zfree = (free_func)0;
+    c_stream.opaque = (voidpf)0;
+
+    err = deflateInit(&c_stream, Z_BEST_COMPRESSION);
+    CHECK_ERR(err, "deflateInit");
+
+    err = deflateSetDictionary(&c_stream,
+                               (const Bytef*)dictionary, sizeof(dictionary));
+    CHECK_ERR(err, "deflateSetDictionary");
+
+    dictId = c_stream.adler;
+    c_stream.next_out = compr;
+    c_stream.avail_out = (uInt)comprLen;
+
+    c_stream.next_in = (Bytef*)hello;
+    c_stream.avail_in = (uInt)strlen(hello)+1;
+
+    err = deflate(&c_stream, Z_FINISH);
+    if (err != Z_STREAM_END) {
+        fprintf(stderr, "deflate should report Z_STREAM_END\n");
+        exit(1);
+    }
+    err = deflateEnd(&c_stream);
+    CHECK_ERR(err, "deflateEnd");
+}
+
+/* ===========================================================================
+ * Test inflate() with a preset dictionary
+ */
+void test_dict_inflate(compr, comprLen, uncompr, uncomprLen)
+    Byte *compr, *uncompr;
+    uLong comprLen, uncomprLen;
+{
+    int err;
+    z_stream d_stream; /* decompression stream */
+
+    strcpy((char*)uncompr, "garbage");
+
+    d_stream.zalloc = (alloc_func)0;
+    d_stream.zfree = (free_func)0;
+    d_stream.opaque = (voidpf)0;
+
+    d_stream.next_in  = compr;
+    d_stream.avail_in = (uInt)comprLen;
+
+    err = inflateInit(&d_stream);
+    CHECK_ERR(err, "inflateInit");
+
+    d_stream.next_out = uncompr;
+    d_stream.avail_out = (uInt)uncomprLen;
+
+    for (;;) {
+        err = inflate(&d_stream, Z_NO_FLUSH);
+        if (err == Z_STREAM_END) break;
+        if (err == Z_NEED_DICT) {
+            if (d_stream.adler != dictId) {
+                fprintf(stderr, "unexpected dictionary");
+                exit(1);
+            }
+            err = inflateSetDictionary(&d_stream, (const Bytef*)dictionary,
+                                       sizeof(dictionary));
+        }
+        CHECK_ERR(err, "inflate with dict");
+    }
+
+    err = inflateEnd(&d_stream);
+    CHECK_ERR(err, "inflateEnd");
+
+    if (strcmp((char*)uncompr, hello)) {
+        fprintf(stderr, "bad inflate with dict\n");
+        exit(1);
+    } else {
+        printf("inflate with dictionary: %s\n", (char *)uncompr);
+    }
+}
+
+/* ===========================================================================
+ * Usage:  example [output.gz  [input.gz]]
+ */
+
+int main(argc, argv)
+    int argc;
+    char *argv[];
+{
+    Byte *compr, *uncompr;
+    uLong comprLen = 10000*sizeof(int); /* don't overflow on MSDOS */
+    uLong uncomprLen = comprLen;
+    static const char* myVersion = ZLIB_VERSION;
+
+    if (zlibVersion()[0] != myVersion[0]) {
+        fprintf(stderr, "incompatible zlib version\n");
+        exit(1);
+
+    } else if (strcmp(zlibVersion(), ZLIB_VERSION) != 0) {
+        fprintf(stderr, "warning: different zlib version\n");
+    }
+
+    printf("zlib version %s = 0x%04x, compile flags = 0x%lx\n",
+            ZLIB_VERSION, ZLIB_VERNUM, zlibCompileFlags());
+
+    compr    = (Byte*)calloc((uInt)comprLen, 1);
+    uncompr  = (Byte*)calloc((uInt)uncomprLen, 1);
+    /* compr and uncompr are cleared to avoid reading uninitialized
+     * data and to ensure that uncompr compresses well.
+     */
+    if (compr == Z_NULL || uncompr == Z_NULL) {
+        printf("out of memory\n");
+        exit(1);
+    }
+    test_compress(compr, comprLen, uncompr, uncomprLen);
+
+    test_gzio((argc > 1 ? argv[1] : TESTFILE),
+              uncompr, uncomprLen);
+
+    test_deflate(compr, comprLen);
+    test_inflate(compr, comprLen, uncompr, uncomprLen);
+
+    test_large_deflate(compr, comprLen, uncompr, uncomprLen);
+    test_large_inflate(compr, comprLen, uncompr, uncomprLen);
+
+    test_flush(compr, &comprLen);
+    test_sync(compr, comprLen, uncompr, uncomprLen);
+    comprLen = uncomprLen;
+
+    test_dict_deflate(compr, comprLen);
+    test_dict_inflate(compr, comprLen, uncompr, uncomprLen);
+
+    free(compr);
+    free(uncompr);
+
+    return 0;
+}
diff --git a/updater/zlib123/examples/README.examples b/updater/zlib123/examples/README.examples
new file mode 100644
index 0000000..ca851a5
--- /dev/null
+++ b/updater/zlib123/examples/README.examples
@@ -0,0 +1,42 @@
+This directory contains examples of the use of zlib.
+
+fitblk.c
+    compress just enough input to nearly fill a requested output size
+    - zlib isn't designed to do this, but fitblk does it anyway
+
+gun.c
+    uncompress a gzip file
+    - illustrates the use of inflateBack() for high speed file-to-file
+      decompression using call-back functions
+    - is approximately twice as fast as gzip -d
+    - also provides Unix uncompress functionality, again twice as fast
+
+gzappend.c
+    append to a gzip file
+    - illustrates the use of the Z_BLOCK flush parameter for inflate()
+    - illustrates the use of deflatePrime() to start at any bit
+
+gzjoin.c
+    join gzip files without recalculating the crc or recompressing
+    - illustrates the use of the Z_BLOCK flush parameter for inflate()
+    - illustrates the use of crc32_combine()
+
+gzlog.c
+gzlog.h
+    efficiently maintain a message log file in gzip format
+    - illustrates use of raw deflate and Z_SYNC_FLUSH
+    - illustrates use of gzip header extra field
+
+zlib_how.html
+    painfully comprehensive description of zpipe.c (see below)
+    - describes in excruciating detail the use of deflate() and inflate()
+
+zpipe.c
+    reads and writes zlib streams from stdin to stdout
+    - illustrates the proper use of deflate() and inflate()
+    - deeply commented in zlib_how.html (see above)
+
+zran.c
+    index a zlib or gzip stream and randomly access it
+    - illustrates the use of Z_BLOCK, inflatePrime(), and
+      inflateSetDictionary() to provide random access
diff --git a/updater/zlib123/examples/fitblk.c b/updater/zlib123/examples/fitblk.c
new file mode 100644
index 0000000..6e1ec72
--- /dev/null
+++ b/updater/zlib123/examples/fitblk.c
@@ -0,0 +1,233 @@
+/* fitblk.c: example of fitting compressed output to a specified size
+   Not copyrighted -- provided to the public domain
+   Version 1.1  25 November 2004  Mark Adler */
+
+/* Version history:
+   1.0  24 Nov 2004  First version
+   1.1  25 Nov 2004  Change deflateInit2() to deflateInit()
+                     Use fixed-size, stack-allocated raw buffers
+                     Simplify code moving compression to subroutines
+                     Use assert() for internal errors
+                     Add detailed description of approach
+ */
+
+/* Approach to just fitting a requested compressed size:
+
+   fitblk performs three compression passes on a portion of the input
+   data in order to determine how much of that input will compress to
+   nearly the requested output block size.  The first pass generates
+   enough deflate blocks to produce output to fill the requested
+   output size plus a specfied excess amount (see the EXCESS define
+   below).  The last deflate block may go quite a bit past that, but
+   is discarded.  The second pass decompresses and recompresses just
+   the compressed data that fit in the requested plus excess sized
+   buffer.  The deflate process is terminated after that amount of
+   input, which is less than the amount consumed on the first pass.
+   The last deflate block of the result will be of a comparable size
+   to the final product, so that the header for that deflate block and
+   the compression ratio for that block will be about the same as in
+   the final product.  The third compression pass decompresses the
+   result of the second step, but only the compressed data up to the
+   requested size minus an amount to allow the compressed stream to
+   complete (see the MARGIN define below).  That will result in a
+   final compressed stream whose length is less than or equal to the
+   requested size.  Assuming sufficient input and a requested size
+   greater than a few hundred bytes, the shortfall will typically be
+   less than ten bytes.
+
+   If the input is short enough that the first compression completes
+   before filling the requested output size, then that compressed
+   stream is return with no recompression.
+
+   EXCESS is chosen to be just greater than the shortfall seen in a
+   two pass approach similar to the above.  That shortfall is due to
+   the last deflate block compressing more efficiently with a smaller
+   header on the second pass.  EXCESS is set to be large enough so
+   that there is enough uncompressed data for the second pass to fill
+   out the requested size, and small enough so that the final deflate
+   block of the second pass will be close in size to the final deflate
+   block of the third and final pass.  MARGIN is chosen to be just
+   large enough to assure that the final compression has enough room
+   to complete in all cases.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <assert.h>
+#include "zlib.h"
+
+#define local static
+
+/* print nastygram and leave */
+local void quit(char *why)
+{
+    fprintf(stderr, "fitblk abort: %s\n", why);
+    exit(1);
+}
+
+#define RAWLEN 4096    /* intermediate uncompressed buffer size */
+
+/* compress from file to def until provided buffer is full or end of
+   input reached; return last deflate() return value, or Z_ERRNO if
+   there was read error on the file */
+local int partcompress(FILE *in, z_streamp def)
+{
+    int ret, flush;
+    unsigned char raw[RAWLEN];
+
+    flush = Z_NO_FLUSH;
+    do {
+        def->avail_in = fread(raw, 1, RAWLEN, in);
+        if (ferror(in))
+            return Z_ERRNO;
+        def->next_in = raw;
+        if (feof(in))
+            flush = Z_FINISH;
+        ret = deflate(def, flush);
+        assert(ret != Z_STREAM_ERROR);
+    } while (def->avail_out != 0 && flush == Z_NO_FLUSH);
+    return ret;
+}
+
+/* recompress from inf's input to def's output; the input for inf and
+   the output for def are set in those structures before calling;
+   return last deflate() return value, or Z_MEM_ERROR if inflate()
+   was not able to allocate enough memory when it needed to */
+local int recompress(z_streamp inf, z_streamp def)
+{
+    int ret, flush;
+    unsigned char raw[RAWLEN];
+
+    flush = Z_NO_FLUSH;
+    do {
+        /* decompress */
+        inf->avail_out = RAWLEN;
+        inf->next_out = raw;
+        ret = inflate(inf, Z_NO_FLUSH);
+        assert(ret != Z_STREAM_ERROR && ret != Z_DATA_ERROR &&
+               ret != Z_NEED_DICT);
+        if (ret == Z_MEM_ERROR)
+            return ret;
+
+        /* compress what was decompresed until done or no room */
+        def->avail_in = RAWLEN - inf->avail_out;
+        def->next_in = raw;
+        if (inf->avail_out != 0)
+            flush = Z_FINISH;
+        ret = deflate(def, flush);
+        assert(ret != Z_STREAM_ERROR);
+    } while (ret != Z_STREAM_END && def->avail_out != 0);
+    return ret;
+}
+
+#define EXCESS 256      /* empirically determined stream overage */
+#define MARGIN 8        /* amount to back off for completion */
+
+/* compress from stdin to fixed-size block on stdout */
+int main(int argc, char **argv)
+{
+    int ret;                /* return code */
+    unsigned size;          /* requested fixed output block size */
+    unsigned have;          /* bytes written by deflate() call */
+    unsigned char *blk;     /* intermediate and final stream */
+    unsigned char *tmp;     /* close to desired size stream */
+    z_stream def, inf;      /* zlib deflate and inflate states */
+
+    /* get requested output size */
+    if (argc != 2)
+        quit("need one argument: size of output block");
+    ret = strtol(argv[1], argv + 1, 10);
+    if (argv[1][0] != 0)
+        quit("argument must be a number");
+    if (ret < 8)            /* 8 is minimum zlib stream size */
+        quit("need positive size of 8 or greater");
+    size = (unsigned)ret;
+
+    /* allocate memory for buffers and compression engine */
+    blk = malloc(size + EXCESS);
+    def.zalloc = Z_NULL;
+    def.zfree = Z_NULL;
+    def.opaque = Z_NULL;
+    ret = deflateInit(&def, Z_DEFAULT_COMPRESSION);
+    if (ret != Z_OK || blk == NULL)
+        quit("out of memory");
+
+    /* compress from stdin until output full, or no more input */
+    def.avail_out = size + EXCESS;
+    def.next_out = blk;
+    ret = partcompress(stdin, &def);
+    if (ret == Z_ERRNO)
+        quit("error reading input");
+
+    /* if it all fit, then size was undersubscribed -- done! */
+    if (ret == Z_STREAM_END && def.avail_out >= EXCESS) {
+        /* write block to stdout */
+        have = size + EXCESS - def.avail_out;
+        if (fwrite(blk, 1, have, stdout) != have || ferror(stdout))
+            quit("error writing output");
+
+        /* clean up and print results to stderr */
+        ret = deflateEnd(&def);
+        assert(ret != Z_STREAM_ERROR);
+        free(blk);
+        fprintf(stderr,
+                "%u bytes unused out of %u requested (all input)\n",
+                size - have, size);
+        return 0;
+    }
+
+    /* it didn't all fit -- set up for recompression */
+    inf.zalloc = Z_NULL;
+    inf.zfree = Z_NULL;
+    inf.opaque = Z_NULL;
+    inf.avail_in = 0;
+    inf.next_in = Z_NULL;
+    ret = inflateInit(&inf);
+    tmp = malloc(size + EXCESS);
+    if (ret != Z_OK || tmp == NULL)
+        quit("out of memory");
+    ret = deflateReset(&def);
+    assert(ret != Z_STREAM_ERROR);
+
+    /* do first recompression close to the right amount */
+    inf.avail_in = size + EXCESS;
+    inf.next_in = blk;
+    def.avail_out = size + EXCESS;
+    def.next_out = tmp;
+    ret = recompress(&inf, &def);
+    if (ret == Z_MEM_ERROR)
+        quit("out of memory");
+
+    /* set up for next reocmpression */
+    ret = inflateReset(&inf);
+    assert(ret != Z_STREAM_ERROR);
+    ret = deflateReset(&def);
+    assert(ret != Z_STREAM_ERROR);
+
+    /* do second and final recompression (third compression) */
+    inf.avail_in = size - MARGIN;   /* assure stream will complete */
+    inf.next_in = tmp;
+    def.avail_out = size;
+    def.next_out = blk;
+    ret = recompress(&inf, &def);
+    if (ret == Z_MEM_ERROR)
+        quit("out of memory");
+    assert(ret == Z_STREAM_END);    /* otherwise MARGIN too small */
+
+    /* done -- write block to stdout */
+    have = size - def.avail_out;
+    if (fwrite(blk, 1, have, stdout) != have || ferror(stdout))
+        quit("error writing output");
+
+    /* clean up and print results to stderr */
+    free(tmp);
+    ret = inflateEnd(&inf);
+    assert(ret != Z_STREAM_ERROR);
+    ret = deflateEnd(&def);
+    assert(ret != Z_STREAM_ERROR);
+    free(blk);
+    fprintf(stderr,
+            "%u bytes unused out of %u requested (%lu input)\n",
+            size - have, size, def.total_in);
+    return 0;
+}
diff --git a/updater/zlib123/examples/gun.c b/updater/zlib123/examples/gun.c
new file mode 100644
index 0000000..2a25b0c
--- /dev/null
+++ b/updater/zlib123/examples/gun.c
@@ -0,0 +1,693 @@
+/* gun.c -- simple gunzip to give an example of the use of inflateBack()
+ * Copyright (C) 2003, 2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+   Version 1.3  12 June 2005  Mark Adler */
+
+/* Version history:
+   1.0  16 Feb 2003  First version for testing of inflateBack()
+   1.1  21 Feb 2005  Decompress concatenated gzip streams
+                     Remove use of "this" variable (C++ keyword)
+                     Fix return value for in()
+                     Improve allocation failure checking
+                     Add typecasting for void * structures
+                     Add -h option for command version and usage
+                     Add a bunch of comments
+   1.2  20 Mar 2005  Add Unix compress (LZW) decompression
+                     Copy file attributes from input file to output file
+   1.3  12 Jun 2005  Add casts for error messages [Oberhumer]
+ */
+
+/*
+   gun [ -t ] [ name ... ]
+
+   decompresses the data in the named gzip files.  If no arguments are given,
+   gun will decompress from stdin to stdout.  The names must end in .gz, -gz,
+   .z, -z, _z, or .Z.  The uncompressed data will be written to a file name
+   with the suffix stripped.  On success, the original file is deleted.  On
+   failure, the output file is deleted.  For most failures, the command will
+   continue to process the remaining names on the command line.  A memory
+   allocation failure will abort the command.  If -t is specified, then the
+   listed files or stdin will be tested as gzip files for integrity (without
+   checking for a proper suffix), no output will be written, and no files
+   will be deleted.
+
+   Like gzip, gun allows concatenated gzip streams and will decompress them,
+   writing all of the uncompressed data to the output.  Unlike gzip, gun allows
+   an empty file on input, and will produce no error writing an empty output
+   file.
+
+   gun will also decompress files made by Unix compress, which uses LZW
+   compression.  These files are automatically detected by virtue of their
+   magic header bytes.  Since the end of Unix compress stream is marked by the
+   end-of-file, they cannot be concantenated.  If a Unix compress stream is
+   encountered in an input file, it is the last stream in that file.
+
+   Like gunzip and uncompress, the file attributes of the orignal compressed
+   file are maintained in the final uncompressed file, to the extent that the
+   user permissions allow it.
+
+   On my Mac OS X PowerPC G4, gun is almost twice as fast as gunzip (version
+   1.2.4) is on the same file, when gun is linked with zlib 1.2.2.  Also the
+   LZW decompression provided by gun is about twice as fast as the standard
+   Unix uncompress command.
+ */
+
+/* external functions and related types and constants */
+#include <stdio.h>          /* fprintf() */
+#include <stdlib.h>         /* malloc(), free() */
+#include <string.h>         /* strerror(), strcmp(), strlen(), memcpy() */
+#include <errno.h>          /* errno */
+#include <fcntl.h>          /* open() */
+#include <unistd.h>         /* read(), write(), close(), chown(), unlink() */
+#include <sys/types.h>
+#include <sys/stat.h>       /* stat(), chmod() */
+#include <utime.h>          /* utime() */
+#include "zlib.h"           /* inflateBackInit(), inflateBack(), */
+                            /* inflateBackEnd(), crc32() */
+
+/* function declaration */
+#define local static
+
+/* buffer constants */
+#define SIZE 32768U         /* input and output buffer sizes */
+#define PIECE 16384         /* limits i/o chunks for 16-bit int case */
+
+/* structure for infback() to pass to input function in() -- it maintains the
+   input file and a buffer of size SIZE */
+struct ind {
+    int infile;
+    unsigned char *inbuf;
+};
+
+/* Load input buffer, assumed to be empty, and return bytes loaded and a
+   pointer to them.  read() is called until the buffer is full, or until it
+   returns end-of-file or error.  Return 0 on error. */
+local unsigned in(void *in_desc, unsigned char **buf)
+{
+    int ret;
+    unsigned len;
+    unsigned char *next;
+    struct ind *me = (struct ind *)in_desc;
+
+    next = me->inbuf;
+    *buf = next;
+    len = 0;
+    do {
+        ret = PIECE;
+        if ((unsigned)ret > SIZE - len)
+            ret = (int)(SIZE - len);
+        ret = (int)read(me->infile, next, ret);
+        if (ret == -1) {
+            len = 0;
+            break;
+        }
+        next += ret;
+        len += ret;
+    } while (ret != 0 && len < SIZE);
+    return len;
+}
+
+/* structure for infback() to pass to output function out() -- it maintains the
+   output file, a running CRC-32 check on the output and the total number of
+   bytes output, both for checking against the gzip trailer.  (The length in
+   the gzip trailer is stored modulo 2^32, so it's ok if a long is 32 bits and
+   the output is greater than 4 GB.) */
+struct outd {
+    int outfile;
+    int check;                  /* true if checking crc and total */
+    unsigned long crc;
+    unsigned long total;
+};
+
+/* Write output buffer and update the CRC-32 and total bytes written.  write()
+   is called until all of the output is written or an error is encountered.
+   On success out() returns 0.  For a write failure, out() returns 1.  If the
+   output file descriptor is -1, then nothing is written.
+ */
+local int out(void *out_desc, unsigned char *buf, unsigned len)
+{
+    int ret;
+    struct outd *me = (struct outd *)out_desc;
+
+    if (me->check) {
+        me->crc = crc32(me->crc, buf, len);
+        me->total += len;
+    }
+    if (me->outfile != -1)
+        do {
+            ret = PIECE;
+            if ((unsigned)ret > len)
+                ret = (int)len;
+            ret = (int)write(me->outfile, buf, ret);
+            if (ret == -1)
+                return 1;
+            buf += ret;
+            len -= ret;
+        } while (len != 0);
+    return 0;
+}
+
+/* next input byte macro for use inside lunpipe() and gunpipe() */
+#define NEXT() (have ? 0 : (have = in(indp, &next)), \
+                last = have ? (have--, (int)(*next++)) : -1)
+
+/* memory for gunpipe() and lunpipe() --
+   the first 256 entries of prefix[] and suffix[] are never used, could
+   have offset the index, but it's faster to waste the memory */
+unsigned char inbuf[SIZE];              /* input buffer */
+unsigned char outbuf[SIZE];             /* output buffer */
+unsigned short prefix[65536];           /* index to LZW prefix string */
+unsigned char suffix[65536];            /* one-character LZW suffix */
+unsigned char match[65280 + 2];         /* buffer for reversed match or gzip
+                                           32K sliding window */
+
+/* throw out what's left in the current bits byte buffer (this is a vestigial
+   aspect of the compressed data format derived from an implementation that
+   made use of a special VAX machine instruction!) */
+#define FLUSHCODE() \
+    do { \
+        left = 0; \
+        rem = 0; \
+        if (chunk > have) { \
+            chunk -= have; \
+            have = 0; \
+            if (NEXT() == -1) \
+                break; \
+            chunk--; \
+            if (chunk > have) { \
+                chunk = have = 0; \
+                break; \
+            } \
+        } \
+        have -= chunk; \
+        next += chunk; \
+        chunk = 0; \
+    } while (0)
+
+/* Decompress a compress (LZW) file from indp to outfile.  The compress magic
+   header (two bytes) has already been read and verified.  There are have bytes
+   of buffered input at next.  strm is used for passing error information back
+   to gunpipe().
+
+   lunpipe() will return Z_OK on success, Z_BUF_ERROR for an unexpected end of
+   file, read error, or write error (a write error indicated by strm->next_in
+   not equal to Z_NULL), or Z_DATA_ERROR for invalid input.
+ */
+local int lunpipe(unsigned have, unsigned char *next, struct ind *indp,
+                  int outfile, z_stream *strm)
+{
+    int last;                   /* last byte read by NEXT(), or -1 if EOF */
+    int chunk;                  /* bytes left in current chunk */
+    int left;                   /* bits left in rem */
+    unsigned rem;               /* unused bits from input */
+    int bits;                   /* current bits per code */
+    unsigned code;              /* code, table traversal index */
+    unsigned mask;              /* mask for current bits codes */
+    int max;                    /* maximum bits per code for this stream */
+    int flags;                  /* compress flags, then block compress flag */
+    unsigned end;               /* last valid entry in prefix/suffix tables */
+    unsigned temp;              /* current code */
+    unsigned prev;              /* previous code */
+    unsigned final;             /* last character written for previous code */
+    unsigned stack;             /* next position for reversed string */
+    unsigned outcnt;            /* bytes in output buffer */
+    struct outd outd;           /* output structure */
+
+    /* set up output */
+    outd.outfile = outfile;
+    outd.check = 0;
+
+    /* process remainder of compress header -- a flags byte */
+    flags = NEXT();
+    if (last == -1)
+        return Z_BUF_ERROR;
+    if (flags & 0x60) {
+        strm->msg = (char *)"unknown lzw flags set";
+        return Z_DATA_ERROR;
+    }
+    max = flags & 0x1f;
+    if (max < 9 || max > 16) {
+        strm->msg = (char *)"lzw bits out of range";
+        return Z_DATA_ERROR;
+    }
+    if (max == 9)                           /* 9 doesn't really mean 9 */
+        max = 10;
+    flags &= 0x80;                          /* true if block compress */
+
+    /* clear table */
+    bits = 9;
+    mask = 0x1ff;
+    end = flags ? 256 : 255;
+
+    /* set up: get first 9-bit code, which is the first decompressed byte, but
+       don't create a table entry until the next code */
+    if (NEXT() == -1)                       /* no compressed data is ok */
+        return Z_OK;
+    final = prev = (unsigned)last;          /* low 8 bits of code */
+    if (NEXT() == -1)                       /* missing a bit */
+        return Z_BUF_ERROR;
+    if (last & 1) {                         /* code must be < 256 */
+        strm->msg = (char *)"invalid lzw code";
+        return Z_DATA_ERROR;
+    }
+    rem = (unsigned)last >> 1;              /* remaining 7 bits */
+    left = 7;
+    chunk = bits - 2;                       /* 7 bytes left in this chunk */
+    outbuf[0] = (unsigned char)final;       /* write first decompressed byte */
+    outcnt = 1;
+
+    /* decode codes */
+    stack = 0;
+    for (;;) {
+        /* if the table will be full after this, increment the code size */
+        if (end >= mask && bits < max) {
+            FLUSHCODE();
+            bits++;
+            mask <<= 1;
+            mask++;
+        }
+
+        /* get a code of length bits */
+        if (chunk == 0)                     /* decrement chunk modulo bits */
+            chunk = bits;
+        code = rem;                         /* low bits of code */
+        if (NEXT() == -1) {                 /* EOF is end of compressed data */
+            /* write remaining buffered output */
+            if (outcnt && out(&outd, outbuf, outcnt)) {
+                strm->next_in = outbuf;     /* signal write error */
+                return Z_BUF_ERROR;
+            }
+            return Z_OK;
+        }
+        code += (unsigned)last << left;     /* middle (or high) bits of code */
+        left += 8;
+        chunk--;
+        if (bits > left) {                  /* need more bits */
+            if (NEXT() == -1)               /* can't end in middle of code */
+                return Z_BUF_ERROR;
+            code += (unsigned)last << left; /* high bits of code */
+            left += 8;
+            chunk--;
+        }
+        code &= mask;                       /* mask to current code length */
+        left -= bits;                       /* number of unused bits */
+        rem = (unsigned)last >> (8 - left); /* unused bits from last byte */
+
+        /* process clear code (256) */
+        if (code == 256 && flags) {
+            FLUSHCODE();
+            bits = 9;                       /* initialize bits and mask */
+            mask = 0x1ff;
+            end = 255;                      /* empty table */
+            continue;                       /* get next code */
+        }
+
+        /* special code to reuse last match */
+        temp = code;                        /* save the current code */
+        if (code > end) {
+            /* Be picky on the allowed code here, and make sure that the code
+               we drop through (prev) will be a valid index so that random
+               input does not cause an exception.  The code != end + 1 check is
+               empirically derived, and not checked in the original uncompress
+               code.  If this ever causes a problem, that check could be safely
+               removed.  Leaving this check in greatly improves gun's ability
+               to detect random or corrupted input after a compress header.
+               In any case, the prev > end check must be retained. */
+            if (code != end + 1 || prev > end) {
+                strm->msg = (char *)"invalid lzw code";
+                return Z_DATA_ERROR;
+            }
+            match[stack++] = (unsigned char)final;
+            code = prev;
+        }
+
+        /* walk through linked list to generate output in reverse order */
+        while (code >= 256) {
+            match[stack++] = suffix[code];
+            code = prefix[code];
+        }
+        match[stack++] = (unsigned char)code;
+        final = code;
+
+        /* link new table entry */
+        if (end < mask) {
+            end++;
+            prefix[end] = (unsigned short)prev;
+            suffix[end] = (unsigned char)final;
+        }
+
+        /* set previous code for next iteration */
+        prev = temp;
+
+        /* write output in forward order */
+        while (stack > SIZE - outcnt) {
+            while (outcnt < SIZE)
+                outbuf[outcnt++] = match[--stack];
+            if (out(&outd, outbuf, outcnt)) {
+                strm->next_in = outbuf; /* signal write error */
+                return Z_BUF_ERROR;
+            }
+            outcnt = 0;
+        }
+        do {
+            outbuf[outcnt++] = match[--stack];
+        } while (stack);
+
+        /* loop for next code with final and prev as the last match, rem and
+           left provide the first 0..7 bits of the next code, end is the last
+           valid table entry */
+    }
+}
+
+/* Decompress a gzip file from infile to outfile.  strm is assumed to have been
+   successfully initialized with inflateBackInit().  The input file may consist
+   of a series of gzip streams, in which case all of them will be decompressed
+   to the output file.  If outfile is -1, then the gzip stream(s) integrity is
+   checked and nothing is written.
+
+   The return value is a zlib error code: Z_MEM_ERROR if out of memory,
+   Z_DATA_ERROR if the header or the compressed data is invalid, or if the
+   trailer CRC-32 check or length doesn't match, Z_BUF_ERROR if the input ends
+   prematurely or a write error occurs, or Z_ERRNO if junk (not a another gzip
+   stream) follows a valid gzip stream.
+ */
+local int gunpipe(z_stream *strm, int infile, int outfile)
+{
+    int ret, first, last;
+    unsigned have, flags, len;
+    unsigned char *next;
+    struct ind ind, *indp;
+    struct outd outd;
+
+    /* setup input buffer */
+    ind.infile = infile;
+    ind.inbuf = inbuf;
+    indp = &ind;
+
+    /* decompress concatenated gzip streams */
+    have = 0;                               /* no input data read in yet */
+    first = 1;                              /* looking for first gzip header */
+    strm->next_in = Z_NULL;                 /* so Z_BUF_ERROR means EOF */
+    for (;;) {
+        /* look for the two magic header bytes for a gzip stream */
+        if (NEXT() == -1) {
+            ret = Z_OK;
+            break;                          /* empty gzip stream is ok */
+        }
+        if (last != 31 || (NEXT() != 139 && last != 157)) {
+            strm->msg = (char *)"incorrect header check";
+            ret = first ? Z_DATA_ERROR : Z_ERRNO;
+            break;                          /* not a gzip or compress header */
+        }
+        first = 0;                          /* next non-header is junk */
+
+        /* process a compress (LZW) file -- can't be concatenated after this */
+        if (last == 157) {
+            ret = lunpipe(have, next, indp, outfile, strm);
+            break;
+        }
+
+        /* process remainder of gzip header */
+        ret = Z_BUF_ERROR;
+        if (NEXT() != 8) {                  /* only deflate method allowed */
+            if (last == -1) break;
+            strm->msg = (char *)"unknown compression method";
+            ret = Z_DATA_ERROR;
+            break;
+        }
+        flags = NEXT();                     /* header flags */
+        NEXT();                             /* discard mod time, xflgs, os */
+        NEXT();
+        NEXT();
+        NEXT();
+        NEXT();
+        NEXT();
+        if (last == -1) break;
+        if (flags & 0xe0) {
+            strm->msg = (char *)"unknown header flags set";
+            ret = Z_DATA_ERROR;
+            break;
+        }
+        if (flags & 4) {                    /* extra field */
+            len = NEXT();
+            len += (unsigned)(NEXT()) << 8;
+            if (last == -1) break;
+            while (len > have) {
+                len -= have;
+                have = 0;
+                if (NEXT() == -1) break;
+                len--;
+            }
+            if (last == -1) break;
+            have -= len;
+            next += len;
+        }
+        if (flags & 8)                      /* file name */
+            while (NEXT() != 0 && last != -1)
+                ;
+        if (flags & 16)                     /* comment */
+            while (NEXT() != 0 && last != -1)
+                ;
+        if (flags & 2) {                    /* header crc */
+            NEXT();
+            NEXT();
+        }
+        if (last == -1) break;
+
+        /* set up output */
+        outd.outfile = outfile;
+        outd.check = 1;
+        outd.crc = crc32(0L, Z_NULL, 0);
+        outd.total = 0;
+
+        /* decompress data to output */
+        strm->next_in = next;
+        strm->avail_in = have;
+        ret = inflateBack(strm, in, indp, out, &outd);
+        if (ret != Z_STREAM_END) break;
+        next = strm->next_in;
+        have = strm->avail_in;
+        strm->next_in = Z_NULL;             /* so Z_BUF_ERROR means EOF */
+
+        /* check trailer */
+        ret = Z_BUF_ERROR;
+        if (NEXT() != (outd.crc & 0xff) ||
+            NEXT() != ((outd.crc >> 8) & 0xff) ||
+            NEXT() != ((outd.crc >> 16) & 0xff) ||
+            NEXT() != ((outd.crc >> 24) & 0xff)) {
+            /* crc error */
+            if (last != -1) {
+                strm->msg = (char *)"incorrect data check";
+                ret = Z_DATA_ERROR;
+            }
+            break;
+        }
+        if (NEXT() != (outd.total & 0xff) ||
+            NEXT() != ((outd.total >> 8) & 0xff) ||
+            NEXT() != ((outd.total >> 16) & 0xff) ||
+            NEXT() != ((outd.total >> 24) & 0xff)) {
+            /* length error */
+            if (last != -1) {
+                strm->msg = (char *)"incorrect length check";
+                ret = Z_DATA_ERROR;
+            }
+            break;
+        }
+
+        /* go back and look for another gzip stream */
+    }
+
+    /* clean up and return */
+    return ret;
+}
+
+/* Copy file attributes, from -> to, as best we can.  This is best effort, so
+   no errors are reported.  The mode bits, including suid, sgid, and the sticky
+   bit are copied (if allowed), the owner's user id and group id are copied
+   (again if allowed), and the access and modify times are copied. */
+local void copymeta(char *from, char *to)
+{
+    struct stat was;
+    struct utimbuf when;
+
+    /* get all of from's Unix meta data, return if not a regular file */
+    if (stat(from, &was) != 0 || (was.st_mode & S_IFMT) != S_IFREG)
+        return;
+
+    /* set to's mode bits, ignore errors */
+    (void)chmod(to, was.st_mode & 07777);
+
+    /* copy owner's user and group, ignore errors */
+    (void)chown(to, was.st_uid, was.st_gid);
+
+    /* copy access and modify times, ignore errors */
+    when.actime = was.st_atime;
+    when.modtime = was.st_mtime;
+    (void)utime(to, &when);
+}
+
+/* Decompress the file inname to the file outnname, of if test is true, just
+   decompress without writing and check the gzip trailer for integrity.  If
+   inname is NULL or an empty string, read from stdin.  If outname is NULL or
+   an empty string, write to stdout.  strm is a pre-initialized inflateBack
+   structure.  When appropriate, copy the file attributes from inname to
+   outname.
+
+   gunzip() returns 1 if there is an out-of-memory error or an unexpected
+   return code from gunpipe().  Otherwise it returns 0.
+ */
+local int gunzip(z_stream *strm, char *inname, char *outname, int test)
+{
+    int ret;
+    int infile, outfile;
+
+    /* open files */
+    if (inname == NULL || *inname == 0) {
+        inname = "-";
+        infile = 0;     /* stdin */
+    }
+    else {
+        infile = open(inname, O_RDONLY, 0);
+        if (infile == -1) {
+            fprintf(stderr, "gun cannot open %s\n", inname);
+            return 0;
+        }
+    }
+    if (test)
+        outfile = -1;
+    else if (outname == NULL || *outname == 0) {
+        outname = "-";
+        outfile = 1;    /* stdout */
+    }
+    else {
+        outfile = open(outname, O_CREAT | O_TRUNC | O_WRONLY, 0666);
+        if (outfile == -1) {
+            close(infile);
+            fprintf(stderr, "gun cannot create %s\n", outname);
+            return 0;
+        }
+    }
+    errno = 0;
+
+    /* decompress */
+    ret = gunpipe(strm, infile, outfile);
+    if (outfile > 2) close(outfile);
+    if (infile > 2) close(infile);
+
+    /* interpret result */
+    switch (ret) {
+    case Z_OK:
+    case Z_ERRNO:
+        if (infile > 2 && outfile > 2) {
+            copymeta(inname, outname);          /* copy attributes */
+            unlink(inname);
+        }
+        if (ret == Z_ERRNO)
+            fprintf(stderr, "gun warning: trailing garbage ignored in %s\n",
+                    inname);
+        break;
+    case Z_DATA_ERROR:
+        if (outfile > 2) unlink(outname);
+        fprintf(stderr, "gun data error on %s: %s\n", inname, strm->msg);
+        break;
+    case Z_MEM_ERROR:
+        if (outfile > 2) unlink(outname);
+        fprintf(stderr, "gun out of memory error--aborting\n");
+        return 1;
+    case Z_BUF_ERROR:
+        if (outfile > 2) unlink(outname);
+        if (strm->next_in != Z_NULL) {
+            fprintf(stderr, "gun write error on %s: %s\n",
+                    outname, strerror(errno));
+        }
+        else if (errno) {
+            fprintf(stderr, "gun read error on %s: %s\n",
+                    inname, strerror(errno));
+        }
+        else {
+            fprintf(stderr, "gun unexpected end of file on %s\n",
+                    inname);
+        }
+        break;
+    default:
+        if (outfile > 2) unlink(outname);
+        fprintf(stderr, "gun internal error--aborting\n");
+        return 1;
+    }
+    return 0;
+}
+
+/* Process the gun command line arguments.  See the command syntax near the
+   beginning of this source file. */
+int main(int argc, char **argv)
+{
+    int ret, len, test;
+    char *outname;
+    unsigned char *window;
+    z_stream strm;
+
+    /* initialize inflateBack state for repeated use */
+    window = match;                         /* reuse LZW match buffer */
+    strm.zalloc = Z_NULL;
+    strm.zfree = Z_NULL;
+    strm.opaque = Z_NULL;
+    ret = inflateBackInit(&strm, 15, window);
+    if (ret != Z_OK) {
+        fprintf(stderr, "gun out of memory error--aborting\n");
+        return 1;
+    }
+
+    /* decompress each file to the same name with the suffix removed */
+    argc--;
+    argv++;
+    test = 0;
+    if (argc && strcmp(*argv, "-h") == 0) {
+        fprintf(stderr, "gun 1.3 (12 Jun 2005)\n");
+        fprintf(stderr, "Copyright (c) 2005 Mark Adler\n");
+        fprintf(stderr, "usage: gun [-t] [file1.gz [file2.Z ...]]\n");
+        return 0;
+    }
+    if (argc && strcmp(*argv, "-t") == 0) {
+        test = 1;
+        argc--;
+        argv++;
+    }
+    if (argc)
+        do {
+            if (test)
+                outname = NULL;
+            else {
+                len = (int)strlen(*argv);
+                if (strcmp(*argv + len - 3, ".gz") == 0 ||
+                    strcmp(*argv + len - 3, "-gz") == 0)
+                    len -= 3;
+                else if (strcmp(*argv + len - 2, ".z") == 0 ||
+                    strcmp(*argv + len - 2, "-z") == 0 ||
+                    strcmp(*argv + len - 2, "_z") == 0 ||
+                    strcmp(*argv + len - 2, ".Z") == 0)
+                    len -= 2;
+                else {
+                    fprintf(stderr, "gun error: no gz type on %s--skipping\n",
+                            *argv);
+                    continue;
+                }
+                outname = malloc(len + 1);
+                if (outname == NULL) {
+                    fprintf(stderr, "gun out of memory error--aborting\n");
+                    ret = 1;
+                    break;
+                }
+                memcpy(outname, *argv, len);
+                outname[len] = 0;
+            }
+            ret = gunzip(&strm, *argv, outname, test);
+            if (outname != NULL) free(outname);
+            if (ret) break;
+        } while (argv++, --argc);
+    else
+        ret = gunzip(&strm, NULL, NULL, test);
+
+    /* clean up */
+    inflateBackEnd(&strm);
+    return ret;
+}
diff --git a/updater/zlib123/examples/gzappend.c b/updater/zlib123/examples/gzappend.c
new file mode 100644
index 0000000..3a8ed2f
--- /dev/null
+++ b/updater/zlib123/examples/gzappend.c
@@ -0,0 +1,500 @@
+/* gzappend -- command to append to a gzip file
+
+  Copyright (C) 2003 Mark Adler, all rights reserved
+  version 1.1, 4 Nov 2003
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the author be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Mark Adler    madler@alumni.caltech.edu
+ */
+
+/*
+ * Change history:
+ *
+ * 1.0  19 Oct 2003     - First version
+ * 1.1   4 Nov 2003     - Expand and clarify some comments and notes
+ *                      - Add version and copyright to help
+ *                      - Send help to stdout instead of stderr
+ *                      - Add some preemptive typecasts
+ *                      - Add L to constants in lseek() calls
+ *                      - Remove some debugging information in error messages
+ *                      - Use new data_type definition for zlib 1.2.1
+ *                      - Simplfy and unify file operations
+ *                      - Finish off gzip file in gztack()
+ *                      - Use deflatePrime() instead of adding empty blocks
+ *                      - Keep gzip file clean on appended file read errors
+ *                      - Use in-place rotate instead of auxiliary buffer
+ *                        (Why you ask?  Because it was fun to write!)
+ */
+
+/*
+   gzappend takes a gzip file and appends to it, compressing files from the
+   command line or data from stdin.  The gzip file is written to directly, to
+   avoid copying that file, in case it's large.  Note that this results in the
+   unfriendly behavior that if gzappend fails, the gzip file is corrupted.
+
+   This program was written to illustrate the use of the new Z_BLOCK option of
+   zlib 1.2.x's inflate() function.  This option returns from inflate() at each
+   block boundary to facilitate locating and modifying the last block bit at
+   the start of the final deflate block.  Also whether using Z_BLOCK or not,
+   another required feature of zlib 1.2.x is that inflate() now provides the
+   number of unusued bits in the last input byte used.  gzappend will not work
+   with versions of zlib earlier than 1.2.1.
+
+   gzappend first decompresses the gzip file internally, discarding all but
+   the last 32K of uncompressed data, and noting the location of the last block
+   bit and the number of unused bits in the last byte of the compressed data.
+   The gzip trailer containing the CRC-32 and length of the uncompressed data
+   is verified.  This trailer will be later overwritten.
+
+   Then the last block bit is cleared by seeking back in the file and rewriting
+   the byte that contains it.  Seeking forward, the last byte of the compressed
+   data is saved along with the number of unused bits to initialize deflate.
+
+   A deflate process is initialized, using the last 32K of the uncompressed
+   data from the gzip file to initialize the dictionary.  If the total
+   uncompressed data was less than 32K, then all of it is used to initialize
+   the dictionary.  The deflate output bit buffer is also initialized with the
+   last bits from the original deflate stream.  From here on, the data to
+   append is simply compressed using deflate, and written to the gzip file.
+   When that is complete, the new CRC-32 and uncompressed length are written
+   as the trailer of the gzip file.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <fcntl.h>
+#include <unistd.h>
+#include "zlib.h"
+
+#define local static
+#define LGCHUNK 14
+#define CHUNK (1U << LGCHUNK)
+#define DSIZE 32768U
+
+/* print an error message and terminate with extreme prejudice */
+local void bye(char *msg1, char *msg2)
+{
+    fprintf(stderr, "gzappend error: %s%s\n", msg1, msg2);
+    exit(1);
+}
+
+/* return the greatest common divisor of a and b using Euclid's algorithm,
+   modified to be fast when one argument much greater than the other, and
+   coded to avoid unnecessary swapping */
+local unsigned gcd(unsigned a, unsigned b)
+{
+    unsigned c;
+
+    while (a && b)
+        if (a > b) {
+            c = b;
+            while (a - c >= c)
+                c <<= 1;
+            a -= c;
+        }
+        else {
+            c = a;
+            while (b - c >= c)
+                c <<= 1;
+            b -= c;
+        }
+    return a + b;
+}
+
+/* rotate list[0..len-1] left by rot positions, in place */
+local void rotate(unsigned char *list, unsigned len, unsigned rot)
+{
+    unsigned char tmp;
+    unsigned cycles;
+    unsigned char *start, *last, *to, *from;
+
+    /* normalize rot and handle degenerate cases */
+    if (len < 2) return;
+    if (rot >= len) rot %= len;
+    if (rot == 0) return;
+
+    /* pointer to last entry in list */
+    last = list + (len - 1);
+
+    /* do simple left shift by one */
+    if (rot == 1) {
+        tmp = *list;
+        memcpy(list, list + 1, len - 1);
+        *last = tmp;
+        return;
+    }
+
+    /* do simple right shift by one */
+    if (rot == len - 1) {
+        tmp = *last;
+        memmove(list + 1, list, len - 1);
+        *list = tmp;
+        return;
+    }
+
+    /* otherwise do rotate as a set of cycles in place */
+    cycles = gcd(len, rot);             /* number of cycles */
+    do {
+        start = from = list + cycles;   /* start index is arbitrary */
+        tmp = *from;                    /* save entry to be overwritten */
+        for (;;) {
+            to = from;                  /* next step in cycle */
+            from += rot;                /* go right rot positions */
+            if (from > last) from -= len;   /* (pointer better not wrap) */
+            if (from == start) break;   /* all but one shifted */
+            *to = *from;                /* shift left */
+        }
+        *to = tmp;                      /* complete the circle */
+    } while (--cycles);
+}
+
+/* structure for gzip file read operations */
+typedef struct {
+    int fd;                     /* file descriptor */
+    int size;                   /* 1 << size is bytes in buf */
+    unsigned left;              /* bytes available at next */
+    unsigned char *buf;         /* buffer */
+    unsigned char *next;        /* next byte in buffer */
+    char *name;                 /* file name for error messages */
+} file;
+
+/* reload buffer */
+local int readin(file *in)
+{
+    int len;
+
+    len = read(in->fd, in->buf, 1 << in->size);
+    if (len == -1) bye("error reading ", in->name);
+    in->left = (unsigned)len;
+    in->next = in->buf;
+    return len;
+}
+
+/* read from file in, exit if end-of-file */
+local int readmore(file *in)
+{
+    if (readin(in) == 0) bye("unexpected end of ", in->name);
+    return 0;
+}
+
+#define read1(in) (in->left == 0 ? readmore(in) : 0, \
+                   in->left--, *(in->next)++)
+
+/* skip over n bytes of in */
+local void skip(file *in, unsigned n)
+{
+    unsigned bypass;
+
+    if (n > in->left) {
+        n -= in->left;
+        bypass = n & ~((1U << in->size) - 1);
+        if (bypass) {
+            if (lseek(in->fd, (off_t)bypass, SEEK_CUR) == -1)
+                bye("seeking ", in->name);
+            n -= bypass;
+        }
+        readmore(in);
+        if (n > in->left)
+            bye("unexpected end of ", in->name);
+    }
+    in->left -= n;
+    in->next += n;
+}
+
+/* read a four-byte unsigned integer, little-endian, from in */
+unsigned long read4(file *in)
+{
+    unsigned long val;
+
+    val = read1(in);
+    val += (unsigned)read1(in) << 8;
+    val += (unsigned long)read1(in) << 16;
+    val += (unsigned long)read1(in) << 24;
+    return val;
+}
+
+/* skip over gzip header */
+local void gzheader(file *in)
+{
+    int flags;
+    unsigned n;
+
+    if (read1(in) != 31 || read1(in) != 139) bye(in->name, " not a gzip file");
+    if (read1(in) != 8) bye("unknown compression method in", in->name);
+    flags = read1(in);
+    if (flags & 0xe0) bye("unknown header flags set in", in->name);
+    skip(in, 6);
+    if (flags & 4) {
+        n = read1(in);
+        n += (unsigned)(read1(in)) << 8;
+        skip(in, n);
+    }
+    if (flags & 8) while (read1(in) != 0) ;
+    if (flags & 16) while (read1(in) != 0) ;
+    if (flags & 2) skip(in, 2);
+}
+
+/* decompress gzip file "name", return strm with a deflate stream ready to
+   continue compression of the data in the gzip file, and return a file
+   descriptor pointing to where to write the compressed data -- the deflate
+   stream is initialized to compress using level "level" */
+local int gzscan(char *name, z_stream *strm, int level)
+{
+    int ret, lastbit, left, full;
+    unsigned have;
+    unsigned long crc, tot;
+    unsigned char *window;
+    off_t lastoff, end;
+    file gz;
+
+    /* open gzip file */
+    gz.name = name;
+    gz.fd = open(name, O_RDWR, 0);
+    if (gz.fd == -1) bye("cannot open ", name);
+    gz.buf = malloc(CHUNK);
+    if (gz.buf == NULL) bye("out of memory", "");
+    gz.size = LGCHUNK;
+    gz.left = 0;
+
+    /* skip gzip header */
+    gzheader(&gz);
+
+    /* prepare to decompress */
+    window = malloc(DSIZE);
+    if (window == NULL) bye("out of memory", "");
+    strm->zalloc = Z_NULL;
+    strm->zfree = Z_NULL;
+    strm->opaque = Z_NULL;
+    ret = inflateInit2(strm, -15);
+    if (ret != Z_OK) bye("out of memory", " or library mismatch");
+
+    /* decompress the deflate stream, saving append information */
+    lastbit = 0;
+    lastoff = lseek(gz.fd, 0L, SEEK_CUR) - gz.left;
+    left = 0;
+    strm->avail_in = gz.left;
+    strm->next_in = gz.next;
+    crc = crc32(0L, Z_NULL, 0);
+    have = full = 0;
+    do {
+        /* if needed, get more input */
+        if (strm->avail_in == 0) {
+            readmore(&gz);
+            strm->avail_in = gz.left;
+            strm->next_in = gz.next;
+        }
+
+        /* set up output to next available section of sliding window */
+        strm->avail_out = DSIZE - have;
+        strm->next_out = window + have;
+
+        /* inflate and check for errors */
+        ret = inflate(strm, Z_BLOCK);
+        if (ret == Z_STREAM_ERROR) bye("internal stream error!", "");
+        if (ret == Z_MEM_ERROR) bye("out of memory", "");
+        if (ret == Z_DATA_ERROR)
+            bye("invalid compressed data--format violated in", name);
+
+        /* update crc and sliding window pointer */
+        crc = crc32(crc, window + have, DSIZE - have - strm->avail_out);
+        if (strm->avail_out)
+            have = DSIZE - strm->avail_out;
+        else {
+            have = 0;
+            full = 1;
+        }
+
+        /* process end of block */
+        if (strm->data_type & 128) {
+            if (strm->data_type & 64)
+                left = strm->data_type & 0x1f;
+            else {
+                lastbit = strm->data_type & 0x1f;
+                lastoff = lseek(gz.fd, 0L, SEEK_CUR) - strm->avail_in;
+            }
+        }
+    } while (ret != Z_STREAM_END);
+    inflateEnd(strm);
+    gz.left = strm->avail_in;
+    gz.next = strm->next_in;
+
+    /* save the location of the end of the compressed data */
+    end = lseek(gz.fd, 0L, SEEK_CUR) - gz.left;
+
+    /* check gzip trailer and save total for deflate */
+    if (crc != read4(&gz))
+        bye("invalid compressed data--crc mismatch in ", name);
+    tot = strm->total_out;
+    if ((tot & 0xffffffffUL) != read4(&gz))
+        bye("invalid compressed data--length mismatch in", name);
+
+    /* if not at end of file, warn */
+    if (gz.left || readin(&gz))
+        fprintf(stderr,
+            "gzappend warning: junk at end of gzip file overwritten\n");
+
+    /* clear last block bit */
+    lseek(gz.fd, lastoff - (lastbit != 0), SEEK_SET);
+    if (read(gz.fd, gz.buf, 1) != 1) bye("reading after seek on ", name);
+    *gz.buf = (unsigned char)(*gz.buf ^ (1 << ((8 - lastbit) & 7)));
+    lseek(gz.fd, -1L, SEEK_CUR);
+    if (write(gz.fd, gz.buf, 1) != 1) bye("writing after seek to ", name);
+
+    /* if window wrapped, build dictionary from window by rotating */
+    if (full) {
+        rotate(window, DSIZE, have);
+        have = DSIZE;
+    }
+
+    /* set up deflate stream with window, crc, total_in, and leftover bits */
+    ret = deflateInit2(strm, level, Z_DEFLATED, -15, 8, Z_DEFAULT_STRATEGY);
+    if (ret != Z_OK) bye("out of memory", "");
+    deflateSetDictionary(strm, window, have);
+    strm->adler = crc;
+    strm->total_in = tot;
+    if (left) {
+        lseek(gz.fd, --end, SEEK_SET);
+        if (read(gz.fd, gz.buf, 1) != 1) bye("reading after seek on ", name);
+        deflatePrime(strm, 8 - left, *gz.buf);
+    }
+    lseek(gz.fd, end, SEEK_SET);
+
+    /* clean up and return */
+    free(window);
+    free(gz.buf);
+    return gz.fd;
+}
+
+/* append file "name" to gzip file gd using deflate stream strm -- if last
+   is true, then finish off the deflate stream at the end */
+local void gztack(char *name, int gd, z_stream *strm, int last)
+{
+    int fd, len, ret;
+    unsigned left;
+    unsigned char *in, *out;
+
+    /* open file to compress and append */
+    fd = 0;
+    if (name != NULL) {
+        fd = open(name, O_RDONLY, 0);
+        if (fd == -1)
+            fprintf(stderr, "gzappend warning: %s not found, skipping ...\n",
+                    name);
+    }
+
+    /* allocate buffers */
+    in = fd == -1 ? NULL : malloc(CHUNK);
+    out = malloc(CHUNK);
+    if (out == NULL) bye("out of memory", "");
+
+    /* compress input file and append to gzip file */
+    do {
+        /* get more input */
+        len = fd == -1 ? 0 : read(fd, in, CHUNK);
+        if (len == -1) {
+            fprintf(stderr,
+                    "gzappend warning: error reading %s, skipping rest ...\n",
+                    name);
+            len = 0;
+        }
+        strm->avail_in = (unsigned)len;
+        strm->next_in = in;
+        if (len) strm->adler = crc32(strm->adler, in, (unsigned)len);
+
+        /* compress and write all available output */
+        do {
+            strm->avail_out = CHUNK;
+            strm->next_out = out;
+            ret = deflate(strm, last && len == 0 ? Z_FINISH : Z_NO_FLUSH);
+            left = CHUNK - strm->avail_out;
+            while (left) {
+                len = write(gd, out + CHUNK - strm->avail_out - left, left);
+                if (len == -1) bye("writing gzip file", "");
+                left -= (unsigned)len;
+            }
+        } while (strm->avail_out == 0 && ret != Z_STREAM_END);
+    } while (len != 0);
+
+    /* write trailer after last entry */
+    if (last) {
+        deflateEnd(strm);
+        out[0] = (unsigned char)(strm->adler);
+        out[1] = (unsigned char)(strm->adler >> 8);
+        out[2] = (unsigned char)(strm->adler >> 16);
+        out[3] = (unsigned char)(strm->adler >> 24);
+        out[4] = (unsigned char)(strm->total_in);
+        out[5] = (unsigned char)(strm->total_in >> 8);
+        out[6] = (unsigned char)(strm->total_in >> 16);
+        out[7] = (unsigned char)(strm->total_in >> 24);
+        len = 8;
+        do {
+            ret = write(gd, out + 8 - len, len);
+            if (ret == -1) bye("writing gzip file", "");
+            len -= ret;
+        } while (len);
+        close(gd);
+    }
+
+    /* clean up and return */
+    free(out);
+    if (in != NULL) free(in);
+    if (fd > 0) close(fd);
+}
+
+/* process the compression level option if present, scan the gzip file, and
+   append the specified files, or append the data from stdin if no other file
+   names are provided on the command line -- the gzip file must be writable
+   and seekable */
+int main(int argc, char **argv)
+{
+    int gd, level;
+    z_stream strm;
+
+    /* ignore command name */
+    argv++;
+
+    /* provide usage if no arguments */
+    if (*argv == NULL) {
+        printf("gzappend 1.1 (4 Nov 2003) Copyright (C) 2003 Mark Adler\n");
+        printf(
+            "usage: gzappend [-level] file.gz [ addthis [ andthis ... ]]\n");
+        return 0;
+    }
+
+    /* set compression level */
+    level = Z_DEFAULT_COMPRESSION;
+    if (argv[0][0] == '-') {
+        if (argv[0][1] < '0' || argv[0][1] > '9' || argv[0][2] != 0)
+            bye("invalid compression level", "");
+        level = argv[0][1] - '0';
+        if (*++argv == NULL) bye("no gzip file name after options", "");
+    }
+
+    /* prepare to append to gzip file */
+    gd = gzscan(*argv++, &strm, level);
+
+    /* append files on command line, or from stdin if none */
+    if (*argv == NULL)
+        gztack(NULL, gd, &strm, 1);
+    else
+        do {
+            gztack(*argv, gd, &strm, argv[1] == NULL);
+        } while (*++argv != NULL);
+    return 0;
+}
diff --git a/updater/zlib123/examples/gzjoin.c b/updater/zlib123/examples/gzjoin.c
new file mode 100644
index 0000000..63e4bc7
--- /dev/null
+++ b/updater/zlib123/examples/gzjoin.c
@@ -0,0 +1,448 @@
+/* gzjoin -- command to join gzip files into one gzip file
+
+  Copyright (C) 2004 Mark Adler, all rights reserved
+  version 1.0, 11 Dec 2004
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the author be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Mark Adler    madler@alumni.caltech.edu
+ */
+
+/*
+ * Change history:
+ *
+ * 1.0  11 Dec 2004     - First version
+ * 1.1  12 Jun 2005     - Changed ssize_t to long for portability
+ */
+
+/*
+   gzjoin takes one or more gzip files on the command line and writes out a
+   single gzip file that will uncompress to the concatenation of the
+   uncompressed data from the individual gzip files.  gzjoin does this without
+   having to recompress any of the data and without having to calculate a new
+   crc32 for the concatenated uncompressed data.  gzjoin does however have to
+   decompress all of the input data in order to find the bits in the compressed
+   data that need to be modified to concatenate the streams.
+
+   gzjoin does not do an integrity check on the input gzip files other than
+   checking the gzip header and decompressing the compressed data.  They are
+   otherwise assumed to be complete and correct.
+
+   Each joint between gzip files removes at least 18 bytes of previous trailer
+   and subsequent header, and inserts an average of about three bytes to the
+   compressed data in order to connect the streams.  The output gzip file
+   has a minimal ten-byte gzip header with no file name or modification time.
+
+   This program was written to illustrate the use of the Z_BLOCK option of
+   inflate() and the crc32_combine() function.  gzjoin will not compile with
+   versions of zlib earlier than 1.2.3.
+ */
+
+#include <stdio.h>      /* fputs(), fprintf(), fwrite(), putc() */
+#include <stdlib.h>     /* exit(), malloc(), free() */
+#include <fcntl.h>      /* open() */
+#include <unistd.h>     /* close(), read(), lseek() */
+#include "zlib.h"
+    /* crc32(), crc32_combine(), inflateInit2(), inflate(), inflateEnd() */
+
+#define local static
+
+/* exit with an error (return a value to allow use in an expression) */
+local int bail(char *why1, char *why2)
+{
+    fprintf(stderr, "gzjoin error: %s%s, output incomplete\n", why1, why2);
+    exit(1);
+    return 0;
+}
+
+/* -- simple buffered file input with access to the buffer -- */
+
+#define CHUNK 32768         /* must be a power of two and fit in unsigned */
+
+/* bin buffered input file type */
+typedef struct {
+    char *name;             /* name of file for error messages */
+    int fd;                 /* file descriptor */
+    unsigned left;          /* bytes remaining at next */
+    unsigned char *next;    /* next byte to read */
+    unsigned char *buf;     /* allocated buffer of length CHUNK */
+} bin;
+
+/* close a buffered file and free allocated memory */
+local void bclose(bin *in)
+{
+    if (in != NULL) {
+        if (in->fd != -1)
+            close(in->fd);
+        if (in->buf != NULL)
+            free(in->buf);
+        free(in);
+    }
+}
+
+/* open a buffered file for input, return a pointer to type bin, or NULL on
+   failure */
+local bin *bopen(char *name)
+{
+    bin *in;
+
+    in = malloc(sizeof(bin));
+    if (in == NULL)
+        return NULL;
+    in->buf = malloc(CHUNK);
+    in->fd = open(name, O_RDONLY, 0);
+    if (in->buf == NULL || in->fd == -1) {
+        bclose(in);
+        return NULL;
+    }
+    in->left = 0;
+    in->next = in->buf;
+    in->name = name;
+    return in;
+}
+
+/* load buffer from file, return -1 on read error, 0 or 1 on success, with
+   1 indicating that end-of-file was reached */
+local int bload(bin *in)
+{
+    long len;
+
+    if (in == NULL)
+        return -1;
+    if (in->left != 0)
+        return 0;
+    in->next = in->buf;
+    do {
+        len = (long)read(in->fd, in->buf + in->left, CHUNK - in->left);
+        if (len < 0)
+            return -1;
+        in->left += (unsigned)len;
+    } while (len != 0 && in->left < CHUNK);
+    return len == 0 ? 1 : 0;
+}
+
+/* get a byte from the file, bail if end of file */
+#define bget(in) (in->left ? 0 : bload(in), \
+                  in->left ? (in->left--, *(in->next)++) : \
+                    bail("unexpected end of file on ", in->name))
+
+/* get a four-byte little-endian unsigned integer from file */
+local unsigned long bget4(bin *in)
+{
+    unsigned long val;
+
+    val = bget(in);
+    val += (unsigned long)(bget(in)) << 8;
+    val += (unsigned long)(bget(in)) << 16;
+    val += (unsigned long)(bget(in)) << 24;
+    return val;
+}
+
+/* skip bytes in file */
+local void bskip(bin *in, unsigned skip)
+{
+    /* check pointer */
+    if (in == NULL)
+        return;
+
+    /* easy case -- skip bytes in buffer */
+    if (skip <= in->left) {
+        in->left -= skip;
+        in->next += skip;
+        return;
+    }
+
+    /* skip what's in buffer, discard buffer contents */
+    skip -= in->left;
+    in->left = 0;
+
+    /* seek past multiples of CHUNK bytes */
+    if (skip > CHUNK) {
+        unsigned left;
+
+        left = skip & (CHUNK - 1);
+        if (left == 0) {
+            /* exact number of chunks: seek all the way minus one byte to check
+               for end-of-file with a read */
+            lseek(in->fd, skip - 1, SEEK_CUR);
+            if (read(in->fd, in->buf, 1) != 1)
+                bail("unexpected end of file on ", in->name);
+            return;
+        }
+
+        /* skip the integral chunks, update skip with remainder */
+        lseek(in->fd, skip - left, SEEK_CUR);
+        skip = left;
+    }
+
+    /* read more input and skip remainder */
+    bload(in);
+    if (skip > in->left)
+        bail("unexpected end of file on ", in->name);
+    in->left -= skip;
+    in->next += skip;
+}
+
+/* -- end of buffered input functions -- */
+
+/* skip the gzip header from file in */
+local void gzhead(bin *in)
+{
+    int flags;
+
+    /* verify gzip magic header and compression method */
+    if (bget(in) != 0x1f || bget(in) != 0x8b || bget(in) != 8)
+        bail(in->name, " is not a valid gzip file");
+
+    /* get and verify flags */
+    flags = bget(in);
+    if ((flags & 0xe0) != 0)
+        bail("unknown reserved bits set in ", in->name);
+
+    /* skip modification time, extra flags, and os */
+    bskip(in, 6);
+
+    /* skip extra field if present */
+    if (flags & 4) {
+        unsigned len;
+
+        len = bget(in);
+        len += (unsigned)(bget(in)) << 8;
+        bskip(in, len);
+    }
+
+    /* skip file name if present */
+    if (flags & 8)
+        while (bget(in) != 0)
+            ;
+
+    /* skip comment if present */
+    if (flags & 16)
+        while (bget(in) != 0)
+            ;
+
+    /* skip header crc if present */
+    if (flags & 2)
+        bskip(in, 2);
+}
+
+/* write a four-byte little-endian unsigned integer to out */
+local void put4(unsigned long val, FILE *out)
+{
+    putc(val & 0xff, out);
+    putc((val >> 8) & 0xff, out);
+    putc((val >> 16) & 0xff, out);
+    putc((val >> 24) & 0xff, out);
+}
+
+/* Load up zlib stream from buffered input, bail if end of file */
+local void zpull(z_streamp strm, bin *in)
+{
+    if (in->left == 0)
+        bload(in);
+    if (in->left == 0)
+        bail("unexpected end of file on ", in->name);
+    strm->avail_in = in->left;
+    strm->next_in = in->next;
+}
+
+/* Write header for gzip file to out and initialize trailer. */
+local void gzinit(unsigned long *crc, unsigned long *tot, FILE *out)
+{
+    fwrite("\x1f\x8b\x08\0\0\0\0\0\0\xff", 1, 10, out);
+    *crc = crc32(0L, Z_NULL, 0);
+    *tot = 0;
+}
+
+/* Copy the compressed data from name, zeroing the last block bit of the last
+   block if clr is true, and adding empty blocks as needed to get to a byte
+   boundary.  If clr is false, then the last block becomes the last block of
+   the output, and the gzip trailer is written.  crc and tot maintains the
+   crc and length (modulo 2^32) of the output for the trailer.  The resulting
+   gzip file is written to out.  gzinit() must be called before the first call
+   of gzcopy() to write the gzip header and to initialize crc and tot. */
+local void gzcopy(char *name, int clr, unsigned long *crc, unsigned long *tot,
+                  FILE *out)
+{
+    int ret;                /* return value from zlib functions */
+    int pos;                /* where the "last block" bit is in byte */
+    int last;               /* true if processing the last block */
+    bin *in;                /* buffered input file */
+    unsigned char *start;   /* start of compressed data in buffer */
+    unsigned char *junk;    /* buffer for uncompressed data -- discarded */
+    z_off_t len;            /* length of uncompressed data (support > 4 GB) */
+    z_stream strm;          /* zlib inflate stream */
+
+    /* open gzip file and skip header */
+    in = bopen(name);
+    if (in == NULL)
+        bail("could not open ", name);
+    gzhead(in);
+
+    /* allocate buffer for uncompressed data and initialize raw inflate
+       stream */
+    junk = malloc(CHUNK);
+    strm.zalloc = Z_NULL;
+    strm.zfree = Z_NULL;
+    strm.opaque = Z_NULL;
+    strm.avail_in = 0;
+    strm.next_in = Z_NULL;
+    ret = inflateInit2(&strm, -15);
+    if (junk == NULL || ret != Z_OK)
+        bail("out of memory", "");
+
+    /* inflate and copy compressed data, clear last-block bit if requested */
+    len = 0;
+    zpull(&strm, in);
+    start = strm.next_in;
+    last = start[0] & 1;
+    if (last && clr)
+        start[0] &= ~1;
+    strm.avail_out = 0;
+    for (;;) {
+        /* if input used and output done, write used input and get more */
+        if (strm.avail_in == 0 && strm.avail_out != 0) {
+            fwrite(start, 1, strm.next_in - start, out);
+            start = in->buf;
+            in->left = 0;
+            zpull(&strm, in);
+        }
+
+        /* decompress -- return early when end-of-block reached */
+        strm.avail_out = CHUNK;
+        strm.next_out = junk;
+        ret = inflate(&strm, Z_BLOCK);
+        switch (ret) {
+        case Z_MEM_ERROR:
+            bail("out of memory", "");
+        case Z_DATA_ERROR:
+            bail("invalid compressed data in ", in->name);
+        }
+
+        /* update length of uncompressed data */
+        len += CHUNK - strm.avail_out;
+
+        /* check for block boundary (only get this when block copied out) */
+        if (strm.data_type & 128) {
+            /* if that was the last block, then done */
+            if (last)
+                break;
+
+            /* number of unused bits in last byte */
+            pos = strm.data_type & 7;
+
+            /* find the next last-block bit */
+            if (pos != 0) {
+                /* next last-block bit is in last used byte */
+                pos = 0x100 >> pos;
+                last = strm.next_in[-1] & pos;
+                if (last && clr)
+                    strm.next_in[-1] &= ~pos;
+            }
+            else {
+                /* next last-block bit is in next unused byte */
+                if (strm.avail_in == 0) {
+                    /* don't have that byte yet -- get it */
+                    fwrite(start, 1, strm.next_in - start, out);
+                    start = in->buf;
+                    in->left = 0;
+                    zpull(&strm, in);
+                }
+                last = strm.next_in[0] & 1;
+                if (last && clr)
+                    strm.next_in[0] &= ~1;
+            }
+        }
+    }
+
+    /* update buffer with unused input */
+    in->left = strm.avail_in;
+    in->next = strm.next_in;
+
+    /* copy used input, write empty blocks to get to byte boundary */
+    pos = strm.data_type & 7;
+    fwrite(start, 1, in->next - start - 1, out);
+    last = in->next[-1];
+    if (pos == 0 || !clr)
+        /* already at byte boundary, or last file: write last byte */
+        putc(last, out);
+    else {
+        /* append empty blocks to last byte */
+        last &= ((0x100 >> pos) - 1);       /* assure unused bits are zero */
+        if (pos & 1) {
+            /* odd -- append an empty stored block */
+            putc(last, out);
+            if (pos == 1)
+                putc(0, out);               /* two more bits in block header */
+            fwrite("\0\0\xff\xff", 1, 4, out);
+        }
+        else {
+            /* even -- append 1, 2, or 3 empty fixed blocks */
+            switch (pos) {
+            case 6:
+                putc(last | 8, out);
+                last = 0;
+            case 4:
+                putc(last | 0x20, out);
+                last = 0;
+            case 2:
+                putc(last | 0x80, out);
+                putc(0, out);
+            }
+        }
+    }
+
+    /* update crc and tot */
+    *crc = crc32_combine(*crc, bget4(in), len);
+    *tot += (unsigned long)len;
+
+    /* clean up */
+    inflateEnd(&strm);
+    free(junk);
+    bclose(in);
+
+    /* write trailer if this is the last gzip file */
+    if (!clr) {
+        put4(*crc, out);
+        put4(*tot, out);
+    }
+}
+
+/* join the gzip files on the command line, write result to stdout */
+int main(int argc, char **argv)
+{
+    unsigned long crc, tot;     /* running crc and total uncompressed length */
+
+    /* skip command name */
+    argc--;
+    argv++;
+
+    /* show usage if no arguments */
+    if (argc == 0) {
+        fputs("gzjoin usage: gzjoin f1.gz [f2.gz [f3.gz ...]] > fjoin.gz\n",
+              stderr);
+        return 0;
+    }
+
+    /* join gzip files on command line and write to stdout */
+    gzinit(&crc, &tot, stdout);
+    while (argc--)
+        gzcopy(*argv++, argc, &crc, &tot, stdout);
+
+    /* done */
+    return 0;
+}
diff --git a/updater/zlib123/examples/gzlog.c b/updater/zlib123/examples/gzlog.c
new file mode 100644
index 0000000..a5d815f
--- /dev/null
+++ b/updater/zlib123/examples/gzlog.c
@@ -0,0 +1,413 @@
+/*
+ * gzlog.c
+ * Copyright (C) 2004 Mark Adler
+ * For conditions of distribution and use, see copyright notice in gzlog.h
+ * version 1.0, 26 Nov 2004
+ *
+ */
+
+#include <string.h>             /* memcmp() */
+#include <stdlib.h>             /* malloc(), free(), NULL */
+#include <sys/types.h>          /* size_t, off_t */
+#include <unistd.h>             /* read(), close(), sleep(), ftruncate(), */
+                                /* lseek() */
+#include <fcntl.h>              /* open() */
+#include <sys/file.h>           /* flock() */
+#include "zlib.h"               /* deflateInit2(), deflate(), deflateEnd() */
+
+#include "gzlog.h"              /* interface */
+#define local static
+
+/* log object structure */
+typedef struct {
+    int id;                 /* object identifier */
+    int fd;                 /* log file descriptor */
+    off_t extra;            /* offset of extra "ap" subfield */
+    off_t mark_off;         /* offset of marked data */
+    off_t last_off;         /* offset of last block */
+    unsigned long crc;      /* uncompressed crc */
+    unsigned long len;      /* uncompressed length (modulo 2^32) */
+    unsigned stored;        /* length of current stored block */
+} gz_log;
+
+#define GZLOGID 19334       /* gz_log object identifier */
+
+#define LOCK_RETRY 1            /* retry lock once a second */
+#define LOCK_PATIENCE 1200      /* try about twenty minutes before forcing */
+
+/* acquire a lock on a file */
+local int lock(int fd)
+{
+    int patience;
+
+    /* try to lock every LOCK_RETRY seconds for LOCK_PATIENCE seconds */
+    patience = LOCK_PATIENCE;
+    do {
+        if (flock(fd, LOCK_EX + LOCK_NB) == 0)
+            return 0;
+        (void)sleep(LOCK_RETRY);
+        patience -= LOCK_RETRY;
+    } while (patience > 0);
+
+    /* we've run out of patience -- give up */
+    return -1;
+}
+
+/* release lock */
+local void unlock(int fd)
+{
+    (void)flock(fd, LOCK_UN);
+}
+
+/* release a log object */
+local void log_clean(gz_log *log)
+{
+    unlock(log->fd);
+    (void)close(log->fd);
+    free(log);
+}
+
+/* read an unsigned long from a byte buffer little-endian */
+local unsigned long make_ulg(unsigned char *buf)
+{
+    int n;
+    unsigned long val;
+
+    val = (unsigned long)(*buf++);
+    for (n = 8; n < 32; n += 8)
+        val += (unsigned long)(*buf++) << n;
+    return val;
+}
+
+/* read an off_t from a byte buffer little-endian */
+local off_t make_off(unsigned char *buf)
+{
+    int n;
+    off_t val;
+
+    val = (off_t)(*buf++);
+    for (n = 8; n < 64; n += 8)
+        val += (off_t)(*buf++) << n;
+    return val;
+}
+
+/* write an unsigned long little-endian to byte buffer */
+local void dice_ulg(unsigned long val, unsigned char *buf)
+{
+    int n;
+
+    for (n = 0; n < 4; n++) {
+        *buf++ = val & 0xff;
+        val >>= 8;
+    }
+}
+
+/* write an off_t little-endian to byte buffer */
+local void dice_off(off_t val, unsigned char *buf)
+{
+    int n;
+
+    for (n = 0; n < 8; n++) {
+        *buf++ = val & 0xff;
+        val >>= 8;
+    }
+}
+
+/* initial, empty gzip file for appending */
+local char empty_gz[] = {
+    0x1f, 0x8b,                 /* magic gzip id */
+    8,                          /* compression method is deflate */
+    4,                          /* there is an extra field */
+    0, 0, 0, 0,                 /* no modification time provided */
+    0, 0xff,                    /* no extra flags, no OS */
+    20, 0, 'a', 'p', 16, 0,     /* extra field with "ap" subfield */
+    32, 0, 0, 0, 0, 0, 0, 0,    /* offset of uncompressed data */
+    32, 0, 0, 0, 0, 0, 0, 0,    /* offset of last block */
+    1, 0, 0, 0xff, 0xff,        /* empty stored block (last) */
+    0, 0, 0, 0,                 /* crc */
+    0, 0, 0, 0                  /* uncompressed length */
+};
+
+/* initialize a log object with locking */
+void *gzlog_open(char *path)
+{
+    unsigned xlen;
+    unsigned char temp[20];
+    unsigned sub_len;
+    int good;
+    gz_log *log;
+
+    /* allocate log structure */
+    log = malloc(sizeof(gz_log));
+    if (log == NULL)
+        return NULL;
+    log->id = GZLOGID;
+
+    /* open file, creating it if necessary, and locking it */
+    log->fd = open(path, O_RDWR | O_CREAT, 0600);
+    if (log->fd < 0) {
+        free(log);
+        return NULL;
+    }
+    if (lock(log->fd)) {
+        close(log->fd);
+        free(log);
+        return NULL;
+    }
+
+    /* if file is empty, write new gzip stream */
+    if (lseek(log->fd, 0, SEEK_END) == 0) {
+        if (write(log->fd, empty_gz, sizeof(empty_gz)) != sizeof(empty_gz)) {
+            log_clean(log);
+            return NULL;
+        }
+    }
+
+    /* check gzip header */
+    (void)lseek(log->fd, 0, SEEK_SET);
+    if (read(log->fd, temp, 12) != 12 || temp[0] != 0x1f ||
+        temp[1] != 0x8b || temp[2] != 8 || (temp[3] & 4) == 0) {
+        log_clean(log);
+        return NULL;
+    }
+
+    /* process extra field to find "ap" sub-field */
+    xlen = temp[10] + (temp[11] << 8);
+    good = 0;
+    while (xlen) {
+        if (xlen < 4 || read(log->fd, temp, 4) != 4)
+            break;
+        sub_len = temp[2];
+        sub_len += temp[3] << 8;
+        xlen -= 4;
+        if (memcmp(temp, "ap", 2) == 0 && sub_len == 16) {
+            good = 1;
+            break;
+        }
+        if (xlen < sub_len)
+            break;
+        (void)lseek(log->fd, sub_len, SEEK_CUR);
+        xlen -= sub_len;
+    }
+    if (!good) {
+        log_clean(log);
+        return NULL;
+    }
+
+    /* read in "ap" sub-field */
+    log->extra = lseek(log->fd, 0, SEEK_CUR);
+    if (read(log->fd, temp, 16) != 16) {
+        log_clean(log);
+        return NULL;
+    }
+    log->mark_off = make_off(temp);
+    log->last_off = make_off(temp + 8);
+
+    /* get crc, length of gzip file */
+    (void)lseek(log->fd, log->last_off, SEEK_SET);
+    if (read(log->fd, temp, 13) != 13 ||
+        memcmp(temp, "\001\000\000\377\377", 5) != 0) {
+        log_clean(log);
+        return NULL;
+    }
+    log->crc = make_ulg(temp + 5);
+    log->len = make_ulg(temp + 9);
+
+    /* set up to write over empty last block */
+    (void)lseek(log->fd, log->last_off + 5, SEEK_SET);
+    log->stored = 0;
+    return (void *)log;
+}
+
+/* maximum amount to put in a stored block before starting a new one */
+#define MAX_BLOCK 16384
+
+/* write a block to a log object */
+int gzlog_write(void *obj, char *data, size_t len)
+{
+    size_t some;
+    unsigned char temp[5];
+    gz_log *log;
+
+    /* check object */
+    log = (gz_log *)obj;
+    if (log == NULL || log->id != GZLOGID)
+        return 1;
+
+    /* write stored blocks until all of the input is written */
+    do {
+        some = MAX_BLOCK - log->stored;
+        if (some > len)
+            some = len;
+        if (write(log->fd, data, some) != some)
+            return 1;
+        log->crc = crc32(log->crc, data, some);
+        log->len += some;
+        len -= some;
+        data += some;
+        log->stored += some;
+
+        /* if the stored block is full, end it and start another */
+        if (log->stored == MAX_BLOCK) {
+            (void)lseek(log->fd, log->last_off, SEEK_SET);
+            temp[0] = 0;
+            dice_ulg(log->stored + ((unsigned long)(~log->stored) << 16),
+                     temp + 1);
+            if (write(log->fd, temp, 5) != 5)
+                return 1;
+            log->last_off = lseek(log->fd, log->stored, SEEK_CUR);
+            (void)lseek(log->fd, 5, SEEK_CUR);
+            log->stored = 0;
+        }
+    } while (len);
+    return 0;
+}
+
+/* recompress the remaining stored deflate data in place */
+local int recomp(gz_log *log)
+{
+    z_stream strm;
+    size_t len, max;
+    unsigned char *in;
+    unsigned char *out;
+    unsigned char temp[16];
+
+    /* allocate space and read it all in (it's around 1 MB) */
+    len = log->last_off - log->mark_off;
+    max = len + (len >> 12) + (len >> 14) + 11;
+    out = malloc(max);
+    if (out == NULL)
+        return 1;
+    in = malloc(len);
+    if (in == NULL) {
+        free(out);
+        return 1;
+    }
+    (void)lseek(log->fd, log->mark_off, SEEK_SET);
+    if (read(log->fd, in, len) != len) {
+        free(in);
+        free(out);
+        return 1;
+    }
+
+    /* recompress in memory, decoding stored data as we go */
+    /* note: this assumes that unsigned is four bytes or more */
+    /*       consider not making that assumption */
+    strm.zalloc = Z_NULL;
+    strm.zfree = Z_NULL;
+    strm.opaque = Z_NULL;
+    if (deflateInit2(&strm, Z_BEST_COMPRESSION, Z_DEFLATED, -15, 8,
+        Z_DEFAULT_STRATEGY) != Z_OK) {
+        free(in);
+        free(out);
+        return 1;
+    }
+    strm.next_in = in;
+    strm.avail_out = max;
+    strm.next_out = out;
+    while (len >= 5) {
+        if (strm.next_in[0] != 0)
+            break;
+        strm.avail_in = strm.next_in[1] + (strm.next_in[2] << 8);
+        strm.next_in += 5;
+        len -= 5;
+        if (strm.avail_in != 0) {
+            if (len < strm.avail_in)
+                break;
+            len -= strm.avail_in;
+            (void)deflate(&strm, Z_NO_FLUSH);
+            if (strm.avail_in != 0 || strm.avail_out == 0)
+                break;
+        }
+    }
+    (void)deflate(&strm, Z_SYNC_FLUSH);
+    (void)deflateEnd(&strm);
+    free(in);
+    if (len != 0 || strm.avail_out == 0) {
+        free(out);
+        return 1;
+    }
+
+    /* overwrite stored data with compressed data */
+    (void)lseek(log->fd, log->mark_off, SEEK_SET);
+    len = max - strm.avail_out;
+    if (write(log->fd, out, len) != len) {
+        free(out);
+        return 1;
+    }
+    free(out);
+
+    /* write last empty block, crc, and length */
+    log->mark_off = log->last_off = lseek(log->fd, 0, SEEK_CUR);
+    temp[0] = 1;
+    dice_ulg(0xffffL << 16, temp + 1);
+    dice_ulg(log->crc, temp + 5);
+    dice_ulg(log->len, temp + 9);
+    if (write(log->fd, temp, 13) != 13)
+        return 1;
+
+    /* truncate file to discard remaining stored data and old trailer */
+    ftruncate(log->fd, lseek(log->fd, 0, SEEK_CUR));
+
+    /* update extra field to point to new last empty block */
+    (void)lseek(log->fd, log->extra, SEEK_SET);
+    dice_off(log->mark_off, temp);
+    dice_off(log->last_off, temp + 8);
+    if (write(log->fd, temp, 16) != 16)
+        return 1;
+    return 0;
+}
+
+/* maximum accumulation of stored blocks before compressing */
+#define MAX_STORED 1048576
+
+/* close log object */
+int gzlog_close(void *obj)
+{
+    unsigned char temp[8];
+    gz_log *log;
+
+    /* check object */
+    log = (gz_log *)obj;
+    if (log == NULL || log->id != GZLOGID)
+        return 1;
+
+    /* go to start of most recent block being written */
+    (void)lseek(log->fd, log->last_off, SEEK_SET);
+
+    /* if some stuff was put there, update block */
+    if (log->stored) {
+        temp[0] = 0;
+        dice_ulg(log->stored + ((unsigned long)(~log->stored) << 16),
+                 temp + 1);
+        if (write(log->fd, temp, 5) != 5)
+            return 1;
+        log->last_off = lseek(log->fd, log->stored, SEEK_CUR);
+    }
+
+    /* write last block (empty) */
+    if (write(log->fd, "\001\000\000\377\377", 5) != 5)
+        return 1;
+
+    /* write updated crc and uncompressed length */
+    dice_ulg(log->crc, temp);
+    dice_ulg(log->len, temp + 4);
+    if (write(log->fd, temp, 8) != 8)
+        return 1;
+
+    /* put offset of that last block in gzip extra block */
+    (void)lseek(log->fd, log->extra + 8, SEEK_SET);
+    dice_off(log->last_off, temp);
+    if (write(log->fd, temp, 8) != 8)
+        return 1;
+
+    /* if more than 1 MB stored, then time to compress it */
+    if (log->last_off - log->mark_off > MAX_STORED) {
+        if (recomp(log))
+            return 1;
+    }
+
+    /* unlock and close file */
+    log_clean(log);
+    return 0;
+}
diff --git a/updater/zlib123/examples/gzlog.h b/updater/zlib123/examples/gzlog.h
new file mode 100644
index 0000000..822f887
--- /dev/null
+++ b/updater/zlib123/examples/gzlog.h
@@ -0,0 +1,58 @@
+/* gzlog.h
+  Copyright (C) 2004 Mark Adler, all rights reserved
+  version 1.0, 26 Nov 2004
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the author be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Mark Adler    madler@alumni.caltech.edu
+ */
+
+/*
+   The gzlog object allows writing short messages to a gzipped log file,
+   opening the log file locked for small bursts, and then closing it.  The log
+   object works by appending stored data to the gzip file until 1 MB has been
+   accumulated.  At that time, the stored data is compressed, and replaces the
+   uncompressed data in the file.  The log file is truncated to its new size at
+   that time.  After closing, the log file is always valid gzip file that can
+   decompressed to recover what was written.
+
+   A gzip header "extra" field contains two file offsets for appending.  The
+   first points to just after the last compressed data.  The second points to
+   the last stored block in the deflate stream, which is empty.  All of the
+   data between those pointers is uncompressed.
+ */
+
+/* Open a gzlog object, creating the log file if it does not exist.  Return
+   NULL on error.  Note that gzlog_open() could take a long time to return if
+   there is difficulty in locking the file. */
+void *gzlog_open(char *path);
+
+/* Write to a gzlog object.  Return non-zero on error.  This function will
+   simply write data to the file uncompressed.  Compression of the data
+   will not occur until gzlog_close() is called.  It is expected that
+   gzlog_write() is used for a short message, and then gzlog_close() is
+   called.  If a large amount of data is to be written, then the application
+   should write no more than 1 MB at a time with gzlog_write() before
+   calling gzlog_close() and then gzlog_open() again. */
+int gzlog_write(void *log, char *data, size_t len);
+
+/* Close a gzlog object.  Return non-zero on error.  The log file is locked
+   until this function is called.  This function will compress stored data
+   at the end of the gzip file if at least 1 MB has been accumulated.  Note
+   that the file will not be a valid gzip file until this function completes.
+ */
+int gzlog_close(void *log);
diff --git a/updater/zlib123/examples/zlib_how.html b/updater/zlib123/examples/zlib_how.html
new file mode 100644
index 0000000..a83ff77
--- /dev/null
+++ b/updater/zlib123/examples/zlib_how.html
@@ -0,0 +1,523 @@
+<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN"
+  "http://www.w3.org/TR/REC-html40/loose.dtd">
+<html>
+<head>
+<meta http-equiv="Content-Type" content="text/html; charset=ISO-8859-1">
+<title>zlib Usage Example</title>
+<!--  Copyright (c) 2004 Mark Adler.  -->
+</head>
+<body bgcolor="#FFFFFF" text="#000000" link="#0000FF" vlink="#00A000">
+<h2 align="center"> zlib Usage Example </h2>
+We often get questions about how the <tt>deflate()</tt> and <tt>inflate()</tt> functions should be used.
+Users wonder when they should provide more input, when they should use more output,
+what to do with a <tt>Z_BUF_ERROR</tt>, how to make sure the process terminates properly, and
+so on.  So for those who have read <tt>zlib.h</tt> (a few times), and
+would like further edification, below is an annotated example in C of simple routines to compress and decompress
+from an input file to an output file using <tt>deflate()</tt> and <tt>inflate()</tt> respectively.  The
+annotations are interspersed between lines of the code.  So please read between the lines.
+We hope this helps explain some of the intricacies of <em>zlib</em>.
+<p>
+Without further adieu, here is the program <a href="zpipe.c"><tt>zpipe.c</tt></a>:
+<pre><b>
+/* zpipe.c: example of proper use of zlib's inflate() and deflate()
+   Not copyrighted -- provided to the public domain
+   Version 1.2  9 November 2004  Mark Adler */
+
+/* Version history:
+   1.0  30 Oct 2004  First version
+   1.1   8 Nov 2004  Add void casting for unused return values
+                     Use switch statement for inflate() return values
+   1.2   9 Nov 2004  Add assertions to document zlib guarantees
+ */
+</b></pre><!-- -->
+We now include the header files for the required definitions.  From
+<tt>stdio.h</tt> we use <tt>fopen()</tt>, <tt>fread()</tt>, <tt>fwrite()</tt>,
+<tt>feof()</tt>, <tt>ferror()</tt>, and <tt>fclose()</tt> for file i/o, and
+<tt>fputs()</tt> for error messages.  From <tt>string.h</tt> we use
+<tt>strcmp()</tt> for command line argument processing.
+From <tt>assert.h</tt> we use the <tt>assert()</tt> macro.
+From <tt>zlib.h</tt>
+we use the basic compression functions <tt>deflateInit()</tt>,
+<tt>deflate()</tt>, and <tt>deflateEnd()</tt>, and the basic decompression
+functions <tt>inflateInit()</tt>, <tt>inflate()</tt>, and
+<tt>inflateEnd()</tt>.
+<pre><b>
+#include &lt;stdio.h&gt;
+#include &lt;string.h&gt;
+#include &lt;assert.h&gt;
+#include "zlib.h"
+</b></pre><!-- -->
+<tt>CHUNK</tt> is simply the buffer size for feeding data to and pulling data
+from the <em>zlib</em> routines.  Larger buffer sizes would be more efficient,
+especially for <tt>inflate()</tt>.  If the memory is available, buffers sizes
+on the order of 128K or 256K bytes should be used.
+<pre><b>
+#define CHUNK 16384
+</b></pre><!-- -->
+The <tt>def()</tt> routine compresses data from an input file to an output file.  The output data
+will be in the <em>zlib</em> format, which is different from the <em>gzip</em> or <em>zip</em>
+formats.  The <em>zlib</em> format has a very small header of only two bytes to identify it as
+a <em>zlib</em> stream and to provide decoding information, and a four-byte trailer with a fast
+check value to verify the integrity of the uncompressed data after decoding.
+<pre><b>
+/* Compress from file source to file dest until EOF on source.
+   def() returns Z_OK on success, Z_MEM_ERROR if memory could not be
+   allocated for processing, Z_STREAM_ERROR if an invalid compression
+   level is supplied, Z_VERSION_ERROR if the version of zlib.h and the
+   version of the library linked do not match, or Z_ERRNO if there is
+   an error reading or writing the files. */
+int def(FILE *source, FILE *dest, int level)
+{
+</b></pre>
+Here are the local variables for <tt>def()</tt>.  <tt>ret</tt> will be used for <em>zlib</em>
+return codes.  <tt>flush</tt> will keep track of the current flushing state for <tt>deflate()</tt>,
+which is either no flushing, or flush to completion after the end of the input file is reached.
+<tt>have</tt> is the amount of data returned from <tt>deflate()</tt>.  The <tt>strm</tt> structure
+is used to pass information to and from the <em>zlib</em> routines, and to maintain the
+<tt>deflate()</tt> state.  <tt>in</tt> and <tt>out</tt> are the input and output buffers for
+<tt>deflate()</tt>.
+<pre><b>
+    int ret, flush;
+    unsigned have;
+    z_stream strm;
+    char in[CHUNK];
+    char out[CHUNK];
+</b></pre><!-- -->
+The first thing we do is to initialize the <em>zlib</em> state for compression using
+<tt>deflateInit()</tt>.  This must be done before the first use of <tt>deflate()</tt>.
+The <tt>zalloc</tt>, <tt>zfree</tt>, and <tt>opaque</tt> fields in the <tt>strm</tt>
+structure must be initialized before calling <tt>deflateInit()</tt>.  Here they are
+set to the <em>zlib</em> constant <tt>Z_NULL</tt> to request that <em>zlib</em> use
+the default memory allocation routines.  An application may also choose to provide
+custom memory allocation routines here.  <tt>deflateInit()</tt> will allocate on the
+order of 256K bytes for the internal state.
+(See <a href="zlib_tech.html"><em>zlib Technical Details</em></a>.)
+<p>
+<tt>deflateInit()</tt> is called with a pointer to the structure to be initialized and
+the compression level, which is an integer in the range of -1 to 9.  Lower compression
+levels result in faster execution, but less compression.  Higher levels result in
+greater compression, but slower execution.  The <em>zlib</em> constant Z_DEFAULT_COMPRESSION,
+equal to -1,
+provides a good compromise between compression and speed and is equivalent to level 6.
+Level 0 actually does no compression at all, and in fact expands the data slightly to produce
+the <em>zlib</em> format (it is not a byte-for-byte copy of the input).
+More advanced applications of <em>zlib</em>
+may use <tt>deflateInit2()</tt> here instead.  Such an application may want to reduce how
+much memory will be used, at some price in compression.  Or it may need to request a
+<em>gzip</em> header and trailer instead of a <em>zlib</em> header and trailer, or raw
+encoding with no header or trailer at all.
+<p>
+We must check the return value of <tt>deflateInit()</tt> against the <em>zlib</em> constant
+<tt>Z_OK</tt> to make sure that it was able to
+allocate memory for the internal state, and that the provided arguments were valid.
+<tt>deflateInit()</tt> will also check that the version of <em>zlib</em> that the <tt>zlib.h</tt>
+file came from matches the version of <em>zlib</em> actually linked with the program.  This
+is especially important for environments in which <em>zlib</em> is a shared library.
+<p>
+Note that an application can initialize multiple, independent <em>zlib</em> streams, which can
+operate in parallel.  The state information maintained in the structure allows the <em>zlib</em>
+routines to be reentrant.
+<pre><b>
+    /* allocate deflate state */
+    strm.zalloc = Z_NULL;
+    strm.zfree = Z_NULL;
+    strm.opaque = Z_NULL;
+    ret = deflateInit(&amp;strm, level);
+    if (ret != Z_OK)
+        return ret;
+</b></pre><!-- -->
+With the pleasantries out of the way, now we can get down to business.  The outer <tt>do</tt>-loop
+reads all of the input file and exits at the bottom of the loop once end-of-file is reached.
+This loop contains the only call of <tt>deflate()</tt>.  So we must make sure that all of the
+input data has been processed and that all of the output data has been generated and consumed
+before we fall out of the loop at the bottom.
+<pre><b>
+    /* compress until end of file */
+    do {
+</b></pre>
+We start off by reading data from the input file.  The number of bytes read is put directly
+into <tt>avail_in</tt>, and a pointer to those bytes is put into <tt>next_in</tt>.  We also
+check to see if end-of-file on the input has been reached.  If we are at the end of file, then <tt>flush</tt> is set to the
+<em>zlib</em> constant <tt>Z_FINISH</tt>, which is later passed to <tt>deflate()</tt> to
+indicate that this is the last chunk of input data to compress.  We need to use <tt>feof()</tt>
+to check for end-of-file as opposed to seeing if fewer than <tt>CHUNK</tt> bytes have been read.  The
+reason is that if the input file length is an exact multiple of <tt>CHUNK</tt>, we will miss
+the fact that we got to the end-of-file, and not know to tell <tt>deflate()</tt> to finish
+up the compressed stream.  If we are not yet at the end of the input, then the <em>zlib</em>
+constant <tt>Z_NO_FLUSH</tt> will be passed to <tt>deflate</tt> to indicate that we are still
+in the middle of the uncompressed data.
+<p>
+If there is an error in reading from the input file, the process is aborted with
+<tt>deflateEnd()</tt> being called to free the allocated <em>zlib</em> state before returning
+the error.  We wouldn't want a memory leak, now would we?  <tt>deflateEnd()</tt> can be called
+at any time after the state has been initialized.  Once that's done, <tt>deflateInit()</tt> (or
+<tt>deflateInit2()</tt>) would have to be called to start a new compression process.  There is
+no point here in checking the <tt>deflateEnd()</tt> return code.  The deallocation can't fail.
+<pre><b>
+        strm.avail_in = fread(in, 1, CHUNK, source);
+        if (ferror(source)) {
+            (void)deflateEnd(&amp;strm);
+            return Z_ERRNO;
+        }
+        flush = feof(source) ? Z_FINISH : Z_NO_FLUSH;
+        strm.next_in = in;
+</b></pre><!-- -->
+The inner <tt>do</tt>-loop passes our chunk of input data to <tt>deflate()</tt>, and then
+keeps calling <tt>deflate()</tt> until it is done producing output.  Once there is no more
+new output, <tt>deflate()</tt> is guaranteed to have consumed all of the input, i.e.,
+<tt>avail_in</tt> will be zero.
+<pre><b>
+        /* run deflate() on input until output buffer not full, finish
+           compression if all of source has been read in */
+        do {
+</b></pre>
+Output space is provided to <tt>deflate()</tt> by setting <tt>avail_out</tt> to the number
+of available output bytes and <tt>next_out</tt> to a pointer to that space.
+<pre><b>
+            strm.avail_out = CHUNK;
+            strm.next_out = out;
+</b></pre>
+Now we call the compression engine itself, <tt>deflate()</tt>.  It takes as many of the
+<tt>avail_in</tt> bytes at <tt>next_in</tt> as it can process, and writes as many as
+<tt>avail_out</tt> bytes to <tt>next_out</tt>.  Those counters and pointers are then
+updated past the input data consumed and the output data written.  It is the amount of
+output space available that may limit how much input is consumed.
+Hence the inner loop to make sure that
+all of the input is consumed by providing more output space each time.  Since <tt>avail_in</tt>
+and <tt>next_in</tt> are updated by <tt>deflate()</tt>, we don't have to mess with those
+between <tt>deflate()</tt> calls until it's all used up.
+<p>
+The parameters to <tt>deflate()</tt> are a pointer to the <tt>strm</tt> structure containing
+the input and output information and the internal compression engine state, and a parameter
+indicating whether and how to flush data to the output.  Normally <tt>deflate</tt> will consume
+several K bytes of input data before producing any output (except for the header), in order
+to accumulate statistics on the data for optimum compression.  It will then put out a burst of
+compressed data, and proceed to consume more input before the next burst.  Eventually,
+<tt>deflate()</tt>
+must be told to terminate the stream, complete the compression with provided input data, and
+write out the trailer check value.  <tt>deflate()</tt> will continue to compress normally as long
+as the flush parameter is <tt>Z_NO_FLUSH</tt>.  Once the <tt>Z_FINISH</tt> parameter is provided,
+<tt>deflate()</tt> will begin to complete the compressed output stream.  However depending on how
+much output space is provided, <tt>deflate()</tt> may have to be called several times until it
+has provided the complete compressed stream, even after it has consumed all of the input.  The flush
+parameter must continue to be <tt>Z_FINISH</tt> for those subsequent calls.
+<p>
+There are other values of the flush parameter that are used in more advanced applications.  You can
+force <tt>deflate()</tt> to produce a burst of output that encodes all of the input data provided
+so far, even if it wouldn't have otherwise, for example to control data latency on a link with
+compressed data.  You can also ask that <tt>deflate()</tt> do that as well as erase any history up to
+that point so that what follows can be decompressed independently, for example for random access
+applications.  Both requests will degrade compression by an amount depending on how often such
+requests are made.
+<p>
+<tt>deflate()</tt> has a return value that can indicate errors, yet we do not check it here.  Why
+not?  Well, it turns out that <tt>deflate()</tt> can do no wrong here.  Let's go through
+<tt>deflate()</tt>'s return values and dispense with them one by one.  The possible values are
+<tt>Z_OK</tt>, <tt>Z_STREAM_END</tt>, <tt>Z_STREAM_ERROR</tt>, or <tt>Z_BUF_ERROR</tt>.  <tt>Z_OK</tt>
+is, well, ok.  <tt>Z_STREAM_END</tt> is also ok and will be returned for the last call of
+<tt>deflate()</tt>.  This is already guaranteed by calling <tt>deflate()</tt> with <tt>Z_FINISH</tt>
+until it has no more output.  <tt>Z_STREAM_ERROR</tt> is only possible if the stream is not
+initialized properly, but we did initialize it properly.  There is no harm in checking for
+<tt>Z_STREAM_ERROR</tt> here, for example to check for the possibility that some
+other part of the application inadvertently clobbered the memory containing the <em>zlib</em> state.
+<tt>Z_BUF_ERROR</tt> will be explained further below, but
+suffice it to say that this is simply an indication that <tt>deflate()</tt> could not consume
+more input or produce more output.  <tt>deflate()</tt> can be called again with more output space
+or more available input, which it will be in this code.
+<pre><b>
+            ret = deflate(&amp;strm, flush);    /* no bad return value */
+            assert(ret != Z_STREAM_ERROR);  /* state not clobbered */
+</b></pre>
+Now we compute how much output <tt>deflate()</tt> provided on the last call, which is the
+difference between how much space was provided before the call, and how much output space
+is still available after the call.  Then that data, if any, is written to the output file.
+We can then reuse the output buffer for the next call of <tt>deflate()</tt>.  Again if there
+is a file i/o error, we call <tt>deflateEnd()</tt> before returning to avoid a memory leak.
+<pre><b>
+            have = CHUNK - strm.avail_out;
+            if (fwrite(out, 1, have, dest) != have || ferror(dest)) {
+                (void)deflateEnd(&amp;strm);
+                return Z_ERRNO;
+            }
+</b></pre>
+The inner <tt>do</tt>-loop is repeated until the last <tt>deflate()</tt> call fails to fill the
+provided output buffer.  Then we know that <tt>deflate()</tt> has done as much as it can with
+the provided input, and that all of that input has been consumed.  We can then fall out of this
+loop and reuse the input buffer.
+<p>
+The way we tell that <tt>deflate()</tt> has no more output is by seeing that it did not fill
+the output buffer, leaving <tt>avail_out</tt> greater than zero.  However suppose that
+<tt>deflate()</tt> has no more output, but just so happened to exactly fill the output buffer!
+<tt>avail_out</tt> is zero, and we can't tell that <tt>deflate()</tt> has done all it can.
+As far as we know, <tt>deflate()</tt>
+has more output for us.  So we call it again.  But now <tt>deflate()</tt> produces no output
+at all, and <tt>avail_out</tt> remains unchanged as <tt>CHUNK</tt>.  That <tt>deflate()</tt> call
+wasn't able to do anything, either consume input or produce output, and so it returns
+<tt>Z_BUF_ERROR</tt>.  (See, I told you I'd cover this later.)  However this is not a problem at
+all.  Now we finally have the desired indication that <tt>deflate()</tt> is really done,
+and so we drop out of the inner loop to provide more input to <tt>deflate()</tt>.
+<p>
+With <tt>flush</tt> set to <tt>Z_FINISH</tt>, this final set of <tt>deflate()</tt> calls will
+complete the output stream.  Once that is done, subsequent calls of <tt>deflate()</tt> would return
+<tt>Z_STREAM_ERROR</tt> if the flush parameter is not <tt>Z_FINISH</tt>, and do no more processing
+until the state is reinitialized.
+<p>
+Some applications of <em>zlib</em> have two loops that call <tt>deflate()</tt>
+instead of the single inner loop we have here.  The first loop would call
+without flushing and feed all of the data to <tt>deflate()</tt>.  The second loop would call
+<tt>deflate()</tt> with no more
+data and the <tt>Z_FINISH</tt> parameter to complete the process.  As you can see from this
+example, that can be avoided by simply keeping track of the current flush state.
+<pre><b>
+        } while (strm.avail_out == 0);
+        assert(strm.avail_in == 0);     /* all input will be used */
+</b></pre><!-- -->
+Now we check to see if we have already processed all of the input file.  That information was
+saved in the <tt>flush</tt> variable, so we see if that was set to <tt>Z_FINISH</tt>.  If so,
+then we're done and we fall out of the outer loop.  We're guaranteed to get <tt>Z_STREAM_END</tt>
+from the last <tt>deflate()</tt> call, since we ran it until the last chunk of input was
+consumed and all of the output was generated.
+<pre><b>
+        /* done when last data in file processed */
+    } while (flush != Z_FINISH);
+    assert(ret == Z_STREAM_END);        /* stream will be complete */
+</b></pre><!-- -->
+The process is complete, but we still need to deallocate the state to avoid a memory leak
+(or rather more like a memory hemorrhage if you didn't do this).  Then
+finally we can return with a happy return value.
+<pre><b>
+    /* clean up and return */
+    (void)deflateEnd(&amp;strm);
+    return Z_OK;
+}
+</b></pre><!-- -->
+Now we do the same thing for decompression in the <tt>inf()</tt> routine. <tt>inf()</tt>
+decompresses what is hopefully a valid <em>zlib</em> stream from the input file and writes the
+uncompressed data to the output file.  Much of the discussion above for <tt>def()</tt>
+applies to <tt>inf()</tt> as well, so the discussion here will focus on the differences between
+the two.
+<pre><b>
+/* Decompress from file source to file dest until stream ends or EOF.
+   inf() returns Z_OK on success, Z_MEM_ERROR if memory could not be
+   allocated for processing, Z_DATA_ERROR if the deflate data is
+   invalid or incomplete, Z_VERSION_ERROR if the version of zlib.h and
+   the version of the library linked do not match, or Z_ERRNO if there
+   is an error reading or writing the files. */
+int inf(FILE *source, FILE *dest)
+{
+</b></pre>
+The local variables have the same functionality as they do for <tt>def()</tt>.  The
+only difference is that there is no <tt>flush</tt> variable, since <tt>inflate()</tt>
+can tell from the <em>zlib</em> stream itself when the stream is complete.
+<pre><b>
+    int ret;
+    unsigned have;
+    z_stream strm;
+    char in[CHUNK];
+    char out[CHUNK];
+</b></pre><!-- -->
+The initialization of the state is the same, except that there is no compression level,
+of course, and two more elements of the structure are initialized.  <tt>avail_in</tt>
+and <tt>next_in</tt> must be initialized before calling <tt>inflateInit()</tt>.  This
+is because the application has the option to provide the start of the zlib stream in
+order for <tt>inflateInit()</tt> to have access to information about the compression
+method to aid in memory allocation.  In the current implementation of <em>zlib</em>
+(up through versions 1.2.x), the method-dependent memory allocations are deferred to the first call of
+<tt>inflate()</tt> anyway.  However those fields must be initialized since later versions
+of <em>zlib</em> that provide more compression methods may take advantage of this interface.
+In any case, no decompression is performed by <tt>inflateInit()</tt>, so the
+<tt>avail_out</tt> and <tt>next_out</tt> fields do not need to be initialized before calling.
+<p>
+Here <tt>avail_in</tt> is set to zero and <tt>next_in</tt> is set to <tt>Z_NULL</tt> to
+indicate that no input data is being provided.
+<pre><b>
+    /* allocate inflate state */
+    strm.zalloc = Z_NULL;
+    strm.zfree = Z_NULL;
+    strm.opaque = Z_NULL;
+    strm.avail_in = 0;
+    strm.next_in = Z_NULL;
+    ret = inflateInit(&amp;strm);
+    if (ret != Z_OK)
+        return ret;
+</b></pre><!-- -->
+The outer <tt>do</tt>-loop decompresses input until <tt>inflate()</tt> indicates
+that it has reached the end of the compressed data and has produced all of the uncompressed
+output.  This is in contrast to <tt>def()</tt> which processes all of the input file.
+If end-of-file is reached before the compressed data self-terminates, then the compressed
+data is incomplete and an error is returned.
+<pre><b>
+    /* decompress until deflate stream ends or end of file */
+    do {
+</b></pre>
+We read input data and set the <tt>strm</tt> structure accordingly.  If we've reached the
+end of the input file, then we leave the outer loop and report an error, since the
+compressed data is incomplete.  Note that we may read more data than is eventually consumed
+by <tt>inflate()</tt>, if the input file continues past the <em>zlib</em> stream.
+For applications where <em>zlib</em> streams are embedded in other data, this routine would
+need to be modified to return the unused data, or at least indicate how much of the input
+data was not used, so the application would know where to pick up after the <em>zlib</em> stream.
+<pre><b>
+        strm.avail_in = fread(in, 1, CHUNK, source);
+        if (ferror(source)) {
+            (void)inflateEnd(&amp;strm);
+            return Z_ERRNO;
+        }
+        if (strm.avail_in == 0)
+            break;
+        strm.next_in = in;
+</b></pre><!-- -->
+The inner <tt>do</tt>-loop has the same function it did in <tt>def()</tt>, which is to
+keep calling <tt>inflate()</tt> until has generated all of the output it can with the
+provided input.
+<pre><b>
+        /* run inflate() on input until output buffer not full */
+        do {
+</b></pre>
+Just like in <tt>def()</tt>, the same output space is provided for each call of <tt>inflate()</tt>.
+<pre><b>
+            strm.avail_out = CHUNK;
+            strm.next_out = out;
+</b></pre>
+Now we run the decompression engine itself.  There is no need to adjust the flush parameter, since
+the <em>zlib</em> format is self-terminating. The main difference here is that there are
+return values that we need to pay attention to.  <tt>Z_DATA_ERROR</tt>
+indicates that <tt>inflate()</tt> detected an error in the <em>zlib</em> compressed data format,
+which means that either the data is not a <em>zlib</em> stream to begin with, or that the data was
+corrupted somewhere along the way since it was compressed.  The other error to be processed is
+<tt>Z_MEM_ERROR</tt>, which can occur since memory allocation is deferred until <tt>inflate()</tt>
+needs it, unlike <tt>deflate()</tt>, whose memory is allocated at the start by <tt>deflateInit()</tt>.
+<p>
+Advanced applications may use
+<tt>deflateSetDictionary()</tt> to prime <tt>deflate()</tt> with a set of likely data to improve the
+first 32K or so of compression.  This is noted in the <em>zlib</em> header, so <tt>inflate()</tt>
+requests that that dictionary be provided before it can start to decompress.  Without the dictionary,
+correct decompression is not possible.  For this routine, we have no idea what the dictionary is,
+so the <tt>Z_NEED_DICT</tt> indication is converted to a <tt>Z_DATA_ERROR</tt>.
+<p>
+<tt>inflate()</tt> can also return <tt>Z_STREAM_ERROR</tt>, which should not be possible here,
+but could be checked for as noted above for <tt>def()</tt>.  <tt>Z_BUF_ERROR</tt> does not need to be
+checked for here, for the same reasons noted for <tt>def()</tt>.  <tt>Z_STREAM_END</tt> will be
+checked for later.
+<pre><b>
+            ret = inflate(&amp;strm, Z_NO_FLUSH);
+            assert(ret != Z_STREAM_ERROR);  /* state not clobbered */
+            switch (ret) {
+            case Z_NEED_DICT:
+                ret = Z_DATA_ERROR;     /* and fall through */
+            case Z_DATA_ERROR:
+            case Z_MEM_ERROR:
+                (void)inflateEnd(&amp;strm);
+                return ret;
+            }
+</b></pre>
+The output of <tt>inflate()</tt> is handled identically to that of <tt>deflate()</tt>.
+<pre><b>
+            have = CHUNK - strm.avail_out;
+            if (fwrite(out, 1, have, dest) != have || ferror(dest)) {
+                (void)inflateEnd(&amp;strm);
+                return Z_ERRNO;
+            }
+</b></pre>
+The inner <tt>do</tt>-loop ends when <tt>inflate()</tt> has no more output as indicated
+by not filling the output buffer, just as for <tt>deflate()</tt>.  In this case, we cannot
+assert that <tt>strm.avail_in</tt> will be zero, since the deflate stream may end before the file
+does.
+<pre><b>
+        } while (strm.avail_out == 0);
+</b></pre><!-- -->
+The outer <tt>do</tt>-loop ends when <tt>inflate()</tt> reports that it has reached the
+end of the input <em>zlib</em> stream, has completed the decompression and integrity
+check, and has provided all of the output.  This is indicated by the <tt>inflate()</tt>
+return value <tt>Z_STREAM_END</tt>.  The inner loop is guaranteed to leave <tt>ret</tt>
+equal to <tt>Z_STREAM_END</tt> if the last chunk of the input file read contained the end
+of the <em>zlib</em> stream.  So if the return value is not <tt>Z_STREAM_END</tt>, the
+loop continues to read more input.
+<pre><b>
+        /* done when inflate() says it's done */
+    } while (ret != Z_STREAM_END);
+</b></pre><!-- -->
+At this point, decompression successfully completed, or we broke out of the loop due to no
+more data being available from the input file.  If the last <tt>inflate()</tt> return value
+is not <tt>Z_STREAM_END</tt>, then the <em>zlib</em> stream was incomplete and a data error
+is returned.  Otherwise, we return with a happy return value.  Of course, <tt>inflateEnd()</tt>
+is called first to avoid a memory leak.
+<pre><b>
+    /* clean up and return */
+    (void)inflateEnd(&amp;strm);
+    return ret == Z_STREAM_END ? Z_OK : Z_DATA_ERROR;
+}
+</b></pre><!-- -->
+That ends the routines that directly use <em>zlib</em>.  The following routines make this
+a command-line program by running data through the above routines from <tt>stdin</tt> to
+<tt>stdout</tt>, and handling any errors reported by <tt>def()</tt> or <tt>inf()</tt>.
+<p>
+<tt>zerr()</tt> is used to interpret the possible error codes from <tt>def()</tt>
+and <tt>inf()</tt>, as detailed in their comments above, and print out an error message.
+Note that these are only a subset of the possible return values from <tt>deflate()</tt>
+and <tt>inflate()</tt>.
+<pre><b>
+/* report a zlib or i/o error */
+void zerr(int ret)
+{
+    fputs("zpipe: ", stderr);
+    switch (ret) {
+    case Z_ERRNO:
+        if (ferror(stdin))
+            fputs("error reading stdin\n", stderr);
+        if (ferror(stdout))
+            fputs("error writing stdout\n", stderr);
+        break;
+    case Z_STREAM_ERROR:
+        fputs("invalid compression level\n", stderr);
+        break;
+    case Z_DATA_ERROR:
+        fputs("invalid or incomplete deflate data\n", stderr);
+        break;
+    case Z_MEM_ERROR:
+        fputs("out of memory\n", stderr);
+        break;
+    case Z_VERSION_ERROR:
+        fputs("zlib version mismatch!\n", stderr);
+    }
+}
+</b></pre><!-- -->
+Here is the <tt>main()</tt> routine used to test <tt>def()</tt> and <tt>inf()</tt>.  The
+<tt>zpipe</tt> command is simply a compression pipe from <tt>stdin</tt> to <tt>stdout</tt>, if
+no arguments are given, or it is a decompression pipe if <tt>zpipe -d</tt> is used.  If any other
+arguments are provided, no compression or decompression is performed.  Instead a usage
+message is displayed.  Examples are <tt>zpipe < foo.txt > foo.txt.z</tt> to compress, and
+<tt>zpipe -d < foo.txt.z > foo.txt</tt> to decompress.
+<pre><b>
+/* compress or decompress from stdin to stdout */
+int main(int argc, char **argv)
+{
+    int ret;
+
+    /* do compression if no arguments */
+    if (argc == 1) {
+        ret = def(stdin, stdout, Z_DEFAULT_COMPRESSION);
+        if (ret != Z_OK)
+            zerr(ret);
+        return ret;
+    }
+
+    /* do decompression if -d specified */
+    else if (argc == 2 &amp;&amp; strcmp(argv[1], "-d") == 0) {
+        ret = inf(stdin, stdout);
+        if (ret != Z_OK)
+            zerr(ret);
+        return ret;
+    }
+
+    /* otherwise, report usage */
+    else {
+        fputs("zpipe usage: zpipe [-d] &lt; source &gt; dest\n", stderr);
+        return 1;
+    }
+}
+</b></pre>
+<hr>
+<i>Copyright (c) 2004 by Mark Adler<br>Last modified 13 November 2004</i>
+</body>
+</html>
diff --git a/updater/zlib123/examples/zpipe.c b/updater/zlib123/examples/zpipe.c
new file mode 100644
index 0000000..27852a7
--- /dev/null
+++ b/updater/zlib123/examples/zpipe.c
@@ -0,0 +1,191 @@
+/* zpipe.c: example of proper use of zlib's inflate() and deflate()
+   Not copyrighted -- provided to the public domain
+   Version 1.2  9 November 2004  Mark Adler */
+
+/* Version history:
+   1.0  30 Oct 2004  First version
+   1.1   8 Nov 2004  Add void casting for unused return values
+                     Use switch statement for inflate() return values
+   1.2   9 Nov 2004  Add assertions to document zlib guarantees
+   1.3   6 Apr 2005  Remove incorrect assertion in inf()
+ */
+
+#include <stdio.h>
+#include <string.h>
+#include <assert.h>
+#include "zlib.h"
+
+#define CHUNK 16384
+
+/* Compress from file source to file dest until EOF on source.
+   def() returns Z_OK on success, Z_MEM_ERROR if memory could not be
+   allocated for processing, Z_STREAM_ERROR if an invalid compression
+   level is supplied, Z_VERSION_ERROR if the version of zlib.h and the
+   version of the library linked do not match, or Z_ERRNO if there is
+   an error reading or writing the files. */
+int def(FILE *source, FILE *dest, int level)
+{
+    int ret, flush;
+    unsigned have;
+    z_stream strm;
+    char in[CHUNK];
+    char out[CHUNK];
+
+    /* allocate deflate state */
+    strm.zalloc = Z_NULL;
+    strm.zfree = Z_NULL;
+    strm.opaque = Z_NULL;
+    ret = deflateInit(&strm, level);
+    if (ret != Z_OK)
+        return ret;
+
+    /* compress until end of file */
+    do {
+        strm.avail_in = fread(in, 1, CHUNK, source);
+        if (ferror(source)) {
+            (void)deflateEnd(&strm);
+            return Z_ERRNO;
+        }
+        flush = feof(source) ? Z_FINISH : Z_NO_FLUSH;
+        strm.next_in = in;
+
+        /* run deflate() on input until output buffer not full, finish
+           compression if all of source has been read in */
+        do {
+            strm.avail_out = CHUNK;
+            strm.next_out = out;
+            ret = deflate(&strm, flush);    /* no bad return value */
+            assert(ret != Z_STREAM_ERROR);  /* state not clobbered */
+            have = CHUNK - strm.avail_out;
+            if (fwrite(out, 1, have, dest) != have || ferror(dest)) {
+                (void)deflateEnd(&strm);
+                return Z_ERRNO;
+            }
+        } while (strm.avail_out == 0);
+        assert(strm.avail_in == 0);     /* all input will be used */
+
+        /* done when last data in file processed */
+    } while (flush != Z_FINISH);
+    assert(ret == Z_STREAM_END);        /* stream will be complete */
+
+    /* clean up and return */
+    (void)deflateEnd(&strm);
+    return Z_OK;
+}
+
+/* Decompress from file source to file dest until stream ends or EOF.
+   inf() returns Z_OK on success, Z_MEM_ERROR if memory could not be
+   allocated for processing, Z_DATA_ERROR if the deflate data is
+   invalid or incomplete, Z_VERSION_ERROR if the version of zlib.h and
+   the version of the library linked do not match, or Z_ERRNO if there
+   is an error reading or writing the files. */
+int inf(FILE *source, FILE *dest)
+{
+    int ret;
+    unsigned have;
+    z_stream strm;
+    char in[CHUNK];
+    char out[CHUNK];
+
+    /* allocate inflate state */
+    strm.zalloc = Z_NULL;
+    strm.zfree = Z_NULL;
+    strm.opaque = Z_NULL;
+    strm.avail_in = 0;
+    strm.next_in = Z_NULL;
+    ret = inflateInit(&strm);
+    if (ret != Z_OK)
+        return ret;
+
+    /* decompress until deflate stream ends or end of file */
+    do {
+        strm.avail_in = fread(in, 1, CHUNK, source);
+        if (ferror(source)) {
+            (void)inflateEnd(&strm);
+            return Z_ERRNO;
+        }
+        if (strm.avail_in == 0)
+            break;
+        strm.next_in = in;
+
+        /* run inflate() on input until output buffer not full */
+        do {
+            strm.avail_out = CHUNK;
+            strm.next_out = out;
+            ret = inflate(&strm, Z_NO_FLUSH);
+            assert(ret != Z_STREAM_ERROR);  /* state not clobbered */
+            switch (ret) {
+            case Z_NEED_DICT:
+                ret = Z_DATA_ERROR;     /* and fall through */
+            case Z_DATA_ERROR:
+            case Z_MEM_ERROR:
+                (void)inflateEnd(&strm);
+                return ret;
+            }
+            have = CHUNK - strm.avail_out;
+            if (fwrite(out, 1, have, dest) != have || ferror(dest)) {
+                (void)inflateEnd(&strm);
+                return Z_ERRNO;
+            }
+        } while (strm.avail_out == 0);
+
+        /* done when inflate() says it's done */
+    } while (ret != Z_STREAM_END);
+
+    /* clean up and return */
+    (void)inflateEnd(&strm);
+    return ret == Z_STREAM_END ? Z_OK : Z_DATA_ERROR;
+}
+
+/* report a zlib or i/o error */
+void zerr(int ret)
+{
+    fputs("zpipe: ", stderr);
+    switch (ret) {
+    case Z_ERRNO:
+        if (ferror(stdin))
+            fputs("error reading stdin\n", stderr);
+        if (ferror(stdout))
+            fputs("error writing stdout\n", stderr);
+        break;
+    case Z_STREAM_ERROR:
+        fputs("invalid compression level\n", stderr);
+        break;
+    case Z_DATA_ERROR:
+        fputs("invalid or incomplete deflate data\n", stderr);
+        break;
+    case Z_MEM_ERROR:
+        fputs("out of memory\n", stderr);
+        break;
+    case Z_VERSION_ERROR:
+        fputs("zlib version mismatch!\n", stderr);
+    }
+}
+
+/* compress or decompress from stdin to stdout */
+int main(int argc, char **argv)
+{
+    int ret;
+
+    /* do compression if no arguments */
+    if (argc == 1) {
+        ret = def(stdin, stdout, Z_DEFAULT_COMPRESSION);
+        if (ret != Z_OK)
+            zerr(ret);
+        return ret;
+    }
+
+    /* do decompression if -d specified */
+    else if (argc == 2 && strcmp(argv[1], "-d") == 0) {
+        ret = inf(stdin, stdout);
+        if (ret != Z_OK)
+            zerr(ret);
+        return ret;
+    }
+
+    /* otherwise, report usage */
+    else {
+        fputs("zpipe usage: zpipe [-d] < source > dest\n", stderr);
+        return 1;
+    }
+}
diff --git a/updater/zlib123/examples/zran.c b/updater/zlib123/examples/zran.c
new file mode 100644
index 0000000..e8a079d
--- /dev/null
+++ b/updater/zlib123/examples/zran.c
@@ -0,0 +1,404 @@
+/* zran.c -- example of zlib/gzip stream indexing and random access
+ * Copyright (C) 2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+   Version 1.0  29 May 2005  Mark Adler */
+
+/* Illustrate the use of Z_BLOCK, inflatePrime(), and inflateSetDictionary()
+   for random access of a compressed file.  A file containing a zlib or gzip
+   stream is provided on the command line.  The compressed stream is decoded in
+   its entirety, and an index built with access points about every SPAN bytes
+   in the uncompressed output.  The compressed file is left open, and can then
+   be read randomly, having to decompress on the average SPAN/2 uncompressed
+   bytes before getting to the desired block of data.
+
+   An access point can be created at the start of any deflate block, by saving
+   the starting file offset and bit of that block, and the 32K bytes of
+   uncompressed data that precede that block.  Also the uncompressed offset of
+   that block is saved to provide a referece for locating a desired starting
+   point in the uncompressed stream.  build_index() works by decompressing the
+   input zlib or gzip stream a block at a time, and at the end of each block
+   deciding if enough uncompressed data has gone by to justify the creation of
+   a new access point.  If so, that point is saved in a data structure that
+   grows as needed to accommodate the points.
+
+   To use the index, an offset in the uncompressed data is provided, for which
+   the latest accees point at or preceding that offset is located in the index.
+   The input file is positioned to the specified location in the index, and if
+   necessary the first few bits of the compressed data is read from the file.
+   inflate is initialized with those bits and the 32K of uncompressed data, and
+   the decompression then proceeds until the desired offset in the file is
+   reached.  Then the decompression continues to read the desired uncompressed
+   data from the file.
+
+   Another approach would be to generate the index on demand.  In that case,
+   requests for random access reads from the compressed data would try to use
+   the index, but if a read far enough past the end of the index is required,
+   then further index entries would be generated and added.
+
+   There is some fair bit of overhead to starting inflation for the random
+   access, mainly copying the 32K byte dictionary.  So if small pieces of the
+   file are being accessed, it would make sense to implement a cache to hold
+   some lookahead and avoid many calls to extract() for small lengths.
+
+   Another way to build an index would be to use inflateCopy().  That would
+   not be constrained to have access points at block boundaries, but requires
+   more memory per access point, and also cannot be saved to file due to the
+   use of pointers in the state.  The approach here allows for storage of the
+   index in a file.
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "zlib.h"
+
+#define local static
+
+#define SPAN 1048576L       /* desired distance between access points */
+#define WINSIZE 32768U      /* sliding window size */
+#define CHUNK 16384         /* file input buffer size */
+
+/* access point entry */
+struct point {
+    off_t out;          /* corresponding offset in uncompressed data */
+    off_t in;           /* offset in input file of first full byte */
+    int bits;           /* number of bits (1-7) from byte at in - 1, or 0 */
+    unsigned char window[WINSIZE];  /* preceding 32K of uncompressed data */
+};
+
+/* access point list */
+struct access {
+    int have;           /* number of list entries filled in */
+    int size;           /* number of list entries allocated */
+    struct point *list; /* allocated list */
+};
+
+/* Deallocate an index built by build_index() */
+local void free_index(struct access *index)
+{
+    if (index != NULL) {
+        free(index->list);
+        free(index);
+    }
+}
+
+/* Add an entry to the access point list.  If out of memory, deallocate the
+   existing list and return NULL. */
+local struct access *addpoint(struct access *index, int bits,
+    off_t in, off_t out, unsigned left, unsigned char *window)
+{
+    struct point *next;
+
+    /* if list is empty, create it (start with eight points) */
+    if (index == NULL) {
+        index = malloc(sizeof(struct access));
+        if (index == NULL) return NULL;
+        index->list = malloc(sizeof(struct point) << 3);
+        if (index->list == NULL) {
+            free(index);
+            return NULL;
+        }
+        index->size = 8;
+        index->have = 0;
+    }
+
+    /* if list is full, make it bigger */
+    else if (index->have == index->size) {
+        index->size <<= 1;
+        next = realloc(index->list, sizeof(struct point) * index->size);
+        if (next == NULL) {
+            free_index(index);
+            return NULL;
+        }
+        index->list = next;
+    }
+
+    /* fill in entry and increment how many we have */
+    next = index->list + index->have;
+    next->bits = bits;
+    next->in = in;
+    next->out = out;
+    if (left)
+        memcpy(next->window, window + WINSIZE - left, left);
+    if (left < WINSIZE)
+        memcpy(next->window + left, window, WINSIZE - left);
+    index->have++;
+
+    /* return list, possibly reallocated */
+    return index;
+}
+
+/* Make one entire pass through the compressed stream and build an index, with
+   access points about every span bytes of uncompressed output -- span is
+   chosen to balance the speed of random access against the memory requirements
+   of the list, about 32K bytes per access point.  Note that data after the end
+   of the first zlib or gzip stream in the file is ignored.  build_index()
+   returns the number of access points on success (>= 1), Z_MEM_ERROR for out
+   of memory, Z_DATA_ERROR for an error in the input file, or Z_ERRNO for a
+   file read error.  On success, *built points to the resulting index. */
+local int build_index(FILE *in, off_t span, struct access **built)
+{
+    int ret;
+    off_t totin, totout;        /* our own total counters to avoid 4GB limit */
+    off_t last;                 /* totout value of last access point */
+    struct access *index;       /* access points being generated */
+    z_stream strm;
+    unsigned char input[CHUNK];
+    unsigned char window[WINSIZE];
+
+    /* initialize inflate */
+    strm.zalloc = Z_NULL;
+    strm.zfree = Z_NULL;
+    strm.opaque = Z_NULL;
+    strm.avail_in = 0;
+    strm.next_in = Z_NULL;
+    ret = inflateInit2(&strm, 47);      /* automatic zlib or gzip decoding */
+    if (ret != Z_OK)
+        return ret;
+
+    /* inflate the input, maintain a sliding window, and build an index -- this
+       also validates the integrity of the compressed data using the check
+       information at the end of the gzip or zlib stream */
+    totin = totout = last = 0;
+    index = NULL;               /* will be allocated by first addpoint() */
+    strm.avail_out = 0;
+    do {
+        /* get some compressed data from input file */
+        strm.avail_in = fread(input, 1, CHUNK, in);
+        if (ferror(in)) {
+            ret = Z_ERRNO;
+            goto build_index_error;
+        }
+        if (strm.avail_in == 0) {
+            ret = Z_DATA_ERROR;
+            goto build_index_error;
+        }
+        strm.next_in = input;
+
+        /* process all of that, or until end of stream */
+        do {
+            /* reset sliding window if necessary */
+            if (strm.avail_out == 0) {
+                strm.avail_out = WINSIZE;
+                strm.next_out = window;
+            }
+
+            /* inflate until out of input, output, or at end of block --
+               update the total input and output counters */
+            totin += strm.avail_in;
+            totout += strm.avail_out;
+            ret = inflate(&strm, Z_BLOCK);      /* return at end of block */
+            totin -= strm.avail_in;
+            totout -= strm.avail_out;
+            if (ret == Z_NEED_DICT)
+                ret = Z_DATA_ERROR;
+            if (ret == Z_MEM_ERROR || ret == Z_DATA_ERROR)
+                goto build_index_error;
+            if (ret == Z_STREAM_END)
+                break;
+
+            /* if at end of block, consider adding an index entry (note that if
+               data_type indicates an end-of-block, then all of the
+               uncompressed data from that block has been delivered, and none
+               of the compressed data after that block has been consumed,
+               except for up to seven bits) -- the totout == 0 provides an
+               entry point after the zlib or gzip header, and assures that the
+               index always has at least one access point; we avoid creating an
+               access point after the last block by checking bit 6 of data_type
+             */
+            if ((strm.data_type & 128) && !(strm.data_type & 64) &&
+                (totout == 0 || totout - last > span)) {
+                index = addpoint(index, strm.data_type & 7, totin,
+                                 totout, strm.avail_out, window);
+                if (index == NULL) {
+                    ret = Z_MEM_ERROR;
+                    goto build_index_error;
+                }
+                last = totout;
+            }
+        } while (strm.avail_in != 0);
+    } while (ret != Z_STREAM_END);
+
+    /* clean up and return index (release unused entries in list) */
+    (void)inflateEnd(&strm);
+    index = realloc(index, sizeof(struct point) * index->have);
+    index->size = index->have;
+    *built = index;
+    return index->size;
+
+    /* return error */
+  build_index_error:
+    (void)inflateEnd(&strm);
+    if (index != NULL)
+        free_index(index);
+    return ret;
+}
+
+/* Use the index to read len bytes from offset into buf, return bytes read or
+   negative for error (Z_DATA_ERROR or Z_MEM_ERROR).  If data is requested past
+   the end of the uncompressed data, then extract() will return a value less
+   than len, indicating how much as actually read into buf.  This function
+   should not return a data error unless the file was modified since the index
+   was generated.  extract() may also return Z_ERRNO if there is an error on
+   reading or seeking the input file. */
+local int extract(FILE *in, struct access *index, off_t offset,
+                  unsigned char *buf, int len)
+{
+    int ret, skip;
+    z_stream strm;
+    struct point *here;
+    unsigned char input[CHUNK];
+    unsigned char discard[WINSIZE];
+
+    /* proceed only if something reasonable to do */
+    if (len < 0)
+        return 0;
+
+    /* find where in stream to start */
+    here = index->list;
+    ret = index->have;
+    while (--ret && here[1].out <= offset)
+        here++;
+
+    /* initialize file and inflate state to start there */
+    strm.zalloc = Z_NULL;
+    strm.zfree = Z_NULL;
+    strm.opaque = Z_NULL;
+    strm.avail_in = 0;
+    strm.next_in = Z_NULL;
+    ret = inflateInit2(&strm, -15);         /* raw inflate */
+    if (ret != Z_OK)
+        return ret;
+    ret = fseeko(in, here->in - (here->bits ? 1 : 0), SEEK_SET);
+    if (ret == -1)
+        goto extract_ret;
+    if (here->bits) {
+        ret = getc(in);
+        if (ret == -1) {
+            ret = ferror(in) ? Z_ERRNO : Z_DATA_ERROR;
+            goto extract_ret;
+        }
+        (void)inflatePrime(&strm, here->bits, ret >> (8 - here->bits));
+    }
+    (void)inflateSetDictionary(&strm, here->window, WINSIZE);
+
+    /* skip uncompressed bytes until offset reached, then satisfy request */
+    offset -= here->out;
+    strm.avail_in = 0;
+    skip = 1;                               /* while skipping to offset */
+    do {
+        /* define where to put uncompressed data, and how much */
+        if (offset == 0 && skip) {          /* at offset now */
+            strm.avail_out = len;
+            strm.next_out = buf;
+            skip = 0;                       /* only do this once */
+        }
+        if (offset > WINSIZE) {             /* skip WINSIZE bytes */
+            strm.avail_out = WINSIZE;
+            strm.next_out = discard;
+            offset -= WINSIZE;
+        }
+        else if (offset != 0) {             /* last skip */
+            strm.avail_out = (unsigned)offset;
+            strm.next_out = discard;
+            offset = 0;
+        }
+
+        /* uncompress until avail_out filled, or end of stream */
+        do {
+            if (strm.avail_in == 0) {
+                strm.avail_in = fread(input, 1, CHUNK, in);
+                if (ferror(in)) {
+                    ret = Z_ERRNO;
+                    goto extract_ret;
+                }
+                if (strm.avail_in == 0) {
+                    ret = Z_DATA_ERROR;
+                    goto extract_ret;
+                }
+                strm.next_in = input;
+            }
+            ret = inflate(&strm, Z_NO_FLUSH);       /* normal inflate */
+            if (ret == Z_NEED_DICT)
+                ret = Z_DATA_ERROR;
+            if (ret == Z_MEM_ERROR || ret == Z_DATA_ERROR)
+                goto extract_ret;
+            if (ret == Z_STREAM_END)
+                break;
+        } while (strm.avail_out != 0);
+
+        /* if reach end of stream, then don't keep trying to get more */
+        if (ret == Z_STREAM_END)
+            break;
+
+        /* do until offset reached and requested data read, or stream ends */
+    } while (skip);
+
+    /* compute number of uncompressed bytes read after offset */
+    ret = skip ? 0 : len - strm.avail_out;
+
+    /* clean up and return bytes read or error */
+  extract_ret:
+    (void)inflateEnd(&strm);
+    return ret;
+}
+
+/* Demonstrate the use of build_index() and extract() by processing the file
+   provided on the command line, and the extracting 16K from about 2/3rds of
+   the way through the uncompressed output, and writing that to stdout. */
+int main(int argc, char **argv)
+{
+    int len;
+    off_t offset;
+    FILE *in;
+    struct access *index;
+    unsigned char buf[CHUNK];
+
+    /* open input file */
+    if (argc != 2) {
+        fprintf(stderr, "usage: zran file.gz\n");
+        return 1;
+    }
+    in = fopen(argv[1], "rb");
+    if (in == NULL) {
+        fprintf(stderr, "zran: could not open %s for reading\n", argv[1]);
+        return 1;
+    }
+
+    /* build index */
+    len = build_index(in, SPAN, &index);
+    if (len < 0) {
+        fclose(in);
+        switch (len) {
+        case Z_MEM_ERROR:
+            fprintf(stderr, "zran: out of memory\n");
+            break;
+        case Z_DATA_ERROR:
+            fprintf(stderr, "zran: compressed data error in %s\n", argv[1]);
+            break;
+        case Z_ERRNO:
+            fprintf(stderr, "zran: read error on %s\n", argv[1]);
+            break;
+        default:
+            fprintf(stderr, "zran: error %d while building index\n", len);
+        }
+        return 1;
+    }
+    fprintf(stderr, "zran: built index with %d access points\n", len);
+
+    /* use index by reading some bytes from an arbitrary offset */
+    offset = (index->list[index->have - 1].out << 1) / 3;
+    len = extract(in, index, offset, buf, CHUNK);
+    if (len < 0)
+        fprintf(stderr, "zran: extraction failed: %s error\n",
+                len == Z_MEM_ERROR ? "out of memory" : "input corrupted");
+    else {
+        fwrite(buf, 1, len, stdout);
+        fprintf(stderr, "zran: extracted %d bytes at %llu\n", len, offset);
+    }
+
+    /* clean up and exit */
+    free_index(index);
+    fclose(in);
+    return 0;
+}
diff --git a/updater/zlib123/gzio.c b/updater/zlib123/gzio.c
new file mode 100644
index 0000000..8821db8
--- /dev/null
+++ b/updater/zlib123/gzio.c
@@ -0,0 +1,979 @@
+/* gzio.c -- IO on .gz files
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ *
+ * Compile this file with -DNO_GZCOMPRESS to avoid the compression code.
+ */
+
+/* @(#) $Id$ */
+
+#include <stdio.h>
+
+#include "zutil.h"
+
+#ifdef NO_DEFLATE       /* for compatibility with old definition */
+#  define NO_GZCOMPRESS
+#endif
+
+#ifndef NO_DUMMY_DECL
+struct internal_state {int dummy;}; /* for buggy compilers */
+#endif
+
+#ifndef Z_BUFSIZE
+#  ifdef MAXSEG_64K
+#    define Z_BUFSIZE 4096 /* minimize memory usage for 16-bit DOS */
+#  else
+#    define Z_BUFSIZE 16384
+#  endif
+#endif
+#ifndef Z_PRINTF_BUFSIZE
+#  define Z_PRINTF_BUFSIZE 4096
+#endif
+
+#ifdef __MVS__
+#  pragma map (fdopen , "\174\174FDOPEN")
+   FILE *fdopen(int, const char *);
+#endif
+
+#ifndef STDC
+extern voidp  malloc OF((uInt size));
+extern void   free   OF((voidpf ptr));
+#endif
+
+#define ALLOC(size) malloc(size)
+#define TRYFREE(p) {if (p) free(p);}
+
+static int const gz_magic[2] = {0x1f, 0x8b}; /* gzip magic header */
+
+/* gzip flag byte */
+#define ASCII_FLAG   0x01 /* bit 0 set: file probably ascii text */
+#define HEAD_CRC     0x02 /* bit 1 set: header CRC present */
+#define EXTRA_FIELD  0x04 /* bit 2 set: extra field present */
+#define ORIG_NAME    0x08 /* bit 3 set: original file name present */
+#define COMMENT      0x10 /* bit 4 set: file comment present */
+#define RESERVED     0xE0 /* bits 5..7: reserved */
+
+typedef struct gz_stream {
+    z_stream stream;
+    int      z_err;   /* error code for last stream operation */
+    int      z_eof;   /* set if end of input file */
+    FILE     *file;   /* .gz file */
+    Byte     *inbuf;  /* input buffer */
+    Byte     *outbuf; /* output buffer */
+    uLong    crc;     /* crc32 of uncompressed data */
+    char     *msg;    /* error message */
+    char     *path;   /* path name for debugging only */
+    int      transparent; /* 1 if input file is not a .gz file */
+    char     mode;    /* 'w' or 'r' */
+    z_off_t  start;   /* start of compressed data in file (header skipped) */
+    z_off_t  in;      /* bytes into deflate or inflate */
+    z_off_t  out;     /* bytes out of deflate or inflate */
+    int      back;    /* one character push-back */
+    int      last;    /* true if push-back is last character */
+} gz_stream;
+
+
+local gzFile gz_open      OF((const char *path, const char *mode, int  fd));
+local int do_flush        OF((gzFile file, int flush));
+local int    get_byte     OF((gz_stream *s));
+local void   check_header OF((gz_stream *s));
+local int    destroy      OF((gz_stream *s));
+local void   putLong      OF((FILE *file, uLong x));
+local uLong  getLong      OF((gz_stream *s));
+
+/* ===========================================================================
+     Opens a gzip (.gz) file for reading or writing. The mode parameter
+   is as in fopen ("rb" or "wb"). The file is given either by file descriptor
+   or path name (if fd == -1).
+     gz_open returns NULL if the file could not be opened or if there was
+   insufficient memory to allocate the (de)compression state; errno
+   can be checked to distinguish the two cases (if errno is zero, the
+   zlib error is Z_MEM_ERROR).
+*/
+local gzFile gz_open (const char *path, const char *mode, int  fd)
+{
+    int err;
+    int level = Z_DEFAULT_COMPRESSION; /* compression level */
+    int strategy = Z_DEFAULT_STRATEGY; /* compression strategy */
+    char *p = (char*)mode;
+    gz_stream *s;
+    char fmode[80]; /* copy of mode, without the compression level */
+    char *m = fmode;
+
+    if (!path || !mode) return Z_NULL;
+
+    s = (gz_stream *)ALLOC(sizeof(gz_stream));
+    if (!s) return Z_NULL;
+
+    s->stream.zalloc = (alloc_func)0;
+    s->stream.zfree = (free_func)0;
+    s->stream.opaque = (voidpf)0;
+    s->stream.next_in = s->inbuf = Z_NULL;
+    s->stream.next_out = s->outbuf = Z_NULL;
+    s->stream.avail_in = s->stream.avail_out = 0;
+    s->file = NULL;
+    s->z_err = Z_OK;
+    s->z_eof = 0;
+    s->in = 0;
+    s->out = 0;
+    s->back = EOF;
+    s->crc = crc32(0L, Z_NULL, 0);
+    s->msg = NULL;
+    s->transparent = 0;
+
+    s->path = (char*)ALLOC(strlen(path)+1);
+    if (s->path == NULL) {
+        return destroy(s), (gzFile)Z_NULL;
+    }
+    strcpy(s->path, path); /* do this early for debugging */
+
+    s->mode = '\0';
+    do {
+        if (*p == 'r') s->mode = 'r';
+        if (*p == 'w' || *p == 'a') s->mode = 'w';
+        if (*p >= '0' && *p <= '9') {
+            level = *p - '0';
+        } else if (*p == 'f') {
+          strategy = Z_FILTERED;
+        } else if (*p == 'h') {
+          strategy = Z_HUFFMAN_ONLY;
+        } else if (*p == 'R') {
+          strategy = Z_RLE;
+        } else {
+            *m++ = *p; /* copy the mode */
+        }
+    } while (*p++ && m != fmode + sizeof(fmode));
+    if (s->mode == '\0') return destroy(s), (gzFile)Z_NULL;
+
+    if (s->mode == 'w') {
+#ifdef NO_GZCOMPRESS
+        err = Z_STREAM_ERROR;
+#else
+        err = deflateInit2(&(s->stream), level,
+                           Z_DEFLATED, -MAX_WBITS, DEF_MEM_LEVEL, strategy);
+        /* windowBits is passed < 0 to suppress zlib header */
+
+        s->stream.next_out = s->outbuf = (Byte*)ALLOC(Z_BUFSIZE);
+#endif
+        if (err != Z_OK || s->outbuf == Z_NULL) {
+            return destroy(s), (gzFile)Z_NULL;
+        }
+    } else {
+        s->stream.next_in  = s->inbuf = (Byte*)ALLOC(Z_BUFSIZE);
+
+        err = inflateInit2(&(s->stream), -MAX_WBITS);
+        /* windowBits is passed < 0 to tell that there is no zlib header.
+         * Note that in this case inflate *requires* an extra "dummy" byte
+         * after the compressed stream in order to complete decompression and
+         * return Z_STREAM_END. Here the gzip CRC32 ensures that 4 bytes are
+         * present after the compressed stream.
+         */
+        if (err != Z_OK || s->inbuf == Z_NULL) {
+            return destroy(s), (gzFile)Z_NULL;
+        }
+    }
+    s->stream.avail_out = Z_BUFSIZE;
+
+    errno = 0;
+    s->file = fd < 0 ? F_OPEN(path, fmode) : (FILE*)fdopen(fd, fmode);
+
+    if (s->file == NULL) {
+        return destroy(s), (gzFile)Z_NULL;
+    }
+    if (s->mode == 'w') {
+        /* Write a very simple .gz header:
+         */
+        fprintf(s->file, "%c%c%c%c%c%c%c%c%c%c", gz_magic[0], gz_magic[1],
+             Z_DEFLATED, 0 /*flags*/, 0,0,0,0 /*time*/, 0 /*xflags*/, OS_CODE);
+        s->start = 10L;
+        /* We use 10L instead of ftell(s->file) to because ftell causes an
+         * fflush on some systems. This version of the library doesn't use
+         * start anyway in write mode, so this initialization is not
+         * necessary.
+         */
+    } else {
+        check_header(s); /* skip the .gz header */
+        s->start = ftell(s->file) - s->stream.avail_in;
+    }
+
+    return (gzFile)s;
+}
+
+/* ===========================================================================
+     Opens a gzip (.gz) file for reading or writing.
+*/
+gzFile ZEXPORT gzopen (const char *path, const char *mode)
+{
+    return gz_open (path, mode, -1);
+}
+
+/* ===========================================================================
+     Associate a gzFile with the file descriptor fd. fd is not dup'ed here
+   to mimic the behavio(u)r of fdopen.
+*/
+gzFile ZEXPORT gzdopen (int fd, const char *mode)
+{
+    char name[46];      /* allow for up to 128-bit integers */
+
+    if (fd < 0) return (gzFile)Z_NULL;
+    sprintf(name, "<fd:%d>", fd); /* for debugging */
+
+    return gz_open (name, mode, fd);
+}
+
+/* ===========================================================================
+ * Update the compression level and strategy
+ */
+int ZEXPORT gzsetparams (gzFile file, int level, int strategy)
+{
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL || s->mode != 'w') return Z_STREAM_ERROR;
+
+    /* Make room to allow flushing */
+    if (s->stream.avail_out == 0) {
+
+        s->stream.next_out = s->outbuf;
+        if (fwrite(s->outbuf, 1, Z_BUFSIZE, s->file) != Z_BUFSIZE) {
+            s->z_err = Z_ERRNO;
+        }
+        s->stream.avail_out = Z_BUFSIZE;
+    }
+
+    return deflateParams (&(s->stream), level, strategy);
+}
+
+/* ===========================================================================
+     Read a byte from a gz_stream; update next_in and avail_in. Return EOF
+   for end of file.
+   IN assertion: the stream s has been sucessfully opened for reading.
+*/
+local int get_byte(gz_stream *s)
+{
+    if (s->z_eof) return EOF;
+    if (s->stream.avail_in == 0) {
+        errno = 0;
+        s->stream.avail_in = (uInt)fread(s->inbuf, 1, Z_BUFSIZE, s->file);
+        if (s->stream.avail_in == 0) {
+            s->z_eof = 1;
+            if (ferror(s->file)) s->z_err = Z_ERRNO;
+            return EOF;
+        }
+        s->stream.next_in = s->inbuf;
+    }
+    s->stream.avail_in--;
+    return *(s->stream.next_in)++;
+}
+
+/* ===========================================================================
+      Check the gzip header of a gz_stream opened for reading. Set the stream
+    mode to transparent if the gzip magic header is not present; set s->err
+    to Z_DATA_ERROR if the magic header is present but the rest of the header
+    is incorrect.
+    IN assertion: the stream s has already been created sucessfully;
+       s->stream.avail_in is zero for the first time, but may be non-zero
+       for concatenated .gz files.
+*/
+local void check_header(gz_stream *s)
+{
+    int method; /* method byte */
+    int flags;  /* flags byte */
+    uInt len;
+    int c;
+
+    /* Assure two bytes in the buffer so we can peek ahead -- handle case
+       where first byte of header is at the end of the buffer after the last
+       gzip segment */
+    len = s->stream.avail_in;
+    if (len < 2) {
+        if (len) s->inbuf[0] = s->stream.next_in[0];
+        errno = 0;
+        len = (uInt)fread(s->inbuf + len, 1, Z_BUFSIZE >> len, s->file);
+        if (len == 0 && ferror(s->file)) s->z_err = Z_ERRNO;
+        s->stream.avail_in += len;
+        s->stream.next_in = s->inbuf;
+        if (s->stream.avail_in < 2) {
+            s->transparent = s->stream.avail_in;
+            return;
+        }
+    }
+
+    /* Peek ahead to check the gzip magic header */
+    if (s->stream.next_in[0] != gz_magic[0] ||
+        s->stream.next_in[1] != gz_magic[1]) {
+        s->transparent = 1;
+        return;
+    }
+    s->stream.avail_in -= 2;
+    s->stream.next_in += 2;
+
+    /* Check the rest of the gzip header */
+    method = get_byte(s);
+    flags = get_byte(s);
+    if (method != Z_DEFLATED || (flags & RESERVED) != 0) {
+        s->z_err = Z_DATA_ERROR;
+        return;
+    }
+
+    /* Discard time, xflags and OS code: */
+    for (len = 0; len < 6; len++) (void)get_byte(s);
+
+    if ((flags & EXTRA_FIELD) != 0) { /* skip the extra field */
+        len  =  (uInt)get_byte(s);
+        len += ((uInt)get_byte(s))<<8;
+        /* len is garbage if EOF but the loop below will quit anyway */
+        while (len-- != 0 && get_byte(s) != EOF) ;
+    }
+    if ((flags & ORIG_NAME) != 0) { /* skip the original file name */
+        while ((c = get_byte(s)) != 0 && c != EOF) ;
+    }
+    if ((flags & COMMENT) != 0) {   /* skip the .gz file comment */
+        while ((c = get_byte(s)) != 0 && c != EOF) ;
+    }
+    if ((flags & HEAD_CRC) != 0) {  /* skip the header crc */
+        for (len = 0; len < 2; len++) (void)get_byte(s);
+    }
+    s->z_err = s->z_eof ? Z_DATA_ERROR : Z_OK;
+}
+
+ /* ===========================================================================
+ * Cleanup then free the given gz_stream. Return a zlib error code.
+   Try freeing in the reverse order of allocations.
+ */
+local int destroy (gz_stream *s)
+{
+    int err = Z_OK;
+
+    if (!s) return Z_STREAM_ERROR;
+
+    TRYFREE(s->msg);
+
+    if (s->stream.state != NULL) {
+        if (s->mode == 'w') {
+#ifdef NO_GZCOMPRESS
+            err = Z_STREAM_ERROR;
+#else
+            err = deflateEnd(&(s->stream));
+#endif
+        } else if (s->mode == 'r') {
+            err = inflateEnd(&(s->stream));
+        }
+    }
+    if (s->file != NULL && fclose(s->file)) {
+#ifdef ESPIPE
+        if (errno != ESPIPE) /* fclose is broken for pipes in HP/UX */
+#endif
+            err = Z_ERRNO;
+    }
+    if (s->z_err < 0) err = s->z_err;
+
+    TRYFREE(s->inbuf);
+    TRYFREE(s->outbuf);
+    TRYFREE(s->path);
+    TRYFREE(s);
+    return err;
+}
+
+/* ===========================================================================
+     Reads the given number of uncompressed bytes from the compressed file.
+   gzread returns the number of bytes actually read (0 for end of file).
+*/
+int ZEXPORT gzread (gzFile file, voidp buf, unsigned len)
+{
+    gz_stream *s = (gz_stream*)file;
+    Bytef *start = (Bytef*)buf; /* starting point for crc computation */
+    Byte  *next_out; /* == stream.next_out but not forced far (for MSDOS) */
+
+    if (s == NULL || s->mode != 'r') return Z_STREAM_ERROR;
+
+    if (s->z_err == Z_DATA_ERROR || s->z_err == Z_ERRNO) return -1;
+    if (s->z_err == Z_STREAM_END) return 0;  /* EOF */
+
+    next_out = (Byte*)buf;
+    s->stream.next_out = (Bytef*)buf;
+    s->stream.avail_out = len;
+
+    if (s->stream.avail_out && s->back != EOF) {
+        *next_out++ = s->back;
+        s->stream.next_out++;
+        s->stream.avail_out--;
+        s->back = EOF;
+        s->out++;
+        start++;
+        if (s->last) {
+            s->z_err = Z_STREAM_END;
+            return 1;
+        }
+    }
+
+    while (s->stream.avail_out != 0) {
+
+        if (s->transparent) {
+            /* Copy first the lookahead bytes: */
+            uInt n = s->stream.avail_in;
+            if (n > s->stream.avail_out) n = s->stream.avail_out;
+            if (n > 0) {
+                zmemcpy(s->stream.next_out, s->stream.next_in, n);
+                next_out += n;
+                s->stream.next_out = next_out;
+                s->stream.next_in   += n;
+                s->stream.avail_out -= n;
+                s->stream.avail_in  -= n;
+            }
+            if (s->stream.avail_out > 0) {
+                s->stream.avail_out -=
+                    (uInt)fread(next_out, 1, s->stream.avail_out, s->file);
+            }
+            len -= s->stream.avail_out;
+            s->in  += len;
+            s->out += len;
+            if (len == 0) s->z_eof = 1;
+            return (int)len;
+        }
+        if (s->stream.avail_in == 0 && !s->z_eof) {
+
+            errno = 0;
+            s->stream.avail_in = (uInt)fread(s->inbuf, 1, Z_BUFSIZE, s->file);
+            if (s->stream.avail_in == 0) {
+                s->z_eof = 1;
+                if (ferror(s->file)) {
+                    s->z_err = Z_ERRNO;
+                    break;
+                }
+            }
+            s->stream.next_in = s->inbuf;
+        }
+        s->in += s->stream.avail_in;
+        s->out += s->stream.avail_out;
+        s->z_err = inflate(&(s->stream), Z_NO_FLUSH);
+        s->in -= s->stream.avail_in;
+        s->out -= s->stream.avail_out;
+
+        if (s->z_err == Z_STREAM_END) {
+            /* Check CRC and original size */
+            s->crc = crc32(s->crc, start, (uInt)(s->stream.next_out - start));
+            start = s->stream.next_out;
+
+            if (getLong(s) != s->crc) {
+                s->z_err = Z_DATA_ERROR;
+            } else {
+                (void)getLong(s);
+                /* The uncompressed length returned by above getlong() may be
+                 * different from s->out in case of concatenated .gz files.
+                 * Check for such files:
+                 */
+                check_header(s);
+                if (s->z_err == Z_OK) {
+                    inflateReset(&(s->stream));
+                    s->crc = crc32(0L, Z_NULL, 0);
+                }
+            }
+        }
+        if (s->z_err != Z_OK || s->z_eof) break;
+    }
+    s->crc = crc32(s->crc, start, (uInt)(s->stream.next_out - start));
+
+    if (len == s->stream.avail_out &&
+        (s->z_err == Z_DATA_ERROR || s->z_err == Z_ERRNO))
+        return -1;
+    return (int)(len - s->stream.avail_out);
+}
+
+
+/* ===========================================================================
+      Reads one byte from the compressed file. gzgetc returns this byte
+   or -1 in case of end of file or error.
+*/
+int ZEXPORT gzgetc(gzFile file)
+{
+    unsigned char c;
+
+    return gzread(file, &c, 1) == 1 ? c : -1;
+}
+
+
+/* ===========================================================================
+      Push one byte back onto the stream.
+*/
+int ZEXPORT gzungetc(int c, gzFile file)
+{
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL || s->mode != 'r' || c == EOF || s->back != EOF) return EOF;
+    s->back = c;
+    s->out--;
+    s->last = (s->z_err == Z_STREAM_END);
+    if (s->last) s->z_err = Z_OK;
+    s->z_eof = 0;
+    return c;
+}
+
+
+/* ===========================================================================
+      Reads bytes from the compressed file until len-1 characters are
+   read, or a newline character is read and transferred to buf, or an
+   end-of-file condition is encountered.  The string is then terminated
+   with a null character.
+      gzgets returns buf, or Z_NULL in case of error.
+
+      The current implementation is not optimized at all.
+*/
+char * ZEXPORT gzgets(gzFile file, char *buf, int len)
+{
+    char *b = buf;
+    if (buf == Z_NULL || len <= 0) return Z_NULL;
+
+    while (--len > 0 && gzread(file, buf, 1) == 1 && *buf++ != '\n') ;
+    *buf = '\0';
+    return b == buf && len > 0 ? Z_NULL : b;
+}
+
+
+#ifndef NO_GZCOMPRESS
+/* ===========================================================================
+     Writes the given number of uncompressed bytes into the compressed file.
+   gzwrite returns the number of bytes actually written (0 in case of error).
+*/
+int ZEXPORT gzwrite (gzFile file, voidpc buf, unsigned len)
+{
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL || s->mode != 'w') return Z_STREAM_ERROR;
+
+    s->stream.next_in = (Bytef*)buf;
+    s->stream.avail_in = len;
+
+    while (s->stream.avail_in != 0) {
+
+        if (s->stream.avail_out == 0) {
+
+            s->stream.next_out = s->outbuf;
+            if (fwrite(s->outbuf, 1, Z_BUFSIZE, s->file) != Z_BUFSIZE) {
+                s->z_err = Z_ERRNO;
+                break;
+            }
+            s->stream.avail_out = Z_BUFSIZE;
+        }
+        s->in += s->stream.avail_in;
+        s->out += s->stream.avail_out;
+        s->z_err = deflate(&(s->stream), Z_NO_FLUSH);
+        s->in -= s->stream.avail_in;
+        s->out -= s->stream.avail_out;
+        if (s->z_err != Z_OK) break;
+    }
+    s->crc = crc32(s->crc, (const Bytef *)buf, len);
+
+    return (int)(len - s->stream.avail_in);
+}
+
+
+/* ===========================================================================
+     Converts, formats, and writes the args to the compressed file under
+   control of the format string, as in fprintf. gzprintf returns the number of
+   uncompressed bytes actually written (0 in case of error).
+*/
+#ifdef STDC
+#include <stdarg.h>
+
+int ZEXPORTVA gzprintf (gzFile file, const char *format, /* args */ ...)
+{
+    char buf[Z_PRINTF_BUFSIZE];
+    va_list va;
+    int len;
+
+    buf[sizeof(buf) - 1] = 0;
+    va_start(va, format);
+#ifdef NO_vsnprintf
+#  ifdef HAS_vsprintf_void
+    (void)vsprintf(buf, format, va);
+    va_end(va);
+    for (len = 0; len < sizeof(buf); len++)
+        if (buf[len] == 0) break;
+#  else
+    len = vsprintf(buf, format, va);
+    va_end(va);
+#  endif
+#else
+#  ifdef HAS_vsnprintf_void
+    (void)vsnprintf(buf, sizeof(buf), format, va);
+    va_end(va);
+    len = strlen(buf);
+#  else
+    len = vsnprintf(buf, sizeof(buf), format, va);
+    va_end(va);
+#  endif
+#endif
+    if (len <= 0 || len >= (int)sizeof(buf) || buf[sizeof(buf) - 1] != 0)
+        return 0;
+    return gzwrite(file, buf, (unsigned)len);
+}
+#else /* not ANSI C */
+
+int ZEXPORTVA gzprintf (file, format, a1, a2, a3, a4, a5, a6, a7, a8, a9, a10,
+                       a11, a12, a13, a14, a15, a16, a17, a18, a19, a20)
+    gzFile file;
+    const char *format;
+    int a1, a2, a3, a4, a5, a6, a7, a8, a9, a10,
+        a11, a12, a13, a14, a15, a16, a17, a18, a19, a20;
+{
+    char buf[Z_PRINTF_BUFSIZE];
+    int len;
+
+    buf[sizeof(buf) - 1] = 0;
+#ifdef NO_snprintf
+#  ifdef HAS_sprintf_void
+    sprintf(buf, format, a1, a2, a3, a4, a5, a6, a7, a8,
+            a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20);
+    for (len = 0; len < sizeof(buf); len++)
+        if (buf[len] == 0) break;
+#  else
+    len = sprintf(buf, format, a1, a2, a3, a4, a5, a6, a7, a8,
+                a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20);
+#  endif
+#else
+#  ifdef HAS_snprintf_void
+    snprintf(buf, sizeof(buf), format, a1, a2, a3, a4, a5, a6, a7, a8,
+             a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20);
+    len = strlen(buf);
+#  else
+    len = snprintf(buf, sizeof(buf), format, a1, a2, a3, a4, a5, a6, a7, a8,
+                 a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20);
+#  endif
+#endif
+    if (len <= 0 || len >= sizeof(buf) || buf[sizeof(buf) - 1] != 0)
+        return 0;
+    return gzwrite(file, buf, len);
+}
+#endif
+
+/* ===========================================================================
+      Writes c, converted to an unsigned char, into the compressed file.
+   gzputc returns the value that was written, or -1 in case of error.
+*/
+int ZEXPORT gzputc(gzFile file, int c)
+{
+    unsigned char cc = (unsigned char) c; /* required for big endian systems */
+
+    return gzwrite(file, &cc, 1) == 1 ? (int)cc : -1;
+}
+
+
+/* ===========================================================================
+      Writes the given null-terminated string to the compressed file, excluding
+   the terminating null character.
+      gzputs returns the number of characters written, or -1 in case of error.
+*/
+int ZEXPORT gzputs(gzFile file, const char *s)
+{
+    return gzwrite(file, (char*)s, (unsigned)strlen(s));
+}
+
+
+/* ===========================================================================
+     Flushes all pending output into the compressed file. The parameter
+   flush is as in the deflate() function.
+*/
+local int do_flush (gzFile file, int flush)
+{
+    uInt len;
+    int done = 0;
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL || s->mode != 'w') return Z_STREAM_ERROR;
+
+    s->stream.avail_in = 0; /* should be zero already anyway */
+
+    for (;;) {
+        len = Z_BUFSIZE - s->stream.avail_out;
+
+        if (len != 0) {
+            if ((uInt)fwrite(s->outbuf, 1, len, s->file) != len) {
+                s->z_err = Z_ERRNO;
+                return Z_ERRNO;
+            }
+            s->stream.next_out = s->outbuf;
+            s->stream.avail_out = Z_BUFSIZE;
+        }
+        if (done) break;
+        s->out += s->stream.avail_out;
+        s->z_err = deflate(&(s->stream), flush);
+        s->out -= s->stream.avail_out;
+
+        /* Ignore the second of two consecutive flushes: */
+        if (len == 0 && s->z_err == Z_BUF_ERROR) s->z_err = Z_OK;
+
+        /* deflate has finished flushing only when it hasn't used up
+         * all the available space in the output buffer:
+         */
+        done = (s->stream.avail_out != 0 || s->z_err == Z_STREAM_END);
+
+        if (s->z_err != Z_OK && s->z_err != Z_STREAM_END) break;
+    }
+    return  s->z_err == Z_STREAM_END ? Z_OK : s->z_err;
+}
+
+int ZEXPORT gzflush (gzFile file, int flush)
+{
+    gz_stream *s = (gz_stream*)file;
+    int err = do_flush (file, flush);
+
+    if (err) return err;
+    fflush(s->file);
+    return  s->z_err == Z_STREAM_END ? Z_OK : s->z_err;
+}
+#endif /* NO_GZCOMPRESS */
+
+/* ===========================================================================
+      Sets the starting position for the next gzread or gzwrite on the given
+   compressed file. The offset represents a number of bytes in the
+      gzseek returns the resulting offset location as measured in bytes from
+   the beginning of the uncompressed stream, or -1 in case of error.
+      SEEK_END is not implemented, returns error.
+      In this version of the library, gzseek can be extremely slow.
+*/
+z_off_t ZEXPORT gzseek (gzFile file, z_off_t offset, int whence)
+{
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL || whence == SEEK_END ||
+        s->z_err == Z_ERRNO || s->z_err == Z_DATA_ERROR) {
+        return -1L;
+    }
+
+    if (s->mode == 'w') {
+#ifdef NO_GZCOMPRESS
+        return -1L;
+#else
+        if (whence == SEEK_SET) {
+            offset -= s->in;
+        }
+        if (offset < 0) return -1L;
+
+        /* At this point, offset is the number of zero bytes to write. */
+        if (s->inbuf == Z_NULL) {
+            s->inbuf = (Byte*)ALLOC(Z_BUFSIZE); /* for seeking */
+            if (s->inbuf == Z_NULL) return -1L;
+            zmemzero(s->inbuf, Z_BUFSIZE);
+        }
+        while (offset > 0)  {
+            uInt size = Z_BUFSIZE;
+            if (offset < Z_BUFSIZE) size = (uInt)offset;
+
+            size = gzwrite(file, s->inbuf, size);
+            if (size == 0) return -1L;
+
+            offset -= size;
+        }
+        return s->in;
+#endif
+    }
+    /* Rest of function is for reading only */
+
+    /* compute absolute position */
+    if (whence == SEEK_CUR) {
+        offset += s->out;
+    }
+    if (offset < 0) return -1L;
+
+    if (s->transparent) {
+        /* map to fseek */
+        s->back = EOF;
+        s->stream.avail_in = 0;
+        s->stream.next_in = s->inbuf;
+        if (fseek(s->file, offset, SEEK_SET) < 0) return -1L;
+
+        s->in = s->out = offset;
+        return offset;
+    }
+
+    /* For a negative seek, rewind and use positive seek */
+    if (offset >= s->out) {
+        offset -= s->out;
+    } else if (gzrewind(file) < 0) {
+        return -1L;
+    }
+    /* offset is now the number of bytes to skip. */
+
+    if (offset != 0 && s->outbuf == Z_NULL) {
+        s->outbuf = (Byte*)ALLOC(Z_BUFSIZE);
+        if (s->outbuf == Z_NULL) return -1L;
+    }
+    if (offset && s->back != EOF) {
+        s->back = EOF;
+        s->out++;
+        offset--;
+        if (s->last) s->z_err = Z_STREAM_END;
+    }
+    while (offset > 0)  {
+        int size = Z_BUFSIZE;
+        if (offset < Z_BUFSIZE) size = (int)offset;
+
+        size = gzread(file, s->outbuf, (uInt)size);
+        if (size <= 0) return -1L;
+        offset -= size;
+    }
+    return s->out;
+}
+
+/* ===========================================================================
+     Rewinds input file.
+*/
+int ZEXPORT gzrewind (gzFile file)
+{
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL || s->mode != 'r') return -1;
+
+    s->z_err = Z_OK;
+    s->z_eof = 0;
+    s->back = EOF;
+    s->stream.avail_in = 0;
+    s->stream.next_in = s->inbuf;
+    s->crc = crc32(0L, Z_NULL, 0);
+    if (!s->transparent) (void)inflateReset(&s->stream);
+    s->in = 0;
+    s->out = 0;
+    return fseek(s->file, s->start, SEEK_SET);
+}
+
+/* ===========================================================================
+     Returns the starting position for the next gzread or gzwrite on the
+   given compressed file. This position represents a number of bytes in the
+   uncompressed data stream.
+*/
+z_off_t ZEXPORT gztell (gzFile file)
+{
+    return gzseek(file, 0L, SEEK_CUR);
+}
+
+/* ===========================================================================
+     Returns 1 when EOF has previously been detected reading the given
+   input stream, otherwise zero.
+*/
+int ZEXPORT gzeof (gzFile file)
+{
+    gz_stream *s = (gz_stream*)file;
+
+    /* With concatenated compressed files that can have embedded
+     * crc trailers, z_eof is no longer the only/best indicator of EOF
+     * on a gz_stream. Handle end-of-stream error explicitly here.
+     */
+    if (s == NULL || s->mode != 'r') return 0;
+    if (s->z_eof) return 1;
+    return s->z_err == Z_STREAM_END;
+}
+
+/* ===========================================================================
+     Returns 1 if reading and doing so transparently, otherwise zero.
+*/
+int ZEXPORT gzdirect (gzFile file)
+{
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL || s->mode != 'r') return 0;
+    return s->transparent;
+}
+
+/* ===========================================================================
+   Outputs a long in LSB order to the given file
+*/
+local void putLong (FILE *file, uLong x)
+{
+    int n;
+    for (n = 0; n < 4; n++) {
+        fputc((int)(x & 0xff), file);
+        x >>= 8;
+    }
+}
+
+/* ===========================================================================
+   Reads a long in LSB order from the given gz_stream. Sets z_err in case
+   of error.
+*/
+local uLong getLong (gz_stream *s)
+{
+    uLong x = (uLong)get_byte(s);
+    int c;
+
+    x += ((uLong)get_byte(s))<<8;
+    x += ((uLong)get_byte(s))<<16;
+    c = get_byte(s);
+    if (c == EOF) s->z_err = Z_DATA_ERROR;
+    x += ((uLong)c)<<24;
+    return x;
+}
+
+/* ===========================================================================
+     Flushes all pending output if necessary, closes the compressed file
+   and deallocates all the (de)compression state.
+*/
+int ZEXPORT gzclose (gzFile file)
+{
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL) return Z_STREAM_ERROR;
+
+    if (s->mode == 'w') {
+#ifdef NO_GZCOMPRESS
+        return Z_STREAM_ERROR;
+#else
+        if (do_flush (file, Z_FINISH) != Z_OK)
+            return destroy((gz_stream*)file);
+
+        putLong (s->file, s->crc);
+        putLong (s->file, (uLong)(s->in & 0xffffffff));
+#endif
+    }
+    return destroy((gz_stream*)file);
+}
+
+#ifdef STDC
+#  define zstrerror(errnum) strerror(errnum)
+#else
+#  define zstrerror(errnum) ""
+#endif
+
+/* ===========================================================================
+     Returns the error message for the last error which occurred on the
+   given compressed file. errnum is set to zlib error number. If an
+   error occurred in the file system and not in the compression library,
+   errnum is set to Z_ERRNO and the application may consult errno
+   to get the exact error code.
+*/
+const char * ZEXPORT gzerror (gzFile file, int *errnum)
+{
+    char *m;
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL) {
+        *errnum = Z_STREAM_ERROR;
+        return (const char*)ERR_MSG(Z_STREAM_ERROR);
+    }
+    *errnum = s->z_err;
+    if (*errnum == Z_OK) return (const char*)"";
+
+    m = (char*)(*errnum == Z_ERRNO ? zstrerror(errno) : s->stream.msg);
+
+    if (m == NULL || *m == '\0') m = (char*)ERR_MSG(s->z_err);
+
+    TRYFREE(s->msg);
+    s->msg = (char*)ALLOC(strlen(s->path) + strlen(m) + 3);
+    if (s->msg == Z_NULL) return (const char*)ERR_MSG(Z_MEM_ERROR);
+    strcpy(s->msg, s->path);
+    strcat(s->msg, ": ");
+    strcat(s->msg, m);
+    return (const char*)s->msg;
+}
+
+/* ===========================================================================
+     Clear the error and end-of-file flags, and do the same for the real file.
+*/
+void ZEXPORT gzclearerr (gzFile file)
+{
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL) return;
+    if (s->z_err != Z_STREAM_END) s->z_err = Z_OK;
+    s->z_eof = 0;
+    clearerr(s->file);
+}
diff --git a/updater/zlib123/infback.c b/updater/zlib123/infback.c
new file mode 100644
index 0000000..d31fa18
--- /dev/null
+++ b/updater/zlib123/infback.c
@@ -0,0 +1,611 @@
+/* infback.c -- inflate using a call-back interface
+ * Copyright (C) 1995-2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/*
+   This code is largely copied from inflate.c.  Normally either infback.o or
+   inflate.o would be linked into an application--not both.  The interface
+   with inffast.c is retained so that optimized assembler-coded versions of
+   inflate_fast() can be used with either inflate.c or infback.c.
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+#include "inflate.h"
+#include "inffast.h"
+
+/* function prototypes */
+local void fixedtables OF((struct inflate_state FAR *state));
+
+/*
+   strm provides memory allocation functions in zalloc and zfree, or
+   Z_NULL to use the library memory allocation functions.
+
+   windowBits is in the range 8..15, and window is a user-supplied
+   window and output buffer that is 2**windowBits bytes.
+ */
+int ZEXPORT inflateBackInit_(z_streamp strm, int windowBits, unsigned char FAR *window, const char *version, int stream_size)
+{
+    struct inflate_state FAR *state;
+
+    if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
+        stream_size != (int)(sizeof(z_stream)))
+        return Z_VERSION_ERROR;
+    if (strm == Z_NULL || window == Z_NULL ||
+        windowBits < 8 || windowBits > 15)
+        return Z_STREAM_ERROR;
+    strm->msg = Z_NULL;                 /* in case we return an error */
+    if (strm->zalloc == (alloc_func)0) {
+        strm->zalloc = zcalloc;
+        strm->opaque = (voidpf)0;
+    }
+    if (strm->zfree == (free_func)0) strm->zfree = zcfree;
+    state = (struct inflate_state FAR *)ZALLOC(strm, 1,
+                                               sizeof(struct inflate_state));
+    if (state == Z_NULL) return Z_MEM_ERROR;
+    Tracev((stderr, "inflate: allocated\n"));
+    strm->state = (struct internal_state FAR *)state;
+    state->dmax = 32768U;
+    state->wbits = windowBits;
+    state->wsize = 1U << windowBits;
+    state->window = window;
+    state->write = 0;
+    state->whave = 0;
+    return Z_OK;
+}
+
+/*
+   Return state with length and distance decoding tables and index sizes set to
+   fixed code decoding.  Normally this returns fixed tables from inffixed.h.
+   If BUILDFIXED is defined, then instead this routine builds the tables the
+   first time it's called, and returns those tables the first time and
+   thereafter.  This reduces the size of the code by about 2K bytes, in
+   exchange for a little execution time.  However, BUILDFIXED should not be
+   used for threaded applications, since the rewriting of the tables and virgin
+   may not be thread-safe.
+ */
+local void fixedtables(struct inflate_state FAR *state)
+{
+#ifdef BUILDFIXED
+    static int virgin = 1;
+    static code *lenfix, *distfix;
+    static code fixed[544];
+
+    /* build fixed huffman tables if first call (may not be thread safe) */
+    if (virgin) {
+        unsigned sym, bits;
+        static code *next;
+
+        /* literal/length table */
+        sym = 0;
+        while (sym < 144) state->lens[sym++] = 8;
+        while (sym < 256) state->lens[sym++] = 9;
+        while (sym < 280) state->lens[sym++] = 7;
+        while (sym < 288) state->lens[sym++] = 8;
+        next = fixed;
+        lenfix = next;
+        bits = 9;
+        inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
+
+        /* distance table */
+        sym = 0;
+        while (sym < 32) state->lens[sym++] = 5;
+        distfix = next;
+        bits = 5;
+        inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
+
+        /* do this just once */
+        virgin = 0;
+    }
+#else /* !BUILDFIXED */
+#   include "inffixed.h"
+#endif /* BUILDFIXED */
+    state->lencode = lenfix;
+    state->lenbits = 9;
+    state->distcode = distfix;
+    state->distbits = 5;
+}
+
+/* Macros for inflateBack(): */
+
+/* Load returned state from inflate_fast() */
+#define LOAD() \
+    do { \
+        put = strm->next_out; \
+        left = strm->avail_out; \
+        next = strm->next_in; \
+        have = strm->avail_in; \
+        hold = state->hold; \
+        bits = state->bits; \
+    } while (0)
+
+/* Set state from registers for inflate_fast() */
+#define RESTORE() \
+    do { \
+        strm->next_out = put; \
+        strm->avail_out = left; \
+        strm->next_in = next; \
+        strm->avail_in = have; \
+        state->hold = hold; \
+        state->bits = bits; \
+    } while (0)
+
+/* Clear the input bit accumulator */
+#define INITBITS() \
+    do { \
+        hold = 0; \
+        bits = 0; \
+    } while (0)
+
+/* Assure that some input is available.  If input is requested, but denied,
+   then return a Z_BUF_ERROR from inflateBack(). */
+#define PULL() \
+    do { \
+        if (have == 0) { \
+            have = in(in_desc, &next); \
+            if (have == 0) { \
+                next = Z_NULL; \
+                ret = Z_BUF_ERROR; \
+                goto inf_leave; \
+            } \
+        } \
+    } while (0)
+
+/* Get a byte of input into the bit accumulator, or return from inflateBack()
+   with an error if there is no input available. */
+#define PULLBYTE() \
+    do { \
+        PULL(); \
+        have--; \
+        hold += (unsigned long)(*next++) << bits; \
+        bits += 8; \
+    } while (0)
+
+/* Assure that there are at least n bits in the bit accumulator.  If there is
+   not enough available input to do that, then return from inflateBack() with
+   an error. */
+#define NEEDBITS(n) \
+    do { \
+        while (bits < (unsigned)(n)) \
+            PULLBYTE(); \
+    } while (0)
+
+/* Return the low n bits of the bit accumulator (n < 16) */
+#define BITS(n) \
+    ((unsigned)hold & ((1U << (n)) - 1))
+
+/* Remove n bits from the bit accumulator */
+#define DROPBITS(n) \
+    do { \
+        hold >>= (n); \
+        bits -= (unsigned)(n); \
+    } while (0)
+
+/* Remove zero to seven bits as needed to go to a byte boundary */
+#define BYTEBITS() \
+    do { \
+        hold >>= bits & 7; \
+        bits -= bits & 7; \
+    } while (0)
+
+/* Assure that some output space is available, by writing out the window
+   if it's full.  If the write fails, return from inflateBack() with a
+   Z_BUF_ERROR. */
+#define ROOM() \
+    do { \
+        if (left == 0) { \
+            put = state->window; \
+            left = state->wsize; \
+            state->whave = left; \
+            if (out(out_desc, put, left)) { \
+                ret = Z_BUF_ERROR; \
+                goto inf_leave; \
+            } \
+        } \
+    } while (0)
+
+/*
+   strm provides the memory allocation functions and window buffer on input,
+   and provides information on the unused input on return.  For Z_DATA_ERROR
+   returns, strm will also provide an error message.
+
+   in() and out() are the call-back input and output functions.  When
+   inflateBack() needs more input, it calls in().  When inflateBack() has
+   filled the window with output, or when it completes with data in the
+   window, it calls out() to write out the data.  The application must not
+   change the provided input until in() is called again or inflateBack()
+   returns.  The application must not change the window/output buffer until
+   inflateBack() returns.
+
+   in() and out() are called with a descriptor parameter provided in the
+   inflateBack() call.  This parameter can be a structure that provides the
+   information required to do the read or write, as well as accumulated
+   information on the input and output such as totals and check values.
+
+   in() should return zero on failure.  out() should return non-zero on
+   failure.  If either in() or out() fails, than inflateBack() returns a
+   Z_BUF_ERROR.  strm->next_in can be checked for Z_NULL to see whether it
+   was in() or out() that caused in the error.  Otherwise,  inflateBack()
+   returns Z_STREAM_END on success, Z_DATA_ERROR for an deflate format
+   error, or Z_MEM_ERROR if it could not allocate memory for the state.
+   inflateBack() can also return Z_STREAM_ERROR if the input parameters
+   are not correct, i.e. strm is Z_NULL or the state was not initialized.
+ */
+int ZEXPORT inflateBack(z_streamp strm, in_func in, void FAR *in_desc, out_func out, void FAR *out_desc)
+{
+    struct inflate_state FAR *state;
+    unsigned char FAR *next;    /* next input */
+    unsigned char FAR *put;     /* next output */
+    unsigned have, left;        /* available input and output */
+    unsigned long hold;         /* bit buffer */
+    unsigned bits;              /* bits in bit buffer */
+    unsigned copy;              /* number of stored or match bytes to copy */
+    unsigned char FAR *from;    /* where to copy match bytes from */
+    code thisc;                  /* current decoding table entry */
+    code last;                  /* parent table entry */
+    unsigned len;               /* length to copy for repeats, bits to drop */
+    int ret;                    /* return code */
+    static const unsigned short order[19] = /* permutation of code lengths */
+        {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
+
+    /* Check that the strm exists and that the state was initialized */
+    if (strm == Z_NULL || strm->state == Z_NULL)
+        return Z_STREAM_ERROR;
+    state = (struct inflate_state FAR *)strm->state;
+
+    /* Reset the state */
+    strm->msg = Z_NULL;
+    state->mode = TYPE;
+    state->last = 0;
+    state->whave = 0;
+    next = strm->next_in;
+    have = next != Z_NULL ? strm->avail_in : 0;
+    hold = 0;
+    bits = 0;
+    put = state->window;
+    left = state->wsize;
+
+    /* Inflate until end of block marked as last */
+    for (;;)
+        switch (state->mode) {
+        case TYPE:
+            /* determine and dispatch block type */
+            if (state->last) {
+                BYTEBITS();
+                state->mode = DONE;
+                break;
+            }
+            NEEDBITS(3);
+            state->last = BITS(1);
+            DROPBITS(1);
+            switch (BITS(2)) {
+            case 0:                             /* stored block */
+                Tracev((stderr, "inflate:     stored block%s\n",
+                        state->last ? " (last)" : ""));
+                state->mode = STORED;
+                break;
+            case 1:                             /* fixed block */
+                fixedtables(state);
+                Tracev((stderr, "inflate:     fixed codes block%s\n",
+                        state->last ? " (last)" : ""));
+                state->mode = LEN;              /* decode codes */
+                break;
+            case 2:                             /* dynamic block */
+                Tracev((stderr, "inflate:     dynamic codes block%s\n",
+                        state->last ? " (last)" : ""));
+                state->mode = TABLE;
+                break;
+            case 3:
+                strm->msg = (char *)"invalid block type";
+                state->mode = BAD;
+            }
+            DROPBITS(2);
+            break;
+
+        case STORED:
+            /* get and verify stored block length */
+            BYTEBITS();                         /* go to byte boundary */
+            NEEDBITS(32);
+            if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
+                strm->msg = (char *)"invalid stored block lengths";
+                state->mode = BAD;
+                break;
+            }
+            state->length = (unsigned)hold & 0xffff;
+            Tracev((stderr, "inflate:       stored length %u\n",
+                    state->length));
+            INITBITS();
+
+            /* copy stored block from input to output */
+            while (state->length != 0) {
+                copy = state->length;
+                PULL();
+                ROOM();
+                if (copy > have) copy = have;
+                if (copy > left) copy = left;
+                zmemcpy(put, next, copy);
+                have -= copy;
+                next += copy;
+                left -= copy;
+                put += copy;
+                state->length -= copy;
+            }
+            Tracev((stderr, "inflate:       stored end\n"));
+            state->mode = TYPE;
+            break;
+
+        case TABLE:
+            /* get dynamic table entries descriptor */
+            NEEDBITS(14);
+            state->nlen = BITS(5) + 257;
+            DROPBITS(5);
+            state->ndist = BITS(5) + 1;
+            DROPBITS(5);
+            state->ncode = BITS(4) + 4;
+            DROPBITS(4);
+#ifndef PKZIP_BUG_WORKAROUND
+            if (state->nlen > 286 || state->ndist > 30) {
+                strm->msg = (char *)"too many length or distance symbols";
+                state->mode = BAD;
+                break;
+            }
+#endif
+            Tracev((stderr, "inflate:       table sizes ok\n"));
+
+            /* get code length code lengths (not a typo) */
+            state->have = 0;
+            while (state->have < state->ncode) {
+                NEEDBITS(3);
+                state->lens[order[state->have++]] = (unsigned short)BITS(3);
+                DROPBITS(3);
+            }
+            while (state->have < 19)
+                state->lens[order[state->have++]] = 0;
+            state->next = state->codes;
+            state->lencode = (code const FAR *)(state->next);
+            state->lenbits = 7;
+            ret = inflate_table(CODES, state->lens, 19, &(state->next),
+                                &(state->lenbits), state->work);
+            if (ret) {
+                strm->msg = (char *)"invalid code lengths set";
+                state->mode = BAD;
+                break;
+            }
+            Tracev((stderr, "inflate:       code lengths ok\n"));
+
+            /* get length and distance code code lengths */
+            state->have = 0;
+            while (state->have < state->nlen + state->ndist) {
+                for (;;) {
+                    thisc = state->lencode[BITS(state->lenbits)];
+                    if ((unsigned)(thisc.bits) <= bits) break;
+                    PULLBYTE();
+                }
+                if (thisc.val < 16) {
+                    NEEDBITS(thisc.bits);
+                    DROPBITS(thisc.bits);
+                    state->lens[state->have++] = thisc.val;
+                }
+                else {
+                    if (thisc.val == 16) {
+                        NEEDBITS(thisc.bits + 2);
+                        DROPBITS(thisc.bits);
+                        if (state->have == 0) {
+                            strm->msg = (char *)"invalid bit length repeat";
+                            state->mode = BAD;
+                            break;
+                        }
+                        len = (unsigned)(state->lens[state->have - 1]);
+                        copy = 3 + BITS(2);
+                        DROPBITS(2);
+                    }
+                    else if (thisc.val == 17) {
+                        NEEDBITS(thisc.bits + 3);
+                        DROPBITS(thisc.bits);
+                        len = 0;
+                        copy = 3 + BITS(3);
+                        DROPBITS(3);
+                    }
+                    else {
+                        NEEDBITS(thisc.bits + 7);
+                        DROPBITS(thisc.bits);
+                        len = 0;
+                        copy = 11 + BITS(7);
+                        DROPBITS(7);
+                    }
+                    if (state->have + copy > state->nlen + state->ndist) {
+                        strm->msg = (char *)"invalid bit length repeat";
+                        state->mode = BAD;
+                        break;
+                    }
+                    while (copy--)
+                        state->lens[state->have++] = (unsigned short)len;
+                }
+            }
+
+            /* handle error breaks in while */
+            if (state->mode == BAD) break;
+
+            /* build code tables */
+            state->next = state->codes;
+            state->lencode = (code const FAR *)(state->next);
+            state->lenbits = 9;
+            ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
+                                &(state->lenbits), state->work);
+            if (ret) {
+                strm->msg = (char *)"invalid literal/lengths set";
+                state->mode = BAD;
+                break;
+            }
+            state->distcode = (code const FAR *)(state->next);
+            state->distbits = 6;
+            ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
+                            &(state->next), &(state->distbits), state->work);
+            if (ret) {
+                strm->msg = (char *)"invalid distances set";
+                state->mode = BAD;
+                break;
+            }
+            Tracev((stderr, "inflate:       codes ok\n"));
+            state->mode = LEN;
+
+        case LEN:
+            /* use inflate_fast() if we have enough input and output */
+            if (have >= 6 && left >= 258) {
+                RESTORE();
+                if (state->whave < state->wsize)
+                    state->whave = state->wsize - left;
+                inflate_fast(strm, state->wsize);
+                LOAD();
+                break;
+            }
+
+            /* get a literal, length, or end-of-block code */
+            for (;;) {
+                thisc = state->lencode[BITS(state->lenbits)];
+                if ((unsigned)(thisc.bits) <= bits) break;
+                PULLBYTE();
+            }
+            if (thisc.op && (thisc.op & 0xf0) == 0) {
+                last = thisc;
+                for (;;) {
+                    thisc = state->lencode[last.val +
+                            (BITS(last.bits + last.op) >> last.bits)];
+                    if ((unsigned)(last.bits + thisc.bits) <= bits) break;
+                    PULLBYTE();
+                }
+                DROPBITS(last.bits);
+            }
+            DROPBITS(thisc.bits);
+            state->length = (unsigned)thisc.val;
+
+            /* process literal */
+            if (thisc.op == 0) {
+                Tracevv((stderr, thisc.val >= 0x20 && thisc.val < 0x7f ?
+                        "inflate:         literal '%c'\n" :
+                        "inflate:         literal 0x%02x\n", thisc.val));
+                ROOM();
+                *put++ = (unsigned char)(state->length);
+                left--;
+                state->mode = LEN;
+                break;
+            }
+
+            /* process end of block */
+            if (thisc.op & 32) {
+                Tracevv((stderr, "inflate:         end of block\n"));
+                state->mode = TYPE;
+                break;
+            }
+
+            /* invalid code */
+            if (thisc.op & 64) {
+                strm->msg = (char *)"invalid literal/length code";
+                state->mode = BAD;
+                break;
+            }
+
+            /* length code -- get extra bits, if any */
+            state->extra = (unsigned)(thisc.op) & 15;
+            if (state->extra != 0) {
+                NEEDBITS(state->extra);
+                state->length += BITS(state->extra);
+                DROPBITS(state->extra);
+            }
+            Tracevv((stderr, "inflate:         length %u\n", state->length));
+
+            /* get distance code */
+            for (;;) {
+                thisc = state->distcode[BITS(state->distbits)];
+                if ((unsigned)(thisc.bits) <= bits) break;
+                PULLBYTE();
+            }
+            if ((thisc.op & 0xf0) == 0) {
+                last = thisc;
+                for (;;) {
+                    thisc = state->distcode[last.val +
+                            (BITS(last.bits + last.op) >> last.bits)];
+                    if ((unsigned)(last.bits + thisc.bits) <= bits) break;
+                    PULLBYTE();
+                }
+                DROPBITS(last.bits);
+            }
+            DROPBITS(thisc.bits);
+            if (thisc.op & 64) {
+                strm->msg = (char *)"invalid distance code";
+                state->mode = BAD;
+                break;
+            }
+            state->offset = (unsigned)thisc.val;
+
+            /* get distance extra bits, if any */
+            state->extra = (unsigned)(thisc.op) & 15;
+            if (state->extra != 0) {
+                NEEDBITS(state->extra);
+                state->offset += BITS(state->extra);
+                DROPBITS(state->extra);
+            }
+            if (state->offset > state->wsize - (state->whave < state->wsize ?
+                                                left : 0)) {
+                strm->msg = (char *)"invalid distance too far back";
+                state->mode = BAD;
+                break;
+            }
+            Tracevv((stderr, "inflate:         distance %u\n", state->offset));
+
+            /* copy match from window to output */
+            do {
+                ROOM();
+                copy = state->wsize - state->offset;
+                if (copy < left) {
+                    from = put + copy;
+                    copy = left - copy;
+                }
+                else {
+                    from = put - state->offset;
+                    copy = left;
+                }
+                if (copy > state->length) copy = state->length;
+                state->length -= copy;
+                left -= copy;
+                do {
+                    *put++ = *from++;
+                } while (--copy);
+            } while (state->length != 0);
+            break;
+
+        case DONE:
+            /* inflate stream terminated properly -- write leftover output */
+            ret = Z_STREAM_END;
+            if (left < state->wsize) {
+                if (out(out_desc, state->window, state->wsize - left))
+                    ret = Z_BUF_ERROR;
+            }
+            goto inf_leave;
+
+        case BAD:
+            ret = Z_DATA_ERROR;
+            goto inf_leave;
+
+        default:                /* can't happen, but makes compilers happy */
+            ret = Z_STREAM_ERROR;
+            goto inf_leave;
+        }
+
+    /* Return unused input */
+  inf_leave:
+    strm->next_in = next;
+    strm->avail_in = have;
+    return ret;
+}
+
+int ZEXPORT inflateBackEnd(z_streamp strm)
+{
+    if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
+        return Z_STREAM_ERROR;
+    ZFREE(strm, strm->state);
+    strm->state = Z_NULL;
+    Tracev((stderr, "inflate: end\n"));
+    return Z_OK;
+}
diff --git a/updater/zlib123/inffast.c b/updater/zlib123/inffast.c
new file mode 100644
index 0000000..05d327b
--- /dev/null
+++ b/updater/zlib123/inffast.c
@@ -0,0 +1,316 @@
+/* inffast.c -- fast decoding
+ * Copyright (C) 1995-2004 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+#include "inflate.h"
+#include "inffast.h"
+
+#ifndef ASMINF
+
+/* Allow machine dependent optimization for post-increment or pre-increment.
+   Based on testing to date,
+   Pre-increment preferred for:
+   - PowerPC G3 (Adler)
+   - MIPS R5000 (Randers-Pehrson)
+   Post-increment preferred for:
+   - none
+   No measurable difference:
+   - Pentium III (Anderson)
+   - M68060 (Nikl)
+ */
+#ifdef POSTINC
+#  define OFF 0
+#  define PUP(a) *(a)++
+#else
+#  define OFF 1
+#  define PUP(a) *++(a)
+#endif
+
+/*
+   Decode literal, length, and distance codes and write out the resulting
+   literal and match bytes until either not enough input or output is
+   available, an end-of-block is encountered, or a data error is encountered.
+   When large enough input and output buffers are supplied to inflate(), for
+   example, a 16K input buffer and a 64K output buffer, more than 95% of the
+   inflate execution time is spent in this routine.
+
+   Entry assumptions:
+
+        state->mode == LEN
+        strm->avail_in >= 6
+        strm->avail_out >= 258
+        start >= strm->avail_out
+        state->bits < 8
+
+   On return, state->mode is one of:
+
+        LEN -- ran out of enough output space or enough available input
+        TYPE -- reached end of block code, inflate() to interpret next block
+        BAD -- error in block data
+
+   Notes:
+
+    - The maximum input bits used by a length/distance pair is 15 bits for the
+      length code, 5 bits for the length extra, 15 bits for the distance code,
+      and 13 bits for the distance extra.  This totals 48 bits, or six bytes.
+      Therefore if strm->avail_in >= 6, then there is enough input to avoid
+      checking for available input while decoding.
+
+    - The maximum bytes that a single length/distance pair can output is 258
+      bytes, which is the maximum length that can be coded.  inflate_fast()
+      requires strm->avail_out >= 258 for each loop to avoid checking for
+      output space.
+ */
+void inflate_fast(z_streamp strm, unsigned start)         /* inflate()'s starting value for strm->avail_out */
+{
+    struct inflate_state FAR *state;
+    unsigned char FAR *in;      /* local strm->next_in */
+    unsigned char FAR *last;    /* while in < last, enough input available */
+    unsigned char FAR *out;     /* local strm->next_out */
+    unsigned char FAR *beg;     /* inflate()'s initial strm->next_out */
+    unsigned char FAR *end;     /* while out < end, enough space available */
+#ifdef INFLATE_STRICT
+    unsigned dmax;              /* maximum distance from zlib header */
+#endif
+    unsigned wsize;             /* window size or zero if not using window */
+    unsigned whave;             /* valid bytes in the window */
+    unsigned write;             /* window write index */
+    unsigned char FAR *window;  /* allocated sliding window, if wsize != 0 */
+    unsigned long hold;         /* local strm->hold */
+    unsigned bits;              /* local strm->bits */
+    code const FAR *lcode;      /* local strm->lencode */
+    code const FAR *dcode;      /* local strm->distcode */
+    unsigned lmask;             /* mask for first level of length codes */
+    unsigned dmask;             /* mask for first level of distance codes */
+    code thisc;                  /* retrieved table entry */
+    unsigned op;                /* code bits, operation, extra bits, or */
+                                /*  window position, window bytes to copy */
+    unsigned len;               /* match length, unused bytes */
+    unsigned dist;              /* match distance */
+    unsigned char FAR *from;    /* where to copy match from */
+
+    /* copy state to local variables */
+    state = (struct inflate_state FAR *)strm->state;
+    in = strm->next_in - OFF;
+    last = in + (strm->avail_in - 5);
+    out = strm->next_out - OFF;
+    beg = out - (start - strm->avail_out);
+    end = out + (strm->avail_out - 257);
+#ifdef INFLATE_STRICT
+    dmax = state->dmax;
+#endif
+    wsize = state->wsize;
+    whave = state->whave;
+    write = state->write;
+    window = state->window;
+    hold = state->hold;
+    bits = state->bits;
+    lcode = state->lencode;
+    dcode = state->distcode;
+    lmask = (1U << state->lenbits) - 1;
+    dmask = (1U << state->distbits) - 1;
+
+    /* decode literals and length/distances until end-of-block or not enough
+       input data or output space */
+    do {
+        if (bits < 15) {
+            hold += (unsigned long)(PUP(in)) << bits;
+            bits += 8;
+            hold += (unsigned long)(PUP(in)) << bits;
+            bits += 8;
+        }
+        thisc = lcode[hold & lmask];
+      dolen:
+        op = (unsigned)(thisc.bits);
+        hold >>= op;
+        bits -= op;
+        op = (unsigned)(thisc.op);
+        if (op == 0) {                          /* literal */
+            Tracevv((stderr, thisc.val >= 0x20 && thisc.val < 0x7f ?
+                    "inflate:         literal '%c'\n" :
+                    "inflate:         literal 0x%02x\n", thisc.val));
+            PUP(out) = (unsigned char)(thisc.val);
+        }
+        else if (op & 16) {                     /* length base */
+            len = (unsigned)(thisc.val);
+            op &= 15;                           /* number of extra bits */
+            if (op) {
+                if (bits < op) {
+                    hold += (unsigned long)(PUP(in)) << bits;
+                    bits += 8;
+                }
+                len += (unsigned)hold & ((1U << op) - 1);
+                hold >>= op;
+                bits -= op;
+            }
+            Tracevv((stderr, "inflate:         length %u\n", len));
+            if (bits < 15) {
+                hold += (unsigned long)(PUP(in)) << bits;
+                bits += 8;
+                hold += (unsigned long)(PUP(in)) << bits;
+                bits += 8;
+            }
+            thisc = dcode[hold & dmask];
+          dodist:
+            op = (unsigned)(thisc.bits);
+            hold >>= op;
+            bits -= op;
+            op = (unsigned)(thisc.op);
+            if (op & 16) {                      /* distance base */
+                dist = (unsigned)(thisc.val);
+                op &= 15;                       /* number of extra bits */
+                if (bits < op) {
+                    hold += (unsigned long)(PUP(in)) << bits;
+                    bits += 8;
+                    if (bits < op) {
+                        hold += (unsigned long)(PUP(in)) << bits;
+                        bits += 8;
+                    }
+                }
+                dist += (unsigned)hold & ((1U << op) - 1);
+#ifdef INFLATE_STRICT
+                if (dist > dmax) {
+                    strm->msg = (char *)"invalid distance too far back";
+                    state->mode = BAD;
+                    break;
+                }
+#endif
+                hold >>= op;
+                bits -= op;
+                Tracevv((stderr, "inflate:         distance %u\n", dist));
+                op = (unsigned)(out - beg);     /* max distance in output */
+                if (dist > op) {                /* see if copy from window */
+                    op = dist - op;             /* distance back in window */
+                    if (op > whave) {
+                        strm->msg = (char *)"invalid distance too far back";
+                        state->mode = BAD;
+                        break;
+                    }
+                    from = window - OFF;
+                    if (write == 0) {           /* very common case */
+                        from += wsize - op;
+                        if (op < len) {         /* some from window */
+                            len -= op;
+                            do {
+                                PUP(out) = PUP(from);
+                            } while (--op);
+                            from = out - dist;  /* rest from output */
+                        }
+                    }
+                    else if (write < op) {      /* wrap around window */
+                        from += wsize + write - op;
+                        op -= write;
+                        if (op < len) {         /* some from end of window */
+                            len -= op;
+                            do {
+                                PUP(out) = PUP(from);
+                            } while (--op);
+                            from = window - OFF;
+                            if (write < len) {  /* some from start of window */
+                                op = write;
+                                len -= op;
+                                do {
+                                    PUP(out) = PUP(from);
+                                } while (--op);
+                                from = out - dist;      /* rest from output */
+                            }
+                        }
+                    }
+                    else {                      /* contiguous in window */
+                        from += write - op;
+                        if (op < len) {         /* some from window */
+                            len -= op;
+                            do {
+                                PUP(out) = PUP(from);
+                            } while (--op);
+                            from = out - dist;  /* rest from output */
+                        }
+                    }
+                    while (len > 2) {
+                        PUP(out) = PUP(from);
+                        PUP(out) = PUP(from);
+                        PUP(out) = PUP(from);
+                        len -= 3;
+                    }
+                    if (len) {
+                        PUP(out) = PUP(from);
+                        if (len > 1)
+                            PUP(out) = PUP(from);
+                    }
+                }
+                else {
+                    from = out - dist;          /* copy direct from output */
+                    do {                        /* minimum length is three */
+                        PUP(out) = PUP(from);
+                        PUP(out) = PUP(from);
+                        PUP(out) = PUP(from);
+                        len -= 3;
+                    } while (len > 2);
+                    if (len) {
+                        PUP(out) = PUP(from);
+                        if (len > 1)
+                            PUP(out) = PUP(from);
+                    }
+                }
+            }
+            else if ((op & 64) == 0) {          /* 2nd level distance code */
+                thisc = dcode[thisc.val + (hold & ((1U << op) - 1))];
+                goto dodist;
+            }
+            else {
+                strm->msg = (char *)"invalid distance code";
+                state->mode = BAD;
+                break;
+            }
+        }
+        else if ((op & 64) == 0) {              /* 2nd level length code */
+            thisc = lcode[thisc.val + (hold & ((1U << op) - 1))];
+            goto dolen;
+        }
+        else if (op & 32) {                     /* end-of-block */
+            Tracevv((stderr, "inflate:         end of block\n"));
+            state->mode = TYPE;
+            break;
+        }
+        else {
+            strm->msg = (char *)"invalid literal/length code";
+            state->mode = BAD;
+            break;
+        }
+    } while (in < last && out < end);
+
+    /* return unused bytes (on entry, bits < 8, so in won't go too far back) */
+    len = bits >> 3;
+    in -= len;
+    bits -= len << 3;
+    hold &= (1U << bits) - 1;
+
+    /* update state and return */
+    strm->next_in = in + OFF;
+    strm->next_out = out + OFF;
+    strm->avail_in = (unsigned)(in < last ? 5 + (last - in) : 5 - (in - last));
+    strm->avail_out = (unsigned)(out < end ?
+                                 257 + (end - out) : 257 - (out - end));
+    state->hold = hold;
+    state->bits = bits;
+    return;
+}
+
+/*
+   inflate_fast() speedups that turned out slower (on a PowerPC G3 750CXe):
+   - Using bit fields for code structure
+   - Different op definition to avoid & for extra bits (do & for table bits)
+   - Three separate decoding do-loops for direct, window, and write == 0
+   - Special case for distance > 1 copies to do overlapped load and store copy
+   - Explicit branch predictions (based on measured branch probabilities)
+   - Deferring match copy and interspersed it with decoding subsequent codes
+   - Swapping literal/length else
+   - Swapping window/direct else
+   - Larger unrolled copy loops (three is about right)
+   - Moving len -= 3 statement into middle of loop
+ */
+
+#endif /* !ASMINF */
diff --git a/updater/zlib123/inffast.h b/updater/zlib123/inffast.h
new file mode 100644
index 0000000..614fa78
--- /dev/null
+++ b/updater/zlib123/inffast.h
@@ -0,0 +1,11 @@
+/* inffast.h -- header to use inffast.c
+ * Copyright (C) 1995-2003 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+   part of the implementation of the compression library and is
+   subject to change. Applications should only use zlib.h.
+ */
+
+void inflate_fast OF((z_streamp strm, unsigned start));
diff --git a/updater/zlib123/inffixed.h b/updater/zlib123/inffixed.h
new file mode 100644
index 0000000..423d5c5
--- /dev/null
+++ b/updater/zlib123/inffixed.h
@@ -0,0 +1,94 @@
+    /* inffixed.h -- table for decoding fixed codes
+     * Generated automatically by makefixed().
+     */
+
+    /* WARNING: this file should *not* be used by applications. It
+       is part of the implementation of the compression library and
+       is subject to change. Applications should only use zlib.h.
+     */
+
+    static const code lenfix[512] = {
+        {96,7,0},{0,8,80},{0,8,16},{20,8,115},{18,7,31},{0,8,112},{0,8,48},
+        {0,9,192},{16,7,10},{0,8,96},{0,8,32},{0,9,160},{0,8,0},{0,8,128},
+        {0,8,64},{0,9,224},{16,7,6},{0,8,88},{0,8,24},{0,9,144},{19,7,59},
+        {0,8,120},{0,8,56},{0,9,208},{17,7,17},{0,8,104},{0,8,40},{0,9,176},
+        {0,8,8},{0,8,136},{0,8,72},{0,9,240},{16,7,4},{0,8,84},{0,8,20},
+        {21,8,227},{19,7,43},{0,8,116},{0,8,52},{0,9,200},{17,7,13},{0,8,100},
+        {0,8,36},{0,9,168},{0,8,4},{0,8,132},{0,8,68},{0,9,232},{16,7,8},
+        {0,8,92},{0,8,28},{0,9,152},{20,7,83},{0,8,124},{0,8,60},{0,9,216},
+        {18,7,23},{0,8,108},{0,8,44},{0,9,184},{0,8,12},{0,8,140},{0,8,76},
+        {0,9,248},{16,7,3},{0,8,82},{0,8,18},{21,8,163},{19,7,35},{0,8,114},
+        {0,8,50},{0,9,196},{17,7,11},{0,8,98},{0,8,34},{0,9,164},{0,8,2},
+        {0,8,130},{0,8,66},{0,9,228},{16,7,7},{0,8,90},{0,8,26},{0,9,148},
+        {20,7,67},{0,8,122},{0,8,58},{0,9,212},{18,7,19},{0,8,106},{0,8,42},
+        {0,9,180},{0,8,10},{0,8,138},{0,8,74},{0,9,244},{16,7,5},{0,8,86},
+        {0,8,22},{64,8,0},{19,7,51},{0,8,118},{0,8,54},{0,9,204},{17,7,15},
+        {0,8,102},{0,8,38},{0,9,172},{0,8,6},{0,8,134},{0,8,70},{0,9,236},
+        {16,7,9},{0,8,94},{0,8,30},{0,9,156},{20,7,99},{0,8,126},{0,8,62},
+        {0,9,220},{18,7,27},{0,8,110},{0,8,46},{0,9,188},{0,8,14},{0,8,142},
+        {0,8,78},{0,9,252},{96,7,0},{0,8,81},{0,8,17},{21,8,131},{18,7,31},
+        {0,8,113},{0,8,49},{0,9,194},{16,7,10},{0,8,97},{0,8,33},{0,9,162},
+        {0,8,1},{0,8,129},{0,8,65},{0,9,226},{16,7,6},{0,8,89},{0,8,25},
+        {0,9,146},{19,7,59},{0,8,121},{0,8,57},{0,9,210},{17,7,17},{0,8,105},
+        {0,8,41},{0,9,178},{0,8,9},{0,8,137},{0,8,73},{0,9,242},{16,7,4},
+        {0,8,85},{0,8,21},{16,8,258},{19,7,43},{0,8,117},{0,8,53},{0,9,202},
+        {17,7,13},{0,8,101},{0,8,37},{0,9,170},{0,8,5},{0,8,133},{0,8,69},
+        {0,9,234},{16,7,8},{0,8,93},{0,8,29},{0,9,154},{20,7,83},{0,8,125},
+        {0,8,61},{0,9,218},{18,7,23},{0,8,109},{0,8,45},{0,9,186},{0,8,13},
+        {0,8,141},{0,8,77},{0,9,250},{16,7,3},{0,8,83},{0,8,19},{21,8,195},
+        {19,7,35},{0,8,115},{0,8,51},{0,9,198},{17,7,11},{0,8,99},{0,8,35},
+        {0,9,166},{0,8,3},{0,8,131},{0,8,67},{0,9,230},{16,7,7},{0,8,91},
+        {0,8,27},{0,9,150},{20,7,67},{0,8,123},{0,8,59},{0,9,214},{18,7,19},
+        {0,8,107},{0,8,43},{0,9,182},{0,8,11},{0,8,139},{0,8,75},{0,9,246},
+        {16,7,5},{0,8,87},{0,8,23},{64,8,0},{19,7,51},{0,8,119},{0,8,55},
+        {0,9,206},{17,7,15},{0,8,103},{0,8,39},{0,9,174},{0,8,7},{0,8,135},
+        {0,8,71},{0,9,238},{16,7,9},{0,8,95},{0,8,31},{0,9,158},{20,7,99},
+        {0,8,127},{0,8,63},{0,9,222},{18,7,27},{0,8,111},{0,8,47},{0,9,190},
+        {0,8,15},{0,8,143},{0,8,79},{0,9,254},{96,7,0},{0,8,80},{0,8,16},
+        {20,8,115},{18,7,31},{0,8,112},{0,8,48},{0,9,193},{16,7,10},{0,8,96},
+        {0,8,32},{0,9,161},{0,8,0},{0,8,128},{0,8,64},{0,9,225},{16,7,6},
+        {0,8,88},{0,8,24},{0,9,145},{19,7,59},{0,8,120},{0,8,56},{0,9,209},
+        {17,7,17},{0,8,104},{0,8,40},{0,9,177},{0,8,8},{0,8,136},{0,8,72},
+        {0,9,241},{16,7,4},{0,8,84},{0,8,20},{21,8,227},{19,7,43},{0,8,116},
+        {0,8,52},{0,9,201},{17,7,13},{0,8,100},{0,8,36},{0,9,169},{0,8,4},
+        {0,8,132},{0,8,68},{0,9,233},{16,7,8},{0,8,92},{0,8,28},{0,9,153},
+        {20,7,83},{0,8,124},{0,8,60},{0,9,217},{18,7,23},{0,8,108},{0,8,44},
+        {0,9,185},{0,8,12},{0,8,140},{0,8,76},{0,9,249},{16,7,3},{0,8,82},
+        {0,8,18},{21,8,163},{19,7,35},{0,8,114},{0,8,50},{0,9,197},{17,7,11},
+        {0,8,98},{0,8,34},{0,9,165},{0,8,2},{0,8,130},{0,8,66},{0,9,229},
+        {16,7,7},{0,8,90},{0,8,26},{0,9,149},{20,7,67},{0,8,122},{0,8,58},
+        {0,9,213},{18,7,19},{0,8,106},{0,8,42},{0,9,181},{0,8,10},{0,8,138},
+        {0,8,74},{0,9,245},{16,7,5},{0,8,86},{0,8,22},{64,8,0},{19,7,51},
+        {0,8,118},{0,8,54},{0,9,205},{17,7,15},{0,8,102},{0,8,38},{0,9,173},
+        {0,8,6},{0,8,134},{0,8,70},{0,9,237},{16,7,9},{0,8,94},{0,8,30},
+        {0,9,157},{20,7,99},{0,8,126},{0,8,62},{0,9,221},{18,7,27},{0,8,110},
+        {0,8,46},{0,9,189},{0,8,14},{0,8,142},{0,8,78},{0,9,253},{96,7,0},
+        {0,8,81},{0,8,17},{21,8,131},{18,7,31},{0,8,113},{0,8,49},{0,9,195},
+        {16,7,10},{0,8,97},{0,8,33},{0,9,163},{0,8,1},{0,8,129},{0,8,65},
+        {0,9,227},{16,7,6},{0,8,89},{0,8,25},{0,9,147},{19,7,59},{0,8,121},
+        {0,8,57},{0,9,211},{17,7,17},{0,8,105},{0,8,41},{0,9,179},{0,8,9},
+        {0,8,137},{0,8,73},{0,9,243},{16,7,4},{0,8,85},{0,8,21},{16,8,258},
+        {19,7,43},{0,8,117},{0,8,53},{0,9,203},{17,7,13},{0,8,101},{0,8,37},
+        {0,9,171},{0,8,5},{0,8,133},{0,8,69},{0,9,235},{16,7,8},{0,8,93},
+        {0,8,29},{0,9,155},{20,7,83},{0,8,125},{0,8,61},{0,9,219},{18,7,23},
+        {0,8,109},{0,8,45},{0,9,187},{0,8,13},{0,8,141},{0,8,77},{0,9,251},
+        {16,7,3},{0,8,83},{0,8,19},{21,8,195},{19,7,35},{0,8,115},{0,8,51},
+        {0,9,199},{17,7,11},{0,8,99},{0,8,35},{0,9,167},{0,8,3},{0,8,131},
+        {0,8,67},{0,9,231},{16,7,7},{0,8,91},{0,8,27},{0,9,151},{20,7,67},
+        {0,8,123},{0,8,59},{0,9,215},{18,7,19},{0,8,107},{0,8,43},{0,9,183},
+        {0,8,11},{0,8,139},{0,8,75},{0,9,247},{16,7,5},{0,8,87},{0,8,23},
+        {64,8,0},{19,7,51},{0,8,119},{0,8,55},{0,9,207},{17,7,15},{0,8,103},
+        {0,8,39},{0,9,175},{0,8,7},{0,8,135},{0,8,71},{0,9,239},{16,7,9},
+        {0,8,95},{0,8,31},{0,9,159},{20,7,99},{0,8,127},{0,8,63},{0,9,223},
+        {18,7,27},{0,8,111},{0,8,47},{0,9,191},{0,8,15},{0,8,143},{0,8,79},
+        {0,9,255}
+    };
+
+    static const code distfix[32] = {
+        {16,5,1},{23,5,257},{19,5,17},{27,5,4097},{17,5,5},{25,5,1025},
+        {21,5,65},{29,5,16385},{16,5,3},{24,5,513},{20,5,33},{28,5,8193},
+        {18,5,9},{26,5,2049},{22,5,129},{64,5,0},{16,5,2},{23,5,385},
+        {19,5,25},{27,5,6145},{17,5,7},{25,5,1537},{21,5,97},{29,5,24577},
+        {16,5,4},{24,5,769},{20,5,49},{28,5,12289},{18,5,13},{26,5,3073},
+        {22,5,193},{64,5,0}
+    };
diff --git a/updater/zlib123/inflate.c b/updater/zlib123/inflate.c
new file mode 100644
index 0000000..eea015f
--- /dev/null
+++ b/updater/zlib123/inflate.c
@@ -0,0 +1,1339 @@
+/* inflate.c -- zlib decompression
+ * Copyright (C) 1995-2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/*
+ * Change history:
+ *
+ * 1.2.beta0    24 Nov 2002
+ * - First version -- complete rewrite of inflate to simplify code, avoid
+ *   creation of window when not needed, minimize use of window when it is
+ *   needed, make inffast.c even faster, implement gzip decoding, and to
+ *   improve code readability and style over the previous zlib inflate code
+ *
+ * 1.2.beta1    25 Nov 2002
+ * - Use pointers for available input and output checking in inffast.c
+ * - Remove input and output counters in inffast.c
+ * - Change inffast.c entry and loop from avail_in >= 7 to >= 6
+ * - Remove unnecessary second byte pull from length extra in inffast.c
+ * - Unroll direct copy to three copies per loop in inffast.c
+ *
+ * 1.2.beta2    4 Dec 2002
+ * - Change external routine names to reduce potential conflicts
+ * - Correct filename to inffixed.h for fixed tables in inflate.c
+ * - Make hbuf[] unsigned char to match parameter type in inflate.c
+ * - Change strm->next_out[-state->offset] to *(strm->next_out - state->offset)
+ *   to avoid negation problem on Alphas (64 bit) in inflate.c
+ *
+ * 1.2.beta3    22 Dec 2002
+ * - Add comments on state->bits assertion in inffast.c
+ * - Add comments on op field in inftrees.h
+ * - Fix bug in reuse of allocated window after inflateReset()
+ * - Remove bit fields--back to byte structure for speed
+ * - Remove distance extra == 0 check in inflate_fast()--only helps for lengths
+ * - Change post-increments to pre-increments in inflate_fast(), PPC biased?
+ * - Add compile time option, POSTINC, to use post-increments instead (Intel?)
+ * - Make MATCH copy in inflate() much faster for when inflate_fast() not used
+ * - Use local copies of stream next and avail values, as well as local bit
+ *   buffer and bit count in inflate()--for speed when inflate_fast() not used
+ *
+ * 1.2.beta4    1 Jan 2003
+ * - Split ptr - 257 statements in inflate_table() to avoid compiler warnings
+ * - Move a comment on output buffer sizes from inffast.c to inflate.c
+ * - Add comments in inffast.c to introduce the inflate_fast() routine
+ * - Rearrange window copies in inflate_fast() for speed and simplification
+ * - Unroll last copy for window match in inflate_fast()
+ * - Use local copies of window variables in inflate_fast() for speed
+ * - Pull out common write == 0 case for speed in inflate_fast()
+ * - Make op and len in inflate_fast() unsigned for consistency
+ * - Add FAR to lcode and dcode declarations in inflate_fast()
+ * - Simplified bad distance check in inflate_fast()
+ * - Added inflateBackInit(), inflateBack(), and inflateBackEnd() in new
+ *   source file infback.c to provide a call-back interface to inflate for
+ *   programs like gzip and unzip -- uses window as output buffer to avoid
+ *   window copying
+ *
+ * 1.2.beta5    1 Jan 2003
+ * - Improved inflateBack() interface to allow the caller to provide initial
+ *   input in strm.
+ * - Fixed stored blocks bug in inflateBack()
+ *
+ * 1.2.beta6    4 Jan 2003
+ * - Added comments in inffast.c on effectiveness of POSTINC
+ * - Typecasting all around to reduce compiler warnings
+ * - Changed loops from while (1) or do {} while (1) to for (;;), again to
+ *   make compilers happy
+ * - Changed type of window in inflateBackInit() to unsigned char *
+ *
+ * 1.2.beta7    27 Jan 2003
+ * - Changed many types to unsigned or unsigned short to avoid warnings
+ * - Added inflateCopy() function
+ *
+ * 1.2.0        9 Mar 2003
+ * - Changed inflateBack() interface to provide separate opaque descriptors
+ *   for the in() and out() functions
+ * - Changed inflateBack() argument and in_func typedef to swap the length
+ *   and buffer address return values for the input function
+ * - Check next_in and next_out for Z_NULL on entry to inflate()
+ *
+ * The history for versions after 1.2.0 are in ChangeLog in zlib distribution.
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+#include "inflate.h"
+#include "inffast.h"
+
+#ifdef MAKEFIXED
+#  ifndef BUILDFIXED
+#    define BUILDFIXED
+#  endif
+#endif
+
+/* function prototypes */
+local void fixedtables OF((struct inflate_state FAR *state));
+local int updatewindow OF((z_streamp strm, unsigned out));
+#ifdef BUILDFIXED
+   void makefixed OF((void));
+#endif
+local unsigned syncsearch OF((unsigned FAR *have, unsigned char FAR *buf,
+                              unsigned len));
+
+int ZEXPORT inflateReset(z_streamp strm)
+{
+    struct inflate_state FAR *state;
+
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+    state = (struct inflate_state FAR *)strm->state;
+    strm->total_in = strm->total_out = state->total = 0;
+    strm->msg = Z_NULL;
+    strm->adler = 1;        /* to support ill-conceived Java test suite */
+    state->mode = HEAD;
+    state->last = 0;
+    state->havedict = 0;
+    state->dmax = 32768U;
+    state->head = Z_NULL;
+    state->wsize = 0;
+    state->whave = 0;
+    state->write = 0;
+    state->hold = 0;
+    state->bits = 0;
+    state->lencode = state->distcode = state->next = state->codes;
+    Tracev((stderr, "inflate: reset\n"));
+    return Z_OK;
+}
+
+int ZEXPORT inflatePrime(z_streamp strm, int bits, int value)
+{
+    struct inflate_state FAR *state;
+
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+    state = (struct inflate_state FAR *)strm->state;
+    if (bits > 16 || state->bits + bits > 32) return Z_STREAM_ERROR;
+    value &= (1L << bits) - 1;
+    state->hold += value << state->bits;
+    state->bits += bits;
+    return Z_OK;
+}
+
+int ZEXPORT inflateInit2_(z_streamp strm, int windowBits, const char *version, int stream_size)
+{
+    struct inflate_state FAR *state;
+
+    if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
+        stream_size != (int)(sizeof(z_stream)))
+        return Z_VERSION_ERROR;
+    if (strm == Z_NULL) return Z_STREAM_ERROR;
+    strm->msg = Z_NULL;                 /* in case we return an error */
+    if (strm->zalloc == (alloc_func)0) {
+        strm->zalloc = zcalloc;
+        strm->opaque = (voidpf)0;
+    }
+    if (strm->zfree == (free_func)0) strm->zfree = zcfree;
+    state = (struct inflate_state FAR *)
+            ZALLOC(strm, 1, sizeof(struct inflate_state));
+    if (state == Z_NULL) return Z_MEM_ERROR;
+    Tracev((stderr, "inflate: allocated\n"));
+    strm->state = (struct internal_state FAR *)state;
+    if (windowBits < 0) {
+        state->wrap = 0;
+        windowBits = -windowBits;
+    }
+    else {
+        state->wrap = (windowBits >> 4) + 1;
+#ifdef GUNZIP
+        if (windowBits < 48) windowBits &= 15;
+#endif
+    }
+    if (windowBits < 8 || windowBits > 15) {
+        ZFREE(strm, state);
+        strm->state = Z_NULL;
+        return Z_STREAM_ERROR;
+    }
+    state->wbits = (unsigned)windowBits;
+    state->window = Z_NULL;
+    return inflateReset(strm);
+}
+
+int ZEXPORT inflateInit_(z_streamp strm, const char *version, int stream_size)
+{
+    return inflateInit2_(strm, DEF_WBITS, version, stream_size);
+}
+
+/*
+   Return state with length and distance decoding tables and index sizes set to
+   fixed code decoding.  Normally this returns fixed tables from inffixed.h.
+   If BUILDFIXED is defined, then instead this routine builds the tables the
+   first time it's called, and returns those tables the first time and
+   thereafter.  This reduces the size of the code by about 2K bytes, in
+   exchange for a little execution time.  However, BUILDFIXED should not be
+   used for threaded applications, since the rewriting of the tables and virgin
+   may not be thread-safe.
+ */
+local void fixedtables(struct inflate_state FAR *state)
+{
+#ifdef BUILDFIXED
+    static int virgin = 1;
+    static code *lenfix, *distfix;
+    static code fixed[544];
+
+    /* build fixed huffman tables if first call (may not be thread safe) */
+    if (virgin) {
+        unsigned sym, bits;
+        static code *next;
+
+        /* literal/length table */
+        sym = 0;
+        while (sym < 144) state->lens[sym++] = 8;
+        while (sym < 256) state->lens[sym++] = 9;
+        while (sym < 280) state->lens[sym++] = 7;
+        while (sym < 288) state->lens[sym++] = 8;
+        next = fixed;
+        lenfix = next;
+        bits = 9;
+        inflate_table(LENS, state->lens, 288, &(next), &(bits), state->work);
+
+        /* distance table */
+        sym = 0;
+        while (sym < 32) state->lens[sym++] = 5;
+        distfix = next;
+        bits = 5;
+        inflate_table(DISTS, state->lens, 32, &(next), &(bits), state->work);
+
+        /* do this just once */
+        virgin = 0;
+    }
+#else /* !BUILDFIXED */
+#   include "inffixed.h"
+#endif /* BUILDFIXED */
+    state->lencode = lenfix;
+    state->lenbits = 9;
+    state->distcode = distfix;
+    state->distbits = 5;
+}
+
+#ifdef MAKEFIXED
+#include <stdio.h>
+
+/*
+   Write out the inffixed.h that is #include'd above.  Defining MAKEFIXED also
+   defines BUILDFIXED, so the tables are built on the fly.  makefixed() writes
+   those tables to stdout, which would be piped to inffixed.h.  A small program
+   can simply call makefixed to do this:
+
+    void makefixed(void);
+
+    int main(void)
+    {
+        makefixed();
+        return 0;
+    }
+
+   Then that can be linked with zlib built with MAKEFIXED defined and run:
+
+    a.out > inffixed.h
+ */
+void makefixed()
+{
+    unsigned low, size;
+    struct inflate_state state;
+
+    fixedtables(&state);
+    puts("    /* inffixed.h -- table for decoding fixed codes");
+    puts("     * Generated automatically by makefixed().");
+    puts("     */");
+    puts("");
+    puts("    /* WARNING: this file should *not* be used by applications.");
+    puts("       It is part of the implementation of this library and is");
+    puts("       subject to change. Applications should only use zlib.h.");
+    puts("     */");
+    puts("");
+    size = 1U << 9;
+    printf("    static const code lenfix[%u] = {", size);
+    low = 0;
+    for (;;) {
+        if ((low % 7) == 0) printf("\n        ");
+        printf("{%u,%u,%d}", state.lencode[low].op, state.lencode[low].bits,
+               state.lencode[low].val);
+        if (++low == size) break;
+        putchar(',');
+    }
+    puts("\n    };");
+    size = 1U << 5;
+    printf("\n    static const code distfix[%u] = {", size);
+    low = 0;
+    for (;;) {
+        if ((low % 6) == 0) printf("\n        ");
+        printf("{%u,%u,%d}", state.distcode[low].op, state.distcode[low].bits,
+               state.distcode[low].val);
+        if (++low == size) break;
+        putchar(',');
+    }
+    puts("\n    };");
+}
+#endif /* MAKEFIXED */
+
+/*
+   Update the window with the last wsize (normally 32K) bytes written before
+   returning.  If window does not exist yet, create it.  This is only called
+   when a window is already in use, or when output has been written during this
+   inflate call, but the end of the deflate stream has not been reached yet.
+   It is also called to create a window for dictionary data when a dictionary
+   is loaded.
+
+   Providing output buffers larger than 32K to inflate() should provide a speed
+   advantage, since only the last 32K of output is copied to the sliding window
+   upon return from inflate(), and since all distances after the first 32K of
+   output will fall in the output data, making match copies simpler and faster.
+   The advantage may be dependent on the size of the processor's data caches.
+ */
+local int updatewindow(z_streamp strm, unsigned out)
+{
+    struct inflate_state FAR *state;
+    unsigned copy, dist;
+
+    state = (struct inflate_state FAR *)strm->state;
+
+    /* if it hasn't been done already, allocate space for the window */
+    if (state->window == Z_NULL) {
+        state->window = (unsigned char FAR *)
+                        ZALLOC(strm, 1U << state->wbits,
+                               sizeof(unsigned char));
+        if (state->window == Z_NULL) return 1;
+    }
+
+    /* if window not in use yet, initialize */
+    if (state->wsize == 0) {
+        state->wsize = 1U << state->wbits;
+        state->write = 0;
+        state->whave = 0;
+    }
+
+    /* copy state->wsize or less output bytes into the circular window */
+    copy = out - strm->avail_out;
+    if (copy >= state->wsize) {
+        zmemcpy(state->window, strm->next_out - state->wsize, state->wsize);
+        state->write = 0;
+        state->whave = state->wsize;
+    }
+    else {
+        dist = state->wsize - state->write;
+        if (dist > copy) dist = copy;
+        zmemcpy(state->window + state->write, strm->next_out - copy, dist);
+        copy -= dist;
+        if (copy) {
+            zmemcpy(state->window, strm->next_out - copy, copy);
+            state->write = copy;
+            state->whave = state->wsize;
+        }
+        else {
+            state->write += dist;
+            if (state->write == state->wsize) state->write = 0;
+            if (state->whave < state->wsize) state->whave += dist;
+        }
+    }
+    return 0;
+}
+
+/* Macros for inflate(): */
+
+/* check function to use adler32() for zlib or crc32() for gzip */
+#ifdef GUNZIP
+#  define UPDATE(check, buf, len) \
+    (state->flags ? crc32(check, buf, len) : adler32(check, buf, len))
+#else
+#  define UPDATE(check, buf, len) adler32(check, buf, len)
+#endif
+
+/* check macros for header crc */
+#ifdef GUNZIP
+#  define CRC2(check, word) \
+    do { \
+        hbuf[0] = (unsigned char)(word); \
+        hbuf[1] = (unsigned char)((word) >> 8); \
+        check = crc32(check, hbuf, 2); \
+    } while (0)
+
+#  define CRC4(check, word) \
+    do { \
+        hbuf[0] = (unsigned char)(word); \
+        hbuf[1] = (unsigned char)((word) >> 8); \
+        hbuf[2] = (unsigned char)((word) >> 16); \
+        hbuf[3] = (unsigned char)((word) >> 24); \
+        check = crc32(check, hbuf, 4); \
+    } while (0)
+#endif
+
+/* Load registers with state in inflate() for speed */
+#define LOAD() \
+    do { \
+        put = strm->next_out; \
+        left = strm->avail_out; \
+        next = strm->next_in; \
+        have = strm->avail_in; \
+        hold = state->hold; \
+        bits = state->bits; \
+    } while (0)
+
+/* Restore state from registers in inflate() */
+#define RESTORE() \
+    do { \
+        strm->next_out = put; \
+        strm->avail_out = left; \
+        strm->next_in = next; \
+        strm->avail_in = have; \
+        state->hold = hold; \
+        state->bits = bits; \
+    } while (0)
+
+/* Clear the input bit accumulator */
+#define INITBITS() \
+    do { \
+        hold = 0; \
+        bits = 0; \
+    } while (0)
+
+/* Get a byte of input into the bit accumulator, or return from inflate()
+   if there is no input available. */
+#define PULLBYTE() \
+    do { \
+        if (have == 0) goto inf_leave; \
+        have--; \
+        hold += (unsigned long)(*next++) << bits; \
+        bits += 8; \
+    } while (0)
+
+/* Assure that there are at least n bits in the bit accumulator.  If there is
+   not enough available input to do that, then return from inflate(). */
+#define NEEDBITS(n) \
+    do { \
+        while (bits < (unsigned)(n)) \
+            PULLBYTE(); \
+    } while (0)
+
+/* Return the low n bits of the bit accumulator (n < 16) */
+#define BITS(n) \
+    ((unsigned)hold & ((1U << (n)) - 1))
+
+/* Remove n bits from the bit accumulator */
+#define DROPBITS(n) \
+    do { \
+        hold >>= (n); \
+        bits -= (unsigned)(n); \
+    } while (0)
+
+/* Remove zero to seven bits as needed to go to a byte boundary */
+#define BYTEBITS() \
+    do { \
+        hold >>= bits & 7; \
+        bits -= bits & 7; \
+    } while (0)
+
+/* Reverse the bytes in a 32-bit value */
+#define REVERSE(q) \
+    ((((q) >> 24) & 0xff) + (((q) >> 8) & 0xff00) + \
+     (((q) & 0xff00) << 8) + (((q) & 0xff) << 24))
+
+/*
+   inflate() uses a state machine to process as much input data and generate as
+   much output data as possible before returning.  The state machine is
+   structured roughly as follows:
+
+    for (;;) switch (state) {
+    ...
+    case STATEn:
+        if (not enough input data or output space to make progress)
+            return;
+        ... make progress ...
+        state = STATEm;
+        break;
+    ...
+    }
+
+   so when inflate() is called again, the same case is attempted again, and
+   if the appropriate resources are provided, the machine proceeds to the
+   next state.  The NEEDBITS() macro is usually the way the state evaluates
+   whether it can proceed or should return.  NEEDBITS() does the return if
+   the requested bits are not available.  The typical use of the BITS macros
+   is:
+
+        NEEDBITS(n);
+        ... do something with BITS(n) ...
+        DROPBITS(n);
+
+   where NEEDBITS(n) either returns from inflate() if there isn't enough
+   input left to load n bits into the accumulator, or it continues.  BITS(n)
+   gives the low n bits in the accumulator.  When done, DROPBITS(n) drops
+   the low n bits off the accumulator.  INITBITS() clears the accumulator
+   and sets the number of available bits to zero.  BYTEBITS() discards just
+   enough bits to put the accumulator on a byte boundary.  After BYTEBITS()
+   and a NEEDBITS(8), then BITS(8) would return the next byte in the stream.
+
+   NEEDBITS(n) uses PULLBYTE() to get an available byte of input, or to return
+   if there is no input available.  The decoding of variable length codes uses
+   PULLBYTE() directly in order to pull just enough bytes to decode the next
+   code, and no more.
+
+   Some states loop until they get enough input, making sure that enough
+   state information is maintained to continue the loop where it left off
+   if NEEDBITS() returns in the loop.  For example, want, need, and keep
+   would all have to actually be part of the saved state in case NEEDBITS()
+   returns:
+
+    case STATEw:
+        while (want < need) {
+            NEEDBITS(n);
+            keep[want++] = BITS(n);
+            DROPBITS(n);
+        }
+        state = STATEx;
+    case STATEx:
+
+   As shown above, if the next state is also the next case, then the break
+   is omitted.
+
+   A state may also return if there is not enough output space available to
+   complete that state.  Those states are copying stored data, writing a
+   literal byte, and copying a matching string.
+
+   When returning, a "goto inf_leave" is used to update the total counters,
+   update the check value, and determine whether any progress has been made
+   during that inflate() call in order to return the proper return code.
+   Progress is defined as a change in either strm->avail_in or strm->avail_out.
+   When there is a window, goto inf_leave will update the window with the last
+   output written.  If a goto inf_leave occurs in the middle of decompression
+   and there is no window currently, goto inf_leave will create one and copy
+   output to the window for the next call of inflate().
+
+   In this implementation, the flush parameter of inflate() only affects the
+   return code (per zlib.h).  inflate() always writes as much as possible to
+   strm->next_out, given the space available and the provided input--the effect
+   documented in zlib.h of Z_SYNC_FLUSH.  Furthermore, inflate() always defers
+   the allocation of and copying into a sliding window until necessary, which
+   provides the effect documented in zlib.h for Z_FINISH when the entire input
+   stream available.  So the only thing the flush parameter actually does is:
+   when flush is set to Z_FINISH, inflate() cannot return Z_OK.  Instead it
+   will return Z_BUF_ERROR if it has not reached the end of the stream.
+ */
+
+int ZEXPORT inflate(z_streamp strm, int flush)
+{
+    struct inflate_state FAR *state;
+    unsigned char FAR *next;    /* next input */
+    unsigned char FAR *put;     /* next output */
+    unsigned have, left;        /* available input and output */
+    unsigned long hold;         /* bit buffer */
+    unsigned bits;              /* bits in bit buffer */
+    unsigned in, out;           /* save starting available input and output */
+    unsigned copy;              /* number of stored or match bytes to copy */
+    unsigned char FAR *from;    /* where to copy match bytes from */
+    code thisc;                  /* current decoding table entry */
+    code last;                  /* parent table entry */
+    unsigned len;               /* length to copy for repeats, bits to drop */
+    int ret;                    /* return code */
+#ifdef GUNZIP
+    unsigned char hbuf[4];      /* buffer for gzip header crc calculation */
+#endif
+    static const unsigned short order[19] = /* permutation of code lengths */
+        {16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
+
+    if (strm == Z_NULL || strm->state == Z_NULL || strm->next_out == Z_NULL ||
+        (strm->next_in == Z_NULL && strm->avail_in != 0))
+        return Z_STREAM_ERROR;
+
+    state = (struct inflate_state FAR *)strm->state;
+    if (state->mode == TYPE) state->mode = TYPEDO;      /* skip check */
+    LOAD();
+    in = have;
+    out = left;
+    ret = Z_OK;
+    for (;;)
+        switch (state->mode) {
+        case HEAD:
+            if (state->wrap == 0) {
+                state->mode = TYPEDO;
+                break;
+            }
+            NEEDBITS(16);
+#ifdef GUNZIP
+            if ((state->wrap & 2) && hold == 0x8b1f) {  /* gzip header */
+                state->check = crc32(0L, Z_NULL, 0);
+                CRC2(state->check, hold);
+                INITBITS();
+                state->mode = FLAGS;
+                break;
+            }
+            state->flags = 0;           /* expect zlib header */
+            if (state->head != Z_NULL)
+                state->head->done = -1;
+            if (!(state->wrap & 1) ||   /* check if zlib header allowed */
+#else
+            if (
+#endif
+                ((BITS(8) << 8) + (hold >> 8)) % 31) {
+                strm->msg = (char *)"incorrect header check";
+                state->mode = BAD;
+                break;
+            }
+            if (BITS(4) != Z_DEFLATED) {
+                strm->msg = (char *)"unknown compression method";
+                state->mode = BAD;
+                break;
+            }
+            DROPBITS(4);
+            len = BITS(4) + 8;
+            if (len > state->wbits) {
+                strm->msg = (char *)"invalid window size";
+                state->mode = BAD;
+                break;
+            }
+            state->dmax = 1U << len;
+            Tracev((stderr, "inflate:   zlib header ok\n"));
+            strm->adler = state->check = adler32(0L, Z_NULL, 0);
+            state->mode = hold & 0x200 ? DICTID : TYPE;
+            INITBITS();
+            break;
+#ifdef GUNZIP
+        case FLAGS:
+            NEEDBITS(16);
+            state->flags = (int)(hold);
+            if ((state->flags & 0xff) != Z_DEFLATED) {
+                strm->msg = (char *)"unknown compression method";
+                state->mode = BAD;
+                break;
+            }
+            if (state->flags & 0xe000) {
+                strm->msg = (char *)"unknown header flags set";
+                state->mode = BAD;
+                break;
+            }
+            if (state->head != Z_NULL)
+                state->head->text = (int)((hold >> 8) & 1);
+            if (state->flags & 0x0200) CRC2(state->check, hold);
+            INITBITS();
+            state->mode = TIME;
+        case TIME:
+            NEEDBITS(32);
+            if (state->head != Z_NULL)
+                state->head->time = hold;
+            if (state->flags & 0x0200) CRC4(state->check, hold);
+            INITBITS();
+            state->mode = OS;
+        case OS:
+            NEEDBITS(16);
+            if (state->head != Z_NULL) {
+                state->head->xflags = (int)(hold & 0xff);
+                state->head->os = (int)(hold >> 8);
+            }
+            if (state->flags & 0x0200) CRC2(state->check, hold);
+            INITBITS();
+            state->mode = EXLEN;
+        case EXLEN:
+            if (state->flags & 0x0400) {
+                NEEDBITS(16);
+                state->length = (unsigned)(hold);
+                if (state->head != Z_NULL)
+                    state->head->extra_len = (unsigned)hold;
+                if (state->flags & 0x0200) CRC2(state->check, hold);
+                INITBITS();
+            }
+            else if (state->head != Z_NULL)
+                state->head->extra = Z_NULL;
+            state->mode = EXTRA;
+        case EXTRA:
+            if (state->flags & 0x0400) {
+                copy = state->length;
+                if (copy > have) copy = have;
+                if (copy) {
+                    if (state->head != Z_NULL &&
+                        state->head->extra != Z_NULL) {
+                        len = state->head->extra_len - state->length;
+                        zmemcpy(state->head->extra + len, next,
+                                len + copy > state->head->extra_max ?
+                                state->head->extra_max - len : copy);
+                    }
+                    if (state->flags & 0x0200)
+                        state->check = crc32(state->check, next, copy);
+                    have -= copy;
+                    next += copy;
+                    state->length -= copy;
+                }
+                if (state->length) goto inf_leave;
+            }
+            state->length = 0;
+            state->mode = NAME;
+        case NAME:
+            if (state->flags & 0x0800) {
+                if (have == 0) goto inf_leave;
+                copy = 0;
+                do {
+                    len = (unsigned)(next[copy++]);
+                    if (state->head != Z_NULL &&
+                            state->head->name != Z_NULL &&
+                            state->length < state->head->name_max)
+                        state->head->name[state->length++] = len;
+                } while (len && copy < have);
+                if (state->flags & 0x0200)
+                    state->check = crc32(state->check, next, copy);
+                have -= copy;
+                next += copy;
+                if (len) goto inf_leave;
+            }
+            else if (state->head != Z_NULL)
+                state->head->name = Z_NULL;
+            state->length = 0;
+            state->mode = COMMENT;
+        case COMMENT:
+            if (state->flags & 0x1000) {
+                if (have == 0) goto inf_leave;
+                copy = 0;
+                do {
+                    len = (unsigned)(next[copy++]);
+                    if (state->head != Z_NULL &&
+                            state->head->comment != Z_NULL &&
+                            state->length < state->head->comm_max)
+                        state->head->comment[state->length++] = len;
+                } while (len && copy < have);
+                if (state->flags & 0x0200)
+                    state->check = crc32(state->check, next, copy);
+                have -= copy;
+                next += copy;
+                if (len) goto inf_leave;
+            }
+            else if (state->head != Z_NULL)
+                state->head->comment = Z_NULL;
+            state->mode = HCRC;
+        case HCRC:
+            if (state->flags & 0x0200) {
+                NEEDBITS(16);
+                if (hold != (state->check & 0xffff)) {
+                    strm->msg = (char *)"header crc mismatch";
+                    state->mode = BAD;
+                    break;
+                }
+                INITBITS();
+            }
+            if (state->head != Z_NULL) {
+                state->head->hcrc = (int)((state->flags >> 9) & 1);
+                state->head->done = 1;
+            }
+            strm->adler = state->check = crc32(0L, Z_NULL, 0);
+            state->mode = TYPE;
+            break;
+#endif
+        case DICTID:
+            NEEDBITS(32);
+            strm->adler = state->check = REVERSE(hold);
+            INITBITS();
+            state->mode = DICT;
+        case DICT:
+            if (state->havedict == 0) {
+                RESTORE();
+                return Z_NEED_DICT;
+            }
+            strm->adler = state->check = adler32(0L, Z_NULL, 0);
+            state->mode = TYPE;
+        case TYPE:
+            if (flush == Z_BLOCK) goto inf_leave;
+        case TYPEDO:
+            if (state->last) {
+                BYTEBITS();
+                state->mode = CHECK;
+                break;
+            }
+            NEEDBITS(3);
+            state->last = BITS(1);
+            DROPBITS(1);
+            switch (BITS(2)) {
+            case 0:                             /* stored block */
+                Tracev((stderr, "inflate:     stored block%s\n",
+                        state->last ? " (last)" : ""));
+                state->mode = STORED;
+                break;
+            case 1:                             /* fixed block */
+                fixedtables(state);
+                Tracev((stderr, "inflate:     fixed codes block%s\n",
+                        state->last ? " (last)" : ""));
+                state->mode = LEN;              /* decode codes */
+                break;
+            case 2:                             /* dynamic block */
+                Tracev((stderr, "inflate:     dynamic codes block%s\n",
+                        state->last ? " (last)" : ""));
+                state->mode = TABLE;
+                break;
+            case 3:
+                strm->msg = (char *)"invalid block type";
+                state->mode = BAD;
+            }
+            DROPBITS(2);
+            break;
+        case STORED:
+            BYTEBITS();                         /* go to byte boundary */
+            NEEDBITS(32);
+            if ((hold & 0xffff) != ((hold >> 16) ^ 0xffff)) {
+                strm->msg = (char *)"invalid stored block lengths";
+                state->mode = BAD;
+                break;
+            }
+            state->length = (unsigned)hold & 0xffff;
+            Tracev((stderr, "inflate:       stored length %u\n",
+                    state->length));
+            INITBITS();
+            state->mode = COPY;
+        case COPY:
+            copy = state->length;
+            if (copy) {
+                if (copy > have) copy = have;
+                if (copy > left) copy = left;
+                if (copy == 0) goto inf_leave;
+                zmemcpy(put, next, copy);
+                have -= copy;
+                next += copy;
+                left -= copy;
+                put += copy;
+                state->length -= copy;
+                break;
+            }
+            Tracev((stderr, "inflate:       stored end\n"));
+            state->mode = TYPE;
+            break;
+        case TABLE:
+            NEEDBITS(14);
+            state->nlen = BITS(5) + 257;
+            DROPBITS(5);
+            state->ndist = BITS(5) + 1;
+            DROPBITS(5);
+            state->ncode = BITS(4) + 4;
+            DROPBITS(4);
+#ifndef PKZIP_BUG_WORKAROUND
+            if (state->nlen > 286 || state->ndist > 30) {
+                strm->msg = (char *)"too many length or distance symbols";
+                state->mode = BAD;
+                break;
+            }
+#endif
+            Tracev((stderr, "inflate:       table sizes ok\n"));
+            state->have = 0;
+            state->mode = LENLENS;
+        case LENLENS:
+            while (state->have < state->ncode) {
+                NEEDBITS(3);
+                state->lens[order[state->have++]] = (unsigned short)BITS(3);
+                DROPBITS(3);
+            }
+            while (state->have < 19)
+                state->lens[order[state->have++]] = 0;
+            state->next = state->codes;
+            state->lencode = (code const FAR *)(state->next);
+            state->lenbits = 7;
+            ret = inflate_table(CODES, state->lens, 19, &(state->next),
+                                &(state->lenbits), state->work);
+            if (ret) {
+                strm->msg = (char *)"invalid code lengths set";
+                state->mode = BAD;
+                break;
+            }
+            Tracev((stderr, "inflate:       code lengths ok\n"));
+            state->have = 0;
+            state->mode = CODELENS;
+        case CODELENS:
+            while (state->have < state->nlen + state->ndist) {
+                for (;;) {
+                    thisc = state->lencode[BITS(state->lenbits)];
+                    if ((unsigned)(thisc.bits) <= bits) break;
+                    PULLBYTE();
+                }
+                if (thisc.val < 16) {
+                    NEEDBITS(thisc.bits);
+                    DROPBITS(thisc.bits);
+                    state->lens[state->have++] = thisc.val;
+                }
+                else {
+                    if (thisc.val == 16) {
+                        NEEDBITS(thisc.bits + 2);
+                        DROPBITS(thisc.bits);
+                        if (state->have == 0) {
+                            strm->msg = (char *)"invalid bit length repeat";
+                            state->mode = BAD;
+                            break;
+                        }
+                        len = state->lens[state->have - 1];
+                        copy = 3 + BITS(2);
+                        DROPBITS(2);
+                    }
+                    else if (thisc.val == 17) {
+                        NEEDBITS(thisc.bits + 3);
+                        DROPBITS(thisc.bits);
+                        len = 0;
+                        copy = 3 + BITS(3);
+                        DROPBITS(3);
+                    }
+                    else {
+                        NEEDBITS(thisc.bits + 7);
+                        DROPBITS(thisc.bits);
+                        len = 0;
+                        copy = 11 + BITS(7);
+                        DROPBITS(7);
+                    }
+                    if (state->have + copy > state->nlen + state->ndist) {
+                        strm->msg = (char *)"invalid bit length repeat";
+                        state->mode = BAD;
+                        break;
+                    }
+                    while (copy--)
+                        state->lens[state->have++] = (unsigned short)len;
+                }
+            }
+
+            /* handle error breaks in while */
+            if (state->mode == BAD) break;
+
+            /* build code tables */
+            state->next = state->codes;
+            state->lencode = (code const FAR *)(state->next);
+            state->lenbits = 9;
+            ret = inflate_table(LENS, state->lens, state->nlen, &(state->next),
+                                &(state->lenbits), state->work);
+            if (ret) {
+                strm->msg = (char *)"invalid literal/lengths set";
+                state->mode = BAD;
+                break;
+            }
+            state->distcode = (code const FAR *)(state->next);
+            state->distbits = 6;
+            ret = inflate_table(DISTS, state->lens + state->nlen, state->ndist,
+                            &(state->next), &(state->distbits), state->work);
+            if (ret) {
+                strm->msg = (char *)"invalid distances set";
+                state->mode = BAD;
+                break;
+            }
+            Tracev((stderr, "inflate:       codes ok\n"));
+            state->mode = LEN;
+        case LEN:
+            if (have >= 6 && left >= 258) {
+                RESTORE();
+                inflate_fast(strm, out);
+                LOAD();
+                break;
+            }
+            for (;;) {
+                thisc = state->lencode[BITS(state->lenbits)];
+                if ((unsigned)(thisc.bits) <= bits) break;
+                PULLBYTE();
+            }
+            if (thisc.op && (thisc.op & 0xf0) == 0) {
+                last = thisc;
+                for (;;) {
+                    thisc = state->lencode[last.val +
+                            (BITS(last.bits + last.op) >> last.bits)];
+                    if ((unsigned)(last.bits + thisc.bits) <= bits) break;
+                    PULLBYTE();
+                }
+                DROPBITS(last.bits);
+            }
+            DROPBITS(thisc.bits);
+            state->length = (unsigned)thisc.val;
+            if ((int)(thisc.op) == 0) {
+                Tracevv((stderr, thisc.val >= 0x20 && thisc.val < 0x7f ?
+                        "inflate:         literal '%c'\n" :
+                        "inflate:         literal 0x%02x\n", thisc.val));
+                state->mode = LIT;
+                break;
+            }
+            if (thisc.op & 32) {
+                Tracevv((stderr, "inflate:         end of block\n"));
+                state->mode = TYPE;
+                break;
+            }
+            if (thisc.op & 64) {
+                strm->msg = (char *)"invalid literal/length code";
+                state->mode = BAD;
+                break;
+            }
+            state->extra = (unsigned)(thisc.op) & 15;
+            state->mode = LENEXT;
+        case LENEXT:
+            if (state->extra) {
+                NEEDBITS(state->extra);
+                state->length += BITS(state->extra);
+                DROPBITS(state->extra);
+            }
+            Tracevv((stderr, "inflate:         length %u\n", state->length));
+            state->mode = DIST;
+        case DIST:
+            for (;;) {
+                thisc = state->distcode[BITS(state->distbits)];
+                if ((unsigned)(thisc.bits) <= bits) break;
+                PULLBYTE();
+            }
+            if ((thisc.op & 0xf0) == 0) {
+                last = thisc;
+                for (;;) {
+                    thisc = state->distcode[last.val +
+                            (BITS(last.bits + last.op) >> last.bits)];
+                    if ((unsigned)(last.bits + thisc.bits) <= bits) break;
+                    PULLBYTE();
+                }
+                DROPBITS(last.bits);
+            }
+            DROPBITS(thisc.bits);
+            if (thisc.op & 64) {
+                strm->msg = (char *)"invalid distance code";
+                state->mode = BAD;
+                break;
+            }
+            state->offset = (unsigned)thisc.val;
+            state->extra = (unsigned)(thisc.op) & 15;
+            state->mode = DISTEXT;
+        case DISTEXT:
+            if (state->extra) {
+                NEEDBITS(state->extra);
+                state->offset += BITS(state->extra);
+                DROPBITS(state->extra);
+            }
+#ifdef INFLATE_STRICT
+            if (state->offset > state->dmax) {
+                strm->msg = (char *)"invalid distance too far back";
+                state->mode = BAD;
+                break;
+            }
+#endif
+            if (state->offset > state->whave + out - left) {
+                strm->msg = (char *)"invalid distance too far back";
+                state->mode = BAD;
+                break;
+            }
+            Tracevv((stderr, "inflate:         distance %u\n", state->offset));
+            state->mode = MATCH;
+        case MATCH:
+            if (left == 0) goto inf_leave;
+            copy = out - left;
+            if (state->offset > copy) {         /* copy from window */
+                copy = state->offset - copy;
+                if (copy > state->write) {
+                    copy -= state->write;
+                    from = state->window + (state->wsize - copy);
+                }
+                else
+                    from = state->window + (state->write - copy);
+                if (copy > state->length) copy = state->length;
+            }
+            else {                              /* copy from output */
+                from = put - state->offset;
+                copy = state->length;
+            }
+            if (copy > left) copy = left;
+            left -= copy;
+            state->length -= copy;
+            do {
+                *put++ = *from++;
+            } while (--copy);
+            if (state->length == 0) state->mode = LEN;
+            break;
+        case LIT:
+            if (left == 0) goto inf_leave;
+            *put++ = (unsigned char)(state->length);
+            left--;
+            state->mode = LEN;
+            break;
+        case CHECK:
+            if (state->wrap) {
+                NEEDBITS(32);
+                out -= left;
+                strm->total_out += out;
+                state->total += out;
+                if (out)
+                    strm->adler = state->check =
+                        UPDATE(state->check, put - out, out);
+                out = left;
+                if ((
+#ifdef GUNZIP
+                     state->flags ? hold :
+#endif
+                     REVERSE(hold)) != state->check) {
+                    strm->msg = (char *)"incorrect data check";
+                    state->mode = BAD;
+                    break;
+                }
+                INITBITS();
+                Tracev((stderr, "inflate:   check matches trailer\n"));
+            }
+#ifdef GUNZIP
+            state->mode = LENGTH;
+        case LENGTH:
+            if (state->wrap && state->flags) {
+                NEEDBITS(32);
+                if (hold != (state->total & 0xffffffffUL)) {
+                    strm->msg = (char *)"incorrect length check";
+                    state->mode = BAD;
+                    break;
+                }
+                INITBITS();
+                Tracev((stderr, "inflate:   length matches trailer\n"));
+            }
+#endif
+            state->mode = DONE;
+        case DONE:
+            ret = Z_STREAM_END;
+            goto inf_leave;
+        case BAD:
+            ret = Z_DATA_ERROR;
+            goto inf_leave;
+        case MEM:
+            return Z_MEM_ERROR;
+        case SYNC:
+        default:
+            return Z_STREAM_ERROR;
+        }
+
+    /*
+       Return from inflate(), updating the total counts and the check value.
+       If there was no progress during the inflate() call, return a buffer
+       error.  Call updatewindow() to create and/or update the window state.
+       Note: a memory error from inflate() is non-recoverable.
+     */
+  inf_leave:
+    RESTORE();
+    if (state->wsize || (state->mode < CHECK && out != strm->avail_out))
+        if (updatewindow(strm, out)) {
+            state->mode = MEM;
+            return Z_MEM_ERROR;
+        }
+    in -= strm->avail_in;
+    out -= strm->avail_out;
+    strm->total_in += in;
+    strm->total_out += out;
+    state->total += out;
+    if (state->wrap && out)
+        strm->adler = state->check =
+            UPDATE(state->check, strm->next_out - out, out);
+    strm->data_type = state->bits + (state->last ? 64 : 0) +
+                      (state->mode == TYPE ? 128 : 0);
+    if (((in == 0 && out == 0) || flush == Z_FINISH) && ret == Z_OK)
+        ret = Z_BUF_ERROR;
+    return ret;
+}
+
+int ZEXPORT inflateEnd(z_streamp strm)
+{
+    struct inflate_state FAR *state;
+    if (strm == Z_NULL || strm->state == Z_NULL || strm->zfree == (free_func)0)
+        return Z_STREAM_ERROR;
+    state = (struct inflate_state FAR *)strm->state;
+    if (state->window != Z_NULL) ZFREE(strm, state->window);
+    ZFREE(strm, strm->state);
+    strm->state = Z_NULL;
+    Tracev((stderr, "inflate: end\n"));
+    return Z_OK;
+}
+
+int ZEXPORT inflateSetDictionary(z_streamp strm, const Bytef *dictionary, uInt dictLength)
+{
+    struct inflate_state FAR *state;
+    unsigned long id;
+
+    /* check state */
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+    state = (struct inflate_state FAR *)strm->state;
+    if (state->wrap != 0 && state->mode != DICT)
+        return Z_STREAM_ERROR;
+
+    /* check for correct dictionary id */
+    if (state->mode == DICT) {
+        id = adler32(0L, Z_NULL, 0);
+        id = adler32(id, dictionary, dictLength);
+        if (id != state->check)
+            return Z_DATA_ERROR;
+    }
+
+    /* copy dictionary to window */
+    if (updatewindow(strm, strm->avail_out)) {
+        state->mode = MEM;
+        return Z_MEM_ERROR;
+    }
+    if (dictLength > state->wsize) {
+        zmemcpy(state->window, dictionary + dictLength - state->wsize,
+                state->wsize);
+        state->whave = state->wsize;
+    }
+    else {
+        zmemcpy(state->window + state->wsize - dictLength, dictionary,
+                dictLength);
+        state->whave = dictLength;
+    }
+    state->havedict = 1;
+    Tracev((stderr, "inflate:   dictionary set\n"));
+    return Z_OK;
+}
+
+int ZEXPORT inflateGetHeader(z_streamp strm, gz_headerp head)
+{
+    struct inflate_state FAR *state;
+
+    /* check state */
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+    state = (struct inflate_state FAR *)strm->state;
+    if ((state->wrap & 2) == 0) return Z_STREAM_ERROR;
+
+    /* save header structure */
+    state->head = head;
+    head->done = 0;
+    return Z_OK;
+}
+
+/*
+   Search buf[0..len-1] for the pattern: 0, 0, 0xff, 0xff.  Return when found
+   or when out of input.  When called, *have is the number of pattern bytes
+   found in order so far, in 0..3.  On return *have is updated to the new
+   state.  If on return *have equals four, then the pattern was found and the
+   return value is how many bytes were read including the last byte of the
+   pattern.  If *have is less than four, then the pattern has not been found
+   yet and the return value is len.  In the latter case, syncsearch() can be
+   called again with more data and the *have state.  *have is initialized to
+   zero for the first call.
+ */
+local unsigned syncsearch(unsigned FAR *have, unsigned char FAR *buf, unsigned len)
+{
+    unsigned got;
+    unsigned next;
+
+    got = *have;
+    next = 0;
+    while (next < len && got < 4) {
+        if ((int)(buf[next]) == (got < 2 ? 0 : 0xff))
+            got++;
+        else if (buf[next])
+            got = 0;
+        else
+            got = 4 - got;
+        next++;
+    }
+    *have = got;
+    return next;
+}
+
+int ZEXPORT inflateSync(z_streamp strm)
+{
+    unsigned len;               /* number of bytes to look at or looked at */
+    unsigned long in, out;      /* temporary to save total_in and total_out */
+    unsigned char buf[4];       /* to restore bit buffer to byte string */
+    struct inflate_state FAR *state;
+
+    /* check parameters */
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+    state = (struct inflate_state FAR *)strm->state;
+    if (strm->avail_in == 0 && state->bits < 8) return Z_BUF_ERROR;
+
+    /* if first time, start search in bit buffer */
+    if (state->mode != SYNC) {
+        state->mode = SYNC;
+        state->hold <<= state->bits & 7;
+        state->bits -= state->bits & 7;
+        len = 0;
+        while (state->bits >= 8) {
+            buf[len++] = (unsigned char)(state->hold);
+            state->hold >>= 8;
+            state->bits -= 8;
+        }
+        state->have = 0;
+        syncsearch(&(state->have), buf, len);
+    }
+
+    /* search available input */
+    len = syncsearch(&(state->have), strm->next_in, strm->avail_in);
+    strm->avail_in -= len;
+    strm->next_in += len;
+    strm->total_in += len;
+
+    /* return no joy or set up to restart inflate() on a new block */
+    if (state->have != 4) return Z_DATA_ERROR;
+    in = strm->total_in;  out = strm->total_out;
+    inflateReset(strm);
+    strm->total_in = in;  strm->total_out = out;
+    state->mode = TYPE;
+    return Z_OK;
+}
+
+/*
+   Returns true if inflate is currently at the end of a block generated by
+   Z_SYNC_FLUSH or Z_FULL_FLUSH. This function is used by one PPP
+   implementation to provide an additional safety check. PPP uses
+   Z_SYNC_FLUSH but removes the length bytes of the resulting empty stored
+   block. When decompressing, PPP checks that at the end of input packet,
+   inflate is waiting for these length bytes.
+ */
+int ZEXPORT inflateSyncPoint(z_streamp strm)
+{
+    struct inflate_state FAR *state;
+
+    if (strm == Z_NULL || strm->state == Z_NULL) return Z_STREAM_ERROR;
+    state = (struct inflate_state FAR *)strm->state;
+    return state->mode == STORED && state->bits == 0;
+}
+
+int ZEXPORT inflateCopy(z_streamp dest, z_streamp source)
+{
+    struct inflate_state FAR *state;
+    struct inflate_state FAR *copy;
+    unsigned char FAR *window;
+    unsigned wsize;
+
+    /* check input */
+    if (dest == Z_NULL || source == Z_NULL || source->state == Z_NULL ||
+        source->zalloc == (alloc_func)0 || source->zfree == (free_func)0)
+        return Z_STREAM_ERROR;
+    state = (struct inflate_state FAR *)source->state;
+
+    /* allocate space */
+    copy = (struct inflate_state FAR *)
+           ZALLOC(source, 1, sizeof(struct inflate_state));
+    if (copy == Z_NULL) return Z_MEM_ERROR;
+    window = Z_NULL;
+    if (state->window != Z_NULL) {
+        window = (unsigned char FAR *)
+                 ZALLOC(source, 1U << state->wbits, sizeof(unsigned char));
+        if (window == Z_NULL) {
+            ZFREE(source, copy);
+            return Z_MEM_ERROR;
+        }
+    }
+
+    /* copy state */
+    zmemcpy(dest, source, sizeof(z_stream));
+    zmemcpy(copy, state, sizeof(struct inflate_state));
+    if (state->lencode >= state->codes &&
+        state->lencode <= state->codes + ENOUGH - 1) {
+        copy->lencode = copy->codes + (state->lencode - state->codes);
+        copy->distcode = copy->codes + (state->distcode - state->codes);
+    }
+    copy->next = copy->codes + (state->next - state->codes);
+    if (window != Z_NULL) {
+        wsize = 1U << state->wbits;
+        zmemcpy(window, state->window, wsize);
+    }
+    copy->window = window;
+    dest->state = (struct internal_state FAR *)copy;
+    return Z_OK;
+}
diff --git a/updater/zlib123/inflate.h b/updater/zlib123/inflate.h
new file mode 100644
index 0000000..fbbc871
--- /dev/null
+++ b/updater/zlib123/inflate.h
@@ -0,0 +1,115 @@
+/* inflate.h -- internal inflate state definition
+ * Copyright (C) 1995-2004 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+   part of the implementation of the compression library and is
+   subject to change. Applications should only use zlib.h.
+ */
+
+/* define NO_GZIP when compiling if you want to disable gzip header and
+   trailer decoding by inflate().  NO_GZIP would be used to avoid linking in
+   the crc code when it is not needed.  For shared libraries, gzip decoding
+   should be left enabled. */
+#ifndef NO_GZIP
+#  define GUNZIP
+#endif
+
+/* Possible inflate modes between inflate() calls */
+typedef enum {
+    HEAD,       /* i: waiting for magic header */
+    FLAGS,      /* i: waiting for method and flags (gzip) */
+    TIME,       /* i: waiting for modification time (gzip) */
+    OS,         /* i: waiting for extra flags and operating system (gzip) */
+    EXLEN,      /* i: waiting for extra length (gzip) */
+    EXTRA,      /* i: waiting for extra bytes (gzip) */
+    NAME,       /* i: waiting for end of file name (gzip) */
+    COMMENT,    /* i: waiting for end of comment (gzip) */
+    HCRC,       /* i: waiting for header crc (gzip) */
+    DICTID,     /* i: waiting for dictionary check value */
+    DICT,       /* waiting for inflateSetDictionary() call */
+        TYPE,       /* i: waiting for type bits, including last-flag bit */
+        TYPEDO,     /* i: same, but skip check to exit inflate on new block */
+        STORED,     /* i: waiting for stored size (length and complement) */
+        COPY,       /* i/o: waiting for input or output to copy stored block */
+        TABLE,      /* i: waiting for dynamic block table lengths */
+        LENLENS,    /* i: waiting for code length code lengths */
+        CODELENS,   /* i: waiting for length/lit and distance code lengths */
+            LEN,        /* i: waiting for length/lit code */
+            LENEXT,     /* i: waiting for length extra bits */
+            DIST,       /* i: waiting for distance code */
+            DISTEXT,    /* i: waiting for distance extra bits */
+            MATCH,      /* o: waiting for output space to copy string */
+            LIT,        /* o: waiting for output space to write literal */
+    CHECK,      /* i: waiting for 32-bit check value */
+    LENGTH,     /* i: waiting for 32-bit length (gzip) */
+    DONE,       /* finished check, done -- remain here until reset */
+    BAD,        /* got a data error -- remain here until reset */
+    MEM,        /* got an inflate() memory error -- remain here until reset */
+    SYNC        /* looking for synchronization bytes to restart inflate() */
+} inflate_mode;
+
+/*
+    State transitions between above modes -
+
+    (most modes can go to the BAD or MEM mode -- not shown for clarity)
+
+    Process header:
+        HEAD -> (gzip) or (zlib)
+        (gzip) -> FLAGS -> TIME -> OS -> EXLEN -> EXTRA -> NAME
+        NAME -> COMMENT -> HCRC -> TYPE
+        (zlib) -> DICTID or TYPE
+        DICTID -> DICT -> TYPE
+    Read deflate blocks:
+            TYPE -> STORED or TABLE or LEN or CHECK
+            STORED -> COPY -> TYPE
+            TABLE -> LENLENS -> CODELENS -> LEN
+    Read deflate codes:
+                LEN -> LENEXT or LIT or TYPE
+                LENEXT -> DIST -> DISTEXT -> MATCH -> LEN
+                LIT -> LEN
+    Process trailer:
+        CHECK -> LENGTH -> DONE
+ */
+
+/* state maintained between inflate() calls.  Approximately 7K bytes. */
+struct inflate_state {
+    inflate_mode mode;          /* current inflate mode */
+    int last;                   /* true if processing last block */
+    int wrap;                   /* bit 0 true for zlib, bit 1 true for gzip */
+    int havedict;               /* true if dictionary provided */
+    int flags;                  /* gzip header method and flags (0 if zlib) */
+    unsigned dmax;              /* zlib header max distance (INFLATE_STRICT) */
+    unsigned long check;        /* protected copy of check value */
+    unsigned long total;        /* protected copy of output count */
+    gz_headerp head;            /* where to save gzip header information */
+        /* sliding window */
+    unsigned wbits;             /* log base 2 of requested window size */
+    unsigned wsize;             /* window size or zero if not using window */
+    unsigned whave;             /* valid bytes in the window */
+    unsigned write;             /* window write index */
+    unsigned char FAR *window;  /* allocated sliding window, if needed */
+        /* bit accumulator */
+    unsigned long hold;         /* input bit accumulator */
+    unsigned bits;              /* number of bits in "in" */
+        /* for string and stored block copying */
+    unsigned length;            /* literal or length of data to copy */
+    unsigned offset;            /* distance back to copy string from */
+        /* for table and code decoding */
+    unsigned extra;             /* extra bits needed */
+        /* fixed and dynamic code tables */
+    code const FAR *lencode;    /* starting table for length/literal codes */
+    code const FAR *distcode;   /* starting table for distance codes */
+    unsigned lenbits;           /* index bits for lencode */
+    unsigned distbits;          /* index bits for distcode */
+        /* dynamic table building */
+    unsigned ncode;             /* number of code length code lengths */
+    unsigned nlen;              /* number of length code lengths */
+    unsigned ndist;             /* number of distance code lengths */
+    unsigned have;              /* number of code lengths in lens[] */
+    code FAR *next;             /* next available space in codes[] */
+    unsigned short lens[320];   /* temporary storage for code lengths */
+    unsigned short work[288];   /* work area for code table building */
+    code codes[ENOUGH];         /* space for code tables */
+};
diff --git a/updater/zlib123/inftrees.c b/updater/zlib123/inftrees.c
new file mode 100644
index 0000000..4b33af8
--- /dev/null
+++ b/updater/zlib123/inftrees.c
@@ -0,0 +1,323 @@
+/* inftrees.c -- generate Huffman trees for efficient decoding
+ * Copyright (C) 1995-2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+
+#define MAXBITS 15
+
+const char inflate_copyright[] =
+   " inflate 1.2.3 Copyright 1995-2005 Mark Adler ";
+/*
+  If you use the zlib library in a product, an acknowledgment is welcome
+  in the documentation of your product. If for some reason you cannot
+  include such an acknowledgment, I would appreciate that you keep this
+  copyright string in the executable of your product.
+ */
+
+/*
+   Build a set of tables to decode the provided canonical Huffman code.
+   The code lengths are lens[0..codes-1].  The result starts at *table,
+   whose indices are 0..2^bits-1.  work is a writable array of at least
+   lens shorts, which is used as a work area.  type is the type of code
+   to be generated, CODES, LENS, or DISTS.  On return, zero is success,
+   -1 is an invalid code, and +1 means that ENOUGH isn't enough.  table
+   on return points to the next available entry's address.  bits is the
+   requested root table index bits, and on return it is the actual root
+   table index bits.  It will differ if the request is greater than the
+   longest code or if it is less than the shortest code.
+ */
+int inflate_table(codetype type, unsigned short FAR *lens, unsigned codes, code FAR * FAR *table, unsigned FAR *bits, unsigned short FAR *work)
+{
+    unsigned len;               /* a code's length in bits */
+    unsigned sym;               /* index of code symbols */
+    unsigned min, max;          /* minimum and maximum code lengths */
+    unsigned root;              /* number of index bits for root table */
+    unsigned curr;              /* number of index bits for current table */
+    unsigned drop;              /* code bits to drop for sub-table */
+    int left;                   /* number of prefix codes available */
+    unsigned used;              /* code entries in table used */
+    unsigned huff;              /* Huffman code */
+    unsigned incr;              /* for incrementing code, index */
+    unsigned fill;              /* index for replicating entries */
+    unsigned low;               /* low bits for current root entry */
+    unsigned mask;              /* mask for low root bits */
+    code thisc;                  /* table entry for duplication */
+    code FAR *next;             /* next available space in table */
+    const unsigned short FAR *base;     /* base value table to use */
+    const unsigned short FAR *extra;    /* extra bits table to use */
+    int end;                    /* use base and extra for symbol > end */
+    unsigned short count[MAXBITS+1];    /* number of codes of each length */
+    unsigned short offs[MAXBITS+1];     /* offsets in table for each length */
+    static const unsigned short lbase[31] = { /* Length codes 257..285 base */
+        3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
+        35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};
+    static const unsigned short lext[31] = { /* Length codes 257..285 extra */
+        16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,
+        19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 201, 196};
+    static const unsigned short dbase[32] = { /* Distance codes 0..29 base */
+        1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
+        257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
+        8193, 12289, 16385, 24577, 0, 0};
+    static const unsigned short dext[32] = { /* Distance codes 0..29 extra */
+        16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,
+        23, 23, 24, 24, 25, 25, 26, 26, 27, 27,
+        28, 28, 29, 29, 64, 64};
+
+    /*
+       Process a set of code lengths to create a canonical Huffman code.  The
+       code lengths are lens[0..codes-1].  Each length corresponds to the
+       symbols 0..codes-1.  The Huffman code is generated by first sorting the
+       symbols by length from short to long, and retaining the symbol order
+       for codes with equal lengths.  Then the code starts with all zero bits
+       for the first code of the shortest length, and the codes are integer
+       increments for the same length, and zeros are appended as the length
+       increases.  For the deflate format, these bits are stored backwards
+       from their more natural integer increment ordering, and so when the
+       decoding tables are built in the large loop below, the integer codes
+       are incremented backwards.
+
+       This routine assumes, but does not check, that all of the entries in
+       lens[] are in the range 0..MAXBITS.  The caller must assure this.
+       1..MAXBITS is interpreted as that code length.  zero means that that
+       symbol does not occur in this code.
+
+       The codes are sorted by computing a count of codes for each length,
+       creating from that a table of starting indices for each length in the
+       sorted table, and then entering the symbols in order in the sorted
+       table.  The sorted table is work[], with that space being provided by
+       the caller.
+
+       The length counts are used for other purposes as well, i.e. finding
+       the minimum and maximum length codes, determining if there are any
+       codes at all, checking for a valid set of lengths, and looking ahead
+       at length counts to determine sub-table sizes when building the
+       decoding tables.
+     */
+
+    /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */
+    for (len = 0; len <= MAXBITS; len++)
+        count[len] = 0;
+    for (sym = 0; sym < codes; sym++)
+        count[lens[sym]]++;
+
+    /* bound code lengths, force root to be within code lengths */
+    root = *bits;
+    for (max = MAXBITS; max >= 1; max--)
+        if (count[max] != 0) break;
+    if (root > max) root = max;
+    if (max == 0) {                     /* no symbols to code at all */
+        thisc.op = (unsigned char)64;    /* invalid code marker */
+        thisc.bits = (unsigned char)1;
+        thisc.val = (unsigned short)0;
+        *(*table)++ = thisc;             /* make a table to force an error */
+        *(*table)++ = thisc;
+        *bits = 1;
+        return 0;     /* no symbols, but wait for decoding to report error */
+    }
+    for (min = 1; min <= MAXBITS; min++)
+        if (count[min] != 0) break;
+    if (root < min) root = min;
+
+    /* check for an over-subscribed or incomplete set of lengths */
+    left = 1;
+    for (len = 1; len <= MAXBITS; len++) {
+        left <<= 1;
+        left -= count[len];
+        if (left < 0) return -1;        /* over-subscribed */
+    }
+    if (left > 0 && (type == CODES || max != 1))
+        return -1;                      /* incomplete set */
+
+    /* generate offsets into symbol table for each length for sorting */
+    offs[1] = 0;
+    for (len = 1; len < MAXBITS; len++)
+        offs[len + 1] = offs[len] + count[len];
+
+    /* sort symbols by length, by symbol order within each length */
+    for (sym = 0; sym < codes; sym++)
+        if (lens[sym] != 0) work[offs[lens[sym]]++] = (unsigned short)sym;
+
+    /*
+       Create and fill in decoding tables.  In this loop, the table being
+       filled is at next and has curr index bits.  The code being used is huff
+       with length len.  That code is converted to an index by dropping drop
+       bits off of the bottom.  For codes where len is less than drop + curr,
+       those top drop + curr - len bits are incremented through all values to
+       fill the table with replicated entries.
+
+       root is the number of index bits for the root table.  When len exceeds
+       root, sub-tables are created pointed to by the root entry with an index
+       of the low root bits of huff.  This is saved in low to check for when a
+       new sub-table should be started.  drop is zero when the root table is
+       being filled, and drop is root when sub-tables are being filled.
+
+       When a new sub-table is needed, it is necessary to look ahead in the
+       code lengths to determine what size sub-table is needed.  The length
+       counts are used for this, and so count[] is decremented as codes are
+       entered in the tables.
+
+       used keeps track of how many table entries have been allocated from the
+       provided *table space.  It is checked when a LENS table is being made
+       against the space in *table, ENOUGH, minus the maximum space needed by
+       the worst case distance code, MAXD.  This should never happen, but the
+       sufficiency of ENOUGH has not been proven exhaustively, hence the check.
+       This assumes that when type == LENS, bits == 9.
+
+       sym increments through all symbols, and the loop terminates when
+       all codes of length max, i.e. all codes, have been processed.  This
+       routine permits incomplete codes, so another loop after this one fills
+       in the rest of the decoding tables with invalid code markers.
+     */
+
+    /* set up for code type */
+    switch (type) {
+    case CODES:
+        base = extra = work;    /* dummy value--not used */
+        end = 19;
+        break;
+    case LENS:
+        base = lbase;
+        base -= 257;
+        extra = lext;
+        extra -= 257;
+        end = 256;
+        break;
+    default:            /* DISTS */
+        base = dbase;
+        extra = dext;
+        end = -1;
+    }
+
+    /* initialize state for loop */
+    huff = 0;                   /* starting code */
+    sym = 0;                    /* starting code symbol */
+    len = min;                  /* starting code length */
+    next = *table;              /* current table to fill in */
+    curr = root;                /* current table index bits */
+    drop = 0;                   /* current bits to drop from code for index */
+    low = (unsigned)(-1);       /* trigger new sub-table when len > root */
+    used = 1U << root;          /* use root table entries */
+    mask = used - 1;            /* mask for comparing low */
+
+    /* check available table space */
+    if (type == LENS && used >= ENOUGH - MAXD)
+        return 1;
+
+    /* process all codes and make table entries */
+    for (;;) {
+        /* create table entry */
+        thisc.bits = (unsigned char)(len - drop);
+        if ((int)(work[sym]) < end) {
+            thisc.op = (unsigned char)0;
+            thisc.val = work[sym];
+        }
+        else if ((int)(work[sym]) > end) {
+            thisc.op = (unsigned char)(extra[work[sym]]);
+            thisc.val = base[work[sym]];
+        }
+        else {
+            thisc.op = (unsigned char)(32 + 64);         /* end of block */
+            thisc.val = 0;
+        }
+
+        /* replicate for those indices with low len bits equal to huff */
+        incr = 1U << (len - drop);
+        fill = 1U << curr;
+        min = fill;                 /* save offset to next table */
+        do {
+            fill -= incr;
+            next[(huff >> drop) + fill] = thisc;
+        } while (fill != 0);
+
+        /* backwards increment the len-bit code huff */
+        incr = 1U << (len - 1);
+        while (huff & incr)
+            incr >>= 1;
+        if (incr != 0) {
+            huff &= incr - 1;
+            huff += incr;
+        }
+        else
+            huff = 0;
+
+        /* go to next symbol, update count, len */
+        sym++;
+        if (--(count[len]) == 0) {
+            if (len == max) break;
+            len = lens[work[sym]];
+        }
+
+        /* create new sub-table if needed */
+        if (len > root && (huff & mask) != low) {
+            /* if first time, transition to sub-tables */
+            if (drop == 0)
+                drop = root;
+
+            /* increment past last table */
+            next += min;            /* here min is 1 << curr */
+
+            /* determine length of next table */
+            curr = len - drop;
+            left = (int)(1 << curr);
+            while (curr + drop < max) {
+                left -= count[curr + drop];
+                if (left <= 0) break;
+                curr++;
+                left <<= 1;
+            }
+
+            /* check for enough space */
+            used += 1U << curr;
+            if (type == LENS && used >= ENOUGH - MAXD)
+                return 1;
+
+            /* point entry in root table to sub-table */
+            low = huff & mask;
+            (*table)[low].op = (unsigned char)curr;
+            (*table)[low].bits = (unsigned char)root;
+            (*table)[low].val = (unsigned short)(next - *table);
+        }
+    }
+
+    /*
+       Fill in rest of table for incomplete codes.  This loop is similar to the
+       loop above in incrementing huff for table indices.  It is assumed that
+       len is equal to curr + drop, so there is no loop needed to increment
+       through high index bits.  When the current sub-table is filled, the loop
+       drops back to the root table to fill in any remaining entries there.
+     */
+    thisc.op = (unsigned char)64;                /* invalid code marker */
+    thisc.bits = (unsigned char)(len - drop);
+    thisc.val = (unsigned short)0;
+    while (huff != 0) {
+        /* when done with sub-table, drop back to root table */
+        if (drop != 0 && (huff & mask) != low) {
+            drop = 0;
+            len = root;
+            next = *table;
+            thisc.bits = (unsigned char)len;
+        }
+
+        /* put invalid code marker in table */
+        next[huff >> drop] = thisc;
+
+        /* backwards increment the len-bit code huff */
+        incr = 1U << (len - 1);
+        while (huff & incr)
+            incr >>= 1;
+        if (incr != 0) {
+            huff &= incr - 1;
+            huff += incr;
+        }
+        else
+            huff = 0;
+    }
+
+    /* set return parameters */
+    *table += used;
+    *bits = root;
+    return 0;
+}
diff --git a/updater/zlib123/inftrees.h b/updater/zlib123/inftrees.h
new file mode 100644
index 0000000..dc0fd56
--- /dev/null
+++ b/updater/zlib123/inftrees.h
@@ -0,0 +1,55 @@
+/* inftrees.h -- header to use inftrees.c
+ * Copyright (C) 1995-2005 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+   part of the implementation of the compression library and is
+   subject to change. Applications should only use zlib.h.
+ */
+
+/* Structure for decoding tables.  Each entry provides either the
+   information needed to do the operation requested by the code that
+   indexed that table entry, or it provides a pointer to another
+   table that indexes more bits of the code.  op indicates whether
+   the entry is a pointer to another table, a literal, a length or
+   distance, an end-of-block, or an invalid code.  For a table
+   pointer, the low four bits of op is the number of index bits of
+   that table.  For a length or distance, the low four bits of op
+   is the number of extra bits to get after the code.  bits is
+   the number of bits in this code or part of the code to drop off
+   of the bit buffer.  val is the actual byte to output in the case
+   of a literal, the base length or distance, or the offset from
+   the current table to the next table.  Each entry is four bytes. */
+typedef struct {
+    unsigned char op;           /* operation, extra bits, table bits */
+    unsigned char bits;         /* bits in this part of the code */
+    unsigned short val;         /* offset in table or code value */
+} code;
+
+/* op values as set by inflate_table():
+    00000000 - literal
+    0000tttt - table link, tttt != 0 is the number of table index bits
+    0001eeee - length or distance, eeee is the number of extra bits
+    01100000 - end of block
+    01000000 - invalid code
+ */
+
+/* Maximum size of dynamic tree.  The maximum found in a long but non-
+   exhaustive search was 1444 code structures (852 for length/literals
+   and 592 for distances, the latter actually the result of an
+   exhaustive search).  The true maximum is not known, but the value
+   below is more than safe. */
+#define ENOUGH 2048
+#define MAXD 592
+
+/* Type of code to build for inftable() */
+typedef enum {
+    CODES,
+    LENS,
+    DISTS
+} codetype;
+
+extern int inflate_table OF((codetype type, unsigned short FAR *lens,
+                             unsigned codes, code FAR * FAR *table,
+                             unsigned FAR *bits, unsigned short FAR *work));
diff --git a/updater/zlib123/make_vms.com b/updater/zlib123/make_vms.com
new file mode 100644
index 0000000..93174bb
--- /dev/null
+++ b/updater/zlib123/make_vms.com
@@ -0,0 +1,461 @@
+$! make libz under VMS written by
+$! Martin P.J. Zinser
+$! <zinser@zinser.no-ip.info or zinser@sysdev.deutsche-boerse.com>
+$!
+$ on error then goto err_exit
+$!
+$!
+$! Just some general constants...
+$!
+$ true  = 1
+$ false = 0
+$ tmpnam = "temp_" + f$getjpi("","pid")
+$ SAY = "WRITE SYS$OUTPUT"
+$!
+$! Setup variables holding "config" information
+$!
+$ Make     = ""
+$ name     = "Zlib"
+$ version  = "?.?.?"
+$ v_string = "ZLIB_VERSION"
+$ v_file   = "zlib.h"
+$ ccopt    = ""
+$ lopts    = ""
+$ linkonly = false
+$ optfile  = name + ".opt"
+$ its_decc = false
+$ its_vaxc = false
+$ its_gnuc = false
+$ axp      = f$getsyi("HW_MODEL").ge.1024
+$ s_case   = false
+$! Check for MMK/MMS
+$!
+$ If F$Search ("Sys$System:MMS.EXE") .nes. "" Then Make = "MMS"
+$ If F$Type (MMK) .eqs. "STRING" Then Make = "MMK"
+$!
+$!
+$ gosub find_version
+$!
+$ gosub check_opts
+$!
+$! Look for the compiler used
+$!
+$ gosub check_compiler
+$ if its_decc
+$ then
+$   ccopt = "/prefix=all" + ccopt
+$   if f$trnlnm("SYS") .eqs. ""
+$   then
+$     if axp
+$     then
+$       define sys sys$library:
+$     else
+$       ccopt = "/decc" + ccopt
+$       define sys decc$library_include:
+$     endif
+$   endif
+$ endif
+$ if its_vaxc .or. its_gnuc
+$ then
+$    if f$trnlnm("SYS").eqs."" then define sys sys$library:
+$ endif
+$!
+$! Build the thing plain or with mms
+$!
+$ write sys$output "Compiling Zlib sources ..."
+$ if make.eqs.""
+$  then
+$   dele example.obj;*,minigzip.obj;*
+$   CALL MAKE adler32.OBJ "CC ''CCOPT' adler32" -
+                adler32.c zlib.h zconf.h
+$   CALL MAKE compress.OBJ "CC ''CCOPT' compress" -
+                compress.c zlib.h zconf.h
+$   CALL MAKE crc32.OBJ "CC ''CCOPT' crc32" -
+                crc32.c zlib.h zconf.h
+$   CALL MAKE deflate.OBJ "CC ''CCOPT' deflate" -
+                deflate.c deflate.h zutil.h zlib.h zconf.h
+$   CALL MAKE gzio.OBJ "CC ''CCOPT' gzio" -
+                gzio.c zutil.h zlib.h zconf.h
+$   CALL MAKE infback.OBJ "CC ''CCOPT' infback" -
+                infback.c zutil.h inftrees.h inflate.h inffast.h inffixed.h
+$   CALL MAKE inffast.OBJ "CC ''CCOPT' inffast" -
+                inffast.c zutil.h zlib.h zconf.h inffast.h
+$   CALL MAKE inflate.OBJ "CC ''CCOPT' inflate" -
+                inflate.c zutil.h zlib.h zconf.h infblock.h
+$   CALL MAKE inftrees.OBJ "CC ''CCOPT' inftrees" -
+                inftrees.c zutil.h zlib.h zconf.h inftrees.h
+$   CALL MAKE trees.OBJ "CC ''CCOPT' trees" -
+                trees.c deflate.h zutil.h zlib.h zconf.h
+$   CALL MAKE uncompr.OBJ "CC ''CCOPT' uncompr" -
+                uncompr.c zlib.h zconf.h
+$   CALL MAKE zutil.OBJ "CC ''CCOPT' zutil" -
+                zutil.c zutil.h zlib.h zconf.h
+$   write sys$output "Building Zlib ..."
+$   CALL MAKE libz.OLB "lib/crea libz.olb *.obj" *.OBJ
+$   write sys$output "Building example..."
+$   CALL MAKE example.OBJ "CC ''CCOPT' example" -
+                example.c zlib.h zconf.h
+$   call make example.exe "LINK example,libz.olb/lib" example.obj libz.olb
+$   if f$search("x11vms:xvmsutils.olb") .nes. ""
+$   then
+$     write sys$output "Building minigzip..."
+$     CALL MAKE minigzip.OBJ "CC ''CCOPT' minigzip" -
+                minigzip.c zlib.h zconf.h
+$     call make minigzip.exe -
+                "LINK minigzip,libz.olb/lib,x11vms:xvmsutils.olb/lib" -
+                minigzip.obj libz.olb
+$   endif
+$  else
+$   gosub crea_mms
+$   SAY "Make ''name' ''version' with ''Make' "
+$   'make'
+$  endif
+$!
+$! Alpha gets a shareable image
+$!
+$ If axp
+$ Then
+$   gosub crea_olist
+$   write sys$output "Creating libzshr.exe"
+$   call anal_obj_axp modules.opt _link.opt
+$   if s_case
+$   then
+$      open/append optf modules.opt
+$      write optf "case_sensitive=YES"
+$      close optf
+$   endif
+$   LINK_'lopts'/SHARE=libzshr.exe modules.opt/opt,_link.opt/opt
+$ endif
+$ write sys$output "Zlib build completed"
+$ exit
+$CC_ERR:
+$ write sys$output "C compiler required to build ''name'"
+$ goto err_exit
+$ERR_EXIT:
+$ set message/facil/ident/sever/text
+$ write sys$output "Exiting..."
+$ exit 2
+$!
+$!
+$MAKE: SUBROUTINE   !SUBROUTINE TO CHECK DEPENDENCIES
+$ V = 'F$Verify(0)
+$! P1 = What we are trying to make
+$! P2 = Command to make it
+$! P3 - P8  What it depends on
+$
+$ If F$Search(P1) .Eqs. "" Then Goto Makeit
+$ Time = F$CvTime(F$File(P1,"RDT"))
+$arg=3
+$Loop:
+$       Argument = P'arg
+$       If Argument .Eqs. "" Then Goto Exit
+$       El=0
+$Loop2:
+$       File = F$Element(El," ",Argument)
+$       If File .Eqs. " " Then Goto Endl
+$       AFile = ""
+$Loop3:
+$       OFile = AFile
+$       AFile = F$Search(File)
+$       If AFile .Eqs. "" .Or. AFile .Eqs. OFile Then Goto NextEl
+$       If F$CvTime(F$File(AFile,"RDT")) .Ges. Time Then Goto Makeit
+$       Goto Loop3
+$NextEL:
+$       El = El + 1
+$       Goto Loop2
+$EndL:
+$ arg=arg+1
+$ If arg .Le. 8 Then Goto Loop
+$ Goto Exit
+$
+$Makeit:
+$ VV=F$VERIFY(0)
+$ write sys$output P2
+$ 'P2
+$ VV='F$Verify(VV)
+$Exit:
+$ If V Then Set Verify
+$ENDSUBROUTINE
+$!------------------------------------------------------------------------------
+$!
+$! Check command line options and set symbols accordingly
+$!
+$ CHECK_OPTS:
+$ i = 1
+$ OPT_LOOP:
+$ if i .lt. 9
+$ then
+$   cparm = f$edit(p'i',"upcase")
+$   if cparm .eqs. "DEBUG"
+$   then
+$     ccopt = ccopt + "/noopt/deb"
+$     lopts = lopts + "/deb"
+$   endif
+$   if f$locate("CCOPT=",cparm) .lt. f$length(cparm)
+$   then
+$     start = f$locate("=",cparm) + 1
+$     len   = f$length(cparm) - start
+$     ccopt = ccopt + f$extract(start,len,cparm)
+$     if f$locate("AS_IS",f$edit(ccopt,"UPCASE")) .lt. f$length(ccopt) -
+         then s_case = true
+$   endif
+$   if cparm .eqs. "LINK" then linkonly = true
+$   if f$locate("LOPTS=",cparm) .lt. f$length(cparm)
+$   then
+$     start = f$locate("=",cparm) + 1
+$     len   = f$length(cparm) - start
+$     lopts = lopts + f$extract(start,len,cparm)
+$   endif
+$   if f$locate("CC=",cparm) .lt. f$length(cparm)
+$   then
+$     start  = f$locate("=",cparm) + 1
+$     len    = f$length(cparm) - start
+$     cc_com = f$extract(start,len,cparm)
+      if (cc_com .nes. "DECC") .and. -
+         (cc_com .nes. "VAXC") .and. -
+	 (cc_com .nes. "GNUC")
+$     then
+$       write sys$output "Unsupported compiler choice ''cc_com' ignored"
+$       write sys$output "Use DECC, VAXC, or GNUC instead"
+$     else
+$     	if cc_com .eqs. "DECC" then its_decc = true
+$     	if cc_com .eqs. "VAXC" then its_vaxc = true
+$     	if cc_com .eqs. "GNUC" then its_gnuc = true
+$     endif
+$   endif
+$   if f$locate("MAKE=",cparm) .lt. f$length(cparm)
+$   then
+$     start  = f$locate("=",cparm) + 1
+$     len    = f$length(cparm) - start
+$     mmks = f$extract(start,len,cparm)
+$     if (mmks .eqs. "MMK") .or. (mmks .eqs. "MMS")
+$     then
+$       make = mmks
+$     else
+$       write sys$output "Unsupported make choice ''mmks' ignored"
+$       write sys$output "Use MMK or MMS instead"
+$     endif
+$   endif
+$   i = i + 1
+$   goto opt_loop
+$ endif
+$ return
+$!------------------------------------------------------------------------------
+$!
+$! Look for the compiler used
+$!
+$CHECK_COMPILER:
+$ if (.not. (its_decc .or. its_vaxc .or. its_gnuc))
+$ then
+$   its_decc = (f$search("SYS$SYSTEM:DECC$COMPILER.EXE") .nes. "")
+$   its_vaxc = .not. its_decc .and. (F$Search("SYS$System:VAXC.Exe") .nes. "")
+$   its_gnuc = .not. (its_decc .or. its_vaxc) .and. (f$trnlnm("gnu_cc") .nes. "")
+$ endif
+$!
+$! Exit if no compiler available
+$!
+$ if (.not. (its_decc .or. its_vaxc .or. its_gnuc))
+$ then goto CC_ERR
+$ else
+$   if its_decc then write sys$output "CC compiler check ... Compaq C"
+$   if its_vaxc then write sys$output "CC compiler check ... VAX C"
+$   if its_gnuc then write sys$output "CC compiler check ... GNU C"
+$ endif
+$ return
+$!------------------------------------------------------------------------------
+$!
+$! If MMS/MMK are available dump out the descrip.mms if required
+$!
+$CREA_MMS:
+$ write sys$output "Creating descrip.mms..."
+$ create descrip.mms
+$ open/append out descrip.mms
+$ copy sys$input: out
+$ deck
+# descrip.mms: MMS description file for building zlib on VMS
+# written by Martin P.J. Zinser
+# <zinser@zinser.no-ip.info or zinser@sysdev.deutsche-boerse.com>
+
+OBJS = adler32.obj, compress.obj, crc32.obj, gzio.obj, uncompr.obj, infback.obj\
+       deflate.obj, trees.obj, zutil.obj, inflate.obj, \
+       inftrees.obj, inffast.obj
+
+$ eod
+$ write out "CFLAGS=", ccopt
+$ write out "LOPTS=", lopts
+$ copy sys$input: out
+$ deck
+
+all : example.exe minigzip.exe libz.olb
+        @ write sys$output " Example applications available"
+
+libz.olb : libz.olb($(OBJS))
+	@ write sys$output " libz available"
+
+example.exe : example.obj libz.olb
+              link $(LOPTS) example,libz.olb/lib
+
+minigzip.exe : minigzip.obj libz.olb
+              link $(LOPTS) minigzip,libz.olb/lib,x11vms:xvmsutils.olb/lib
+
+clean :
+	delete *.obj;*,libz.olb;*,*.opt;*,*.exe;*
+
+
+# Other dependencies.
+adler32.obj  : adler32.c zutil.h zlib.h zconf.h
+compress.obj : compress.c zlib.h zconf.h
+crc32.obj    : crc32.c zutil.h zlib.h zconf.h
+deflate.obj  : deflate.c deflate.h zutil.h zlib.h zconf.h
+example.obj  : example.c zlib.h zconf.h
+gzio.obj     : gzio.c zutil.h zlib.h zconf.h
+inffast.obj  : inffast.c zutil.h zlib.h zconf.h inftrees.h inffast.h
+inflate.obj  : inflate.c zutil.h zlib.h zconf.h
+inftrees.obj : inftrees.c zutil.h zlib.h zconf.h inftrees.h
+minigzip.obj : minigzip.c zlib.h zconf.h
+trees.obj    : trees.c deflate.h zutil.h zlib.h zconf.h
+uncompr.obj  : uncompr.c zlib.h zconf.h
+zutil.obj    : zutil.c zutil.h zlib.h zconf.h
+infback.obj  : infback.c zutil.h inftrees.h inflate.h inffast.h inffixed.h
+$ eod
+$ close out
+$ return
+$!------------------------------------------------------------------------------
+$!
+$! Read list of core library sources from makefile.in and create options
+$! needed to build shareable image
+$!
+$CREA_OLIST:
+$ open/read min makefile.in
+$ open/write mod modules.opt
+$ src_check = "OBJS ="
+$MRLOOP:
+$ read/end=mrdone min rec
+$ if (f$extract(0,6,rec) .nes. src_check) then goto mrloop
+$ rec = rec - src_check
+$ gosub extra_filnam
+$ if (f$element(1,"\",rec) .eqs. "\") then goto mrdone
+$MRSLOOP:
+$ read/end=mrdone min rec
+$ gosub extra_filnam
+$ if (f$element(1,"\",rec) .nes. "\") then goto mrsloop
+$MRDONE:
+$ close min
+$ close mod
+$ return
+$!------------------------------------------------------------------------------
+$!
+$! Take record extracted in crea_olist and split it into single filenames
+$!
+$EXTRA_FILNAM:
+$ myrec = f$edit(rec - "\", "trim,compress")
+$ i = 0
+$FELOOP:
+$ srcfil = f$element(i," ", myrec)
+$ if (srcfil .nes. " ")
+$ then
+$   write mod f$parse(srcfil,,,"NAME"), ".obj"
+$   i = i + 1
+$   goto feloop
+$ endif
+$ return
+$!------------------------------------------------------------------------------
+$!
+$! Find current Zlib version number
+$!
+$FIND_VERSION:
+$ open/read h_in 'v_file'
+$hloop:
+$ read/end=hdone h_in rec
+$ rec = f$edit(rec,"TRIM")
+$ if (f$extract(0,1,rec) .nes. "#") then goto hloop
+$ rec = f$edit(rec - "#", "TRIM")
+$ if f$element(0," ",rec) .nes. "define" then goto hloop
+$ if f$element(1," ",rec) .eqs. v_string
+$ then
+$   version = 'f$element(2," ",rec)'
+$   goto hdone
+$ endif
+$ goto hloop
+$hdone:
+$ close h_in
+$ return
+$!------------------------------------------------------------------------------
+$!
+$! Analyze Object files for OpenVMS AXP to extract Procedure and Data
+$! information to build a symbol vector for a shareable image
+$! All the "brains" of this logic was suggested by Hartmut Becker
+$! (Hartmut.Becker@compaq.com). All the bugs were introduced by me
+$! (zinser@decus.de), so if you do have problem reports please do not
+$! bother Hartmut/HP, but get in touch with me
+$!
+$ ANAL_OBJ_AXP: Subroutine
+$ V = 'F$Verify(0)
+$ SAY := "WRITE_ SYS$OUTPUT"
+$
+$ IF F$SEARCH("''P1'") .EQS. ""
+$ THEN
+$    SAY "ANAL_OBJ_AXP-E-NOSUCHFILE:  Error, inputfile ''p1' not available"
+$    goto exit_aa
+$ ENDIF
+$ IF "''P2'" .EQS. ""
+$ THEN
+$    SAY "ANAL_OBJ_AXP:  Error, no output file provided"
+$    goto exit_aa
+$ ENDIF
+$
+$ open/read in 'p1
+$ create a.tmp
+$ open/append atmp a.tmp
+$ loop:
+$ read/end=end_loop in line
+$ f= f$search(line)
+$ if f .eqs. ""
+$ then
+$	write sys$output "ANAL_OBJ_AXP-w-nosuchfile, ''line'"
+$	goto loop
+$ endif
+$ define/user sys$output nl:
+$ define/user sys$error nl:
+$ anal/obj/gsd 'f /out=x.tmp
+$ open/read xtmp x.tmp
+$ XLOOP:
+$ read/end=end_xloop xtmp xline
+$ xline = f$edit(xline,"compress")
+$ write atmp xline
+$ goto xloop
+$ END_XLOOP:
+$ close xtmp
+$ goto loop
+$ end_loop:
+$ close in
+$ close atmp
+$ if f$search("a.tmp") .eqs. "" -
+	then $ exit
+$ ! all global definitions
+$ search a.tmp "symbol:","EGSY$V_DEF 1","EGSY$V_NORM 1"/out=b.tmp
+$ ! all procedures
+$ search b.tmp "EGSY$V_NORM 1"/wind=(0,1) /out=c.tmp
+$ search c.tmp "symbol:"/out=d.tmp
+$ define/user sys$output nl:
+$ edito/edt/command=sys$input d.tmp
+sub/symbol: "/symbol_vector=(/whole
+sub/"/=PROCEDURE)/whole
+exit
+$ ! all data
+$ search b.tmp "EGSY$V_DEF 1"/wind=(0,1) /out=e.tmp
+$ search e.tmp "symbol:"/out=f.tmp
+$ define/user sys$output nl:
+$ edito/edt/command=sys$input f.tmp
+sub/symbol: "/symbol_vector=(/whole
+sub/"/=DATA)/whole
+exit
+$ sort/nodupl d.tmp,f.tmp 'p2'
+$ delete a.tmp;*,b.tmp;*,c.tmp;*,d.tmp;*,e.tmp;*,f.tmp;*
+$ if f$search("x.tmp") .nes. "" -
+	then $ delete x.tmp;*
+$!
+$ EXIT_AA:
+$ if V then set verify
+$ endsubroutine
+$!------------------------------------------------------------------------------
diff --git a/updater/zlib123/minigzip.c b/updater/zlib123/minigzip.c
new file mode 100644
index 0000000..41996db
--- /dev/null
+++ b/updater/zlib123/minigzip.c
@@ -0,0 +1,322 @@
+/* minigzip.c -- simulate gzip using the zlib compression library
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/*
+ * minigzip is a minimal implementation of the gzip utility. This is
+ * only an example of using zlib and isn't meant to replace the
+ * full-featured gzip. No attempt is made to deal with file systems
+ * limiting names to 14 or 8+3 characters, etc... Error checking is
+ * very limited. So use minigzip only for testing; use gzip for the
+ * real thing. On MSDOS, use only on file names without extension
+ * or in pipe mode.
+ */
+
+/* @(#) $Id$ */
+
+#include <stdio.h>
+#include "zlib.h"
+
+#ifdef STDC
+#  include <string.h>
+#  include <stdlib.h>
+#endif
+
+#ifdef USE_MMAP
+#  include <sys/types.h>
+#  include <sys/mman.h>
+#  include <sys/stat.h>
+#endif
+
+#if defined(MSDOS) || defined(OS2) || defined(WIN32) || defined(__CYGWIN__)
+#  include <fcntl.h>
+#  include <io.h>
+#  define SET_BINARY_MODE(file) setmode(fileno(file), O_BINARY)
+#else
+#  define SET_BINARY_MODE(file)
+#endif
+
+#ifdef VMS
+#  define unlink delete
+#  define GZ_SUFFIX "-gz"
+#endif
+#ifdef RISCOS
+#  define unlink remove
+#  define GZ_SUFFIX "-gz"
+#  define fileno(file) file->__file
+#endif
+#if defined(__MWERKS__) && __dest_os != __be_os && __dest_os != __win32_os
+#  include <unix.h> /* for fileno */
+#endif
+
+#ifndef WIN32 /* unlink already in stdio.h for WIN32 */
+  extern int unlink OF((const char *));
+#endif
+
+#ifndef GZ_SUFFIX
+#  define GZ_SUFFIX ".gz"
+#endif
+#define SUFFIX_LEN (sizeof(GZ_SUFFIX)-1)
+
+#define BUFLEN      16384
+#define MAX_NAME_LEN 1024
+
+#ifdef MAXSEG_64K
+#  define local static
+   /* Needed for systems with limitation on stack size. */
+#else
+#  define local
+#endif
+
+char *prog;
+
+void error            OF((const char *msg));
+void gz_compress      OF((FILE   *in, gzFile out));
+#ifdef USE_MMAP
+int  gz_compress_mmap OF((FILE   *in, gzFile out));
+#endif
+void gz_uncompress    OF((gzFile in, FILE   *out));
+void file_compress    OF((char  *file, char *mode));
+void file_uncompress  OF((char  *file));
+int  main             OF((int argc, char *argv[]));
+
+/* ===========================================================================
+ * Display error message and exit
+ */
+void error(msg)
+    const char *msg;
+{
+    fprintf(stderr, "%s: %s\n", prog, msg);
+    exit(1);
+}
+
+/* ===========================================================================
+ * Compress input to output then close both files.
+ */
+
+void gz_compress(in, out)
+    FILE   *in;
+    gzFile out;
+{
+    local char buf[BUFLEN];
+    int len;
+    int err;
+
+#ifdef USE_MMAP
+    /* Try first compressing with mmap. If mmap fails (minigzip used in a
+     * pipe), use the normal fread loop.
+     */
+    if (gz_compress_mmap(in, out) == Z_OK) return;
+#endif
+    for (;;) {
+        len = (int)fread(buf, 1, sizeof(buf), in);
+        if (ferror(in)) {
+            perror("fread");
+            exit(1);
+        }
+        if (len == 0) break;
+
+        if (gzwrite(out, buf, (unsigned)len) != len) error(gzerror(out, &err));
+    }
+    fclose(in);
+    if (gzclose(out) != Z_OK) error("failed gzclose");
+}
+
+#ifdef USE_MMAP /* MMAP version, Miguel Albrecht <malbrech@eso.org> */
+
+/* Try compressing the input file at once using mmap. Return Z_OK if
+ * if success, Z_ERRNO otherwise.
+ */
+int gz_compress_mmap(in, out)
+    FILE   *in;
+    gzFile out;
+{
+    int len;
+    int err;
+    int ifd = fileno(in);
+    caddr_t buf;    /* mmap'ed buffer for the entire input file */
+    off_t buf_len;  /* length of the input file */
+    struct stat sb;
+
+    /* Determine the size of the file, needed for mmap: */
+    if (fstat(ifd, &sb) < 0) return Z_ERRNO;
+    buf_len = sb.st_size;
+    if (buf_len <= 0) return Z_ERRNO;
+
+    /* Now do the actual mmap: */
+    buf = mmap((caddr_t) 0, buf_len, PROT_READ, MAP_SHARED, ifd, (off_t)0);
+    if (buf == (caddr_t)(-1)) return Z_ERRNO;
+
+    /* Compress the whole file at once: */
+    len = gzwrite(out, (char *)buf, (unsigned)buf_len);
+
+    if (len != (int)buf_len) error(gzerror(out, &err));
+
+    munmap(buf, buf_len);
+    fclose(in);
+    if (gzclose(out) != Z_OK) error("failed gzclose");
+    return Z_OK;
+}
+#endif /* USE_MMAP */
+
+/* ===========================================================================
+ * Uncompress input to output then close both files.
+ */
+void gz_uncompress(in, out)
+    gzFile in;
+    FILE   *out;
+{
+    local char buf[BUFLEN];
+    int len;
+    int err;
+
+    for (;;) {
+        len = gzread(in, buf, sizeof(buf));
+        if (len < 0) error (gzerror(in, &err));
+        if (len == 0) break;
+
+        if ((int)fwrite(buf, 1, (unsigned)len, out) != len) {
+            error("failed fwrite");
+        }
+    }
+    if (fclose(out)) error("failed fclose");
+
+    if (gzclose(in) != Z_OK) error("failed gzclose");
+}
+
+
+/* ===========================================================================
+ * Compress the given file: create a corresponding .gz file and remove the
+ * original.
+ */
+void file_compress(file, mode)
+    char  *file;
+    char  *mode;
+{
+    local char outfile[MAX_NAME_LEN];
+    FILE  *in;
+    gzFile out;
+
+    strcpy(outfile, file);
+    strcat(outfile, GZ_SUFFIX);
+
+    in = fopen(file, "rb");
+    if (in == NULL) {
+        perror(file);
+        exit(1);
+    }
+    out = gzopen(outfile, mode);
+    if (out == NULL) {
+        fprintf(stderr, "%s: can't gzopen %s\n", prog, outfile);
+        exit(1);
+    }
+    gz_compress(in, out);
+
+    unlink(file);
+}
+
+
+/* ===========================================================================
+ * Uncompress the given file and remove the original.
+ */
+void file_uncompress(file)
+    char  *file;
+{
+    local char buf[MAX_NAME_LEN];
+    char *infile, *outfile;
+    FILE  *out;
+    gzFile in;
+    uInt len = (uInt)strlen(file);
+
+    strcpy(buf, file);
+
+    if (len > SUFFIX_LEN && strcmp(file+len-SUFFIX_LEN, GZ_SUFFIX) == 0) {
+        infile = file;
+        outfile = buf;
+        outfile[len-3] = '\0';
+    } else {
+        outfile = file;
+        infile = buf;
+        strcat(infile, GZ_SUFFIX);
+    }
+    in = gzopen(infile, "rb");
+    if (in == NULL) {
+        fprintf(stderr, "%s: can't gzopen %s\n", prog, infile);
+        exit(1);
+    }
+    out = fopen(outfile, "wb");
+    if (out == NULL) {
+        perror(file);
+        exit(1);
+    }
+
+    gz_uncompress(in, out);
+
+    unlink(infile);
+}
+
+
+/* ===========================================================================
+ * Usage:  minigzip [-d] [-f] [-h] [-r] [-1 to -9] [files...]
+ *   -d : decompress
+ *   -f : compress with Z_FILTERED
+ *   -h : compress with Z_HUFFMAN_ONLY
+ *   -r : compress with Z_RLE
+ *   -1 to -9 : compression level
+ */
+
+int main(argc, argv)
+    int argc;
+    char *argv[];
+{
+    int uncompr = 0;
+    gzFile file;
+    char outmode[20];
+
+    strcpy(outmode, "wb6 ");
+
+    prog = argv[0];
+    argc--, argv++;
+
+    while (argc > 0) {
+      if (strcmp(*argv, "-d") == 0)
+        uncompr = 1;
+      else if (strcmp(*argv, "-f") == 0)
+        outmode[3] = 'f';
+      else if (strcmp(*argv, "-h") == 0)
+        outmode[3] = 'h';
+      else if (strcmp(*argv, "-r") == 0)
+        outmode[3] = 'R';
+      else if ((*argv)[0] == '-' && (*argv)[1] >= '1' && (*argv)[1] <= '9' &&
+               (*argv)[2] == 0)
+        outmode[2] = (*argv)[1];
+      else
+        break;
+      argc--, argv++;
+    }
+    if (outmode[3] == ' ')
+        outmode[3] = 0;
+    if (argc == 0) {
+        SET_BINARY_MODE(stdin);
+        SET_BINARY_MODE(stdout);
+        if (uncompr) {
+            file = gzdopen(fileno(stdin), "rb");
+            if (file == NULL) error("can't gzdopen stdin");
+            gz_uncompress(file, stdout);
+        } else {
+            file = gzdopen(fileno(stdout), outmode);
+            if (file == NULL) error("can't gzdopen stdout");
+            gz_compress(stdin, file);
+        }
+    } else {
+        do {
+            if (uncompr) {
+                file_uncompress(*argv);
+            } else {
+                file_compress(*argv, outmode);
+            }
+        } while (argv++, --argc);
+    }
+    return 0;
+}
diff --git a/updater/zlib123/msdos/Makefile.bor b/updater/zlib123/msdos/Makefile.bor
new file mode 100644
index 0000000..27444cc
--- /dev/null
+++ b/updater/zlib123/msdos/Makefile.bor
@@ -0,0 +1,109 @@
+# Makefile for zlib
+# Borland C++
+# Last updated: 15-Mar-2003
+
+# To use, do "make -fmakefile.bor"
+# To compile in small model, set below: MODEL=s
+
+# WARNING: the small model is supported but only for small values of
+# MAX_WBITS and MAX_MEM_LEVEL. For example:
+#    -DMAX_WBITS=11 -DDEF_WBITS=11 -DMAX_MEM_LEVEL=3
+# If you wish to reduce the memory requirements (default 256K for big
+# objects plus a few K), you can add to the LOC macro below:
+#   -DMAX_MEM_LEVEL=7 -DMAX_WBITS=14
+# See zconf.h for details about the memory requirements.
+
+# ------------ Turbo C++, Borland C++ ------------
+
+#    Optional nonstandard preprocessor flags (e.g. -DMAX_MEM_LEVEL=7)
+#    should be added to the environment via "set LOCAL_ZLIB=-DFOO" or added
+#    to the declaration of LOC here:
+LOC = $(LOCAL_ZLIB)
+
+# type for CPU required: 0: 8086, 1: 80186, 2: 80286, 3: 80386, etc.
+CPU_TYP = 0
+
+# memory model: one of s, m, c, l (small, medium, compact, large)
+MODEL=l
+
+# replace bcc with tcc for Turbo C++ 1.0, with bcc32 for the 32 bit version
+CC=bcc
+LD=bcc
+AR=tlib
+
+# compiler flags
+# replace "-O2" by "-O -G -a -d" for Turbo C++ 1.0
+CFLAGS=-O2 -Z -m$(MODEL) $(LOC)
+
+LDFLAGS=-m$(MODEL) -f-
+
+
+# variables
+ZLIB_LIB = zlib_$(MODEL).lib
+
+OBJ1 = adler32.obj compress.obj crc32.obj deflate.obj gzio.obj infback.obj
+OBJ2 = inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
+OBJP1 = +adler32.obj+compress.obj+crc32.obj+deflate.obj+gzio.obj+infback.obj
+OBJP2 = +inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
+
+
+# targets
+all: $(ZLIB_LIB) example.exe minigzip.exe
+
+.c.obj:
+	$(CC) -c $(CFLAGS) $*.c
+
+adler32.obj: adler32.c zlib.h zconf.h
+
+compress.obj: compress.c zlib.h zconf.h
+
+crc32.obj: crc32.c zlib.h zconf.h crc32.h
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+
+infback.obj: infback.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+
+trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+
+example.obj: example.c zlib.h zconf.h
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+
+
+# the command line is cut to fit in the MS-DOS 128 byte limit:
+$(ZLIB_LIB): $(OBJ1) $(OBJ2)
+	-del $(ZLIB_LIB)
+	$(AR) $(ZLIB_LIB) $(OBJP1)
+	$(AR) $(ZLIB_LIB) $(OBJP2)
+
+example.exe: example.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) example.obj $(ZLIB_LIB)
+
+minigzip.exe: minigzip.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) minigzip.obj $(ZLIB_LIB)
+
+test: example.exe minigzip.exe
+	example
+	echo hello world | minigzip | minigzip -d
+
+clean:
+	-del *.obj
+	-del *.lib
+	-del *.exe
+	-del zlib_*.bak
+	-del foo.gz
diff --git a/updater/zlib123/msdos/Makefile.dj2 b/updater/zlib123/msdos/Makefile.dj2
new file mode 100644
index 0000000..50ac8dc
--- /dev/null
+++ b/updater/zlib123/msdos/Makefile.dj2
@@ -0,0 +1,104 @@
+# Makefile for zlib.  Modified for djgpp v2.0 by F. J. Donahoe, 3/15/96.
+# Copyright (C) 1995-1998 Jean-loup Gailly.
+# For conditions of distribution and use, see copyright notice in zlib.h
+
+# To compile, or to compile and test, type:
+#
+#   make -fmakefile.dj2;  make test -fmakefile.dj2
+#
+# To install libz.a, zconf.h and zlib.h in the djgpp directories, type:
+#
+#    make install -fmakefile.dj2
+#
+# after first defining LIBRARY_PATH and INCLUDE_PATH in djgpp.env as
+# in the sample below if the pattern of the DJGPP distribution is to
+# be followed.  Remember that, while <sp>'es around <=> are ignored in
+# makefiles, they are *not* in batch files or in djgpp.env.
+# - - - - -
+# [make]
+# INCLUDE_PATH=%\>;INCLUDE_PATH%%\DJDIR%\include
+# LIBRARY_PATH=%\>;LIBRARY_PATH%%\DJDIR%\lib
+# BUTT=-m486
+# - - - - -
+# Alternately, these variables may be defined below, overriding the values
+# in djgpp.env, as
+# INCLUDE_PATH=c:\usr\include
+# LIBRARY_PATH=c:\usr\lib
+
+CC=gcc
+
+#CFLAGS=-MMD -O
+#CFLAGS=-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7
+#CFLAGS=-MMD -g -DDEBUG
+CFLAGS=-MMD -O3 $(BUTT) -Wall -Wwrite-strings -Wpointer-arith -Wconversion \
+             -Wstrict-prototypes -Wmissing-prototypes
+
+# If cp.exe is available, replace "copy /Y" with "cp -fp" .
+CP=copy /Y
+# If gnu install.exe is available, replace $(CP) with ginstall.
+INSTALL=$(CP)
+# The default value of RM is "rm -f."  If "rm.exe" is found, comment out:
+RM=del
+LDLIBS=-L. -lz
+LD=$(CC) -s -o
+LDSHARED=$(CC)
+
+INCL=zlib.h zconf.h
+LIBS=libz.a
+
+AR=ar rcs
+
+prefix=/usr/local
+exec_prefix = $(prefix)
+
+OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
+       zutil.o inflate.o infback.o inftrees.o inffast.o
+
+OBJA =
+# to use the asm code: make OBJA=match.o
+
+TEST_OBJS = example.o minigzip.o
+
+all: example.exe minigzip.exe
+
+check: test
+test: all
+	./example
+	echo hello world | .\minigzip | .\minigzip -d
+
+%.o : %.c
+	$(CC) $(CFLAGS) -c $< -o $@
+
+libz.a: $(OBJS) $(OBJA)
+	$(AR) $@ $(OBJS) $(OBJA)
+
+%.exe : %.o $(LIBS)
+	$(LD) $@ $< $(LDLIBS)
+
+# INCLUDE_PATH and LIBRARY_PATH were set for [make] in djgpp.env .
+
+.PHONY : uninstall clean
+
+install: $(INCL) $(LIBS)
+	-@if not exist $(INCLUDE_PATH)\nul mkdir $(INCLUDE_PATH)
+	-@if not exist $(LIBRARY_PATH)\nul mkdir $(LIBRARY_PATH)
+	$(INSTALL) zlib.h $(INCLUDE_PATH)
+	$(INSTALL) zconf.h $(INCLUDE_PATH)
+	$(INSTALL) libz.a $(LIBRARY_PATH)
+
+uninstall:
+	$(RM) $(INCLUDE_PATH)\zlib.h
+	$(RM) $(INCLUDE_PATH)\zconf.h
+	$(RM) $(LIBRARY_PATH)\libz.a
+
+clean:
+	$(RM) *.d
+	$(RM) *.o
+	$(RM) *.exe
+	$(RM) libz.a
+	$(RM) foo.gz
+
+DEPS := $(wildcard *.d)
+ifneq ($(DEPS),)
+include $(DEPS)
+endif
diff --git a/updater/zlib123/msdos/Makefile.emx b/updater/zlib123/msdos/Makefile.emx
new file mode 100644
index 0000000..d58fcab
--- /dev/null
+++ b/updater/zlib123/msdos/Makefile.emx
@@ -0,0 +1,69 @@
+# Makefile for zlib.  Modified for emx 0.9c by Chr. Spieler, 6/17/98.
+# Copyright (C) 1995-1998 Jean-loup Gailly.
+# For conditions of distribution and use, see copyright notice in zlib.h
+
+# To compile, or to compile and test, type:
+#
+#   make -fmakefile.emx;  make test -fmakefile.emx
+#
+
+CC=gcc
+
+#CFLAGS=-MMD -O
+#CFLAGS=-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7
+#CFLAGS=-MMD -g -DDEBUG
+CFLAGS=-MMD -O3 $(BUTT) -Wall -Wwrite-strings -Wpointer-arith -Wconversion \
+             -Wstrict-prototypes -Wmissing-prototypes
+
+# If cp.exe is available, replace "copy /Y" with "cp -fp" .
+CP=copy /Y
+# If gnu install.exe is available, replace $(CP) with ginstall.
+INSTALL=$(CP)
+# The default value of RM is "rm -f."  If "rm.exe" is found, comment out:
+RM=del
+LDLIBS=-L. -lzlib
+LD=$(CC) -s -o
+LDSHARED=$(CC)
+
+INCL=zlib.h zconf.h
+LIBS=zlib.a
+
+AR=ar rcs
+
+prefix=/usr/local
+exec_prefix = $(prefix)
+
+OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
+       zutil.o inflate.o infback.o inftrees.o inffast.o
+
+TEST_OBJS = example.o minigzip.o
+
+all: example.exe minigzip.exe
+
+test: all
+	./example
+	echo hello world | .\minigzip | .\minigzip -d
+
+%.o : %.c
+	$(CC) $(CFLAGS) -c $< -o $@
+
+zlib.a: $(OBJS)
+	$(AR) $@ $(OBJS)
+
+%.exe : %.o $(LIBS)
+	$(LD) $@ $< $(LDLIBS)
+
+
+.PHONY : clean
+
+clean:
+	$(RM) *.d
+	$(RM) *.o
+	$(RM) *.exe
+	$(RM) zlib.a
+	$(RM) foo.gz
+
+DEPS := $(wildcard *.d)
+ifneq ($(DEPS),)
+include $(DEPS)
+endif
diff --git a/updater/zlib123/msdos/Makefile.msc b/updater/zlib123/msdos/Makefile.msc
new file mode 100644
index 0000000..579a814
--- /dev/null
+++ b/updater/zlib123/msdos/Makefile.msc
@@ -0,0 +1,106 @@
+# Makefile for zlib
+# Microsoft C 5.1 or later
+# Last updated: 19-Mar-2003
+
+# To use, do "make makefile.msc"
+# To compile in small model, set below: MODEL=S
+
+# If you wish to reduce the memory requirements (default 256K for big
+# objects plus a few K), you can add to the LOC macro below:
+#   -DMAX_MEM_LEVEL=7 -DMAX_WBITS=14
+# See zconf.h for details about the memory requirements.
+
+# ------------- Microsoft C 5.1 and later -------------
+
+#    Optional nonstandard preprocessor flags (e.g. -DMAX_MEM_LEVEL=7)
+#    should be added to the environment via "set LOCAL_ZLIB=-DFOO" or added
+#    to the declaration of LOC here:
+LOC = $(LOCAL_ZLIB)
+
+# Type for CPU required: 0: 8086, 1: 80186, 2: 80286, 3: 80386, etc.
+CPU_TYP = 0
+
+# Memory model: one of S, M, C, L (small, medium, compact, large)
+MODEL=L
+
+CC=cl
+CFLAGS=-nologo -A$(MODEL) -G$(CPU_TYP) -W3 -Oait -Gs $(LOC)
+#-Ox generates bad code with MSC 5.1
+LIB_CFLAGS=-Zl $(CFLAGS)
+
+LD=link
+LDFLAGS=/noi/e/st:0x1500/noe/farcall/packcode
+# "/farcall/packcode" are only useful for `large code' memory models
+# but should be a "no-op" for small code models.
+
+
+# variables
+ZLIB_LIB = zlib_$(MODEL).lib
+
+OBJ1 = adler32.obj compress.obj crc32.obj deflate.obj gzio.obj infback.obj
+OBJ2 = inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
+
+
+# targets
+all:  $(ZLIB_LIB) example.exe minigzip.exe
+
+.c.obj:
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+adler32.obj: adler32.c zlib.h zconf.h
+
+compress.obj: compress.c zlib.h zconf.h
+
+crc32.obj: crc32.c zlib.h zconf.h crc32.h
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+
+infback.obj: infback.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+
+trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+
+example.obj: example.c zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+
+# the command line is cut to fit in the MS-DOS 128 byte limit:
+$(ZLIB_LIB): $(OBJ1) $(OBJ2)
+	if exist $(ZLIB_LIB) del $(ZLIB_LIB)
+	lib $(ZLIB_LIB) $(OBJ1);
+	lib $(ZLIB_LIB) $(OBJ2);
+
+example.exe: example.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) example.obj,,,$(ZLIB_LIB);
+
+minigzip.exe: minigzip.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) minigzip.obj,,,$(ZLIB_LIB);
+
+test: example.exe minigzip.exe
+	example
+	echo hello world | minigzip | minigzip -d
+
+clean:
+	-del *.obj
+	-del *.lib
+	-del *.exe
+	-del *.map
+	-del zlib_*.bak
+	-del foo.gz
diff --git a/updater/zlib123/msdos/Makefile.tc b/updater/zlib123/msdos/Makefile.tc
new file mode 100644
index 0000000..da523c9
--- /dev/null
+++ b/updater/zlib123/msdos/Makefile.tc
@@ -0,0 +1,94 @@
+# Makefile for zlib
+# Turbo C 2.01, Turbo C++ 1.01
+# Last updated: 15-Mar-2003
+
+# To use, do "make -fmakefile.tc"
+# To compile in small model, set below: MODEL=s
+
+# WARNING: the small model is supported but only for small values of
+# MAX_WBITS and MAX_MEM_LEVEL. For example:
+#    -DMAX_WBITS=11 -DMAX_MEM_LEVEL=3
+# If you wish to reduce the memory requirements (default 256K for big
+# objects plus a few K), you can add to CFLAGS below:
+#   -DMAX_MEM_LEVEL=7 -DMAX_WBITS=14
+# See zconf.h for details about the memory requirements.
+
+# ------------ Turbo C 2.01, Turbo C++ 1.01 ------------
+MODEL=l
+CC=tcc
+LD=tcc
+AR=tlib
+# CFLAGS=-O2 -G -Z -m$(MODEL) -DMAX_WBITS=11 -DMAX_MEM_LEVEL=3
+CFLAGS=-O2 -G -Z -m$(MODEL)
+LDFLAGS=-m$(MODEL) -f-
+
+
+# variables
+ZLIB_LIB = zlib_$(MODEL).lib
+
+OBJ1 = adler32.obj compress.obj crc32.obj deflate.obj gzio.obj infback.obj
+OBJ2 = inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
+OBJP1 = +adler32.obj+compress.obj+crc32.obj+deflate.obj+gzio.obj+infback.obj
+OBJP2 = +inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
+
+
+# targets
+all: $(ZLIB_LIB) example.exe minigzip.exe
+
+.c.obj:
+	$(CC) -c $(CFLAGS) $*.c
+
+adler32.obj: adler32.c zlib.h zconf.h
+
+compress.obj: compress.c zlib.h zconf.h
+
+crc32.obj: crc32.c zlib.h zconf.h crc32.h
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+
+infback.obj: infback.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+
+trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+
+example.obj: example.c zlib.h zconf.h
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+
+
+# the command line is cut to fit in the MS-DOS 128 byte limit:
+$(ZLIB_LIB): $(OBJ1) $(OBJ2)
+	-del $(ZLIB_LIB)
+	$(AR) $(ZLIB_LIB) $(OBJP1)
+	$(AR) $(ZLIB_LIB) $(OBJP2)
+
+example.exe: example.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) example.obj $(ZLIB_LIB)
+
+minigzip.exe: minigzip.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) minigzip.obj $(ZLIB_LIB)
+
+test: example.exe minigzip.exe
+	example
+	echo hello world | minigzip | minigzip -d
+
+clean:
+	-del *.obj
+	-del *.lib
+	-del *.exe
+	-del zlib_*.bak
+	-del foo.gz
diff --git a/updater/zlib123/old/Makefile.riscos b/updater/zlib123/old/Makefile.riscos
new file mode 100644
index 0000000..5fa8d29
--- /dev/null
+++ b/updater/zlib123/old/Makefile.riscos
@@ -0,0 +1,151 @@
+# Project:   zlib_1_03
+# Patched for zlib 1.1.2 rw@shadow.org.uk 19980430
+# test works out-of-the-box, installs `somewhere' on demand
+
+# Toolflags:
+CCflags = -c -depend !Depend -IC: -g -throwback  -DRISCOS  -fah
+C++flags = -c -depend !Depend -IC: -throwback
+Linkflags = -aif -c++ -o $@
+ObjAsmflags = -throwback -NoCache -depend !Depend
+CMHGflags =
+LibFileflags = -c -l -o $@
+Squeezeflags = -o $@
+
+# change the line below to where _you_ want the library installed.
+libdest = lib:zlib
+
+# Final targets:
+@.lib:   @.o.adler32 @.o.compress @.o.crc32 @.o.deflate @.o.gzio \
+        @.o.infblock @.o.infcodes @.o.inffast @.o.inflate @.o.inftrees @.o.infutil @.o.trees \
+        @.o.uncompr @.o.zutil
+        LibFile $(LibFileflags) @.o.adler32 @.o.compress @.o.crc32 @.o.deflate \
+        @.o.gzio @.o.infblock @.o.infcodes @.o.inffast @.o.inflate @.o.inftrees @.o.infutil \
+        @.o.trees @.o.uncompr @.o.zutil
+test:   @.minigzip @.example @.lib
+	@copy @.lib @.libc  A~C~DF~L~N~P~Q~RS~TV
+	@echo running tests: hang on.
+	@/@.minigzip -f -9 libc
+	@/@.minigzip -d libc-gz
+	@/@.minigzip -f -1 libc
+	@/@.minigzip -d libc-gz
+	@/@.minigzip -h -9 libc
+	@/@.minigzip -d libc-gz
+	@/@.minigzip -h -1 libc
+	@/@.minigzip -d libc-gz
+	@/@.minigzip -9 libc
+	@/@.minigzip -d libc-gz
+	@/@.minigzip -1 libc
+	@/@.minigzip -d libc-gz
+	@diff @.lib @.libc
+	@echo that should have reported '@.lib and @.libc identical' if you have diff.
+	@/@.example @.fred @.fred
+	@echo that will have given lots of hello!'s.
+
+@.minigzip:   @.o.minigzip @.lib C:o.Stubs
+        Link $(Linkflags) @.o.minigzip @.lib C:o.Stubs
+@.example:   @.o.example @.lib C:o.Stubs
+        Link $(Linkflags) @.o.example @.lib C:o.Stubs
+
+install: @.lib
+	cdir $(libdest)
+	cdir $(libdest).h
+	@copy @.h.zlib $(libdest).h.zlib A~C~DF~L~N~P~Q~RS~TV
+	@copy @.h.zconf $(libdest).h.zconf A~C~DF~L~N~P~Q~RS~TV
+	@copy @.lib $(libdest).lib  A~C~DF~L~N~P~Q~RS~TV
+	@echo okay, installed zlib in $(libdest)
+
+clean:; remove @.minigzip
+	remove @.example
+	remove @.libc
+	-wipe @.o.* F~r~cV
+	remove @.fred
+
+# User-editable dependencies:
+.c.o:
+        cc $(ccflags) -o $@ $<
+
+# Static dependencies:
+
+# Dynamic dependencies:
+o.example:	c.example
+o.example:	h.zlib
+o.example:	h.zconf
+o.minigzip:	c.minigzip
+o.minigzip:	h.zlib
+o.minigzip:	h.zconf
+o.adler32:	c.adler32
+o.adler32:	h.zlib
+o.adler32:	h.zconf
+o.compress:	c.compress
+o.compress:	h.zlib
+o.compress:	h.zconf
+o.crc32:	c.crc32
+o.crc32:	h.zlib
+o.crc32:	h.zconf
+o.deflate:	c.deflate
+o.deflate:	h.deflate
+o.deflate:	h.zutil
+o.deflate:	h.zlib
+o.deflate:	h.zconf
+o.gzio:	c.gzio
+o.gzio:	h.zutil
+o.gzio:	h.zlib
+o.gzio:	h.zconf
+o.infblock:	c.infblock
+o.infblock:	h.zutil
+o.infblock:	h.zlib
+o.infblock:	h.zconf
+o.infblock:	h.infblock
+o.infblock:	h.inftrees
+o.infblock:	h.infcodes
+o.infblock:	h.infutil
+o.infcodes:	c.infcodes
+o.infcodes:	h.zutil
+o.infcodes:	h.zlib
+o.infcodes:	h.zconf
+o.infcodes:	h.inftrees
+o.infcodes:	h.infblock
+o.infcodes:	h.infcodes
+o.infcodes:	h.infutil
+o.infcodes:	h.inffast
+o.inffast:	c.inffast
+o.inffast:	h.zutil
+o.inffast:	h.zlib
+o.inffast:	h.zconf
+o.inffast:	h.inftrees
+o.inffast:	h.infblock
+o.inffast:	h.infcodes
+o.inffast:	h.infutil
+o.inffast:	h.inffast
+o.inflate:	c.inflate
+o.inflate:	h.zutil
+o.inflate:	h.zlib
+o.inflate:	h.zconf
+o.inflate:	h.infblock
+o.inftrees:	c.inftrees
+o.inftrees:	h.zutil
+o.inftrees:	h.zlib
+o.inftrees:	h.zconf
+o.inftrees:	h.inftrees
+o.inftrees:	h.inffixed
+o.infutil:	c.infutil
+o.infutil:	h.zutil
+o.infutil:	h.zlib
+o.infutil:	h.zconf
+o.infutil:	h.infblock
+o.infutil:	h.inftrees
+o.infutil:	h.infcodes
+o.infutil:	h.infutil
+o.trees:	c.trees
+o.trees:	h.deflate
+o.trees:	h.zutil
+o.trees:	h.zlib
+o.trees:	h.zconf
+o.trees:	h.trees
+o.uncompr:	c.uncompr
+o.uncompr:	h.zlib
+o.uncompr:	h.zconf
+o.zutil:	c.zutil
+o.zutil:	h.zutil
+o.zutil:	h.zlib
+o.zutil:	h.zconf
diff --git a/updater/zlib123/old/README b/updater/zlib123/old/README
new file mode 100644
index 0000000..0327768
--- /dev/null
+++ b/updater/zlib123/old/README
@@ -0,0 +1,3 @@
+This directory contains files that have not been updated for zlib 1.2.x
+
+(Volunteers are encouraged to help clean this up.  Thanks.)
diff --git a/updater/zlib123/old/descrip.mms b/updater/zlib123/old/descrip.mms
new file mode 100644
index 0000000..4f9e699
--- /dev/null
+++ b/updater/zlib123/old/descrip.mms
@@ -0,0 +1,48 @@
+# descrip.mms: MMS description file for building zlib on VMS
+# written by Martin P.J. Zinser <m.zinser@gsi.de>
+
+cc_defs =
+c_deb =
+
+.ifdef __DECC__
+pref = /prefix=all
+.endif
+
+OBJS = adler32.obj, compress.obj, crc32.obj, gzio.obj, uncompr.obj,\
+       deflate.obj, trees.obj, zutil.obj, inflate.obj, infblock.obj,\
+       inftrees.obj, infcodes.obj, infutil.obj, inffast.obj
+
+CFLAGS= $(C_DEB) $(CC_DEFS) $(PREF)
+
+all : example.exe minigzip.exe
+        @ write sys$output " Example applications available"
+libz.olb : libz.olb($(OBJS))
+	@ write sys$output " libz available"
+
+example.exe : example.obj libz.olb
+              link example,libz.olb/lib
+
+minigzip.exe : minigzip.obj libz.olb
+              link minigzip,libz.olb/lib,x11vms:xvmsutils.olb/lib
+
+clean :
+	delete *.obj;*,libz.olb;*
+
+
+# Other dependencies.
+adler32.obj : zutil.h zlib.h zconf.h
+compress.obj : zlib.h zconf.h
+crc32.obj : zutil.h zlib.h zconf.h
+deflate.obj : deflate.h zutil.h zlib.h zconf.h
+example.obj : zlib.h zconf.h
+gzio.obj : zutil.h zlib.h zconf.h
+infblock.obj : zutil.h zlib.h zconf.h infblock.h inftrees.h infcodes.h infutil.h
+infcodes.obj : zutil.h zlib.h zconf.h inftrees.h infutil.h infcodes.h inffast.h
+inffast.obj : zutil.h zlib.h zconf.h inftrees.h infutil.h inffast.h
+inflate.obj : zutil.h zlib.h zconf.h infblock.h
+inftrees.obj : zutil.h zlib.h zconf.h inftrees.h
+infutil.obj : zutil.h zlib.h zconf.h inftrees.h infutil.h
+minigzip.obj : zlib.h zconf.h
+trees.obj : deflate.h zutil.h zlib.h zconf.h
+uncompr.obj : zlib.h zconf.h
+zutil.obj : zutil.h zlib.h zconf.h
diff --git a/updater/zlib123/old/os2/Makefile.os2 b/updater/zlib123/old/os2/Makefile.os2
new file mode 100644
index 0000000..7ce217e
--- /dev/null
+++ b/updater/zlib123/old/os2/Makefile.os2
@@ -0,0 +1,136 @@
+# Makefile for zlib under OS/2 using GCC (PGCC)
+# For conditions of distribution and use, see copyright notice in zlib.h
+
+# To compile and test, type:
+#   cp Makefile.os2 ..
+#   cd ..
+#   make -f Makefile.os2 test
+
+# This makefile will build a static library z.lib, a shared library
+# z.dll and a import library zdll.lib. You can use either z.lib or
+# zdll.lib by specifying either -lz or -lzdll on gcc's command line
+
+CC=gcc -Zomf -s
+
+CFLAGS=-O6 -Wall
+#CFLAGS=-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7
+#CFLAGS=-g -DDEBUG
+#CFLAGS=-O3 -Wall -Wwrite-strings -Wpointer-arith -Wconversion \
+#           -Wstrict-prototypes -Wmissing-prototypes
+
+#################### BUG WARNING: #####################
+## infcodes.c hits a bug in pgcc-1.0, so you have to use either
+## -O# where # <= 4 or one of (-fno-ommit-frame-pointer or -fno-force-mem)
+## This bug is reportedly fixed in pgcc >1.0, but this was not tested
+CFLAGS+=-fno-force-mem
+
+LDFLAGS=-s -L. -lzdll -Zcrtdll
+LDSHARED=$(CC) -s -Zomf -Zdll -Zcrtdll
+
+VER=1.1.0
+ZLIB=z.lib
+SHAREDLIB=z.dll
+SHAREDLIBIMP=zdll.lib
+LIBS=$(ZLIB) $(SHAREDLIB) $(SHAREDLIBIMP)
+
+AR=emxomfar cr
+IMPLIB=emximp
+RANLIB=echo
+TAR=tar
+SHELL=bash
+
+prefix=/usr/local
+exec_prefix = $(prefix)
+
+OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
+       zutil.o inflate.o infblock.o inftrees.o infcodes.o infutil.o inffast.o
+
+TEST_OBJS = example.o minigzip.o
+
+DISTFILES = README INDEX ChangeLog configure Make*[a-z0-9] *.[ch] descrip.mms \
+  algorithm.txt zlib.3 msdos/Make*[a-z0-9] msdos/zlib.def msdos/zlib.rc \
+  nt/Makefile.nt nt/zlib.dnt  contrib/README.contrib contrib/*.txt \
+  contrib/asm386/*.asm contrib/asm386/*.c \
+  contrib/asm386/*.bat contrib/asm386/zlibvc.d?? contrib/iostream/*.cpp \
+  contrib/iostream/*.h  contrib/iostream2/*.h contrib/iostream2/*.cpp \
+  contrib/untgz/Makefile contrib/untgz/*.c contrib/untgz/*.w32
+
+all: example.exe minigzip.exe
+
+test: all
+	@LD_LIBRARY_PATH=.:$(LD_LIBRARY_PATH) ; export LD_LIBRARY_PATH; \
+	echo hello world | ./minigzip | ./minigzip -d || \
+	  echo '		*** minigzip test FAILED ***' ; \
+	if ./example; then \
+	  echo '		*** zlib test OK ***'; \
+	else \
+	  echo '		*** zlib test FAILED ***'; \
+	fi
+
+$(ZLIB): $(OBJS)
+	$(AR) $@ $(OBJS)
+	-@ ($(RANLIB) $@ || true) >/dev/null 2>&1
+
+$(SHAREDLIB): $(OBJS) os2/z.def
+	$(LDSHARED) -o $@ $^
+
+$(SHAREDLIBIMP): os2/z.def
+	$(IMPLIB) -o $@ $^
+
+example.exe: example.o $(LIBS)
+	$(CC) $(CFLAGS) -o $@ example.o $(LDFLAGS)
+
+minigzip.exe: minigzip.o $(LIBS)
+	$(CC) $(CFLAGS) -o $@ minigzip.o $(LDFLAGS)
+
+clean:
+	rm -f *.o *~ example minigzip libz.a libz.so* foo.gz
+
+distclean:	clean
+
+zip:
+	mv Makefile Makefile~; cp -p Makefile.in Makefile
+	rm -f test.c ztest*.c
+	v=`sed -n -e 's/\.//g' -e '/VERSION "/s/.*"\(.*\)".*/\1/p' < zlib.h`;\
+	zip -ul9 zlib$$v $(DISTFILES)
+	mv Makefile~ Makefile
+
+dist:
+	mv Makefile Makefile~; cp -p Makefile.in Makefile
+	rm -f test.c ztest*.c
+	d=zlib-`sed -n '/VERSION "/s/.*"\(.*\)".*/\1/p' < zlib.h`;\
+	rm -f $$d.tar.gz; \
+	if test ! -d ../$$d; then rm -f ../$$d; ln -s `pwd` ../$$d; fi; \
+	files=""; \
+	for f in $(DISTFILES); do files="$$files $$d/$$f"; done; \
+	cd ..; \
+	GZIP=-9 $(TAR) chofz $$d/$$d.tar.gz $$files; \
+	if test ! -d $$d; then rm -f $$d; fi
+	mv Makefile~ Makefile
+
+tags:
+	etags *.[ch]
+
+depend:
+	makedepend -- $(CFLAGS) -- *.[ch]
+
+# DO NOT DELETE THIS LINE -- make depend depends on it.
+
+adler32.o: zlib.h zconf.h
+compress.o: zlib.h zconf.h
+crc32.o: zlib.h zconf.h
+deflate.o: deflate.h zutil.h zlib.h zconf.h
+example.o: zlib.h zconf.h
+gzio.o: zutil.h zlib.h zconf.h
+infblock.o: infblock.h inftrees.h infcodes.h infutil.h zutil.h zlib.h zconf.h
+infcodes.o: zutil.h zlib.h zconf.h
+infcodes.o: inftrees.h infblock.h infcodes.h infutil.h inffast.h
+inffast.o: zutil.h zlib.h zconf.h inftrees.h
+inffast.o: infblock.h infcodes.h infutil.h inffast.h
+inflate.o: zutil.h zlib.h zconf.h infblock.h
+inftrees.o: zutil.h zlib.h zconf.h inftrees.h
+infutil.o: zutil.h zlib.h zconf.h infblock.h inftrees.h infcodes.h infutil.h
+minigzip.o: zlib.h zconf.h
+trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
+uncompr.o: zlib.h zconf.h
+zutil.o: zutil.h zlib.h zconf.h
diff --git a/updater/zlib123/old/os2/zlib.def b/updater/zlib123/old/os2/zlib.def
new file mode 100644
index 0000000..438e8c0
--- /dev/null
+++ b/updater/zlib123/old/os2/zlib.def
@@ -0,0 +1,51 @@
+;
+; Slightly modified version of ../nt/zlib.dnt :-)
+;
+
+LIBRARY		Z
+DESCRIPTION	"Zlib compression library for OS/2"
+CODE		PRELOAD MOVEABLE DISCARDABLE
+DATA		PRELOAD MOVEABLE MULTIPLE
+
+EXPORTS
+    adler32
+    compress
+    crc32
+    deflate
+    deflateCopy
+    deflateEnd
+    deflateInit2_
+    deflateInit_
+    deflateParams
+    deflateReset
+    deflateSetDictionary
+    gzclose
+    gzdopen
+    gzerror
+    gzflush
+    gzopen
+    gzread
+    gzwrite
+    inflate
+    inflateEnd
+    inflateInit2_
+    inflateInit_
+    inflateReset
+    inflateSetDictionary
+    inflateSync
+    uncompress
+    zlibVersion
+    gzprintf
+    gzputc
+    gzgetc
+    gzseek
+    gzrewind
+    gztell
+    gzeof
+    gzsetparams
+    zError
+    inflateSyncPoint
+    get_crc_table
+    compress2
+    gzputs
+    gzgets
diff --git a/updater/zlib123/old/visual-basic.txt b/updater/zlib123/old/visual-basic.txt
new file mode 100644
index 0000000..bb275af
--- /dev/null
+++ b/updater/zlib123/old/visual-basic.txt
@@ -0,0 +1,160 @@
+See below some functions declarations for Visual Basic.
+
+Frequently Asked Question:
+
+Q: Each time I use the compress function I get the -5 error (not enough
+   room in the output buffer).
+
+A: Make sure that the length of the compressed buffer is passed by
+   reference ("as any"), not by value ("as long"). Also check that
+   before the call of compress this length is equal to the total size of
+   the compressed buffer and not zero.
+
+
+From: "Jon Caruana" <jon-net@usa.net>
+Subject: Re: How to port zlib declares to vb?
+Date: Mon, 28 Oct 1996 18:33:03 -0600
+
+Got the answer! (I haven't had time to check this but it's what I got, and
+looks correct):
+
+He has the following routines working:
+        compress
+        uncompress
+        gzopen
+        gzwrite
+        gzread
+        gzclose
+
+Declares follow: (Quoted from Carlos Rios <c_rios@sonda.cl>, in Vb4 form)
+
+#If Win16 Then   'Use Win16 calls.
+Declare Function compress Lib "ZLIB.DLL" (ByVal compr As
+        String, comprLen As Any, ByVal buf As String, ByVal buflen
+        As Long) As Integer
+Declare Function uncompress Lib "ZLIB.DLL" (ByVal uncompr
+        As String, uncomprLen As Any, ByVal compr As String, ByVal
+        lcompr As Long) As Integer
+Declare Function gzopen Lib "ZLIB.DLL" (ByVal filePath As
+        String, ByVal mode As String) As Long
+Declare Function gzread Lib "ZLIB.DLL" (ByVal file As
+        Long, ByVal uncompr As String, ByVal uncomprLen As Integer)
+        As Integer
+Declare Function gzwrite Lib "ZLIB.DLL" (ByVal file As
+        Long, ByVal uncompr As String, ByVal uncomprLen As Integer)
+        As Integer
+Declare Function gzclose Lib "ZLIB.DLL" (ByVal file As
+        Long) As Integer
+#Else
+Declare Function compress Lib "ZLIB32.DLL"
+        (ByVal compr As String, comprLen As Any, ByVal buf As
+        String, ByVal buflen As Long) As Integer
+Declare Function uncompress Lib "ZLIB32.DLL"
+        (ByVal uncompr As String, uncomprLen As Any, ByVal compr As
+        String, ByVal lcompr As Long) As Long
+Declare Function gzopen Lib "ZLIB32.DLL"
+        (ByVal file As String, ByVal mode As String) As Long
+Declare Function gzread Lib "ZLIB32.DLL"
+        (ByVal file As Long, ByVal uncompr As String, ByVal
+        uncomprLen As Long) As Long
+Declare Function gzwrite Lib "ZLIB32.DLL"
+        (ByVal file As Long, ByVal uncompr As String, ByVal
+        uncomprLen As Long) As Long
+Declare Function gzclose Lib "ZLIB32.DLL"
+        (ByVal file As Long) As Long
+#End If
+
+-Jon Caruana
+jon-net@usa.net
+Microsoft Sitebuilder Network Level 1 Member - HTML Writer's Guild Member
+
+
+Here is another example from Michael <michael_borgsys@hotmail.com> that he
+says conforms to the VB guidelines, and that solves the problem of not
+knowing the uncompressed size by storing it at the end of the file:
+
+'Calling the functions:
+'bracket meaning: <parameter> [optional] {Range of possible values}
+'Call subCompressFile(<path with filename to compress> [, <path with
+filename to write to>, [level of compression {1..9}]])
+'Call subUncompressFile(<path with filename to compress>)
+
+Option Explicit
+Private lngpvtPcnSml As Long 'Stores value for 'lngPercentSmaller'
+Private Const SUCCESS As Long = 0
+Private Const strFilExt As String = ".cpr"
+Private Declare Function lngfncCpr Lib "zlib.dll" Alias "compress2" (ByRef
+dest As Any, ByRef destLen As Any, ByRef src As Any, ByVal srcLen As Long,
+ByVal level As Integer) As Long
+Private Declare Function lngfncUcp Lib "zlib.dll" Alias "uncompress" (ByRef
+dest As Any, ByRef destLen As Any, ByRef src As Any, ByVal srcLen As Long)
+As Long
+
+Public Sub subCompressFile(ByVal strargOriFilPth As String, Optional ByVal
+strargCprFilPth As String, Optional ByVal intLvl As Integer = 9)
+    Dim strCprPth As String
+    Dim lngOriSiz As Long
+    Dim lngCprSiz As Long
+    Dim bytaryOri() As Byte
+    Dim bytaryCpr() As Byte
+    lngOriSiz = FileLen(strargOriFilPth)
+    ReDim bytaryOri(lngOriSiz - 1)
+    Open strargOriFilPth For Binary Access Read As #1
+        Get #1, , bytaryOri()
+    Close #1
+    strCprPth = IIf(strargCprFilPth = "", strargOriFilPth, strargCprFilPth)
+'Select file path and name
+    strCprPth = strCprPth & IIf(Right(strCprPth, Len(strFilExt)) =
+strFilExt, "", strFilExt) 'Add file extension if not exists
+    lngCprSiz = (lngOriSiz * 1.01) + 12 'Compression needs temporary a bit
+more space then original file size
+    ReDim bytaryCpr(lngCprSiz - 1)
+    If lngfncCpr(bytaryCpr(0), lngCprSiz, bytaryOri(0), lngOriSiz, intLvl) =
+SUCCESS Then
+        lngpvtPcnSml = (1# - (lngCprSiz / lngOriSiz)) * 100
+        ReDim Preserve bytaryCpr(lngCprSiz - 1)
+        Open strCprPth For Binary Access Write As #1
+            Put #1, , bytaryCpr()
+            Put #1, , lngOriSiz 'Add the the original size value to the end
+(last 4 bytes)
+        Close #1
+    Else
+        MsgBox "Compression error"
+    End If
+    Erase bytaryCpr
+    Erase bytaryOri
+End Sub
+
+Public Sub subUncompressFile(ByVal strargFilPth As String)
+    Dim bytaryCpr() As Byte
+    Dim bytaryOri() As Byte
+    Dim lngOriSiz As Long
+    Dim lngCprSiz As Long
+    Dim strOriPth As String
+    lngCprSiz = FileLen(strargFilPth)
+    ReDim bytaryCpr(lngCprSiz - 1)
+    Open strargFilPth For Binary Access Read As #1
+        Get #1, , bytaryCpr()
+    Close #1
+    'Read the original file size value:
+    lngOriSiz = bytaryCpr(lngCprSiz - 1) * (2 ^ 24) _
+              + bytaryCpr(lngCprSiz - 2) * (2 ^ 16) _
+              + bytaryCpr(lngCprSiz - 3) * (2 ^ 8) _
+              + bytaryCpr(lngCprSiz - 4)
+    ReDim Preserve bytaryCpr(lngCprSiz - 5) 'Cut of the original size value
+    ReDim bytaryOri(lngOriSiz - 1)
+    If lngfncUcp(bytaryOri(0), lngOriSiz, bytaryCpr(0), lngCprSiz) = SUCCESS
+Then
+        strOriPth = Left(strargFilPth, Len(strargFilPth) - Len(strFilExt))
+        Open strOriPth For Binary Access Write As #1
+            Put #1, , bytaryOri()
+        Close #1
+    Else
+        MsgBox "Uncompression error"
+    End If
+    Erase bytaryCpr
+    Erase bytaryOri
+End Sub
+Public Property Get lngPercentSmaller() As Long
+    lngPercentSmaller = lngpvtPcnSml
+End Property
diff --git a/updater/zlib123/old/zlib.html b/updater/zlib123/old/zlib.html
new file mode 100644
index 0000000..6574dff
--- /dev/null
+++ b/updater/zlib123/old/zlib.html
@@ -0,0 +1,971 @@
+<html>
+<head>
+ <title>
+ zlib general purpose compression library version 1.1.4
+ </title>
+</head>
+<body bgcolor="White" text="Black" vlink="Red" alink="Navy" link="Red">
+<!-- background="zlibbg.gif" -->
+
+<h1> zlib 1.1.4 Manual </h1>
+<hr>
+<a name="Contents"><h2>Contents</h2>
+<ol type="I">
+<li> <a href="#Prologue">Prologue</a>
+<li> <a href="#Introduction">Introduction</a>
+<li> <a href="#Utility functions">Utility functions</a>
+<li> <a href="#Basic functions">Basic functions</a>
+<li> <a href="#Advanced functions">Advanced functions</a>
+<li> <a href="#Constants">Constants</a>
+<li> <a href="#struct z_stream_s">struct z_stream_s</a>
+<li> <a href="#Checksum functions">Checksum functions</a>
+<li> <a href="#Misc">Misc</a>
+</ol>
+<hr>
+<a name="Prologue"><h2> Prologue </h2>
+  'zlib' general purpose compression library version 1.1.4, March 11th, 2002
+  <p>
+  Copyright (C) 1995-2002 Jean-loup Gailly and Mark Adler
+  <p>
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the authors be held liable for any damages
+  arising from the use of this software.
+  <p>
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+  <ol>
+   <li> The origin of this software must not be misrepresented ; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+   <li> Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+   <li> This notice may not be removed or altered from any source distribution.
+  </ol>
+
+  <dl>
+  <dt>Jean-loup Gailly
+  <dd><a href="mailto:jloup@gzip.org">jloup@gzip.org</a>
+  <dt>Mark Adler
+  <dd><a href="mailto:madler@alumni.caltech.edu">madler@alumni.caltech.edu</a>
+  </dl>
+
+  The data format used by the zlib library is described by RFCs (Request for
+  Comments) 1950 to 1952 in the files
+  <a href="ftp://ds.internic.net/rfc/rfc1950.txt">
+  ftp://ds.internic.net/rfc/rfc1950.txt </a>
+  (zlib format),
+  <a href="ftp://ds.internic.net/rfc/rfc1951.txt">
+  rfc1951.txt </a>
+  (<a href="#deflate">deflate</a> format) and
+  <a href="ftp://ds.internic.net/rfc/rfc1952.txt">
+  rfc1952.txt </a>
+  (gzip format).
+  <p>
+  This manual is converted from zlib.h by
+  <a href="mailto:piaip@csie.ntu.edu.tw"> piaip </a>
+  <p>
+  Visit <a href="http://ftp.cdrom.com/pub/infozip/zlib/">
+  http://ftp.cdrom.com/pub/infozip/zlib/</a>
+  for the official zlib web page.
+  <p>
+
+<hr>
+<a name="Introduction"><h2> Introduction </h2>
+     The 'zlib' compression library provides in-memory compression and
+  decompression functions, including integrity checks of the uncompressed
+  data.  This version of the library supports only one compression method
+  (deflation) but other algorithms will be added later and will have the same
+  stream interface.
+  <p>
+
+     Compression can be done in a single step if the buffers are large
+  enough (for example if an input file is mmap'ed), or can be done by
+  repeated calls of the compression function.  In the latter case, the
+  application must provide more input and/or consume the output
+  (providing more output space) before each call.
+  <p>
+
+     The library also supports reading and writing files in gzip (.gz) format
+  with an interface similar to that of stdio.
+  <p>
+
+     The library does not install any signal handler. The decoder checks
+  the consistency of the compressed data, so the library should never
+  crash even in case of corrupted input.
+  <p>
+
+<hr>
+<a name="Utility functions"><h2> Utility functions </h2>
+     The following utility functions are implemented on top of the
+   <a href="#Basic functions">basic stream-oriented functions</a>.
+   To simplify the interface, some
+   default options are assumed (compression level and memory usage,
+   standard memory allocation functions). The source code of these
+   utility functions can easily be modified if you need special options.
+<h3> Function list </h3>
+<ul>
+<li> int  <a href="#compress">compress</a> (Bytef *dest,   uLongf *destLen, const Bytef *source, uLong sourceLen);
+<li> int  <a href="#compress2">compress2</a> (Bytef *dest,   uLongf *destLen, const Bytef *source, uLong sourceLen, int level);
+<li> int  <a href="#uncompress">uncompress</a> (Bytef *dest,   uLongf *destLen, const Bytef *source, uLong sourceLen);
+<li> typedef voidp gzFile;
+<li>  gzFile  <a href="#gzopen">gzopen</a>  (const char *path, const char *mode);
+<li> gzFile  <a href="#gzdopen">gzdopen</a>  (int fd, const char *mode);
+<li> int  <a href="#gzsetparams">gzsetparams</a> (gzFile file, int level, int strategy);
+<li> int     <a href="#gzread">gzread</a>  (gzFile file, voidp buf, unsigned len);
+<li> int     <a href="#gzwrite">gzwrite</a> (gzFile file, const voidp buf, unsigned len);
+<li> int VA   <a href="#gzprintf">gzprintf</a> (gzFile file, const char *format, ...);
+<li> int  <a href="#gzputs">gzputs</a> (gzFile file, const char *s);
+<li> char *  <a href="#gzgets">gzgets</a> (gzFile file, char *buf, int len);
+<li> int     <a href="#gzputc">gzputc</a> (gzFile file, int c);
+<li> int     <a href="#gzgetc">gzgetc</a> (gzFile file);
+<li> int     <a href="#gzflush">gzflush</a> (gzFile file, int flush);
+<li> z_off_t     <a href="#gzseek">gzseek</a> (gzFile file, z_off_t offset, int whence);
+<li> z_off_t     <a href="#gztell">gztell</a> (gzFile file);
+<li> int     <a href="#gzrewind">gzrewind</a> (gzFile file);
+<li> int  <a href="#gzeof">gzeof</a> (gzFile file);
+<li> int     <a href="#gzclose">gzclose</a> (gzFile file);
+<li> const char *  <a href="#gzerror">gzerror</a> (gzFile file, int *errnum);
+</ul>
+<h3> Function description </h3>
+<dl>
+<font color="Blue"><dt> int  <a name="compress">compress</a> (Bytef *dest,   uLongf *destLen, const Bytef *source, uLong sourceLen);</font>
+<dd>
+     Compresses the source buffer into the destination buffer.  sourceLen is
+   the byte length of the source buffer. Upon entry, destLen is the total
+   size of the destination buffer, which must be at least 0.1% larger than
+   sourceLen plus 12 bytes. Upon exit, destLen is the actual size of the
+   compressed buffer.<p>
+     This function can be used to <a href="#compress">compress</a> a whole file at once if the
+   input file is mmap'ed.<p>
+     <a href="#compress">compress</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_MEM_ERROR">Z_MEM_ERROR</a> if there was not
+   enough memory, <a href="#Z_BUF_ERROR">Z_BUF_ERROR</a> if there was not enough room in the output
+   buffer.<p>
+
+<font color="Blue"><dt> int  <a name="compress2">compress2</a> (Bytef *dest,   uLongf *destLen, const Bytef *source, uLong sourceLen, int level);</font>
+<dd>
+     Compresses the source buffer into the destination buffer. The level
+   parameter has the same meaning as in <a href="#deflateInit">deflateInit</a>.  sourceLen is the byte
+   length of the source buffer. Upon entry, destLen is the total size of the
+   destination buffer, which must be at least 0.1% larger than sourceLen plus
+   12 bytes. Upon exit, destLen is the actual size of the compressed buffer.
+   <p>
+
+     <a href="#compress2">compress2</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_MEM_ERROR">Z_MEM_ERROR</a> if there was not enough
+   memory, <a href="#Z_BUF_ERROR">Z_BUF_ERROR</a> if there was not enough room in the output buffer,
+   <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the level parameter is invalid.
+   <p>
+
+<font color="Blue"><dt> int  <a name="uncompress">uncompress</a> (Bytef *dest,   uLongf *destLen, const Bytef *source, uLong sourceLen);</font>
+<dd>
+     Decompresses the source buffer into the destination buffer.  sourceLen is
+   the byte length of the source buffer. Upon entry, destLen is the total
+   size of the destination buffer, which must be large enough to hold the
+   entire uncompressed data. (The size of the uncompressed data must have
+   been saved previously by the compressor and transmitted to the decompressor
+   by some mechanism outside the scope of this compression library.)
+   Upon exit, destLen is the actual size of the compressed buffer. <p>
+     This function can be used to decompress a whole file at once if the
+   input file is mmap'ed.
+   <p>
+
+     <a href="#uncompress">uncompress</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_MEM_ERROR">Z_MEM_ERROR</a> if there was not
+   enough memory, <a href="#Z_BUF_ERROR">Z_BUF_ERROR</a> if there was not enough room in the output
+   buffer, or <a href="#Z_DATA_ERROR">Z_DATA_ERROR</a> if the input data was corrupted.
+   <p>
+
+<dt> typedef voidp gzFile;
+<dd> <p>
+
+<font color="Blue"><dt>  gzFile  <a name="gzopen">gzopen</a>  (const char *path, const char *mode);</font>
+<dd>
+     Opens a gzip (.gz) file for reading or writing. The mode parameter
+   is as in fopen ("rb" or "wb") but can also include a compression level
+   ("wb9") or a strategy: 'f' for filtered data as in "wb6f", 'h' for
+   Huffman only compression as in "wb1h". (See the description
+   of <a href="#deflateInit2">deflateInit2</a> for more information about the strategy parameter.)
+   <p>
+
+     <a href="#gzopen">gzopen</a> can be used to read a file which is not in gzip format ; in this
+   case <a href="#gzread">gzread</a> will directly read from the file without decompression.
+   <p>
+
+     <a href="#gzopen">gzopen</a> returns NULL if the file could not be opened or if there was
+   insufficient memory to allocate the (de)compression <a href="#state">state</a> ; errno
+   can be checked to distinguish the two cases (if errno is zero, the
+   zlib error is <a href="#Z_MEM_ERROR">Z_MEM_ERROR</a>).
+   <p>
+
+<font color="Blue"><dt> gzFile  <a name="gzdopen">gzdopen</a>  (int fd, const char *mode);</font>
+<dd>
+     <a href="#gzdopen">gzdopen</a>() associates a gzFile with the file descriptor fd.  File
+   descriptors are obtained from calls like open, dup, creat, pipe or
+   fileno (in the file has been previously opened with fopen).
+   The mode parameter is as in <a href="#gzopen">gzopen</a>.
+   <p>
+     The next call of <a href="#gzclose">gzclose</a> on the returned gzFile will also close the
+   file descriptor fd, just like fclose(fdopen(fd), mode) closes the file
+   descriptor fd. If you want to keep fd open, use <a href="#gzdopen">gzdopen</a>(dup(fd), mode).
+   <p>
+     <a href="#gzdopen">gzdopen</a> returns NULL if there was insufficient memory to allocate
+   the (de)compression <a href="#state">state</a>.
+   <p>
+
+<font color="Blue"><dt> int  <a name="gzsetparams">gzsetparams</a> (gzFile file, int level, int strategy);</font>
+<dd>
+     Dynamically update the compression level or strategy. See the description
+   of <a href="#deflateInit2">deflateInit2</a> for the meaning of these parameters.
+   <p>
+     <a href="#gzsetparams">gzsetparams</a> returns <a href="#Z_OK">Z_OK</a> if success, or <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the file was not
+   opened for writing.
+   <p>
+
+<font color="Blue"><dt> int     <a name="gzread">gzread</a>  (gzFile file, voidp buf, unsigned len);</font>
+<dd>
+     Reads the given number of uncompressed bytes from the compressed file.
+   If the input file was not in gzip format, <a href="#gzread">gzread</a> copies the given number
+   of bytes into the buffer.
+   <p>
+     <a href="#gzread">gzread</a> returns the number of uncompressed bytes actually read (0 for
+   end of file, -1 for error).
+   <p>
+
+<font color="Blue"><dt> int     <a name="gzwrite">gzwrite</a> (gzFile file, const voidp buf, unsigned len);</font>
+<dd>
+     Writes the given number of uncompressed bytes into the compressed file.
+   <a href="#gzwrite">gzwrite</a> returns the number of uncompressed bytes actually written
+   (0 in case of error).
+   <p>
+
+<font color="Blue"><dt> int VA   <a name="gzprintf">gzprintf</a> (gzFile file, const char *format, ...);</font>
+<dd>
+     Converts, formats, and writes the args to the compressed file under
+   control of the format string, as in fprintf. <a href="#gzprintf">gzprintf</a> returns the number of
+   uncompressed bytes actually written (0 in case of error).
+   <p>
+
+<font color="Blue"><dt> int  <a name="gzputs">gzputs</a> (gzFile file, const char *s);</font>
+<dd>
+      Writes the given null-terminated string to the compressed file, excluding
+   the terminating null character.
+   <p>
+      <a href="#gzputs">gzputs</a> returns the number of characters written, or -1 in case of error.
+      <p>
+
+<font color="Blue"><dt> char *  <a name="gzgets">gzgets</a> (gzFile file, char *buf, int len);</font>
+<dd>
+      Reads bytes from the compressed file until len-1 characters are read, or
+   a newline character is read and transferred to buf, or an end-of-file
+   condition is encountered.  The string is then terminated with a null
+   character.
+   <p>
+      <a href="#gzgets">gzgets</a> returns buf, or <a href="#Z_NULL">Z_NULL</a> in case of error.
+      <p>
+
+<font color="Blue"><dt> int     <a name="gzputc">gzputc</a> (gzFile file, int c);</font>
+<dd>
+      Writes c, converted to an unsigned char, into the compressed file.
+   <a href="#gzputc">gzputc</a> returns the value that was written, or -1 in case of error.
+   <p>
+
+<font color="Blue"><dt> int     <a name="gzgetc">gzgetc</a> (gzFile file);</font>
+<dd>
+      Reads one byte from the compressed file. <a href="#gzgetc">gzgetc</a> returns this byte
+   or -1 in case of end of file or error.
+   <p>
+
+<font color="Blue"><dt> int     <a name="gzflush">gzflush</a> (gzFile file, int flush);</font>
+<dd>
+     Flushes all pending output into the compressed file. The parameter
+   flush is as in the <a href="#deflate">deflate</a>() function. The return value is the zlib
+   error number (see function <a href="#gzerror">gzerror</a> below). <a href="#gzflush">gzflush</a> returns <a href="#Z_OK">Z_OK</a> if
+   the flush parameter is <a href="#Z_FINISH">Z_FINISH</a> and all output could be flushed.
+   <p>
+     <a href="#gzflush">gzflush</a> should be called only when strictly necessary because it can
+   degrade compression.
+   <p>
+
+<font color="Blue"><dt> z_off_t     <a name="gzseek">gzseek</a> (gzFile file, z_off_t offset, int whence);</font>
+<dd>
+      Sets the starting position for the next <a href="#gzread">gzread</a> or <a href="#gzwrite">gzwrite</a> on the
+   given compressed file. The offset represents a number of bytes in the
+   uncompressed data stream. The whence parameter is defined as in lseek(2);
+   the value SEEK_END is not supported.
+   <p>
+     If the file is opened for reading, this function is emulated but can be
+   extremely slow. If the file is opened for writing, only forward seeks are
+   supported ; <a href="#gzseek">gzseek</a> then compresses a sequence of zeroes up to the new
+   starting position.
+   <p>
+      <a href="#gzseek">gzseek</a> returns the resulting offset location as measured in bytes from
+   the beginning of the uncompressed stream, or -1 in case of error, in
+   particular if the file is opened for writing and the new starting position
+   would be before the current position.
+   <p>
+
+<font color="Blue"><dt> int     <a name="gzrewind">gzrewind</a> (gzFile file);</font>
+<dd>
+     Rewinds the given file. This function is supported only for reading.
+     <p>
+   <a href="#gzrewind">gzrewind</a>(file) is equivalent to (int)<a href="#gzseek">gzseek</a>(file, 0L, SEEK_SET)
+   <p>
+
+<font color="Blue"><dt> z_off_t     <a name="gztell">gztell</a> (gzFile file);</font>
+<dd>
+     Returns the starting position for the next <a href="#gzread">gzread</a> or <a href="#gzwrite">gzwrite</a> on the
+   given compressed file. This position represents a number of bytes in the
+   uncompressed data stream.
+   <p>
+
+   <a href="#gztell">gztell</a>(file) is equivalent to <a href="#gzseek">gzseek</a>(file, 0L, SEEK_CUR)
+   <p>
+
+<font color="Blue"><dt> int  <a name="gzeof">gzeof</a> (gzFile file);</font>
+<dd>
+     Returns 1 when EOF has previously been detected reading the given
+   input stream, otherwise zero.
+   <p>
+
+<font color="Blue"><dt> int     <a name="gzclose">gzclose</a> (gzFile file);</font>
+<dd>
+     Flushes all pending output if necessary, closes the compressed file
+   and deallocates all the (de)compression <a href="#state">state</a>. The return value is the zlib
+   error number (see function <a href="#gzerror">gzerror</a> below).
+   <p>
+
+<font color="Blue"><dt> const char *  <a name="gzerror">gzerror</a> (gzFile file, int *errnum);</font>
+<dd>
+     Returns the error message for the last error which occurred on the
+   given compressed file. errnum is set to zlib error number. If an
+   error occurred in the file system and not in the compression library,
+   errnum is set to <a href="#Z_ERRNO">Z_ERRNO</a> and the application may consult errno
+   to get the exact error code.
+   <p>
+</dl>
+<hr>
+<a name="Basic functions"><h2> Basic functions </h2>
+<h3> Function list </h3>
+<ul>
+<li>  const char *  <a href="#zlibVersion">zlibVersion</a> (void);
+<li>  int  <a href="#deflateInit">deflateInit</a> (<a href="#z_streamp">z_streamp</a> strm, int level);
+<li>  int  <a href="#deflate">deflate</a> (<a href="#z_streamp">z_streamp</a> strm, int flush);
+<li>  int  <a href="#deflateEnd">deflateEnd</a> (<a href="#z_streamp">z_streamp</a> strm);
+<li>  int  <a href="#inflateInit">inflateInit</a> (<a href="#z_streamp">z_streamp</a> strm);
+<li>  int  <a href="#inflate">inflate</a> (<a href="#z_streamp">z_streamp</a> strm, int flush);
+<li>  int  <a href="#inflateEnd">inflateEnd</a> (<a href="#z_streamp">z_streamp</a> strm);
+</ul>
+
+<h3> Function description </h3>
+<dl>
+<font color="Blue"><dt>  const char *  <a name="zlibVersion">zlibVersion</a> (void);</font>
+<dd> The application can compare <a href="#zlibVersion">zlibVersion</a> and ZLIB_VERSION for consistency.
+   If the first character differs, the library code actually used is
+   not compatible with the zlib.h header file used by the application.
+   This check is automatically made by <a href="#deflateInit">deflateInit</a> and <a href="#inflateInit">inflateInit</a>.
+   <p>
+
+<font color="Blue"><dt> int  <a name="deflateInit">deflateInit</a> (<a href="#z_streamp">z_streamp</a> strm, int level);</font>
+<dd>
+     Initializes the internal stream <a href="#state">state</a> for compression. The fields
+   <a href="#zalloc">zalloc</a>, <a href="#zfree">zfree</a> and <a href="#opaque">opaque</a> must be initialized before by the caller.
+   If <a href="#zalloc">zalloc</a> and <a href="#zfree">zfree</a> are set to <a href="#Z_NULL">Z_NULL</a>, <a href="#deflateInit">deflateInit</a> updates them to
+   use default allocation functions.
+   <p>
+
+     The compression level must be <a href="#Z_DEFAULT_COMPRESSION">Z_DEFAULT_COMPRESSION</a>, or between 0 and 9:
+   1 gives best speed, 9 gives best compression, 0 gives no compression at
+   all (the input data is simply copied a block at a time).
+   <p>
+
+   <a href="#Z_DEFAULT_COMPRESSION">Z_DEFAULT_COMPRESSION</a> requests a default compromise between speed and
+   compression (currently equivalent to level 6).
+   <p>
+
+     <a href="#deflateInit">deflateInit</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_MEM_ERROR">Z_MEM_ERROR</a> if there was not
+   enough memory, <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if level is not a valid compression level,
+   <a href="#Z_VERSION_ERROR">Z_VERSION_ERROR</a> if the zlib library version (<a href="#zlib_version">zlib_version</a>) is incompatible
+   with the version assumed by the caller (ZLIB_VERSION).
+   <a href="#msg">msg</a> is set to null if there is no error message.  <a href="#deflateInit">deflateInit</a> does not
+   perform any compression: this will be done by <a href="#deflate">deflate</a>().
+   <p>
+
+<font color="Blue"><dt>  int  <a name="deflate">deflate</a> (<a href="#z_streamp">z_streamp</a> strm, int flush);</font>
+<dd>
+    <a href="#deflate">deflate</a> compresses as much data as possible, and stops when the input
+  buffer becomes empty or the output buffer becomes full. It may introduce some
+  output latency (reading input without producing any output) except when
+  forced to flush.<p>
+
+    The detailed semantics are as follows. <a href="#deflate">deflate</a> performs one or both of the
+  following actions:
+
+  <ul>
+  <li> Compress more input starting at <a href="#next_in">next_in</a> and update <a href="#next_in">next_in</a> and <a href="#avail_in">avail_in</a>
+    accordingly. If not all input can be processed (because there is not
+    enough room in the output buffer), <a href="#next_in">next_in</a> and <a href="#avail_in">avail_in</a> are updated and
+    processing will resume at this point for the next call of <a href="#deflate">deflate</a>().
+
+  <li>
+    Provide more output starting at <a href="#next_out">next_out</a> and update <a href="#next_out">next_out</a> and <a href="#avail_out">avail_out</a>
+    accordingly. This action is forced if the parameter flush is non zero.
+    Forcing flush frequently degrades the compression ratio, so this parameter
+    should be set only when necessary (in interactive applications).
+    Some output may be provided even if flush is not set.
+  </ul> <p>
+
+  Before the call of <a href="#deflate">deflate</a>(), the application should ensure that at least
+  one of the actions is possible, by providing more input and/or consuming
+  more output, and updating <a href="#avail_in">avail_in</a> or <a href="#avail_out">avail_out</a> accordingly ; <a href="#avail_out">avail_out</a>
+  should never be zero before the call. The application can consume the
+  compressed output when it wants, for example when the output buffer is full
+  (<a href="#avail_out">avail_out</a> == 0), or after each call of <a href="#deflate">deflate</a>(). If <a href="#deflate">deflate</a> returns <a href="#Z_OK">Z_OK</a>
+  and with zero <a href="#avail_out">avail_out</a>, it must be called again after making room in the
+  output buffer because there might be more output pending.
+  <p>
+
+    If the parameter flush is set to <a href="#Z_SYNC_FLUSH">Z_SYNC_FLUSH</a>, all pending output is
+  flushed to the output buffer and the output is aligned on a byte boundary, so
+  that the decompressor can get all input data available so far. (In particular
+  <a href="#avail_in">avail_in</a> is zero after the call if enough output space has been provided
+  before the call.)  Flushing may degrade compression for some compression
+  algorithms and so it should be used only when necessary.
+  <p>
+
+    If flush is set to <a href="#Z_FULL_FLUSH">Z_FULL_FLUSH</a>, all output is flushed as with
+  <a href="#Z_SYNC_FLUSH">Z_SYNC_FLUSH</a>, and the compression <a href="#state">state</a> is reset so that decompression can
+  restart from this point if previous compressed data has been damaged or if
+  random access is desired. Using <a href="#Z_FULL_FLUSH">Z_FULL_FLUSH</a> too often can seriously degrade
+  the compression.
+  <p>
+
+    If <a href="#deflate">deflate</a> returns with <a href="#avail_out">avail_out</a> == 0, this function must be called again
+  with the same value of the flush parameter and more output space (updated
+  <a href="#avail_out">avail_out</a>), until the flush is complete (<a href="#deflate">deflate</a> returns with non-zero
+  <a href="#avail_out">avail_out</a>).
+  <p>
+
+    If the parameter flush is set to <a href="#Z_FINISH">Z_FINISH</a>, pending input is processed,
+  pending output is flushed and <a href="#deflate">deflate</a> returns with <a href="#Z_STREAM_END">Z_STREAM_END</a> if there
+  was enough output space ; if <a href="#deflate">deflate</a> returns with <a href="#Z_OK">Z_OK</a>, this function must be
+  called again with <a href="#Z_FINISH">Z_FINISH</a> and more output space (updated <a href="#avail_out">avail_out</a>) but no
+  more input data, until it returns with <a href="#Z_STREAM_END">Z_STREAM_END</a> or an error. After
+  <a href="#deflate">deflate</a> has returned <a href="#Z_STREAM_END">Z_STREAM_END</a>, the only possible operations on the
+  stream are <a href="#deflateReset">deflateReset</a> or <a href="#deflateEnd">deflateEnd</a>.
+  <p>
+
+    <a href="#Z_FINISH">Z_FINISH</a> can be used immediately after <a href="#deflateInit">deflateInit</a> if all the compression
+  is to be done in a single step. In this case, <a href="#avail_out">avail_out</a> must be at least
+  0.1% larger than <a href="#avail_in">avail_in</a> plus 12 bytes.  If <a href="#deflate">deflate</a> does not return
+  <a href="#Z_STREAM_END">Z_STREAM_END</a>, then it must be called again as described above.
+  <p>
+
+    <a href="#deflate">deflate</a>() sets strm-&gt <a href="#adler">adler</a> to the <a href="#adler32">adler32</a> checksum of all input read
+  so far (that is, <a href="#total_in">total_in</a> bytes).
+  <p>
+
+    <a href="#deflate">deflate</a>() may update <a href="#data_type">data_type</a> if it can make a good guess about
+  the input data type (<a href="#Z_ASCII">Z_ASCII</a> or <a href="#Z_BINARY">Z_BINARY</a>). In doubt, the data is considered
+  binary. This field is only for information purposes and does not affect
+  the compression algorithm in any manner.
+  <p>
+
+    <a href="#deflate">deflate</a>() returns <a href="#Z_OK">Z_OK</a> if some progress has been made (more input
+  processed or more output produced), <a href="#Z_STREAM_END">Z_STREAM_END</a> if all input has been
+  consumed and all output has been produced (only when flush is set to
+  <a href="#Z_FINISH">Z_FINISH</a>), <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the stream <a href="#state">state</a> was inconsistent (for example
+  if <a href="#next_in">next_in</a> or <a href="#next_out">next_out</a> was NULL), <a href="#Z_BUF_ERROR">Z_BUF_ERROR</a> if no progress is possible
+  (for example <a href="#avail_in">avail_in</a> or <a href="#avail_out">avail_out</a> was zero).
+  <p>
+
+<font color="Blue"><dt>  int  <a name="deflateEnd">deflateEnd</a> (<a href="#z_streamp">z_streamp</a> strm);</font>
+<dd>
+     All dynamically allocated data structures for this stream are freed.
+   This function discards any unprocessed input and does not flush any
+   pending output.
+   <p>
+
+     <a href="#deflateEnd">deflateEnd</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the
+   stream <a href="#state">state</a> was inconsistent, <a href="#Z_DATA_ERROR">Z_DATA_ERROR</a> if the stream was freed
+   prematurely (some input or output was discarded). In the error case,
+   <a href="#msg">msg</a> may be set but then points to a static string (which must not be
+   deallocated).
+   <p>
+
+<font color="Blue"><dt>  int  <a name="inflateInit">inflateInit</a> (<a href="#z_streamp">z_streamp</a> strm);</font>
+<dd>
+	Initializes the internal stream <a href="#state">state</a> for decompression. The fields
+   <a href="#next_in">next_in</a>, <a href="#avail_in">avail_in</a>, <a href="#zalloc">zalloc</a>, <a href="#zfree">zfree</a> and <a href="#opaque">opaque</a> must be initialized before by
+   the caller. If <a href="#next_in">next_in</a> is not <a href="#Z_NULL">Z_NULL</a> and <a href="#avail_in">avail_in</a> is large enough (the exact
+   value depends on the compression method), <a href="#inflateInit">inflateInit</a> determines the
+   compression method from the zlib header and allocates all data structures
+   accordingly ; otherwise the allocation will be deferred to the first call of
+   <a href="#inflate">inflate</a>.  If <a href="#zalloc">zalloc</a> and <a href="#zfree">zfree</a> are set to <a href="#Z_NULL">Z_NULL</a>, <a href="#inflateInit">inflateInit</a> updates them to
+   use default allocation functions.
+   <p>
+
+     <a href="#inflateInit">inflateInit</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_MEM_ERROR">Z_MEM_ERROR</a> if there was not enough
+   memory, <a href="#Z_VERSION_ERROR">Z_VERSION_ERROR</a> if the zlib library version is incompatible with the
+   version assumed by the caller.  <a href="#msg">msg</a> is set to null if there is no error
+   message. <a href="#inflateInit">inflateInit</a> does not perform any decompression apart from reading
+   the zlib header if present: this will be done by <a href="#inflate">inflate</a>().  (So <a href="#next_in">next_in</a> and
+   <a href="#avail_in">avail_in</a> may be modified, but <a href="#next_out">next_out</a> and <a href="#avail_out">avail_out</a> are unchanged.)
+   <p>
+
+<font color="Blue"><dt>  int  <a name="inflate">inflate</a> (<a href="#z_streamp">z_streamp</a> strm, int flush);</font>
+<dd>
+    <a href="#inflate">inflate</a> decompresses as much data as possible, and stops when the input
+  buffer becomes empty or the output buffer becomes full. It may some
+  introduce some output latency (reading input without producing any output)
+  except when forced to flush.
+  <p>
+
+  The detailed semantics are as follows. <a href="#inflate">inflate</a> performs one or both of the
+  following actions:
+
+  <ul>
+  <li> Decompress more input starting at <a href="#next_in">next_in</a> and update <a href="#next_in">next_in</a> and <a href="#avail_in">avail_in</a>
+    accordingly. If not all input can be processed (because there is not
+    enough room in the output buffer), <a href="#next_in">next_in</a> is updated and processing
+    will resume at this point for the next call of <a href="#inflate">inflate</a>().
+
+  <li> Provide more output starting at <a href="#next_out">next_out</a> and update <a href="#next_out">next_out</a> and
+    <a href="#avail_out">avail_out</a> accordingly.  <a href="#inflate">inflate</a>() provides as much output as possible,
+    until there is no more input data or no more space in the output buffer
+    (see below about the flush parameter).
+  </ul> <p>
+
+  Before the call of <a href="#inflate">inflate</a>(), the application should ensure that at least
+  one of the actions is possible, by providing more input and/or consuming
+  more output, and updating the next_* and avail_* values accordingly.
+  The application can consume the uncompressed output when it wants, for
+  example when the output buffer is full (<a href="#avail_out">avail_out</a> == 0), or after each
+  call of <a href="#inflate">inflate</a>(). If <a href="#inflate">inflate</a> returns <a href="#Z_OK">Z_OK</a> and with zero <a href="#avail_out">avail_out</a>, it
+  must be called again after making room in the output buffer because there
+  might be more output pending.
+  <p>
+
+    If the parameter flush is set to <a href="#Z_SYNC_FLUSH">Z_SYNC_FLUSH</a>, <a href="#inflate">inflate</a> flushes as much
+  output as possible to the output buffer. The flushing behavior of <a href="#inflate">inflate</a> is
+  not specified for values of the flush parameter other than <a href="#Z_SYNC_FLUSH">Z_SYNC_FLUSH</a>
+  and <a href="#Z_FINISH">Z_FINISH</a>, but the current implementation actually flushes as much output
+  as possible anyway.
+  <p>
+
+    <a href="#inflate">inflate</a>() should normally be called until it returns <a href="#Z_STREAM_END">Z_STREAM_END</a> or an
+  error. However if all decompression is to be performed in a single step
+  (a single call of <a href="#inflate">inflate</a>), the parameter flush should be set to
+  <a href="#Z_FINISH">Z_FINISH</a>. In this case all pending input is processed and all pending
+  output is flushed ; <a href="#avail_out">avail_out</a> must be large enough to hold all the
+  uncompressed data. (The size of the uncompressed data may have been saved
+  by the compressor for this purpose.) The next operation on this stream must
+  be <a href="#inflateEnd">inflateEnd</a> to deallocate the decompression <a href="#state">state</a>. The use of <a href="#Z_FINISH">Z_FINISH</a>
+  is never required, but can be used to inform <a href="#inflate">inflate</a> that a faster routine
+  may be used for the single <a href="#inflate">inflate</a>() call.
+  <p>
+
+     If a preset dictionary is needed at this point (see <a href="#inflateSetDictionary">inflateSetDictionary</a>
+  below), <a href="#inflate">inflate</a> sets strm-<a href="#adler">adler</a> to the <a href="#adler32">adler32</a> checksum of the
+  dictionary chosen by the compressor and returns <a href="#Z_NEED_DICT">Z_NEED_DICT</a> ; otherwise
+  it sets strm-&gt <a href="#adler">adler</a> to the <a href="#adler32">adler32</a> checksum of all output produced
+  so far (that is, <a href="#total_out">total_out</a> bytes) and returns <a href="#Z_OK">Z_OK</a>, <a href="#Z_STREAM_END">Z_STREAM_END</a> or
+  an error code as described below. At the end of the stream, <a href="#inflate">inflate</a>()
+  checks that its computed <a href="#adler32">adler32</a> checksum is equal to that saved by the
+  compressor and returns <a href="#Z_STREAM_END">Z_STREAM_END</a> only if the checksum is correct.
+  <p>
+
+    <a href="#inflate">inflate</a>() returns <a href="#Z_OK">Z_OK</a> if some progress has been made (more input processed
+  or more output produced), <a href="#Z_STREAM_END">Z_STREAM_END</a> if the end of the compressed data has
+  been reached and all uncompressed output has been produced, <a href="#Z_NEED_DICT">Z_NEED_DICT</a> if a
+  preset dictionary is needed at this point, <a href="#Z_DATA_ERROR">Z_DATA_ERROR</a> if the input data was
+  corrupted (input stream not conforming to the zlib format or incorrect
+  <a href="#adler32">adler32</a> checksum), <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the stream structure was inconsistent
+  (for example if <a href="#next_in">next_in</a> or <a href="#next_out">next_out</a> was NULL), <a href="#Z_MEM_ERROR">Z_MEM_ERROR</a> if there was not
+  enough memory, <a href="#Z_BUF_ERROR">Z_BUF_ERROR</a> if no progress is possible or if there was not
+  enough room in the output buffer when <a href="#Z_FINISH">Z_FINISH</a> is used. In the <a href="#Z_DATA_ERROR">Z_DATA_ERROR</a>
+  case, the application may then call <a href="#inflateSync">inflateSync</a> to look for a good
+  compression block.
+  <p>
+
+<font color="Blue"><dt>  int  <a name="inflateEnd">inflateEnd</a> (<a href="#z_streamp">z_streamp</a> strm);</font>
+<dd>
+     All dynamically allocated data structures for this stream are freed.
+   This function discards any unprocessed input and does not flush any
+   pending output.
+   <p>
+
+     <a href="#inflateEnd">inflateEnd</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the stream <a href="#state">state</a>
+   was inconsistent. In the error case, <a href="#msg">msg</a> may be set but then points to a
+   static string (which must not be deallocated).
+</dl>
+<hr>
+<a name="Advanced functions"><h2> Advanced functions </h2>
+    The following functions are needed only in some special applications.
+<h3> Function list </h3>
+<ul>
+<li>  int  <a href="#deflateInit2">deflateInit2</a> (<a href="#z_streamp">z_streamp</a> strm,
+<li> int  <a href="#deflateSetDictionary">deflateSetDictionary</a> (<a href="#z_streamp">z_streamp</a> strm, const Bytef *dictionary, uInt  dictLength);
+<li> int  <a href="#deflateCopy">deflateCopy</a> (<a href="#z_streamp">z_streamp</a> dest, <a href="#z_streamp">z_streamp</a> source);
+<li> int  <a href="#deflateReset">deflateReset</a> (<a href="#z_streamp">z_streamp</a> strm);
+<li> int  <a href="#deflateParams">deflateParams</a> (<a href="#z_streamp">z_streamp</a> strm, int level, int strategy);
+<li> int  <a href="#inflateInit2">inflateInit2</a> (<a href="#z_streamp">z_streamp</a> strm, int  windowBits);
+<li>  int  <a href="#inflateSetDictionary">inflateSetDictionary</a> (<a href="#z_streamp">z_streamp</a> strm, const Bytef *dictionary, uInt  dictLength);
+<li> int  <a href="#inflateSync">inflateSync</a> (<a href="#z_streamp">z_streamp</a> strm);
+<li> int  <a href="#inflateReset">inflateReset</a> (<a href="#z_streamp">z_streamp</a> strm);
+
+</ul>
+<h3> Function description </h3>
+<dl>
+<font color="Blue"><dt>  int  <a name="deflateInit2">deflateInit2</a> (<a href="#z_streamp">z_streamp</a> strm, int  level, int  method, int  windowBits, int  memLevel, int  strategy);</font>
+
+<dd> This is another version of <a href="#deflateInit">deflateInit</a> with more compression options. The
+   fields <a href="#next_in">next_in</a>, <a href="#zalloc">zalloc</a>, <a href="#zfree">zfree</a> and <a href="#opaque">opaque</a> must be initialized before by
+   the caller.<p>
+
+     The method parameter is the compression method. It must be <a href="#Z_DEFLATED">Z_DEFLATED</a> in
+   this version of the library.<p>
+
+     The windowBits parameter is the base two logarithm of the window size
+   (the size of the history buffer).  It should be in the range 8..15 for this
+   version of the library. Larger values of this parameter result in better
+   compression at the expense of memory usage. The default value is 15 if
+   <a href="#deflateInit">deflateInit</a> is used instead.<p>
+
+     The memLevel parameter specifies how much memory should be allocated
+   for the internal compression <a href="#state">state</a>. memLevel=1 uses minimum memory but
+   is slow and reduces compression ratio ; memLevel=9 uses maximum memory
+   for optimal speed. The default value is 8. See zconf.h for total memory
+   usage as a function of windowBits and memLevel.<p>
+
+     The strategy parameter is used to tune the compression algorithm. Use the
+   value <a href="#Z_DEFAULT_STRATEGY">Z_DEFAULT_STRATEGY</a> for normal data, <a href="#Z_FILTERED">Z_FILTERED</a> for data produced by a
+   filter (or predictor), or <a href="#Z_HUFFMAN_ONLY">Z_HUFFMAN_ONLY</a> to force Huffman encoding only (no
+   string match).  Filtered data consists mostly of small values with a
+   somewhat random distribution. In this case, the compression algorithm is
+   tuned to <a href="#compress">compress</a> them better. The effect of <a href="#Z_FILTERED">Z_FILTERED</a> is to force more
+   Huffman coding and less string matching ; it is somewhat intermediate
+   between Z_DEFAULT and <a href="#Z_HUFFMAN_ONLY">Z_HUFFMAN_ONLY</a>. The strategy parameter only affects
+   the compression ratio but not the correctness of the compressed output even
+   if it is not set appropriately.<p>
+
+      <a href="#deflateInit2">deflateInit2</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_MEM_ERROR">Z_MEM_ERROR</a> if there was not enough
+   memory, <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if a parameter is invalid (such as an invalid
+   method). <a href="#msg">msg</a> is set to null if there is no error message.  <a href="#deflateInit2">deflateInit2</a> does
+   not perform any compression: this will be done by <a href="#deflate">deflate</a>().<p>
+
+<font color="Blue"><dt> int  <a name="deflateSetDictionary">deflateSetDictionary</a> (<a href="#z_streamp">z_streamp</a> strm, const Bytef *dictionary, uInt  dictLength);</font>
+<dd>
+     Initializes the compression dictionary from the given byte sequence
+   without producing any compressed output. This function must be called
+   immediately after <a href="#deflateInit">deflateInit</a>, <a href="#deflateInit2">deflateInit2</a> or <a href="#deflateReset">deflateReset</a>, before any
+   call of <a href="#deflate">deflate</a>. The compressor and decompressor must use exactly the same
+   dictionary (see <a href="#inflateSetDictionary">inflateSetDictionary</a>).<p>
+
+     The dictionary should consist of strings (byte sequences) that are likely
+   to be encountered later in the data to be compressed, with the most commonly
+   used strings preferably put towards the end of the dictionary. Using a
+   dictionary is most useful when the data to be compressed is short and can be
+   predicted with good accuracy ; the data can then be compressed better than
+   with the default empty dictionary.<p>
+
+     Depending on the size of the compression data structures selected by
+   <a href="#deflateInit">deflateInit</a> or <a href="#deflateInit2">deflateInit2</a>, a part of the dictionary may in effect be
+   discarded, for example if the dictionary is larger than the window size in
+   <a href="#deflate">deflate</a> or deflate2. Thus the strings most likely to be useful should be
+   put at the end of the dictionary, not at the front.<p>
+
+     Upon return of this function, strm-&gt <a href="#adler">adler</a> is set to the Adler32 value
+   of the dictionary ; the decompressor may later use this value to determine
+   which dictionary has been used by the compressor. (The Adler32 value
+   applies to the whole dictionary even if only a subset of the dictionary is
+   actually used by the compressor.)<p>
+
+     <a href="#deflateSetDictionary">deflateSetDictionary</a> returns <a href="#Z_OK">Z_OK</a> if success, or <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if a
+   parameter is invalid (such as NULL dictionary) or the stream <a href="#state">state</a> is
+   inconsistent (for example if <a href="#deflate">deflate</a> has already been called for this stream
+   or if the compression method is bsort). <a href="#deflateSetDictionary">deflateSetDictionary</a> does not
+   perform any compression: this will be done by <a href="#deflate">deflate</a>().<p>
+
+<font color="Blue"><dt> int  <a name="deflateCopy">deflateCopy</a> (<a href="#z_streamp">z_streamp</a> dest, <a href="#z_streamp">z_streamp</a> source);</font>
+<dd>
+     Sets the destination stream as a complete copy of the source stream.<p>
+
+     This function can be useful when several compression strategies will be
+   tried, for example when there are several ways of pre-processing the input
+   data with a filter. The streams that will be discarded should then be freed
+   by calling <a href="#deflateEnd">deflateEnd</a>.  Note that <a href="#deflateCopy">deflateCopy</a> duplicates the internal
+   compression <a href="#state">state</a> which can be quite large, so this strategy is slow and
+   can consume lots of memory.<p>
+
+     <a href="#deflateCopy">deflateCopy</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_MEM_ERROR">Z_MEM_ERROR</a> if there was not
+   enough memory, <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the source stream <a href="#state">state</a> was inconsistent
+   (such as <a href="#zalloc">zalloc</a> being NULL). <a href="#msg">msg</a> is left unchanged in both source and
+   destination.<p>
+
+<font color="Blue"><dt> int  <a name="deflateReset">deflateReset</a> (<a href="#z_streamp">z_streamp</a> strm);</font>
+<dd>     This function is equivalent to <a href="#deflateEnd">deflateEnd</a> followed by <a href="#deflateInit">deflateInit</a>,
+   but does not free and reallocate all the internal compression <a href="#state">state</a>.
+   The stream will keep the same compression level and any other attributes
+   that may have been set by <a href="#deflateInit2">deflateInit2</a>.<p>
+
+      <a href="#deflateReset">deflateReset</a> returns <a href="#Z_OK">Z_OK</a> if success, or <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the source
+   stream <a href="#state">state</a> was inconsistent (such as <a href="#zalloc">zalloc</a> or <a href="#state">state</a> being NULL).<p>
+
+<font color="Blue"><dt> int  <a name="deflateParams">deflateParams</a> (<a href="#z_streamp">z_streamp</a> strm, int level, int strategy);</font>
+<dd>
+     Dynamically update the compression level and compression strategy.  The
+   interpretation of level and strategy is as in <a href="#deflateInit2">deflateInit2</a>.  This can be
+   used to switch between compression and straight copy of the input data, or
+   to switch to a different kind of input data requiring a different
+   strategy. If the compression level is changed, the input available so far
+   is compressed with the old level (and may be flushed); the new level will
+   take effect only at the next call of <a href="#deflate">deflate</a>().<p>
+
+     Before the call of <a href="#deflateParams">deflateParams</a>, the stream <a href="#state">state</a> must be set as for
+   a call of <a href="#deflate">deflate</a>(), since the currently available input may have to
+   be compressed and flushed. In particular, strm-&gt <a href="#avail_out">avail_out</a> must be
+   non-zero.<p>
+
+     <a href="#deflateParams">deflateParams</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the source
+   stream <a href="#state">state</a> was inconsistent or if a parameter was invalid, <a href="#Z_BUF_ERROR">Z_BUF_ERROR</a>
+   if strm-&gtavail_out was zero.<p>
+
+<font color="Blue"><dt> int  <a name="inflateInit2">inflateInit2</a> (<a href="#z_streamp">z_streamp</a> strm, int  windowBits);</font>
+
+<dd>     This is another version of <a href="#inflateInit">inflateInit</a> with an extra parameter. The
+   fields <a href="#next_in">next_in</a>, <a href="#avail_in">avail_in</a>, <a href="#zalloc">zalloc</a>, <a href="#zfree">zfree</a> and <a href="#opaque">opaque</a> must be initialized
+   before by the caller.<p>
+
+     The windowBits parameter is the base two logarithm of the maximum window
+   size (the size of the history buffer).  It should be in the range 8..15 for
+   this version of the library. The default value is 15 if <a href="#inflateInit">inflateInit</a> is used
+   instead. If a compressed stream with a larger window size is given as
+   input, <a href="#inflate">inflate</a>() will return with the error code <a href="#Z_DATA_ERROR">Z_DATA_ERROR</a> instead of
+   trying to allocate a larger window.<p>
+
+      <a href="#inflateInit2">inflateInit2</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_MEM_ERROR">Z_MEM_ERROR</a> if there was not enough
+   memory, <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if a parameter is invalid (such as a negative
+   memLevel). <a href="#msg">msg</a> is set to null if there is no error message.  <a href="#inflateInit2">inflateInit2</a>
+   does not perform any decompression apart from reading the zlib header if
+   present: this will be done by <a href="#inflate">inflate</a>(). (So <a href="#next_in">next_in</a> and <a href="#avail_in">avail_in</a> may be
+   modified, but <a href="#next_out">next_out</a> and <a href="#avail_out">avail_out</a> are unchanged.)<p>
+
+<font color="Blue"><dt>  int  <a name="inflateSetDictionary">inflateSetDictionary</a> (<a href="#z_streamp">z_streamp</a> strm, const Bytef *dictionary, uInt  dictLength);</font>
+<dd>
+     Initializes the decompression dictionary from the given uncompressed byte
+   sequence. This function must be called immediately after a call of <a href="#inflate">inflate</a>
+   if this call returned <a href="#Z_NEED_DICT">Z_NEED_DICT</a>. The dictionary chosen by the compressor
+   can be determined from the Adler32 value returned by this call of
+   <a href="#inflate">inflate</a>. The compressor and decompressor must use exactly the same
+   dictionary (see <a href="#deflateSetDictionary">deflateSetDictionary</a>).<p>
+
+     <a href="#inflateSetDictionary">inflateSetDictionary</a> returns <a href="#Z_OK">Z_OK</a> if success, <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if a
+   parameter is invalid (such as NULL dictionary) or the stream <a href="#state">state</a> is
+   inconsistent, <a href="#Z_DATA_ERROR">Z_DATA_ERROR</a> if the given dictionary doesn't match the
+   expected one (incorrect Adler32 value). <a href="#inflateSetDictionary">inflateSetDictionary</a> does not
+   perform any decompression: this will be done by subsequent calls of
+   <a href="#inflate">inflate</a>().<p>
+
+<font color="Blue"><dt> int  <a name="inflateSync">inflateSync</a> (<a href="#z_streamp">z_streamp</a> strm);</font>
+
+<dd>    Skips invalid compressed data until a full flush point (see above the
+  description of <a href="#deflate">deflate</a> with <a href="#Z_FULL_FLUSH">Z_FULL_FLUSH</a>) can be found, or until all
+  available input is skipped. No output is provided.<p>
+
+    <a href="#inflateSync">inflateSync</a> returns <a href="#Z_OK">Z_OK</a> if a full flush point has been found, <a href="#Z_BUF_ERROR">Z_BUF_ERROR</a>
+  if no more input was provided, <a href="#Z_DATA_ERROR">Z_DATA_ERROR</a> if no flush point has been found,
+  or <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the stream structure was inconsistent. In the success
+  case, the application may save the current current value of <a href="#total_in">total_in</a> which
+  indicates where valid compressed data was found. In the error case, the
+  application may repeatedly call <a href="#inflateSync">inflateSync</a>, providing more input each time,
+  until success or end of the input data.<p>
+
+<font color="Blue"><dt> int  <a name="inflateReset">inflateReset</a> (<a href="#z_streamp">z_streamp</a> strm);</font>
+<dd>
+     This function is equivalent to <a href="#inflateEnd">inflateEnd</a> followed by <a href="#inflateInit">inflateInit</a>,
+   but does not free and reallocate all the internal decompression <a href="#state">state</a>.
+   The stream will keep attributes that may have been set by <a href="#inflateInit2">inflateInit2</a>.
+   <p>
+
+      <a href="#inflateReset">inflateReset</a> returns <a href="#Z_OK">Z_OK</a> if success, or <a href="#Z_STREAM_ERROR">Z_STREAM_ERROR</a> if the source
+   stream <a href="#state">state</a> was inconsistent (such as <a href="#zalloc">zalloc</a> or <a href="#state">state</a> being NULL).
+   <p>
+</dl>
+
+<hr>
+<a name="Checksum functions"><h2> Checksum functions </h2>
+     These functions are not related to compression but are exported
+   anyway because they might be useful in applications using the
+   compression library.
+<h3> Function list </h3>
+<ul>
+<li> uLong  <a href="#adler32">adler32</a> (uLong <a href="#adler">adler</a>, const Bytef *buf, uInt len);
+<li> uLong  <a href="#crc32">crc32</a>   (uLong crc, const Bytef *buf, uInt len);
+</ul>
+<h3> Function description </h3>
+<dl>
+<font color="Blue"><dt> uLong  <a name="adler32">adler32</a> (uLong <a href="#adler">adler</a>, const Bytef *buf, uInt len);</font>
+<dd>
+     Update a running Adler-32 checksum with the bytes buf[0..len-1] and
+   return the updated checksum. If buf is NULL, this function returns
+   the required initial value for the checksum.
+   <p>
+   An Adler-32 checksum is almost as reliable as a CRC32 but can be computed
+   much faster. Usage example:
+   <pre>
+
+     uLong <a href="#adler">adler</a> = <a href="#adler32">adler32</a>(0L, <a href="#Z_NULL">Z_NULL</a>, 0);
+
+     while (read_buffer(buffer, length) != EOF) {
+       <a href="#adler">adler</a> = <a href="#adler32">adler32</a>(<a href="#adler">adler</a>, buffer, length);
+     }
+     if (<a href="#adler">adler</a> != original_adler) error();
+   </pre>
+
+<font color="Blue"><dt> uLong  <a name="crc32">crc32</a>   (uLong crc, const Bytef *buf, uInt len);</font>
+<dd>
+     Update a running crc with the bytes buf[0..len-1] and return the updated
+   crc. If buf is NULL, this function returns the required initial value
+   for the crc. Pre- and post-conditioning (one's complement) is performed
+   within this function so it shouldn't be done by the application.
+   Usage example:
+   <pre>
+
+     uLong crc = <a href="#crc32">crc32</a>(0L, <a href="#Z_NULL">Z_NULL</a>, 0);
+
+     while (read_buffer(buffer, length) != EOF) {
+       crc = <a href="#crc32">crc32</a>(crc, buffer, length);
+     }
+     if (crc != original_crc) error();
+   </pre>
+</dl>
+<hr>
+<a name="struct z_stream_s"><h2> struct z_stream_s </h2>
+<font color="Blue">
+<a name="z_stream_s">
+<pre>
+typedef struct z_stream_s {
+    Bytef    *<a name="next_in">next_in</a>;  /* next input byte */
+    uInt     <a name="avail_in">avail_in</a>;  /* number of bytes available at <a href="#next_in">next_in</a> */
+    uLong    <a name="total_in">total_in</a>;  /* total nb of input bytes read so far */
+
+    Bytef    *<a name="next_out">next_out</a>; /* next output byte should be put there */
+    uInt     <a name="avail_out">avail_out</a>; /* remaining free space at <a href="#next_out">next_out</a> */
+    uLong    <a name="total_out">total_out</a>; /* total nb of bytes output so far */
+
+    char     *<a name="msg">msg</a>;      /* last error message, NULL if no error */
+    struct internal_state FAR *<a name="state">state</a>; /* not visible by applications */
+
+    alloc_func <a name="zalloc">zalloc</a>;  /* used to allocate the internal <a href="#state">state</a> */
+    free_func  <a name="zfree">zfree</a>;   /* used to free the internal <a href="#state">state</a> */
+    voidpf     <a name="opaque">opaque</a>;  /* private data object passed to <a href="#zalloc">zalloc</a> and <a href="#zfree">zfree</a> */
+
+    int     <a name="data_type">data_type</a>;  /* best guess about the data type: ascii or binary */
+    uLong   <a name="adler">adler</a>;      /* <a href="#adler32">adler32</a> value of the uncompressed data */
+    uLong   <a name="reserved">reserved</a>;   /* <a href="#reserved">reserved</a> for future use */
+} <a href="#z_stream_s">z_stream</a> ;
+
+typedef <a href="#z_stream_s">z_stream</a> FAR * <a name="z_streamp">z_streamp</a>;  �
+</pre>
+</font>
+   The application must update <a href="#next_in">next_in</a> and <a href="#avail_in">avail_in</a> when <a href="#avail_in">avail_in</a> has
+   dropped to zero. It must update <a href="#next_out">next_out</a> and <a href="#avail_out">avail_out</a> when <a href="#avail_out">avail_out</a>
+   has dropped to zero. The application must initialize <a href="#zalloc">zalloc</a>, <a href="#zfree">zfree</a> and
+   <a href="#opaque">opaque</a> before calling the init function. All other fields are set by the
+   compression library and must not be updated by the application. <p>
+
+   The <a href="#opaque">opaque</a> value provided by the application will be passed as the first
+   parameter for calls of <a href="#zalloc">zalloc</a> and <a href="#zfree">zfree</a>. This can be useful for custom
+   memory management. The compression library attaches no meaning to the
+   <a href="#opaque">opaque</a> value. <p>
+
+   <a href="#zalloc">zalloc</a> must return <a href="#Z_NULL">Z_NULL</a> if there is not enough memory for the object.
+   If zlib is used in a multi-threaded application, <a href="#zalloc">zalloc</a> and <a href="#zfree">zfree</a> must be
+   thread safe. <p>
+
+   On 16-bit systems, the functions <a href="#zalloc">zalloc</a> and <a href="#zfree">zfree</a> must be able to allocate
+   exactly 65536 bytes, but will not be required to allocate more than this
+   if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS,
+   pointers returned by <a href="#zalloc">zalloc</a> for objects of exactly 65536 bytes *must*
+   have their offset normalized to zero. The default allocation function
+   provided by this library ensures this (see zutil.c). To reduce memory
+   requirements and avoid any allocation of 64K objects, at the expense of
+   compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h).
+   <p>
+
+   The fields <a href="#total_in">total_in</a> and <a href="#total_out">total_out</a> can be used for statistics or
+   progress reports. After compression, <a href="#total_in">total_in</a> holds the total size of
+   the uncompressed data and may be saved for use in the decompressor
+   (particularly if the decompressor wants to decompress everything in
+   a single step). <p>
+
+<hr>
+<a name="Constants"><h2> Constants </h2>
+<font color="Blue">
+<pre>
+#define <a name="Z_NO_FLUSH">Z_NO_FLUSH</a>      0
+#define <a name="Z_PARTIAL_FLUSH">Z_PARTIAL_FLUSH</a> 1
+	/* will be removed, use <a href="#Z_SYNC_FLUSH">Z_SYNC_FLUSH</a> instead */
+#define <a name="Z_SYNC_FLUSH">Z_SYNC_FLUSH</a>    2
+#define <a name="Z_FULL_FLUSH">Z_FULL_FLUSH</a>    3
+#define <a name="Z_FINISH">Z_FINISH</a>        4
+/* Allowed flush values ; see <a href="#deflate">deflate</a>() below for details */
+
+#define <a name="Z_OK">Z_OK</a>            0
+#define <a name="Z_STREAM_END">Z_STREAM_END</a>    1
+#define <a name="Z_NEED_DICT">Z_NEED_DICT</a>     2
+#define <a name="Z_ERRNO">Z_ERRNO</a>        (-1)
+#define <a name="Z_STREAM_ERROR">Z_STREAM_ERROR</a> (-2)
+#define <a name="Z_DATA_ERROR">Z_DATA_ERROR</a>   (-3)
+#define <a name="Z_MEM_ERROR">Z_MEM_ERROR</a>    (-4)
+#define <a name="Z_BUF_ERROR">Z_BUF_ERROR</a>    (-5)
+#define <a name="Z_VERSION_ERROR">Z_VERSION_ERROR</a> (-6)
+/* Return codes for the compression/decompression functions. Negative
+ * values are errors, positive values are used for special but normal events.
+ */
+
+#define <a name="Z_NO_COMPRESSION">Z_NO_COMPRESSION</a>         0
+#define <a name="Z_BEST_SPEED">Z_BEST_SPEED</a>             1
+#define <a name="Z_BEST_COMPRESSION">Z_BEST_COMPRESSION</a>       9
+#define <a name="Z_DEFAULT_COMPRESSION">Z_DEFAULT_COMPRESSION</a>  (-1)
+/* compression levels */
+
+#define <a name="Z_FILTERED">Z_FILTERED</a>            1
+#define <a name="Z_HUFFMAN_ONLY">Z_HUFFMAN_ONLY</a>        2
+#define <a name="Z_DEFAULT_STRATEGY">Z_DEFAULT_STRATEGY</a>    0
+/* compression strategy ; see <a href="#deflateInit2">deflateInit2</a>() below for details */
+
+#define <a name="Z_BINARY">Z_BINARY</a>   0
+#define <a name="Z_ASCII">Z_ASCII</a>    1
+#define <a name="Z_UNKNOWN">Z_UNKNOWN</a>  2
+/* Possible values of the <a href="#data_type">data_type</a> field */
+
+#define <a name="Z_DEFLATED">Z_DEFLATED</a>   8
+/* The <a href="#deflate">deflate</a> compression method (the only one supported in this version) */
+
+#define <a name="Z_NULL">Z_NULL</a>  0  /* for initializing <a href="#zalloc">zalloc</a>, <a href="#zfree">zfree</a>, <a href="#opaque">opaque</a> */
+
+#define <a name="zlib_version">zlib_version</a> <a href="#zlibVersion">zlibVersion</a>()
+/* for compatibility with versions less than 1.0.2 */
+</pre>
+</font>
+
+<hr>
+<a name="Misc"><h2> Misc </h2>
+ <a href="#deflateInit">deflateInit</a> and <a href="#inflateInit">inflateInit</a> are macros to allow checking the zlib version
+ and the compiler's view of <a href="#z_stream_s">z_stream</a>.
+ <p>
+ Other functions:
+ <dl>
+ <font color="Blue"><dt> const char   *  <a name="zError">zError</a>           (int err);</font>
+ <font color="Blue"><dt> int             <a name="inflateSyncPoint">inflateSyncPoint</a> (<a href="#z_streamp">z_streamp</a> z);</font>
+ <font color="Blue"><dt> const uLongf *  <a name="get_crc_table">get_crc_table</a>    (void);</font>
+ </dl>
+ <hr>
+ <font size="-1">
+ Last update: Wed Oct 13 20:42:34 1999<br>
+ piapi@csie.ntu.edu.tw
+ </font>
+
+</body>
+</html>
diff --git a/updater/zlib123/projects/README.projects b/updater/zlib123/projects/README.projects
new file mode 100644
index 0000000..d01ab11
--- /dev/null
+++ b/updater/zlib123/projects/README.projects
@@ -0,0 +1,41 @@
+This directory contains project files for building zlib under various
+Integrated Development Environments (IDE).
+
+If you wish to submit a new project to this directory, you should comply
+to the following requirements.  Otherwise (e.g. if you wish to integrate
+a custom piece of code that changes the zlib interface or its behavior),
+please consider submitting the project to the contrib directory.
+
+
+Requirements
+============
+
+- The project must build zlib using the source files from the official
+  zlib source distribution, exclusively.
+
+- If the project produces redistributable builds (e.g. shared objects
+  or DLL files), these builds must be compatible to those produced by
+  makefiles, if such makefiles exist in the zlib distribution.
+  In particular, if the project produces a DLL build for the Win32
+  platform, this build must comply to the officially-ammended Win32 DLL
+  Application Binary Interface (ABI), described in win32/DLL_FAQ.txt.
+
+- The project may provide additional build targets, which depend on
+  3rd-party (unofficially-supported) software, present in the contrib
+  directory.  For example, it is possible to provide an "ASM build",
+  besides the officially-supported build, and have ASM source files
+  among its dependencies.
+
+- If there are significant differences between the project files created
+  by different versions of an IDE (e.g. Visual C++ 6.0 vs. 7.0), the name
+  of the project directory should contain the version number of the IDE
+  for which the project is intended (e.g. "visualc6" for Visual C++ 6.0,
+  or "visualc7" for Visual C++ 7.0 and 7.1).
+
+
+Current projects
+================
+
+visualc6/   by Simon-Pierre Cadieux <methodex@methodex.ca>
+            and Cosmin Truta <cosmint@cs.ubbcluj.ro>
+        Project for Microsoft Visual C++ 6.0
diff --git a/updater/zlib123/projects/visualc6/README.txt b/updater/zlib123/projects/visualc6/README.txt
new file mode 100644
index 0000000..d0296c2
--- /dev/null
+++ b/updater/zlib123/projects/visualc6/README.txt
@@ -0,0 +1,73 @@
+Microsoft Developer Studio Project Files, Format Version 6.00 for zlib.
+
+Copyright (C) 2000-2004 Simon-Pierre Cadieux.
+Copyright (C) 2004 Cosmin Truta.
+For conditions of distribution and use, see copyright notice in zlib.h.
+
+
+This project builds the zlib binaries as follows:
+
+* Win32_DLL_Release\zlib1.dll       DLL build
+* Win32_DLL_Debug\zlib1d.dll        DLL build (debug version)
+* Win32_DLL_ASM_Release\zlib1.dll   DLL build using ASM code
+* Win32_DLL_ASM_Debug\zlib1d.dll    DLL build using ASM code (debug version)
+* Win32_LIB_Release\zlib.lib        static build
+* Win32_LIB_Debug\zlibd.lib         static build (debug version)
+* Win32_LIB_ASM_Release\zlib.lib    static build using ASM code
+* Win32_LIB_ASM_Debug\zlibd.lib     static build using ASM code (debug version)
+
+
+For more information regarding the DLL builds, please see the DLL FAQ
+in ..\..\win32\DLL_FAQ.txt.
+
+
+To build and test:
+
+1) On the main menu, select "File | Open Workspace".
+   Open "zlib.dsw".
+
+2) Select "Build | Set Active Configuration".
+   Choose the configuration you wish to build.
+
+3) Select "Build | Clean".
+
+4) Select "Build | Build ... (F7)".  Ignore warning messages about
+   not being able to find certain include files (e.g. alloc.h).
+
+5) If you built one of the sample programs (example or minigzip),
+   select "Build | Execute ... (Ctrl+F5)".
+
+
+To use:
+
+1) Select "Project | Settings (Alt+F7)".
+   Make note of the configuration names used in your project.
+   Usually, these names are "Win32 Release" and "Win32 Debug".
+
+2) In the Workspace window, select the "FileView" tab.
+   Right-click on the root item "Workspace '...'".
+   Select "Insert Project into Workspace".
+   Switch on the checkbox "Dependency of:", and select the name
+   of your project.  Open "zlib.dsp".
+
+3) Select "Build | Configurations".
+   For each configuration of your project:
+   3.1) Choose the zlib configuration you wish to use.
+   3.2) Click on "Add".
+   3.3) Set the new zlib configuration name to the name used by
+        the configuration from the current iteration.
+
+4) Select "Build | Set Active Configuration".
+   Choose the configuration you wish to build.
+
+5) Select "Build | Build ... (F7)".
+
+6) If you built an executable program, select
+   "Build | Execute ... (Ctrl+F5)".
+
+
+Note:
+
+To build the ASM-enabled code, you need Microsoft Assembler
+(ML.EXE).  You can get it by downloading and installing the
+latest Processor Pack for Visual C++ 6.0.
diff --git a/updater/zlib123/projects/visualc6/example.dsp b/updater/zlib123/projects/visualc6/example.dsp
new file mode 100644
index 0000000..e072a37
--- /dev/null
+++ b/updater/zlib123/projects/visualc6/example.dsp
@@ -0,0 +1,278 @@
+# Microsoft Developer Studio Project File - Name="example" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=example - Win32 LIB Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "example.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "example.mak" CFG="example - Win32 LIB Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "example - Win32 DLL Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "example - Win32 DLL Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE "example - Win32 DLL ASM Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "example - Win32 DLL ASM Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE "example - Win32 LIB Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "example - Win32 LIB Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE "example - Win32 LIB ASM Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "example - Win32 LIB ASM Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "example - Win32 DLL Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "example___Win32_DLL_Release"
+# PROP BASE Intermediate_Dir "example___Win32_DLL_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_DLL_Release"
+# PROP Intermediate_Dir "Win32_DLL_Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 /nologo /subsystem:console /machine:I386
+
+!ELSEIF  "$(CFG)" == "example - Win32 DLL Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "example___Win32_DLL_Debug"
+# PROP BASE Intermediate_Dir "example___Win32_DLL_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_DLL_Debug"
+# PROP Intermediate_Dir "Win32_DLL_Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+
+!ELSEIF  "$(CFG)" == "example - Win32 DLL ASM Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "example___Win32_DLL_ASM_Release"
+# PROP BASE Intermediate_Dir "example___Win32_DLL_ASM_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_DLL_ASM_Release"
+# PROP Intermediate_Dir "Win32_DLL_ASM_Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 /nologo /subsystem:console /machine:I386
+
+!ELSEIF  "$(CFG)" == "example - Win32 DLL ASM Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "example___Win32_DLL_ASM_Debug"
+# PROP BASE Intermediate_Dir "example___Win32_DLL_ASM_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_DLL_ASM_Debug"
+# PROP Intermediate_Dir "Win32_DLL_ASM_Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+
+!ELSEIF  "$(CFG)" == "example - Win32 LIB Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "example___Win32_LIB_Release"
+# PROP BASE Intermediate_Dir "example___Win32_LIB_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_LIB_Release"
+# PROP Intermediate_Dir "Win32_LIB_Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 /nologo /subsystem:console /machine:I386
+
+!ELSEIF  "$(CFG)" == "example - Win32 LIB Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "example___Win32_LIB_Debug"
+# PROP BASE Intermediate_Dir "example___Win32_LIB_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_LIB_Debug"
+# PROP Intermediate_Dir "Win32_LIB_Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+
+!ELSEIF  "$(CFG)" == "example - Win32 LIB ASM Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "example___Win32_LIB_ASM_Release"
+# PROP BASE Intermediate_Dir "example___Win32_LIB_ASM_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_LIB_ASM_Release"
+# PROP Intermediate_Dir "Win32_LIB_ASM_Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 /nologo /subsystem:console /machine:I386
+
+!ELSEIF  "$(CFG)" == "example - Win32 LIB ASM Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "example___Win32_LIB_ASM_Debug"
+# PROP BASE Intermediate_Dir "example___Win32_LIB_ASM_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_LIB_ASM_Debug"
+# PROP Intermediate_Dir "Win32_LIB_ASM_Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+
+!ENDIF 
+
+# Begin Target
+
+# Name "example - Win32 DLL Release"
+# Name "example - Win32 DLL Debug"
+# Name "example - Win32 DLL ASM Release"
+# Name "example - Win32 DLL ASM Debug"
+# Name "example - Win32 LIB Release"
+# Name "example - Win32 LIB Debug"
+# Name "example - Win32 LIB ASM Release"
+# Name "example - Win32 LIB ASM Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE=..\..\example.c
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# Begin Source File
+
+SOURCE=..\..\zconf.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\zlib.h
+# End Source File
+# End Group
+# End Target
+# End Project
diff --git a/updater/zlib123/projects/visualc6/minigzip.dsp b/updater/zlib123/projects/visualc6/minigzip.dsp
new file mode 100644
index 0000000..f32024e
--- /dev/null
+++ b/updater/zlib123/projects/visualc6/minigzip.dsp
@@ -0,0 +1,278 @@
+# Microsoft Developer Studio Project File - Name="minigzip" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Console Application" 0x0103
+
+CFG=minigzip - Win32 LIB Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "minigzip.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "minigzip.mak" CFG="minigzip - Win32 LIB Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "minigzip - Win32 DLL Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "minigzip - Win32 DLL Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE "minigzip - Win32 DLL ASM Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "minigzip - Win32 DLL ASM Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE "minigzip - Win32 LIB Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "minigzip - Win32 LIB Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE "minigzip - Win32 LIB ASM Release" (based on "Win32 (x86) Console Application")
+!MESSAGE "minigzip - Win32 LIB ASM Debug" (based on "Win32 (x86) Console Application")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+CPP=cl.exe
+RSC=rc.exe
+
+!IF  "$(CFG)" == "minigzip - Win32 DLL Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "minigzip___Win32_DLL_Release"
+# PROP BASE Intermediate_Dir "minigzip___Win32_DLL_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_DLL_Release"
+# PROP Intermediate_Dir "Win32_DLL_Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 /nologo /subsystem:console /machine:I386
+
+!ELSEIF  "$(CFG)" == "minigzip - Win32 DLL Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "minigzip___Win32_DLL_Debug"
+# PROP BASE Intermediate_Dir "minigzip___Win32_DLL_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_DLL_Debug"
+# PROP Intermediate_Dir "Win32_DLL_Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+
+!ELSEIF  "$(CFG)" == "minigzip - Win32 DLL ASM Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "minigzip___Win32_DLL_ASM_Release"
+# PROP BASE Intermediate_Dir "minigzip___Win32_DLL_ASM_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_DLL_ASM_Release"
+# PROP Intermediate_Dir "Win32_DLL_ASM_Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 /nologo /subsystem:console /machine:I386
+
+!ELSEIF  "$(CFG)" == "minigzip - Win32 DLL ASM Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "minigzip___Win32_DLL_ASM_Debug"
+# PROP BASE Intermediate_Dir "minigzip___Win32_DLL_ASM_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_DLL_ASM_Debug"
+# PROP Intermediate_Dir "Win32_DLL_ASM_Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+
+!ELSEIF  "$(CFG)" == "minigzip - Win32 LIB Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "minigzip___Win32_LIB_Release"
+# PROP BASE Intermediate_Dir "minigzip___Win32_LIB_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_LIB_Release"
+# PROP Intermediate_Dir "Win32_LIB_Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 /nologo /subsystem:console /machine:I386
+
+!ELSEIF  "$(CFG)" == "minigzip - Win32 LIB Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "minigzip___Win32_LIB_Debug"
+# PROP BASE Intermediate_Dir "minigzip___Win32_LIB_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_LIB_Debug"
+# PROP Intermediate_Dir "Win32_LIB_Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+
+!ELSEIF  "$(CFG)" == "minigzip - Win32 LIB ASM Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "minigzip___Win32_LIB_ASM_Release"
+# PROP BASE Intermediate_Dir "minigzip___Win32_LIB_ASM_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_LIB_ASM_Release"
+# PROP Intermediate_Dir "Win32_LIB_ASM_Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /machine:I386
+# ADD LINK32 /nologo /subsystem:console /machine:I386
+
+!ELSEIF  "$(CFG)" == "minigzip - Win32 LIB ASM Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "minigzip___Win32_LIB_ASM_Debug"
+# PROP BASE Intermediate_Dir "minigzip___Win32_LIB_ASM_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_LIB_ASM_Debug"
+# PROP Intermediate_Dir "Win32_LIB_ASM_Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT CPP /YX
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 /nologo /subsystem:console /debug /machine:I386 /pdbtype:sept
+
+!ENDIF 
+
+# Begin Target
+
+# Name "minigzip - Win32 DLL Release"
+# Name "minigzip - Win32 DLL Debug"
+# Name "minigzip - Win32 DLL ASM Release"
+# Name "minigzip - Win32 DLL ASM Debug"
+# Name "minigzip - Win32 LIB Release"
+# Name "minigzip - Win32 LIB Debug"
+# Name "minigzip - Win32 LIB ASM Release"
+# Name "minigzip - Win32 LIB ASM Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE=..\..\minigzip.c
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# Begin Source File
+
+SOURCE=..\..\zconf.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\zlib.h
+# End Source File
+# End Group
+# End Target
+# End Project
diff --git a/updater/zlib123/projects/visualc6/zlib.dsp b/updater/zlib123/projects/visualc6/zlib.dsp
new file mode 100644
index 0000000..0fe0604
--- /dev/null
+++ b/updater/zlib123/projects/visualc6/zlib.dsp
@@ -0,0 +1,609 @@
+# Microsoft Developer Studio Project File - Name="zlib" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 6.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
+# TARGTYPE "Win32 (x86) Static Library" 0x0104
+
+CFG=zlib - Win32 LIB Debug
+!MESSAGE This is not a valid makefile. To build this project using NMAKE,
+!MESSAGE use the Export Makefile command and run
+!MESSAGE 
+!MESSAGE NMAKE /f "zlib.mak".
+!MESSAGE 
+!MESSAGE You can specify a configuration when running NMAKE
+!MESSAGE by defining the macro CFG on the command line. For example:
+!MESSAGE 
+!MESSAGE NMAKE /f "zlib.mak" CFG="zlib - Win32 LIB Debug"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "zlib - Win32 DLL Release" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "zlib - Win32 DLL Debug" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "zlib - Win32 DLL ASM Release" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "zlib - Win32 DLL ASM Debug" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "zlib - Win32 LIB Release" (based on "Win32 (x86) Static Library")
+!MESSAGE "zlib - Win32 LIB Debug" (based on "Win32 (x86) Static Library")
+!MESSAGE "zlib - Win32 LIB ASM Release" (based on "Win32 (x86) Static Library")
+!MESSAGE "zlib - Win32 LIB ASM Debug" (based on "Win32 (x86) Static Library")
+!MESSAGE 
+
+# Begin Project
+# PROP AllowPerConfigDependencies 0
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+
+!IF  "$(CFG)" == "zlib - Win32 DLL Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "zlib___Win32_DLL_Release"
+# PROP BASE Intermediate_Dir "zlib___Win32_DLL_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_DLL_Release"
+# PROP Intermediate_Dir "Win32_DLL_Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX /Yc /Yu
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT CPP /YX /Yc /Yu
+MTL=midl.exe
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+RSC=rc.exe
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386
+# ADD LINK32 /nologo /dll /machine:I386 /out:"Win32_DLL_Release\zlib1.dll"
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "zlib___Win32_DLL_Debug"
+# PROP BASE Intermediate_Dir "zlib___Win32_DLL_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_DLL_Debug"
+# PROP Intermediate_Dir "Win32_DLL_Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX /Yc /Yu
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT CPP /YX /Yc /Yu
+MTL=midl.exe
+# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+RSC=rc.exe
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 /nologo /dll /debug /machine:I386 /out:"Win32_DLL_Debug\zlib1d.dll" /pdbtype:sept
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL ASM Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "zlib___Win32_DLL_ASM_Release"
+# PROP BASE Intermediate_Dir "zlib___Win32_DLL_ASM_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_DLL_ASM_Release"
+# PROP Intermediate_Dir "Win32_DLL_ASM_Release"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX /Yc /Yu
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /D "ASMV" /D "ASMINF" /FD /c
+# SUBTRACT CPP /YX /Yc /Yu
+MTL=midl.exe
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+RSC=rc.exe
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /machine:I386
+# ADD LINK32 /nologo /dll /machine:I386 /out:"Win32_DLL_ASM_Release\zlib1.dll"
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL ASM Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "zlib___Win32_DLL_ASM_Debug"
+# PROP BASE Intermediate_Dir "zlib___Win32_DLL_ASM_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_DLL_ASM_Debug"
+# PROP Intermediate_Dir "Win32_DLL_ASM_Debug"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX /Yc /Yu
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /D "ASMV" /D "ASMINF" /FD /GZ /c
+# SUBTRACT CPP /YX /Yc /Yu
+MTL=midl.exe
+# ADD BASE MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+RSC=rc.exe
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib odbc32.lib odbccp32.lib /nologo /dll /debug /machine:I386 /pdbtype:sept
+# ADD LINK32 /nologo /dll /debug /machine:I386 /out:"Win32_DLL_ASM_Debug\zlib1d.dll" /pdbtype:sept
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "zlib___Win32_LIB_Release"
+# PROP BASE Intermediate_Dir "zlib___Win32_LIB_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_LIB_Release"
+# PROP Intermediate_Dir "Win32_LIB_Release"
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX /Yc /Yu
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT CPP /YX /Yc /Yu
+RSC=rc.exe
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "zlib___Win32_LIB_Debug"
+# PROP BASE Intermediate_Dir "zlib___Win32_LIB_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_LIB_Debug"
+# PROP Intermediate_Dir "Win32_LIB_Debug"
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX /Yc /Yu
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT CPP /YX /Yc /Yu
+RSC=rc.exe
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo /out:"Win32_LIB_Debug\zlibd.lib"
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB ASM Release"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "zlib___Win32_LIB_ASM_Release"
+# PROP BASE Intermediate_Dir "zlib___Win32_LIB_ASM_Release"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "Win32_LIB_ASM_Release"
+# PROP Intermediate_Dir "Win32_LIB_ASM_Release"
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /FD /c
+# SUBTRACT BASE CPP /YX /Yc /Yu
+# ADD CPP /nologo /MD /W3 /O2 /D "WIN32" /D "NDEBUG" /D "ASMV" /D "ASMINF" /FD /c
+# SUBTRACT CPP /YX /Yc /Yu
+RSC=rc.exe
+# ADD BASE RSC /l 0x409 /d "NDEBUG"
+# ADD RSC /l 0x409 /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB ASM Debug"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 1
+# PROP BASE Output_Dir "zlib___Win32_LIB_ASM_Debug"
+# PROP BASE Intermediate_Dir "zlib___Win32_LIB_ASM_Debug"
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 1
+# PROP Output_Dir "Win32_LIB_ASM_Debug"
+# PROP Intermediate_Dir "Win32_LIB_ASM_Debug"
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /FD /GZ /c
+# SUBTRACT BASE CPP /YX /Yc /Yu
+# ADD CPP /nologo /MDd /W3 /Gm /ZI /Od /D "WIN32" /D "_DEBUG" /D "ASMV" /D "ASMINF" /FD /GZ /c
+# SUBTRACT CPP /YX /Yc /Yu
+RSC=rc.exe
+# ADD BASE RSC /l 0x409 /d "_DEBUG"
+# ADD RSC /l 0x409 /d "_DEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LIB32=link.exe -lib
+# ADD BASE LIB32 /nologo
+# ADD LIB32 /nologo /out:"Win32_LIB_ASM_Debug\zlibd.lib"
+
+!ENDIF 
+
+# Begin Target
+
+# Name "zlib - Win32 DLL Release"
+# Name "zlib - Win32 DLL Debug"
+# Name "zlib - Win32 DLL ASM Release"
+# Name "zlib - Win32 DLL ASM Debug"
+# Name "zlib - Win32 LIB Release"
+# Name "zlib - Win32 LIB Debug"
+# Name "zlib - Win32 LIB ASM Release"
+# Name "zlib - Win32 LIB ASM Debug"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+# Begin Source File
+
+SOURCE=..\..\adler32.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\compress.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\crc32.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\deflate.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\gzio.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\infback.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\inffast.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\inflate.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\inftrees.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\trees.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\uncompr.c
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\win32\zlib.def
+
+!IF  "$(CFG)" == "zlib - Win32 DLL Release"
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL Debug"
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL ASM Release"
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL ASM Debug"
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB Release"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB Debug"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB ASM Release"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB ASM Debug"
+
+# PROP Exclude_From_Build 1
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\zutil.c
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl"
+# Begin Source File
+
+SOURCE=..\..\crc32.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\deflate.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\inffast.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\inffixed.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\inflate.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\inftrees.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\trees.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\zconf.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\zlib.h
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\zutil.h
+# End Source File
+# End Group
+# Begin Group "Resource Files"
+
+# PROP Default_Filter "ico;cur;bmp;dlg;rc2;rct;bin;rgs;gif;jpg;jpeg;jpe"
+# Begin Source File
+
+SOURCE=..\..\win32\zlib1.rc
+# End Source File
+# End Group
+# Begin Group "Assembler Files (Unsupported)"
+
+# PROP Default_Filter "asm;obj;c;cpp;cxx;h;hpp;hxx"
+# Begin Source File
+
+SOURCE=..\..\contrib\masmx86\gvmat32.asm
+
+!IF  "$(CFG)" == "zlib - Win32 DLL Release"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL Debug"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL ASM Release"
+
+# Begin Custom Build - Assembling...
+IntDir=.\Win32_DLL_ASM_Release
+InputPath=..\..\contrib\masmx86\gvmat32.asm
+InputName=gvmat32
+
+"$(IntDir)\$(InputName).obj" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	ml.exe /nologo /c /coff /Cx /Fo"$(IntDir)\$(InputName).obj" "$(InputPath)"
+
+# End Custom Build
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL ASM Debug"
+
+# Begin Custom Build - Assembling...
+IntDir=.\Win32_DLL_ASM_Debug
+InputPath=..\..\contrib\masmx86\gvmat32.asm
+InputName=gvmat32
+
+"$(IntDir)\$(InputName).obj" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	ml.exe /nologo /c /coff /Cx /Zi /Fo"$(IntDir)\$(InputName).obj" "$(InputPath)"
+
+# End Custom Build
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB Release"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB Debug"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB ASM Release"
+
+# Begin Custom Build - Assembling...
+IntDir=.\Win32_LIB_ASM_Release
+InputPath=..\..\contrib\masmx86\gvmat32.asm
+InputName=gvmat32
+
+"$(IntDir)\$(InputName).obj" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	ml.exe /nologo /c /coff /Cx /Fo"$(IntDir)\$(InputName).obj" "$(InputPath)"
+
+# End Custom Build
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB ASM Debug"
+
+# Begin Custom Build - Assembling...
+IntDir=.\Win32_LIB_ASM_Debug
+InputPath=..\..\contrib\masmx86\gvmat32.asm
+InputName=gvmat32
+
+"$(IntDir)\$(InputName).obj" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	ml.exe /nologo /c /coff /Cx /Zi /Fo"$(IntDir)\$(InputName).obj" "$(InputPath)"
+
+# End Custom Build
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\contrib\masmx86\gvmat32c.c
+
+!IF  "$(CFG)" == "zlib - Win32 DLL Release"
+
+# PROP Exclude_From_Build 1
+# ADD CPP /I "..\.."
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL Debug"
+
+# PROP Exclude_From_Build 1
+# ADD CPP /I "..\.."
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL ASM Release"
+
+# ADD CPP /I "..\.."
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL ASM Debug"
+
+# ADD CPP /I "..\.."
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB Release"
+
+# PROP Exclude_From_Build 1
+# ADD CPP /I "..\.."
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB Debug"
+
+# PROP Exclude_From_Build 1
+# ADD CPP /I "..\.."
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB ASM Release"
+
+# ADD CPP /I "..\.."
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB ASM Debug"
+
+# ADD CPP /I "..\.."
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=..\..\contrib\masmx86\inffas32.asm
+
+!IF  "$(CFG)" == "zlib - Win32 DLL Release"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL Debug"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL ASM Release"
+
+# Begin Custom Build - Assembling...
+IntDir=.\Win32_DLL_ASM_Release
+InputPath=..\..\contrib\masmx86\inffas32.asm
+InputName=inffas32
+
+"$(IntDir)\$(InputName).obj" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	ml.exe /nologo /c /coff /Cx /Fo"$(IntDir)\$(InputName).obj" "$(InputPath)"
+
+# End Custom Build
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 DLL ASM Debug"
+
+# Begin Custom Build - Assembling...
+IntDir=.\Win32_DLL_ASM_Debug
+InputPath=..\..\contrib\masmx86\inffas32.asm
+InputName=inffas32
+
+"$(IntDir)\$(InputName).obj" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	ml.exe /nologo /c /coff /Cx /Zi /Fo"$(IntDir)\$(InputName).obj" "$(InputPath)"
+
+# End Custom Build
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB Release"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB Debug"
+
+# PROP Exclude_From_Build 1
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB ASM Release"
+
+# Begin Custom Build - Assembling...
+IntDir=.\Win32_LIB_ASM_Release
+InputPath=..\..\contrib\masmx86\inffas32.asm
+InputName=inffas32
+
+"$(IntDir)\$(InputName).obj" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	ml.exe /nologo /c /coff /Cx /Fo"$(IntDir)\$(InputName).obj" "$(InputPath)"
+
+# End Custom Build
+
+!ELSEIF  "$(CFG)" == "zlib - Win32 LIB ASM Debug"
+
+# Begin Custom Build - Assembling...
+IntDir=.\Win32_LIB_ASM_Debug
+InputPath=..\..\contrib\masmx86\inffas32.asm
+InputName=inffas32
+
+"$(IntDir)\$(InputName).obj" : $(SOURCE) "$(INTDIR)" "$(OUTDIR)"
+	ml.exe /nologo /c /coff /Cx /Zi /Fo"$(IntDir)\$(InputName).obj" "$(InputPath)"
+
+# End Custom Build
+
+!ENDIF 
+
+# End Source File
+# End Group
+# Begin Source File
+
+SOURCE=.\README.txt
+# End Source File
+# End Target
+# End Project
diff --git a/updater/zlib123/projects/visualc6/zlib.dsw b/updater/zlib123/projects/visualc6/zlib.dsw
new file mode 100644
index 0000000..3a771fc
--- /dev/null
+++ b/updater/zlib123/projects/visualc6/zlib.dsw
@@ -0,0 +1,59 @@
+Microsoft Developer Studio Workspace File, Format Version 6.00
+# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
+
+###############################################################################
+
+Project: "example"=.\example.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+    Begin Project Dependency
+    Project_Dep_Name zlib
+    End Project Dependency
+}}}
+
+###############################################################################
+
+Project: "minigzip"=.\minigzip.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+    Begin Project Dependency
+    Project_Dep_Name zlib
+    End Project Dependency
+}}}
+
+###############################################################################
+
+Project: "zlib"=.\zlib.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Global:
+
+Package=<5>
+{{{
+}}}
+
+Package=<3>
+{{{
+}}}
+
+###############################################################################
+
diff --git a/updater/zlib123/qnx/package.qpg b/updater/zlib123/qnx/package.qpg
new file mode 100644
index 0000000..ea551bf
--- /dev/null
+++ b/updater/zlib123/qnx/package.qpg
@@ -0,0 +1,141 @@
+<QPG:Generation>
+   <QPG:Options>
+      <QPG:User unattended="no" verbosity="2" listfiles="yes"/>
+      <QPG:Defaults type="qnx_package"/>
+      <QPG:Source></QPG:Source>
+      <QPG:Release number="+"/>
+      <QPG:Build></QPG:Build>
+      <QPG:FileSorting strip="yes"/>
+      <QPG:Package targets="combine"/>
+      <QPG:Repository generate="yes"/>
+      <QPG:FinalDir></QPG:FinalDir>
+      <QPG:Cleanup></QPG:Cleanup>
+   </QPG:Options>
+
+   <QPG:Responsible>
+      <QPG:Company></QPG:Company>
+      <QPG:Department></QPG:Department>
+      <QPG:Group></QPG:Group>
+      <QPG:Team></QPG:Team>
+      <QPG:Employee></QPG:Employee>
+      <QPG:EmailAddress></QPG:EmailAddress>
+   </QPG:Responsible>
+
+   <QPG:Values>
+      <QPG:Files>
+         <QPG:Add file="../zconf.h" install="/opt/include/" user="root:sys" permission="644"/>
+         <QPG:Add file="../zlib.h" install="/opt/include/" user="root:sys" permission="644"/>
+         <QPG:Add file="../libz.so.1.2.3" install="/opt/lib/" user="root:bin" permission="644"/>
+         <QPG:Add file="libz.so" install="/opt/lib/" component="dev" filetype="symlink" linkto="libz.so.1.2.3"/>
+         <QPG:Add file="libz.so.1" install="/opt/lib/" filetype="symlink" linkto="libz.so.1.2.3"/>
+         <QPG:Add file="../libz.so.1.2.3" install="/opt/lib/" component="slib"/>
+      </QPG:Files>
+
+      <QPG:PackageFilter>
+         <QPM:PackageManifest>
+            <QPM:PackageDescription>
+               <QPM:PackageType>Library</QPM:PackageType>
+               <QPM:PackageReleaseNotes></QPM:PackageReleaseNotes>
+               <QPM:PackageReleaseUrgency>Medium</QPM:PackageReleaseUrgency>
+               <QPM:PackageRepository></QPM:PackageRepository>
+               <QPM:FileVersion>2.0</QPM:FileVersion>
+            </QPM:PackageDescription>
+
+            <QPM:ProductDescription>
+               <QPM:ProductName>zlib</QPM:ProductName>
+               <QPM:ProductIdentifier>zlib</QPM:ProductIdentifier>
+               <QPM:ProductEmail>alain.bonnefoy@icbt.com</QPM:ProductEmail>
+               <QPM:VendorName>Public</QPM:VendorName>
+               <QPM:VendorInstallName>public</QPM:VendorInstallName>
+               <QPM:VendorURL>www.gzip.org/zlib</QPM:VendorURL>
+               <QPM:VendorEmbedURL></QPM:VendorEmbedURL>
+               <QPM:VendorEmail></QPM:VendorEmail>
+               <QPM:AuthorName>Jean-Loup Gailly,Mark Adler</QPM:AuthorName>
+               <QPM:AuthorURL>www.gzip.org/zlib</QPM:AuthorURL>
+               <QPM:AuthorEmbedURL></QPM:AuthorEmbedURL>
+               <QPM:AuthorEmail>zlib@gzip.org</QPM:AuthorEmail>
+               <QPM:ProductIconSmall></QPM:ProductIconSmall>
+               <QPM:ProductIconLarge></QPM:ProductIconLarge>
+               <QPM:ProductDescriptionShort>A massively spiffy yet delicately unobtrusive compression library.</QPM:ProductDescriptionShort>
+               <QPM:ProductDescriptionLong>zlib is designed to be a free, general-purpose, legally unencumbered, lossless data compression library for use on virtually any computer hardware and operating system.</QPM:ProductDescriptionLong>
+               <QPM:ProductDescriptionURL>http://www.gzip.org/zlib</QPM:ProductDescriptionURL>
+               <QPM:ProductDescriptionEmbedURL></QPM:ProductDescriptionEmbedURL>
+            </QPM:ProductDescription>
+
+            <QPM:ReleaseDescription>
+               <QPM:ReleaseVersion>1.2.3</QPM:ReleaseVersion>
+               <QPM:ReleaseUrgency>Medium</QPM:ReleaseUrgency>
+               <QPM:ReleaseStability>Stable</QPM:ReleaseStability>
+               <QPM:ReleaseNoteMinor></QPM:ReleaseNoteMinor>
+               <QPM:ReleaseNoteMajor></QPM:ReleaseNoteMajor>
+               <QPM:ExcludeCountries>
+                  <QPM:Country></QPM:Country>
+               </QPM:ExcludeCountries>
+
+               <QPM:ReleaseCopyright>No License</QPM:ReleaseCopyright>
+            </QPM:ReleaseDescription>
+
+            <QPM:ContentDescription>
+               <QPM:ContentTopic xmlmultiple="true">Software Development/Libraries and Extensions/C Libraries</QPM:ContentTopic>
+               <QPM:ContentKeyword>zlib,compression</QPM:ContentKeyword>
+               <QPM:TargetOS>qnx6</QPM:TargetOS>
+               <QPM:HostOS>qnx6</QPM:HostOS>
+               <QPM:DisplayEnvironment xmlmultiple="true">None</QPM:DisplayEnvironment>
+               <QPM:TargetAudience xmlmultiple="true">Developer</QPM:TargetAudience>
+            </QPM:ContentDescription>
+         </QPM:PackageManifest>
+      </QPG:PackageFilter>
+
+      <QPG:PackageFilter proc="none" target="none">
+         <QPM:PackageManifest>
+            <QPM:ProductInstallationDependencies>
+               <QPM:ProductRequirements></QPM:ProductRequirements>
+            </QPM:ProductInstallationDependencies>
+
+            <QPM:ProductInstallationProcedure>
+               <QPM:Script xmlmultiple="true">
+                  <QPM:ScriptName></QPM:ScriptName>
+                  <QPM:ScriptType>Install</QPM:ScriptType>
+                  <QPM:ScriptTiming>Post</QPM:ScriptTiming>
+                  <QPM:ScriptBlocking>No</QPM:ScriptBlocking>
+                  <QPM:ScriptResult>Ignore</QPM:ScriptResult>
+                  <QPM:ShortDescription></QPM:ShortDescription>
+                  <QPM:UseBinaries>No</QPM:UseBinaries>
+                  <QPM:Priority>Optional</QPM:Priority>
+               </QPM:Script>
+            </QPM:ProductInstallationProcedure>
+         </QPM:PackageManifest>
+
+         <QPM:Launch>
+         </QPM:Launch>
+      </QPG:PackageFilter>
+
+      <QPG:PackageFilter type="core" component="none">
+         <QPM:PackageManifest>
+            <QPM:ProductInstallationProcedure>
+	       <QPM:OrderDependency xmlmultiple="true">
+	          <QPM:Order>InstallOver</QPM:Order>
+	          <QPM:Product>zlib</QPM:Product>
+	       </QPM:OrderDependency>
+            </QPM:ProductInstallationProcedure>
+         </QPM:PackageManifest>
+
+         <QPM:Launch>
+         </QPM:Launch>
+      </QPG:PackageFilter>
+
+      <QPG:PackageFilter type="core" component="dev">
+         <QPM:PackageManifest>
+            <QPM:ProductInstallationProcedure>
+	       <QPM:OrderDependency xmlmultiple="true">
+	          <QPM:Order>InstallOver</QPM:Order>
+	          <QPM:Product>zlib-dev</QPM:Product>
+	       </QPM:OrderDependency>
+            </QPM:ProductInstallationProcedure>
+         </QPM:PackageManifest>
+
+         <QPM:Launch>
+         </QPM:Launch>
+      </QPG:PackageFilter>
+   </QPG:Values>
+</QPG:Generation>
diff --git a/updater/zlib123/trees.c b/updater/zlib123/trees.c
new file mode 100644
index 0000000..c519db8
--- /dev/null
+++ b/updater/zlib123/trees.c
@@ -0,0 +1,1195 @@
+/* trees.c -- output deflated data using Huffman coding
+ * Copyright (C) 1995-2005 Jean-loup Gailly
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/*
+ *  ALGORITHM
+ *
+ *      The "deflation" process uses several Huffman trees. The more
+ *      common source values are represented by shorter bit sequences.
+ *
+ *      Each code tree is stored in a compressed form which is itself
+ * a Huffman encoding of the lengths of all the code strings (in
+ * ascending order by source values).  The actual code strings are
+ * reconstructed from the lengths in the inflate process, as described
+ * in the deflate specification.
+ *
+ *  REFERENCES
+ *
+ *      Deutsch, L.P.,"'Deflate' Compressed Data Format Specification".
+ *      Available in ftp.uu.net:/pub/archiving/zip/doc/deflate-1.1.doc
+ *
+ *      Storer, James A.
+ *          Data Compression:  Methods and Theory, pp. 49-50.
+ *          Computer Science Press, 1988.  ISBN 0-7167-8156-5.
+ *
+ *      Sedgewick, R.
+ *          Algorithms, p290.
+ *          Addison-Wesley, 1983. ISBN 0-201-06672-6.
+ */
+
+/* @(#) $Id$ */
+
+/* #define GEN_TREES_H */
+
+#include "deflate.h"
+
+#ifdef DEBUG
+#  include <ctype.h>
+#endif
+
+/* ===========================================================================
+ * Constants
+ */
+
+#define MAX_BL_BITS 7
+/* Bit length codes must not exceed MAX_BL_BITS bits */
+
+#define END_BLOCK 256
+/* end of block literal code */
+
+#define REP_3_6      16
+/* repeat previous bit length 3-6 times (2 bits of repeat count) */
+
+#define REPZ_3_10    17
+/* repeat a zero length 3-10 times  (3 bits of repeat count) */
+
+#define REPZ_11_138  18
+/* repeat a zero length 11-138 times  (7 bits of repeat count) */
+
+local const int extra_lbits[LENGTH_CODES] /* extra bits for each length code */
+   = {0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0};
+
+local const int extra_dbits[D_CODES] /* extra bits for each distance code */
+   = {0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13};
+
+local const int extra_blbits[BL_CODES]/* extra bits for each bit length code */
+   = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7};
+
+local const uch bl_order[BL_CODES]
+   = {16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15};
+/* The lengths of the bit length codes are sent in order of decreasing
+ * probability, to avoid transmitting the lengths for unused bit length codes.
+ */
+
+#define Buf_size (8 * 2*sizeof(char))
+/* Number of bits used within bi_buf. (bi_buf might be implemented on
+ * more than 16 bits on some systems.)
+ */
+
+/* ===========================================================================
+ * Local data. These are initialized only once.
+ */
+
+#define DIST_CODE_LEN  512 /* see definition of array dist_code below */
+
+#if defined(GEN_TREES_H) || !defined(STDC)
+/* non ANSI compilers may not accept trees.h */
+
+local ct_data static_ltree[L_CODES+2];
+/* The static literal tree. Since the bit lengths are imposed, there is no
+ * need for the L_CODES extra codes used during heap construction. However
+ * The codes 286 and 287 are needed to build a canonical tree (see _tr_init
+ * below).
+ */
+
+local ct_data static_dtree[D_CODES];
+/* The static distance tree. (Actually a trivial tree since all codes use
+ * 5 bits.)
+ */
+
+uch _dist_code[DIST_CODE_LEN];
+/* Distance codes. The first 256 values correspond to the distances
+ * 3 .. 258, the last 256 values correspond to the top 8 bits of
+ * the 15 bit distances.
+ */
+
+uch _length_code[MAX_MATCH-MIN_MATCH+1];
+/* length code for each normalized match length (0 == MIN_MATCH) */
+
+local int base_length[LENGTH_CODES];
+/* First normalized length for each code (0 = MIN_MATCH) */
+
+local int base_dist[D_CODES];
+/* First normalized distance for each code (0 = distance of 1) */
+
+#else
+#  include "trees.h"
+#endif /* GEN_TREES_H */
+
+struct static_tree_desc_s {
+    const ct_data *static_tree;  /* static tree or NULL */
+    const intf *extra_bits;      /* extra bits for each code or NULL */
+    int     extra_base;          /* base index for extra_bits */
+    int     elems;               /* max number of elements in the tree */
+    int     max_length;          /* max bit length for the codes */
+};
+
+local static_tree_desc  static_l_desc =
+{static_ltree, extra_lbits, LITERALS+1, L_CODES, MAX_BITS};
+
+local static_tree_desc  static_d_desc =
+{static_dtree, extra_dbits, 0,          D_CODES, MAX_BITS};
+
+local static_tree_desc  static_bl_desc =
+{(const ct_data *)0, extra_blbits, 0,   BL_CODES, MAX_BL_BITS};
+
+/* ===========================================================================
+ * Local (static) routines in this file.
+ */
+
+local void tr_static_init OF((void));
+local void init_block     OF((deflate_state *s));
+local void pqdownheap     OF((deflate_state *s, ct_data *tree, int k));
+local void gen_bitlen     OF((deflate_state *s, tree_desc *desc));
+local void gen_codes      OF((ct_data *tree, int max_code, ushf *bl_count));
+local void build_tree     OF((deflate_state *s, tree_desc *desc));
+local void scan_tree      OF((deflate_state *s, ct_data *tree, int max_code));
+local void send_tree      OF((deflate_state *s, ct_data *tree, int max_code));
+local int  build_bl_tree  OF((deflate_state *s));
+local void send_all_trees OF((deflate_state *s, int lcodes, int dcodes,
+                              int blcodes));
+local void compress_block OF((deflate_state *s, ct_data *ltree,
+                              ct_data *dtree));
+local void set_data_type  OF((deflate_state *s));
+local unsigned bi_reverse OF((unsigned value, int length));
+local void bi_windup      OF((deflate_state *s));
+local void bi_flush       OF((deflate_state *s));
+local void copy_block     OF((deflate_state *s, charf *buf, unsigned len,
+                              int header));
+
+#ifdef GEN_TREES_H
+local void gen_trees_header OF((void));
+#endif
+
+#ifndef DEBUG
+#  define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len)
+   /* Send a code of the given tree. c and tree must not have side effects */
+
+#else /* DEBUG */
+#  define send_code(s, c, tree) \
+     { if (z_verbose>2) fprintf(stderr,"\ncd %3d ",(c)); \
+       send_bits(s, tree[c].Code, tree[c].Len); }
+#endif
+
+/* ===========================================================================
+ * Output a short LSB first on the stream.
+ * IN assertion: there is enough room in pendingBuf.
+ */
+#define put_short(s, w) { \
+    put_byte(s, (uch)((w) & 0xff)); \
+    put_byte(s, (uch)((ush)(w) >> 8)); \
+}
+
+/* ===========================================================================
+ * Send a value on a given number of bits.
+ * IN assertion: length <= 16 and value fits in length bits.
+ */
+#ifdef DEBUG
+local void send_bits      OF((deflate_state *s, int value, int length));
+
+local void send_bits(s, value, length)
+    deflate_state *s;
+    int value;  /* value to send */
+    int length; /* number of bits */
+{
+    Tracevv((stderr," l %2d v %4x ", length, value));
+    Assert(length > 0 && length <= 15, "invalid length");
+    s->bits_sent += (ulg)length;
+
+    /* If not enough room in bi_buf, use (valid) bits from bi_buf and
+     * (16 - bi_valid) bits from value, leaving (width - (16-bi_valid))
+     * unused bits in value.
+     */
+    if (s->bi_valid > (int)Buf_size - length) {
+        s->bi_buf |= (value << s->bi_valid);
+        put_short(s, s->bi_buf);
+        s->bi_buf = (ush)value >> (Buf_size - s->bi_valid);
+        s->bi_valid += length - Buf_size;
+    } else {
+        s->bi_buf |= value << s->bi_valid;
+        s->bi_valid += length;
+    }
+}
+#else /* !DEBUG */
+
+#define send_bits(s, value, length) \
+{ int len = length;\
+  if (s->bi_valid > (int)Buf_size - len) {\
+    int val = value;\
+    s->bi_buf |= (val << s->bi_valid);\
+    put_short(s, s->bi_buf);\
+    s->bi_buf = (ush)val >> (Buf_size - s->bi_valid);\
+    s->bi_valid += len - Buf_size;\
+  } else {\
+    s->bi_buf |= (value) << s->bi_valid;\
+    s->bi_valid += len;\
+  }\
+}
+#endif /* DEBUG */
+
+
+/* the arguments must not have side effects */
+
+/* ===========================================================================
+ * Initialize the various 'constant' tables.
+ */
+local void tr_static_init()
+{
+#if defined(GEN_TREES_H) || !defined(STDC)
+    static int static_init_done = 0;
+    int n;        /* iterates over tree elements */
+    int bits;     /* bit counter */
+    int length;   /* length value */
+    int code;     /* code value */
+    int dist;     /* distance index */
+    ush bl_count[MAX_BITS+1];
+    /* number of codes at each bit length for an optimal tree */
+
+    if (static_init_done) return;
+
+    /* For some embedded targets, global variables are not initialized: */
+    static_l_desc.static_tree = static_ltree;
+    static_l_desc.extra_bits = extra_lbits;
+    static_d_desc.static_tree = static_dtree;
+    static_d_desc.extra_bits = extra_dbits;
+    static_bl_desc.extra_bits = extra_blbits;
+
+    /* Initialize the mapping length (0..255) -> length code (0..28) */
+    length = 0;
+    for (code = 0; code < LENGTH_CODES-1; code++) {
+        base_length[code] = length;
+        for (n = 0; n < (1<<extra_lbits[code]); n++) {
+            _length_code[length++] = (uch)code;
+        }
+    }
+    Assert (length == 256, "tr_static_init: length != 256");
+    /* Note that the length 255 (match length 258) can be represented
+     * in two different ways: code 284 + 5 bits or code 285, so we
+     * overwrite length_code[255] to use the best encoding:
+     */
+    _length_code[length-1] = (uch)code;
+
+    /* Initialize the mapping dist (0..32K) -> dist code (0..29) */
+    dist = 0;
+    for (code = 0 ; code < 16; code++) {
+        base_dist[code] = dist;
+        for (n = 0; n < (1<<extra_dbits[code]); n++) {
+            _dist_code[dist++] = (uch)code;
+        }
+    }
+    Assert (dist == 256, "tr_static_init: dist != 256");
+    dist >>= 7; /* from now on, all distances are divided by 128 */
+    for ( ; code < D_CODES; code++) {
+        base_dist[code] = dist << 7;
+        for (n = 0; n < (1<<(extra_dbits[code]-7)); n++) {
+            _dist_code[256 + dist++] = (uch)code;
+        }
+    }
+    Assert (dist == 256, "tr_static_init: 256+dist != 512");
+
+    /* Construct the codes of the static literal tree */
+    for (bits = 0; bits <= MAX_BITS; bits++) bl_count[bits] = 0;
+    n = 0;
+    while (n <= 143) static_ltree[n++].Len = 8, bl_count[8]++;
+    while (n <= 255) static_ltree[n++].Len = 9, bl_count[9]++;
+    while (n <= 279) static_ltree[n++].Len = 7, bl_count[7]++;
+    while (n <= 287) static_ltree[n++].Len = 8, bl_count[8]++;
+    /* Codes 286 and 287 do not exist, but we must include them in the
+     * tree construction to get a canonical Huffman tree (longest code
+     * all ones)
+     */
+    gen_codes((ct_data *)static_ltree, L_CODES+1, bl_count);
+
+    /* The static distance tree is trivial: */
+    for (n = 0; n < D_CODES; n++) {
+        static_dtree[n].Len = 5;
+        static_dtree[n].Code = bi_reverse((unsigned)n, 5);
+    }
+    static_init_done = 1;
+
+#  ifdef GEN_TREES_H
+    gen_trees_header();
+#  endif
+#endif /* defined(GEN_TREES_H) || !defined(STDC) */
+}
+
+/* ===========================================================================
+ * Genererate the file trees.h describing the static trees.
+ */
+#ifdef GEN_TREES_H
+#  ifndef DEBUG
+#    include <stdio.h>
+#  endif
+
+#  define SEPARATOR(i, last, width) \
+      ((i) == (last)? "\n};\n\n" :    \
+       ((i) % (width) == (width)-1 ? ",\n" : ", "))
+
+void gen_trees_header()
+{
+    FILE *header = fopen("trees.h", "w");
+    int i;
+
+    Assert (header != NULL, "Can't open trees.h");
+    fprintf(header,
+            "/* header created automatically with -DGEN_TREES_H */\n\n");
+
+    fprintf(header, "local const ct_data static_ltree[L_CODES+2] = {\n");
+    for (i = 0; i < L_CODES+2; i++) {
+        fprintf(header, "{{%3u},{%3u}}%s", static_ltree[i].Code,
+                static_ltree[i].Len, SEPARATOR(i, L_CODES+1, 5));
+    }
+
+    fprintf(header, "local const ct_data static_dtree[D_CODES] = {\n");
+    for (i = 0; i < D_CODES; i++) {
+        fprintf(header, "{{%2u},{%2u}}%s", static_dtree[i].Code,
+                static_dtree[i].Len, SEPARATOR(i, D_CODES-1, 5));
+    }
+
+    fprintf(header, "const uch _dist_code[DIST_CODE_LEN] = {\n");
+    for (i = 0; i < DIST_CODE_LEN; i++) {
+        fprintf(header, "%2u%s", _dist_code[i],
+                SEPARATOR(i, DIST_CODE_LEN-1, 20));
+    }
+
+    fprintf(header, "const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {\n");
+    for (i = 0; i < MAX_MATCH-MIN_MATCH+1; i++) {
+        fprintf(header, "%2u%s", _length_code[i],
+                SEPARATOR(i, MAX_MATCH-MIN_MATCH, 20));
+    }
+
+    fprintf(header, "local const int base_length[LENGTH_CODES] = {\n");
+    for (i = 0; i < LENGTH_CODES; i++) {
+        fprintf(header, "%1u%s", base_length[i],
+                SEPARATOR(i, LENGTH_CODES-1, 20));
+    }
+
+    fprintf(header, "local const int base_dist[D_CODES] = {\n");
+    for (i = 0; i < D_CODES; i++) {
+        fprintf(header, "%5u%s", base_dist[i],
+                SEPARATOR(i, D_CODES-1, 10));
+    }
+
+    fclose(header);
+}
+#endif /* GEN_TREES_H */
+
+/* ===========================================================================
+ * Initialize the tree data structures for a new zlib stream.
+ */
+void _tr_init(deflate_state *s)
+{
+    tr_static_init();
+
+    s->l_desc.dyn_tree = s->dyn_ltree;
+    s->l_desc.stat_desc = &static_l_desc;
+
+    s->d_desc.dyn_tree = s->dyn_dtree;
+    s->d_desc.stat_desc = &static_d_desc;
+
+    s->bl_desc.dyn_tree = s->bl_tree;
+    s->bl_desc.stat_desc = &static_bl_desc;
+
+    s->bi_buf = 0;
+    s->bi_valid = 0;
+    s->last_eob_len = 8; /* enough lookahead for inflate */
+#ifdef DEBUG
+    s->compressed_len = 0L;
+    s->bits_sent = 0L;
+#endif
+
+    /* Initialize the first block of the first file: */
+    init_block(s);
+}
+
+/* ===========================================================================
+ * Initialize a new block.
+ */
+local void init_block(deflate_state *s)
+{
+    int n; /* iterates over tree elements */
+
+    /* Initialize the trees. */
+    for (n = 0; n < L_CODES;  n++) s->dyn_ltree[n].Freq = 0;
+    for (n = 0; n < D_CODES;  n++) s->dyn_dtree[n].Freq = 0;
+    for (n = 0; n < BL_CODES; n++) s->bl_tree[n].Freq = 0;
+
+    s->dyn_ltree[END_BLOCK].Freq = 1;
+    s->opt_len = s->static_len = 0L;
+    s->last_lit = s->matches = 0;
+}
+
+#define SMALLEST 1
+/* Index within the heap array of least frequent node in the Huffman tree */
+
+
+/* ===========================================================================
+ * Remove the smallest element from the heap and recreate the heap with
+ * one less element. Updates heap and heap_len.
+ */
+#define pqremove(s, tree, top) \
+{\
+    top = s->heap[SMALLEST]; \
+    s->heap[SMALLEST] = s->heap[s->heap_len--]; \
+    pqdownheap(s, tree, SMALLEST); \
+}
+
+/* ===========================================================================
+ * Compares to subtrees, using the tree depth as tie breaker when
+ * the subtrees have equal frequency. This minimizes the worst case length.
+ */
+#define smaller(tree, n, m, depth) \
+   (tree[n].Freq < tree[m].Freq || \
+   (tree[n].Freq == tree[m].Freq && depth[n] <= depth[m]))
+
+/* ===========================================================================
+ * Restore the heap property by moving down the tree starting at node k,
+ * exchanging a node with the smallest of its two sons if necessary, stopping
+ * when the heap property is re-established (each father smaller than its
+ * two sons).
+ */
+local void pqdownheap(deflate_state *s, ct_data *tree, int k)               /* node to move down */
+{
+    int v = s->heap[k];
+    int j = k << 1;  /* left son of k */
+    while (j <= s->heap_len) {
+        /* Set j to the smallest of the two sons: */
+        if (j < s->heap_len &&
+            smaller(tree, s->heap[j+1], s->heap[j], s->depth)) {
+            j++;
+        }
+        /* Exit if v is smaller than both sons */
+        if (smaller(tree, v, s->heap[j], s->depth)) break;
+
+        /* Exchange v with the smallest son */
+        s->heap[k] = s->heap[j];  k = j;
+
+        /* And continue down the tree, setting j to the left son of k */
+        j <<= 1;
+    }
+    s->heap[k] = v;
+}
+
+/* ===========================================================================
+ * Compute the optimal bit lengths for a tree and update the total bit length
+ * for the current block.
+ * IN assertion: the fields freq and dad are set, heap[heap_max] and
+ *    above are the tree nodes sorted by increasing frequency.
+ * OUT assertions: the field len is set to the optimal bit length, the
+ *     array bl_count contains the frequencies for each bit length.
+ *     The length opt_len is updated; static_len is also updated if stree is
+ *     not null.
+ */
+local void gen_bitlen(deflate_state *s, tree_desc *desc)    /* the tree descriptor */
+{
+    ct_data *tree        = desc->dyn_tree;
+    int max_code         = desc->max_code;
+    const ct_data *stree = desc->stat_desc->static_tree;
+    const intf *extra    = desc->stat_desc->extra_bits;
+    int base             = desc->stat_desc->extra_base;
+    int max_length       = desc->stat_desc->max_length;
+    int h;              /* heap index */
+    int n, m;           /* iterate over the tree elements */
+    int bits;           /* bit length */
+    int xbits;          /* extra bits */
+    ush f;              /* frequency */
+    int overflow = 0;   /* number of elements with bit length too large */
+
+    for (bits = 0; bits <= MAX_BITS; bits++) s->bl_count[bits] = 0;
+
+    /* In a first pass, compute the optimal bit lengths (which may
+     * overflow in the case of the bit length tree).
+     */
+    tree[s->heap[s->heap_max]].Len = 0; /* root of the heap */
+
+    for (h = s->heap_max+1; h < HEAP_SIZE; h++) {
+        n = s->heap[h];
+        bits = tree[tree[n].Dad].Len + 1;
+        if (bits > max_length) bits = max_length, overflow++;
+        tree[n].Len = (ush)bits;
+        /* We overwrite tree[n].Dad which is no longer needed */
+
+        if (n > max_code) continue; /* not a leaf node */
+
+        s->bl_count[bits]++;
+        xbits = 0;
+        if (n >= base) xbits = extra[n-base];
+        f = tree[n].Freq;
+        s->opt_len += (ulg)f * (bits + xbits);
+        if (stree) s->static_len += (ulg)f * (stree[n].Len + xbits);
+    }
+    if (overflow == 0) return;
+
+    Trace((stderr,"\nbit length overflow\n"));
+    /* This happens for example on obj2 and pic of the Calgary corpus */
+
+    /* Find the first bit length which could increase: */
+    do {
+        bits = max_length-1;
+        while (s->bl_count[bits] == 0) bits--;
+        s->bl_count[bits]--;      /* move one leaf down the tree */
+        s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
+        s->bl_count[max_length]--;
+        /* The brother of the overflow item also moves one step up,
+         * but this does not affect bl_count[max_length]
+         */
+        overflow -= 2;
+    } while (overflow > 0);
+
+    /* Now recompute all bit lengths, scanning in increasing frequency.
+     * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all
+     * lengths instead of fixing only the wrong ones. This idea is taken
+     * from 'ar' written by Haruhiko Okumura.)
+     */
+    for (bits = max_length; bits != 0; bits--) {
+        n = s->bl_count[bits];
+        while (n != 0) {
+            m = s->heap[--h];
+            if (m > max_code) continue;
+            if ((unsigned) tree[m].Len != (unsigned) bits) {
+                Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits));
+                s->opt_len += ((long)bits - (long)tree[m].Len)
+                              *(long)tree[m].Freq;
+                tree[m].Len = (ush)bits;
+            }
+            n--;
+        }
+    }
+}
+
+/* ===========================================================================
+ * Generate the codes for a given tree and bit counts (which need not be
+ * optimal).
+ * IN assertion: the array bl_count contains the bit length statistics for
+ * the given tree and the field len is set for all tree elements.
+ * OUT assertion: the field code is set for all tree elements of non
+ *     zero code length.
+ */
+local void gen_codes (ct_data *tree,             /* the tree to decorate */
+    int max_code,              /* largest code with non zero frequency */
+    ushf *bl_count)            /* number of codes at each bit length */
+{
+    ush next_code[MAX_BITS+1]; /* next code value for each bit length */
+    ush code = 0;              /* running code value */
+    int bits;                  /* bit index */
+    int n;                     /* code index */
+
+    /* The distribution counts are first used to generate the code values
+     * without bit reversal.
+     */
+    for (bits = 1; bits <= MAX_BITS; bits++) {
+        next_code[bits] = code = (code + bl_count[bits-1]) << 1;
+    }
+    /* Check that the bit counts in bl_count are consistent. The last code
+     * must be all ones.
+     */
+    Assert (code + bl_count[MAX_BITS]-1 == (1<<MAX_BITS)-1,
+            "inconsistent bit counts");
+    Tracev((stderr,"\ngen_codes: max_code %d ", max_code));
+
+    for (n = 0;  n <= max_code; n++) {
+        int len = tree[n].Len;
+        if (len == 0) continue;
+        /* Now reverse the bits */
+        tree[n].Code = bi_reverse(next_code[len]++, len);
+
+        Tracecv(tree != static_ltree, (stderr,"\nn %3d %c l %2d c %4x (%x) ",
+             n, (isgraph(n) ? n : ' '), len, tree[n].Code, next_code[len]-1));
+    }
+}
+
+/* ===========================================================================
+ * Construct one Huffman tree and assigns the code bit strings and lengths.
+ * Update the total bit length for the current block.
+ * IN assertion: the field freq is set for all tree elements.
+ * OUT assertions: the fields len and code are set to the optimal bit length
+ *     and corresponding code. The length opt_len is updated; static_len is
+ *     also updated if stree is not null. The field max_code is set.
+ */
+local void build_tree(deflate_state *s, tree_desc *desc) /* the tree descriptor */
+{
+    ct_data *tree         = desc->dyn_tree;
+    const ct_data *stree  = desc->stat_desc->static_tree;
+    int elems             = desc->stat_desc->elems;
+    int n, m;          /* iterate over heap elements */
+    int max_code = -1; /* largest code with non zero frequency */
+    int node;          /* new node being created */
+
+    /* Construct the initial heap, with least frequent element in
+     * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1].
+     * heap[0] is not used.
+     */
+    s->heap_len = 0, s->heap_max = HEAP_SIZE;
+
+    for (n = 0; n < elems; n++) {
+        if (tree[n].Freq != 0) {
+            s->heap[++(s->heap_len)] = max_code = n;
+            s->depth[n] = 0;
+        } else {
+            tree[n].Len = 0;
+        }
+    }
+
+    /* The pkzip format requires that at least one distance code exists,
+     * and that at least one bit should be sent even if there is only one
+     * possible code. So to avoid special checks later on we force at least
+     * two codes of non zero frequency.
+     */
+    while (s->heap_len < 2) {
+        node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
+        tree[node].Freq = 1;
+        s->depth[node] = 0;
+        s->opt_len--; if (stree) s->static_len -= stree[node].Len;
+        /* node is 0 or 1 so it does not have extra bits */
+    }
+    desc->max_code = max_code;
+
+    /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,
+     * establish sub-heaps of increasing lengths:
+     */
+    for (n = s->heap_len/2; n >= 1; n--) pqdownheap(s, tree, n);
+
+    /* Construct the Huffman tree by repeatedly combining the least two
+     * frequent nodes.
+     */
+    node = elems;              /* next internal node of the tree */
+    do {
+        pqremove(s, tree, n);  /* n = node of least frequency */
+        m = s->heap[SMALLEST]; /* m = node of next least frequency */
+
+        s->heap[--(s->heap_max)] = n; /* keep the nodes sorted by frequency */
+        s->heap[--(s->heap_max)] = m;
+
+        /* Create a new node father of n and m */
+        tree[node].Freq = tree[n].Freq + tree[m].Freq;
+        s->depth[node] = (uch)((s->depth[n] >= s->depth[m] ?
+                                s->depth[n] : s->depth[m]) + 1);
+        tree[n].Dad = tree[m].Dad = (ush)node;
+#ifdef DUMP_BL_TREE
+        if (tree == s->bl_tree) {
+            fprintf(stderr,"\nnode %d(%d), sons %d(%d) %d(%d)",
+                    node, tree[node].Freq, n, tree[n].Freq, m, tree[m].Freq);
+        }
+#endif
+        /* and insert the new node in the heap */
+        s->heap[SMALLEST] = node++;
+        pqdownheap(s, tree, SMALLEST);
+
+    } while (s->heap_len >= 2);
+
+    s->heap[--(s->heap_max)] = s->heap[SMALLEST];
+
+    /* At this point, the fields freq and dad are set. We can now
+     * generate the bit lengths.
+     */
+    gen_bitlen(s, (tree_desc *)desc);
+
+    /* The field len is now set, we can generate the bit codes */
+    gen_codes ((ct_data *)tree, max_code, s->bl_count);
+}
+
+/* ===========================================================================
+ * Scan a literal or distance tree to determine the frequencies of the codes
+ * in the bit length tree.
+ */
+local void scan_tree (deflate_state *s,
+    ct_data *tree,   /* the tree to be scanned */
+    int max_code)    /* and its largest code of non zero frequency */
+{
+    int n;                     /* iterates over all tree elements */
+    int prevlen = -1;          /* last emitted length */
+    int curlen;                /* length of current code */
+    int nextlen = tree[0].Len; /* length of next code */
+    int count = 0;             /* repeat count of the current code */
+    int max_count = 7;         /* max repeat count */
+    int min_count = 4;         /* min repeat count */
+
+    if (nextlen == 0) max_count = 138, min_count = 3;
+    tree[max_code+1].Len = (ush)0xffff; /* guard */
+
+    for (n = 0; n <= max_code; n++) {
+        curlen = nextlen; nextlen = tree[n+1].Len;
+        if (++count < max_count && curlen == nextlen) {
+            continue;
+        } else if (count < min_count) {
+            s->bl_tree[curlen].Freq += count;
+        } else if (curlen != 0) {
+            if (curlen != prevlen) s->bl_tree[curlen].Freq++;
+            s->bl_tree[REP_3_6].Freq++;
+        } else if (count <= 10) {
+            s->bl_tree[REPZ_3_10].Freq++;
+        } else {
+            s->bl_tree[REPZ_11_138].Freq++;
+        }
+        count = 0; prevlen = curlen;
+        if (nextlen == 0) {
+            max_count = 138, min_count = 3;
+        } else if (curlen == nextlen) {
+            max_count = 6, min_count = 3;
+        } else {
+            max_count = 7, min_count = 4;
+        }
+    }
+}
+
+/* ===========================================================================
+ * Send a literal or distance tree in compressed form, using the codes in
+ * bl_tree.
+ */
+local void send_tree (deflate_state *s,
+    ct_data *tree, /* the tree to be scanned */
+    int max_code)       /* and its largest code of non zero frequency */
+{
+    int n;                     /* iterates over all tree elements */
+    int prevlen = -1;          /* last emitted length */
+    int curlen;                /* length of current code */
+    int nextlen = tree[0].Len; /* length of next code */
+    int count = 0;             /* repeat count of the current code */
+    int max_count = 7;         /* max repeat count */
+    int min_count = 4;         /* min repeat count */
+
+    /* tree[max_code+1].Len = -1; */  /* guard already set */
+    if (nextlen == 0) max_count = 138, min_count = 3;
+
+    for (n = 0; n <= max_code; n++) {
+        curlen = nextlen; nextlen = tree[n+1].Len;
+        if (++count < max_count && curlen == nextlen) {
+            continue;
+        } else if (count < min_count) {
+            do { send_code(s, curlen, s->bl_tree); } while (--count != 0);
+
+        } else if (curlen != 0) {
+            if (curlen != prevlen) {
+                send_code(s, curlen, s->bl_tree); count--;
+            }
+            Assert(count >= 3 && count <= 6, " 3_6?");
+            send_code(s, REP_3_6, s->bl_tree); send_bits(s, count-3, 2);
+
+        } else if (count <= 10) {
+            send_code(s, REPZ_3_10, s->bl_tree); send_bits(s, count-3, 3);
+
+        } else {
+            send_code(s, REPZ_11_138, s->bl_tree); send_bits(s, count-11, 7);
+        }
+        count = 0; prevlen = curlen;
+        if (nextlen == 0) {
+            max_count = 138, min_count = 3;
+        } else if (curlen == nextlen) {
+            max_count = 6, min_count = 3;
+        } else {
+            max_count = 7, min_count = 4;
+        }
+    }
+}
+
+/* ===========================================================================
+ * Construct the Huffman tree for the bit lengths and return the index in
+ * bl_order of the last bit length code to send.
+ */
+local int build_bl_tree(deflate_state *s)
+{
+    int max_blindex;  /* index of last bit length code of non zero freq */
+
+    /* Determine the bit length frequencies for literal and distance trees */
+    scan_tree(s, (ct_data *)s->dyn_ltree, s->l_desc.max_code);
+    scan_tree(s, (ct_data *)s->dyn_dtree, s->d_desc.max_code);
+
+    /* Build the bit length tree: */
+    build_tree(s, (tree_desc *)(&(s->bl_desc)));
+    /* opt_len now includes the length of the tree representations, except
+     * the lengths of the bit lengths codes and the 5+5+4 bits for the counts.
+     */
+
+    /* Determine the number of bit length codes to send. The pkzip format
+     * requires that at least 4 bit length codes be sent. (appnote.txt says
+     * 3 but the actual value used is 4.)
+     */
+    for (max_blindex = BL_CODES-1; max_blindex >= 3; max_blindex--) {
+        if (s->bl_tree[bl_order[max_blindex]].Len != 0) break;
+    }
+    /* Update opt_len to include the bit length tree and counts */
+    s->opt_len += 3*(max_blindex+1) + 5+5+4;
+    Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld",
+            s->opt_len, s->static_len));
+
+    return max_blindex;
+}
+
+/* ===========================================================================
+ * Send the header for a block using dynamic Huffman trees: the counts, the
+ * lengths of the bit length codes, the literal tree and the distance tree.
+ * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4.
+ */
+local void send_all_trees(deflate_state *s,
+    int lcodes, int dcodes, int blcodes) /* number of codes for each tree */
+{
+    int rank;                    /* index in bl_order */
+
+    Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes");
+    Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES,
+            "too many codes");
+    Tracev((stderr, "\nbl counts: "));
+    send_bits(s, lcodes-257, 5); /* not +255 as stated in appnote.txt */
+    send_bits(s, dcodes-1,   5);
+    send_bits(s, blcodes-4,  4); /* not -3 as stated in appnote.txt */
+    for (rank = 0; rank < blcodes; rank++) {
+        Tracev((stderr, "\nbl code %2d ", bl_order[rank]));
+        send_bits(s, s->bl_tree[bl_order[rank]].Len, 3);
+    }
+    Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent));
+
+    send_tree(s, (ct_data *)s->dyn_ltree, lcodes-1); /* literal tree */
+    Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent));
+
+    send_tree(s, (ct_data *)s->dyn_dtree, dcodes-1); /* distance tree */
+    Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent));
+}
+
+/* ===========================================================================
+ * Send a stored block
+ */
+void _tr_stored_block(deflate_state *s,
+    charf *buf,       /* input block */
+    ulg stored_len,   /* length of input block */
+    int eof)          /* true if this is the last block for a file */
+{
+    send_bits(s, (STORED_BLOCK<<1)+eof, 3);  /* send block type */
+#ifdef DEBUG
+    s->compressed_len = (s->compressed_len + 3 + 7) & (ulg)~7L;
+    s->compressed_len += (stored_len + 4) << 3;
+#endif
+    copy_block(s, buf, (unsigned)stored_len, 1); /* with header */
+}
+
+/* ===========================================================================
+ * Send one empty static block to give enough lookahead for inflate.
+ * This takes 10 bits, of which 7 may remain in the bit buffer.
+ * The current inflate code requires 9 bits of lookahead. If the
+ * last two codes for the previous block (real code plus EOB) were coded
+ * on 5 bits or less, inflate may have only 5+3 bits of lookahead to decode
+ * the last real code. In this case we send two empty static blocks instead
+ * of one. (There are no problems if the previous block is stored or fixed.)
+ * To simplify the code, we assume the worst case of last real code encoded
+ * on one bit only.
+ */
+void _tr_align(deflate_state *s)
+{
+    send_bits(s, STATIC_TREES<<1, 3);
+    send_code(s, END_BLOCK, static_ltree);
+#ifdef DEBUG
+    s->compressed_len += 10L; /* 3 for block type, 7 for EOB */
+#endif
+    bi_flush(s);
+    /* Of the 10 bits for the empty block, we have already sent
+     * (10 - bi_valid) bits. The lookahead for the last real code (before
+     * the EOB of the previous block) was thus at least one plus the length
+     * of the EOB plus what we have just sent of the empty static block.
+     */
+    if (1 + s->last_eob_len + 10 - s->bi_valid < 9) {
+        send_bits(s, STATIC_TREES<<1, 3);
+        send_code(s, END_BLOCK, static_ltree);
+#ifdef DEBUG
+        s->compressed_len += 10L;
+#endif
+        bi_flush(s);
+    }
+    s->last_eob_len = 7;
+}
+
+/* ===========================================================================
+ * Determine the best encoding for the current block: dynamic trees, static
+ * trees or store, and output the encoded block to the zip file.
+ */
+void _tr_flush_block(deflate_state *s,
+    charf *buf,       /* input block, or NULL if too old */
+    ulg stored_len,   /* length of input block */
+    int eof)          /* true if this is the last block for a file */
+{
+    ulg opt_lenb, static_lenb; /* opt_len and static_len in bytes */
+    int max_blindex = 0;  /* index of last bit length code of non zero freq */
+
+    /* Build the Huffman trees unless a stored block is forced */
+    if (s->level > 0) {
+
+        /* Check if the file is binary or text */
+        if (stored_len > 0 && s->strm->data_type == Z_UNKNOWN)
+            set_data_type(s);
+
+        /* Construct the literal and distance trees */
+        build_tree(s, (tree_desc *)(&(s->l_desc)));
+        Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len,
+                s->static_len));
+
+        build_tree(s, (tree_desc *)(&(s->d_desc)));
+        Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len,
+                s->static_len));
+        /* At this point, opt_len and static_len are the total bit lengths of
+         * the compressed block data, excluding the tree representations.
+         */
+
+        /* Build the bit length tree for the above two trees, and get the index
+         * in bl_order of the last bit length code to send.
+         */
+        max_blindex = build_bl_tree(s);
+
+        /* Determine the best encoding. Compute the block lengths in bytes. */
+        opt_lenb = (s->opt_len+3+7)>>3;
+        static_lenb = (s->static_len+3+7)>>3;
+
+        Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ",
+                opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len,
+                s->last_lit));
+
+        if (static_lenb <= opt_lenb) opt_lenb = static_lenb;
+
+    } else {
+        Assert(buf != (char*)0, "lost buf");
+        opt_lenb = static_lenb = stored_len + 5; /* force a stored block */
+    }
+
+#ifdef FORCE_STORED
+    if (buf != (char*)0) { /* force stored block */
+#else
+    if (stored_len+4 <= opt_lenb && buf != (char*)0) {
+                       /* 4: two words for the lengths */
+#endif
+        /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE.
+         * Otherwise we can't have processed more than WSIZE input bytes since
+         * the last block flush, because compression would have been
+         * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to
+         * transform a block into a stored block.
+         */
+        _tr_stored_block(s, buf, stored_len, eof);
+
+#ifdef FORCE_STATIC
+    } else if (static_lenb >= 0) { /* force static trees */
+#else
+    } else if (s->strategy == Z_FIXED || static_lenb == opt_lenb) {
+#endif
+        send_bits(s, (STATIC_TREES<<1)+eof, 3);
+        compress_block(s, (ct_data *)static_ltree, (ct_data *)static_dtree);
+#ifdef DEBUG
+        s->compressed_len += 3 + s->static_len;
+#endif
+    } else {
+        send_bits(s, (DYN_TREES<<1)+eof, 3);
+        send_all_trees(s, s->l_desc.max_code+1, s->d_desc.max_code+1,
+                       max_blindex+1);
+        compress_block(s, (ct_data *)s->dyn_ltree, (ct_data *)s->dyn_dtree);
+#ifdef DEBUG
+        s->compressed_len += 3 + s->opt_len;
+#endif
+    }
+    Assert (s->compressed_len == s->bits_sent, "bad compressed size");
+    /* The above check is made mod 2^32, for files larger than 512 MB
+     * and uLong implemented on 32 bits.
+     */
+    init_block(s);
+
+    if (eof) {
+        bi_windup(s);
+#ifdef DEBUG
+        s->compressed_len += 7;  /* align on byte boundary */
+#endif
+    }
+    Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3,
+           s->compressed_len-7*eof));
+}
+
+/* ===========================================================================
+ * Save the match info and tally the frequency counts. Return true if
+ * the current block must be flushed.
+ */
+int _tr_tally (deflate_state *s,
+    unsigned dist,  /* distance of matched string */
+    unsigned lc)    /* match length-MIN_MATCH or unmatched char (if dist==0) */
+{
+    s->d_buf[s->last_lit] = (ush)dist;
+    s->l_buf[s->last_lit++] = (uch)lc;
+    if (dist == 0) {
+        /* lc is the unmatched char */
+        s->dyn_ltree[lc].Freq++;
+    } else {
+        s->matches++;
+        /* Here, lc is the match length - MIN_MATCH */
+        dist--;             /* dist = match distance - 1 */
+        Assert((ush)dist < (ush)MAX_DIST(s) &&
+               (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) &&
+               (ush)d_code(dist) < (ush)D_CODES,  "_tr_tally: bad match");
+
+        s->dyn_ltree[_length_code[lc]+LITERALS+1].Freq++;
+        s->dyn_dtree[d_code(dist)].Freq++;
+    }
+
+#ifdef TRUNCATE_BLOCK
+    /* Try to guess if it is profitable to stop the current block here */
+    if ((s->last_lit & 0x1fff) == 0 && s->level > 2) {
+        /* Compute an upper bound for the compressed length */
+        ulg out_length = (ulg)s->last_lit*8L;
+        ulg in_length = (ulg)((long)s->strstart - s->block_start);
+        int dcode;
+        for (dcode = 0; dcode < D_CODES; dcode++) {
+            out_length += (ulg)s->dyn_dtree[dcode].Freq *
+                (5L+extra_dbits[dcode]);
+        }
+        out_length >>= 3;
+        Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ",
+               s->last_lit, in_length, out_length,
+               100L - out_length*100L/in_length));
+        if (s->matches < s->last_lit/2 && out_length < in_length/2) return 1;
+    }
+#endif
+    return (s->last_lit == s->lit_bufsize-1);
+    /* We avoid equality with lit_bufsize because of wraparound at 64K
+     * on 16 bit machines and because stored blocks are restricted to
+     * 64K-1 bytes.
+     */
+}
+
+/* ===========================================================================
+ * Send the block data compressed using the given Huffman trees
+ */
+local void compress_block(deflate_state *s,
+    ct_data *ltree, /* literal tree */
+    ct_data *dtree) /* distance tree */
+{
+    unsigned dist;      /* distance of matched string */
+    int lc;             /* match length or unmatched char (if dist == 0) */
+    unsigned lx = 0;    /* running index in l_buf */
+    unsigned code;      /* the code to send */
+    int extra;          /* number of extra bits to send */
+
+    if (s->last_lit != 0) do {
+        dist = s->d_buf[lx];
+        lc = s->l_buf[lx++];
+        if (dist == 0) {
+            send_code(s, lc, ltree); /* send a literal byte */
+            Tracecv(isgraph(lc), (stderr," '%c' ", lc));
+        } else {
+            /* Here, lc is the match length - MIN_MATCH */
+            code = _length_code[lc];
+            send_code(s, code+LITERALS+1, ltree); /* send the length code */
+            extra = extra_lbits[code];
+            if (extra != 0) {
+                lc -= base_length[code];
+                send_bits(s, lc, extra);       /* send the extra length bits */
+            }
+            dist--; /* dist is now the match distance - 1 */
+            code = d_code(dist);
+            Assert (code < D_CODES, "bad d_code");
+
+            send_code(s, code, dtree);       /* send the distance code */
+            extra = extra_dbits[code];
+            if (extra != 0) {
+                dist -= base_dist[code];
+                send_bits(s, dist, extra);   /* send the extra distance bits */
+            }
+        } /* literal or match pair ? */
+
+        /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */
+        Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx,
+               "pendingBuf overflow");
+
+    } while (lx < s->last_lit);
+
+    send_code(s, END_BLOCK, ltree);
+    s->last_eob_len = ltree[END_BLOCK].Len;
+}
+
+/* ===========================================================================
+ * Set the data type to BINARY or TEXT, using a crude approximation:
+ * set it to Z_TEXT if all symbols are either printable characters (33 to 255)
+ * or white spaces (9 to 13, or 32); or set it to Z_BINARY otherwise.
+ * IN assertion: the fields Freq of dyn_ltree are set.
+ */
+local void set_data_type(deflate_state *s)
+{
+    int n;
+
+    for (n = 0; n < 9; n++)
+        if (s->dyn_ltree[n].Freq != 0)
+            break;
+    if (n == 9)
+        for (n = 14; n < 32; n++)
+            if (s->dyn_ltree[n].Freq != 0)
+                break;
+    s->strm->data_type = (n == 32) ? Z_TEXT : Z_BINARY;
+}
+
+/* ===========================================================================
+ * Reverse the first len bits of a code, using straightforward code (a faster
+ * method would use a table)
+ * IN assertion: 1 <= len <= 15
+ */
+local unsigned bi_reverse(unsigned code, /* the value to invert */
+    int len)       /* its bit length */
+{
+    register unsigned res = 0;
+    do {
+        res |= code & 1;
+        code >>= 1, res <<= 1;
+    } while (--len > 0);
+    return res >> 1;
+}
+
+/* ===========================================================================
+ * Flush the bit buffer, keeping at most 7 bits in it.
+ */
+local void bi_flush(deflate_state *s)
+{
+    if (s->bi_valid == 16) {
+        put_short(s, s->bi_buf);
+        s->bi_buf = 0;
+        s->bi_valid = 0;
+    } else if (s->bi_valid >= 8) {
+        put_byte(s, (Byte)s->bi_buf);
+        s->bi_buf >>= 8;
+        s->bi_valid -= 8;
+    }
+}
+
+/* ===========================================================================
+ * Flush the bit buffer and align the output on a byte boundary
+ */
+local void bi_windup(deflate_state *s)
+{
+    if (s->bi_valid > 8) {
+        put_short(s, s->bi_buf);
+    } else if (s->bi_valid > 0) {
+        put_byte(s, (Byte)s->bi_buf);
+    }
+    s->bi_buf = 0;
+    s->bi_valid = 0;
+#ifdef DEBUG
+    s->bits_sent = (s->bits_sent+7) & ~7;
+#endif
+}
+
+/* ===========================================================================
+ * Copy a stored block, storing first the length and its
+ * one's complement if requested.
+ */
+local void copy_block(deflate_state *s, 
+    charf    *buf,    /* the input data */
+    unsigned len,     /* its length */
+    int      header)  /* true if block header must be written */
+{
+    bi_windup(s);        /* align on byte boundary */
+    s->last_eob_len = 8; /* enough lookahead for inflate */
+
+    if (header) {
+        put_short(s, (ush)len);
+        put_short(s, (ush)~len);
+#ifdef DEBUG
+        s->bits_sent += 2*16;
+#endif
+    }
+#ifdef DEBUG
+    s->bits_sent += (ulg)len<<3;
+#endif
+    while (len--) {
+        put_byte(s, *buf++);
+    }
+}
diff --git a/updater/zlib123/trees.h b/updater/zlib123/trees.h
new file mode 100644
index 0000000..1ca868b
--- /dev/null
+++ b/updater/zlib123/trees.h
@@ -0,0 +1,128 @@
+/* header created automatically with -DGEN_TREES_H */
+
+local const ct_data static_ltree[L_CODES+2] = {
+{{ 12},{  8}}, {{140},{  8}}, {{ 76},{  8}}, {{204},{  8}}, {{ 44},{  8}},
+{{172},{  8}}, {{108},{  8}}, {{236},{  8}}, {{ 28},{  8}}, {{156},{  8}},
+{{ 92},{  8}}, {{220},{  8}}, {{ 60},{  8}}, {{188},{  8}}, {{124},{  8}},
+{{252},{  8}}, {{  2},{  8}}, {{130},{  8}}, {{ 66},{  8}}, {{194},{  8}},
+{{ 34},{  8}}, {{162},{  8}}, {{ 98},{  8}}, {{226},{  8}}, {{ 18},{  8}},
+{{146},{  8}}, {{ 82},{  8}}, {{210},{  8}}, {{ 50},{  8}}, {{178},{  8}},
+{{114},{  8}}, {{242},{  8}}, {{ 10},{  8}}, {{138},{  8}}, {{ 74},{  8}},
+{{202},{  8}}, {{ 42},{  8}}, {{170},{  8}}, {{106},{  8}}, {{234},{  8}},
+{{ 26},{  8}}, {{154},{  8}}, {{ 90},{  8}}, {{218},{  8}}, {{ 58},{  8}},
+{{186},{  8}}, {{122},{  8}}, {{250},{  8}}, {{  6},{  8}}, {{134},{  8}},
+{{ 70},{  8}}, {{198},{  8}}, {{ 38},{  8}}, {{166},{  8}}, {{102},{  8}},
+{{230},{  8}}, {{ 22},{  8}}, {{150},{  8}}, {{ 86},{  8}}, {{214},{  8}},
+{{ 54},{  8}}, {{182},{  8}}, {{118},{  8}}, {{246},{  8}}, {{ 14},{  8}},
+{{142},{  8}}, {{ 78},{  8}}, {{206},{  8}}, {{ 46},{  8}}, {{174},{  8}},
+{{110},{  8}}, {{238},{  8}}, {{ 30},{  8}}, {{158},{  8}}, {{ 94},{  8}},
+{{222},{  8}}, {{ 62},{  8}}, {{190},{  8}}, {{126},{  8}}, {{254},{  8}},
+{{  1},{  8}}, {{129},{  8}}, {{ 65},{  8}}, {{193},{  8}}, {{ 33},{  8}},
+{{161},{  8}}, {{ 97},{  8}}, {{225},{  8}}, {{ 17},{  8}}, {{145},{  8}},
+{{ 81},{  8}}, {{209},{  8}}, {{ 49},{  8}}, {{177},{  8}}, {{113},{  8}},
+{{241},{  8}}, {{  9},{  8}}, {{137},{  8}}, {{ 73},{  8}}, {{201},{  8}},
+{{ 41},{  8}}, {{169},{  8}}, {{105},{  8}}, {{233},{  8}}, {{ 25},{  8}},
+{{153},{  8}}, {{ 89},{  8}}, {{217},{  8}}, {{ 57},{  8}}, {{185},{  8}},
+{{121},{  8}}, {{249},{  8}}, {{  5},{  8}}, {{133},{  8}}, {{ 69},{  8}},
+{{197},{  8}}, {{ 37},{  8}}, {{165},{  8}}, {{101},{  8}}, {{229},{  8}},
+{{ 21},{  8}}, {{149},{  8}}, {{ 85},{  8}}, {{213},{  8}}, {{ 53},{  8}},
+{{181},{  8}}, {{117},{  8}}, {{245},{  8}}, {{ 13},{  8}}, {{141},{  8}},
+{{ 77},{  8}}, {{205},{  8}}, {{ 45},{  8}}, {{173},{  8}}, {{109},{  8}},
+{{237},{  8}}, {{ 29},{  8}}, {{157},{  8}}, {{ 93},{  8}}, {{221},{  8}},
+{{ 61},{  8}}, {{189},{  8}}, {{125},{  8}}, {{253},{  8}}, {{ 19},{  9}},
+{{275},{  9}}, {{147},{  9}}, {{403},{  9}}, {{ 83},{  9}}, {{339},{  9}},
+{{211},{  9}}, {{467},{  9}}, {{ 51},{  9}}, {{307},{  9}}, {{179},{  9}},
+{{435},{  9}}, {{115},{  9}}, {{371},{  9}}, {{243},{  9}}, {{499},{  9}},
+{{ 11},{  9}}, {{267},{  9}}, {{139},{  9}}, {{395},{  9}}, {{ 75},{  9}},
+{{331},{  9}}, {{203},{  9}}, {{459},{  9}}, {{ 43},{  9}}, {{299},{  9}},
+{{171},{  9}}, {{427},{  9}}, {{107},{  9}}, {{363},{  9}}, {{235},{  9}},
+{{491},{  9}}, {{ 27},{  9}}, {{283},{  9}}, {{155},{  9}}, {{411},{  9}},
+{{ 91},{  9}}, {{347},{  9}}, {{219},{  9}}, {{475},{  9}}, {{ 59},{  9}},
+{{315},{  9}}, {{187},{  9}}, {{443},{  9}}, {{123},{  9}}, {{379},{  9}},
+{{251},{  9}}, {{507},{  9}}, {{  7},{  9}}, {{263},{  9}}, {{135},{  9}},
+{{391},{  9}}, {{ 71},{  9}}, {{327},{  9}}, {{199},{  9}}, {{455},{  9}},
+{{ 39},{  9}}, {{295},{  9}}, {{167},{  9}}, {{423},{  9}}, {{103},{  9}},
+{{359},{  9}}, {{231},{  9}}, {{487},{  9}}, {{ 23},{  9}}, {{279},{  9}},
+{{151},{  9}}, {{407},{  9}}, {{ 87},{  9}}, {{343},{  9}}, {{215},{  9}},
+{{471},{  9}}, {{ 55},{  9}}, {{311},{  9}}, {{183},{  9}}, {{439},{  9}},
+{{119},{  9}}, {{375},{  9}}, {{247},{  9}}, {{503},{  9}}, {{ 15},{  9}},
+{{271},{  9}}, {{143},{  9}}, {{399},{  9}}, {{ 79},{  9}}, {{335},{  9}},
+{{207},{  9}}, {{463},{  9}}, {{ 47},{  9}}, {{303},{  9}}, {{175},{  9}},
+{{431},{  9}}, {{111},{  9}}, {{367},{  9}}, {{239},{  9}}, {{495},{  9}},
+{{ 31},{  9}}, {{287},{  9}}, {{159},{  9}}, {{415},{  9}}, {{ 95},{  9}},
+{{351},{  9}}, {{223},{  9}}, {{479},{  9}}, {{ 63},{  9}}, {{319},{  9}},
+{{191},{  9}}, {{447},{  9}}, {{127},{  9}}, {{383},{  9}}, {{255},{  9}},
+{{511},{  9}}, {{  0},{  7}}, {{ 64},{  7}}, {{ 32},{  7}}, {{ 96},{  7}},
+{{ 16},{  7}}, {{ 80},{  7}}, {{ 48},{  7}}, {{112},{  7}}, {{  8},{  7}},
+{{ 72},{  7}}, {{ 40},{  7}}, {{104},{  7}}, {{ 24},{  7}}, {{ 88},{  7}},
+{{ 56},{  7}}, {{120},{  7}}, {{  4},{  7}}, {{ 68},{  7}}, {{ 36},{  7}},
+{{100},{  7}}, {{ 20},{  7}}, {{ 84},{  7}}, {{ 52},{  7}}, {{116},{  7}},
+{{  3},{  8}}, {{131},{  8}}, {{ 67},{  8}}, {{195},{  8}}, {{ 35},{  8}},
+{{163},{  8}}, {{ 99},{  8}}, {{227},{  8}}
+};
+
+local const ct_data static_dtree[D_CODES] = {
+{{ 0},{ 5}}, {{16},{ 5}}, {{ 8},{ 5}}, {{24},{ 5}}, {{ 4},{ 5}},
+{{20},{ 5}}, {{12},{ 5}}, {{28},{ 5}}, {{ 2},{ 5}}, {{18},{ 5}},
+{{10},{ 5}}, {{26},{ 5}}, {{ 6},{ 5}}, {{22},{ 5}}, {{14},{ 5}},
+{{30},{ 5}}, {{ 1},{ 5}}, {{17},{ 5}}, {{ 9},{ 5}}, {{25},{ 5}},
+{{ 5},{ 5}}, {{21},{ 5}}, {{13},{ 5}}, {{29},{ 5}}, {{ 3},{ 5}},
+{{19},{ 5}}, {{11},{ 5}}, {{27},{ 5}}, {{ 7},{ 5}}, {{23},{ 5}}
+};
+
+const uch _dist_code[DIST_CODE_LEN] = {
+ 0,  1,  2,  3,  4,  4,  5,  5,  6,  6,  6,  6,  7,  7,  7,  7,  8,  8,  8,  8,
+ 8,  8,  8,  8,  9,  9,  9,  9,  9,  9,  9,  9, 10, 10, 10, 10, 10, 10, 10, 10,
+10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11,
+11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12,
+12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13,
+13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13,
+13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
+14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
+14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14,
+14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15,
+15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
+15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,
+15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15,  0,  0, 16, 17,
+18, 18, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22, 22, 22, 22, 22,
+23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+24, 24, 24, 24, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,
+26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27,
+27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
+27, 27, 27, 27, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28,
+28, 28, 28, 28, 28, 28, 28, 28, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
+29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
+29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29,
+29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29
+};
+
+const uch _length_code[MAX_MATCH-MIN_MATCH+1]= {
+ 0,  1,  2,  3,  4,  5,  6,  7,  8,  8,  9,  9, 10, 10, 11, 11, 12, 12, 12, 12,
+13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16,
+17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19,
+19, 19, 19, 19, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
+21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 22, 22, 22, 22,
+22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 23, 23, 23, 23, 23, 23, 23, 23,
+23, 23, 23, 23, 23, 23, 23, 23, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24,
+25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25,
+25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 26, 26, 26, 26, 26, 26, 26, 26,
+26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26,
+26, 26, 26, 26, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
+27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 28
+};
+
+local const int base_length[LENGTH_CODES] = {
+0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16, 20, 24, 28, 32, 40, 48, 56,
+64, 80, 96, 112, 128, 160, 192, 224, 0
+};
+
+local const int base_dist[D_CODES] = {
+    0,     1,     2,     3,     4,     6,     8,    12,    16,    24,
+   32,    48,    64,    96,   128,   192,   256,   384,   512,   768,
+ 1024,  1536,  2048,  3072,  4096,  6144,  8192, 12288, 16384, 24576
+};
+
diff --git a/updater/zlib123/uncompr.c b/updater/zlib123/uncompr.c
new file mode 100644
index 0000000..6d6166f
--- /dev/null
+++ b/updater/zlib123/uncompr.c
@@ -0,0 +1,61 @@
+/* uncompr.c -- decompress a memory buffer
+ * Copyright (C) 1995-2003 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#define ZLIB_INTERNAL
+#include "zlib.h"
+
+/* ===========================================================================
+     Decompresses the source buffer into the destination buffer.  sourceLen is
+   the byte length of the source buffer. Upon entry, destLen is the total
+   size of the destination buffer, which must be large enough to hold the
+   entire uncompressed data. (The size of the uncompressed data must have
+   been saved previously by the compressor and transmitted to the decompressor
+   by some mechanism outside the scope of this compression library.)
+   Upon exit, destLen is the actual size of the compressed buffer.
+     This function can be used to decompress a whole file at once if the
+   input file is mmap'ed.
+
+     uncompress returns Z_OK if success, Z_MEM_ERROR if there was not
+   enough memory, Z_BUF_ERROR if there was not enough room in the output
+   buffer, or Z_DATA_ERROR if the input data was corrupted.
+*/
+int ZEXPORT uncompress (
+    Bytef *dest,
+    uLongf *destLen,
+    const Bytef *source,
+    uLong sourceLen)
+{
+    z_stream stream;
+    int err;
+
+    stream.next_in = (Bytef*)source;
+    stream.avail_in = (uInt)sourceLen;
+    /* Check for source > 64K on 16-bit machine: */
+    if ((uLong)stream.avail_in != sourceLen) return Z_BUF_ERROR;
+
+    stream.next_out = dest;
+    stream.avail_out = (uInt)*destLen;
+    if ((uLong)stream.avail_out != *destLen) return Z_BUF_ERROR;
+
+    stream.zalloc = (alloc_func)0;
+    stream.zfree = (free_func)0;
+
+    err = inflateInit(&stream);
+    if (err != Z_OK) return err;
+
+    err = inflate(&stream, Z_FINISH);
+    if (err != Z_STREAM_END) {
+        inflateEnd(&stream);
+        if (err == Z_NEED_DICT || (err == Z_BUF_ERROR && stream.avail_in == 0))
+            return Z_DATA_ERROR;
+        return err;
+    }
+    *destLen = stream.total_out;
+
+    err = inflateEnd(&stream);
+    return err;
+}
diff --git a/updater/zlib123/win32/DLL_FAQ.txt b/updater/zlib123/win32/DLL_FAQ.txt
new file mode 100644
index 0000000..ad4286f
--- /dev/null
+++ b/updater/zlib123/win32/DLL_FAQ.txt
@@ -0,0 +1,397 @@
+
+            Frequently Asked Questions about ZLIB1.DLL
+
+
+This document describes the design, the rationale, and the usage
+of the official DLL build of zlib, named ZLIB1.DLL.  If you have
+general questions about zlib, you should see the file "FAQ" found
+in the zlib distribution, or at the following location:
+  http://www.gzip.org/zlib/zlib_faq.html
+
+
+ 1. What is ZLIB1.DLL, and how can I get it?
+
+  - ZLIB1.DLL is the official build of zlib as a DLL.
+    (Please remark the character '1' in the name.)
+
+    Pointers to a precompiled ZLIB1.DLL can be found in the zlib
+    web site at:
+      http://www.zlib.org/
+
+    Applications that link to ZLIB1.DLL can rely on the following
+    specification:
+
+    * The exported symbols are exclusively defined in the source
+      files "zlib.h" and "zlib.def", found in an official zlib
+      source distribution.
+    * The symbols are exported by name, not by ordinal.
+    * The exported names are undecorated.
+    * The calling convention of functions is "C" (CDECL).
+    * The ZLIB1.DLL binary is linked to MSVCRT.DLL.
+
+    The archive in which ZLIB1.DLL is bundled contains compiled
+    test programs that must run with a valid build of ZLIB1.DLL.
+    It is recommended to download the prebuilt DLL from the zlib
+    web site, instead of building it yourself, to avoid potential
+    incompatibilities that could be introduced by your compiler
+    and build settings.  If you do build the DLL yourself, please
+    make sure that it complies with all the above requirements,
+    and it runs with the precompiled test programs, bundled with
+    the original ZLIB1.DLL distribution.
+
+    If, for any reason, you need to build an incompatible DLL,
+    please use a different file name.
+
+
+ 2. Why did you change the name of the DLL to ZLIB1.DLL?
+    What happened to the old ZLIB.DLL?
+
+  - The old ZLIB.DLL, built from zlib-1.1.4 or earlier, required
+    compilation settings that were incompatible to those used by
+    a static build.  The DLL settings were supposed to be enabled
+    by defining the macro ZLIB_DLL, before including "zlib.h".
+    Incorrect handling of this macro was silently accepted at
+    build time, resulting in two major problems:
+
+    * ZLIB_DLL was missing from the old makefile.  When building
+      the DLL, not all people added it to the build options.  In
+      consequence, incompatible incarnations of ZLIB.DLL started
+      to circulate around the net.
+
+    * When switching from using the static library to using the
+      DLL, applications had to define the ZLIB_DLL macro and
+      to recompile all the sources that contained calls to zlib
+      functions.  Failure to do so resulted in creating binaries
+      that were unable to run with the official ZLIB.DLL build.
+
+    The only possible solution that we could foresee was to make
+    a binary-incompatible change in the DLL interface, in order to
+    remove the dependency on the ZLIB_DLL macro, and to release
+    the new DLL under a different name.
+
+    We chose the name ZLIB1.DLL, where '1' indicates the major
+    zlib version number.  We hope that we will not have to break
+    the binary compatibility again, at least not as long as the
+    zlib-1.x series will last.
+
+    There is still a ZLIB_DLL macro, that can trigger a more
+    efficient build and use of the DLL, but compatibility no
+    longer dependents on it.
+
+
+ 3. Can I build ZLIB.DLL from the new zlib sources, and replace
+    an old ZLIB.DLL, that was built from zlib-1.1.4 or earlier?
+
+  - In principle, you can do it by assigning calling convention
+    keywords to the macros ZEXPORT and ZEXPORTVA.  In practice,
+    it depends on what you mean by "an old ZLIB.DLL", because the
+    old DLL exists in several mutually-incompatible versions.
+    You have to find out first what kind of calling convention is
+    being used in your particular ZLIB.DLL build, and to use the
+    same one in the new build.  If you don't know what this is all
+    about, you might be better off if you would just leave the old
+    DLL intact.
+
+
+ 4. Can I compile my application using the new zlib interface, and
+    link it to an old ZLIB.DLL, that was built from zlib-1.1.4 or
+    earlier?
+
+  - The official answer is "no"; the real answer depends again on
+    what kind of ZLIB.DLL you have.  Even if you are lucky, this
+    course of action is unreliable.
+
+    If you rebuild your application and you intend to use a newer
+    version of zlib (post- 1.1.4), it is strongly recommended to
+    link it to the new ZLIB1.DLL.
+
+
+ 5. Why are the zlib symbols exported by name, and not by ordinal?
+
+  - Although exporting symbols by ordinal is a little faster, it
+    is risky.  Any single glitch in the maintenance or use of the
+    DEF file that contains the ordinals can result in incompatible
+    builds and frustrating crashes.  Simply put, the benefits of
+    exporting symbols by ordinal do not justify the risks.
+
+    Technically, it should be possible to maintain ordinals in
+    the DEF file, and still export the symbols by name.  Ordinals
+    exist in every DLL, and even if the dynamic linking performed
+    at the DLL startup is searching for names, ordinals serve as
+    hints, for a faster name lookup.  However, if the DEF file
+    contains ordinals, the Microsoft linker automatically builds
+    an implib that will cause the executables linked to it to use
+    those ordinals, and not the names.  It is interesting to
+    notice that the GNU linker for Win32 does not suffer from this
+    problem.
+
+    It is possible to avoid the DEF file if the exported symbols
+    are accompanied by a "__declspec(dllexport)" attribute in the
+    source files.  You can do this in zlib by predefining the
+    ZLIB_DLL macro.
+
+
+ 6. I see that the ZLIB1.DLL functions use the "C" (CDECL) calling
+    convention.  Why not use the STDCALL convention?
+    STDCALL is the standard convention in Win32, and I need it in
+    my Visual Basic project!
+
+    (For readability, we use CDECL to refer to the convention
+     triggered by the "__cdecl" keyword, STDCALL to refer to
+     the convention triggered by "__stdcall", and FASTCALL to
+     refer to the convention triggered by "__fastcall".)
+
+  - Most of the native Windows API functions (without varargs) use
+    indeed the WINAPI convention (which translates to STDCALL in
+    Win32), but the standard C functions use CDECL.  If a user
+    application is intrinsically tied to the Windows API (e.g.
+    it calls native Windows API functions such as CreateFile()),
+    sometimes it makes sense to decorate its own functions with
+    WINAPI.  But if ANSI C or POSIX portability is a goal (e.g.
+    it calls standard C functions such as fopen()), it is not a
+    sound decision to request the inclusion of <windows.h>, or to
+    use non-ANSI constructs, for the sole purpose to make the user
+    functions STDCALL-able.
+
+    The functionality offered by zlib is not in the category of
+    "Windows functionality", but is more like "C functionality".
+
+    Technically, STDCALL is not bad; in fact, it is slightly
+    faster than CDECL, and it works with variable-argument
+    functions, just like CDECL.  It is unfortunate that, in spite
+    of using STDCALL in the Windows API, it is not the default
+    convention used by the C compilers that run under Windows.
+    The roots of the problem reside deep inside the unsafety of
+    the K&R-style function prototypes, where the argument types
+    are not specified; but that is another story for another day.
+
+    The remaining fact is that CDECL is the default convention.
+    Even if an explicit convention is hard-coded into the function
+    prototypes inside C headers, problems may appear.  The
+    necessity to expose the convention in users' callbacks is one
+    of these problems.
+
+    The calling convention issues are also important when using
+    zlib in other programming languages.  Some of them, like Ada
+    (GNAT) and Fortran (GNU G77), have C bindings implemented
+    initially on Unix, and relying on the C calling convention.
+    On the other hand, the pre- .NET versions of Microsoft Visual
+    Basic require STDCALL, while Borland Delphi prefers, although
+    it does not require, FASTCALL.
+
+    In fairness to all possible uses of zlib outside the C
+    programming language, we choose the default "C" convention.
+    Anyone interested in different bindings or conventions is
+    encouraged to maintain specialized projects.  The "contrib/"
+    directory from the zlib distribution already holds a couple
+    of foreign bindings, such as Ada, C++, and Delphi.
+
+
+ 7. I need a DLL for my Visual Basic project.  What can I do?
+
+  - Define the ZLIB_WINAPI macro before including "zlib.h", when
+    building both the DLL and the user application (except that
+    you don't need to define anything when using the DLL in Visual
+    Basic).  The ZLIB_WINAPI macro will switch on the WINAPI
+    (STDCALL) convention.  The name of this DLL must be different
+    than the official ZLIB1.DLL.
+
+    Gilles Vollant has contributed a build named ZLIBWAPI.DLL,
+    with the ZLIB_WINAPI macro turned on, and with the minizip
+    functionality built in.  For more information, please read
+    the notes inside "contrib/vstudio/readme.txt", found in the
+    zlib distribution.
+
+
+ 8. I need to use zlib in my Microsoft .NET project.  What can I
+    do?
+
+  - Henrik Ravn has contributed a .NET wrapper around zlib.  Look
+    into contrib/dotzlib/, inside the zlib distribution.
+
+
+ 9. If my application uses ZLIB1.DLL, should I link it to
+    MSVCRT.DLL?  Why?
+
+  - It is not required, but it is recommended to link your
+    application to MSVCRT.DLL, if it uses ZLIB1.DLL.
+
+    The executables (.EXE, .DLL, etc.) that are involved in the
+    same process and are using the C run-time library (i.e. they
+    are calling standard C functions), must link to the same
+    library.  There are several libraries in the Win32 system:
+    CRTDLL.DLL, MSVCRT.DLL, the static C libraries, etc.
+    Since ZLIB1.DLL is linked to MSVCRT.DLL, the executables that
+    depend on it should also be linked to MSVCRT.DLL.
+
+
+10. Why are you saying that ZLIB1.DLL and my application should
+    be linked to the same C run-time (CRT) library?  I linked my
+    application and my DLLs to different C libraries (e.g. my
+    application to a static library, and my DLLs to MSVCRT.DLL),
+    and everything works fine.
+
+  - If a user library invokes only pure Win32 API (accessible via
+    <windows.h> and the related headers), its DLL build will work
+    in any context.  But if this library invokes standard C API,
+    things get more complicated.
+
+    There is a single Win32 library in a Win32 system.  Every
+    function in this library resides in a single DLL module, that
+    is safe to call from anywhere.  On the other hand, there are
+    multiple versions of the C library, and each of them has its
+    own separate internal state.  Standalone executables and user
+    DLLs that call standard C functions must link to a C run-time
+    (CRT) library, be it static or shared (DLL).  Intermixing
+    occurs when an executable (not necessarily standalone) and a
+    DLL are linked to different CRTs, and both are running in the
+    same process.
+
+    Intermixing multiple CRTs is possible, as long as their
+    internal states are kept intact.  The Microsoft Knowledge Base
+    articles KB94248 "HOWTO: Use the C Run-Time" and KB140584
+    "HOWTO: Link with the Correct C Run-Time (CRT) Library"
+    mention the potential problems raised by intermixing.
+
+    If intermixing works for you, it's because your application
+    and DLLs are avoiding the corruption of each of the CRTs'
+    internal states, maybe by careful design, or maybe by fortune.
+
+    Also note that linking ZLIB1.DLL to non-Microsoft CRTs, such
+    as those provided by Borland, raises similar problems.
+
+
+11. Why are you linking ZLIB1.DLL to MSVCRT.DLL?
+
+  - MSVCRT.DLL exists on every Windows 95 with a new service pack
+    installed, or with Microsoft Internet Explorer 4 or later, and
+    on all other Windows 4.x or later (Windows 98, Windows NT 4,
+    or later).  It is freely distributable; if not present in the
+    system, it can be downloaded from Microsoft or from other
+    software provider for free.
+
+    The fact that MSVCRT.DLL does not exist on a virgin Windows 95
+    is not so problematic.  Windows 95 is scarcely found nowadays,
+    Microsoft ended its support a long time ago, and many recent
+    applications from various vendors, including Microsoft, do not
+    even run on it.  Furthermore, no serious user should run
+    Windows 95 without a proper update installed.
+
+
+12. Why are you not linking ZLIB1.DLL to
+    <<my favorite C run-time library>> ?
+
+  - We considered and abandoned the following alternatives:
+
+    * Linking ZLIB1.DLL to a static C library (LIBC.LIB, or
+      LIBCMT.LIB) is not a good option.  People are using the DLL
+      mainly to save disk space.  If you are linking your program
+      to a static C library, you may as well consider linking zlib
+      in statically, too.
+
+    * Linking ZLIB1.DLL to CRTDLL.DLL looks appealing, because
+      CRTDLL.DLL is present on every Win32 installation.
+      Unfortunately, it has a series of problems: it does not
+      work properly with Microsoft's C++ libraries, it does not
+      provide support for 64-bit file offsets, (and so on...),
+      and Microsoft discontinued its support a long time ago.
+
+    * Linking ZLIB1.DLL to MSVCR70.DLL or MSVCR71.DLL, supplied
+      with the Microsoft .NET platform, and Visual C++ 7.0/7.1,
+      raises problems related to the status of ZLIB1.DLL as a
+      system component.  According to the Microsoft Knowledge Base
+      article KB326922 "INFO: Redistribution of the Shared C
+      Runtime Component in Visual C++ .NET", MSVCR70.DLL and
+      MSVCR71.DLL are not supposed to function as system DLLs,
+      because they may clash with MSVCRT.DLL.  Instead, the
+      application's installer is supposed to put these DLLs
+      (if needed) in the application's private directory.
+      If ZLIB1.DLL depends on a non-system runtime, it cannot
+      function as a redistributable system component.
+
+    * Linking ZLIB1.DLL to non-Microsoft runtimes, such as
+      Borland's, or Cygwin's, raises problems related to the
+      reliable presence of these runtimes on Win32 systems.
+      It's easier to let the DLL build of zlib up to the people
+      who distribute these runtimes, and who may proceed as
+      explained in the answer to Question 14.
+
+
+13. If ZLIB1.DLL cannot be linked to MSVCR70.DLL or MSVCR71.DLL,
+    how can I build/use ZLIB1.DLL in Microsoft Visual C++ 7.0
+    (Visual Studio .NET) or newer?
+
+  - Due to the problems explained in the Microsoft Knowledge Base
+    article KB326922 (see the previous answer), the C runtime that
+    comes with the VC7 environment is no longer considered a
+    system component.  That is, it should not be assumed that this
+    runtime exists, or may be installed in a system directory.
+    Since ZLIB1.DLL is supposed to be a system component, it may
+    not depend on a non-system component.
+
+    In order to link ZLIB1.DLL and your application to MSVCRT.DLL
+    in VC7, you need the library of Visual C++ 6.0 or older.  If
+    you don't have this library at hand, it's probably best not to
+    use ZLIB1.DLL.
+
+    We are hoping that, in the future, Microsoft will provide a
+    way to build applications linked to a proper system runtime,
+    from the Visual C++ environment.  Until then, you have a
+    couple of alternatives, such as linking zlib in statically.
+    If your application requires dynamic linking, you may proceed
+    as explained in the answer to Question 14.
+
+
+14. I need to link my own DLL build to a CRT different than
+    MSVCRT.DLL.  What can I do?
+
+  - Feel free to rebuild the DLL from the zlib sources, and link
+    it the way you want.  You should, however, clearly state that
+    your build is unofficial.  You should give it a different file
+    name, and/or install it in a private directory that can be
+    accessed by your application only, and is not visible to the
+    others (e.g. it's not in the SYSTEM or the SYSTEM32 directory,
+    and it's not in the PATH).  Otherwise, your build may clash
+    with applications that link to the official build.
+
+    For example, in Cygwin, zlib is linked to the Cygwin runtime
+    CYGWIN1.DLL, and it is distributed under the name CYGZ.DLL.
+
+
+15. May I include additional pieces of code that I find useful,
+    link them in ZLIB1.DLL, and export them?
+
+  - No.  A legitimate build of ZLIB1.DLL must not include code
+    that does not originate from the official zlib source code.
+    But you can make your own private DLL build, under a different
+    file name, as suggested in the previous answer.
+
+    For example, zlib is a part of the VCL library, distributed
+    with Borland Delphi and C++ Builder.  The DLL build of VCL
+    is a redistributable file, named VCLxx.DLL.
+
+
+16. May I remove some functionality out of ZLIB1.DLL, by enabling
+    macros like NO_GZCOMPRESS or NO_GZIP at compile time?
+
+  - No.  A legitimate build of ZLIB1.DLL must provide the complete
+    zlib functionality, as implemented in the official zlib source
+    code.  But you can make your own private DLL build, under a
+    different file name, as suggested in the previous answer.
+
+
+17. I made my own ZLIB1.DLL build.  Can I test it for compliance?
+
+  - We prefer that you download the official DLL from the zlib
+    web site.  If you need something peculiar from this DLL, you
+    can send your suggestion to the zlib mailing list.
+
+    However, in case you do rebuild the DLL yourself, you can run
+    it with the test programs found in the DLL distribution.
+    Running these test programs is not a guarantee of compliance,
+    but a failure can imply a detected problem.
+
+**
+
+This document is written and maintained by
+Cosmin Truta <cosmint@cs.ubbcluj.ro>
diff --git a/updater/zlib123/win32/Makefile.bor b/updater/zlib123/win32/Makefile.bor
new file mode 100644
index 0000000..f7ba86a
--- /dev/null
+++ b/updater/zlib123/win32/Makefile.bor
@@ -0,0 +1,107 @@
+# Makefile for zlib
+# Borland C++ for Win32
+#
+# Updated for zlib 1.2.x by Cosmin Truta, 11-Mar-2003
+# Last updated: 28-Aug-2003
+#
+# Usage:
+#  make -f win32/Makefile.bor
+#  make -f win32/Makefile.bor LOCAL_ZLIB=-DASMV OBJA=match.obj OBJPA=+match.obj
+
+# ------------ Borland C++ ------------
+
+# Optional nonstandard preprocessor flags (e.g. -DMAX_MEM_LEVEL=7)
+# should be added to the environment via "set LOCAL_ZLIB=-DFOO" or
+# added to the declaration of LOC here:
+LOC = $(LOCAL_ZLIB)
+
+CC = bcc32
+AS = bcc32
+LD = bcc32
+AR = tlib
+CFLAGS  = -a -d -k- -O2 $(LOC)
+ASFLAGS = $(LOC)
+LDFLAGS = $(LOC)
+
+
+# variables
+ZLIB_LIB = zlib.lib
+
+OBJ1  = adler32.obj compress.obj crc32.obj deflate.obj gzio.obj infback.obj
+OBJ2  = inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
+#OBJA =
+OBJP1 = +adler32.obj+compress.obj+crc32.obj+deflate.obj+gzio.obj+infback.obj
+OBJP2 = +inffast.obj+inflate.obj+inftrees.obj+trees.obj+uncompr.obj+zutil.obj
+#OBJPA=
+
+
+# targets
+all: $(ZLIB_LIB) example.exe minigzip.exe
+
+.c.obj:
+	$(CC) -c $(CFLAGS) $<
+
+.asm.obj:
+	$(AS) -c $(ASFLAGS) $<
+
+adler32.obj: adler32.c zlib.h zconf.h
+
+compress.obj: compress.c zlib.h zconf.h
+
+crc32.obj: crc32.c zlib.h zconf.h crc32.h
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+
+infback.obj: infback.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+ inffast.h inffixed.h
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+
+trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+
+example.obj: example.c zlib.h zconf.h
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+
+
+# For the sake of the old Borland make,
+# the command line is cut to fit in the MS-DOS 128 byte limit:
+$(ZLIB_LIB): $(OBJ1) $(OBJ2) $(OBJA)
+	-del $(ZLIB_LIB)
+	$(AR) $(ZLIB_LIB) $(OBJP1)
+	$(AR) $(ZLIB_LIB) $(OBJP2)
+	$(AR) $(ZLIB_LIB) $(OBJPA)
+
+
+# testing
+test: example.exe minigzip.exe
+	example
+	echo hello world | minigzip | minigzip -d
+
+example.exe: example.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) example.obj $(ZLIB_LIB)
+
+minigzip.exe: minigzip.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) minigzip.obj $(ZLIB_LIB)
+
+
+# cleanup
+clean:
+	-del *.obj
+	-del *.lib
+	-del *.exe
+	-del *.tds
+	-del zlib.bak
+	-del foo.gz
diff --git a/updater/zlib123/win32/Makefile.emx b/updater/zlib123/win32/Makefile.emx
new file mode 100644
index 0000000..98d0253
--- /dev/null
+++ b/updater/zlib123/win32/Makefile.emx
@@ -0,0 +1,69 @@
+# Makefile for zlib.  Modified for emx/rsxnt by Chr. Spieler, 6/16/98.
+# Copyright (C) 1995-1998 Jean-loup Gailly.
+# For conditions of distribution and use, see copyright notice in zlib.h
+
+# To compile, or to compile and test, type:
+#
+#   make -fmakefile.emx;  make test -fmakefile.emx
+#
+
+CC=gcc -Zwin32
+
+#CFLAGS=-MMD -O
+#CFLAGS=-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7
+#CFLAGS=-MMD -g -DDEBUG
+CFLAGS=-MMD -O3 $(BUTT) -Wall -Wwrite-strings -Wpointer-arith -Wconversion \
+             -Wstrict-prototypes -Wmissing-prototypes
+
+# If cp.exe is available, replace "copy /Y" with "cp -fp" .
+CP=copy /Y
+# If gnu install.exe is available, replace $(CP) with ginstall.
+INSTALL=$(CP)
+# The default value of RM is "rm -f."  If "rm.exe" is found, comment out:
+RM=del
+LDLIBS=-L. -lzlib
+LD=$(CC) -s -o
+LDSHARED=$(CC)
+
+INCL=zlib.h zconf.h
+LIBS=zlib.a
+
+AR=ar rcs
+
+prefix=/usr/local
+exec_prefix = $(prefix)
+
+OBJS = adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o \
+       zutil.o inflate.o infback.o inftrees.o inffast.o
+
+TEST_OBJS = example.o minigzip.o
+
+all: example.exe minigzip.exe
+
+test: all
+	./example
+	echo hello world | .\minigzip | .\minigzip -d
+
+%.o : %.c
+	$(CC) $(CFLAGS) -c $< -o $@
+
+zlib.a: $(OBJS)
+	$(AR) $@ $(OBJS)
+
+%.exe : %.o $(LIBS)
+	$(LD) $@ $< $(LDLIBS)
+
+
+.PHONY : clean
+
+clean:
+	$(RM) *.d
+	$(RM) *.o
+	$(RM) *.exe
+	$(RM) zlib.a
+	$(RM) foo.gz
+
+DEPS := $(wildcard *.d)
+ifneq ($(DEPS),)
+include $(DEPS)
+endif
diff --git a/updater/zlib123/win32/Makefile.gcc b/updater/zlib123/win32/Makefile.gcc
new file mode 100644
index 0000000..2fbfe14
--- /dev/null
+++ b/updater/zlib123/win32/Makefile.gcc
@@ -0,0 +1,141 @@
+# Makefile for zlib, derived from Makefile.dj2.
+# Modified for mingw32 by C. Spieler, 6/16/98.
+# Updated for zlib 1.2.x by Christian Spieler and Cosmin Truta, Mar-2003.
+# Last updated: 1-Aug-2003.
+# Tested under Cygwin and MinGW.
+
+# Copyright (C) 1995-2003 Jean-loup Gailly.
+# For conditions of distribution and use, see copyright notice in zlib.h
+
+# To compile, or to compile and test, type:
+#
+#   make -fmakefile.gcc;  make test testdll -fmakefile.gcc
+#
+# To use the asm code, type:
+#   cp contrib/asm?86/match.S ./match.S
+#   make LOC=-DASMV OBJA=match.o -fmakefile.gcc
+#
+# To install libz.a, zconf.h and zlib.h in the system directories, type:
+#
+#   make install -fmakefile.gcc
+
+# Note:
+# If the platform is *not* MinGW (e.g. it is Cygwin or UWIN),
+# the DLL name should be changed from "zlib1.dll".
+
+STATICLIB = libz.a
+SHAREDLIB = zlib1.dll
+IMPLIB    = libzdll.a
+
+#LOC = -DASMV
+#LOC = -DDEBUG -g
+
+CC = gcc
+CFLAGS = $(LOC) -O3 -Wall
+
+AS = $(CC)
+ASFLAGS = $(LOC) -Wall
+
+LD = $(CC)
+LDFLAGS = $(LOC) -s
+
+AR = ar
+ARFLAGS = rcs
+
+RC = windres
+RCFLAGS = --define GCC_WINDRES
+
+CP = cp -fp
+# If GNU install is available, replace $(CP) with install.
+INSTALL = $(CP)
+RM = rm -f
+
+prefix = /usr/local
+exec_prefix = $(prefix)
+
+OBJS = adler32.o compress.o crc32.o deflate.o gzio.o infback.o \
+       inffast.o inflate.o inftrees.o trees.o uncompr.o zutil.o
+OBJA =
+
+all: $(STATICLIB) $(SHAREDLIB) $(IMPLIB) example minigzip example_d minigzip_d
+
+test: example minigzip
+	./example
+	echo hello world | ./minigzip | ./minigzip -d
+
+testdll: example_d minigzip_d
+	./example_d
+	echo hello world | ./minigzip_d | ./minigzip_d -d
+
+.c.o:
+	$(CC) $(CFLAGS) -c -o $@ $<
+
+.S.o:
+	$(AS) $(ASFLAGS) -c -o $@ $<
+
+$(STATICLIB): $(OBJS) $(OBJA)
+	$(AR) $(ARFLAGS) $@ $(OBJS) $(OBJA)
+
+$(IMPLIB): $(SHAREDLIB)
+
+$(SHAREDLIB): win32/zlib.def $(OBJS) $(OBJA) zlibrc.o
+	dllwrap --driver-name $(CC) --def win32/zlib.def \
+	  --implib $(IMPLIB) -o $@ $(OBJS) $(OBJA) zlibrc.o
+	strip $@
+
+example: example.o $(STATICLIB)
+	$(LD) $(LDFLAGS) -o $@ example.o $(STATICLIB)
+
+minigzip: minigzip.o $(STATICLIB)
+	$(LD) $(LDFLAGS) -o $@ minigzip.o $(STATICLIB)
+
+example_d: example.o $(IMPLIB)
+	$(LD) $(LDFLAGS) -o $@ example.o $(IMPLIB)
+
+minigzip_d: minigzip.o $(IMPLIB)
+	$(LD) $(LDFLAGS) -o $@ minigzip.o $(IMPLIB)
+
+zlibrc.o: win32/zlib1.rc
+	$(RC) $(RCFLAGS) -o $@ win32/zlib1.rc
+
+
+# INCLUDE_PATH and LIBRARY_PATH must be set.
+
+.PHONY: install uninstall clean
+
+install: zlib.h zconf.h $(LIB)
+	-@if not exist $(INCLUDE_PATH)/nul mkdir $(INCLUDE_PATH)
+	-@if not exist $(LIBRARY_PATH)/nul mkdir $(LIBRARY_PATH)
+	-$(INSTALL) zlib.h $(INCLUDE_PATH)
+	-$(INSTALL) zconf.h $(INCLUDE_PATH)
+	-$(INSTALL) $(STATICLIB) $(LIBRARY_PATH)
+	-$(INSTALL) $(IMPLIB) $(LIBRARY_PATH)
+
+uninstall:
+	-$(RM) $(INCLUDE_PATH)/zlib.h
+	-$(RM) $(INCLUDE_PATH)/zconf.h
+	-$(RM) $(LIBRARY_PATH)/$(STATICLIB)
+	-$(RM) $(LIBRARY_PATH)/$(IMPLIB)
+
+clean:
+	-$(RM) $(STATICLIB)
+	-$(RM) $(SHAREDLIB)
+	-$(RM) $(IMPLIB)
+	-$(RM) *.o
+	-$(RM) *.exe
+	-$(RM) foo.gz
+
+adler32.o: zlib.h zconf.h
+compress.o: zlib.h zconf.h
+crc32.o: crc32.h zlib.h zconf.h
+deflate.o: deflate.h zutil.h zlib.h zconf.h
+example.o: zlib.h zconf.h
+gzio.o: zutil.h zlib.h zconf.h
+inffast.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+inflate.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+infback.o: zutil.h zlib.h zconf.h inftrees.h inflate.h inffast.h
+inftrees.o: zutil.h zlib.h zconf.h inftrees.h
+minigzip.o: zlib.h zconf.h
+trees.o: deflate.h zutil.h zlib.h zconf.h trees.h
+uncompr.o: zlib.h zconf.h
+zutil.o: zutil.h zlib.h zconf.h
diff --git a/updater/zlib123/win32/Makefile.msc b/updater/zlib123/win32/Makefile.msc
new file mode 100644
index 0000000..cf17f1e
--- /dev/null
+++ b/updater/zlib123/win32/Makefile.msc
@@ -0,0 +1,126 @@
+# Makefile for zlib -- Microsoft (Visual) C
+#
+# Authors:
+#   Cosmin Truta, 11-Mar-2003
+#   Christian Spieler, 19-Mar-2003
+#
+# Last updated:
+#   Cosmin Truta, 27-Aug-2003
+#
+# Usage:
+#   nmake -f win32/Makefile.msc            (standard build)
+#   nmake -f win32/Makefile.msc LOC=-DFOO  (nonstandard build)
+#   nmake -f win32/Makefile.msc LOC=-DASMV OBJA=match.obj  (use ASM code)
+
+
+# optional build flags
+LOC =
+
+
+# variables
+STATICLIB = zlib.lib
+SHAREDLIB = zlib1.dll
+IMPLIB    = zdll.lib
+
+CC = cl
+AS = ml
+LD = link
+AR = lib
+RC = rc
+CFLAGS  = -nologo -MD -O2 $(LOC)
+ASFLAGS = -coff
+LDFLAGS = -nologo -release
+ARFLAGS = -nologo
+RCFLAGS = /dWIN32 /r
+
+OBJS = adler32.obj compress.obj crc32.obj deflate.obj gzio.obj infback.obj \
+       inffast.obj inflate.obj inftrees.obj trees.obj uncompr.obj zutil.obj
+OBJA =
+
+
+# targets
+all: $(STATICLIB) $(SHAREDLIB) $(IMPLIB) \
+     example.exe minigzip.exe example_d.exe minigzip_d.exe
+
+$(STATICLIB): $(OBJS) $(OBJA)
+	$(AR) $(ARFLAGS) -out:$@ $(OBJS) $(OBJA)
+
+$(IMPLIB): $(SHAREDLIB)
+
+$(SHAREDLIB): win32/zlib.def $(OBJS) $(OBJA) zlib1.res
+	$(LD) $(LDFLAGS) -def:win32/zlib.def -dll -implib:$(IMPLIB) \
+	  -out:$@ $(OBJS) $(OBJA) zlib1.res
+
+example.exe: example.obj $(STATICLIB)
+	$(LD) $(LDFLAGS) example.obj $(STATICLIB)
+
+minigzip.exe: minigzip.obj $(STATICLIB)
+	$(LD) $(LDFLAGS) minigzip.obj $(STATICLIB)
+
+example_d.exe: example.obj $(IMPLIB)
+	$(LD) $(LDFLAGS) -out:$@ example.obj $(IMPLIB)
+
+minigzip_d.exe: minigzip.obj $(IMPLIB)
+	$(LD) $(LDFLAGS) -out:$@ minigzip.obj $(IMPLIB)
+
+.c.obj:
+	$(CC) -c $(CFLAGS) $<
+
+.asm.obj:
+	$(AS) -c $(ASFLAGS) $<
+
+adler32.obj: adler32.c zlib.h zconf.h
+
+compress.obj: compress.c zlib.h zconf.h
+
+crc32.obj: crc32.c zlib.h zconf.h crc32.h
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+
+infback.obj: infback.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+             inffast.h inffixed.h
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+             inffast.h
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h inftrees.h inflate.h \
+             inffast.h inffixed.h
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+
+trees.obj: trees.c zutil.h zlib.h zconf.h deflate.h trees.h
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+
+example.obj: example.c zlib.h zconf.h
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+
+zlib1.res: win32/zlib1.rc
+	$(RC) $(RCFLAGS) /fo$@ win32/zlib1.rc
+
+
+# testing
+test: example.exe minigzip.exe
+	example
+	echo hello world | minigzip | minigzip -d
+
+testdll: example_d.exe minigzip_d.exe
+	example_d
+	echo hello world | minigzip_d | minigzip_d -d
+
+
+# cleanup
+clean:
+	-del $(STATICLIB)
+	-del $(SHAREDLIB)
+	-del $(IMPLIB)
+	-del *.obj
+	-del *.res
+	-del *.exp
+	-del *.exe
+	-del foo.gz
diff --git a/updater/zlib123/win32/VisualC.txt b/updater/zlib123/win32/VisualC.txt
new file mode 100644
index 0000000..f3d3e43
--- /dev/null
+++ b/updater/zlib123/win32/VisualC.txt
@@ -0,0 +1,3 @@
+
+To build zlib using the Microsoft Visual C++ environment,
+use the appropriate project from the projects/ directory.
diff --git a/updater/zlib123/win32/zlib.def b/updater/zlib123/win32/zlib.def
new file mode 100644
index 0000000..03bcf1c
--- /dev/null
+++ b/updater/zlib123/win32/zlib.def
@@ -0,0 +1,60 @@
+LIBRARY
+; zlib data compression library
+
+EXPORTS
+; basic functions
+    zlibVersion
+    deflate
+    deflateEnd
+    inflate
+    inflateEnd
+; advanced functions
+    deflateSetDictionary
+    deflateCopy
+    deflateReset
+    deflateParams
+    deflateBound
+    deflatePrime
+    inflateSetDictionary
+    inflateSync
+    inflateCopy
+    inflateReset
+    inflateBack
+    inflateBackEnd
+    zlibCompileFlags
+; utility functions
+    compress
+    compress2
+    compressBound
+    uncompress
+    gzopen
+    gzdopen
+    gzsetparams
+    gzread
+    gzwrite
+    gzprintf
+    gzputs
+    gzgets
+    gzputc
+    gzgetc
+    gzungetc
+    gzflush
+    gzseek
+    gzrewind
+    gztell
+    gzeof
+    gzclose
+    gzerror
+    gzclearerr
+; checksum functions
+    adler32
+    crc32
+; various hacks, don't look :)
+    deflateInit_
+    deflateInit2_
+    inflateInit_
+    inflateInit2_
+    inflateBackInit_
+    inflateSyncPoint
+    get_crc_table
+    zError
diff --git a/updater/zlib123/win32/zlib1.rc b/updater/zlib123/win32/zlib1.rc
new file mode 100644
index 0000000..023a843
--- /dev/null
+++ b/updater/zlib123/win32/zlib1.rc
@@ -0,0 +1,39 @@
+#include <windows.h>
+
+#ifdef GCC_WINDRES
+VS_VERSION_INFO		VERSIONINFO
+#else
+VS_VERSION_INFO		VERSIONINFO	MOVEABLE IMPURE LOADONCALL DISCARDABLE
+#endif
+  FILEVERSION		1,2,2,0
+  PRODUCTVERSION	1,2,2,0
+  FILEFLAGSMASK		VS_FFI_FILEFLAGSMASK
+#ifdef _DEBUG
+  FILEFLAGS		1
+#else
+  FILEFLAGS		0
+#endif
+  FILEOS		VOS_DOS_WINDOWS32
+  FILETYPE		VFT_DLL
+  FILESUBTYPE		0	// not used
+BEGIN
+  BLOCK "StringFileInfo"
+  BEGIN
+    BLOCK "040904E4"
+    //language ID = U.S. English, char set = Windows, Multilingual
+    BEGIN
+      VALUE "FileDescription",	"zlib data compression library\0"
+      VALUE "FileVersion",	"1.2.3\0"
+      VALUE "InternalName",	"zlib1.dll\0"
+      VALUE "LegalCopyright",	"(C) 1995-2004 Jean-loup Gailly & Mark Adler\0"
+      VALUE "OriginalFilename",	"zlib1.dll\0"
+      VALUE "ProductName",	"zlib\0"
+      VALUE "ProductVersion",	"1.2.3\0"
+      VALUE "Comments","DLL support by Alessandro Iacopetti & Gilles Vollant\0"
+    END
+  END
+  BLOCK "VarFileInfo"
+  BEGIN
+    VALUE "Translation", 0x0409, 1252
+  END
+END
diff --git a/updater/zlib123/zconf.h b/updater/zlib123/zconf.h
new file mode 100644
index 0000000..e3b0c96
--- /dev/null
+++ b/updater/zlib123/zconf.h
@@ -0,0 +1,332 @@
+/* zconf.h -- configuration of the zlib compression library
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#ifndef ZCONF_H
+#define ZCONF_H
+
+/*
+ * If you *really* need a unique prefix for all types and library functions,
+ * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it.
+ */
+#ifdef Z_PREFIX
+#  define deflateInit_          z_deflateInit_
+#  define deflate               z_deflate
+#  define deflateEnd            z_deflateEnd
+#  define inflateInit_          z_inflateInit_
+#  define inflate               z_inflate
+#  define inflateEnd            z_inflateEnd
+#  define deflateInit2_         z_deflateInit2_
+#  define deflateSetDictionary  z_deflateSetDictionary
+#  define deflateCopy           z_deflateCopy
+#  define deflateReset          z_deflateReset
+#  define deflateParams         z_deflateParams
+#  define deflateBound          z_deflateBound
+#  define deflatePrime          z_deflatePrime
+#  define inflateInit2_         z_inflateInit2_
+#  define inflateSetDictionary  z_inflateSetDictionary
+#  define inflateSync           z_inflateSync
+#  define inflateSyncPoint      z_inflateSyncPoint
+#  define inflateCopy           z_inflateCopy
+#  define inflateReset          z_inflateReset
+#  define inflateBack           z_inflateBack
+#  define inflateBackEnd        z_inflateBackEnd
+#  define compress              z_compress
+#  define compress2             z_compress2
+#  define compressBound         z_compressBound
+#  define uncompress            z_uncompress
+#  define adler32               z_adler32
+#  define crc32                 z_crc32
+#  define get_crc_table         z_get_crc_table
+#  define zError                z_zError
+
+#  define alloc_func            z_alloc_func
+#  define free_func             z_free_func
+#  define in_func               z_in_func
+#  define out_func              z_out_func
+#  define Byte                  z_Byte
+#  define uInt                  z_uInt
+#  define uLong                 z_uLong
+#  define Bytef                 z_Bytef
+#  define charf                 z_charf
+#  define intf                  z_intf
+#  define uIntf                 z_uIntf
+#  define uLongf                z_uLongf
+#  define voidpf                z_voidpf
+#  define voidp                 z_voidp
+#endif
+
+#if defined(__MSDOS__) && !defined(MSDOS)
+#  define MSDOS
+#endif
+#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2)
+#  define OS2
+#endif
+#if defined(_WINDOWS) && !defined(WINDOWS)
+#  define WINDOWS
+#endif
+#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__)
+#  ifndef WIN32
+#    define WIN32
+#  endif
+#endif
+#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32)
+#  if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__)
+#    ifndef SYS16BIT
+#      define SYS16BIT
+#    endif
+#  endif
+#endif
+
+/*
+ * Compile with -DMAXSEG_64K if the alloc function cannot allocate more
+ * than 64k bytes at a time (needed on systems with 16-bit int).
+ */
+#ifdef SYS16BIT
+#  define MAXSEG_64K
+#endif
+#ifdef MSDOS
+#  define UNALIGNED_OK
+#endif
+
+#ifdef __STDC_VERSION__
+#  ifndef STDC
+#    define STDC
+#  endif
+#  if __STDC_VERSION__ >= 199901L
+#    ifndef STDC99
+#      define STDC99
+#    endif
+#  endif
+#endif
+#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus))
+#  define STDC
+#endif
+#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__))
+#  define STDC
+#endif
+#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32))
+#  define STDC
+#endif
+#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__))
+#  define STDC
+#endif
+
+#if defined(__OS400__) && !defined(STDC)    /* iSeries (formerly AS/400). */
+#  define STDC
+#endif
+
+#ifndef STDC
+#  ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */
+#    define const       /* note: need a more gentle solution here */
+#  endif
+#endif
+
+/* Some Mac compilers merge all .h files incorrectly: */
+#if defined(__MWERKS__)||defined(applec)||defined(THINK_C)||defined(__SC__)
+#  define NO_DUMMY_DECL
+#endif
+
+/* Maximum value for memLevel in deflateInit2 */
+#ifndef MAX_MEM_LEVEL
+#  ifdef MAXSEG_64K
+#    define MAX_MEM_LEVEL 8
+#  else
+#    define MAX_MEM_LEVEL 9
+#  endif
+#endif
+
+/* Maximum value for windowBits in deflateInit2 and inflateInit2.
+ * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files
+ * created by gzip. (Files created by minigzip can still be extracted by
+ * gzip.)
+ */
+#ifndef MAX_WBITS
+#  define MAX_WBITS   15 /* 32K LZ77 window */
+#endif
+
+/* The memory requirements for deflate are (in bytes):
+            (1 << (windowBits+2)) +  (1 << (memLevel+9))
+ that is: 128K for windowBits=15  +  128K for memLevel = 8  (default values)
+ plus a few kilobytes for small objects. For example, if you want to reduce
+ the default memory requirements from 256K to 128K, compile with
+     make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
+ Of course this will generally degrade compression (there's no free lunch).
+
+   The memory requirements for inflate are (in bytes) 1 << windowBits
+ that is, 32K for windowBits=15 (default value) plus a few kilobytes
+ for small objects.
+*/
+
+                        /* Type declarations */
+
+#ifndef OF /* function prototypes */
+#  ifdef STDC
+#    define OF(args)  args
+#  else
+#    define OF(args)  ()
+#  endif
+#endif
+
+/* The following definitions for FAR are needed only for MSDOS mixed
+ * model programming (small or medium model with some far allocations).
+ * This was tested only with MSC; for other MSDOS compilers you may have
+ * to define NO_MEMCPY in zutil.h.  If you don't need the mixed model,
+ * just define FAR to be empty.
+ */
+#ifdef SYS16BIT
+#  if defined(M_I86SM) || defined(M_I86MM)
+     /* MSC small or medium model */
+#    define SMALL_MEDIUM
+#    ifdef _MSC_VER
+#      define FAR _far
+#    else
+#      define FAR far
+#    endif
+#  endif
+#  if (defined(__SMALL__) || defined(__MEDIUM__))
+     /* Turbo C small or medium model */
+#    define SMALL_MEDIUM
+#    ifdef __BORLANDC__
+#      define FAR _far
+#    else
+#      define FAR far
+#    endif
+#  endif
+#endif
+
+#if defined(WINDOWS) || defined(WIN32)
+   /* If building or using zlib as a DLL, define ZLIB_DLL.
+    * This is not mandatory, but it offers a little performance increase.
+    */
+#  ifdef ZLIB_DLL
+#    if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500))
+#      ifdef ZLIB_INTERNAL
+#        define ZEXTERN extern __declspec(dllexport)
+#      else
+#        define ZEXTERN extern __declspec(dllimport)
+#      endif
+#    endif
+#  endif  /* ZLIB_DLL */
+   /* If building or using zlib with the WINAPI/WINAPIV calling convention,
+    * define ZLIB_WINAPI.
+    * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI.
+    */
+#  ifdef ZLIB_WINAPI
+#    ifdef FAR
+#      undef FAR
+#    endif
+#    include <windows.h>
+     /* No need for _export, use ZLIB.DEF instead. */
+     /* For complete Windows compatibility, use WINAPI, not __stdcall. */
+#    define ZEXPORT WINAPI
+#    ifdef WIN32
+#      define ZEXPORTVA WINAPIV
+#    else
+#      define ZEXPORTVA FAR CDECL
+#    endif
+#  endif
+#endif
+
+#if defined (__BEOS__)
+#  ifdef ZLIB_DLL
+#    ifdef ZLIB_INTERNAL
+#      define ZEXPORT   __declspec(dllexport)
+#      define ZEXPORTVA __declspec(dllexport)
+#    else
+#      define ZEXPORT   __declspec(dllimport)
+#      define ZEXPORTVA __declspec(dllimport)
+#    endif
+#  endif
+#endif
+
+#ifndef ZEXTERN
+#  define ZEXTERN extern
+#endif
+#ifndef ZEXPORT
+#  define ZEXPORT
+#endif
+#ifndef ZEXPORTVA
+#  define ZEXPORTVA
+#endif
+
+#ifndef FAR
+#  define FAR
+#endif
+
+#if !defined(__MACTYPES__)
+typedef unsigned char  Byte;  /* 8 bits */
+#endif
+typedef unsigned int   uInt;  /* 16 bits or more */
+typedef unsigned long  uLong; /* 32 bits or more */
+
+#ifdef SMALL_MEDIUM
+   /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */
+#  define Bytef Byte FAR
+#else
+   typedef Byte  FAR Bytef;
+#endif
+typedef char  FAR charf;
+typedef int   FAR intf;
+typedef uInt  FAR uIntf;
+typedef uLong FAR uLongf;
+
+#ifdef STDC
+   typedef void const *voidpc;
+   typedef void FAR   *voidpf;
+   typedef void       *voidp;
+#else
+   typedef Byte const *voidpc;
+   typedef Byte FAR   *voidpf;
+   typedef Byte       *voidp;
+#endif
+
+#if 0           /* HAVE_UNISTD_H -- this line is updated by ./configure */
+#  include <sys/types.h> /* for off_t */
+#  include <unistd.h>    /* for SEEK_* and off_t */
+#  ifdef VMS
+#    include <unixio.h>   /* for off_t */
+#  endif
+#  define z_off_t off_t
+#endif
+#ifndef SEEK_SET
+#  define SEEK_SET        0       /* Seek from beginning of file.  */
+#  define SEEK_CUR        1       /* Seek from current position.  */
+#  define SEEK_END        2       /* Set file pointer to EOF plus "offset" */
+#endif
+#ifndef z_off_t
+#  define z_off_t long
+#endif
+
+#if defined(__OS400__)
+#  define NO_vsnprintf
+#endif
+
+#if defined(__MVS__)
+#  define NO_vsnprintf
+#  ifdef FAR
+#    undef FAR
+#  endif
+#endif
+
+/* MVS linker does not support external names larger than 8 bytes */
+#if defined(__MVS__)
+#   pragma map(deflateInit_,"DEIN")
+#   pragma map(deflateInit2_,"DEIN2")
+#   pragma map(deflateEnd,"DEEND")
+#   pragma map(deflateBound,"DEBND")
+#   pragma map(inflateInit_,"ININ")
+#   pragma map(inflateInit2_,"ININ2")
+#   pragma map(inflateEnd,"INEND")
+#   pragma map(inflateSync,"INSY")
+#   pragma map(inflateSetDictionary,"INSEDI")
+#   pragma map(compressBound,"CMBND")
+#   pragma map(inflate_table,"INTABL")
+#   pragma map(inflate_fast,"INFA")
+#   pragma map(inflate_copyright,"INCOPY")
+#endif
+
+#endif /* ZCONF_H */
diff --git a/updater/zlib123/zconf.in.h b/updater/zlib123/zconf.in.h
new file mode 100644
index 0000000..e3b0c96
--- /dev/null
+++ b/updater/zlib123/zconf.in.h
@@ -0,0 +1,332 @@
+/* zconf.h -- configuration of the zlib compression library
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#ifndef ZCONF_H
+#define ZCONF_H
+
+/*
+ * If you *really* need a unique prefix for all types and library functions,
+ * compile with -DZ_PREFIX. The "standard" zlib should be compiled without it.
+ */
+#ifdef Z_PREFIX
+#  define deflateInit_          z_deflateInit_
+#  define deflate               z_deflate
+#  define deflateEnd            z_deflateEnd
+#  define inflateInit_          z_inflateInit_
+#  define inflate               z_inflate
+#  define inflateEnd            z_inflateEnd
+#  define deflateInit2_         z_deflateInit2_
+#  define deflateSetDictionary  z_deflateSetDictionary
+#  define deflateCopy           z_deflateCopy
+#  define deflateReset          z_deflateReset
+#  define deflateParams         z_deflateParams
+#  define deflateBound          z_deflateBound
+#  define deflatePrime          z_deflatePrime
+#  define inflateInit2_         z_inflateInit2_
+#  define inflateSetDictionary  z_inflateSetDictionary
+#  define inflateSync           z_inflateSync
+#  define inflateSyncPoint      z_inflateSyncPoint
+#  define inflateCopy           z_inflateCopy
+#  define inflateReset          z_inflateReset
+#  define inflateBack           z_inflateBack
+#  define inflateBackEnd        z_inflateBackEnd
+#  define compress              z_compress
+#  define compress2             z_compress2
+#  define compressBound         z_compressBound
+#  define uncompress            z_uncompress
+#  define adler32               z_adler32
+#  define crc32                 z_crc32
+#  define get_crc_table         z_get_crc_table
+#  define zError                z_zError
+
+#  define alloc_func            z_alloc_func
+#  define free_func             z_free_func
+#  define in_func               z_in_func
+#  define out_func              z_out_func
+#  define Byte                  z_Byte
+#  define uInt                  z_uInt
+#  define uLong                 z_uLong
+#  define Bytef                 z_Bytef
+#  define charf                 z_charf
+#  define intf                  z_intf
+#  define uIntf                 z_uIntf
+#  define uLongf                z_uLongf
+#  define voidpf                z_voidpf
+#  define voidp                 z_voidp
+#endif
+
+#if defined(__MSDOS__) && !defined(MSDOS)
+#  define MSDOS
+#endif
+#if (defined(OS_2) || defined(__OS2__)) && !defined(OS2)
+#  define OS2
+#endif
+#if defined(_WINDOWS) && !defined(WINDOWS)
+#  define WINDOWS
+#endif
+#if defined(_WIN32) || defined(_WIN32_WCE) || defined(__WIN32__)
+#  ifndef WIN32
+#    define WIN32
+#  endif
+#endif
+#if (defined(MSDOS) || defined(OS2) || defined(WINDOWS)) && !defined(WIN32)
+#  if !defined(__GNUC__) && !defined(__FLAT__) && !defined(__386__)
+#    ifndef SYS16BIT
+#      define SYS16BIT
+#    endif
+#  endif
+#endif
+
+/*
+ * Compile with -DMAXSEG_64K if the alloc function cannot allocate more
+ * than 64k bytes at a time (needed on systems with 16-bit int).
+ */
+#ifdef SYS16BIT
+#  define MAXSEG_64K
+#endif
+#ifdef MSDOS
+#  define UNALIGNED_OK
+#endif
+
+#ifdef __STDC_VERSION__
+#  ifndef STDC
+#    define STDC
+#  endif
+#  if __STDC_VERSION__ >= 199901L
+#    ifndef STDC99
+#      define STDC99
+#    endif
+#  endif
+#endif
+#if !defined(STDC) && (defined(__STDC__) || defined(__cplusplus))
+#  define STDC
+#endif
+#if !defined(STDC) && (defined(__GNUC__) || defined(__BORLANDC__))
+#  define STDC
+#endif
+#if !defined(STDC) && (defined(MSDOS) || defined(WINDOWS) || defined(WIN32))
+#  define STDC
+#endif
+#if !defined(STDC) && (defined(OS2) || defined(__HOS_AIX__))
+#  define STDC
+#endif
+
+#if defined(__OS400__) && !defined(STDC)    /* iSeries (formerly AS/400). */
+#  define STDC
+#endif
+
+#ifndef STDC
+#  ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */
+#    define const       /* note: need a more gentle solution here */
+#  endif
+#endif
+
+/* Some Mac compilers merge all .h files incorrectly: */
+#if defined(__MWERKS__)||defined(applec)||defined(THINK_C)||defined(__SC__)
+#  define NO_DUMMY_DECL
+#endif
+
+/* Maximum value for memLevel in deflateInit2 */
+#ifndef MAX_MEM_LEVEL
+#  ifdef MAXSEG_64K
+#    define MAX_MEM_LEVEL 8
+#  else
+#    define MAX_MEM_LEVEL 9
+#  endif
+#endif
+
+/* Maximum value for windowBits in deflateInit2 and inflateInit2.
+ * WARNING: reducing MAX_WBITS makes minigzip unable to extract .gz files
+ * created by gzip. (Files created by minigzip can still be extracted by
+ * gzip.)
+ */
+#ifndef MAX_WBITS
+#  define MAX_WBITS   15 /* 32K LZ77 window */
+#endif
+
+/* The memory requirements for deflate are (in bytes):
+            (1 << (windowBits+2)) +  (1 << (memLevel+9))
+ that is: 128K for windowBits=15  +  128K for memLevel = 8  (default values)
+ plus a few kilobytes for small objects. For example, if you want to reduce
+ the default memory requirements from 256K to 128K, compile with
+     make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
+ Of course this will generally degrade compression (there's no free lunch).
+
+   The memory requirements for inflate are (in bytes) 1 << windowBits
+ that is, 32K for windowBits=15 (default value) plus a few kilobytes
+ for small objects.
+*/
+
+                        /* Type declarations */
+
+#ifndef OF /* function prototypes */
+#  ifdef STDC
+#    define OF(args)  args
+#  else
+#    define OF(args)  ()
+#  endif
+#endif
+
+/* The following definitions for FAR are needed only for MSDOS mixed
+ * model programming (small or medium model with some far allocations).
+ * This was tested only with MSC; for other MSDOS compilers you may have
+ * to define NO_MEMCPY in zutil.h.  If you don't need the mixed model,
+ * just define FAR to be empty.
+ */
+#ifdef SYS16BIT
+#  if defined(M_I86SM) || defined(M_I86MM)
+     /* MSC small or medium model */
+#    define SMALL_MEDIUM
+#    ifdef _MSC_VER
+#      define FAR _far
+#    else
+#      define FAR far
+#    endif
+#  endif
+#  if (defined(__SMALL__) || defined(__MEDIUM__))
+     /* Turbo C small or medium model */
+#    define SMALL_MEDIUM
+#    ifdef __BORLANDC__
+#      define FAR _far
+#    else
+#      define FAR far
+#    endif
+#  endif
+#endif
+
+#if defined(WINDOWS) || defined(WIN32)
+   /* If building or using zlib as a DLL, define ZLIB_DLL.
+    * This is not mandatory, but it offers a little performance increase.
+    */
+#  ifdef ZLIB_DLL
+#    if defined(WIN32) && (!defined(__BORLANDC__) || (__BORLANDC__ >= 0x500))
+#      ifdef ZLIB_INTERNAL
+#        define ZEXTERN extern __declspec(dllexport)
+#      else
+#        define ZEXTERN extern __declspec(dllimport)
+#      endif
+#    endif
+#  endif  /* ZLIB_DLL */
+   /* If building or using zlib with the WINAPI/WINAPIV calling convention,
+    * define ZLIB_WINAPI.
+    * Caution: the standard ZLIB1.DLL is NOT compiled using ZLIB_WINAPI.
+    */
+#  ifdef ZLIB_WINAPI
+#    ifdef FAR
+#      undef FAR
+#    endif
+#    include <windows.h>
+     /* No need for _export, use ZLIB.DEF instead. */
+     /* For complete Windows compatibility, use WINAPI, not __stdcall. */
+#    define ZEXPORT WINAPI
+#    ifdef WIN32
+#      define ZEXPORTVA WINAPIV
+#    else
+#      define ZEXPORTVA FAR CDECL
+#    endif
+#  endif
+#endif
+
+#if defined (__BEOS__)
+#  ifdef ZLIB_DLL
+#    ifdef ZLIB_INTERNAL
+#      define ZEXPORT   __declspec(dllexport)
+#      define ZEXPORTVA __declspec(dllexport)
+#    else
+#      define ZEXPORT   __declspec(dllimport)
+#      define ZEXPORTVA __declspec(dllimport)
+#    endif
+#  endif
+#endif
+
+#ifndef ZEXTERN
+#  define ZEXTERN extern
+#endif
+#ifndef ZEXPORT
+#  define ZEXPORT
+#endif
+#ifndef ZEXPORTVA
+#  define ZEXPORTVA
+#endif
+
+#ifndef FAR
+#  define FAR
+#endif
+
+#if !defined(__MACTYPES__)
+typedef unsigned char  Byte;  /* 8 bits */
+#endif
+typedef unsigned int   uInt;  /* 16 bits or more */
+typedef unsigned long  uLong; /* 32 bits or more */
+
+#ifdef SMALL_MEDIUM
+   /* Borland C/C++ and some old MSC versions ignore FAR inside typedef */
+#  define Bytef Byte FAR
+#else
+   typedef Byte  FAR Bytef;
+#endif
+typedef char  FAR charf;
+typedef int   FAR intf;
+typedef uInt  FAR uIntf;
+typedef uLong FAR uLongf;
+
+#ifdef STDC
+   typedef void const *voidpc;
+   typedef void FAR   *voidpf;
+   typedef void       *voidp;
+#else
+   typedef Byte const *voidpc;
+   typedef Byte FAR   *voidpf;
+   typedef Byte       *voidp;
+#endif
+
+#if 0           /* HAVE_UNISTD_H -- this line is updated by ./configure */
+#  include <sys/types.h> /* for off_t */
+#  include <unistd.h>    /* for SEEK_* and off_t */
+#  ifdef VMS
+#    include <unixio.h>   /* for off_t */
+#  endif
+#  define z_off_t off_t
+#endif
+#ifndef SEEK_SET
+#  define SEEK_SET        0       /* Seek from beginning of file.  */
+#  define SEEK_CUR        1       /* Seek from current position.  */
+#  define SEEK_END        2       /* Set file pointer to EOF plus "offset" */
+#endif
+#ifndef z_off_t
+#  define z_off_t long
+#endif
+
+#if defined(__OS400__)
+#  define NO_vsnprintf
+#endif
+
+#if defined(__MVS__)
+#  define NO_vsnprintf
+#  ifdef FAR
+#    undef FAR
+#  endif
+#endif
+
+/* MVS linker does not support external names larger than 8 bytes */
+#if defined(__MVS__)
+#   pragma map(deflateInit_,"DEIN")
+#   pragma map(deflateInit2_,"DEIN2")
+#   pragma map(deflateEnd,"DEEND")
+#   pragma map(deflateBound,"DEBND")
+#   pragma map(inflateInit_,"ININ")
+#   pragma map(inflateInit2_,"ININ2")
+#   pragma map(inflateEnd,"INEND")
+#   pragma map(inflateSync,"INSY")
+#   pragma map(inflateSetDictionary,"INSEDI")
+#   pragma map(compressBound,"CMBND")
+#   pragma map(inflate_table,"INTABL")
+#   pragma map(inflate_fast,"INFA")
+#   pragma map(inflate_copyright,"INCOPY")
+#endif
+
+#endif /* ZCONF_H */
diff --git a/updater/zlib123/zlib.3 b/updater/zlib123/zlib.3
new file mode 100644
index 0000000..f6b0da1
--- /dev/null
+++ b/updater/zlib123/zlib.3
@@ -0,0 +1,159 @@
+.TH ZLIB 3 "18 July 2005"
+.SH NAME
+zlib \- compression/decompression library
+.SH SYNOPSIS
+[see
+.I zlib.h
+for full description]
+.SH DESCRIPTION
+The
+.I zlib
+library is a general purpose data compression library.
+The code is thread safe.
+It provides in-memory compression and decompression functions,
+including integrity checks of the uncompressed data.
+This version of the library supports only one compression method (deflation)
+but other algorithms will be added later
+and will have the same stream interface.
+.LP
+Compression can be done in a single step if the buffers are large enough
+(for example if an input file is mmap'ed),
+or can be done by repeated calls of the compression function.
+In the latter case,
+the application must provide more input and/or consume the output
+(providing more output space) before each call.
+.LP
+The library also supports reading and writing files in
+.IR gzip (1)
+(.gz) format
+with an interface similar to that of stdio.
+.LP
+The library does not install any signal handler.
+The decoder checks the consistency of the compressed data,
+so the library should never crash even in case of corrupted input.
+.LP
+All functions of the compression library are documented in the file
+.IR zlib.h .
+The distribution source includes examples of use of the library
+in the files
+.I example.c
+and
+.IR minigzip.c .
+.LP
+Changes to this version are documented in the file
+.I ChangeLog
+that accompanies the source,
+and are concerned primarily with bug fixes and portability enhancements.
+.LP
+A Java implementation of
+.I zlib
+is available in the Java Development Kit 1.1:
+.IP
+http://www.javasoft.com/products/JDK/1.1/docs/api/Package-java.util.zip.html
+.LP
+A Perl interface to
+.IR zlib ,
+written by Paul Marquess (pmqs@cpan.org),
+is available at CPAN (Comprehensive Perl Archive Network) sites,
+including:
+.IP
+http://www.cpan.org/modules/by-module/Compress/
+.LP
+A Python interface to
+.IR zlib ,
+written by A.M. Kuchling (amk@magnet.com),
+is available in Python 1.5 and later versions:
+.IP
+http://www.python.org/doc/lib/module-zlib.html
+.LP
+A
+.I zlib
+binding for
+.IR tcl (1),
+written by Andreas Kupries (a.kupries@westend.com),
+is availlable at:
+.IP
+http://www.westend.com/~kupries/doc/trf/man/man.html
+.LP
+An experimental package to read and write files in .zip format,
+written on top of
+.I zlib
+by Gilles Vollant (info@winimage.com),
+is available at:
+.IP
+http://www.winimage.com/zLibDll/unzip.html
+and also in the
+.I contrib/minizip
+directory of the main
+.I zlib
+web site.
+.SH "SEE ALSO"
+The
+.I zlib
+web site can be found at either of these locations:
+.IP
+http://www.zlib.org
+.br
+http://www.gzip.org/zlib/
+.LP
+The data format used by the zlib library is described by RFC
+(Request for Comments) 1950 to 1952 in the files:
+.IP
+http://www.ietf.org/rfc/rfc1950.txt (concerning zlib format)
+.br
+http://www.ietf.org/rfc/rfc1951.txt (concerning deflate format)
+.br
+http://www.ietf.org/rfc/rfc1952.txt (concerning gzip format)
+.LP
+These documents are also available in other formats from:
+.IP
+ftp://ftp.uu.net/graphics/png/documents/zlib/zdoc-index.html
+.LP
+Mark Nelson (markn@ieee.org) wrote an article about
+.I zlib
+for the Jan. 1997 issue of  Dr. Dobb's Journal;
+a copy of the article is available at:
+.IP
+http://dogma.net/markn/articles/zlibtool/zlibtool.htm
+.SH "REPORTING PROBLEMS"
+Before reporting a problem,
+please check the
+.I zlib
+web site to verify that you have the latest version of
+.IR zlib ;
+otherwise,
+obtain the latest version and see if the problem still exists.
+Please read the
+.I zlib
+FAQ at:
+.IP
+http://www.gzip.org/zlib/zlib_faq.html
+.LP
+before asking for help.
+Send questions and/or comments to zlib@gzip.org,
+or (for the Windows DLL version) to Gilles Vollant (info@winimage.com).
+.SH AUTHORS
+Version 1.2.3
+Copyright (C) 1995-2005 Jean-loup Gailly (jloup@gzip.org)
+and Mark Adler (madler@alumni.caltech.edu).
+.LP
+This software is provided "as-is,"
+without any express or implied warranty.
+In no event will the authors be held liable for any damages
+arising from the use of this software.
+See the distribution directory with respect to requirements
+governing redistribution.
+The deflate format used by
+.I zlib
+was defined by Phil Katz.
+The deflate and
+.I zlib
+specifications were written by L. Peter Deutsch.
+Thanks to all the people who reported problems and suggested various
+improvements in
+.IR zlib ;
+who are too numerous to cite here.
+.LP
+UNIX manual page by R. P. C. Rodgers,
+U.S. National Library of Medicine (rodgers@nlm.nih.gov).
+.\" end of man page
diff --git a/updater/zlib123/zlib.h b/updater/zlib123/zlib.h
new file mode 100644
index 0000000..62d0e46
--- /dev/null
+++ b/updater/zlib123/zlib.h
@@ -0,0 +1,1357 @@
+/* zlib.h -- interface of the 'zlib' general purpose compression library
+  version 1.2.3, July 18th, 2005
+
+  Copyright (C) 1995-2005 Jean-loup Gailly and Mark Adler
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the authors be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Jean-loup Gailly        Mark Adler
+  jloup@gzip.org          madler@alumni.caltech.edu
+
+
+  The data format used by the zlib library is described by RFCs (Request for
+  Comments) 1950 to 1952 in the files http://www.ietf.org/rfc/rfc1950.txt
+  (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).
+*/
+
+#ifndef ZLIB_H
+#define ZLIB_H
+
+#include "zconf.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#define ZLIB_VERSION "1.2.3"
+#define ZLIB_VERNUM 0x1230
+
+/*
+     The 'zlib' compression library provides in-memory compression and
+  decompression functions, including integrity checks of the uncompressed
+  data.  This version of the library supports only one compression method
+  (deflation) but other algorithms will be added later and will have the same
+  stream interface.
+
+     Compression can be done in a single step if the buffers are large
+  enough (for example if an input file is mmap'ed), or can be done by
+  repeated calls of the compression function.  In the latter case, the
+  application must provide more input and/or consume the output
+  (providing more output space) before each call.
+
+     The compressed data format used by default by the in-memory functions is
+  the zlib format, which is a zlib wrapper documented in RFC 1950, wrapped
+  around a deflate stream, which is itself documented in RFC 1951.
+
+     The library also supports reading and writing files in gzip (.gz) format
+  with an interface similar to that of stdio using the functions that start
+  with "gz".  The gzip format is different from the zlib format.  gzip is a
+  gzip wrapper, documented in RFC 1952, wrapped around a deflate stream.
+
+     This library can optionally read and write gzip streams in memory as well.
+
+     The zlib format was designed to be compact and fast for use in memory
+  and on communications channels.  The gzip format was designed for single-
+  file compression on file systems, has a larger header than zlib to maintain
+  directory information, and uses a different, slower check method than zlib.
+
+     The library does not install any signal handler. The decoder checks
+  the consistency of the compressed data, so the library should never
+  crash even in case of corrupted input.
+*/
+
+typedef voidpf (*alloc_func) OF((voidpf opaque, uInt items, uInt size));
+typedef void   (*free_func)  OF((voidpf opaque, voidpf address));
+
+struct internal_state;
+
+typedef struct z_stream_s {
+    Bytef    *next_in;  /* next input byte */
+    uInt     avail_in;  /* number of bytes available at next_in */
+    uLong    total_in;  /* total nb of input bytes read so far */
+
+    Bytef    *next_out; /* next output byte should be put there */
+    uInt     avail_out; /* remaining free space at next_out */
+    uLong    total_out; /* total nb of bytes output so far */
+
+    char     *msg;      /* last error message, NULL if no error */
+    struct internal_state FAR *state; /* not visible by applications */
+
+    alloc_func zalloc;  /* used to allocate the internal state */
+    free_func  zfree;   /* used to free the internal state */
+    voidpf     opaque;  /* private data object passed to zalloc and zfree */
+
+    int     data_type;  /* best guess about the data type: binary or text */
+    uLong   adler;      /* adler32 value of the uncompressed data */
+    uLong   reserved;   /* reserved for future use */
+} z_stream;
+
+typedef z_stream FAR *z_streamp;
+
+/*
+     gzip header information passed to and from zlib routines.  See RFC 1952
+  for more details on the meanings of these fields.
+*/
+typedef struct gz_header_s {
+    int     text;       /* true if compressed data believed to be text */
+    uLong   time;       /* modification time */
+    int     xflags;     /* extra flags (not used when writing a gzip file) */
+    int     os;         /* operating system */
+    Bytef   *extra;     /* pointer to extra field or Z_NULL if none */
+    uInt    extra_len;  /* extra field length (valid if extra != Z_NULL) */
+    uInt    extra_max;  /* space at extra (only when reading header) */
+    Bytef   *name;      /* pointer to zero-terminated file name or Z_NULL */
+    uInt    name_max;   /* space at name (only when reading header) */
+    Bytef   *comment;   /* pointer to zero-terminated comment or Z_NULL */
+    uInt    comm_max;   /* space at comment (only when reading header) */
+    int     hcrc;       /* true if there was or will be a header crc */
+    int     done;       /* true when done reading gzip header (not used
+                           when writing a gzip file) */
+} gz_header;
+
+typedef gz_header FAR *gz_headerp;
+
+/*
+   The application must update next_in and avail_in when avail_in has
+   dropped to zero. It must update next_out and avail_out when avail_out
+   has dropped to zero. The application must initialize zalloc, zfree and
+   opaque before calling the init function. All other fields are set by the
+   compression library and must not be updated by the application.
+
+   The opaque value provided by the application will be passed as the first
+   parameter for calls of zalloc and zfree. This can be useful for custom
+   memory management. The compression library attaches no meaning to the
+   opaque value.
+
+   zalloc must return Z_NULL if there is not enough memory for the object.
+   If zlib is used in a multi-threaded application, zalloc and zfree must be
+   thread safe.
+
+   On 16-bit systems, the functions zalloc and zfree must be able to allocate
+   exactly 65536 bytes, but will not be required to allocate more than this
+   if the symbol MAXSEG_64K is defined (see zconf.h). WARNING: On MSDOS,
+   pointers returned by zalloc for objects of exactly 65536 bytes *must*
+   have their offset normalized to zero. The default allocation function
+   provided by this library ensures this (see zutil.c). To reduce memory
+   requirements and avoid any allocation of 64K objects, at the expense of
+   compression ratio, compile the library with -DMAX_WBITS=14 (see zconf.h).
+
+   The fields total_in and total_out can be used for statistics or
+   progress reports. After compression, total_in holds the total size of
+   the uncompressed data and may be saved for use in the decompressor
+   (particularly if the decompressor wants to decompress everything in
+   a single step).
+*/
+
+                        /* constants */
+
+#define Z_NO_FLUSH      0
+#define Z_PARTIAL_FLUSH 1 /* will be removed, use Z_SYNC_FLUSH instead */
+#define Z_SYNC_FLUSH    2
+#define Z_FULL_FLUSH    3
+#define Z_FINISH        4
+#define Z_BLOCK         5
+/* Allowed flush values; see deflate() and inflate() below for details */
+
+#define Z_OK            0
+#define Z_STREAM_END    1
+#define Z_NEED_DICT     2
+#define Z_ERRNO        (-1)
+#define Z_STREAM_ERROR (-2)
+#define Z_DATA_ERROR   (-3)
+#define Z_MEM_ERROR    (-4)
+#define Z_BUF_ERROR    (-5)
+#define Z_VERSION_ERROR (-6)
+/* Return codes for the compression/decompression functions. Negative
+ * values are errors, positive values are used for special but normal events.
+ */
+
+#define Z_NO_COMPRESSION         0
+#define Z_BEST_SPEED             1
+#define Z_BEST_COMPRESSION       9
+#define Z_DEFAULT_COMPRESSION  (-1)
+/* compression levels */
+
+#define Z_FILTERED            1
+#define Z_HUFFMAN_ONLY        2
+#define Z_RLE                 3
+#define Z_FIXED               4
+#define Z_DEFAULT_STRATEGY    0
+/* compression strategy; see deflateInit2() below for details */
+
+#define Z_BINARY   0
+#define Z_TEXT     1
+#define Z_ASCII    Z_TEXT   /* for compatibility with 1.2.2 and earlier */
+#define Z_UNKNOWN  2
+/* Possible values of the data_type field (though see inflate()) */
+
+#define Z_DEFLATED   8
+/* The deflate compression method (the only one supported in this version) */
+
+#define Z_NULL  0  /* for initializing zalloc, zfree, opaque */
+
+#define zlib_version zlibVersion()
+/* for compatibility with versions < 1.0.2 */
+
+                        /* basic functions */
+
+ZEXTERN const char * ZEXPORT zlibVersion OF((void));
+/* The application can compare zlibVersion and ZLIB_VERSION for consistency.
+   If the first character differs, the library code actually used is
+   not compatible with the zlib.h header file used by the application.
+   This check is automatically made by deflateInit and inflateInit.
+ */
+
+/*
+ZEXTERN int ZEXPORT deflateInit OF((z_streamp strm, int level));
+
+     Initializes the internal stream state for compression. The fields
+   zalloc, zfree and opaque must be initialized before by the caller.
+   If zalloc and zfree are set to Z_NULL, deflateInit updates them to
+   use default allocation functions.
+
+     The compression level must be Z_DEFAULT_COMPRESSION, or between 0 and 9:
+   1 gives best speed, 9 gives best compression, 0 gives no compression at
+   all (the input data is simply copied a block at a time).
+   Z_DEFAULT_COMPRESSION requests a default compromise between speed and
+   compression (currently equivalent to level 6).
+
+     deflateInit returns Z_OK if success, Z_MEM_ERROR if there was not
+   enough memory, Z_STREAM_ERROR if level is not a valid compression level,
+   Z_VERSION_ERROR if the zlib library version (zlib_version) is incompatible
+   with the version assumed by the caller (ZLIB_VERSION).
+   msg is set to null if there is no error message.  deflateInit does not
+   perform any compression: this will be done by deflate().
+*/
+
+
+ZEXTERN int ZEXPORT deflate OF((z_streamp strm, int flush));
+/*
+    deflate compresses as much data as possible, and stops when the input
+  buffer becomes empty or the output buffer becomes full. It may introduce some
+  output latency (reading input without producing any output) except when
+  forced to flush.
+
+    The detailed semantics are as follows. deflate performs one or both of the
+  following actions:
+
+  - Compress more input starting at next_in and update next_in and avail_in
+    accordingly. If not all input can be processed (because there is not
+    enough room in the output buffer), next_in and avail_in are updated and
+    processing will resume at this point for the next call of deflate().
+
+  - Provide more output starting at next_out and update next_out and avail_out
+    accordingly. This action is forced if the parameter flush is non zero.
+    Forcing flush frequently degrades the compression ratio, so this parameter
+    should be set only when necessary (in interactive applications).
+    Some output may be provided even if flush is not set.
+
+  Before the call of deflate(), the application should ensure that at least
+  one of the actions is possible, by providing more input and/or consuming
+  more output, and updating avail_in or avail_out accordingly; avail_out
+  should never be zero before the call. The application can consume the
+  compressed output when it wants, for example when the output buffer is full
+  (avail_out == 0), or after each call of deflate(). If deflate returns Z_OK
+  and with zero avail_out, it must be called again after making room in the
+  output buffer because there might be more output pending.
+
+    Normally the parameter flush is set to Z_NO_FLUSH, which allows deflate to
+  decide how much data to accumualte before producing output, in order to
+  maximize compression.
+
+    If the parameter flush is set to Z_SYNC_FLUSH, all pending output is
+  flushed to the output buffer and the output is aligned on a byte boundary, so
+  that the decompressor can get all input data available so far. (In particular
+  avail_in is zero after the call if enough output space has been provided
+  before the call.)  Flushing may degrade compression for some compression
+  algorithms and so it should be used only when necessary.
+
+    If flush is set to Z_FULL_FLUSH, all output is flushed as with
+  Z_SYNC_FLUSH, and the compression state is reset so that decompression can
+  restart from this point if previous compressed data has been damaged or if
+  random access is desired. Using Z_FULL_FLUSH too often can seriously degrade
+  compression.
+
+    If deflate returns with avail_out == 0, this function must be called again
+  with the same value of the flush parameter and more output space (updated
+  avail_out), until the flush is complete (deflate returns with non-zero
+  avail_out). In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that
+  avail_out is greater than six to avoid repeated flush markers due to
+  avail_out == 0 on return.
+
+    If the parameter flush is set to Z_FINISH, pending input is processed,
+  pending output is flushed and deflate returns with Z_STREAM_END if there
+  was enough output space; if deflate returns with Z_OK, this function must be
+  called again with Z_FINISH and more output space (updated avail_out) but no
+  more input data, until it returns with Z_STREAM_END or an error. After
+  deflate has returned Z_STREAM_END, the only possible operations on the
+  stream are deflateReset or deflateEnd.
+
+    Z_FINISH can be used immediately after deflateInit if all the compression
+  is to be done in a single step. In this case, avail_out must be at least
+  the value returned by deflateBound (see below). If deflate does not return
+  Z_STREAM_END, then it must be called again as described above.
+
+    deflate() sets strm->adler to the adler32 checksum of all input read
+  so far (that is, total_in bytes).
+
+    deflate() may update strm->data_type if it can make a good guess about
+  the input data type (Z_BINARY or Z_TEXT). In doubt, the data is considered
+  binary. This field is only for information purposes and does not affect
+  the compression algorithm in any manner.
+
+    deflate() returns Z_OK if some progress has been made (more input
+  processed or more output produced), Z_STREAM_END if all input has been
+  consumed and all output has been produced (only when flush is set to
+  Z_FINISH), Z_STREAM_ERROR if the stream state was inconsistent (for example
+  if next_in or next_out was NULL), Z_BUF_ERROR if no progress is possible
+  (for example avail_in or avail_out was zero). Note that Z_BUF_ERROR is not
+  fatal, and deflate() can be called again with more input and more output
+  space to continue compressing.
+*/
+
+
+ZEXTERN int ZEXPORT deflateEnd OF((z_streamp strm));
+/*
+     All dynamically allocated data structures for this stream are freed.
+   This function discards any unprocessed input and does not flush any
+   pending output.
+
+     deflateEnd returns Z_OK if success, Z_STREAM_ERROR if the
+   stream state was inconsistent, Z_DATA_ERROR if the stream was freed
+   prematurely (some input or output was discarded). In the error case,
+   msg may be set but then points to a static string (which must not be
+   deallocated).
+*/
+
+
+/*
+ZEXTERN int ZEXPORT inflateInit OF((z_streamp strm));
+
+     Initializes the internal stream state for decompression. The fields
+   next_in, avail_in, zalloc, zfree and opaque must be initialized before by
+   the caller. If next_in is not Z_NULL and avail_in is large enough (the exact
+   value depends on the compression method), inflateInit determines the
+   compression method from the zlib header and allocates all data structures
+   accordingly; otherwise the allocation will be deferred to the first call of
+   inflate.  If zalloc and zfree are set to Z_NULL, inflateInit updates them to
+   use default allocation functions.
+
+     inflateInit returns Z_OK if success, Z_MEM_ERROR if there was not enough
+   memory, Z_VERSION_ERROR if the zlib library version is incompatible with the
+   version assumed by the caller.  msg is set to null if there is no error
+   message. inflateInit does not perform any decompression apart from reading
+   the zlib header if present: this will be done by inflate().  (So next_in and
+   avail_in may be modified, but next_out and avail_out are unchanged.)
+*/
+
+
+ZEXTERN int ZEXPORT inflate OF((z_streamp strm, int flush));
+/*
+    inflate decompresses as much data as possible, and stops when the input
+  buffer becomes empty or the output buffer becomes full. It may introduce
+  some output latency (reading input without producing any output) except when
+  forced to flush.
+
+  The detailed semantics are as follows. inflate performs one or both of the
+  following actions:
+
+  - Decompress more input starting at next_in and update next_in and avail_in
+    accordingly. If not all input can be processed (because there is not
+    enough room in the output buffer), next_in is updated and processing
+    will resume at this point for the next call of inflate().
+
+  - Provide more output starting at next_out and update next_out and avail_out
+    accordingly.  inflate() provides as much output as possible, until there
+    is no more input data or no more space in the output buffer (see below
+    about the flush parameter).
+
+  Before the call of inflate(), the application should ensure that at least
+  one of the actions is possible, by providing more input and/or consuming
+  more output, and updating the next_* and avail_* values accordingly.
+  The application can consume the uncompressed output when it wants, for
+  example when the output buffer is full (avail_out == 0), or after each
+  call of inflate(). If inflate returns Z_OK and with zero avail_out, it
+  must be called again after making room in the output buffer because there
+  might be more output pending.
+
+    The flush parameter of inflate() can be Z_NO_FLUSH, Z_SYNC_FLUSH,
+  Z_FINISH, or Z_BLOCK. Z_SYNC_FLUSH requests that inflate() flush as much
+  output as possible to the output buffer. Z_BLOCK requests that inflate() stop
+  if and when it gets to the next deflate block boundary. When decoding the
+  zlib or gzip format, this will cause inflate() to return immediately after
+  the header and before the first block. When doing a raw inflate, inflate()
+  will go ahead and process the first block, and will return when it gets to
+  the end of that block, or when it runs out of data.
+
+    The Z_BLOCK option assists in appending to or combining deflate streams.
+  Also to assist in this, on return inflate() will set strm->data_type to the
+  number of unused bits in the last byte taken from strm->next_in, plus 64
+  if inflate() is currently decoding the last block in the deflate stream,
+  plus 128 if inflate() returned immediately after decoding an end-of-block
+  code or decoding the complete header up to just before the first byte of the
+  deflate stream. The end-of-block will not be indicated until all of the
+  uncompressed data from that block has been written to strm->next_out.  The
+  number of unused bits may in general be greater than seven, except when
+  bit 7 of data_type is set, in which case the number of unused bits will be
+  less than eight.
+
+    inflate() should normally be called until it returns Z_STREAM_END or an
+  error. However if all decompression is to be performed in a single step
+  (a single call of inflate), the parameter flush should be set to
+  Z_FINISH. In this case all pending input is processed and all pending
+  output is flushed; avail_out must be large enough to hold all the
+  uncompressed data. (The size of the uncompressed data may have been saved
+  by the compressor for this purpose.) The next operation on this stream must
+  be inflateEnd to deallocate the decompression state. The use of Z_FINISH
+  is never required, but can be used to inform inflate that a faster approach
+  may be used for the single inflate() call.
+
+     In this implementation, inflate() always flushes as much output as
+  possible to the output buffer, and always uses the faster approach on the
+  first call. So the only effect of the flush parameter in this implementation
+  is on the return value of inflate(), as noted below, or when it returns early
+  because Z_BLOCK is used.
+
+     If a preset dictionary is needed after this call (see inflateSetDictionary
+  below), inflate sets strm->adler to the adler32 checksum of the dictionary
+  chosen by the compressor and returns Z_NEED_DICT; otherwise it sets
+  strm->adler to the adler32 checksum of all output produced so far (that is,
+  total_out bytes) and returns Z_OK, Z_STREAM_END or an error code as described
+  below. At the end of the stream, inflate() checks that its computed adler32
+  checksum is equal to that saved by the compressor and returns Z_STREAM_END
+  only if the checksum is correct.
+
+    inflate() will decompress and check either zlib-wrapped or gzip-wrapped
+  deflate data.  The header type is detected automatically.  Any information
+  contained in the gzip header is not retained, so applications that need that
+  information should instead use raw inflate, see inflateInit2() below, or
+  inflateBack() and perform their own processing of the gzip header and
+  trailer.
+
+    inflate() returns Z_OK if some progress has been made (more input processed
+  or more output produced), Z_STREAM_END if the end of the compressed data has
+  been reached and all uncompressed output has been produced, Z_NEED_DICT if a
+  preset dictionary is needed at this point, Z_DATA_ERROR if the input data was
+  corrupted (input stream not conforming to the zlib format or incorrect check
+  value), Z_STREAM_ERROR if the stream structure was inconsistent (for example
+  if next_in or next_out was NULL), Z_MEM_ERROR if there was not enough memory,
+  Z_BUF_ERROR if no progress is possible or if there was not enough room in the
+  output buffer when Z_FINISH is used. Note that Z_BUF_ERROR is not fatal, and
+  inflate() can be called again with more input and more output space to
+  continue decompressing. If Z_DATA_ERROR is returned, the application may then
+  call inflateSync() to look for a good compression block if a partial recovery
+  of the data is desired.
+*/
+
+
+ZEXTERN int ZEXPORT inflateEnd OF((z_streamp strm));
+/*
+     All dynamically allocated data structures for this stream are freed.
+   This function discards any unprocessed input and does not flush any
+   pending output.
+
+     inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state
+   was inconsistent. In the error case, msg may be set but then points to a
+   static string (which must not be deallocated).
+*/
+
+                        /* Advanced functions */
+
+/*
+    The following functions are needed only in some special applications.
+*/
+
+/*
+ZEXTERN int ZEXPORT deflateInit2 OF((z_streamp strm,
+                                     int  level,
+                                     int  method,
+                                     int  windowBits,
+                                     int  memLevel,
+                                     int  strategy));
+
+     This is another version of deflateInit with more compression options. The
+   fields next_in, zalloc, zfree and opaque must be initialized before by
+   the caller.
+
+     The method parameter is the compression method. It must be Z_DEFLATED in
+   this version of the library.
+
+     The windowBits parameter is the base two logarithm of the window size
+   (the size of the history buffer). It should be in the range 8..15 for this
+   version of the library. Larger values of this parameter result in better
+   compression at the expense of memory usage. The default value is 15 if
+   deflateInit is used instead.
+
+     windowBits can also be -8..-15 for raw deflate. In this case, -windowBits
+   determines the window size. deflate() will then generate raw deflate data
+   with no zlib header or trailer, and will not compute an adler32 check value.
+
+     windowBits can also be greater than 15 for optional gzip encoding. Add
+   16 to windowBits to write a simple gzip header and trailer around the
+   compressed data instead of a zlib wrapper. The gzip header will have no
+   file name, no extra data, no comment, no modification time (set to zero),
+   no header crc, and the operating system will be set to 255 (unknown).  If a
+   gzip stream is being written, strm->adler is a crc32 instead of an adler32.
+
+     The memLevel parameter specifies how much memory should be allocated
+   for the internal compression state. memLevel=1 uses minimum memory but
+   is slow and reduces compression ratio; memLevel=9 uses maximum memory
+   for optimal speed. The default value is 8. See zconf.h for total memory
+   usage as a function of windowBits and memLevel.
+
+     The strategy parameter is used to tune the compression algorithm. Use the
+   value Z_DEFAULT_STRATEGY for normal data, Z_FILTERED for data produced by a
+   filter (or predictor), Z_HUFFMAN_ONLY to force Huffman encoding only (no
+   string match), or Z_RLE to limit match distances to one (run-length
+   encoding). Filtered data consists mostly of small values with a somewhat
+   random distribution. In this case, the compression algorithm is tuned to
+   compress them better. The effect of Z_FILTERED is to force more Huffman
+   coding and less string matching; it is somewhat intermediate between
+   Z_DEFAULT and Z_HUFFMAN_ONLY. Z_RLE is designed to be almost as fast as
+   Z_HUFFMAN_ONLY, but give better compression for PNG image data. The strategy
+   parameter only affects the compression ratio but not the correctness of the
+   compressed output even if it is not set appropriately.  Z_FIXED prevents the
+   use of dynamic Huffman codes, allowing for a simpler decoder for special
+   applications.
+
+      deflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
+   memory, Z_STREAM_ERROR if a parameter is invalid (such as an invalid
+   method). msg is set to null if there is no error message.  deflateInit2 does
+   not perform any compression: this will be done by deflate().
+*/
+
+ZEXTERN int ZEXPORT deflateSetDictionary OF((z_streamp strm,
+                                             const Bytef *dictionary,
+                                             uInt  dictLength));
+/*
+     Initializes the compression dictionary from the given byte sequence
+   without producing any compressed output. This function must be called
+   immediately after deflateInit, deflateInit2 or deflateReset, before any
+   call of deflate. The compressor and decompressor must use exactly the same
+   dictionary (see inflateSetDictionary).
+
+     The dictionary should consist of strings (byte sequences) that are likely
+   to be encountered later in the data to be compressed, with the most commonly
+   used strings preferably put towards the end of the dictionary. Using a
+   dictionary is most useful when the data to be compressed is short and can be
+   predicted with good accuracy; the data can then be compressed better than
+   with the default empty dictionary.
+
+     Depending on the size of the compression data structures selected by
+   deflateInit or deflateInit2, a part of the dictionary may in effect be
+   discarded, for example if the dictionary is larger than the window size in
+   deflate or deflate2. Thus the strings most likely to be useful should be
+   put at the end of the dictionary, not at the front. In addition, the
+   current implementation of deflate will use at most the window size minus
+   262 bytes of the provided dictionary.
+
+     Upon return of this function, strm->adler is set to the adler32 value
+   of the dictionary; the decompressor may later use this value to determine
+   which dictionary has been used by the compressor. (The adler32 value
+   applies to the whole dictionary even if only a subset of the dictionary is
+   actually used by the compressor.) If a raw deflate was requested, then the
+   adler32 value is not computed and strm->adler is not set.
+
+     deflateSetDictionary returns Z_OK if success, or Z_STREAM_ERROR if a
+   parameter is invalid (such as NULL dictionary) or the stream state is
+   inconsistent (for example if deflate has already been called for this stream
+   or if the compression method is bsort). deflateSetDictionary does not
+   perform any compression: this will be done by deflate().
+*/
+
+ZEXTERN int ZEXPORT deflateCopy OF((z_streamp dest,
+                                    z_streamp source));
+/*
+     Sets the destination stream as a complete copy of the source stream.
+
+     This function can be useful when several compression strategies will be
+   tried, for example when there are several ways of pre-processing the input
+   data with a filter. The streams that will be discarded should then be freed
+   by calling deflateEnd.  Note that deflateCopy duplicates the internal
+   compression state which can be quite large, so this strategy is slow and
+   can consume lots of memory.
+
+     deflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not
+   enough memory, Z_STREAM_ERROR if the source stream state was inconsistent
+   (such as zalloc being NULL). msg is left unchanged in both source and
+   destination.
+*/
+
+ZEXTERN int ZEXPORT deflateReset OF((z_streamp strm));
+/*
+     This function is equivalent to deflateEnd followed by deflateInit,
+   but does not free and reallocate all the internal compression state.
+   The stream will keep the same compression level and any other attributes
+   that may have been set by deflateInit2.
+
+      deflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source
+   stream state was inconsistent (such as zalloc or state being NULL).
+*/
+
+ZEXTERN int ZEXPORT deflateParams OF((z_streamp strm,
+                                      int level,
+                                      int strategy));
+/*
+     Dynamically update the compression level and compression strategy.  The
+   interpretation of level and strategy is as in deflateInit2.  This can be
+   used to switch between compression and straight copy of the input data, or
+   to switch to a different kind of input data requiring a different
+   strategy. If the compression level is changed, the input available so far
+   is compressed with the old level (and may be flushed); the new level will
+   take effect only at the next call of deflate().
+
+     Before the call of deflateParams, the stream state must be set as for
+   a call of deflate(), since the currently available input may have to
+   be compressed and flushed. In particular, strm->avail_out must be non-zero.
+
+     deflateParams returns Z_OK if success, Z_STREAM_ERROR if the source
+   stream state was inconsistent or if a parameter was invalid, Z_BUF_ERROR
+   if strm->avail_out was zero.
+*/
+
+ZEXTERN int ZEXPORT deflateTune OF((z_streamp strm,
+                                    int good_length,
+                                    int max_lazy,
+                                    int nice_length,
+                                    int max_chain));
+/*
+     Fine tune deflate's internal compression parameters.  This should only be
+   used by someone who understands the algorithm used by zlib's deflate for
+   searching for the best matching string, and even then only by the most
+   fanatic optimizer trying to squeeze out the last compressed bit for their
+   specific input data.  Read the deflate.c source code for the meaning of the
+   max_lazy, good_length, nice_length, and max_chain parameters.
+
+     deflateTune() can be called after deflateInit() or deflateInit2(), and
+   returns Z_OK on success, or Z_STREAM_ERROR for an invalid deflate stream.
+ */
+
+ZEXTERN uLong ZEXPORT deflateBound OF((z_streamp strm,
+                                       uLong sourceLen));
+/*
+     deflateBound() returns an upper bound on the compressed size after
+   deflation of sourceLen bytes.  It must be called after deflateInit()
+   or deflateInit2().  This would be used to allocate an output buffer
+   for deflation in a single pass, and so would be called before deflate().
+*/
+
+ZEXTERN int ZEXPORT deflatePrime OF((z_streamp strm,
+                                     int bits,
+                                     int value));
+/*
+     deflatePrime() inserts bits in the deflate output stream.  The intent
+  is that this function is used to start off the deflate output with the
+  bits leftover from a previous deflate stream when appending to it.  As such,
+  this function can only be used for raw deflate, and must be used before the
+  first deflate() call after a deflateInit2() or deflateReset().  bits must be
+  less than or equal to 16, and that many of the least significant bits of
+  value will be inserted in the output.
+
+      deflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source
+   stream state was inconsistent.
+*/
+
+ZEXTERN int ZEXPORT deflateSetHeader OF((z_streamp strm,
+                                         gz_headerp head));
+/*
+      deflateSetHeader() provides gzip header information for when a gzip
+   stream is requested by deflateInit2().  deflateSetHeader() may be called
+   after deflateInit2() or deflateReset() and before the first call of
+   deflate().  The text, time, os, extra field, name, and comment information
+   in the provided gz_header structure are written to the gzip header (xflag is
+   ignored -- the extra flags are set according to the compression level).  The
+   caller must assure that, if not Z_NULL, name and comment are terminated with
+   a zero byte, and that if extra is not Z_NULL, that extra_len bytes are
+   available there.  If hcrc is true, a gzip header crc is included.  Note that
+   the current versions of the command-line version of gzip (up through version
+   1.3.x) do not support header crc's, and will report that it is a "multi-part
+   gzip file" and give up.
+
+      If deflateSetHeader is not used, the default gzip header has text false,
+   the time set to zero, and os set to 255, with no extra, name, or comment
+   fields.  The gzip header is returned to the default state by deflateReset().
+
+      deflateSetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source
+   stream state was inconsistent.
+*/
+
+/*
+ZEXTERN int ZEXPORT inflateInit2 OF((z_streamp strm,
+                                     int  windowBits));
+
+     This is another version of inflateInit with an extra parameter. The
+   fields next_in, avail_in, zalloc, zfree and opaque must be initialized
+   before by the caller.
+
+     The windowBits parameter is the base two logarithm of the maximum window
+   size (the size of the history buffer).  It should be in the range 8..15 for
+   this version of the library. The default value is 15 if inflateInit is used
+   instead. windowBits must be greater than or equal to the windowBits value
+   provided to deflateInit2() while compressing, or it must be equal to 15 if
+   deflateInit2() was not used. If a compressed stream with a larger window
+   size is given as input, inflate() will return with the error code
+   Z_DATA_ERROR instead of trying to allocate a larger window.
+
+     windowBits can also be -8..-15 for raw inflate. In this case, -windowBits
+   determines the window size. inflate() will then process raw deflate data,
+   not looking for a zlib or gzip header, not generating a check value, and not
+   looking for any check values for comparison at the end of the stream. This
+   is for use with other formats that use the deflate compressed data format
+   such as zip.  Those formats provide their own check values. If a custom
+   format is developed using the raw deflate format for compressed data, it is
+   recommended that a check value such as an adler32 or a crc32 be applied to
+   the uncompressed data as is done in the zlib, gzip, and zip formats.  For
+   most applications, the zlib format should be used as is. Note that comments
+   above on the use in deflateInit2() applies to the magnitude of windowBits.
+
+     windowBits can also be greater than 15 for optional gzip decoding. Add
+   32 to windowBits to enable zlib and gzip decoding with automatic header
+   detection, or add 16 to decode only the gzip format (the zlib format will
+   return a Z_DATA_ERROR).  If a gzip stream is being decoded, strm->adler is
+   a crc32 instead of an adler32.
+
+     inflateInit2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
+   memory, Z_STREAM_ERROR if a parameter is invalid (such as a null strm). msg
+   is set to null if there is no error message.  inflateInit2 does not perform
+   any decompression apart from reading the zlib header if present: this will
+   be done by inflate(). (So next_in and avail_in may be modified, but next_out
+   and avail_out are unchanged.)
+*/
+
+ZEXTERN int ZEXPORT inflateSetDictionary OF((z_streamp strm,
+                                             const Bytef *dictionary,
+                                             uInt  dictLength));
+/*
+     Initializes the decompression dictionary from the given uncompressed byte
+   sequence. This function must be called immediately after a call of inflate,
+   if that call returned Z_NEED_DICT. The dictionary chosen by the compressor
+   can be determined from the adler32 value returned by that call of inflate.
+   The compressor and decompressor must use exactly the same dictionary (see
+   deflateSetDictionary).  For raw inflate, this function can be called
+   immediately after inflateInit2() or inflateReset() and before any call of
+   inflate() to set the dictionary.  The application must insure that the
+   dictionary that was used for compression is provided.
+
+     inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a
+   parameter is invalid (such as NULL dictionary) or the stream state is
+   inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the
+   expected one (incorrect adler32 value). inflateSetDictionary does not
+   perform any decompression: this will be done by subsequent calls of
+   inflate().
+*/
+
+ZEXTERN int ZEXPORT inflateSync OF((z_streamp strm));
+/*
+    Skips invalid compressed data until a full flush point (see above the
+  description of deflate with Z_FULL_FLUSH) can be found, or until all
+  available input is skipped. No output is provided.
+
+    inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR
+  if no more input was provided, Z_DATA_ERROR if no flush point has been found,
+  or Z_STREAM_ERROR if the stream structure was inconsistent. In the success
+  case, the application may save the current current value of total_in which
+  indicates where valid compressed data was found. In the error case, the
+  application may repeatedly call inflateSync, providing more input each time,
+  until success or end of the input data.
+*/
+
+ZEXTERN int ZEXPORT inflateCopy OF((z_streamp dest,
+                                    z_streamp source));
+/*
+     Sets the destination stream as a complete copy of the source stream.
+
+     This function can be useful when randomly accessing a large stream.  The
+   first pass through the stream can periodically record the inflate state,
+   allowing restarting inflate at those points when randomly accessing the
+   stream.
+
+     inflateCopy returns Z_OK if success, Z_MEM_ERROR if there was not
+   enough memory, Z_STREAM_ERROR if the source stream state was inconsistent
+   (such as zalloc being NULL). msg is left unchanged in both source and
+   destination.
+*/
+
+ZEXTERN int ZEXPORT inflateReset OF((z_streamp strm));
+/*
+     This function is equivalent to inflateEnd followed by inflateInit,
+   but does not free and reallocate all the internal decompression state.
+   The stream will keep attributes that may have been set by inflateInit2.
+
+      inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source
+   stream state was inconsistent (such as zalloc or state being NULL).
+*/
+
+ZEXTERN int ZEXPORT inflatePrime OF((z_streamp strm,
+                                     int bits,
+                                     int value));
+/*
+     This function inserts bits in the inflate input stream.  The intent is
+  that this function is used to start inflating at a bit position in the
+  middle of a byte.  The provided bits will be used before any bytes are used
+  from next_in.  This function should only be used with raw inflate, and
+  should be used before the first inflate() call after inflateInit2() or
+  inflateReset().  bits must be less than or equal to 16, and that many of the
+  least significant bits of value will be inserted in the input.
+
+      inflatePrime returns Z_OK if success, or Z_STREAM_ERROR if the source
+   stream state was inconsistent.
+*/
+
+ZEXTERN int ZEXPORT inflateGetHeader OF((z_streamp strm,
+                                         gz_headerp head));
+/*
+      inflateGetHeader() requests that gzip header information be stored in the
+   provided gz_header structure.  inflateGetHeader() may be called after
+   inflateInit2() or inflateReset(), and before the first call of inflate().
+   As inflate() processes the gzip stream, head->done is zero until the header
+   is completed, at which time head->done is set to one.  If a zlib stream is
+   being decoded, then head->done is set to -1 to indicate that there will be
+   no gzip header information forthcoming.  Note that Z_BLOCK can be used to
+   force inflate() to return immediately after header processing is complete
+   and before any actual data is decompressed.
+
+      The text, time, xflags, and os fields are filled in with the gzip header
+   contents.  hcrc is set to true if there is a header CRC.  (The header CRC
+   was valid if done is set to one.)  If extra is not Z_NULL, then extra_max
+   contains the maximum number of bytes to write to extra.  Once done is true,
+   extra_len contains the actual extra field length, and extra contains the
+   extra field, or that field truncated if extra_max is less than extra_len.
+   If name is not Z_NULL, then up to name_max characters are written there,
+   terminated with a zero unless the length is greater than name_max.  If
+   comment is not Z_NULL, then up to comm_max characters are written there,
+   terminated with a zero unless the length is greater than comm_max.  When
+   any of extra, name, or comment are not Z_NULL and the respective field is
+   not present in the header, then that field is set to Z_NULL to signal its
+   absence.  This allows the use of deflateSetHeader() with the returned
+   structure to duplicate the header.  However if those fields are set to
+   allocated memory, then the application will need to save those pointers
+   elsewhere so that they can be eventually freed.
+
+      If inflateGetHeader is not used, then the header information is simply
+   discarded.  The header is always checked for validity, including the header
+   CRC if present.  inflateReset() will reset the process to discard the header
+   information.  The application would need to call inflateGetHeader() again to
+   retrieve the header from the next gzip stream.
+
+      inflateGetHeader returns Z_OK if success, or Z_STREAM_ERROR if the source
+   stream state was inconsistent.
+*/
+
+/*
+ZEXTERN int ZEXPORT inflateBackInit OF((z_streamp strm, int windowBits,
+                                        unsigned char FAR *window));
+
+     Initialize the internal stream state for decompression using inflateBack()
+   calls.  The fields zalloc, zfree and opaque in strm must be initialized
+   before the call.  If zalloc and zfree are Z_NULL, then the default library-
+   derived memory allocation routines are used.  windowBits is the base two
+   logarithm of the window size, in the range 8..15.  window is a caller
+   supplied buffer of that size.  Except for special applications where it is
+   assured that deflate was used with small window sizes, windowBits must be 15
+   and a 32K byte window must be supplied to be able to decompress general
+   deflate streams.
+
+     See inflateBack() for the usage of these routines.
+
+     inflateBackInit will return Z_OK on success, Z_STREAM_ERROR if any of
+   the paramaters are invalid, Z_MEM_ERROR if the internal state could not
+   be allocated, or Z_VERSION_ERROR if the version of the library does not
+   match the version of the header file.
+*/
+
+typedef unsigned (*in_func) OF((void FAR *, unsigned char FAR * FAR *));
+typedef int (*out_func) OF((void FAR *, unsigned char FAR *, unsigned));
+
+ZEXTERN int ZEXPORT inflateBack OF((z_streamp strm,
+                                    in_func in, void FAR *in_desc,
+                                    out_func out, void FAR *out_desc));
+/*
+     inflateBack() does a raw inflate with a single call using a call-back
+   interface for input and output.  This is more efficient than inflate() for
+   file i/o applications in that it avoids copying between the output and the
+   sliding window by simply making the window itself the output buffer.  This
+   function trusts the application to not change the output buffer passed by
+   the output function, at least until inflateBack() returns.
+
+     inflateBackInit() must be called first to allocate the internal state
+   and to initialize the state with the user-provided window buffer.
+   inflateBack() may then be used multiple times to inflate a complete, raw
+   deflate stream with each call.  inflateBackEnd() is then called to free
+   the allocated state.
+
+     A raw deflate stream is one with no zlib or gzip header or trailer.
+   This routine would normally be used in a utility that reads zip or gzip
+   files and writes out uncompressed files.  The utility would decode the
+   header and process the trailer on its own, hence this routine expects
+   only the raw deflate stream to decompress.  This is different from the
+   normal behavior of inflate(), which expects either a zlib or gzip header and
+   trailer around the deflate stream.
+
+     inflateBack() uses two subroutines supplied by the caller that are then
+   called by inflateBack() for input and output.  inflateBack() calls those
+   routines until it reads a complete deflate stream and writes out all of the
+   uncompressed data, or until it encounters an error.  The function's
+   parameters and return types are defined above in the in_func and out_func
+   typedefs.  inflateBack() will call in(in_desc, &buf) which should return the
+   number of bytes of provided input, and a pointer to that input in buf.  If
+   there is no input available, in() must return zero--buf is ignored in that
+   case--and inflateBack() will return a buffer error.  inflateBack() will call
+   out(out_desc, buf, len) to write the uncompressed data buf[0..len-1].  out()
+   should return zero on success, or non-zero on failure.  If out() returns
+   non-zero, inflateBack() will return with an error.  Neither in() nor out()
+   are permitted to change the contents of the window provided to
+   inflateBackInit(), which is also the buffer that out() uses to write from.
+   The length written by out() will be at most the window size.  Any non-zero
+   amount of input may be provided by in().
+
+     For convenience, inflateBack() can be provided input on the first call by
+   setting strm->next_in and strm->avail_in.  If that input is exhausted, then
+   in() will be called.  Therefore strm->next_in must be initialized before
+   calling inflateBack().  If strm->next_in is Z_NULL, then in() will be called
+   immediately for input.  If strm->next_in is not Z_NULL, then strm->avail_in
+   must also be initialized, and then if strm->avail_in is not zero, input will
+   initially be taken from strm->next_in[0 .. strm->avail_in - 1].
+
+     The in_desc and out_desc parameters of inflateBack() is passed as the
+   first parameter of in() and out() respectively when they are called.  These
+   descriptors can be optionally used to pass any information that the caller-
+   supplied in() and out() functions need to do their job.
+
+     On return, inflateBack() will set strm->next_in and strm->avail_in to
+   pass back any unused input that was provided by the last in() call.  The
+   return values of inflateBack() can be Z_STREAM_END on success, Z_BUF_ERROR
+   if in() or out() returned an error, Z_DATA_ERROR if there was a format
+   error in the deflate stream (in which case strm->msg is set to indicate the
+   nature of the error), or Z_STREAM_ERROR if the stream was not properly
+   initialized.  In the case of Z_BUF_ERROR, an input or output error can be
+   distinguished using strm->next_in which will be Z_NULL only if in() returned
+   an error.  If strm->next is not Z_NULL, then the Z_BUF_ERROR was due to
+   out() returning non-zero.  (in() will always be called before out(), so
+   strm->next_in is assured to be defined if out() returns non-zero.)  Note
+   that inflateBack() cannot return Z_OK.
+*/
+
+ZEXTERN int ZEXPORT inflateBackEnd OF((z_streamp strm));
+/*
+     All memory allocated by inflateBackInit() is freed.
+
+     inflateBackEnd() returns Z_OK on success, or Z_STREAM_ERROR if the stream
+   state was inconsistent.
+*/
+
+ZEXTERN uLong ZEXPORT zlibCompileFlags OF((void));
+/* Return flags indicating compile-time options.
+
+    Type sizes, two bits each, 00 = 16 bits, 01 = 32, 10 = 64, 11 = other:
+     1.0: size of uInt
+     3.2: size of uLong
+     5.4: size of voidpf (pointer)
+     7.6: size of z_off_t
+
+    Compiler, assembler, and debug options:
+     8: DEBUG
+     9: ASMV or ASMINF -- use ASM code
+     10: ZLIB_WINAPI -- exported functions use the WINAPI calling convention
+     11: 0 (reserved)
+
+    One-time table building (smaller code, but not thread-safe if true):
+     12: BUILDFIXED -- build static block decoding tables when needed
+     13: DYNAMIC_CRC_TABLE -- build CRC calculation tables when needed
+     14,15: 0 (reserved)
+
+    Library content (indicates missing functionality):
+     16: NO_GZCOMPRESS -- gz* functions cannot compress (to avoid linking
+                          deflate code when not needed)
+     17: NO_GZIP -- deflate can't write gzip streams, and inflate can't detect
+                    and decode gzip streams (to avoid linking crc code)
+     18-19: 0 (reserved)
+
+    Operation variations (changes in library functionality):
+     20: PKZIP_BUG_WORKAROUND -- slightly more permissive inflate
+     21: FASTEST -- deflate algorithm with only one, lowest compression level
+     22,23: 0 (reserved)
+
+    The sprintf variant used by gzprintf (zero is best):
+     24: 0 = vs*, 1 = s* -- 1 means limited to 20 arguments after the format
+     25: 0 = *nprintf, 1 = *printf -- 1 means gzprintf() not secure!
+     26: 0 = returns value, 1 = void -- 1 means inferred string length returned
+
+    Remainder:
+     27-31: 0 (reserved)
+ */
+
+
+                        /* utility functions */
+
+/*
+     The following utility functions are implemented on top of the
+   basic stream-oriented functions. To simplify the interface, some
+   default options are assumed (compression level and memory usage,
+   standard memory allocation functions). The source code of these
+   utility functions can easily be modified if you need special options.
+*/
+
+ZEXTERN int ZEXPORT compress OF((Bytef *dest,   uLongf *destLen,
+                                 const Bytef *source, uLong sourceLen));
+/*
+     Compresses the source buffer into the destination buffer.  sourceLen is
+   the byte length of the source buffer. Upon entry, destLen is the total
+   size of the destination buffer, which must be at least the value returned
+   by compressBound(sourceLen). Upon exit, destLen is the actual size of the
+   compressed buffer.
+     This function can be used to compress a whole file at once if the
+   input file is mmap'ed.
+     compress returns Z_OK if success, Z_MEM_ERROR if there was not
+   enough memory, Z_BUF_ERROR if there was not enough room in the output
+   buffer.
+*/
+
+ZEXTERN int ZEXPORT compress2 OF((Bytef *dest,   uLongf *destLen,
+                                  const Bytef *source, uLong sourceLen,
+                                  int level));
+/*
+     Compresses the source buffer into the destination buffer. The level
+   parameter has the same meaning as in deflateInit.  sourceLen is the byte
+   length of the source buffer. Upon entry, destLen is the total size of the
+   destination buffer, which must be at least the value returned by
+   compressBound(sourceLen). Upon exit, destLen is the actual size of the
+   compressed buffer.
+
+     compress2 returns Z_OK if success, Z_MEM_ERROR if there was not enough
+   memory, Z_BUF_ERROR if there was not enough room in the output buffer,
+   Z_STREAM_ERROR if the level parameter is invalid.
+*/
+
+ZEXTERN uLong ZEXPORT compressBound OF((uLong sourceLen));
+/*
+     compressBound() returns an upper bound on the compressed size after
+   compress() or compress2() on sourceLen bytes.  It would be used before
+   a compress() or compress2() call to allocate the destination buffer.
+*/
+
+ZEXTERN int ZEXPORT uncompress OF((Bytef *dest,   uLongf *destLen,
+                                   const Bytef *source, uLong sourceLen));
+/*
+     Decompresses the source buffer into the destination buffer.  sourceLen is
+   the byte length of the source buffer. Upon entry, destLen is the total
+   size of the destination buffer, which must be large enough to hold the
+   entire uncompressed data. (The size of the uncompressed data must have
+   been saved previously by the compressor and transmitted to the decompressor
+   by some mechanism outside the scope of this compression library.)
+   Upon exit, destLen is the actual size of the compressed buffer.
+     This function can be used to decompress a whole file at once if the
+   input file is mmap'ed.
+
+     uncompress returns Z_OK if success, Z_MEM_ERROR if there was not
+   enough memory, Z_BUF_ERROR if there was not enough room in the output
+   buffer, or Z_DATA_ERROR if the input data was corrupted or incomplete.
+*/
+
+
+typedef voidp gzFile;
+
+ZEXTERN gzFile ZEXPORT gzopen  OF((const char *path, const char *mode));
+/*
+     Opens a gzip (.gz) file for reading or writing. The mode parameter
+   is as in fopen ("rb" or "wb") but can also include a compression level
+   ("wb9") or a strategy: 'f' for filtered data as in "wb6f", 'h' for
+   Huffman only compression as in "wb1h", or 'R' for run-length encoding
+   as in "wb1R". (See the description of deflateInit2 for more information
+   about the strategy parameter.)
+
+     gzopen can be used to read a file which is not in gzip format; in this
+   case gzread will directly read from the file without decompression.
+
+     gzopen returns NULL if the file could not be opened or if there was
+   insufficient memory to allocate the (de)compression state; errno
+   can be checked to distinguish the two cases (if errno is zero, the
+   zlib error is Z_MEM_ERROR).  */
+
+ZEXTERN gzFile ZEXPORT gzdopen  OF((int fd, const char *mode));
+/*
+     gzdopen() associates a gzFile with the file descriptor fd.  File
+   descriptors are obtained from calls like open, dup, creat, pipe or
+   fileno (in the file has been previously opened with fopen).
+   The mode parameter is as in gzopen.
+     The next call of gzclose on the returned gzFile will also close the
+   file descriptor fd, just like fclose(fdopen(fd), mode) closes the file
+   descriptor fd. If you want to keep fd open, use gzdopen(dup(fd), mode).
+     gzdopen returns NULL if there was insufficient memory to allocate
+   the (de)compression state.
+*/
+
+ZEXTERN int ZEXPORT gzsetparams OF((gzFile file, int level, int strategy));
+/*
+     Dynamically update the compression level or strategy. See the description
+   of deflateInit2 for the meaning of these parameters.
+     gzsetparams returns Z_OK if success, or Z_STREAM_ERROR if the file was not
+   opened for writing.
+*/
+
+ZEXTERN int ZEXPORT    gzread  OF((gzFile file, voidp buf, unsigned len));
+/*
+     Reads the given number of uncompressed bytes from the compressed file.
+   If the input file was not in gzip format, gzread copies the given number
+   of bytes into the buffer.
+     gzread returns the number of uncompressed bytes actually read (0 for
+   end of file, -1 for error). */
+
+ZEXTERN int ZEXPORT    gzwrite OF((gzFile file,
+                                   voidpc buf, unsigned len));
+/*
+     Writes the given number of uncompressed bytes into the compressed file.
+   gzwrite returns the number of uncompressed bytes actually written
+   (0 in case of error).
+*/
+
+ZEXTERN int ZEXPORTVA   gzprintf OF((gzFile file, const char *format, ...));
+/*
+     Converts, formats, and writes the args to the compressed file under
+   control of the format string, as in fprintf. gzprintf returns the number of
+   uncompressed bytes actually written (0 in case of error).  The number of
+   uncompressed bytes written is limited to 4095. The caller should assure that
+   this limit is not exceeded. If it is exceeded, then gzprintf() will return
+   return an error (0) with nothing written. In this case, there may also be a
+   buffer overflow with unpredictable consequences, which is possible only if
+   zlib was compiled with the insecure functions sprintf() or vsprintf()
+   because the secure snprintf() or vsnprintf() functions were not available.
+*/
+
+ZEXTERN int ZEXPORT gzputs OF((gzFile file, const char *s));
+/*
+      Writes the given null-terminated string to the compressed file, excluding
+   the terminating null character.
+      gzputs returns the number of characters written, or -1 in case of error.
+*/
+
+ZEXTERN char * ZEXPORT gzgets OF((gzFile file, char *buf, int len));
+/*
+      Reads bytes from the compressed file until len-1 characters are read, or
+   a newline character is read and transferred to buf, or an end-of-file
+   condition is encountered.  The string is then terminated with a null
+   character.
+      gzgets returns buf, or Z_NULL in case of error.
+*/
+
+ZEXTERN int ZEXPORT    gzputc OF((gzFile file, int c));
+/*
+      Writes c, converted to an unsigned char, into the compressed file.
+   gzputc returns the value that was written, or -1 in case of error.
+*/
+
+ZEXTERN int ZEXPORT    gzgetc OF((gzFile file));
+/*
+      Reads one byte from the compressed file. gzgetc returns this byte
+   or -1 in case of end of file or error.
+*/
+
+ZEXTERN int ZEXPORT    gzungetc OF((int c, gzFile file));
+/*
+      Push one character back onto the stream to be read again later.
+   Only one character of push-back is allowed.  gzungetc() returns the
+   character pushed, or -1 on failure.  gzungetc() will fail if a
+   character has been pushed but not read yet, or if c is -1. The pushed
+   character will be discarded if the stream is repositioned with gzseek()
+   or gzrewind().
+*/
+
+ZEXTERN int ZEXPORT    gzflush OF((gzFile file, int flush));
+/*
+     Flushes all pending output into the compressed file. The parameter
+   flush is as in the deflate() function. The return value is the zlib
+   error number (see function gzerror below). gzflush returns Z_OK if
+   the flush parameter is Z_FINISH and all output could be flushed.
+     gzflush should be called only when strictly necessary because it can
+   degrade compression.
+*/
+
+ZEXTERN z_off_t ZEXPORT    gzseek OF((gzFile file,
+                                      z_off_t offset, int whence));
+/*
+      Sets the starting position for the next gzread or gzwrite on the
+   given compressed file. The offset represents a number of bytes in the
+   uncompressed data stream. The whence parameter is defined as in lseek(2);
+   the value SEEK_END is not supported.
+     If the file is opened for reading, this function is emulated but can be
+   extremely slow. If the file is opened for writing, only forward seeks are
+   supported; gzseek then compresses a sequence of zeroes up to the new
+   starting position.
+
+      gzseek returns the resulting offset location as measured in bytes from
+   the beginning of the uncompressed stream, or -1 in case of error, in
+   particular if the file is opened for writing and the new starting position
+   would be before the current position.
+*/
+
+ZEXTERN int ZEXPORT    gzrewind OF((gzFile file));
+/*
+     Rewinds the given file. This function is supported only for reading.
+
+   gzrewind(file) is equivalent to (int)gzseek(file, 0L, SEEK_SET)
+*/
+
+ZEXTERN z_off_t ZEXPORT    gztell OF((gzFile file));
+/*
+     Returns the starting position for the next gzread or gzwrite on the
+   given compressed file. This position represents a number of bytes in the
+   uncompressed data stream.
+
+   gztell(file) is equivalent to gzseek(file, 0L, SEEK_CUR)
+*/
+
+ZEXTERN int ZEXPORT gzeof OF((gzFile file));
+/*
+     Returns 1 when EOF has previously been detected reading the given
+   input stream, otherwise zero.
+*/
+
+ZEXTERN int ZEXPORT gzdirect OF((gzFile file));
+/*
+     Returns 1 if file is being read directly without decompression, otherwise
+   zero.
+*/
+
+ZEXTERN int ZEXPORT    gzclose OF((gzFile file));
+/*
+     Flushes all pending output if necessary, closes the compressed file
+   and deallocates all the (de)compression state. The return value is the zlib
+   error number (see function gzerror below).
+*/
+
+ZEXTERN const char * ZEXPORT gzerror OF((gzFile file, int *errnum));
+/*
+     Returns the error message for the last error which occurred on the
+   given compressed file. errnum is set to zlib error number. If an
+   error occurred in the file system and not in the compression library,
+   errnum is set to Z_ERRNO and the application may consult errno
+   to get the exact error code.
+*/
+
+ZEXTERN void ZEXPORT gzclearerr OF((gzFile file));
+/*
+     Clears the error and end-of-file flags for file. This is analogous to the
+   clearerr() function in stdio. This is useful for continuing to read a gzip
+   file that is being written concurrently.
+*/
+
+                        /* checksum functions */
+
+/*
+     These functions are not related to compression but are exported
+   anyway because they might be useful in applications using the
+   compression library.
+*/
+
+ZEXTERN uLong ZEXPORT adler32 OF((uLong adler, const Bytef *buf, uInt len));
+/*
+     Update a running Adler-32 checksum with the bytes buf[0..len-1] and
+   return the updated checksum. If buf is NULL, this function returns
+   the required initial value for the checksum.
+   An Adler-32 checksum is almost as reliable as a CRC32 but can be computed
+   much faster. Usage example:
+
+     uLong adler = adler32(0L, Z_NULL, 0);
+
+     while (read_buffer(buffer, length) != EOF) {
+       adler = adler32(adler, buffer, length);
+     }
+     if (adler != original_adler) error();
+*/
+
+ZEXTERN uLong ZEXPORT adler32_combine OF((uLong adler1, uLong adler2,
+                                          z_off_t len2));
+/*
+     Combine two Adler-32 checksums into one.  For two sequences of bytes, seq1
+   and seq2 with lengths len1 and len2, Adler-32 checksums were calculated for
+   each, adler1 and adler2.  adler32_combine() returns the Adler-32 checksum of
+   seq1 and seq2 concatenated, requiring only adler1, adler2, and len2.
+*/
+
+ZEXTERN uLong ZEXPORT crc32   OF((uLong crc, const Bytef *buf, uInt len));
+/*
+     Update a running CRC-32 with the bytes buf[0..len-1] and return the
+   updated CRC-32. If buf is NULL, this function returns the required initial
+   value for the for the crc. Pre- and post-conditioning (one's complement) is
+   performed within this function so it shouldn't be done by the application.
+   Usage example:
+
+     uLong crc = crc32(0L, Z_NULL, 0);
+
+     while (read_buffer(buffer, length) != EOF) {
+       crc = crc32(crc, buffer, length);
+     }
+     if (crc != original_crc) error();
+*/
+
+ZEXTERN uLong ZEXPORT crc32_combine OF((uLong crc1, uLong crc2, z_off_t len2));
+
+/*
+     Combine two CRC-32 check values into one.  For two sequences of bytes,
+   seq1 and seq2 with lengths len1 and len2, CRC-32 check values were
+   calculated for each, crc1 and crc2.  crc32_combine() returns the CRC-32
+   check value of seq1 and seq2 concatenated, requiring only crc1, crc2, and
+   len2.
+*/
+
+
+                        /* various hacks, don't look :) */
+
+/* deflateInit and inflateInit are macros to allow checking the zlib version
+ * and the compiler's view of z_stream:
+ */
+ZEXTERN int ZEXPORT deflateInit_ OF((z_streamp strm, int level,
+                                     const char *version, int stream_size));
+ZEXTERN int ZEXPORT inflateInit_ OF((z_streamp strm,
+                                     const char *version, int stream_size));
+ZEXTERN int ZEXPORT deflateInit2_ OF((z_streamp strm, int  level, int  method,
+                                      int windowBits, int memLevel,
+                                      int strategy, const char *version,
+                                      int stream_size));
+ZEXTERN int ZEXPORT inflateInit2_ OF((z_streamp strm, int  windowBits,
+                                      const char *version, int stream_size));
+ZEXTERN int ZEXPORT inflateBackInit_ OF((z_streamp strm, int windowBits,
+                                         unsigned char FAR *window,
+                                         const char *version,
+                                         int stream_size));
+#define deflateInit(strm, level) \
+        deflateInit_((strm), (level),       ZLIB_VERSION, sizeof(z_stream))
+#define inflateInit(strm) \
+        inflateInit_((strm),                ZLIB_VERSION, sizeof(z_stream))
+#define deflateInit2(strm, level, method, windowBits, memLevel, strategy) \
+        deflateInit2_((strm),(level),(method),(windowBits),(memLevel),\
+                      (strategy),           ZLIB_VERSION, sizeof(z_stream))
+#define inflateInit2(strm, windowBits) \
+        inflateInit2_((strm), (windowBits), ZLIB_VERSION, sizeof(z_stream))
+#define inflateBackInit(strm, windowBits, window) \
+        inflateBackInit_((strm), (windowBits), (window), \
+        ZLIB_VERSION, sizeof(z_stream))
+
+
+#if !defined(ZUTIL_H) && !defined(NO_DUMMY_DECL)
+    struct internal_state {int dummy;}; /* hack for buggy compilers */
+#endif
+
+ZEXTERN const char   * ZEXPORT zError           OF((int));
+ZEXTERN int            ZEXPORT inflateSyncPoint OF((z_streamp z));
+ZEXTERN const uLongf * ZEXPORT get_crc_table    OF((void));
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* ZLIB_H */
diff --git a/updater/zlib123/zutil.c b/updater/zlib123/zutil.c
new file mode 100644
index 0000000..4af7839
--- /dev/null
+++ b/updater/zlib123/zutil.c
@@ -0,0 +1,319 @@
+/* zutil.c -- target dependent utility functions for the compression library
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* @(#) $Id$ */
+
+#include "zutil.h"
+
+#ifndef NO_DUMMY_DECL
+struct internal_state      {int dummy;}; /* for buggy compilers */
+#endif
+
+const char * const z_errmsg[10] = {
+"need dictionary",     /* Z_NEED_DICT       2  */
+"stream end",          /* Z_STREAM_END      1  */
+"",                    /* Z_OK              0  */
+"file error",          /* Z_ERRNO         (-1) */
+"stream error",        /* Z_STREAM_ERROR  (-2) */
+"data error",          /* Z_DATA_ERROR    (-3) */
+"insufficient memory", /* Z_MEM_ERROR     (-4) */
+"buffer error",        /* Z_BUF_ERROR     (-5) */
+"incompatible version",/* Z_VERSION_ERROR (-6) */
+""};
+
+
+const char * ZEXPORT zlibVersion()
+{
+    return ZLIB_VERSION;
+}
+
+uLong ZEXPORT zlibCompileFlags()
+{
+    uLong flags;
+
+    flags = 0;
+    switch (sizeof(uInt)) {
+    case 2:     break;
+    case 4:     flags += 1;     break;
+    case 8:     flags += 2;     break;
+    default:    flags += 3;
+    }
+    switch (sizeof(uLong)) {
+    case 2:     break;
+    case 4:     flags += 1 << 2;        break;
+    case 8:     flags += 2 << 2;        break;
+    default:    flags += 3 << 2;
+    }
+    switch (sizeof(voidpf)) {
+    case 2:     break;
+    case 4:     flags += 1 << 4;        break;
+    case 8:     flags += 2 << 4;        break;
+    default:    flags += 3 << 4;
+    }
+    switch (sizeof(z_off_t)) {
+    case 2:     break;
+    case 4:     flags += 1 << 6;        break;
+    case 8:     flags += 2 << 6;        break;
+    default:    flags += 3 << 6;
+    }
+#ifdef DEBUG
+    flags += 1 << 8;
+#endif
+#if defined(ASMV) || defined(ASMINF)
+    flags += 1 << 9;
+#endif
+#ifdef ZLIB_WINAPI
+    flags += 1 << 10;
+#endif
+#ifdef BUILDFIXED
+    flags += 1 << 12;
+#endif
+#ifdef DYNAMIC_CRC_TABLE
+    flags += 1 << 13;
+#endif
+#ifdef NO_GZCOMPRESS
+    flags += 1L << 16;
+#endif
+#ifdef NO_GZIP
+    flags += 1L << 17;
+#endif
+#ifdef PKZIP_BUG_WORKAROUND
+    flags += 1L << 20;
+#endif
+#ifdef FASTEST
+    flags += 1L << 21;
+#endif
+#ifdef STDC
+#  ifdef NO_vsnprintf
+        flags += 1L << 25;
+#    ifdef HAS_vsprintf_void
+        flags += 1L << 26;
+#    endif
+#  else
+#    ifdef HAS_vsnprintf_void
+        flags += 1L << 26;
+#    endif
+#  endif
+#else
+        flags += 1L << 24;
+#  ifdef NO_snprintf
+        flags += 1L << 25;
+#    ifdef HAS_sprintf_void
+        flags += 1L << 26;
+#    endif
+#  else
+#    ifdef HAS_snprintf_void
+        flags += 1L << 26;
+#    endif
+#  endif
+#endif
+    return flags;
+}
+
+#ifdef DEBUG
+
+#  ifndef verbose
+#    define verbose 0
+#  endif
+int z_verbose = verbose;
+
+void z_error (m)
+    char *m;
+{
+    fprintf(stderr, "%s\n", m);
+    exit(1);
+}
+#endif
+
+/* exported to allow conversion of error code to string for compress() and
+ * uncompress()
+ */
+const char * ZEXPORT zError(int err)
+{
+    return ERR_MSG(err);
+}
+
+#if defined(_WIN32_WCE)
+    /* The Microsoft C Run-Time Library for Windows CE doesn't have
+     * errno.  We define it as a global variable to simplify porting.
+     * Its value is always 0 and should not be used.
+     */
+    int errno = 0;
+#endif
+
+#ifndef HAVE_MEMCPY
+
+void zmemcpy(
+    Bytef* dest,
+    const Bytef* source,
+    uInt  len)
+{
+    if (len == 0) return;
+    do {
+        *dest++ = *source++; /* ??? to be unrolled */
+    } while (--len != 0);
+}
+
+int zmemcmp(
+    const Bytef* s1,
+    const Bytef* s2,
+    uInt  len)
+{
+    uInt j;
+
+    for (j = 0; j < len; j++) {
+        if (s1[j] != s2[j]) return 2*(s1[j] > s2[j])-1;
+    }
+    return 0;
+}
+
+void zmemzero(dest, len)
+    Bytef* dest;
+    uInt  len;
+{
+    if (len == 0) return;
+    do {
+        *dest++ = 0;  /* ??? to be unrolled */
+    } while (--len != 0);
+}
+#endif
+
+
+#ifdef SYS16BIT
+
+#ifdef __TURBOC__
+/* Turbo C in 16-bit mode */
+
+#  define MY_ZCALLOC
+
+/* Turbo C malloc() does not allow dynamic allocation of 64K bytes
+ * and farmalloc(64K) returns a pointer with an offset of 8, so we
+ * must fix the pointer. Warning: the pointer must be put back to its
+ * original form in order to free it, use zcfree().
+ */
+
+#define MAX_PTR 10
+/* 10*64K = 640K */
+
+local int next_ptr = 0;
+
+typedef struct ptr_table_s {
+    voidpf org_ptr;
+    voidpf new_ptr;
+} ptr_table;
+
+local ptr_table table[MAX_PTR];
+/* This table is used to remember the original form of pointers
+ * to large buffers (64K). Such pointers are normalized with a zero offset.
+ * Since MSDOS is not a preemptive multitasking OS, this table is not
+ * protected from concurrent access. This hack doesn't work anyway on
+ * a protected system like OS/2. Use Microsoft C instead.
+ */
+
+voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
+{
+    voidpf buf = opaque; /* just to make some compilers happy */
+    ulg bsize = (ulg)items*size;
+
+    /* If we allocate less than 65520 bytes, we assume that farmalloc
+     * will return a usable pointer which doesn't have to be normalized.
+     */
+    if (bsize < 65520L) {
+        buf = farmalloc(bsize);
+        if (*(ush*)&buf != 0) return buf;
+    } else {
+        buf = farmalloc(bsize + 16L);
+    }
+    if (buf == NULL || next_ptr >= MAX_PTR) return NULL;
+    table[next_ptr].org_ptr = buf;
+
+    /* Normalize the pointer to seg:0 */
+    *((ush*)&buf+1) += ((ush)((uch*)buf-0) + 15) >> 4;
+    *(ush*)&buf = 0;
+    table[next_ptr++].new_ptr = buf;
+    return buf;
+}
+
+void  zcfree (voidpf opaque, voidpf ptr)
+{
+    int n;
+    if (*(ush*)&ptr != 0) { /* object < 64K */
+        farfree(ptr);
+        return;
+    }
+    /* Find the original pointer */
+    for (n = 0; n < next_ptr; n++) {
+        if (ptr != table[n].new_ptr) continue;
+
+        farfree(table[n].org_ptr);
+        while (++n < next_ptr) {
+            table[n-1] = table[n];
+        }
+        next_ptr--;
+        return;
+    }
+    ptr = opaque; /* just to make some compilers happy */
+    Assert(0, "zcfree: ptr not found");
+}
+
+#endif /* __TURBOC__ */
+
+
+#ifdef M_I86
+/* Microsoft C in 16-bit mode */
+
+#  define MY_ZCALLOC
+
+#if (!defined(_MSC_VER) || (_MSC_VER <= 600))
+#  define _halloc  halloc
+#  define _hfree   hfree
+#endif
+
+/*
+voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
+{
+    if (opaque) opaque = 0; // to make compiler happy 
+    return _halloc((long)items, size);
+}
+
+void  zcfree (voidpf opaque, voidpf ptr)
+{
+    if (opaque) opaque = 0; // to make compiler happy 
+    _hfree(ptr);
+}
+*/
+
+#endif /* M_I86 */
+
+#endif /* SYS16BIT */
+
+
+#ifndef MY_ZCALLOC /* Any system without a special alloc function */
+
+#ifndef STDC
+extern voidp  malloc OF((uInt size));
+extern voidp  calloc OF((uInt items, uInt size));
+extern void   free   OF((voidpf ptr));
+#endif
+
+voidpf zcalloc (
+    voidpf opaque,
+    unsigned items,
+    unsigned size)
+{
+    if (opaque) items += size - size; /* make compiler happy */
+    return sizeof(uInt) > 2 ? (voidpf)malloc(items * size) :
+                              (voidpf)calloc(items, size);
+}
+
+void  zcfree (
+    voidpf opaque,
+    voidpf ptr)
+{
+    free(ptr);
+    if (opaque) return; /* make compiler happy */
+}
+
+#endif /* MY_ZCALLOC */
diff --git a/updater/zlib123/zutil.h b/updater/zlib123/zutil.h
new file mode 100644
index 0000000..0ba6e02
--- /dev/null
+++ b/updater/zlib123/zutil.h
@@ -0,0 +1,269 @@
+/* zutil.h -- internal interface and configuration of the compression library
+ * Copyright (C) 1995-2005 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ */
+
+/* WARNING: this file should *not* be used by applications. It is
+   part of the implementation of the compression library and is
+   subject to change. Applications should only use zlib.h.
+ */
+
+/* @(#) $Id$ */
+
+#ifndef ZUTIL_H
+#define ZUTIL_H
+
+#define ZLIB_INTERNAL
+#include "zlib.h"
+
+#ifdef STDC
+#  ifndef _WIN32_WCE
+#    include <stddef.h>
+#  endif
+#  include <string.h>
+#  include <stdlib.h>
+#endif
+#ifdef NO_ERRNO_H
+#   ifdef _WIN32_WCE
+      /* The Microsoft C Run-Time Library for Windows CE doesn't have
+       * errno.  We define it as a global variable to simplify porting.
+       * Its value is always 0 and should not be used.  We rename it to
+       * avoid conflict with other libraries that use the same workaround.
+       */
+#     define errno z_errno
+#   endif
+    extern int errno;
+#else
+#  ifndef _WIN32_WCE
+#    include <errno.h>
+#  endif
+#endif
+
+#ifndef local
+#  define local static
+#endif
+/* compile with -Dlocal if your debugger can't find static symbols */
+
+typedef unsigned char  uch;
+typedef uch FAR uchf;
+typedef unsigned short ush;
+typedef ush FAR ushf;
+typedef unsigned long  ulg;
+
+extern const char * const z_errmsg[10]; /* indexed by 2-zlib_error */
+/* (size given to avoid silly warnings with Visual C++) */
+
+#define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)]
+
+#define ERR_RETURN(strm,err) \
+  return (strm->msg = (char*)ERR_MSG(err), (err))
+/* To be used only when the state is known to be valid */
+
+        /* common constants */
+
+#ifndef DEF_WBITS
+#  define DEF_WBITS MAX_WBITS
+#endif
+/* default windowBits for decompression. MAX_WBITS is for compression only */
+
+#if MAX_MEM_LEVEL >= 8
+#  define DEF_MEM_LEVEL 8
+#else
+#  define DEF_MEM_LEVEL  MAX_MEM_LEVEL
+#endif
+/* default memLevel */
+
+#define STORED_BLOCK 0
+#define STATIC_TREES 1
+#define DYN_TREES    2
+/* The three kinds of block type */
+
+#define MIN_MATCH  3
+#define MAX_MATCH  258
+/* The minimum and maximum match lengths */
+
+#define PRESET_DICT 0x20 /* preset dictionary flag in zlib header */
+
+        /* target dependencies */
+
+#if defined(MSDOS) || (defined(WINDOWS) && !defined(WIN32))
+#  define OS_CODE  0x00
+#  if defined(__TURBOC__) || defined(__BORLANDC__)
+#    if(__STDC__ == 1) && (defined(__LARGE__) || defined(__COMPACT__))
+       /* Allow compilation with ANSI keywords only enabled */
+       void _Cdecl farfree( void *block );
+       void *_Cdecl farmalloc( unsigned long nbytes );
+#    else
+#      include <alloc.h>
+#    endif
+#  else /* MSC or DJGPP */
+#    include <malloc.h>
+#  endif
+#endif
+
+#ifdef AMIGA
+#  define OS_CODE  0x01
+#endif
+
+#if defined(VAXC) || defined(VMS)
+#  define OS_CODE  0x02
+#  define F_OPEN(name, mode) \
+     fopen((name), (mode), "mbc=60", "ctx=stm", "rfm=fix", "mrs=512")
+#endif
+
+#if defined(ATARI) || defined(atarist)
+#  define OS_CODE  0x05
+#endif
+
+#ifdef OS2
+#  define OS_CODE  0x06
+#  ifdef M_I86
+     #include <malloc.h>
+#  endif
+#endif
+
+#if defined(MACOS) || defined(TARGET_OS_MAC)
+#  define OS_CODE  0x07
+#  if defined(__MWERKS__) && __dest_os != __be_os && __dest_os != __win32_os
+#    include <unix.h> /* for fdopen */
+#  else
+#    ifndef fdopen
+#      define fdopen(fd,mode) NULL /* No fdopen() */
+#    endif
+#  endif
+#endif
+
+#ifdef TOPS20
+#  define OS_CODE  0x0a
+#endif
+
+#ifdef WIN32
+#  ifndef __CYGWIN__  /* Cygwin is Unix, not Win32 */
+#    define OS_CODE  0x0b
+#  endif
+#endif
+
+#ifdef __50SERIES /* Prime/PRIMOS */
+#  define OS_CODE  0x0f
+#endif
+
+#if defined(_BEOS_) || defined(RISCOS)
+#  define fdopen(fd,mode) NULL /* No fdopen() */
+#endif
+
+#if (defined(_MSC_VER) && (_MSC_VER > 600))
+#  if defined(_WIN32_WCE)
+#    define fdopen(fd,mode) NULL /* No fdopen() */
+#    ifndef _PTRDIFF_T_DEFINED
+       typedef int ptrdiff_t;
+#      define _PTRDIFF_T_DEFINED
+#    endif
+#  else
+#    define fdopen(fd,type)  _fdopen(fd,type)
+#  endif
+#endif
+
+        /* common defaults */
+
+#ifndef OS_CODE
+#  define OS_CODE  0x03  /* assume Unix */
+#endif
+
+#ifndef F_OPEN
+#  define F_OPEN(name, mode) fopen((name), (mode))
+#endif
+
+         /* functions */
+
+#if defined(STDC99) || (defined(__TURBOC__) && __TURBOC__ >= 0x550)
+#  ifndef HAVE_VSNPRINTF
+#    define HAVE_VSNPRINTF
+#  endif
+#endif
+#if defined(__CYGWIN__)
+#  ifndef HAVE_VSNPRINTF
+#    define HAVE_VSNPRINTF
+#  endif
+#endif
+#ifndef HAVE_VSNPRINTF
+#  ifdef MSDOS
+     /* vsnprintf may exist on some MS-DOS compilers (DJGPP?),
+        but for now we just assume it doesn't. */
+#    define NO_vsnprintf
+#  endif
+#  ifdef __TURBOC__
+#    define NO_vsnprintf
+#  endif
+#  ifdef WIN32
+     /* In Win32, vsnprintf is available as the "non-ANSI" _vsnprintf. */
+#    if !defined(vsnprintf) && !defined(NO_vsnprintf)
+#      define vsnprintf _vsnprintf
+#    endif
+#  endif
+#  ifdef __SASC
+#    define NO_vsnprintf
+#  endif
+#endif
+#ifdef VMS
+#  define NO_vsnprintf
+#endif
+
+#if defined(pyr)
+#  define NO_MEMCPY
+#endif
+#if defined(SMALL_MEDIUM) && !defined(_MSC_VER) && !defined(__SC__)
+ /* Use our own functions for small and medium model with MSC <= 5.0.
+  * You may have to use the same strategy for Borland C (untested).
+  * The __SC__ check is for Symantec.
+  */
+#  define NO_MEMCPY
+#endif
+#if defined(STDC) && !defined(HAVE_MEMCPY) && !defined(NO_MEMCPY)
+#  define HAVE_MEMCPY
+#endif
+#ifdef HAVE_MEMCPY
+#  ifdef SMALL_MEDIUM /* MSDOS small or medium model */
+#    define zmemcpy _fmemcpy
+#    define zmemcmp _fmemcmp
+#    define zmemzero(dest, len) _fmemset(dest, 0, len)
+#  else
+#    define zmemcpy memcpy
+#    define zmemcmp memcmp
+#    define zmemzero(dest, len) memset(dest, 0, len)
+#  endif
+#else
+   extern void zmemcpy  OF((Bytef* dest, const Bytef* source, uInt len));
+   extern int  zmemcmp  OF((const Bytef* s1, const Bytef* s2, uInt len));
+   extern void zmemzero OF((Bytef* dest, uInt len));
+#endif
+
+/* Diagnostic functions */
+#ifdef DEBUG
+#  include <stdio.h>
+   extern int z_verbose;
+   extern void z_error    OF((char *m));
+#  define Assert(cond,msg) {if(!(cond)) z_error(msg);}
+#  define Trace(x) {if (z_verbose>=0) fprintf x ;}
+#  define Tracev(x) {if (z_verbose>0) fprintf x ;}
+#  define Tracevv(x) {if (z_verbose>1) fprintf x ;}
+#  define Tracec(c,x) {if (z_verbose>0 && (c)) fprintf x ;}
+#  define Tracecv(c,x) {if (z_verbose>1 && (c)) fprintf x ;}
+#else
+#  define Assert(cond,msg)
+#  define Trace(x)
+#  define Tracev(x)
+#  define Tracevv(x)
+#  define Tracec(c,x)
+#  define Tracecv(c,x)
+#endif
+
+
+voidpf zcalloc OF((voidpf opaque, unsigned items, unsigned size));
+void   zcfree  OF((voidpf opaque, voidpf ptr));
+
+#define ZALLOC(strm, items, size) \
+           (*((strm)->zalloc))((strm)->opaque, (items), (size))
+#define ZFREE(strm, addr)  (*((strm)->zfree))((strm)->opaque, (voidpf)(addr))
+#define TRY_FREE(s, p) {if (p) ZFREE(s, p);}
+
+#endif /* ZUTIL_H */
author	sje <sje@4f64403b-2f21-0410-a795-97e2b3489a10>	2006-11-01 14:48:34 +0000
committer	sje <sje@4f64403b-2f21-0410-a795-97e2b3489a10>	2006-11-01 14:48:34 +0000
commit	d123e0ce94bf90b2adb0a4000930eb467e293226 (patch)
tree	d414dea59908105c4d2f256199a610e0a69c8690
parent	a13e82647294da4add976a24335fec50d7bfe905 (diff)