304 files changed, 171643 insertions, 0 deletions
diff --git a/contrib/Makefile.am b/contrib/Makefile.am
new file mode 100644
index 00000000000..52a046b5378
--- /dev/null
+++ b/contrib/Makefile.am
@@ -0,0 +1,23 @@
+# Copyright (C) 2005-2008 MaNGOS <http://www.mangosproject.org/>
+#
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+## Process this file with automake to produce Makefile.in
+
+## Sub-directories to parse
+SUBDIRS = extractor
+
+## Additional files to include when running 'make dist'
+#  Nothing yet.
diff --git a/contrib/dbcEditer/BcdEditer.ini b/contrib/dbcEditer/BcdEditer.ini
new file mode 100644
index 00000000000..99284e8b967
--- /dev/null
+++ b/contrib/dbcEditer/BcdEditer.ini
@@ -0,0 +1,34 @@
+[TaxiNodes.dbc]
+ColType2=0
+ColType3=1
+ColType4=1
+[SpellRange.dbc]
+ColType2=0
+ColType3=0
+ColType1=0
+[Talent.dbc]
+ColType1=0
+ColType5=0
+ColType4=0
+[test.dbc]
+ColType1=0
+ColType3=1
+ColType2=0
+[TalentTab.dbc]
+ColType15=2
+[TalentTab_new.dbc]
+ColType15=2
+[SpellIcon.dbc]
+ColType2=0
+ColType1=0
+[FactionGroup.dbc]
+ColType12=0
+ColType3=2
+ColType2=0
+ColType8=0
+[gtRegenMPPerSpt.dbc]
+ColType1=1
+[gtOCTRegenMP.dbc]
+ColType1=1
+[gtOCTRegenHP.dbc]
+ColType1=1
diff --git a/contrib/dbcEditer/SearchFrm.cpp b/contrib/dbcEditer/SearchFrm.cpp
new file mode 100644
index 00000000000..59e198dfb8a
--- /dev/null
+++ b/contrib/dbcEditer/SearchFrm.cpp
@@ -0,0 +1,26 @@
+//---------------------------------------------------------------------------
+
+#include <vcl.h>
+#pragma hdrstop
+
+#include "SearchFrm.h"
+//---------------------------------------------------------------------------
+#pragma package(smart_init)
+#pragma resource "*.dfm"
+TFrmSearch *FrmSearch;
+//---------------------------------------------------------------------------
+__fastcall TFrmSearch::TFrmSearch(TComponent* Owner)
+        : TForm(Owner)
+{
+}
+//---------------------------------------------------------------------------
+void __fastcall TFrmSearch::btOkClick(TObject *Sender)
+{
+     ModalResult = mrOk;        
+}
+//---------------------------------------------------------------------------
+void __fastcall TFrmSearch::btCancelClick(TObject *Sender)
+{
+     ModalResult = mrCancel;        
+}
+//---------------------------------------------------------------------------
diff --git a/contrib/dbcEditer/SearchFrm.ddp b/contrib/dbcEditer/SearchFrm.ddp
new file mode 100644
index 00000000000..cdc0ee8c2b5
--- /dev/null
+++ b/contrib/dbcEditer/SearchFrm.ddp
diff --git a/contrib/dbcEditer/SearchFrm.dfm b/contrib/dbcEditer/SearchFrm.dfm
new file mode 100644
index 00000000000..134c881cbfb
--- /dev/null
+++ b/contrib/dbcEditer/SearchFrm.dfm
@@ -0,0 +1,63 @@
+object FrmSearch: TFrmSearch
+  Left = 261
+  Top = 194
+  Width = 324
+  Height = 215
+  Caption = 'Seach F3 Seach Next'
+  Color = clBtnFace
+  Font.Charset = DEFAULT_CHARSET
+  Font.Color = clWindowText
+  Font.Height = -11
+  Font.Name = 'MS Sans Serif'
+  Font.Style = []
+  OldCreateOrder = False
+  PixelsPerInch = 96
+  TextHeight = 13
+  object lbseach: TLabel
+    Left = 48
+    Top = 16
+    Width = 57
+    Height = 17
+    AutoSize = False
+    Caption = 'Input:'
+  end
+  object rgSI: TRadioGroup
+    Left = 64
+    Top = 40
+    Width = 185
+    Height = 97
+    Caption = 'Seach Dir'
+    ItemIndex = 1
+    Items.Strings = (
+      'Seach up'
+      'Seach down'
+      'Seach up Current rol'
+      'Seach down Current rol')
+    TabOrder = 0
+  end
+  object edSeach: TEdit
+    Left = 120
+    Top = 16
+    Width = 121
+    Height = 21
+    TabOrder = 1
+  end
+  object btOk: TButton
+    Left = 64
+    Top = 152
+    Width = 75
+    Height = 25
+    Caption = 'Ok'
+    TabOrder = 2
+    OnClick = btOkClick
+  end
+  object btCancel: TButton
+    Left = 176
+    Top = 152
+    Width = 75
+    Height = 25
+    Caption = 'Cancel'
+    TabOrder = 3
+    OnClick = btCancelClick
+  end
+end
diff --git a/contrib/dbcEditer/SearchFrm.h b/contrib/dbcEditer/SearchFrm.h
new file mode 100644
index 00000000000..246d7e68204
--- /dev/null
+++ b/contrib/dbcEditer/SearchFrm.h
@@ -0,0 +1,29 @@
+//---------------------------------------------------------------------------
+
+#ifndef SearchFrmH
+#define SearchFrmH
+//---------------------------------------------------------------------------
+#include <Classes.hpp>
+#include <Controls.hpp>
+#include <StdCtrls.hpp>
+#include <Forms.hpp>
+#include <ExtCtrls.hpp>
+//---------------------------------------------------------------------------
+class TFrmSearch : public TForm
+{
+__published:	// IDE-managed Components
+        TRadioGroup *rgSI;
+        TEdit *edSeach;
+        TLabel *lbseach;
+        TButton *btOk;
+        TButton *btCancel;
+        void __fastcall btOkClick(TObject *Sender);
+        void __fastcall btCancelClick(TObject *Sender);
+private:	// User declarations
+public:		// User declarations
+        __fastcall TFrmSearch(TComponent* Owner);
+};
+//---------------------------------------------------------------------------
+extern PACKAGE TFrmSearch *FrmSearch;
+//---------------------------------------------------------------------------
+#endif
diff --git a/contrib/dbcEditer/TitleFrm.cpp b/contrib/dbcEditer/TitleFrm.cpp
new file mode 100644
index 00000000000..a26e93ce5ec
--- /dev/null
+++ b/contrib/dbcEditer/TitleFrm.cpp
@@ -0,0 +1,26 @@
+//---------------------------------------------------------------------------
+
+#include <vcl.h>
+#pragma hdrstop
+
+#include "TitleFrm.h"
+//---------------------------------------------------------------------------
+#pragma package(smart_init)
+#pragma resource "*.dfm"
+TFrmTitle *FrmTitle;
+//---------------------------------------------------------------------------
+__fastcall TFrmTitle::TFrmTitle(TComponent* Owner)
+        : TForm(Owner)
+{
+}
+//---------------------------------------------------------------------------
+void __fastcall TFrmTitle::Button1Click(TObject *Sender)
+{
+    ModalResult = mrOk;
+}
+//---------------------------------------------------------------------------
+void __fastcall TFrmTitle::Button2Click(TObject *Sender)
+{
+    ModalResult = mrCancel;
+}
+//---------------------------------------------------------------------------
diff --git a/contrib/dbcEditer/TitleFrm.ddp b/contrib/dbcEditer/TitleFrm.ddp
new file mode 100644
index 00000000000..cdc0ee8c2b5
--- /dev/null
+++ b/contrib/dbcEditer/TitleFrm.ddp
diff --git a/contrib/dbcEditer/TitleFrm.dfm b/contrib/dbcEditer/TitleFrm.dfm
new file mode 100644
index 00000000000..3f472d59bcf
--- /dev/null
+++ b/contrib/dbcEditer/TitleFrm.dfm
@@ -0,0 +1,51 @@
+object FrmTitle: TFrmTitle
+  Left = 328
+  Top = 252
+  Width = 235
+  Height = 112
+  BorderIcons = [biSystemMenu]
+  Caption = 'Col Title'
+  Color = clBtnFace
+  Font.Charset = DEFAULT_CHARSET
+  Font.Color = clWindowText
+  Font.Height = -11
+  Font.Name = 'MS Sans Serif'
+  Font.Style = []
+  OldCreateOrder = False
+  Position = poDesktopCenter
+  PixelsPerInch = 96
+  TextHeight = 13
+  object Label1: TLabel
+    Left = 8
+    Top = 24
+    Width = 65
+    Height = 13
+    AutoSize = False
+    Caption = 'Title:'
+  end
+  object edTitle: TEdit
+    Left = 80
+    Top = 16
+    Width = 121
+    Height = 21
+    TabOrder = 0
+  end
+  object Button1: TButton
+    Left = 24
+    Top = 48
+    Width = 75
+    Height = 25
+    Caption = 'Ok'
+    TabOrder = 1
+    OnClick = Button1Click
+  end
+  object Button2: TButton
+    Left = 136
+    Top = 48
+    Width = 75
+    Height = 25
+    Caption = 'Cancel'
+    TabOrder = 2
+    OnClick = Button2Click
+  end
+end
diff --git a/contrib/dbcEditer/TitleFrm.h b/contrib/dbcEditer/TitleFrm.h
new file mode 100644
index 00000000000..2316d8fec96
--- /dev/null
+++ b/contrib/dbcEditer/TitleFrm.h
@@ -0,0 +1,27 @@
+//---------------------------------------------------------------------------
+
+#ifndef TitleFrmH
+#define TitleFrmH
+//---------------------------------------------------------------------------
+#include <Classes.hpp>
+#include <Controls.hpp>
+#include <StdCtrls.hpp>
+#include <Forms.hpp>
+//---------------------------------------------------------------------------
+class TFrmTitle : public TForm
+{
+__published:	// IDE-managed Components
+        TLabel *Label1;
+        TEdit *edTitle;
+        TButton *Button1;
+        TButton *Button2;
+        void __fastcall Button1Click(TObject *Sender);
+        void __fastcall Button2Click(TObject *Sender);
+private:	// User declarations
+public:		// User declarations
+        __fastcall TFrmTitle(TComponent* Owner);
+};
+//---------------------------------------------------------------------------
+extern PACKAGE TFrmTitle *FrmTitle;
+//---------------------------------------------------------------------------
+#endif
diff --git a/contrib/dbcEditer/bin/BcdEditer.ini b/contrib/dbcEditer/bin/BcdEditer.ini
new file mode 100644
index 00000000000..100029b418e
--- /dev/null
+++ b/contrib/dbcEditer/bin/BcdEditer.ini
@@ -0,0 +1,313 @@
+[FactionGroup.dbc]
+ColType3=2
+[Spell.dbc]
+ColTitle1=Id
+ColTitle2=Category
+ColTitle3=castUI
+ColTitle4=Dispel
+ColTitle5=Mechanic
+ColTitle6=Attributes
+ColTitle7=AttributesEx;
+ColTitle8=AttributesEx2;
+ColTitle9=AttributesEx3;
+ColTitle10=AttributesEx4;
+ColTitle11=AttributesEx5;
+ColTitle12=AttributesEx6;
+ColTitle13=Stances;
+ColTitle14=StancesNot;
+ColTitle15=Targets;
+ColTitle16=TargetCreatureType;
+ColTitle17=RequiresSpellFocus;
+ColTitle18=FacingCasterFlags;
+ColTitle19=CasterAuraState;
+ColTitle20=TargetAuraState;
+ColTitle21=CasterAuraStateNot;
+ColTitle22=TargetAuraStateNot;
+ColTitle23=CastingTimeIndex;
+ColTitle24=RecoveryTime;
+ColTitle25=CategoryRecoveryTime;
+ColTitle26=InterruptFlags;
+ColTitle27=AuraInterruptFlags;
+ColTitle28=ChannelInterruptFlags;
+ColTitle29=procFlags;
+ColTitle30=procChance;
+ColTitle31=procCharges;
+ColTitle32=maxLevel;
+ColTitle33=baseLevel;
+ColTitle34=spellLevel;
+ColTitle35=DurationIndex;
+ColTitle36=powerType;
+ColTitle37=manaCost;
+ColTitle38=manaCostPerlevel;
+ColTitle39=manaPerSecond;
+ColTitle40=manaPerSecondPerLevel;
+ColTitle41=rangeIndex;
+ColTitle42=floatspeed;
+ColTitle43=modalNextSpell;//38
+ColTitle44=StackAmount;
+ColTitle45=Totem1
+ColTitle46=Totem2
+ColTitle47=Reagent
+ColTitle48=Reagent2
+ColTitle49=Reagent3
+ColTitle50=Reagent4
+ColTitle51=Reagent5
+ColTitle52=Reagent6
+ColTitle53=Reagent7
+ColTitle54=Reagent8
+ColTitle55=ReagentCount1
+ColTitle56=ReagentCount2
+ColTitle57=ReagentCount3
+ColTitle58=ReagentCount4
+ColTitle59=ReagentCount5
+ColTitle60=ReagentCount6
+ColTitle61=ReagentCount7
+ColTitle62=ReagentCount8
+
+ColTitle63=EqpItemClass
+ColTitle64=EquipItemSubClassMask
+ColTitle65=ItemInventoryTypeMask
+ColTitle66=Effect
+ColTitle67=Effect2
+ColTitle68=Effect3
+ColTitle69=EffectDieSides1
+ColTitle70=EffectDieSides2
+ColTitle71=EffectDieSides3
+ColTitle72=EffectBaseDice1
+ColTitle73=EffectBaseDice2
+ColTitle74=EffectBaseDice3
+ColTitle75=EffectDicePerLevel1
+ColTitle76=EffectDicePerLevel2
+ColTitle77=EffectDicePerLevel3
+ColTitle78=EffectRealPointsPerLevel1
+ColTitle79=EffectRealPointsPerLevel2
+ColTitle80=EffectRealPointsPerLevel3
+ColTitle81=BasePoints1
+ColTitle82=BasePoints2
+ColTitle83=BasePoints3
+ColTitle84=EffectMechanic1
+ColTitle85=EffectMechanic2
+ColTitle86=EffectMechanic3
+
+
+ColTitle87=ImplicTargA1
+ColTitle88=ImplicTargA2
+ColTitle89=ImplicTargA3
+ColTitle90=ImplicTargB1
+ColTitle91=ImplicTargB2
+ColTitle92=ImplicTargB3
+ColTitle93=RadiusIndex1
+ColTitle94=RadiusIndex2
+ColTitle95=RadiusIndex3
+ColTitle96=ApplyAuraName1
+ColTitle97=ApplyAuraName2
+ColTitle98=ApplyAuraName3
+ColTitle99=Amplitude1
+ColTitle100=Amplitude2
+ColTitle101=Amplitude3
+ColTitle102=MultiVal1
+ColTitle103=MultiVal2
+ColTitle104=MultiVal3
+ColTitle105=ChainTarg1
+ColTitle106=ChainTarg2
+ColTitle107=ChainTarg3
+ColTitle108=EffectItemType1
+ColTitle109=EffectItemType2
+ColTitle110=EffectItemType3
+ColTitle111=EffectMiscVal1
+ColTitle112=EffectMiscVal2
+ColTitle113=EffectMiscVal3
+ColTitle114=EffectMiscValB1
+ColTitle115=EffectMiscValB2
+ColTitle116=EffectMiscValB3
+ColTitle117=EffectTriggerSpell1
+ColTitle118=EffectTriggerSpell2
+ColTitle119=EffectTriggerSpell3
+ColTitle120=EffectPointsPerComboPoint1
+ColTitle121=EffectPointsPerComboPoint2
+ColTitle122=EffectPointsPerComboPoint3
+ColTitle123=SpellVisual
+ColTitle125=SpellIconID
+ColTitle126=activeIconID
+ColTitle127=spellPriority
+ColTitle128=SpellName1
+ColTitle129=SpellName2
+ColTitle130=SpellName3
+ColTitle131=SpellName4
+ColTitle132=SpellName5
+ColTitle133=SpellName6
+ColTitle134=SpellName7
+ColTitle135=SpellName8
+ColTitle136=SpellName9
+ColTitle137=SpellName10
+ColTitle138=SpellName11
+ColTitle139=SpellName12
+ColTitle140=SpellName13
+ColTitle141=SpellName14
+ColTitle142=SpellName15
+ColTitle143=SpellName16
+ColTitle144=SpellNameFlag
+ColTitle145=Rank1
+ColTitle146=Rank2
+ColTitle147=Rank3
+ColTitle148=Rank4
+ColTitle149=Rank5
+ColTitle150=Rank6
+ColTitle151=Rank7
+ColTitle152=Rank8
+ColTitle153=Rank9
+ColTitle154=Rank10
+ColTitle155=Rank11
+ColTitle156=Rank12
+ColTitle157=Rank13
+ColTitle158=Rank14
+ColTitle159=Rank15
+ColTitle160=Rank16
+ColTitle161=RankFlags
+ColTitle162=Description1
+ColTitle163=Description2
+ColTitle164=Description3
+ColTitle165=Description4
+ColTitle166=Description5
+ColTitle167=Description6
+ColTitle168=Description7
+ColTitle169=Description8
+ColTitle170=Description9
+ColTitle171=Description10
+ColTitle172=Description11
+ColTitle173=Description12
+ColTitle174=Description13
+ColTitle175=Description14
+ColTitle176=Description15
+ColTitle177=Description16
+ColTitle178=DescriptionFlags
+ColTitle179=ToolTip1
+ColTitle180=ToolTip2
+ColTitle181=ToolTip3
+ColTitle182=ToolTip4
+ColTitle183=ToolTip5
+ColTitle184=ToolTip6
+ColTitle185=ToolTip7
+ColTitle186=ToolTip8
+ColTitle187=ToolTip9
+ColTitle188=ToolTip10
+ColTitle189=ToolTip11
+ColTitle190=ToolTip12
+ColTitle191=ToolTip13
+ColTitle192=ToolTip14
+ColTitle193=ToolTip15
+ColTitle194=ToolTip16
+ColTitle195=ToolTipFlags
+ColTitle196=ManaCostPercentage
+ColTitle197=StartRecoveryCategory
+ColTitle198=StartRecoveryTime
+ColTitle199=MaxTargetLevel
+ColTitle200=SpellFamilyName
+ColTitle201=SpellFamilyFlags1
+ColTitle202=SpellFamilyFlags2
+ColTitle203=MaxAffectedTargets
+ColTitle204=DmgClass
+ColTitle205=PreventionType
+ColTitle206=StanceBarOrder
+ColTitle207=DmgMultiplier1
+ColTitle208=DmgMultiplier2
+ColTitle209=DmgMultiplier3
+ColTitle210=MinFactionId
+ColTitle211=MinReputation
+ColTitle212=RequiredAuraVision
+ColTitle213=TotemCategory1
+ColTitle214=TotemCategory2
+ColTitle215=AreaId
+ColTitle216=SchoolMask
+ColType102=1
+ColType103=1
+ColType104=1
+ColType128=2
+ColType129=2
+ColType130=2
+ColType131=2
+ColType132=2
+ColType133=2
+ColType134=2
+ColType135=2
+ColType136=2
+ColType137=2
+ColType138=2
+ColType139=2
+ColType140=2
+ColType141=2
+ColType142=2
+ColType143=2
+ColType145=2
+ColType146=2
+ColType147=2
+ColType148=2
+ColType149=2
+ColType150=2
+ColType151=2
+ColType152=2
+ColType153=2
+ColType154=2
+ColType155=2
+ColType157=2
+ColType156=2
+ColType158=2
+ColType159=2
+ColType160=2
+ColType162=2
+ColType163=2
+ColType164=2
+ColType165=2
+ColType166=2
+ColType167=2
+ColType168=2
+ColType169=2
+ColType170=2
+ColType171=2
+ColType172=2
+ColType173=2
+ColType174=2
+ColType175=2
+ColType176=2
+ColType177=2
+ColType179=2
+ColType180=2
+ColType181=2
+ColType182=2
+ColType183=2
+ColType184=2
+ColType185=2
+ColType186=2
+ColType187=2
+ColType188=2
+ColType189=2
+ColType190=2
+ColType191=2
+ColType192=2
+ColType193=2
+ColType194=2
+ColType208=1
+ColType209=1
+ColType207=1
+[Map.dbc]
+ColType2=2
+ColType8=0
+[AreaTrigger.dbc]
+ColTitle3=x
+ColTitle4=y
+ColTitle5=z
+ColTitle1=id
+ColTitle2=map
+ColType3=1
+ColType4=1
+ColType5=1
+ColType6=1
+ColType7=1
+ColType8=1
+ColType9=1
+ColType10=1
+ColTitle6=radius
+ColTitle7=box x
+ColTitle8=box y
+ColTitle9=box z
+ColTitle10=box orientation
diff --git a/contrib/dbcEditer/bin/bcbsmp60.bpl b/contrib/dbcEditer/bin/bcbsmp60.bpl
new file mode 100644
index 00000000000..32ebe0d1dee
--- /dev/null
+++ b/contrib/dbcEditer/bin/bcbsmp60.bpl
diff --git a/contrib/dbcEditer/bin/borlndmm.dll b/contrib/dbcEditer/bin/borlndmm.dll
new file mode 100644
index 00000000000..5a8eec327d6
--- /dev/null
+++ b/contrib/dbcEditer/bin/borlndmm.dll
diff --git a/contrib/dbcEditer/bin/cc3260mt.dll b/contrib/dbcEditer/bin/cc3260mt.dll
new file mode 100644
index 00000000000..fef4636a1e0
--- /dev/null
+++ b/contrib/dbcEditer/bin/cc3260mt.dll
diff --git a/contrib/dbcEditer/bin/dclusr60.bpl b/contrib/dbcEditer/bin/dclusr60.bpl
new file mode 100644
index 00000000000..002a741f61d
--- /dev/null
+++ b/contrib/dbcEditer/bin/dclusr60.bpl
diff --git a/contrib/dbcEditer/bin/indy60.bpl b/contrib/dbcEditer/bin/indy60.bpl
new file mode 100644
index 00000000000..f3cb7d6ca09
--- /dev/null
+++ b/contrib/dbcEditer/bin/indy60.bpl
diff --git a/contrib/dbcEditer/bin/pjDbcEditer.exe b/contrib/dbcEditer/bin/pjDbcEditer.exe
new file mode 100644
index 00000000000..9b11ec74614
--- /dev/null
+++ b/contrib/dbcEditer/bin/pjDbcEditer.exe
diff --git a/contrib/dbcEditer/bin/rtl60.bpl b/contrib/dbcEditer/bin/rtl60.bpl
new file mode 100644
index 00000000000..96a55c64d52
--- /dev/null
+++ b/contrib/dbcEditer/bin/rtl60.bpl
diff --git a/contrib/dbcEditer/bin/update.txt b/contrib/dbcEditer/bin/update.txt
new file mode 100644
index 00000000000..e3d39c92859
--- /dev/null
+++ b/contrib/dbcEditer/bin/update.txt
@@ -0,0 +1,11 @@
+1.4�����
+   1.�����˳�ʱ��ʱ�˲�����bug
+   2.����ɲ��ҵĹ���
+   3.�������л����ͺ�����ˢ��
+   4.������Ե�ǰ��Ԫ��д����ļ��Ĺ���
+   5.����ÿһ�еĿ��ȿɵ���
+   6.����֧���ı���ʾ���������޸ģ��ı��޸ĺ󲻻����
+
+1.41��
+  1.���Թ̶���ȡ����һ�У��Է���鿴Spell ID
+  2.�����д棬�д棬���壬���壬���ü����� 
+\ No newline at end of file
diff --git a/contrib/dbcEditer/bin/vcl60.bpl b/contrib/dbcEditer/bin/vcl60.bpl
new file mode 100644
index 00000000000..0f0cc71ce36
--- /dev/null
+++ b/contrib/dbcEditer/bin/vcl60.bpl
diff --git a/contrib/dbcEditer/bin/vclx60.bpl b/contrib/dbcEditer/bin/vclx60.bpl
new file mode 100644
index 00000000000..6fe6ac6f535
--- /dev/null
+++ b/contrib/dbcEditer/bin/vclx60.bpl
diff --git a/contrib/dbcEditer/dbcedit.cpp b/contrib/dbcEditer/dbcedit.cpp
new file mode 100644
index 00000000000..2812a3f7071
--- /dev/null
+++ b/contrib/dbcEditer/dbcedit.cpp
@@ -0,0 +1,769 @@
+//---------------------------------------------------------------------------
+
+#include <vcl.h>
+#pragma hdrstop
+
+#include "dbcedit.h"
+#include "stdio.h"
+#include "IdGlobal.hpp"
+#include <inifiles.hpp>
+#include "TitleFrm.h"
+#include <dir.h>
+#include "thOpenSource.h"
+#include "SearchFrm.h"
+//#include "SysUtils.hpp"
+
+
+//---------------------------------------------------------------------------
+#pragma package(smart_init)
+#pragma resource "*.dfm"
+TFrmMain *FrmMain;
+//---------------------------------------------------------------------------
+__fastcall TFrmMain::TFrmMain(TComponent* Owner)
+        : TForm(Owner)
+{
+    OpenOk=false;
+    Term=false;
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::btOpenClick(TObject *Sender)
+{
+    if(OpenDialog1->Execute()){
+         if (FileExists(OpenDialog1->FileName)){
+             OpenOk=false;
+             if(thOpen){
+                 thOpen->Terminate();
+             }
+             thOpen = new thOpenFile(false);
+             //thOpen->Priority = tpTimeCritical;
+             pnFileName->Caption = OpenDialog1->FileName;
+         }else{
+             OpenOk=false;
+             pnFileName->Caption = "";
+         }
+    }
+}
+//---------------------------------------------------------------------------
+void __fastcall TFrmMain::btSaveClick(TObject *Sender)
+{
+    //CurrentOpenFile;
+    if(OpenOk){
+        SaveToFile(CurrentOpenFile.c_str());
+    }else{
+        ShowMessage("�ļ�δ����ɣ�");
+    }
+}
+//---------------------------------------------------------------------------
+
+void TFrmMain::SaveToFile(const char * pszFileName)
+{
+     char szFileName[255];
+     FILE *stream;
+
+     
+
+
+      fnsplit(pszFileName, 0, 0, szFileName, 0);
+      strcat(szFileName, "_new.dbc");
+
+
+        AnsiString NewFileName=ExtractFilePath(Application->ExeName)+szFileName;//=pszFileName;
+        int iFileHandle; //�ļ����
+        AnsiString  iniSetFile=ExtractFilePath(Application->ExeName)+"BcdEditer.ini";
+        AnsiString SectionName=ExtractFileName(CurrentOpenFile);
+
+        DWORD w;
+
+        CopyFileTo(pszFileName,NewFileName);
+
+       iFileHandle = FileOpen(NewFileName, fmOpenRead|fmOpenWrite);//���ļ�
+
+     if ((stream = fopen(CurrentOpenFile.c_str(), "r+"))
+       == NULL)
+     {
+      ShowMessage("���ļ�����");
+      return;
+     }
+
+
+        int iVal;
+        float fVal;
+        bool isFloat;
+        int ColType;
+
+        FileSeek(iFileHandle,0x14,0);
+        TIniFile *ini;
+        ini = new TIniFile( iniSetFile );
+
+	for(int i=1; i<sgEdit->RowCount; i++)
+	{
+            for(int j=1; j<sgEdit->ColCount; j++)
+	    {
+               if(j==1){ //ID
+                       iVal=StrToInt(sgEdit->Cells[j][i]);
+                       FileWrite(iFileHandle, &iVal, 4);
+               }else{
+
+                       //ColType= ini->ReadInteger(SectionName,"ColType"+IntToStr(j-1),0);
+                       //thOpen->ColType[10000];
+
+                       switch (thOpen->ColType[j])
+                       {
+                          case 0: //����
+                            iVal=StrToFloat(sgEdit->Cells[j][i]);
+                            FileWrite(iFileHandle, &iVal, 4);
+                          break;
+                          case 1: //����
+                            fVal=StrToFloat(sgEdit->Cells[j][i]);
+                            FileWrite(iFileHandle, &fVal, 4);
+                          break;
+                          case 2: //�ı�
+                                fseek(stream, 0x14+(i*(sgEdit->ColCount-1)+(j-1))*4, 0);
+                                fread(&iVal, 4, 1, stream);
+                                FileWrite(iFileHandle, &iVal, 4);
+                          break;
+                          default: //����
+                            iVal=StrToFloat(sgEdit->Cells[j][i]);
+                            FileWrite(iFileHandle, &iVal, 4);
+                       }
+               }
+            }
+        }
+        FileClose(iFileHandle);
+        fclose(stream);
+        
+        delete ini;
+        ShowMessage("Save To File:"+NewFileName);
+}
+void __fastcall TFrmMain::btIntTypeClick(TObject *Sender)
+{
+if(OpenOk==true){
+   AnsiString  iniSetFile=ExtractFilePath(Application->ExeName)+"BcdEditer.ini";
+   AnsiString SectionName=ExtractFileName(CurrentOpenFile);
+   TIniFile *ini;
+   ini = new TIniFile( iniSetFile );
+   ini->WriteInteger(SectionName,"ColType"+IntToStr(sgEdit->Col),0);
+   delete ini;
+   thOpen->ColType[sgEdit->Col]=0;
+   //���´򿪶�Ӧ�е�ֵ
+   //OpenFileCol(AnsiString FileName,int ColType);
+   OpenFileCol(CurrentOpenFile,sgEdit->Col,0);
+}
+}
+//---------------------------------------------------------------------------
+
+
+void __fastcall TFrmMain::btFloatTypeClick(TObject *Sender)
+{
+if(OpenOk==true){
+   AnsiString  iniSetFile=ExtractFilePath(Application->ExeName)+"BcdEditer.ini";
+   AnsiString SectionName=ExtractFileName(CurrentOpenFile);
+   TIniFile *ini;
+   ini = new TIniFile( iniSetFile );
+   ini->WriteInteger(SectionName,"ColType"+IntToStr(sgEdit->Col),1);
+   delete ini;
+   thOpen->ColType[sgEdit->Col]=1;
+   OpenFileCol(CurrentOpenFile,sgEdit->Col,1);
+}
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::PopupMenu1Popup(TObject *Sender)
+{
+if(OpenOk==true){
+   AnsiString  iniSetFile=ExtractFilePath(Application->ExeName)+"BcdEditer.ini";
+   AnsiString SectionName=ExtractFileName(CurrentOpenFile);
+   int ColType;
+   TIniFile *ini;
+   ini = new TIniFile( iniSetFile );
+   ColType=ini->ReadInteger(SectionName,"ColType"+IntToStr(sgEdit->Col),0);
+   delete ini;
+   switch (ColType)
+   {
+     case 0:
+       btIntType->Checked=true;
+       btFloatType->Checked=false;
+       btTxtType->Checked=false;
+     break;
+     case 1:
+       btIntType->Checked=false;
+       btFloatType->Checked=true;
+       btTxtType->Checked=false;
+     break;
+     case 2:
+       btIntType->Checked=false;
+       btFloatType->Checked=false;
+       btTxtType->Checked=true;
+     break;
+     default:
+       btIntType->Checked=true;
+       btFloatType->Checked=false;
+   }
+}
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::N1Click(TObject *Sender)
+{
+     AnsiString  iniSetFile=ExtractFilePath(Application->ExeName)+"BcdEditer.ini";
+     AnsiString SectionName=ExtractFileName(CurrentOpenFile);
+     int ColType;
+     FrmTitle->edTitle->Text=sgEdit->Cells[sgEdit->Col][0];
+     if(FrmTitle->ShowModal()==mrOk){
+            TIniFile *ini;
+            ini = new TIniFile( iniSetFile );
+            ini->WriteString(SectionName,"ColTitle"+IntToStr(sgEdit->Col),FrmTitle->edTitle->Text);
+            delete ini;
+            sgEdit->Cells[sgEdit->Col][0]=FrmTitle->edTitle->Text;
+     }
+}
+//---------------------------------------------------------------------------
+
+
+
+void __fastcall TFrmMain::FormDestroy(TObject *Sender)
+{
+    if(thOpen){
+        thOpen->Terminate();
+        SleepEx(200,0);
+    }
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::ToolButton1Click(TObject *Sender)
+{
+    bool SeFlag=true;
+    if(FrmSearch->ShowModal()==mrOk){
+            switch (FrmSearch->rgSI->ItemIndex)
+           {
+             case 0: //������;
+                 for(int i=sgEdit->ColCount*sgEdit->Row+sgEdit->Col-1;i>sgEdit->ColCount;i--){
+                     if(i%sgEdit->ColCount!=0){
+                          if( 0==CompareStr(sgEdit->Cells[i-sgEdit->ColCount*(i/sgEdit->ColCount)][i/sgEdit->ColCount],
+                                 FrmSearch->edSeach->Text)){ //�ҵ���
+                                 sgEdit->Col=i-sgEdit->ColCount*i/sgEdit->ColCount;
+                                 sgEdit->Row=i/sgEdit->ColCount;
+                                 SeFlag=false;
+                                 break;
+                          }
+                     }
+                 }
+                 if(SeFlag)  ShowMessage("Seach Top��Find Nothing.");
+             break;
+             case 1:  //������;
+                 for(int i=sgEdit->ColCount*sgEdit->Row+sgEdit->Col+1;i<sgEdit->ColCount*sgEdit->RowCount;i++){
+                     if(i%sgEdit->ColCount!=0){
+                          if( 0==CompareStr(sgEdit->Cells[i-sgEdit->ColCount*(i/sgEdit->ColCount)][i/sgEdit->ColCount],
+                                 FrmSearch->edSeach->Text)){ //�ҵ���
+                                 sgEdit->Col=i-sgEdit->ColCount*(i/sgEdit->ColCount);
+                                 sgEdit->Row=i/sgEdit->ColCount;
+                                 SeFlag=false;
+                                 break;
+                          }
+                     }
+                 }
+                 if(SeFlag)  ShowMessage("Seach End��Find Nothing");
+             break;
+             case 2: //��ǰ��������;
+                 for(int i=sgEdit->Row;i>1;i--){
+                          if( 0==CompareStr(sgEdit->Cells[sgEdit->Col][i],
+                                 FrmSearch->edSeach->Text)){ //�ҵ���
+                                 sgEdit->Row=i;
+                                 SeFlag=false;
+                                 break;
+                          }
+                 }
+                 if(SeFlag)  ShowMessage("Seach col top��Find Nothing");
+             break;
+             case 3:  //��ǰ��������;
+                 for(int i=sgEdit->Row;i<sgEdit->RowCount;i++){
+                          if( 0==CompareStr(sgEdit->Cells[sgEdit->Col][i],
+                                 FrmSearch->edSeach->Text)){ //�ҵ���
+                                 sgEdit->Row=i;
+                                 SeFlag=false;
+                                 break;
+                          }
+                 }
+                 if(SeFlag)  ShowMessage("Seach col end��Find Nothing.");
+             break;
+           }
+    }
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::sgEditKeyDown(TObject *Sender, WORD &Key,
+      TShiftState Shift)
+{
+
+     bool SeFlag=true;
+     if(Key==VK_F3){
+            switch (FrmSearch->rgSI->ItemIndex)
+           {
+             case 0: //������;
+                 for(int i=sgEdit->ColCount*sgEdit->Row+sgEdit->Col-1;i>sgEdit->ColCount;i--){
+                     if(i%sgEdit->ColCount!=0){
+                          if( 0==CompareStr(sgEdit->Cells[i-sgEdit->ColCount*(i/sgEdit->ColCount)][i/sgEdit->ColCount],
+                                 FrmSearch->edSeach->Text)){ //�ҵ���
+                                 sgEdit->Col=i-sgEdit->ColCount*i/sgEdit->ColCount;
+                                 sgEdit->Row=i/sgEdit->ColCount;
+                                 SeFlag=false;
+                                 break;
+                          }
+                     }
+                 }
+                 if(SeFlag)  ShowMessage("Seach Top��Find Nothing.");
+             break;
+             case 1:  //������;
+                 for(int i=sgEdit->ColCount*sgEdit->Row+sgEdit->Col+1;i<sgEdit->ColCount*sgEdit->RowCount;i++){
+                     if(i%sgEdit->ColCount!=0){
+                          if( 0==CompareStr(sgEdit->Cells[i-sgEdit->ColCount*(i/sgEdit->ColCount)][i/sgEdit->ColCount],
+                                 FrmSearch->edSeach->Text)){ //�ҵ���
+                                 sgEdit->Col=i-sgEdit->ColCount*(i/sgEdit->ColCount);
+                                 sgEdit->Row=i/sgEdit->ColCount;
+                                 SeFlag=false;
+                                 break;
+                          }
+                     }
+                 }
+                 if(SeFlag)  ShowMessage("Seach End��Find Nothing.");
+             break;
+             case 2: //��ǰ��������;
+                 for(int i=sgEdit->Row;i>1;i--){
+                          if( 0==CompareStr(sgEdit->Cells[sgEdit->Col][i],
+                                 FrmSearch->edSeach->Text)){ //�ҵ���
+                                 sgEdit->Row=i;
+                                 SeFlag=false;
+                                 break;
+                          }
+                 }
+                 if(SeFlag)  ShowMessage("Seach col Top��Find Nothing.");
+             break;
+             case 3:  //��ǰ��������;
+                 for(int i=sgEdit->Row;i<sgEdit->RowCount;i++){
+                          if( 0==CompareStr(sgEdit->Cells[sgEdit->Col][i],
+                                 FrmSearch->edSeach->Text)){ //�ҵ���
+                                 sgEdit->Row=i;
+                                 SeFlag=false;
+                                 break;
+                          }
+                 }
+                 if(SeFlag)  ShowMessage("Seach col end��Find Nothing.");
+             break;
+           }
+     }
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::sgEditSelectCell(TObject *Sender, int ACol,
+      int ARow, bool &CanSelect)
+{
+//
+}
+//---------------------------------------------------------------------------
+void __fastcall TFrmMain::OpenFileCol(AnsiString FileName,int ColIndex,int ColType)
+{
+        int iFileHandle; //�ļ����
+        char Txtbuf[255];
+        int iVal;
+        float fVal;
+        FILE *stream;
+        long curpos, length;
+	DWORD dwRows, dwCols, dwRowLen, dwTextLen;
+
+        DWORD dwTextStartPos;
+	char* pTextPtr ;
+
+
+   if ((stream = fopen(FileName.c_str(), "r+"))
+       == NULL)
+   {
+      ShowMessage("Open File Error");
+      return;
+   }
+
+   curpos = ftell(stream);
+   fseek(stream, 0L, SEEK_END);
+   length = ftell(stream);
+
+
+   switch (ColType)
+   {
+     case 0: //����ֵ   Int
+       for(int i=0;i<sgEdit->RowCount-1;i++){
+           fseek(stream, 0x14+(i*(sgEdit->ColCount-1)+(ColIndex-1))*4, 0);
+           fread(&iVal, 4, 1, stream);
+           sgEdit->Cells[ColIndex][i+1]=IntToStr(iVal);
+       }
+     break;
+     case 1: //����ֵ    Float
+       for(int i=0;i<sgEdit->RowCount-1;i++){
+           fseek(stream, 0x14+(i*(sgEdit->ColCount-1)+(ColIndex-1))*4, 0);
+           fread(&fVal, 4, 1, stream);
+           sgEdit->Cells[ColIndex][i+1]=FloatToStr(fVal);
+       }
+     break;
+     case 2: //�ı�      Text
+        fseek(stream,0x4,0);
+        fread(&iVal, 4, 1, stream);
+        dwRows= iVal;
+        fread(&iVal, 4, 1, stream);
+        dwCols = iVal;
+        fread(&iVal, 4, 1, stream);
+        dwRowLen = iVal;
+        fread(&iVal, 4, 1, stream);
+        dwTextLen = iVal;
+
+        dwTextStartPos = dwRows*dwRowLen+20;
+       for(int i=0;i<sgEdit->RowCount-1;i++){
+           fseek(stream, 0x14+(i*(sgEdit->ColCount-1)+(ColIndex-1))*4, 0);
+           fread(&iVal, 4, 1, stream);
+           sgEdit->Cells[ColIndex][i+1]=IntToStr(iVal);
+           if(dwTextStartPos + iVal < length){
+                 fseek(stream,dwTextStartPos + iVal,0);
+                 fread(Txtbuf, 1, 255, stream);
+                 //pTextPtr = pBuff + dwTextStartPos + lTemp;
+                 sgEdit->Cells[ColIndex][i+1]=Txtbuf;
+           }else{
+                 sgEdit->Cells[ColIndex][i+1]="This Col Not Text!";
+           }
+       }
+     break;
+   }
+   fclose(stream);
+}
+void __fastcall TFrmMain::Timer1Timer(TObject *Sender)
+{
+   if(OpenOk){
+       lbOpState->Caption = "Open File Ok.";
+   }else{
+       lbOpState->Caption = "Open Now.....";
+   }
+}
+//---------------------------------------------------------------------------
+//��ǰ����д���޸��ļ���
+void __fastcall TFrmMain::N4Click(TObject *Sender)
+{
+   if(!thOpen) return;
+   
+        int iFileHandle; //�ļ����
+        char buf[4];
+        int iVal;
+        float fVal;
+        FILE *stream;
+/*
+   if ((stream = fopen(CurrentOpenFile.c_str(), "r+"))
+       == NULL)
+   {
+      ShowMessage("���ļ�����");
+      return;
+   }
+*/
+    iFileHandle = FileOpen(CurrentOpenFile, fmOpenRead|fmOpenWrite);//���ļ�
+
+   switch (thOpen->ColType[sgEdit->Col])
+   {
+     case 0: //����ֵ
+       //for(int i=0;i<sgEdit->RowCount-1;i++){
+       /*
+           fseek(stream, 0x14+((sgEdit->Row-1)*(sgEdit->ColCount-1)+(sgEdit->Col-1))*4, 0);
+           iVal=StrToInt(sgEdit->Cells[sgEdit->Col][sgEdit->Row]);
+           memcpy(buf, &iVal, 4);
+           for(int i=0;i<4;i++)
+               fwrite(buf+i, 1, 1, stream);
+       */
+       iVal=StrToInt(sgEdit->Cells[sgEdit->Col][sgEdit->Row]);
+       memcpy(buf, &iVal, 4);
+       FileSeek(iFileHandle,0x14+((sgEdit->Row-1)*(sgEdit->ColCount-1)+(sgEdit->Col-1))*4,0);
+       FileWrite(iFileHandle,buf,4);
+       //}
+     break;
+     case 1: //����ֵ
+           //fseek(stream, 0x14+((sgEdit->Row-1)*(sgEdit->ColCount-1)+(sgEdit->Col-1))*4, 0);
+           //fVal=StrToFloat(sgEdit->Cells[sgEdit->Col][sgEdit->Row]);
+           //fwrite(&fVal, 4, 1, stream);
+       fVal=StrToFloat(sgEdit->Cells[sgEdit->Col][sgEdit->Row]);
+       memcpy(buf, &fVal, 4);
+       FileSeek(iFileHandle,0x14+((sgEdit->Row-1)*(sgEdit->ColCount-1)+(sgEdit->Col-1))*4,0);
+       FileWrite(iFileHandle,buf,4);
+     break;
+     case 2: //�ı���д��
+     break;
+   }
+
+  // fclose(stream);
+  FileClose(iFileHandle);
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::btTxtTypeClick(TObject *Sender)
+{
+if(OpenOk==true){
+   AnsiString  iniSetFile=ExtractFilePath(Application->ExeName)+"BcdEditer.ini";
+   AnsiString SectionName=ExtractFileName(CurrentOpenFile);
+   TIniFile *ini;
+   ini = new TIniFile( iniSetFile );
+   ini->WriteInteger(SectionName,"ColType"+IntToStr(sgEdit->Col),2);
+   delete ini;
+   thOpen->ColType[sgEdit->Col]=2;
+   OpenFileCol(CurrentOpenFile,sgEdit->Col,2);
+}
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::ToolButton3Click(TObject *Sender)
+{
+    int OldCol;
+    int OldRow;
+    OldRow=sgEdit->Row;
+    OldCol=sgEdit->Col;
+    if(sgEdit->FixedCols==1){
+        sgEdit->FixedCols =2;
+        if(OldCol!=1)
+           sgEdit->Col=OldCol;
+        sgEdit->Row=OldRow;
+    }else{
+        sgEdit->FixedCols =1;
+        sgEdit->Row=OldRow;
+        if(OldCol!=2)
+           sgEdit->Col=OldCol;
+    }
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::btRowSaveClick(TObject *Sender)
+{
+if(OpenOk==false) return;
+
+        int iFileHandle; //�ļ����
+        char Txtbuf[255];
+        int iVal;
+        char buf[4];
+        float fVal;
+        FILE *stream;
+        long curpos, length;
+	DWORD dwRows, dwCols, dwRowLen, dwTextLen;
+
+        DWORD dwTextStartPos;
+	char* pTextPtr ;
+
+
+   //if ((stream = fopen(CurrentOpenFile.c_str(), "r+"))
+   //    == NULL)
+   //{
+   //   ShowMessage("���ļ�����");
+   //   return;
+   //}
+
+   //curpos = ftell(stream);
+   //fseek(stream, 0L, SEEK_END);
+   //length = ftell(stream);
+   iFileHandle = FileOpen(CurrentOpenFile, fmOpenRead|fmOpenWrite);//���ļ�
+
+for(int i=0;i<sgEdit->ColCount-1;i++){
+   switch (thOpen->ColType[i])
+   {
+     case 0: //����ֵ             sgEdit->Row
+           //fseek(stream, 0x14+((sgEdit->Row-1)*(sgEdit->ColCount-1)+i)*4, 0);
+           //iVal=StrToInt(sgEdit->Cells[i+1][sgEdit->Row]);
+           //fwrite(&iVal, 4, 1, stream);
+       iVal=StrToInt(sgEdit->Cells[i+1][sgEdit->Row]);
+       memcpy(buf, &iVal, 4);
+       FileSeek(iFileHandle,0x14+((sgEdit->Row-1)*(sgEdit->ColCount-1)+i)*4,0);
+       FileWrite(iFileHandle,buf,4);
+     break;
+     case 1: //����ֵ
+           //fseek(stream, 0x14+((sgEdit->Row-1)*(sgEdit->ColCount-1)+i)*4, 0);
+           //fVal=StrToFloat(sgEdit->Cells[i+1][sgEdit->Row]);
+           //fwrite(&fVal, 4, 1, stream);
+       fVal=StrToFloat(sgEdit->Cells[i+1][sgEdit->Row]);
+       memcpy(buf, &fVal, 4);
+       FileSeek(iFileHandle,0x14+((sgEdit->Row-1)*(sgEdit->ColCount-1)+i)*4,0);
+       FileWrite(iFileHandle,buf,4);
+     break;
+     case 2: //�ı�   ����
+     break;
+   }
+}
+   //fclose(stream);
+   FileClose(iFileHandle);
+   ShowMessage("The "+IntToStr(sgEdit->Row)+" Row Write Ok!");
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::btColSaveClick(TObject *Sender)
+{
+if(OpenOk==false) return;
+
+        int iFileHandle; //�ļ����
+        char Txtbuf[255];
+        int iVal;
+        char buf[4];
+        float fVal;
+        FILE *stream;
+        long curpos, length;
+	DWORD dwRows, dwCols, dwRowLen, dwTextLen;
+
+        DWORD dwTextStartPos;
+	char* pTextPtr ;
+
+    iFileHandle = FileOpen(CurrentOpenFile, fmOpenRead|fmOpenWrite);//���ļ�
+
+   //if ((stream = fopen(CurrentOpenFile.c_str(), "r+"))
+   //    == NULL)
+   //{
+   //   ShowMessage("���ļ�����");
+   //   return;
+   //}
+
+   //curpos = ftell(stream);
+   //fseek(stream, 0L, SEEK_END);
+   //length = ftell(stream);
+
+
+   switch (thOpen->ColType[sgEdit->Col])
+   {
+     case 0: //����ֵ
+       for(int i=0;i<sgEdit->RowCount-1;i++){
+           //fseek(stream, 0x14+(i*(sgEdit->ColCount-1)+(sgEdit->Col-1))*4, 0);
+           //iVal=StrToInt(sgEdit->Cells[sgEdit->Col][i+1]);
+           //fwrite(&iVal, 4, 1, stream);
+           iVal=StrToInt(sgEdit->Cells[sgEdit->Col][i+1]);
+           memcpy(buf, &iVal, 4);
+           FileSeek(iFileHandle,0x14+(i*(sgEdit->ColCount-1)+(sgEdit->Col-1))*4,0);
+           FileWrite(iFileHandle,buf,4);
+       }
+     break;
+     case 1: //����ֵ
+       for(int i=0;i<sgEdit->RowCount-1;i++){
+           //fseek(stream, 0x14+(i*(sgEdit->ColCount-1)+(sgEdit->Col-1))*4, 0);
+           //fVal=StrToFloat(sgEdit->Cells[sgEdit->Col][i+1]);
+           //fwrite(&fVal, 4, 1, stream);
+           fVal=StrToFloat(sgEdit->Cells[sgEdit->Col][i+1]);
+           memcpy(buf, &fVal, 4);
+           FileSeek(iFileHandle,0x14+(i*(sgEdit->ColCount-1)+(sgEdit->Col-1))*4,0);
+           FileWrite(iFileHandle,buf,4);
+       }
+     break;
+     case 2: //�ı�   ����
+     break;
+   }
+   //fclose(stream);
+
+   FileClose(iFileHandle);
+   ShowMessage("The "+IntToStr(sgEdit->Col)+"Col Write Ok!");
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::btRowClearClick(TObject *Sender)
+{
+if(OpenOk==false) return;
+
+        int iFileHandle; //�ļ����
+        char Txtbuf[255];
+        int iVal;
+        float fVal;
+        FILE *stream;
+        long curpos, length;
+	DWORD dwRows, dwCols, dwRowLen, dwTextLen;
+
+        DWORD dwTextStartPos;
+	char* pTextPtr ;
+
+
+   if ((stream = fopen(CurrentOpenFile.c_str(), "r+"))
+       == NULL)
+   {
+      ShowMessage("Open File Error!");
+      return;
+   }
+
+   curpos = ftell(stream);
+   fseek(stream, 0L, SEEK_END);
+   length = ftell(stream);
+
+for(int i=1;i<sgEdit->ColCount-1;i++){
+   switch (thOpen->ColType[i])
+   {
+     case 0: //����ֵ             sgEdit->Row
+           //fseek(stream, 0x14+(sgEdit->Row*(sgEdit->ColCount-1)+i)*4, 0);
+           //iVal=StrToInt(sgEdit->Cells[i+1][sgEdit->Row]);
+           //fwrite(&iVal, 4, 1, stream);
+           sgEdit->Cells[i+1][sgEdit->Row]="0";
+     break;
+     case 1: //����ֵ
+           //fseek(stream, 0x14+(sgEdit->Row*(sgEdit->ColCount-1)+i)*4, 0);
+           //fVal=StrToFloat(sgEdit->Cells[i+1][sgEdit->Row]);
+           //fwrite(&fVal, 4, 1, stream);
+           sgEdit->Cells[i+1][sgEdit->Row]="0";
+     break;
+     case 2: //�ı�   ����
+     break;
+   }
+}
+   fclose(stream);
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::btColClearClick(TObject *Sender)
+{
+if(OpenOk==false) return;
+
+        int iFileHandle; //�ļ����
+        char Txtbuf[255];
+        int iVal;
+        float fVal;
+        FILE *stream;
+        long curpos, length;
+	DWORD dwRows, dwCols, dwRowLen, dwTextLen;
+
+        DWORD dwTextStartPos;
+	char* pTextPtr ;
+
+
+   if ((stream = fopen(CurrentOpenFile.c_str(), "r+"))
+       == NULL)
+   {
+      ShowMessage("Open File Error!");
+      return;
+   }
+
+   curpos = ftell(stream);
+   fseek(stream, 0L, SEEK_END);
+   length = ftell(stream);
+
+
+   switch (thOpen->ColType[sgEdit->Col])
+   {
+     case 0: //����ֵ
+       for(int i=0;i<sgEdit->RowCount-1;i++){
+           //fseek(stream, 0x14+(i*(sgEdit->ColCount-1)+(ColIndex-1))*4, 0);
+           //iVal=StrToInt(sgEdit->Cells[ColIndex][i+1]);
+           //fwrite(&iVal, 4, 1, stream);
+           sgEdit->Cells[sgEdit->Col][i+1]="0";
+       }
+     break;
+     case 1: //����ֵ
+       for(int i=0;i<sgEdit->RowCount-1;i++){
+           //fseek(stream, 0x14+(i*(sgEdit->ColCount-1)+(ColIndex-1))*4, 0);
+           //fVal=StrToFloat(sgEdit->Cells[ColIndex][i+1]);
+           //fwrite(&fVal, 4, 1, stream);
+           sgEdit->Cells[sgEdit->Col][i+1]="0";
+       }
+     break;
+     case 2: //�ı�   ����
+     break;
+   }
+   fclose(stream);
+}
+//---------------------------------------------------------------------------
+
+void __fastcall TFrmMain::ToolButton4Click(TObject *Sender)
+{
+	AnsiString Cmd;
+        Cmd = "calc.exe";
+	WinExec(Cmd.c_str(), SW_SHOWNORMAL);
+}
+//---------------------------------------------------------------------------
+
+
diff --git a/contrib/dbcEditer/dbcedit.ddp b/contrib/dbcEditer/dbcedit.ddp
new file mode 100644
index 00000000000..cdc0ee8c2b5
--- /dev/null
+++ b/contrib/dbcEditer/dbcedit.ddp
diff --git a/contrib/dbcEditer/dbcedit.dfm b/contrib/dbcEditer/dbcedit.dfm
new file mode 100644
index 00000000000..24bf375ab74
--- /dev/null
+++ b/contrib/dbcEditer/dbcedit.dfm
@@ -0,0 +1,1259 @@
+object FrmMain: TFrmMain
+  Left = 162
+  Top = 122
+  Width = 544
+  Height = 375
+  Caption = 'Dbc Editer v1.4.2 Vendy  QQ:11177905'
+  Color = clBtnFace
+  Font.Charset = DEFAULT_CHARSET
+  Font.Color = clWindowText
+  Font.Height = -11
+  Font.Name = 'MS Sans Serif'
+  Font.Style = []
+  OldCreateOrder = False
+  OnDestroy = FormDestroy
+  PixelsPerInch = 96
+  TextHeight = 13
+  object Panel1: TPanel
+    Left = 0
+    Top = 33
+    Width = 536
+    Height = 315
+    Align = alClient
+    Caption = 'Panel1'
+    TabOrder = 0
+    object sgEdit: TStringGrid
+      Left = 1
+      Top = 1
+      Width = 534
+      Height = 287
+      Align = alClient
+      Options = [goFixedVertLine, goFixedHorzLine, goVertLine, goHorzLine, goRangeSelect, goDrawFocusSelected, goRowSizing, goColSizing, goEditing]
+      PopupMenu = PopupMenu1
+      TabOrder = 0
+      OnKeyDown = sgEditKeyDown
+      OnSelectCell = sgEditSelectCell
+    end
+    object pnFileName: TPanel
+      Left = 1
+      Top = 288
+      Width = 534
+      Height = 26
+      Align = alBottom
+      Alignment = taLeftJustify
+      Caption = 'pnFileName'
+      Font.Charset = DEFAULT_CHARSET
+      Font.Color = clRed
+      Font.Height = -11
+      Font.Name = 'MS Sans Serif'
+      Font.Style = [fsBold]
+      ParentFont = False
+      TabOrder = 1
+      object lbOpState: TLabel
+        Left = 444
+        Top = 1
+        Width = 89
+        Height = 24
+        Align = alRight
+        AutoSize = False
+        Caption = #25171#24320#25991#20214#29366#24577
+      end
+    end
+  end
+  object CoolBar1: TCoolBar
+    Left = 0
+    Top = 0
+    Width = 536
+    Height = 33
+    Bands = <
+      item
+        Control = ToolBar1
+        ImageIndex = -1
+        Width = 532
+      end>
+    object ToolBar1: TToolBar
+      Left = 9
+      Top = 0
+      Width = 519
+      Height = 25
+      Caption = 'ToolBar1'
+      Images = ImageList1
+      TabOrder = 0
+      object btOpen: TToolButton
+        Left = 0
+        Top = 2
+        Caption = 'btOpen'
+        ImageIndex = 7
+        OnClick = btOpenClick
+      end
+      object btSave: TToolButton
+        Left = 23
+        Top = 2
+        Caption = 'btSave'
+        Enabled = False
+        Grouped = True
+        ImageIndex = 8
+        OnClick = btSaveClick
+      end
+      object ToolButton2: TToolButton
+        Left = 46
+        Top = 2
+        Width = 8
+        Caption = 'ToolButton2'
+        ImageIndex = 10
+        Style = tbsSeparator
+      end
+      object ToolButton1: TToolButton
+        Left = 54
+        Top = 2
+        Caption = 'ToolButton1'
+        ImageIndex = 9
+        OnClick = ToolButton1Click
+      end
+      object ToolButton3: TToolButton
+        Left = 77
+        Top = 2
+        Caption = 'ToolButton3'
+        ImageIndex = 10
+        OnClick = ToolButton3Click
+      end
+      object ToolButton5: TToolButton
+        Left = 100
+        Top = 2
+        Width = 8
+        Caption = 'ToolButton5'
+        ImageIndex = 12
+        Style = tbsSeparator
+      end
+      object ToolButton4: TToolButton
+        Left = 108
+        Top = 2
+        Caption = 'ToolButton4'
+        ImageIndex = 11
+        OnClick = ToolButton4Click
+      end
+    end
+  end
+  object OpenDialog1: TOpenDialog
+    Filter = '.dbc|*.dbc'
+    Left = 216
+    Top = 96
+  end
+  object PopupMenu1: TPopupMenu
+    OnPopup = PopupMenu1Popup
+    Left = 264
+    Top = 96
+    object N1: TMenuItem
+      Caption = 'Set Current Col Title'
+      OnClick = N1Click
+    end
+    object N2: TMenuItem
+      Caption = 'Set Current Col Type'
+      object btIntType: TMenuItem
+        Caption = 'INT'
+        OnClick = btIntTypeClick
+      end
+      object btFloatType: TMenuItem
+        Caption = 'FLOAT'
+        OnClick = btFloatTypeClick
+      end
+      object btTxtType: TMenuItem
+        Caption = 'TEXT'
+        OnClick = btTxtTypeClick
+      end
+    end
+    object N4: TMenuItem
+      Caption = 'Write Current Grid'
+      OnClick = N4Click
+    end
+    object btRowSave: TMenuItem
+      Caption = 'Write Current Row'
+      OnClick = btRowSaveClick
+    end
+    object btColSave: TMenuItem
+      Caption = 'Write Current Col'
+      OnClick = btColSaveClick
+    end
+    object btRowClear: TMenuItem
+      Caption = 'Clear Current Row'
+      OnClick = btRowClearClick
+    end
+    object btColClear: TMenuItem
+      Caption = 'Clear Current Col'
+      OnClick = btColClearClick
+    end
+  end
+  object ImageList1: TImageList
+    Left = 352
+    Top = 112
+    Bitmap = {
+      494C010118001D00040010001000FFFFFFFFFF10FFFFFFFFFFFFFFFF424D3600
+      0000000000003600000028000000400000008000000001002000000000000080
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000800000008000000080000000800000008000000080000000800000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000FF000000FF00FFFFFF00FFFFFF00FFFFFF000000FF000000FF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000008000
+      000080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF008000
+      000080000000000000000000000000000000000000000000000000000000FFFF
+      FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF00FFFF
+      FF00000000000000000000000000000000000000000000000000000000000000
+      000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF
+      000000FF00000000000000000000000000000000000000000000000000000000
+      00000000FF0080808000000000000000000000000000000000000000FF008080
+      8000000000000000000000000000000000000000000000000000800000008000
+      000080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF008000
+      0000800000008000000000000000000000000000000000000000FFFFFF000000
+      FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000
+      FF00FFFFFF000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000FF00808080000000000000000000000000000000FF00808080000000
+      0000000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000FFFFFF00FFFFFF00FFFFFF00800000008000
+      00008000000080000000000000000000000000000000FFFFFF000000FF000000
+      FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000
+      FF000000FF00FFFFFF0000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000FF008080800000000000000000000000FF0080808000000000000000
+      0000000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000FFFFFF00FFFFFF00FFFFFF00800000008000
+      0000800000008000000080000000000000000000FF000000FF000000FF000000
+      FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000
+      FF000000FF000000FF000000FF00000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000FF0080808000000000000000FF008080800000000000000000000000
+      0000000000000000000000000000000000008000000080000000800000008000
+      0000800000008000000080000000FFFFFF00FFFFFF00FFFFFF00800000008000
+      0000800000008000000080000000000000000000FF000000FF000000FF000000
+      FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000
+      FF000000FF000000FF000000FF00000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000FF00808080000000FF00808080000000000000000000000000000000
+      0000000000000000000000000000000000008000000080000000800000008000
+      0000800000008000000080000000FFFFFF00FFFFFF00FFFFFF00800000008000
+      000080000000800000008000000000000000FFFFFF000000FF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF000000FF00FFFFFF00000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000FF000000FF000000FF000000FF000000FF000000FF000000FF008080
+      8000000000000000000000000000000000008000000080000000800000008000
+      0000800000008000000080000000FFFFFF00FFFFFF00FFFFFF00800000008000
+      000080000000800000008000000000000000FFFFFF000000FF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF000000FF00FFFFFF00000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000FF0080808000808080008080800080808000808080000000FF008080
+      8000000000000000000000000000000000008000000080000000800000008000
+      0000800000008000000080000000FFFFFF00FFFFFF00FFFFFF00800000008000
+      000080000000800000008000000000000000FFFFFF000000FF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF000000FF00FFFFFF00000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000FF0080808000000000000000000000000000000000000000FF008080
+      8000000000000000000000000000000000000000000080000000800000008000
+      000080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00800000008000
+      0000800000008000000080000000000000000000FF000000FF000000FF000000
+      FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000
+      FF000000FF000000FF000000FF00000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000FF00808080000000000000000000000000000000FF000000FF008080
+      8000000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000800000008000000080000000000000000000FF000000FF000000FF000000
+      FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000
+      FF000000FF000000FF000000FF00000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000FF000000FF000000FF000000FF000000FF00808080000000
+      0000000000000000000000000000000000000000000080000000800000008000
+      00008000000080000000FFFFFF00FFFFFF00FFFFFF0080000000800000008000
+      00008000000080000000000000000000000000000000FFFFFF000000FF000000
+      FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000
+      FF000000FF00FFFFFF0000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000008080800080808000808080008080800080808000000000000000
+      0000000000000000000000000000000000000000000000000000800000008000
+      00008000000080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00800000008000
+      0000800000000000000000000000000000000000000000000000FFFFFF000000
+      FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000
+      FF00FFFFFF000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000008000
+      00008000000080000000FFFFFF00FFFFFF00FFFFFF0080000000800000008000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF00FFFF
+      FF00000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000080000000800000008000000080000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000FF000000FF00FFFFFF00FFFFFF00FFFFFF000000FF000000FF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000080000000800000008000000080000000800000008000
+      0000800000008000000080000000800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000800000008000000000000000000000000000000000000000000000000000
+      0000000000000000000080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000000000000000000000000
+      0000000000000000000080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000000000000000000000000
+      0000000000000000000080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00800000000000000000000000000000000000
+      000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF
+      000000FF00000000000000000000000000000000000000000000000000000000
+      000000FF000000FF000000FF000000FF000000FF000000FF000000FF000000FF
+      000000FF00000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000000000000000000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000800000008000000080000000800000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000000000000000000008000
+      0000FFFFFF00FFFFFF0080000000800000008000000080000000800000008000
+      00008000000080000000FFFFFF00800000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000000000000000000008000
+      0000FFFFFF00FFFFFF0080000000800000008000000080000000800000008000
+      0000800000008000000080000000800000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000000000000000000008000
+      0000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00800000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000800000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000080000000FFFFFF008000
+      000080000000800000008000000080000000800000008000000080000000FFFF
+      FF00800000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000080000000FFFFFF008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000800000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000800000008000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00800000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000800000008000
+      00008000000080000000FFFFFF00800000008000000080000000800000008000
+      0000FFFFFF008000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000FF00000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000800000008000000000000000000000000000000080000000800000008000
+      00008000000080000000800000008000000080000000FFFFFF00800000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000800000008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000008000
+      0000C0C0C0008000000080000000000000000000000000000000000000000000
+      0000000000000000000000000000000000008000000080000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000800000008000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000080000000C0C0
+      C000800000008000000080000000000000000000000000000000000000000000
+      0000000000000000000000000000800000008000000080000000000000000000
+      0000000000000000000000000000000000000000000000000000C0C0C000C0C0
+      C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C0000000
+      0000C0C0C0000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000C0C0C0008000
+      0000800000008000000000000000000000000000000000000000000000000000
+      0000000000000000000080000000800000008000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000C0C0C00000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000000000000000000000000
+      00000000000000000000000000000000000080000000C0C0C000800000008000
+      000080000000000000000000000000000000000000000000000080808000C0C0
+      C000FFFFFF008080800000000000800000000000000000000000000000000000
+      00000000800000000000000000000000000000000000C0C0C000C0C0C000C0C0
+      C000C0C0C000C0C0C000C0C0C00000FFFF0000FFFF0000FFFF00C0C0C000C0C0
+      C000000000000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF008000000000000000000000000000000000000000000000000000
+      0000C0C0C000C0C0C000C0C0C000FFFFFF008080800080000000800000008000
+      0000000000000000000000000000000000000000000080808000C0C0C000C0C0
+      C000C0C0C000FFFFFF0080808000000000000000000000000000000000000000
+      80000000800000000000000000000000000000000000C0C0C000C0C0C000C0C0
+      C000C0C0C000C0C0C000C0C0C000808080008080800080808000C0C0C000C0C0
+      C00000000000C0C0C00000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      000080000000800000000000000000000000000000000000000080808000C0C0
+      C000C0C0C000C0C0C000C0C0C000C0C0C000FFFFFF0080808000000000000000
+      00000000000000000000000000000000000000000000C0C0C000C0C0C000C0C0
+      C000C0C0C000C0C0C000FFFFFF00000000000000000000000000000080000000
+      8000000080000000800000008000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000C0C0C000C0C0C000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000FFFFFF008000000000000000000000000000000000000000C0C0C000C0C0
+      C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000FFFFFF00000000000000
+      00000000000000000000000000000000000000000000C0C0C000FFFFFF00FFFF
+      0000C0C0C000C0C0C000C0C0C000000000000000000000000000000000000000
+      80000000800000000000000000000000800000000000C0C0C000C0C0C000C0C0
+      C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C0000000
+      0000C0C0C00000000000C0C0C000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      00008000000080000000000000000000000000000000C0C0C000C0C0C000C0C0
+      C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C0000000
+      0000000000000000000000000000000000000000000080808000FFFFFF00FFFF
+      FF00C0C0C000C0C0C00080808000000000000000000000000000000000000000
+      0000000080000000000000000000000080000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000C0C0
+      C00000000000C0C0C00000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF0080000000000000000000000000000000C0C0C000C0C0C000C0C0
+      C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C0000000
+      000000000000000000000000000000000000000000000000000080808000C0C0
+      C000C0C0C0008080800000000000000000000000000000000000000000000000
+      000000000000000000000000000000008000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF000000
+      0000C0C0C00000000000C0C0C000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF0080000000000000000000000000000000C0C0C000FFFFFF00FFFF
+      0000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C0000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000008000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000FFFFFF000000000000000000000000000000000000000000FFFFFF000000
+      0000000000000000000000000000000000000000000080000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF0080000000000000000000000000000000C0C0C000FFFFFF00FFFF
+      0000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C0000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000008000000000000000
+      0000000080000000000000000000000000000000000000000000000000000000
+      0000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000800000008000000000000000000000000000000000000000FFFFFF00FFFF
+      FF00FFFF0000FFFF0000C0C0C000C0C0C000C0C0C000C0C0C000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000008000000000000000
+      0000000080000000800000000000000000000000000000000000000000000000
+      000000000000FFFFFF000000000000000000000000000000000000000000FFFF
+      FF00000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000FFFFFF00800000000000000000000000000000000000000080808000FFFF
+      FF00FFFFFF00FFFFFF00C0C0C000C0C0C000C0C0C00080808000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000080000000
+      8000000080000000800000008000000000000000000000000000000000000000
+      000000000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF000000000000000000000000000000000080000000800000008000
+      0000800000008000000080000000800000008000000080000000800000008000
+      0000800000008000000000000000000000000000000000000000000000000000
+      0000C0C0C000C0C0C000C0C0C000C0C0C0000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000080000000800000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000080000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000008080000080
+      8000000000000000000000000000000000000000000000000000C0C0C000C0C0
+      C0000000000000808000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF000000
+      00000000000000000000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000008080000080
+      8000000000000000000000000000000000000000000000000000C0C0C000C0C0
+      C0000000000000808000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF000000000000000000000000000000
+      00000000000000000000000000000000000000000000FFFFFF00000000000000
+      0000FFFFFF000000000000000000000000000000000000000000FFFFFF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000800000008000
+      0000800000000000000000000000000000000000000000000000008080000080
+      8000000000000000000000000000000000000000000000000000C0C0C000C0C0
+      C0000000000000808000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF000000000080808000C0C0C000C0C0C0008080
+      80000000000000000000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000800000008000
+      0000800000000000000000000000000000000000000000000000008080000080
+      8000000000000000000000000000000000000000000000000000000000000000
+      00000000000000808000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF000000000080808000C0C0C000C0C0C000FFFF00008080
+      80008080800000000000000000000000000000000000FFFFFF00000000000000
+      0000FFFFFF000000000000000000000000000000000000000000FFFFFF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000008080000080
+      8000008080000080800000808000008080000080800000808000008080000080
+      80000080800000808000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF0000000000C0C0C000C0C0C000C0C0C000C0C0C0008080
+      8000C0C0C00000000000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000800000008000
+      0000800000000000000000000000000000000000000000000000008080000080
+      8000000000000000000000000000000000000000000000000000000000000000
+      00000080800000808000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF0000000000C0C0C000FFFF0000C0C0C000C0C0C0008080
+      8000C0C0C00000000000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF0000000000FFFFFF00FFFFFF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000800000008000
+      0000800000000000000000000000000000000000000000000000008080000000
+      0000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0
+      C0000000000000808000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF000000000080808000FFFF0000FFFF0000C0C0C0008080
+      80008080800000000000000000000000000000000000FFFFFF00000000000000
+      0000FFFFFF00FFFFFF00FFFFFF0000000000C0C0C00000000000FFFFFF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000008000
+      0000800000008000000000000000000000000000000000000000008080000000
+      0000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0
+      C0000000000000808000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF000000000080808000C0C0C000C0C0C0008080
+      80000000000000000000000000000000000000000000FFFFFF0000000000C0C0
+      C00000000000FFFFFF0000000000C0C0C00000000000C0C0C000000000000000
+      0000000000000000000080000000800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000800000008000000080000000000000000000000000000000008080000000
+      0000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0
+      C0000000000000808000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF000000000000000000000000000000
+      00000000000000000000000000000000000000000000FFFFFF00FFFFFF000000
+      0000C0C0C00000000000C0C0C00000000000C0C0C00000000000C0C0C000C0C0
+      C000C0C0C0000000000080000000800000000000000000000000000000000000
+      0000000000000000000000000000800000008000000080000000000000000000
+      0000000000008000000080000000800000000000000000000000008080000000
+      0000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0
+      C0000000000000808000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000C0C0C00000000000C0C0C00000000000C0C0C000C0C0C000C0C0
+      C000C0C0C000C0C0C00080000000800000000000000000000000000000000000
+      0000000000000000000000000000800000008000000080000000000000000000
+      0000000000008000000080000000800000000000000000000000008080000000
+      0000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0
+      C0000000000000000000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000000000000000C0C0C00000000000C0C0C000C0C0C000C0C0C000C0C0
+      C000C0C0C000C0C0C00080000000800000000000000000000000000000000000
+      0000000000000000000000000000800000008000000080000000000000000000
+      0000000000008000000080000000800000000000000000000000008080000000
+      0000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0
+      C00000000000C0C0C000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF0000000000C0C0C000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000C0C0C000C0C0C000C0C0C000C0C0C000C0C0
+      C000C0C0C0000000000080000000800000000000000000000000000000000000
+      0000000000000000000000000000000000008000000080000000800000008000
+      0000800000008000000080000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000000000000000000000000000000000000000FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000080000000800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00000000000000000000000000000000000000000000000000008080000080
+      8000008080000080800000808000008080000080800000808000008080000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00000000000000000000000000000000000000000000FFFF00000000000080
+      8000008080000080800000808000008080000080800000808000008080000080
+      8000000000000000000000000000000000000000000000000000000000008000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF000000000000000000000000000000000000000000FFFFFF0000FFFF000000
+      0000008080000080800000808000008080000080800000808000008080000080
+      8000008080000000000000000000000000000000000000000000000000008000
+      0000000000000000000000000000000000000000000080000000800000008000
+      0000800000008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00000000000000000000000000000000000000000000FFFF00FFFFFF0000FF
+      FF00000000000080800000808000008080000080800000808000008080000080
+      8000008080000080800000000000000000000000000000000000800000000000
+      0000000000000000000000000000000000000000000000000000800000008000
+      0000800000008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF000000000000000000000000000000000000000000FFFFFF0000FFFF00FFFF
+      FF0000FFFF000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000800000000000
+      0000000000000000000000000000000000000000000000000000000000008000
+      0000800000008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00000000000000000000000000000000000000000000FFFF00FFFFFF0000FF
+      FF00FFFFFF0000FFFF00FFFFFF0000FFFF00FFFFFF0000FFFF00000000000000
+      0000000000000000000000000000000000000000000000000000800000000000
+      0000000000000000000000000000000000000000000000000000800000000000
+      0000800000008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF000000000000000000000000000000000000000000FFFFFF0000FFFF00FFFF
+      FF0000FFFF00FFFFFF0000FFFF00FFFFFF0000FFFF00FFFFFF00000000000000
+      0000000000000000000000000000000000000000000000000000000000008000
+      0000000000000000000000000000000000008000000080000000000000000000
+      0000000000008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00000000000000000000000000000000000000000000FFFF00FFFFFF0000FF
+      FF00000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000800000008000000080000000800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF0000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF0000000000FFFFFF000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000000000000000000000000000FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFFFF0000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000008000000080000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000080000000800000008000000080000000800000008000
+      0000800000008000000080000000800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000800000000000000000000000800000000000000000000000800000008000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000800000008000000080000000800000008000
+      0000800000008000000080000000800000000000000000000000000000000000
+      0000000000000000000080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000800000000000000000000000800000000000000080000000000000000000
+      0000800000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00800000000000000080808000008080008080
+      8000008080008080800080000000FFFFFF000000000000000000000000000000
+      00000000000000000000FFFFFF00800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000800000000000000000000000800000000000000080000000000000000000
+      0000800000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000080000000FFFFFF0000000000000000000000
+      00000000000000000000FFFFFF00800000000000000000808000808080000080
+      8000808080000080800080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000008000000080000000800000000000000080000000000000000000
+      0000800000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00800000000000000080808000008080008080
+      8000008080008080800080000000FFFFFF00000000000000000000000000FFFF
+      FF00800000008000000080000000800000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000800000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000800000000000000080000000800000008000
+      0000000000000000000000000000000000000000000000000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF0000000000000000000000
+      00000000000000000000FFFFFF00800000000000000000808000808080000080
+      8000808080000080800080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF0080000000FFFFFF0080000000000000000000000000000000800000008000
+      0000800000008000000080000000000000000000000000000000000000000000
+      0000800000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000800000000000000080000000000000000000
+      0000000000000000000000000000000000000000000000000000FFFFFF000000
+      000000000000000000000000000080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF00800000000000000080808000008080008080
+      8000008080008080800080000000FFFFFF00FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00800000008000000000000000000000000000000000000000800000008000
+      0000800000008000000000000000000000000000000000000000000000000000
+      0000000000008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF000000000000000000FFFF
+      FF00800000008000000080000000800000000000000000808000808080000080
+      8000808080000080800080000000800000008000000080000000800000008000
+      0000800000000000000000000000000000000000000000000000800000008000
+      0000800000000000000000000000000000000000000000000000000000000000
+      0000000000008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000FFFFFF000000
+      000000000000000000000000000080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF0080000000FFFFFF0080000000000000000000000080808000008080008080
+      8000008080008080800000808000808080000080800080808000008080008080
+      8000008080000000000000000000000000000000000000000000800000008000
+      0000000000008000000000000000000000000000000000000000000000000000
+      0000000000008000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF00FFFFFF0080000000FFFFFF00FFFFFF00FFFFFF00FFFF
+      FF00800000008000000000000000000000000000000000808000808080000000
+      0000000000000000000000000000000000000000000000000000000000008080
+      8000808080000000000000000000000000000000000000000000800000000000
+      0000000000000000000080000000800000000000000000000000000000000000
+      0000800000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000FFFFFF000000
+      000000000000FFFFFF0000000000800000008000000080000000800000008000
+      0000800000000000000000000000000000000000000080808000808080000000
+      0000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000C0C0C000000000008080
+      8000008080000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000008000000080000000800000008000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF0000000000FFFFFF000000000000000000000000000000
+      0000000000000000000000000000000000000000000000808000808080000080
+      80000000000000FFFF00000000000000000000FFFF0000000000808080000080
+      8000808080000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000FFFFFF00FFFF
+      FF00FFFFFF00FFFFFF0000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000FFFF0000FFFF000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      000000000000000000000000000000000000424D3E000000000000003E000000
+      2800000040000000800000000100010000000000000400000000000000000000
+      000000000000000000000000FFFFFF0000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      0000000000000000000000000000000000000000000000000000000000000000
+      00000000000000000000000000000000FFF7FFFFFC3FFFFFFFFBFFFFE00FF01F
+      E001FFFFC007E00FE003F3CF8003C007E7F7F39F80018003E7C3F33F00010001
+      E7EFF27F00000001E7F7F0FF00000001E7FBF00F00000001E7C3F00F00000001
+      E77FF3CF00010001E77FF38F00010001A37FF81F80018003C6BFF83FC003C007
+      EDDFFFFFE007E00FFFFFFFFFF01FF01FFFFFFC00FFF7FFF78003FC00FFFBFFFB
+      8003FC00E001E0018003FC00E003E0038003E000E7F7E7F78003E000E7DDE707
+      8003E000E7EBE7BF8003E007E7F7E7DF80038007E7EBE70F80038007E75DE7FF
+      80038007E77FE5DF8003801FE77FE6BF8003801FA37FA37F8003801FC6BFC6BF
+      FFFF801FEDDFEDDFFFFFFFFFFFFFFFFFFFF3FFFFFFFFFFFFFFE1FF3FC0078003
+      FFC1FE3F80038003FF83C07F00018003F00780F700018003C00F00E700018003
+      801F00C100008003801F00E600008003000F00F680008003000F81FEC0008003
+      000FC3BFE0018003000FFFB7E0078003801FFFB3F0078003801FFFC1F0038003
+      C03FFFF3F803FFFFF0FFFFF7FFFFFFFFFFFFFFFFFFFFFFFFC001000C000FF9FF
+      80010008000FF9FF80010001000FF3C780010003000F73C780010003000F27FF
+      80010003000F07C780010003000F00C780010003000F01E380010007000403F1
+      8001000F000006388001000F00000E388001000FF8001E388001001FFC003F01
+      8001003FFE047F83FFFF007FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF
+      FFFFEFFDC007001FFFFFC7FFC007000FFFFFC3FBC0070007EFFFE3F7C0070003
+      EF83F1E7C0070001DFC3F8CFC0070000DFE3FC1FC007001FDFD3FE3FC007001F
+      EF3BFC1FC007001FF0FFF8CFC0078FF1FFFFE1E7C00FFFF9FFFFC3F3C01FFF75
+      FFFFC7FDC03FFF8FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFF9FFFFFFFC00FFFF
+      F6CFFE008000FFFFF6B7FE000000FFFFF6B7FE000000FFFFF8B780000000FFF7
+      FE8F80000001C1F7FE3F80000003C3FBFF7F80000003C7FBFE3F80010003CBFB
+      FEBF80030003DCF7FC9F80070003FF0FFDDF807F0003FFFFFDDF80FF8007FFFF
+      FDDF81FFF87FFFFFFFFFFFFFFFFFFFFF00000000000000000000000000000000
+      000000000000}
+  end
+  object Timer1: TTimer
+    Interval = 300
+    OnTimer = Timer1Timer
+    Left = 440
+    Top = 48
+  end
+end
diff --git a/contrib/dbcEditer/dbcedit.h b/contrib/dbcEditer/dbcedit.h
new file mode 100644
index 00000000000..a603768ea38
--- /dev/null
+++ b/contrib/dbcEditer/dbcedit.h
@@ -0,0 +1,105 @@
+//---------------------------------------------------------------------------
+
+#ifndef dbceditH
+#define dbceditH
+//---------------------------------------------------------------------------
+#include <Classes.hpp>
+#include <Controls.hpp>
+#include <StdCtrls.hpp>
+#include <Forms.hpp>
+#include <ComCtrls.hpp>
+#include <ExtCtrls.hpp>
+#include <ToolWin.hpp>
+#include <Grids.hpp>
+#include <Dialogs.hpp>
+#include <Menus.hpp>
+#include <ImgList.hpp>
+#include "thOpenSource.h"
+
+union TypePtr
+{
+	long*			l;
+	DWORD*			dw;
+	WORD*			w;
+	char*			c;
+	void*			p;
+	float*			f;
+
+	TypePtr(void* in) :p(in)
+	{
+	}
+};
+
+#define TAG(x) (DWORD)(  (((DWORD)x&0x0000ff00)<<8)+(((DWORD)x&0x000000ff)<<24)+(((DWORD)x&0x00ff0000)>>8)+(((DWORD)x&0xff000000)>>24) )
+
+
+//---------------------------------------------------------------------------
+class TFrmMain : public TForm
+{
+__published:	// IDE-managed Components
+        TPanel *Panel1;
+        TCoolBar *CoolBar1;
+        TToolBar *ToolBar1;
+        TToolButton *btOpen;
+        TToolButton *btSave;
+        TStringGrid *sgEdit;
+        TOpenDialog *OpenDialog1;
+        TPopupMenu *PopupMenu1;
+        TMenuItem *N1;
+        TMenuItem *N2;
+        TMenuItem *btIntType;
+        TMenuItem *btFloatType;
+        TMenuItem *btTxtType;
+        TImageList *ImageList1;
+        TPanel *pnFileName;
+        TToolButton *ToolButton1;
+        TToolButton *ToolButton2;
+        TTimer *Timer1;
+        TLabel *lbOpState;
+        TMenuItem *N4;
+        TToolButton *ToolButton3;
+        TMenuItem *btRowSave;
+        TMenuItem *btColSave;
+        TMenuItem *btRowClear;
+        TMenuItem *btColClear;
+        TToolButton *ToolButton4;
+        TToolButton *ToolButton5;
+        void __fastcall btOpenClick(TObject *Sender);
+        void __fastcall btSaveClick(TObject *Sender);
+        void __fastcall btIntTypeClick(TObject *Sender);
+        void __fastcall btFloatTypeClick(TObject *Sender);
+        void __fastcall PopupMenu1Popup(TObject *Sender);
+        void __fastcall N1Click(TObject *Sender);
+        void __fastcall FormDestroy(TObject *Sender);
+        void __fastcall ToolButton1Click(TObject *Sender);
+        void __fastcall sgEditKeyDown(TObject *Sender, WORD &Key,
+          TShiftState Shift);
+        void __fastcall sgEditSelectCell(TObject *Sender, int ACol,
+          int ARow, bool &CanSelect);
+        void __fastcall Timer1Timer(TObject *Sender);
+        void __fastcall N4Click(TObject *Sender);
+        void __fastcall btTxtTypeClick(TObject *Sender);
+        void __fastcall ToolButton3Click(TObject *Sender);
+        void __fastcall btRowSaveClick(TObject *Sender);
+        void __fastcall btColSaveClick(TObject *Sender);
+        void __fastcall btRowClearClick(TObject *Sender);
+        void __fastcall btColClearClick(TObject *Sender);
+        void __fastcall ToolButton4Click(TObject *Sender);
+private:	// User declarations
+
+
+        thOpenFile  *thOpen;
+        bool Term; 
+
+public:		// User declarations
+        bool       OpenOk;
+       
+        AnsiString CurrentOpenFile;
+        __fastcall TFrmMain(TComponent* Owner);
+        void SaveToFile(const char * pszFileName);
+        void __fastcall OpenFileCol(AnsiString FileName,int ColIndex,int ColType);
+};
+//---------------------------------------------------------------------------
+extern PACKAGE TFrmMain *FrmMain;
+//---------------------------------------------------------------------------
+#endif
diff --git a/contrib/dbcEditer/pjDbcEditer.bpr b/contrib/dbcEditer/pjDbcEditer.bpr
new file mode 100644
index 00000000000..43795ce5c28
--- /dev/null
+++ b/contrib/dbcEditer/pjDbcEditer.bpr
@@ -0,0 +1,124 @@
+<?xml version='1.0' encoding='utf-8' ?>
+<!-- C++Builder XML Project -->
+<PROJECT>
+  <MACROS>
+    <VERSION value="BCB.06.00"/>
+    <PROJECT value="pjDbcEditer.exe"/>
+    <OBJFILES value="pjDbcEditer.obj dbcedit.obj TitleFrm.obj thOpenSource.obj SearchFrm.obj"/>
+    <RESFILES value="pjDbcEditer.res"/>
+    <IDLFILES value=""/>
+    <IDLGENFILES value=""/>
+    <DEFFILE value=""/>
+    <RESDEPEN value="$(RESFILES) dbcedit.dfm TitleFrm.dfm SearchFrm.dfm"/>
+    <LIBFILES value=""/>
+    <LIBRARIES value=""/>
+    <SPARELIBS value="vcl.lib rtl.lib indy.lib"/>
+    <PACKAGES value="vcl.bpi rtl.bpi dbrtl.bpi adortl.bpi vcldb.bpi vclx.bpi bdertl.bpi 
+      vcldbx.bpi ibxpress.bpi dsnap.bpi cds.bpi bdecds.bpi qrpt.bpi teeui.bpi 
+      teedb.bpi tee.bpi dss.bpi teeqr.bpi visualclx.bpi visualdbclx.bpi 
+      dsnapcrba.bpi dsnapcon.bpi bcbsmp.bpi vclie.bpi xmlrtl.bpi inet.bpi 
+      inetdbbde.bpi inetdbxpress.bpi inetdb.bpi nmfast.bpi webdsnap.bpi 
+      bcbie.bpi websnap.bpi soaprtl.bpi dclocx.bpi dbexpress.bpi dbxcds.bpi 
+      indy.bpi bcb2kaxserver.bpi dclusr.bpi"/>
+    <PATHCPP value=".;"/>
+    <PATHPAS value=".;"/>
+    <PATHRC value=".;"/>
+    <PATHASM value=".;"/>
+    <DEBUGLIBPATH value="$(BCB)\lib\debug"/>
+    <RELEASELIBPATH value="$(BCB)\lib\release"/>
+    <LINKER value="ilink32"/>
+    <USERDEFINES value="_DEBUG"/>
+    <SYSDEFINES value="_RTLDLL;NO_STRICT;USEPACKAGES"/>
+    <MAINSOURCE value="pjDbcEditer.cpp"/>
+    <INCLUDEPATH value="&quot;C:\Program Files\Borland\CBuilder6\Projects&quot;;E:\moshou\dbcEdit;$(BCB)\include;$(BCB)\include\vcl"/>
+    <LIBPATH value="&quot;C:\Program Files\Borland\CBuilder6\Projects&quot;;E:\moshou\dbcEdit;$(BCB)\Projects\Lib;$(BCB)\lib\obj;$(BCB)\lib"/>
+    <WARNINGS value="-w-par"/>
+    <OTHERFILES value=""/>
+  </MACROS>
+  <OPTIONS>
+    <IDLCFLAGS value="-I&quot;C:\Program Files\Borland\CBuilder6\Projects&quot; -IE:\moshou\dbcEdit 
+      -I$(BCB)\include -I$(BCB)\include\vcl -src_suffix cpp -D_DEBUG -boa"/>
+    <CFLAG1 value="-Od -H=$(BCB)\lib\vcl60.csm -Hc -Vx -Ve -X- -r- -a8 -b- -k -y -v -vi- -c 
+      -tW -tWM"/>
+    <PFLAGS value="-$Y+ -$W -$O- -$A8 -v -JPHNE -M"/>
+    <RFLAGS value=""/>
+    <AFLAGS value="/mx /w2 /zi"/>
+    <LFLAGS value="-D&quot;&quot; -aa -Tpe -x -Gn -v"/>
+    <OTHERFILES value=""/>
+  </OPTIONS>
+  <LINKER>
+    <ALLOBJ value="c0w32.obj $(PACKAGES) Memmgr.Lib sysinit.obj $(OBJFILES)"/>
+    <ALLRES value="$(RESFILES)"/>
+    <ALLLIB value="$(LIBFILES) $(LIBRARIES) import32.lib cp32mti.lib"/>
+    <OTHERFILES value=""/>
+  </LINKER>
+  <FILELIST>
+      <FILE FILENAME="pjDbcEditer.res" FORMNAME="" UNITNAME="pjDbcEditer.res" CONTAINERID="ResTool" DESIGNCLASS="" LOCALCOMMAND=""/>
+      <FILE FILENAME="pjDbcEditer.cpp" FORMNAME="" UNITNAME="pjDbcEditer" CONTAINERID="CCompiler" DESIGNCLASS="" LOCALCOMMAND=""/>
+      <FILE FILENAME="dbcedit.cpp" FORMNAME="FrmMain" UNITNAME="dbcedit" CONTAINERID="CCompiler" DESIGNCLASS="" LOCALCOMMAND=""/>
+      <FILE FILENAME="TitleFrm.cpp" FORMNAME="FrmTitle" UNITNAME="TitleFrm" CONTAINERID="CCompiler" DESIGNCLASS="" LOCALCOMMAND=""/>
+      <FILE FILENAME="thOpenSource.cpp" FORMNAME="" UNITNAME="thOpenSource" CONTAINERID="CCompiler" DESIGNCLASS="" LOCALCOMMAND=""/>
+      <FILE FILENAME="SearchFrm.cpp" FORMNAME="FrmSearch" UNITNAME="SearchFrm" CONTAINERID="CCompiler" DESIGNCLASS="" LOCALCOMMAND=""/>
+  </FILELIST>
+  <BUILDTOOLS>
+  </BUILDTOOLS>
+
+  <IDEOPTIONS>
+[Version Info]
+IncludeVerInfo=0
+AutoIncBuild=0
+MajorVer=1
+MinorVer=0
+Release=0
+Build=0
+Debug=0
+PreRelease=0
+Special=0
+Private=0
+DLL=0
+Locale=2052
+CodePage=936
+
+[Version Info Keys]
+CompanyName=
+FileDescription=
+FileVersion=1.0.0.0
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=1.0.0.0
+Comments=
+
+[Debugging]
+DebugSourceDirs=$(BCB)\source\vcl
+
+[Parameters]
+RunParams=
+Launcher=
+UseLauncher=0
+DebugCWD=
+HostApplication=
+RemoteHost=
+RemotePath=
+RemoteLauncher=
+RemoteCWD=
+RemoteDebug=0
+
+[Compiler]
+ShowInfoMsgs=0
+LinkDebugVcl=0
+LinkCGLIB=0
+
+[CORBA]
+AddServerUnit=1
+AddClientUnit=1
+PrecompiledHeaders=1
+
+[Language]
+ActiveLang=
+ProjectLang=
+RootDir=
+  </IDEOPTIONS>
+</PROJECT>
+\ No newline at end of file
diff --git a/contrib/dbcEditer/pjDbcEditer.cpp b/contrib/dbcEditer/pjDbcEditer.cpp
new file mode 100644
index 00000000000..db3a8bde81f
--- /dev/null
+++ b/contrib/dbcEditer/pjDbcEditer.cpp
@@ -0,0 +1,37 @@
+//---------------------------------------------------------------------------
+
+#include <vcl.h>
+#pragma hdrstop
+//---------------------------------------------------------------------------
+USEFORM("dbcedit.cpp", FrmMain);
+USEFORM("TitleFrm.cpp", FrmTitle);
+USEFORM("SearchFrm.cpp", FrmSearch);
+//---------------------------------------------------------------------------
+WINAPI WinMain(HINSTANCE, HINSTANCE, LPSTR, int)
+{
+        try
+        {
+                 Application->Initialize();
+                 Application->CreateForm(__classid(TFrmMain), &FrmMain);
+                 Application->CreateForm(__classid(TFrmTitle), &FrmTitle);
+                 Application->CreateForm(__classid(TFrmSearch), &FrmSearch);
+                 Application->Run();
+        }
+        catch (Exception &exception)
+        {
+                 Application->ShowException(&exception);
+        }
+        catch (...)
+        {
+                 try
+                 {
+                         throw Exception("");
+                 }
+                 catch (Exception &exception)
+                 {
+                         Application->ShowException(&exception);
+                 }
+        }
+        return 0;
+}
+//---------------------------------------------------------------------------
diff --git a/contrib/dbcEditer/pjDbcEditer.exe b/contrib/dbcEditer/pjDbcEditer.exe
new file mode 100644
index 00000000000..9b11ec74614
--- /dev/null
+++ b/contrib/dbcEditer/pjDbcEditer.exe
diff --git a/contrib/dbcEditer/pjDbcEditer.res b/contrib/dbcEditer/pjDbcEditer.res
new file mode 100644
index 00000000000..d1c532760e1
--- /dev/null
+++ b/contrib/dbcEditer/pjDbcEditer.res
diff --git a/contrib/dbcEditer/pjDbcEditer.tds b/contrib/dbcEditer/pjDbcEditer.tds
new file mode 100644
index 00000000000..1995524a297
--- /dev/null
+++ b/contrib/dbcEditer/pjDbcEditer.tds
diff --git a/contrib/dbcEditer/thOpenSource.cpp b/contrib/dbcEditer/thOpenSource.cpp
new file mode 100644
index 00000000000..7df4debfe31
--- /dev/null
+++ b/contrib/dbcEditer/thOpenSource.cpp
@@ -0,0 +1,182 @@
+//---------------------------------------------------------------------------
+
+#include <vcl.h>
+#pragma hdrstop
+
+#include "thOpenSource.h"
+#include "dbcedit.h"
+#include "stdio.h"
+#include <dir.h>
+#include <inifiles.hpp>
+#include <process.h>
+#pragma package(smart_init)
+//---------------------------------------------------------------------------
+
+//   Important: Methods and properties of objects in VCL can only be
+//   used in a method called using Synchronize, for example:
+//
+//      Synchronize(UpdateCaption);
+//
+//   where UpdateCaption could look like:
+//
+//      void __fastcall thOpenFile::UpdateCaption()
+//      {
+//        Form1->Caption = "Updated in a thread";
+//      }
+//---------------------------------------------------------------------------
+
+__fastcall thOpenFile::thOpenFile(bool CreateSuspended)
+        : TThread(CreateSuspended)
+{
+     
+}
+//---------------------------------------------------------------------------
+void __fastcall thOpenFile::Execute()
+{
+        //---- Place thread code here ----
+        //if(!Terminated){
+        //  FrmMain->LoadAndModify(FrmMain->OpenDialog1->FileName.c_str());
+        //  FrmMain->OpenOk=true;
+        //}
+        thEnd=false;
+        RunOpen();
+        FrmMain->OpenOk=true;
+        thEnd=true;
+
+}
+//---------------------------------------------------------------------------
+void __fastcall thOpenFile::RunOpen()
+{
+        LoadAndModify(FrmMain->OpenDialog1->FileName.c_str());
+        //OpenOk=true;
+}
+
+void thOpenFile::ReadAndModifyFromBuff(char *pBuff, DWORD dwSize, const char* pszFileName)
+{
+	char szErrorMsg[MAX_PATH];
+	char szNewFileName[MAX_PATH];
+	DWORD w;
+        TIniFile *ini;
+        
+
+	TypePtr p(pBuff);
+	if('WDBC' != TAG(*p.dw))
+	{
+		_snprintf(szErrorMsg, 512, "[%s]Not Wow's dbc file!", pszFileName);
+		ShowMessage(szErrorMsg);
+		return;
+	}
+	p.dw++;
+
+	DWORD dwRows, dwCols, dwRowLen, dwTextLen;
+	dwRows = *p.dw++;
+	dwCols = *p.dw++;
+	dwRowLen = *p.dw++;
+	dwTextLen = *p.dw++;
+
+        FrmMain->sgEdit->RowCount = dwRows+1;
+        FrmMain->sgEdit->ColCount = dwCols+1;
+
+        for(int i=0; i<FrmMain->sgEdit->RowCount; i++){
+            FrmMain->sgEdit->Cells[0][i]=IntToStr(i);
+            if(Terminated) return;
+        }
+        //�趨�б���
+        AnsiString  iniSetFile=ExtractFilePath(Application->ExeName)+"BcdEditer.ini";
+        AnsiString SectionName=ExtractFileName(FrmMain->CurrentOpenFile);
+
+        ini = new TIniFile( iniSetFile );
+        for(int j=0; j<FrmMain->sgEdit->ColCount; j++){
+            FrmMain->sgEdit->Cells[j][0]= ini->ReadString(SectionName,"ColTitle"+IntToStr(j),IntToStr(j));
+            //sgEdit->Cells[j][0]=IntToStr(j);
+            ColType[j]=ini->ReadInteger(SectionName,"ColType"+IntToStr(j),0);
+            if(Terminated) return;
+        }
+        delete ini;
+
+        //int   *ColType = new int[dwCols];
+        
+	DWORD dwTextStartPos = dwRows*dwRowLen+20;
+	char* pTextPtr = pBuff + dwTextStartPos;
+	char pszTemp[MAX_PATH];
+	float fTemp;
+	long lTemp;
+	DWORD i, j;
+	BOOL* pbString = new BOOL[dwRows*dwCols];
+        float newTmp;
+        //int   ColType;
+
+        ini = new TIniFile( iniSetFile );
+
+	for(i=0; i<dwRows; i++)
+	{
+		for(j=0; j<dwCols; j++)
+		{
+                    //SleepEx(0,0);
+                    if(Terminated) return;
+                    lTemp = *p.l;
+                    newTmp = *p.f;
+                    memcpy(&fTemp, &newTmp, 4);
+
+                    if(j==0)    //ID
+                        FrmMain->sgEdit->Cells[j+1][i+1]=IntToStr(lTemp);
+                    else{
+
+                        //ColType= ini->ReadInteger(SectionName,"ColType"+IntToStr(j),0);
+
+                        switch (ColType[j+1])
+                        {
+                          case 0: //����
+                             FrmMain->sgEdit->Cells[j+1][i+1]=IntToStr(lTemp);
+                          break;
+                          case 1: //����
+                             FrmMain->sgEdit->Cells[j+1][i+1]=FloatToStr(fTemp);
+                          break;
+                          case 2: //�ı�  �ı�����ֻ�ܿ������ܱ༭
+                             if(dwTextStartPos + lTemp < dwSize){
+                                 pTextPtr = pBuff + dwTextStartPos + lTemp;
+                                 FrmMain->sgEdit->Cells[j+1][i+1]=pTextPtr;
+                             }else{
+                                 FrmMain->sgEdit->Cells[j+1][i+1]="���в����ı�";
+                             }
+                          break;
+                          default: //����
+                             FrmMain->sgEdit->Cells[j+1][i+1]=IntToStr(lTemp);
+                        }
+                    }
+                    p.c += 4;
+                }
+        }
+
+	delete [] pbString;
+        //delete []  ColType;
+        delete ini;
+
+}
+
+void thOpenFile::LoadAndModify(const char * pszFileName)
+{
+	HANDLE hFile = NULL;
+	hFile = CreateFile(pszFileName, GENERIC_READ, 0, NULL, OPEN_EXISTING, 0, NULL);
+	if(hFile == INVALID_HANDLE_VALUE)return;
+
+	DWORD r = 0, nFileSize = 0;
+	nFileSize = GetFileSize(hFile, NULL);
+	char* pTmpBuf = new char[nFileSize];
+	if(pTmpBuf==NULL)
+	{
+		CloseHandle(hFile);
+		return;
+	}
+	ReadFile(hFile, pTmpBuf, nFileSize, &r, NULL);
+
+	FrmMain->CurrentOpenFile=pszFileName;
+        FrmMain->btSave->Enabled=true;
+
+	ReadAndModifyFromBuff(pTmpBuf, nFileSize, pszFileName);
+
+	//SAFE_DELETE_ARRAY(pTmpBuf);
+        delete [] pTmpBuf;
+        CloseHandle(hFile);
+
+}
diff --git a/contrib/dbcEditer/thOpenSource.h b/contrib/dbcEditer/thOpenSource.h
new file mode 100644
index 00000000000..edf6bd064f2
--- /dev/null
+++ b/contrib/dbcEditer/thOpenSource.h
@@ -0,0 +1,24 @@
+//---------------------------------------------------------------------------
+
+#ifndef thOpenSourceH
+#define thOpenSourceH
+//---------------------------------------------------------------------------
+#include <Classes.hpp>
+//---------------------------------------------------------------------------
+class thOpenFile : public TThread
+{            
+private:
+protected:
+        void __fastcall Execute();
+        void __fastcall RunOpen();
+public:
+         bool       thEnd;
+         int   ColType[10000];
+         
+        __fastcall thOpenFile(bool CreateSuspended);
+        void LoadAndModify(const char * pszFileName);
+        void ReadAndModifyFromBuff(char *pBuff, DWORD dwSize, const char* pszFileName);
+
+};
+//---------------------------------------------------------------------------
+#endif
diff --git a/contrib/dbcformat/DBC Store.exe b/contrib/dbcformat/DBC Store.exe
new file mode 100644
index 00000000000..f0e0014956a
--- /dev/null
+++ b/contrib/dbcformat/DBC Store.exe
diff --git a/contrib/dbcformat/dbc.desc b/contrib/dbcformat/dbc.desc
new file mode 100644
index 00000000000..470108cab5f
--- /dev/null
+++ b/contrib/dbcformat/dbc.desc
@@ -0,0 +1,241 @@
+ENTRY ItemSetEntry
+
+UNUSED INDEX setid
+UNUSED STR  setname
+UNKNOWN[7]
+UNUSED UINT flags//, const
+UNUSED UINT required_item_id[8]
+UNKNOWN[48]
+UINT spells[8]
+UINT items_to_triggerspell[8] //items_to_triggerspell[0] -- for spells[0]
+UINT required_skill_id//only 2 items sets have requirements
+UINT required_skill_value
+
+ENDENTRY
+
+
+ENTRY TalentEntry
+
+    INDEX TalentID
+    UINT TalentTree
+    UNKNOWN [2]
+    UINT RankID[5]
+    UNKNOWN[12]
+
+ENDENTRY
+
+
+ENTRY emoteentry
+
+    INDEX Id
+    UNUSED STR name
+	UINT textid
+    UNUSED  UINT textid2
+    UNUSED  UINT textid3
+	UNUSED  UINT textid4
+    UNKNOWN
+    UNUSED UINT textid5
+    UNKNOWN
+    UNUSED UINT textid6
+    UNKNOWN[9]
+
+ENDENTRY
+
+ENTRY SpellEntry
+
+    INDEX Id                                    
+    UINT School
+    UNKNOWN [2]
+    UINT Category
+	  UNKNOWN
+    UINT Attributes
+    UINT AttributesEx
+    UNKNOWN [3]
+    UINT Targets                               
+    UINT TargetCreatureType                    
+    UINT RequiresSpellFocus     
+	  UNKNOWN
+    UINT CasterAuraState                       
+    UINT CastingTimeIndex                  
+    UINT RecoveryTime
+    UINT CategoryRecoveryTime
+    UINT InterruptFlags
+    UINT AuraInterruptFlags
+    UINT ChannelInterruptFlags                 
+    UINT procFlags
+    UINT procChance
+    UINT procCharges
+    UINT maxLevel
+    UINT baseLevel
+    UINT spellLevel
+    UINT DurationIndex
+    UINT powerType
+    UINT manaCost
+    UINT manaCostPerlevel                      
+    UINT manaPerSecond
+    UINT manaPerSecondPerLevel
+    UINT rangeIndex
+    FLOAT speed
+    UINT modalNextSpell
+    UNKNOWN                              
+    UINT Totem[2]                              
+    UINT Reagent[8]                            
+    UINT ReagentCount[8]                       
+    UINT EquippedItemClass                     
+    UINT EquippedItemSubClass                  
+    UINT Effect[3] // 59 - 61                           
+    UINT EffectDieSides[3]                     
+    UINT EffectBaseDice[3]                     
+    FLOAT EffectDicePerLevel[3]                
+    FLOAT EffectRealPointsPerLevel[3]            
+    INT EffectBasePoints[3] // 74 - 76
+	  UNKNOWN [3]
+	  UINT EffectImplicitTargetA[3] // 80 - 82
+    UINT EffectImplicitTargetB[3] // 83 - 85
+    UINT EffectRadiusIndex[3]                  
+    UINT EffectApplyAuraName[3] // 89 - 91               
+    UINT EffectAmplitude[3]                    
+    UINT Effectunknown[3]                      
+    UINT EffectChainTarget[3]                  
+    UINT EffectItemType[3]                     
+    UINT EffectMiscValue[3] // 104 - 106                 
+    UINT EffectTriggerSpell[3]                 
+    FLOAT EffectPointsPerComboPoint[3]           
+    UINT SpellVisual                           
+    UNKNOWN                             
+    UINT SpellIconID                          
+    UINT activeIconID
+	  UINT spellPriority                         
+    UNUSED STR Name
+    UNUSED STR NameAlt1
+    UNUSED STR NameAlt2
+    UNUSED STR NameAlt3
+    UNUSED STR NameAlt4
+    UNUSED STR NameAlt5
+    UNUSED STR NameAlt6
+    UNUSED STR NameAlt7
+    UNUSED STR NameFlags
+    UINT Rank
+    UINT RankAlt1
+    UINT RankAlt2
+    UINT RankAlt3
+    UINT RankAlt4
+    UINT RankAlt5
+    UINT RankAlt6
+    UINT RankAlt7
+    UINT RankFlags
+    UNUSED STR Description
+    UNUSED STR DescriptionAlt1
+    UNUSED STR DescriptionAlt2
+    UNUSED STR DescriptionAlt3
+    UNUSED STR DescriptionAlt4
+    UNUSED STR DescriptionAlt5
+    UNUSED STR DescriptionAlt6
+    UNUSED STR DescriptionAlt7
+    UNUSED UINT DescriptionFlags
+    UNUSED STR BuffDescription
+    UNUSED STR BuffDescriptionAlt1
+    UNUSED STR BuffDescriptionAlt2
+    UNUSED STR BuffDescriptionAlt3
+    UNUSED STR BuffDescriptionAlt4
+    UNUSED STR BuffDescriptionAlt5
+    UNUSED STR BuffDescriptionAlt6
+    UNUSED STR BuffDescriptionAlt7
+    UINT ManaCostPercentage
+    UINT StartRecoveryCategory
+    UINT StartRecoveryTime
+	  UINT field156 //nice name
+    UNKNOWN[2]
+    UINT SpellFamilyName
+    UNKNOWN[11]
+ENDENTRY
+
+ENTRY SpellCastTime
+    INDEX ID
+    UINT CastTime
+	UNKNOWN[2]
+ENDENTRY
+
+ENTRY SpellRadius
+    INDEX ID
+    FLOAT Radius
+    UNKNOWN
+    FLOAT Radius2
+ENDENTRY
+
+ENTRY SpellRange
+    INDEX ID
+    FLOAT minRange
+    FLOAT maxRange
+    UNKNOWN[18]
+	UNKNOWN//some flag
+ENDENTRY
+
+ENTRY SpellDuration
+    INDEX ID
+    UINT Duration1
+    UINT Duration2
+    UINT Duration3
+ENDENTRY
+
+ENTRY AreaTableEntry
+
+    UINT ID
+    UNUSED UINT map
+    UINT zone
+    INDEX exploreFlag
+	UNKNOWN[6]
+	UINT area_level
+    UNUSED STR name
+    UNKNOWN[9]
+
+ENDENTRY
+
+
+ENTRY FactionEntry
+	INDEX ID
+	INT reputationListID
+
+	UNKNOWN[7]
+	UINT something1
+	UINT something2 
+	UINT something3
+	UINT something4
+	UINT something5
+	UINT something6
+	UINT something7
+	UINT something8
+	UINT something9
+	UINT faction
+
+	UNUSED STR name 
+	UNKNOWN[17]
+
+ENDENTRY
+
+
+ENTRY FactionTemplateEntry
+	INDEX ID
+	UINT faction
+	UNKNOWN
+	UINT fightsupport
+	UINT friendly
+	UINT hostile
+	UNKNOWN[8]
+ENDENTRY
+
+
+ENTRY ItemDisplayTemplateEntry
+
+	UINT ID
+	UNUSED STR modelFile
+	UNKNOWN
+	UNUSED STR imageFile
+	UNKNOWN
+	UNUSED STR invImageFile
+	UNKNOWN[5]
+	UINT seed
+	UNKNOWN [10]
+	UINT randomPropertyID 
+
+ENDENTRY
diff --git a/contrib/extractor/Makefile b/contrib/extractor/Makefile
new file mode 100644
index 00000000000..64153634c88
--- /dev/null
+++ b/contrib/extractor/Makefile
@@ -0,0 +1,470 @@
+# Copyright (C) 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002,
+# 2003, 2004, 2005  Free Software Foundation, Inc.
+# This Makefile.in is free software; the Free Software Foundation
+# gives unlimited permission to copy and/or distribute it,
+# with or without modifications, as long as this notice is preserved.
+
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY, to the extent permitted by law; without
+# even the implied warranty of MERCHANTABILITY or FITNESS FOR A
+# PARTICULAR PURPOSE.
+
+
+
+# Copyright (C) 2005,2006 MaNGOS <http://www.mangosproject.org/>
+#
+# This program is free software; you can redistribute it and/or modify
+# it under the terms of the GNU General Public License as published by
+# the Free Software Foundation; either version 2 of the License, or
+# (at your option) any later version.
+#
+# This program is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+# GNU General Public License for more details.
+#
+# You should have received a copy of the GNU General Public License
+# along with this program; if not, write to the Free Software
+# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
+
+SOURCES = $(ad_SOURCES)
+
+srcdir = .
+top_srcdir = .
+
+pkgdatadir = $(datadir)/mangos
+pkglibdir = $(libdir)/mangos
+pkgincludedir = $(includedir)/mangos
+top_builddir = ../..
+am__cd = CDPATH="$${ZSH_VERSION+.}$(PATH_SEPARATOR)" && cd
+INSTALL = /usr/bin/ginstall -c
+install_sh_DATA = $(install_sh) -c -m 644
+install_sh_PROGRAM = $(install_sh) -c
+install_sh_SCRIPT = $(install_sh) -c
+INSTALL_HEADER = $(INSTALL_DATA)
+transform = $(program_transform_name)
+NORMAL_INSTALL = :
+PRE_INSTALL = :
+POST_INSTALL = :
+NORMAL_UNINSTALL = :
+PRE_UNINSTALL = :
+POST_UNINSTALL = :
+build_triplet = i686-pc-linux-gnu
+host_triplet = i686-pc-linux-gnu
+bin_PROGRAMS = ad$(EXEEXT)
+subdir = contrib/extractor
+DIST_COMMON = $(srcdir)/Makefile.am $(srcdir)/Makefile.in
+ACLOCAL_M4 = $(top_srcdir)/aclocal.m4
+am__aclocal_m4_deps = $(top_srcdir)/configure.ac
+am__configure_deps = $(am__aclocal_m4_deps) $(CONFIGURE_DEPENDENCIES) \
+	$(ACLOCAL_M4)
+mkinstalldirs = $(SHELL) $(top_srcdir)/mkinstalldirs
+CONFIG_HEADER = $(top_builddir)/config.h
+CONFIG_CLEAN_FILES =
+am__installdirs = "$(DESTDIR)$(bindir)"
+binPROGRAMS_INSTALL = $(INSTALL_PROGRAM)
+PROGRAMS = $(bin_PROGRAMS)
+am_ad_OBJECTS = System.$(OBJEXT) adt.$(OBJEXT) dbcfile.$(OBJEXT) \
+		mpq_libmpq.$(OBJEXT)	
+ad_OBJECTS = $(am_ad_OBJECTS)
+ad_DEPENDENCIES =
+DEFAULT_INCLUDES = -I. -I$(srcdir) -I$(top_builddir)
+depcomp = $(SHELL) $(top_srcdir)/depcomp
+am__depfiles_maybe = depfiles
+CXXCOMPILE = $(CXX) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) \
+	$(AM_CPPFLAGS) $(CPPFLAGS) $(AM_CXXFLAGS) $(CXXFLAGS)
+LTCXXCOMPILE = $(LIBTOOL) --tag=CXX --mode=compile $(CXX) $(DEFS) \
+	$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \
+	$(AM_CXXFLAGS) $(CXXFLAGS)
+CXXLD = $(CXX)
+CXXLINK = $(LIBTOOL) --tag=CXX --mode=link $(CXXLD) $(AM_CXXFLAGS) \
+	$(CXXFLAGS) $(AM_LDFLAGS) $(LDFLAGS) -o $@
+COMPILE = $(CC) $(DEFS) $(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) \
+	$(CPPFLAGS) $(AM_CFLAGS) $(CFLAGS)
+LTCOMPILE = $(LIBTOOL) --tag=CC --mode=compile $(CC) $(DEFS) \
+	$(DEFAULT_INCLUDES) $(INCLUDES) $(AM_CPPFLAGS) $(CPPFLAGS) \
+	$(AM_CFLAGS) $(CFLAGS)
+CCLD = $(CC)
+LINK = $(LIBTOOL) --tag=CC --mode=link $(CCLD) $(AM_CFLAGS) $(CFLAGS) \
+	$(AM_LDFLAGS) $(LDFLAGS) -o $@
+SOURCES = $(ad_SOURCES)
+DIST_SOURCES = $(ad_SOURCES)
+ETAGS = etags
+CTAGS = ctags
+DISTFILES = $(DIST_COMMON) $(DIST_SOURCES) $(TEXINFOS) $(EXTRA_DIST)
+ACLOCAL =
+ALLOCA = 
+AMDEP_FALSE = #
+AMDEP_TRUE = 
+AMTAR = ${SHELL} /home/wow/MaNGOS/trunk/missing --run tar
+AR = ar
+AUTOCONF = ${SHELL} /home/wow/MaNGOS/trunk/missing --run autoconf
+AUTOHEADER = ${SHELL} /home/wow/MaNGOS/trunk/missing --run autoheader
+AUTOMAKE = ${SHELL} /home/wow/MaNGOS/trunk/missing --run automake-1.9
+AWK = gawk
+CC = gcc
+CCDEPMODE = depmode=gcc3
+CFLAGS = -g -O3
+COMPILER_OPTIONS = -g -O3
+CPP = gcc -E
+CPPFLAGS = 
+CXX = g++
+CXXCPP = g++ -E
+CXXDEPMODE = depmode=gcc3
+CXXFLAGS = -g -O3
+CYGPATH_W = echo
+DEFS = -DHAVE_CONFIG_H
+DEPDIR = .deps
+ECHO = echo
+ECHO_C = 
+ECHO_N = -n
+ECHO_T = 
+EGREP = grep -E
+EXEEXT = 
+EXTRA_COMPILER_OPTIONS = 
+EXTRA_LINKER_OPTIONS = 
+F77 = 
+FFLAGS = 
+INCLUDES = -I$(srcdir)
+INSTALL_DATA = ${INSTALL} -m 644
+INSTALL_PROGRAM = ${INSTALL}
+INSTALL_SCRIPT = ${INSTALL}
+INSTALL_STRIP_PROGRAM = ${SHELL} $(install_sh) -c -s
+LDFLAGS = 
+LIBOBJS = 
+LIBS = -lz -lpthread 
+LIBTOOL = $(SHELL) $(top_builddir)/libtool
+LINKER_OPTIONS = -static
+LN_S = ln -s
+LTLIBOBJS = 
+LT_AGE = 2
+LT_CURRENT = 2
+LT_RELEASE = 2.3.2
+LT_REVISION = 3
+MAINT = #
+MAINTAINER_MODE_FALSE = 
+MAINTAINER_MODE_TRUE = #
+MAKEINFO = 
+MANGOSD_CONFIG = /home/wow/server/etc/mangosd.conf
+MANGOSD_CONFIGDIR = /home/wow/server/etc
+MANGOSD_DATA = /home/wow/server/share/mangos
+OBJEXT = o
+PACKAGE = mangos
+PACKAGE_BUGREPORT = http://www.mangosproject.org/
+PACKAGE_NAME = MaNGOS
+PACKAGE_STRING = MaNGOS 0.2-SVN
+PACKAGE_TARNAME = mangos
+PACKAGE_VERSION = 0.2-SVN
+PATH_SEPARATOR = :
+RANLIB = ranlib
+SET_MAKE = 
+SHELL = /bin/sh
+STRIP = strip
+VERSION = 0.2-SVN
+ac_ct_AR = ar
+ac_ct_CC = gcc
+ac_ct_CXX = g++
+ac_ct_F77 = 
+ac_ct_RANLIB = ranlib
+ac_ct_STRIP = strip
+am__fastdepCC_FALSE = #
+am__fastdepCC_TRUE = 
+am__fastdepCXX_FALSE = #
+am__fastdepCXX_TRUE = 
+am__include = include
+am__leading_dot = .
+am__quote = 
+am__tar = ${AMTAR} chof - "$$tardir"
+am__untar = ${AMTAR} xf -
+bindir = ${exec_prefix}/bin
+build = i686-pc-linux-gnu
+build_alias = 
+build_cpu = i686
+build_os = linux-gnu
+build_vendor = pc
+datadir = ${prefix}/share
+exec_prefix = ${prefix}
+host = i686-pc-linux-gnu
+host_alias = 
+host_cpu = i686
+host_os = linux-gnu
+host_vendor = pc
+includedir = ${prefix}/include
+infodir = ${prefix}/info
+install_sh = /home/wow/MaNGOS/trunk/install-sh
+libdir = ${exec_prefix}/lib
+libexecdir = ${exec_prefix}/libexec
+localstatedir = ${prefix}/var
+mandir = ${prefix}/man
+mkdir_p = mkdir -p --
+oldincludedir = /usr/include
+prefix = /home/wow/server
+program_transform_name = s,x,x,
+sbindir = ${exec_prefix}/sbin
+sharedstatedir = ${prefix}/com
+
+# use our configured sysconfdir
+sysconfdir = /home/wow/server/etc
+target_alias = 
+ad_SOURCES = \
+    System.cpp \
+    adt.h \
+    adt.cpp \
+    dbcfile.cpp \
+    dbcfile.h \
+    mpq_libmpq.cpp \
+    mpq_libmpq.h
+
+ad_LDADD = libmpq/libmpq.a
+add_LDFLAGS = -L$(srcdir) -L$(srcdir)/libmpq
+
+all: create-dir all-am
+
+.SUFFIXES:
+.SUFFIXES: .cpp .lo .o .obj
+
+.PRECIOUS: Makefile
+
+install-binPROGRAMS: $(bin_PROGRAMS)
+	@$(NORMAL_INSTALL)
+	test -z "$(bindir)" || $(mkdir_p) "$(DESTDIR)$(bindir)"
+	@list='$(bin_PROGRAMS)'; for p in $$list; do \
+	  p1=`echo $$p|sed 's/$(EXEEXT)$$//'`; \
+	  if test -f $$p \
+	     || test -f $$p1 \
+	  ; then \
+	    f=`echo "$$p1" | sed 's,^.*/,,;$(transform);s/$$/$(EXEEXT)/'`; \
+	   echo " $(INSTALL_PROGRAM_ENV) $(LIBTOOL) --mode=install $(binPROGRAMS_INSTALL) '$$p' '$(DESTDIR)$(bindir)/$$f'"; \
+	   $(INSTALL_PROGRAM_ENV) $(LIBTOOL) --mode=install $(binPROGRAMS_INSTALL) "$$p" "$(DESTDIR)$(bindir)/$$f" || exit 1; \
+	  else :; fi; \
+	done
+
+uninstall-binPROGRAMS:
+	@$(NORMAL_UNINSTALL)
+	@list='$(bin_PROGRAMS)'; for p in $$list; do \
+	  f=`echo "$$p" | sed 's,^.*/,,;s/$(EXEEXT)$$//;$(transform);s/$$/$(EXEEXT)/'`; \
+	  echo " rm -f '$(DESTDIR)$(bindir)/$$f'"; \
+	  rm -f "$(DESTDIR)$(bindir)/$$f"; \
+	done
+
+clean-binPROGRAMS:
+	@list='$(bin_PROGRAMS)'; for p in $$list; do \
+	  f=`echo $$p|sed 's/$(EXEEXT)$$//'`; \
+	  echo " rm -f $$p $$f"; \
+	  rm -f $$p $$f ; \
+	done
+ad$(EXEEXT): $(ad_OBJECTS) $(ad_DEPENDENCIES) 
+	@rm -f ad$(EXEEXT)
+	$(CXXLINK) $(ad_LDFLAGS) $(ad_OBJECTS) $(ad_LDADD) $(LIBS)
+
+mostlyclean-compile:
+	-rm -f *.$(OBJEXT)
+
+distclean-compile:
+	-rm -f *.tab.c
+
+.cpp.o:
+	if $(CXXCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \
+	then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi
+#	source='$<' object='$@' libtool=no \
+#	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) \
+#	$(CXXCOMPILE) -c -o $@ $<
+
+.cpp.obj:
+	if $(CXXCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ `$(CYGPATH_W) '$<'`; \
+	then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Po"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi
+#	source='$<' object='$@' libtool=no \
+#	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) \
+#	$(CXXCOMPILE) -c -o $@ `$(CYGPATH_W) '$<'`
+
+.cpp.lo:
+	if $(LTCXXCOMPILE) -MT $@ -MD -MP -MF "$(DEPDIR)/$*.Tpo" -c -o $@ $<; \
+	then mv -f "$(DEPDIR)/$*.Tpo" "$(DEPDIR)/$*.Plo"; else rm -f "$(DEPDIR)/$*.Tpo"; exit 1; fi
+#	source='$<' object='$@' libtool=yes \
+#	DEPDIR=$(DEPDIR) $(CXXDEPMODE) $(depcomp) \
+#	$(LTCXXCOMPILE) -c -o $@ $<
+
+mostlyclean-libtool:
+	-rm -f *.lo
+
+clean-libtool:
+	-rm -rf .libs _libs
+	-rm .deps/*
+
+distclean-libtool:
+	-rm -f libtool
+uninstall-info-am:
+
+ID: $(HEADERS) $(SOURCES) $(LISP) $(TAGS_FILES)
+	list='$(SOURCES) $(HEADERS) $(LISP) $(TAGS_FILES)'; \
+	unique=`for i in $$list; do \
+	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+	  done | \
+	  $(AWK) '    { files[$$0] = 1; } \
+	       END { for (i in files) print i; }'`; \
+	mkid -fID $$unique
+tags: TAGS
+
+TAGS:  $(HEADERS) $(SOURCES)  $(TAGS_DEPENDENCIES) \
+		$(TAGS_FILES) $(LISP)
+	tags=; \
+	here=`pwd`; \
+	list='$(SOURCES) $(HEADERS)  $(LISP) $(TAGS_FILES)'; \
+	unique=`for i in $$list; do \
+	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+	  done | \
+	  $(AWK) '    { files[$$0] = 1; } \
+	       END { for (i in files) print i; }'`; \
+	if test -z "$(ETAGS_ARGS)$$tags$$unique"; then :; else \
+	  test -n "$$unique" || unique=$$empty_fix; \
+	  $(ETAGS) $(ETAGSFLAGS) $(AM_ETAGSFLAGS) $(ETAGS_ARGS) \
+	    $$tags $$unique; \
+	fi
+ctags: CTAGS
+CTAGS:  $(HEADERS) $(SOURCES)  $(TAGS_DEPENDENCIES) \
+		$(TAGS_FILES) $(LISP)
+	tags=; \
+	here=`pwd`; \
+	list='$(SOURCES) $(HEADERS)  $(LISP) $(TAGS_FILES)'; \
+	unique=`for i in $$list; do \
+	    if test -f "$$i"; then echo $$i; else echo $(srcdir)/$$i; fi; \
+	  done | \
+	  $(AWK) '    { files[$$0] = 1; } \
+	       END { for (i in files) print i; }'`; \
+	test -z "$(CTAGS_ARGS)$$tags$$unique" \
+	  || $(CTAGS) $(CTAGSFLAGS) $(AM_CTAGSFLAGS) $(CTAGS_ARGS) \
+	     $$tags $$unique
+
+GTAGS:
+	here=`$(am__cd) $(top_builddir) && pwd` \
+	  && cd $(top_srcdir) \
+	  && gtags -i $(GTAGS_ARGS) $$here
+
+distclean-tags:
+	-rm -f TAGS ID GTAGS GRTAGS GSYMS GPATH tags
+
+distdir: $(DISTFILES)
+	@srcdirstrip=`echo "$(srcdir)" | sed 's|.|.|g'`; \
+	topsrcdirstrip=`echo "$(top_srcdir)" | sed 's|.|.|g'`; \
+	list='$(DISTFILES)'; for file in $$list; do \
+	  case $$file in \
+	    $(srcdir)/*) file=`echo "$$file" | sed "s|^$$srcdirstrip/||"`;; \
+	    $(top_srcdir)/*) file=`echo "$$file" | sed "s|^$$topsrcdirstrip/|$(top_builddir)/|"`;; \
+	  esac; \
+	  if test -f $$file || test -d $$file; then d=.; else d=$(srcdir); fi; \
+	  dir=`echo "$$file" | sed -e 's,/[^/]*$$,,'`; \
+	  if test "$$dir" != "$$file" && test "$$dir" != "."; then \
+	    dir="/$$dir"; \
+	    $(mkdir_p) "$(distdir)$$dir"; \
+	  else \
+	    dir=''; \
+	  fi; \
+	  if test -d $$d/$$file; then \
+	    if test -d $(srcdir)/$$file && test $$d != $(srcdir); then \
+	      cp -pR $(srcdir)/$$file $(distdir)$$dir || exit 1; \
+	    fi; \
+	    cp -pR $$d/$$file $(distdir)$$dir || exit 1; \
+	  else \
+	    test -f $(distdir)/$$file \
+	    || cp -p $$d/$$file $(distdir)/$$file \
+	    || exit 1; \
+	  fi; \
+	done
+check-am: all-am
+check: check-am
+all-am: Makefile $(PROGRAMS);
+installdirs:
+	for dir in "$(DESTDIR)$(bindir)"; do \
+	  test -z "$$dir" || $(mkdir_p) "$$dir"; \
+	done
+install: install-am
+install-exec: install-exec-am
+install-data: install-data-am
+uninstall: uninstall-am
+
+install-am: all-am
+	@$(MAKE) $(AM_MAKEFLAGS) install-exec-am install-data-am
+
+installcheck: installcheck-am
+install-strip:
+	$(MAKE) $(AM_MAKEFLAGS) INSTALL_PROGRAM="$(INSTALL_STRIP_PROGRAM)" \
+	  install_sh_PROGRAM="$(INSTALL_STRIP_PROGRAM)" INSTALL_STRIP_FLAG=-s \
+	  `test -z '$(STRIP)' || \
+	    echo "INSTALL_PROGRAM_ENV=STRIPPROG='$(STRIP)'"` install
+mostlyclean-generic:
+
+clean-generic:
+
+distclean-generic:
+	-test -z "$(CONFIG_CLEAN_FILES)" || rm -f $(CONFIG_CLEAN_FILES)
+
+maintainer-clean-generic:
+	@echo "This command is intended for maintainers to use"
+	@echo "it deletes files that may require special tools to rebuild."
+clean: clean-am
+
+clean-am: clean-binPROGRAMS clean-generic clean-libtool mostlyclean-am
+
+distclean: distclean-am
+	-rm -rf ./$(DEPDIR)
+distclean-am: clean-am distclean-compile distclean-generic \
+	distclean-libtool distclean-tags
+
+dvi: dvi-am
+
+dvi-am:
+
+html: html-am
+
+info: info-am
+
+info-am:
+
+install-data-am:
+
+install-exec-am: install-binPROGRAMS
+
+install-info: install-info-am
+
+install-man:
+
+installcheck-am:
+
+maintainer-clean: maintainer-clean-am
+	-rm -rf ./$(DEPDIR)
+	-rm -f Makefile
+maintainer-clean-am: distclean-am maintainer-clean-generic
+
+mostlyclean: mostlyclean-am
+
+mostlyclean-am: mostlyclean-compile mostlyclean-generic \
+	mostlyclean-libtool
+
+pdf: pdf-am
+
+pdf-am:
+
+ps: ps-am
+
+ps-am:
+
+uninstall-am: uninstall-binPROGRAMS uninstall-info-am
+
+create-dir:
+	mkdir -p ".deps"
+
+.PHONY: CTAGS GTAGS all all-am check check-am clean clean-binPROGRAMS \
+	clean-generic clean-libtool ctags distclean distclean-compile \
+	distclean-generic distclean-libtool distclean-tags distdir dvi \
+	dvi-am html html-am info info-am install install-am \
+	install-binPROGRAMS install-data install-data-am install-exec \
+	install-exec-am install-info install-info-am install-man \
+	install-strip installcheck installcheck-am installdirs \
+	maintainer-clean maintainer-clean-generic mostlyclean \
+	mostlyclean-compile mostlyclean-generic mostlyclean-libtool \
+	pdf pdf-am ps ps-am tags uninstall uninstall-am \
+	uninstall-binPROGRAMS uninstall-info-am
+
+# Tell versions [3.59,3.63) of GNU make to not export all variables.
+# Otherwise a system limit (for SysV at least) may be exceeded.
+.NOEXPORT:
diff --git a/contrib/extractor/Makefile.am b/contrib/extractor/Makefile.am
new file mode 100644
index 00000000000..b84617069a1
--- /dev/null
+++ b/contrib/extractor/Makefile.am
@@ -0,0 +1,10 @@
+# The top-level input Makefile for mpq-tools
+
+# Any directories which should be built and installed.
+SUBDIRS = libmpq
+
+# The directories which are part of the distribution.
+DIST_SUBDIRS = $(SUBDIRS)
+
+EXTRA_DIST =		\
+	README.linux
diff --git a/contrib/extractor/README.linux b/contrib/extractor/README.linux
new file mode 100644
index 00000000000..e1ebdb8bb2e
--- /dev/null
+++ b/contrib/extractor/README.linux
@@ -0,0 +1,13 @@
+Linux instructions
+------------------
+
+1. Configure and build MaNGOS.
+2. cd contrib/map_extractor/libmpq/
+3. make
+4. cd ..
+5. make
+6. run ad
+
+if there are any problems create folder named .deps in contrib/map_extractor/
+it is old bug from first extractor and i am too lasy to fix it :)
+ 
diff --git a/contrib/extractor/System.cpp b/contrib/extractor/System.cpp
new file mode 100644
index 00000000000..090fc557ed7
--- /dev/null
+++ b/contrib/extractor/System.cpp
@@ -0,0 +1,320 @@
+#define _CRT_SECURE_NO_DEPRECATE
+
+#include <stdio.h>
+#include <deque>
+#include <set>
+
+#ifdef WIN32
+#include "direct.h"
+#else
+#include <sys/stat.h>
+#endif
+
+#include "dbcfile.h"
+#include "mpq_libmpq.h"
+
+extern unsigned int iRes;
+extern ArchiveSet gOpenArchives;
+
+bool ConvertADT(char*,char*);
+
+typedef struct{
+    char name[64];
+    unsigned int id;
+}map_id;
+
+typedef unsigned char uint8;
+typedef unsigned short uint16;
+typedef unsigned int uint32;
+
+map_id * map_ids;
+uint16 * areas;
+char output_path[128]=".";
+char input_path[128]=".";
+
+enum Extract
+{
+    EXTRACT_MAP = 1,
+    EXTRACT_DBC = 2
+};
+int extract = EXTRACT_MAP | EXTRACT_DBC;
+
+static char* const langs[]={"deDE", "enGB", "enUS", "esES", "frFR", "koKR", "zhCN", "zhTW", "enCN", "enTW", "esMX", "ruRU" };
+#define LANG_COUNT 12
+
+#define ADT_RES 64
+
+void CreateDir( const std::string& Path )
+{
+    #ifdef WIN32
+    _mkdir( Path.c_str());
+    #else
+    mkdir( Path.c_str(), 0777 );
+    #endif
+}
+
+bool FileExists( const char* FileName )
+{
+    if( FILE* fp = fopen( FileName, "rb" ) )
+    {
+        fclose( fp );
+        return true;
+    }
+
+    return false;
+}
+
+void Usage(char* prg)
+{
+    printf("Usage:\n%s -[var] [value]\n-i set input path\n-o set output path\n-r set resolution\n-e extract only MAP(1)/DBC(2) - standard: both(3)\nExample: %s -r 256 -i \"c:\\games\\game\"",
+    prg,prg);
+    exit(1);
+}
+
+void HandleArgs(int argc, char * arg[])
+{
+    for(int c=1;c<argc;c++)
+    {
+        //i - input path
+        //o - output path
+        //r - resolution, array of (r * r) heights will be created
+        //e - extract only MAP(1)/DBC(2) - standard both(3)
+        if(arg[c][0] != '-')
+            Usage(arg[0]);
+
+        switch(arg[c][1])
+        {
+            case 'i':
+                if(c+1<argc)//all ok
+                    strcpy(input_path,arg[(c++) +1]);
+                else
+                    Usage(arg[0]);
+                break;
+            case 'o':
+                if(c+1<argc)//all ok
+                    strcpy(output_path,arg[(c++) +1]);
+                else
+                    Usage(arg[0]);
+                break;
+            case 'r':
+                if(c+1<argc)//all ok
+                    iRes=atoi(arg[(c++) +1]);
+                else
+                    Usage(arg[0]);
+                break;
+            case 'e':
+                if(c+1<argc)//all ok
+                {
+                    extract=atoi(arg[(c++) +1]);
+                    if(!(extract > 0 && extract < 4))
+                        Usage(arg[0]);
+                }
+                else
+                    Usage(arg[0]);
+                break;
+        }
+    }
+}
+
+uint32 ReadMapDBC()
+{
+    printf("Read Map.dbc file... ");
+    DBCFile dbc("DBFilesClient\\Map.dbc");
+    dbc.open();
+
+    uint32 map_count=dbc.getRecordCount();
+    map_ids=new map_id[map_count];
+    for(unsigned int x=0;x<map_count;x++)
+    {
+        map_ids[x].id=dbc.getRecord(x).getUInt(0);
+        strcpy(map_ids[x].name,dbc.getRecord(x).getString(1));
+    }
+    printf("Done! (%u maps loaded)\n", map_count);
+    return map_count;
+}
+
+void ReadAreaTableDBC()
+{
+    printf("Read AreaTable.dbc file... ");
+    DBCFile dbc("DBFilesClient\\AreaTable.dbc");
+    dbc.open();
+
+    unsigned int area_count=dbc.getRecordCount();
+    uint32 maxid = dbc.getMaxId();
+    areas=new uint16[maxid + 1];
+    memset(areas, 0xff, sizeof(areas));
+    for(unsigned int x=0; x<area_count;++x)
+        areas[dbc.getRecord(x).getUInt(0)] = dbc.getRecord(x).getUInt(3);
+
+    printf("Done! (%u areas loaded)\n", area_count);
+}
+
+void ExtractMapsFromMpq()
+{
+    char mpq_filename[1024];
+    char output_filename[1024];
+
+    printf("Extracting maps...\n");
+
+    uint32 map_count = ReadMapDBC();
+
+    ReadAreaTableDBC();
+
+    unsigned int total=map_count*ADT_RES*ADT_RES;
+    unsigned int done=0;
+
+    std::string path = output_path;
+    path += "/maps/";
+    CreateDir(path);
+
+    for(int x = 0; x < ADT_RES; ++x)
+    {
+        for(int y = 0; y < ADT_RES; ++y)
+        {
+            for(int z = 0; z < map_count; ++z)
+            {
+                sprintf(mpq_filename,"World\\Maps\\%s\\%s_%u_%u.adt",map_ids[z].name,map_ids[z].name,x,y);
+                sprintf(output_filename,"%s/maps/%03u%02u%02u.map",output_path,map_ids[z].id,y,x);
+                ConvertADT(mpq_filename,output_filename);
+                done++;
+            }
+            //draw progess bar
+            printf("Processing........................%d%%\r",(100*done)/total);
+        }
+    }
+
+    delete [] areas;
+    delete [] map_ids;
+}
+
+//bool WMO(char* filename);
+
+void ExtractDBCFiles()
+{
+    printf("Extracting dbc files...\n");
+
+    set<string> dbcfiles;
+
+    // get DBC file list
+    for(ArchiveSet::iterator i = gOpenArchives.begin(); i != gOpenArchives.end();++i)
+    {
+        vector<string> files = (*i)->GetFileList();
+        for (vector<string>::iterator iter = files.begin(); iter != files.end(); ++iter)
+            if (iter->rfind(".dbc") == iter->length() - strlen(".dbc"))
+                    dbcfiles.insert(*iter);
+    }
+
+    std::string path = output_path;
+    path += "/dbc/";
+    CreateDir(path);
+
+    // extract DBCs
+    int count = 0;
+    for (set<string>::iterator iter = dbcfiles.begin(); iter != dbcfiles.end(); ++iter)
+    {
+        string filename = output_path;
+        filename += "/dbc/";
+        filename += (iter->c_str() + strlen("DBFilesClient\\"));
+
+        //cout << filename << endl;
+
+        FILE *output=fopen(filename.c_str(),"wb");
+        if(!output)
+        {
+            printf("Can't create the output file '%s'\n",filename.c_str());
+            continue;
+        }
+        MPQFile m(iter->c_str());
+        if(!m.isEof())
+            fwrite(m.getPointer(),1,m.getSize(),output);
+
+        fclose(output);
+        ++count;
+    }
+    printf("Extracted %u DBC files\n", count);
+}
+
+int GetLocale()
+{
+    for (int i = 0; i < LANG_COUNT; i++)
+    {
+        char tmp1[512];
+        sprintf(tmp1, "%s/Data/%s/locale-%s.MPQ", input_path, langs[i], langs[i]);
+        if (FileExists(tmp1))
+        {
+            printf("Detected locale: %s\n", langs[i]);
+            return i;
+        }
+    }
+
+    printf("Could not detect locale.\n");
+    return -1;
+}
+
+void LoadMPQFiles(int const locale)
+{
+    char filename[512];
+
+    sprintf(filename,"%s/Data/%s/locale-%s.MPQ",input_path,langs[locale],langs[locale]);
+    new MPQArchive(filename);
+
+    for(int i = 1; i < 5; ++i)
+    {
+        char ext[3] = "";
+        if(i > 1)
+            sprintf(ext, "-%i", i);
+
+        sprintf(filename,"%s/Data/%s/patch-%s%s.MPQ",input_path,langs[locale],langs[locale],ext);
+        if(!FileExists(filename))
+            break;
+        new MPQArchive(filename);
+    }
+
+    //need those files only if extract maps
+    if(extract & EXTRACT_MAP)
+    {
+        sprintf(filename,"%s/Data/common.MPQ",input_path);
+        new MPQArchive(filename);
+        sprintf(filename,"%s/Data/expansion.MPQ",input_path);
+        new MPQArchive(filename);
+
+        for(int i = 1; i < 5; ++i)
+        {
+            char ext[3] = "";
+            if(i > 1)
+                sprintf(ext, "-%i", i);
+
+            sprintf(filename,"%s/Data/patch%s.MPQ",input_path,ext);
+            if(!FileExists(filename))
+                break;
+            new MPQArchive(filename);
+        }
+    }
+}
+
+int main(int argc, char * arg[])
+{
+    printf("Map & DBC Extractor\n");
+    printf("===================\n");
+
+    HandleArgs(argc, arg);
+
+    int const locale = GetLocale();
+    if(locale < 0)
+        return 1;
+
+    LoadMPQFiles(locale);
+
+    if(extract & EXTRACT_DBC)
+        ExtractDBCFiles();
+
+    if(extract & EXTRACT_MAP)
+        ExtractMapsFromMpq();
+
+    //Close MPQs
+    for(ArchiveSet::iterator i = gOpenArchives.begin(); i != gOpenArchives.end();++i)
+        (*i)->close();
+    gOpenArchives.clear();
+
+    return 0;
+}
diff --git a/contrib/extractor/VC71_AD.sln b/contrib/extractor/VC71_AD.sln
new file mode 100644
index 00000000000..f914661b1a1
--- /dev/null
+++ b/contrib/extractor/VC71_AD.sln
@@ -0,0 +1,19 @@
+Microsoft Visual Studio Solution File, Format Version 8.00
+# Visual Studio 2005
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "ad", "VC71_ad.vcproj", "{D7552D4F-408F-4F8E-859B-366659150CF4}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Win32 = Debug|Win32
+		Release|Win32 = Release|Win32
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Debug|Win32.ActiveCfg = Debug|Win32
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Debug|Win32.Build.0 = Debug|Win32
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Release|Win32.ActiveCfg = Release|Win32
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Release|Win32.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/contrib/extractor/VC71_ad.vcproj b/contrib/extractor/VC71_ad.vcproj
new file mode 100644
index 00000000000..b1154138251
--- /dev/null
+++ b/contrib/extractor/VC71_ad.vcproj
@@ -0,0 +1,316 @@
+<?xml version="1.0" encoding="windows-1251"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="7.10"
+	Name="ad"
+	ProjectGUID="{D7552D4F-408F-4F8E-859B-366659150CF4}"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="."
+			IntermediateDirectory=".\debug\"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.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="./ad.tlb"
+				HeaderFileName=""
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="libmpq"
+				PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				UsePrecompiledHeader="0"
+				PrecompiledHeaderFile="c:\windows\temp/ad.pch"
+				AssemblerListingLocation="c:\windows\temp/"
+				ObjectFile="c:\windows\temp/"
+				ProgramDataBaseFileName="c:\windows\temp/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+				Culture="1049"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="zlib.lib"
+				OutputFile="ad debug.exe"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				AdditionalLibraryDirectories="./debug/"
+				IgnoreDefaultLibraryNames="LIBCD.lib"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="./ad debug.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="Release|Win32"
+			OutputDirectory="."
+			IntermediateDirectory=".\release"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.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="./ad.tlb"
+				HeaderFileName=""
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="libmpq"
+				PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS"
+				RuntimeLibrary="0"
+				UsePrecompiledHeader="0"
+				PrecompiledHeaderFile="c:\windows\temp/ad.pch"
+				AssemblerListingLocation="c:\windows\temp/"
+				ObjectFile="c:\windows\temp/"
+				ProgramDataBaseFileName="c:\windows\temp/"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1049"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="zlib.lib"
+				OutputFile="./ad.exe"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				AdditionalLibraryDirectories="./release/"
+				IgnoreDefaultLibraryNames="LIBC.lib"
+				ProgramDatabaseFile="./ad.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>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+			>
+			<File
+				RelativePath=".\adt.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\common.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\dbcfile.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\explode.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\extract.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\huffman.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\mpq.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\mpq_libmpq.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\parser.cpp"
+				>
+			</File>
+			<File
+				RelativePath="system.cpp"
+				>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						Optimization="0"
+						PreprocessorDefinitions=""
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						Optimization="3"
+						PreprocessorDefinitions=""
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath=".\libmpq\wave.cpp"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl"
+			>
+			<File
+				RelativePath=".\libmpq\common.h"
+				>
+			</File>
+			<File
+				RelativePath=".\dbcfile.h"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\explode.h"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\huffman.h"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\mpq.h"
+				>
+			</File>
+			<File
+				RelativePath=".\mpq_libmpq.h"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\wave.h"
+				>
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/contrib/extractor/VC80_AD.sln b/contrib/extractor/VC80_AD.sln
new file mode 100644
index 00000000000..1c46986e858
--- /dev/null
+++ b/contrib/extractor/VC80_AD.sln
@@ -0,0 +1,19 @@
+Microsoft Visual Studio Solution File, Format Version 9.00
+# Visual Studio 2005
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "ad", "VC80_ad.vcproj", "{D7552D4F-408F-4F8E-859B-366659150CF4}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Win32 = Debug|Win32
+		Release|Win32 = Release|Win32
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Debug|Win32.ActiveCfg = Debug|Win32
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Debug|Win32.Build.0 = Debug|Win32
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Release|Win32.ActiveCfg = Release|Win32
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Release|Win32.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/contrib/extractor/VC80_ad.vcproj b/contrib/extractor/VC80_ad.vcproj
new file mode 100644
index 00000000000..ddf423c4bde
--- /dev/null
+++ b/contrib/extractor/VC80_ad.vcproj
@@ -0,0 +1,339 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8,00"
+	Name="ad"
+	ProjectGUID="{D7552D4F-408F-4F8E-859B-366659150CF4}"
+	RootNamespace="ad"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="."
+			IntermediateDirectory=".\debug\"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.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="./ad.tlb"
+				HeaderFileName=""
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				AdditionalOptions="/wd4018"
+				Optimization="0"
+				AdditionalIncludeDirectories="libmpq"
+				PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				UsePrecompiledHeader="0"
+				PrecompiledHeaderFile="c:\windows\temp/ad.pch"
+				AssemblerListingLocation="c:\windows\temp/"
+				ObjectFile="c:\windows\temp/"
+				ProgramDataBaseFileName="c:\windows\temp/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+				Culture="1049"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="zlib.lib"
+				OutputFile="ad debug.exe"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				AdditionalLibraryDirectories="./debug/"
+				IgnoreDefaultLibraryNames="LIBCD.lib"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="./ad debug.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="Release|Win32"
+			OutputDirectory="."
+			IntermediateDirectory=".\release"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.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="./ad.tlb"
+				HeaderFileName=""
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				AdditionalOptions="/wd4018"
+				Optimization="3"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="libmpq"
+				PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS"
+				RuntimeLibrary="0"
+				UsePrecompiledHeader="0"
+				PrecompiledHeaderFile="c:\windows\temp/ad.pch"
+				AssemblerListingLocation="c:\windows\temp/"
+				ObjectFile="c:\windows\temp/"
+				ProgramDataBaseFileName="c:\windows\temp/"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1049"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="zlib.lib"
+				OutputFile="./ad.exe"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				AdditionalLibraryDirectories="./release/"
+				IgnoreDefaultLibraryNames="LIBC.lib"
+				ProgramDatabaseFile="./ad.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>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+			>
+			<File
+				RelativePath=".\adt.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\dbcfile.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\mpq_libmpq.cpp"
+				>
+			</File>
+			<File
+				RelativePath="system.cpp"
+				>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						Optimization="0"
+						PreprocessorDefinitions=""
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						Optimization="3"
+						PreprocessorDefinitions=""
+					/>
+				</FileConfiguration>
+			</File>
+			<Filter
+				Name="libmpq"
+				>
+				<File
+					RelativePath=".\libmpq\common.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\explode.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\extract.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\huffman.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\mpq.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\parser.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\wave.cpp"
+					>
+				</File>
+			</Filter>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl"
+			>
+			<File
+				RelativePath=".\adt.h"
+				>
+			</File>
+			<File
+				RelativePath=".\dbcfile.h"
+				>
+			</File>
+			<File
+				RelativePath=".\mpq_libmpq.h"
+				>
+			</File>
+			<Filter
+				Name="libmpq"
+				>
+				<File
+					RelativePath=".\libmpq\common.h"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\explode.h"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\huffman.h"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\mpq.h"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\wave.h"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\zconf.h"
+					>
+				</File>
+				<File
+					RelativePath=".\libmpq\zlib.h"
+					>
+				</File>
+			</Filter>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/contrib/extractor/VC90_AD.sln b/contrib/extractor/VC90_AD.sln
new file mode 100644
index 00000000000..68dd66e1f7f
--- /dev/null
+++ b/contrib/extractor/VC90_AD.sln
@@ -0,0 +1,19 @@
+Microsoft Visual Studio Solution File, Format Version 10.00
+# Visual Studio 2008
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "ad", "VC90_ad.vcproj", "{D7552D4F-408F-4F8E-859B-366659150CF4}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Win32 = Debug|Win32
+		Release|Win32 = Release|Win32
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Debug|Win32.ActiveCfg = Debug|Win32
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Debug|Win32.Build.0 = Debug|Win32
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Release|Win32.ActiveCfg = Release|Win32
+		{D7552D4F-408F-4F8E-859B-366659150CF4}.Release|Win32.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/contrib/extractor/VC90_ad.vcproj b/contrib/extractor/VC90_ad.vcproj
new file mode 100644
index 00000000000..148c33643c3
--- /dev/null
+++ b/contrib/extractor/VC90_ad.vcproj
@@ -0,0 +1,315 @@
+<?xml version="1.0" encoding="windows-1251"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="9,00"
+	Name="ad"
+	ProjectGUID="{D7552D4F-408F-4F8E-859B-366659150CF4}"
+	TargetFrameworkVersion="131072"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="."
+			IntermediateDirectory=".\debug\"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.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="./ad.tlb"
+				HeaderFileName=""
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="libmpq"
+				PreprocessorDefinitions="WIN32;_DEBUG;_WINDOWS"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				UsePrecompiledHeader="0"
+				PrecompiledHeaderFile="c:\windows\temp/ad.pch"
+				AssemblerListingLocation="c:\windows\temp/"
+				ObjectFile="c:\windows\temp/"
+				ProgramDataBaseFileName="c:\windows\temp/"
+				BrowseInformation="1"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+				Culture="1049"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="zlib.lib"
+				OutputFile="ad debug.exe"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				AdditionalLibraryDirectories="./debug/"
+				IgnoreDefaultLibraryNames="LIBCD.lib"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="./ad debug.pdb"
+				SubSystem="1"
+				RandomizedBaseAddress="1"
+				DataExecutionPrevention="0"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<Tool
+				Name="VCPostBuildEventTool"
+			/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="."
+			IntermediateDirectory=".\release"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.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="./ad.tlb"
+				HeaderFileName=""
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="3"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories="libmpq"
+				PreprocessorDefinitions="WIN32;NDEBUG;_WINDOWS"
+				RuntimeLibrary="0"
+				UsePrecompiledHeader="0"
+				PrecompiledHeaderFile="c:\windows\temp/ad.pch"
+				AssemblerListingLocation="c:\windows\temp/"
+				ObjectFile="c:\windows\temp/"
+				ProgramDataBaseFileName="c:\windows\temp/"
+				WarningLevel="3"
+				SuppressStartupBanner="true"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1049"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				AdditionalDependencies="zlib.lib"
+				OutputFile="./ad.exe"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				AdditionalLibraryDirectories="./release/"
+				IgnoreDefaultLibraryNames="LIBC.lib"
+				ProgramDatabaseFile="./ad.pdb"
+				SubSystem="1"
+				RandomizedBaseAddress="1"
+				DataExecutionPrevention="0"
+				TargetMachine="1"
+			/>
+			<Tool
+				Name="VCALinkTool"
+			/>
+			<Tool
+				Name="VCManifestTool"
+			/>
+			<Tool
+				Name="VCXDCMakeTool"
+			/>
+			<Tool
+				Name="VCBscMakeTool"
+			/>
+			<Tool
+				Name="VCFxCopTool"
+			/>
+			<Tool
+				Name="VCAppVerifierTool"
+			/>
+			<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=".\adt.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\common.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\dbcfile.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\explode.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\extract.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\huffman.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\mpq.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\mpq_libmpq.cpp"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\parser.cpp"
+				>
+			</File>
+			<File
+				RelativePath="system.cpp"
+				>
+				<FileConfiguration
+					Name="Debug|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						Optimization="0"
+						PreprocessorDefinitions=""
+						BasicRuntimeChecks="3"
+						BrowseInformation="1"
+					/>
+				</FileConfiguration>
+				<FileConfiguration
+					Name="Release|Win32"
+					>
+					<Tool
+						Name="VCCLCompilerTool"
+						Optimization="3"
+						PreprocessorDefinitions=""
+					/>
+				</FileConfiguration>
+			</File>
+			<File
+				RelativePath=".\libmpq\wave.cpp"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="Header Files"
+			Filter="h;hpp;hxx;hm;inl"
+			>
+			<File
+				RelativePath=".\libmpq\common.h"
+				>
+			</File>
+			<File
+				RelativePath=".\dbcfile.h"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\explode.h"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\huffman.h"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\mpq.h"
+				>
+			</File>
+			<File
+				RelativePath=".\mpq_libmpq.h"
+				>
+			</File>
+			<File
+				RelativePath=".\libmpq\wave.h"
+				>
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/contrib/extractor/ad b/contrib/extractor/ad
new file mode 100644
index 00000000000..564eceaaa5f
--- /dev/null
+++ b/contrib/extractor/ad
diff --git a/contrib/extractor/ad.exe b/contrib/extractor/ad.exe
new file mode 100644
index 00000000000..e9606e8e0eb
--- /dev/null
+++ b/contrib/extractor/ad.exe
diff --git a/contrib/extractor/adt.cpp b/contrib/extractor/adt.cpp
new file mode 100644
index 00000000000..26adaa28537
--- /dev/null
+++ b/contrib/extractor/adt.cpp
@@ -0,0 +1,501 @@
+#define _CRT_SECURE_NO_DEPRECATE
+
+#ifdef WIN32
+#include <windows.h>
+#endif
+
+#include <string.h>
+#include <stdio.h>
+#include <math.h>
+#include <string>
+#include <map>
+#include <vector>
+#include <set>
+
+#include "adt.h"
+#include "mpq_libmpq.h"
+
+//#include <windows.h>
+unsigned int iRes=256;
+extern uint16*areas;
+
+vec wmoc;
+
+Cell * cell;
+uint32 wmo_count;
+mcell *mcells;
+
+int holetab_h[4] = {0x1111, 0x2222, 0x4444, 0x8888};
+int holetab_v[4] = {0x000F, 0x00F0, 0x0F00, 0xF000};
+
+bool LoadADT(char* filename)
+{
+    size_t size;
+    MPQFile mf(filename);
+
+    if(mf.isEof())
+    {
+        //printf("No such file.\n");
+        return false;
+    }
+    mcells=new mcell;
+
+    wmoc.x =65*TILESIZE;
+    wmoc.z =65*TILESIZE;
+
+    size_t mcnk_offsets[256], mcnk_sizes[256];
+
+    wmo_count=0;
+    bool found=false;
+    //uint32 fs=mf.getSize()-3;
+    //while (mf.getPos()<fs)
+    while (!mf.isEof())
+    {
+        uint32 fourcc;
+        mf.read(&fourcc,4);
+        mf.read(&size, 4);
+
+        size_t nextpos = mf.getPos() + size;
+        switch(fourcc)
+        {
+            case 0x4d43494e:                                // MCIN
+            {
+                //printf("Found chunks info\n");
+                // mapchunk offsets/sizes
+                for (int i=0; i<256; i++)
+                {
+                    mf.read(&mcnk_offsets[i],4);
+                    mf.read(&mcnk_sizes[i],4);
+                    mf.seekRelative(8);
+                }
+                break;
+            }
+            case 0x4d4f4446:                                // MODF
+            {
+                /*
+                if(size)
+                {
+                    //printf("\nwmo count %d\n",size/64);
+                    wmo_count =size/64;
+                    for (int i=0; i<wmo_count; i++)
+                    {
+                        int id;
+                        mf.read(&id, 4);
+                        WMO *wmo = (WMO*)wmomanager.items[wmomanager.get(wmos[id])];
+                        WMOInstance inst(wmo, mf);
+                        wmois.push_back(inst);
+                    }
+
+                }*/
+                break;
+            }
+            case 0x4d574d4f:                                // MWMO
+            {
+                /*
+                if (size)
+                {
+                    char *buf = new char[size];
+                    mf.read(buf, size);
+                    char *p=buf;
+                    while (p<buf+size)
+                    {
+                    std::string path(p);
+                        p+=strlen(p)+1;
+                        fixname(path);
+
+                        wmomanager.add(path);
+                        wmos.push_back(path);
+                    }
+                    delete[] buf;
+                }*/
+                break;
+            }
+            case 0x4d564552:                                // MVER
+            case 0x4d484452:                                // MHDR header
+            case 0x4d434e4b:                                // MCNK
+            case 0x4d544558:                                // MTEX textures (strings)
+            case 0x4d4d4458:                                // MMDX m2 models (strings)
+            case 0x4d4d4944:                                // MMID offsets for strings in MMDX
+            case 0x4d574944:                                // MWID offsets for strings in MWMO
+            case 0x4d444446:                                // MDDF
+            case 0x4d46424f:                                // MFBO new in BC
+            case 0x4d48324f:                                // MH2O new in WotLK
+                break;
+            default:
+            {
+                // mf.seekRelative(-3);
+                printf("Unhandled map chunk: %u\n",fourcc);
+                break;
+            }
+        }
+        mf.seek(nextpos);
+    }
+
+    //printf("Loading chunks info\n");
+    // read individual map chunks
+    for (int j=0; j<16; j++)
+        for (int i=0; i<16; i++)
+        {
+            mf.seek((int)mcnk_offsets[j*16+i]);
+            LoadMapChunk(mf,&(mcells->ch[i][j]));
+        }
+
+    /*
+    for(uint32 t=0;t<wmo_count ;t++)
+    {
+        wmois[t].draw();
+    }*/
+
+    mf.close();
+    return true;
+}
+
+struct MapChunkHeader {
+    uint32 flags;
+    uint32 ix;
+    uint32 iy;
+    uint32 nLayers;
+    uint32 nDoodadRefs;
+    uint32 ofsHeight;
+    uint32 ofsNormal;
+    uint32 ofsLayer;
+    uint32 ofsRefs;
+    uint32 ofsAlpha;
+    uint32 sizeAlpha;
+    uint32 ofsShadow;
+    uint32 sizeShadow;
+    uint32 areaid;
+    uint32 nMapObjRefs;
+    uint32 holes;
+    uint16 s1;
+    uint16 s2;
+    uint32 d1;
+    uint32 d2;
+    uint32 d3;
+    uint32 predTex;
+    uint32 nEffectDoodad;
+    uint32 ofsSndEmitters;
+    uint32 nSndEmitters;
+    uint32 ofsLiquid;
+    uint32 sizeLiquid;
+    float  zpos;
+    float  xpos;
+    float  ypos;
+    uint32 textureId;
+    uint32 props;
+    uint32 effectId;
+};
+
+bool isHole(int holes, int i, int j)
+{
+    int testi = i/2;
+    int testj = j/4;
+    if(testi>3) testi = 3;
+    if(testj>3) testj = 3;
+	return (holes & holetab_h[testi] & holetab_v[testj])!=0;
+}
+
+inline
+void LoadMapChunk(MPQFile & mf, chunk*_chunk)
+{
+    float h;
+    uint32 fourcc;
+    uint32 size;
+    MapChunkHeader header;
+
+    mf.seekRelative(4);
+    mf.read(&size, 4);
+
+    size_t lastpos = mf.getPos() + size;
+    mf.read(&header, 0x80);
+    _chunk->area_id =header.areaid ;
+    _chunk->flag =0;
+
+    float xbase = header.xpos;
+    float ybase = header.ypos;
+    float zbase = header.zpos;
+    zbase = TILESIZE*32-zbase;
+    xbase = TILESIZE*32-xbase;
+    if(wmoc.x >xbase)wmoc.x =xbase;
+    if(wmoc.z >zbase)wmoc.z =zbase;
+    int chunkflags = header.flags;
+    float zmin=999999999.0f;
+    float zmax=-999999999.0f;
+    //must be there, bl!zz uses some crazy format
+    int nTextures;
+    while (mf.getPos() < lastpos)
+    {
+        mf.read(&fourcc,4);
+        mf.read(&size, 4);
+        //if(size!=580)
+        //    printf("\n sz=%d",size);
+        size_t nextpos = mf.getPos()  + size;
+        if(fourcc==0x4d435654)                              // MCVT
+        {
+            for (int j=0; j<17; j++)
+                for (int i=0; i<((j%2)?8:9); i++)
+                {
+                    mf.read(&h,4);
+                    float z=h+ybase;
+                    if (j%2)
+                    {
+                        if(isHole(header.holes,i,j))
+                            _chunk->v8[i][j/2] = -1000;
+                        else
+                            _chunk->v8[i][j/2] = z;
+                    }
+                    else
+                    {
+                        if(isHole(header.holes,i,j))
+                            _chunk->v9[i][j/2] = -1000;
+                        else
+                            _chunk->v9[i][j/2] = z;
+                    }
+
+                    if(z>zmax)zmax=z;
+                    //if(z<zmin)zmin=z;
+                }
+        }
+        else if(fourcc==0x4d434e52)                         // MCNR
+        {
+            nextpos = mf.getPos() + 0x1C0; // size fix
+        }
+        else if(fourcc==0x4d434c51)                         // MCLQ
+        {
+            // liquid / water level
+            //bool haswater;
+            char fcc1[5];
+            mf.read(fcc1,4);
+            flipcc(fcc1);
+            fcc1[4]=0;
+
+            if (!strcmp(fcc1,"MCSE"))
+            {
+                for(int i=0;i<9;i++)
+                    for(int j=0;j<9;j++)
+                        _chunk->waterlevel[i][j]=-999999; // no liquid/water
+            }
+            else
+            {
+                float maxheight;
+                mf.read(&maxheight, 4);
+
+                for(int j=0;j<9;j++)
+                    for(int i=0;i<9;i++)
+                    {
+                        mf.read(&h, 4);
+                        mf.read(&h, 4);
+                        if(h > maxheight)
+                            _chunk->waterlevel[i][j]=-999999;
+                        else
+                            _chunk->waterlevel[i][j]=h;
+                    }
+
+                if(chunkflags & 4 || chunkflags & 8)
+                    _chunk->flag |=1;
+                if(chunkflags & 16)
+                    _chunk->flag |=2;
+
+            }
+            break;
+        }
+        else if (fourcc==0x4d434c59)                        // MCLY
+        {
+            // texture info
+            nTextures = (int)size;
+        }
+        else if (fourcc==0x4d43414c)                        // MCAL
+        {
+            if (nTextures<=0)
+                continue;
+        }
+
+        mf.seek(nextpos);
+    }
+}
+
+double solve (vec *v,vec *p)
+{
+    double a = v[0].y *(v[1].z - v[2].z) + v[1].y *(v[2].z - v[0].z) + v[2].y *(v[0].z - v[1].z);
+    double b = v[0].z *(v[1].x - v[2].x) + v[1].z *(v[2].x - v[0].x) + v[2].z *(v[0].x - v[1].x);
+    double c = v[0].x *(v[1].y - v[2].y) + v[1].x *(v[2].y - v[0].y) + v[2].x *(v[0].y - v[1].y);
+    double d = v[0].x *(v[1].y*v[2].z - v[2].y*v[1].z) + v[1].x* (v[2].y*v[0].z - v[0].y*v[2].z) + v[2].x* (v[0].y*v[1].z - v[1].y*v[0].z);
+    //-d
+
+    //plane equation ax+by+cz+d=0
+    return ((a*p->x+c*p->z-d)/b);
+}
+
+inline
+double GetZ(double x,double z)
+{
+    vec v[3];
+    vec p;
+
+    //bool inWMO=false;
+
+    //if(!inWMO)
+    {
+        //find out quadrant
+        int xc=(int)(x/UNITSIZE);
+        int zc=(int)(z/UNITSIZE);
+        if(xc>127)xc=127;
+        if(zc>127)zc=127;
+
+        double lx=x-xc*UNITSIZE;
+        double lz=z-zc*UNITSIZE;
+        p.x=lx;
+        p.z=lz;
+
+        v[0].x=UNITSIZE/2;
+        v[0].y =cell->v8[xc][zc];
+        v[0].z=UNITSIZE/2;
+
+        if(lx>lz)
+        {
+            v[1].x=UNITSIZE;
+            v[1].y =cell->v9[xc+1][zc];
+            v[1].z=0;
+        }
+        else
+        {
+            v[1].x=0.0;
+            v[1].y =cell->v9[xc][zc+1];
+            v[1].z=UNITSIZE;
+        }
+
+        if(lz>UNITSIZE-lx)
+        {
+            v[2].x=UNITSIZE;
+            v[2].y =cell->v9[xc+1][zc+1];
+            v[2].z=UNITSIZE;
+        }
+        else
+        {
+            v[2].x=0;
+            v[2].y=cell->v9[xc][zc];
+            v[2].z=0;
+        }
+
+        return -solve(v,&p);
+    }
+}
+
+inline
+void TransformWaterData()
+{
+    cell= new Cell;
+
+    for(int x=0;x<128;x++)
+        for(int y=0;y<128;y++)
+            cell->v9[x][y] = mcells->ch[x/8][y/8].waterlevel[x%8][y%8];
+
+    //and the last 1
+    cell->v9[128][128] = mcells->ch[15][15].waterlevel[8][8];
+}
+
+inline
+void TransformData()
+{
+    cell= new Cell;
+
+    for(int x=0;x<128;x++)
+    {
+        for(int y=0;y<128;y++)
+        {
+            cell->v8[x][y] = (float)mcells->ch[x/8][y/8].v8[x%8][y%8];
+            cell->v9[x][y] = (float)mcells->ch[x/8][y/8].v9[x%8][y%8];
+        }
+
+        //extra 1 point on bounds
+        cell->v9[x][128] = (float)mcells->ch[x/8][15].v9[x%8][8];
+        //x==y
+        cell->v9[128][x] = (float)mcells->ch[15][x/8].v9[8][x%8];
+
+    }
+
+    //and the last 1
+    cell->v9[128][128] = (float)mcells->ch[15][15].v9[8][8];
+
+    delete mcells;
+}
+
+const char MAP_MAGIC[] = "MAP_2.00";
+
+bool ConvertADT(char * filename,char * filename2)
+{
+    //if(!strstr(filename,"oth_32_48"))return false;
+    if(!LoadADT(filename))
+        return false;
+
+    FILE *output=fopen(filename2,"wb");
+    if(!output)
+    {
+        printf("Can't create the output file '%s'\n",filename2);
+        return false;
+    }
+
+    // write magic header
+    fwrite(MAP_MAGIC,1,8,output);
+
+    for(unsigned int x=0;x<16;x++)
+    {
+        for(unsigned int y=0;y<16;y++)
+        {
+            if(mcells->ch[y][x].area_id && mcells->ch[y][x].area_id < 0x102D)
+            {
+                if(areas[mcells->ch[y][x].area_id]==0xffff)
+                    printf("\nCan't find area flag for areaid %u.\n",mcells->ch[y][x].area_id);
+
+                fwrite(&areas[mcells->ch[y][x].area_id],1,2,output);
+            }
+            else
+            {
+                uint16 flag=0xffff;
+                fwrite(&flag,1,2,output);
+            }
+        }
+    }
+
+    for(unsigned int x=0;x<16;x++)
+        for(unsigned int y=0;y<16;y++)
+            fwrite(&mcells->ch[y][x].flag,1,1,output);
+
+    TransformWaterData();
+
+    for(unsigned int x=0;x<128;x++)
+        for(unsigned int y=0;y<128;y++)
+            fwrite(&cell->v9[y][x],1,sizeof(float),output);
+
+    delete cell;
+    TransformData();
+
+    for(unsigned int x=0;x<iRes;x++)
+    for(unsigned int y=0;y<iRes;y++)
+    {
+        float z=(float)GetZ(
+                    (((double)(y))*TILESIZE)/((double)(iRes-1)),
+                    (((double)(x))*TILESIZE)/((double)(iRes-1)));
+
+        fwrite(&z,1,sizeof(z),output);
+    }
+
+    fclose(output);
+    delete cell;
+/*
+    for (std::vector<std::string>::iterator it = wmos.begin(); it != wmos.end(); ++it)
+    wmomanager.delbyname(*it);
+
+    wmos.clear();
+    wmois.clear();
+
+    for (std::vector<model>::iterator it = wmomodel.begin(); it != wmomodel.end(); ++it)
+    {
+        it->tr.clear();
+
+    }
+    //printf("\n %d \n",in);
+    wmomodel.clear();
+    //polygons.clear();*/
+    return true;
+}
diff --git a/contrib/extractor/adt.h b/contrib/extractor/adt.h
new file mode 100644
index 00000000000..6e079461a66
--- /dev/null
+++ b/contrib/extractor/adt.h
@@ -0,0 +1,54 @@
+#ifndef ADT_H
+#define ADT_H
+
+#define TILESIZE (533.33333f)
+#define CHUNKSIZE ((TILESIZE) / 16.0f)
+#define UNITSIZE (CHUNKSIZE / 8.0f)
+
+typedef unsigned char uint8;
+typedef unsigned short uint16;
+typedef unsigned int uint32;
+class Liquid;
+typedef struct {
+float x;
+float y;
+float z;
+}svec;
+
+typedef struct {
+double x;
+double y;
+double z;
+}vec;
+
+typedef struct{
+    vec v[3];
+}triangle;
+
+typedef struct{
+float v9[16*8+1][16*8+1];
+float v8[16*8][16*8];
+}Cell;
+
+typedef struct{
+double v9[9][9];
+double v8[8][8];
+uint16 area_id;
+//Liquid *lq;
+float waterlevel[9][9];
+uint8 flag;
+}chunk;
+
+class WMO;
+class WMOManager;
+void fixname(std::string &name);
+
+typedef struct
+{
+chunk ch[16][16];
+}mcell;
+class MPQFile;
+void LoadMapChunk(MPQFile &,chunk*);
+bool LoadWMO(char* filename);
+#endif
+
diff --git a/contrib/extractor/dbcfile.cpp b/contrib/extractor/dbcfile.cpp
new file mode 100644
index 00000000000..acfb35482ff
--- /dev/null
+++ b/contrib/extractor/dbcfile.cpp
@@ -0,0 +1,69 @@
+#define _CRT_SECURE_NO_DEPRECATE
+
+#include "dbcfile.h"
+#include "mpq_libmpq.h"
+
+DBCFile::DBCFile(const std::string &filename):
+    filename(filename),
+    data(0)
+{
+
+}
+void DBCFile::open()
+{
+    MPQFile f(filename.c_str());
+    char header[4];
+    unsigned int na,nb,es,ss;
+
+    f.read(header,4); // Number of records
+    assert(header[0]=='W' && header[1]=='D' && header[2]=='B' && header[3] == 'C');
+    f.read(&na,4); // Number of records
+    f.read(&nb,4); // Number of fields
+    f.read(&es,4); // Size of a record
+    f.read(&ss,4); // String size
+
+    recordSize = es;
+    recordCount = na;
+    fieldCount = nb;
+    stringSize = ss;
+    assert(fieldCount*4 == recordSize);
+
+    data = new unsigned char[recordSize*recordCount+stringSize];
+    stringTable = data + recordSize*recordCount;
+    f.read(data,recordSize*recordCount+stringSize);
+    f.close();
+}
+DBCFile::~DBCFile()
+{
+    delete [] data;
+}
+
+DBCFile::Record DBCFile::getRecord(size_t id)
+{
+    assert(data);
+    return Record(*this, data + id*recordSize);
+}
+
+size_t DBCFile::getMaxId()
+{
+    assert(data);
+
+    size_t maxId = 0;
+    for(size_t i = 0; i < getRecordCount(); ++i)
+    {
+        if(maxId < getRecord(i).getUInt(0))
+            maxId = getRecord(i).getUInt(0);
+    }
+    return maxId;
+}
+
+DBCFile::Iterator DBCFile::begin()
+{
+    assert(data);
+    return Iterator(*this, data);
+}
+DBCFile::Iterator DBCFile::end()
+{
+    assert(data);
+    return Iterator(*this, stringTable);
+}
diff --git a/contrib/extractor/dbcfile.h b/contrib/extractor/dbcfile.h
new file mode 100644
index 00000000000..521ca67423c
--- /dev/null
+++ b/contrib/extractor/dbcfile.h
@@ -0,0 +1,118 @@
+#ifndef DBCFILE_H
+#define DBCFILE_H
+#include <cassert>
+#include <string>
+
+class DBCFile
+{
+public:
+    DBCFile(const std::string &filename);
+    ~DBCFile();
+
+    // Open database. It must be openened before it can be used.
+    void open();
+
+    // Database exceptions
+    class Exception
+    {
+    public:
+        Exception(const std::string &message): message(message)
+        { }
+        virtual ~Exception()
+        { }
+        const std::string &getMessage() {return message;}
+    private:
+        std::string message;
+    };
+    class NotFound: public Exception
+    {
+    public:
+        NotFound(): Exception("Key was not found")
+        { }
+    };
+    // Iteration over database
+    class Iterator;
+    class Record
+    {
+    public:
+        float getFloat(size_t field) const
+        {
+            assert(field < file.fieldCount);
+            return *reinterpret_cast<float*>(offset+field*4);
+        }
+        unsigned int getUInt(size_t field) const
+        {
+            assert(field < file.fieldCount);
+            return *reinterpret_cast<unsigned int*>(offset+field*4);
+        }
+        int getInt(size_t field) const
+        {
+            assert(field < file.fieldCount);
+            return *reinterpret_cast<int*>(offset+field*4);
+        }
+        const char *getString(size_t field) const
+        {
+            assert(field < file.fieldCount);
+            size_t stringOffset = getUInt(field);
+            assert(stringOffset < file.stringSize);
+            return reinterpret_cast<char*>(file.stringTable + stringOffset);
+        }
+    private:
+        Record(DBCFile &file, unsigned char *offset): file(file), offset(offset) {}
+        unsigned char *offset;
+        DBCFile &file;
+
+        friend class DBCFile;
+        friend class DBCFile::Iterator;
+    };
+    /** Iterator that iterates over records
+    */
+    class Iterator
+    {
+    public:
+        Iterator(DBCFile &file, unsigned char *offset):
+            record(file, offset) {}
+        /// Advance (prefix only)
+        Iterator & operator++() {
+            record.offset += record.file.recordSize;
+            return *this;
+        }
+        /// Return address of current instance
+        Record const & operator*() const { return record; }
+        const Record* operator->() const {
+            return &record;
+        }
+        /// Comparison
+        bool operator==(const Iterator &b) const
+        {
+            return record.offset == b.record.offset;
+        }
+        bool operator!=(const Iterator &b) const
+        {
+            return record.offset != b.record.offset;
+        }
+    private:
+        Record record;
+    };
+
+    // Get record by id
+    Record getRecord(size_t id);
+    /// Get begin iterator over records
+    Iterator begin();
+    /// Get begin iterator over records
+    Iterator end();
+    /// Trivial
+    size_t getRecordCount() const { return recordCount;}
+    size_t getFieldCount() const { return fieldCount; }
+    size_t getMaxId();
+private:
+    std::string filename;
+    size_t recordSize;
+    size_t recordCount;
+    size_t fieldCount;
+    size_t stringSize;
+    unsigned char *data;
+    unsigned char *stringTable;
+};
+
+#endif
diff --git a/contrib/extractor/debug/zlib.lib b/contrib/extractor/debug/zlib.lib
new file mode 100644
index 00000000000..ffd7d9a2605
--- /dev/null
+++ b/contrib/extractor/debug/zlib.lib
diff --git a/contrib/extractor/libmpq/Makefile b/contrib/extractor/libmpq/Makefile
new file mode 100644
index 00000000000..eb1965e29f1
--- /dev/null
+++ b/contrib/extractor/libmpq/Makefile
@@ -0,0 +1,17 @@
+CC = g++
+AR = ar
+objects = common.o explode.o extract.o huffman.o wave.o mpq.o parser.o
+zlib_objects = ../../../dep/src/zlib/*.o #adler32.o compress.o crc32.o gzio.o uncompr.o deflate.o trees.o zutil.o inflate.o inftrees.o inffast.o
+
+all:	libmpq.a libmpq.so
+
+clean: 
+	rm -f libmpq.a libmpq.so *.o
+
+libmpq.a: $(objects) $(zlib_objects)
+	$(AR) cru $@ $+
+libmpq.so: $(objects) $(zlib_objects)
+	$(CC) -fPIC -o $@ $+
+
+%.o:%.cpp
+	$(CC) -I../ -c $+
diff --git a/contrib/extractor/libmpq/Makefile.am b/contrib/extractor/libmpq/Makefile.am
new file mode 100644
index 00000000000..192bd1369ef
--- /dev/null
+++ b/contrib/extractor/libmpq/Makefile.am
@@ -0,0 +1,23 @@
+# The input Makefile for the main mpq-tools
+
+lib_LTLIBRARIES		= libmpq.la
+noinst_HEADERS		= explode.h huffman.h wave.h common.h
+
+# The directory where the include files will be installed.
+libmpq_includedir	= $(includedir)/libmpq
+
+# Which header files to install.
+libmpq_include_HEADERS	= mpq.h
+
+libmpq_la_SOURCES	= $(GENERAL_SRCS)
+libmpq_la_LDFLAGS	= -release $(LIBMPQ_VERSION)
+libmpq_la_LIBADD	= @Z_LIBS@
+
+GENERAL_SRCS =			\
+	common.c		\
+	huffman.c		\
+	extract.c		\
+	explode.c		\
+	mpq.c			\
+	parser.c		\
+	wave.c
diff --git a/contrib/extractor/libmpq/common.cpp b/contrib/extractor/libmpq/common.cpp
new file mode 100644
index 00000000000..7b902087540
--- /dev/null
+++ b/contrib/extractor/libmpq/common.cpp
@@ -0,0 +1,801 @@
+/*
+ *  common.c -- shared functions used by mpq-tools.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ *
+ *  $Id: common.c,v 1.12 2004/02/12 00:42:54 mbroemme Exp $
+ */
+#define _CRT_SECURE_NO_DEPRECATE
+//#include <dirent.h>
+#include <sys/stat.h>
+//#include <unistd.h>
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+#include "mpq.h"
+#include "common.h"
+#include <ctype.h>
+
+/*
+ *  This function decrypts a MPQ block.
+ */
+int libmpq_decrypt_block(mpq_archive *mpq_a, unsigned int *block, unsigned int length, unsigned int seed1) {
+	unsigned int seed2 = 0xEEEEEEEE;
+	unsigned int ch;
+
+	/* Round to unsigned int's */
+	length >>= 2;
+	while (length-- > 0) {
+		seed2    += mpq_a->buf[0x400 + (seed1 & 0xFF)];
+		ch        = *block ^ (seed1 + seed2);
+		seed1     = ((~seed1 << 0x15) + 0x11111111) | (seed1 >> 0x0B);
+		seed2     = ch + seed2 + (seed2 << 5) + 3;
+		*block++  = ch;
+	}
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+/*
+ *  This function decrypts the hashtable for the
+ *  file informations.
+ */
+int libmpq_decrypt_hashtable(mpq_archive *mpq_a, unsigned char *pbKey) {
+	unsigned int seed1 = 0x7FED7FED;
+	unsigned int seed2 = 0xEEEEEEEE;
+	unsigned int ch;			/* One key character */
+	unsigned int *pdwTable = (unsigned int *)(mpq_a->hashtable);
+	unsigned int length = mpq_a->header->hashtablesize * 4;
+
+	/* Prepare seeds */
+	while (*pbKey != 0) {
+		ch = toupper(*pbKey++);
+		seed1 = mpq_a->buf[0x300 + ch] ^ (seed1 + seed2);
+		seed2 = ch + seed1 + seed2 + (seed2 << 5) + 3;
+	}
+
+	/* Decrypt it */
+	seed2 = 0xEEEEEEEE;
+	while (length-- > 0) {
+		seed2 += mpq_a->buf[0x400 + (seed1 & 0xFF)];
+		ch     = *pdwTable ^ (seed1 + seed2);
+		seed1  = ((~seed1 << 0x15) + 0x11111111) | (seed1 >> 0x0B);
+		seed2  = ch + seed2 + (seed2 << 5) + 3;
+		*pdwTable++ = ch;
+	}
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+/*
+ *  This function decrypts the blocktable.
+ */
+int libmpq_decrypt_blocktable(mpq_archive *mpq_a, unsigned char *pbKey) {
+	unsigned int seed1 = 0x7FED7FED;
+	unsigned int seed2 = 0xEEEEEEEE;
+	unsigned int ch;			/* One key character */
+	unsigned int *pdwTable = (unsigned int *)(mpq_a->blocktable);
+	unsigned int length = mpq_a->header->blocktablesize * 4;
+
+	/* Prepare seeds */
+	while(*pbKey != 0) {
+		ch = toupper(*pbKey++);
+		seed1 = mpq_a->buf[0x300 + ch] ^ (seed1 + seed2);
+		seed2 = ch + seed1 + seed2 + (seed2 << 5) + 3;
+	}         
+
+	/* Decrypt it */
+	seed2 = 0xEEEEEEEE;
+	while(length-- > 0) {
+		seed2 += mpq_a->buf[0x400 + (seed1 & 0xFF)];
+		ch     = *pdwTable ^ (seed1 + seed2);
+		seed1  = ((~seed1 << 0x15) + 0x11111111) | (seed1 >> 0x0B);
+		seed2  = ch + seed2 + (seed2 << 5) + 3;
+		*pdwTable++ = ch;
+	}
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+int libmpq_read_listfile(mpq_archive *mpq_a, FILE *fp) {
+	int mpq_size;
+	int mpq_ht_size;
+	int mpq_bt_size;
+	int mpq_blocksize;
+	int mpq_files;
+	int mpq_csize;
+	int mpq_fsize;
+	int entries;
+	char listdb_version[10];
+	char libmpq_version[10];
+	int listdb_temp_version = 0;
+	int libmpq_temp_version = 0;
+
+	/* first check header and version */
+	if (libmpq_conf_get_value(fp, "LIBMPQ_VERSION", mpq_a->mpq_l->mpq_version, LIBMPQ_CONF_TYPE_CHAR, sizeof(mpq_a->mpq_l->mpq_version))) {
+		return LIBMPQ_CONF_EFILE_CORRUPT;
+	} else {
+
+		/* copy to temp buffer for removing . characters */
+		sprintf(listdb_version, (char *)mpq_a->mpq_l->mpq_version);
+
+		/* remove . characters from listfile version */
+		libmpq_conf_delete_char(listdb_version, ".");
+
+		/* get libmpq version */
+		sprintf(libmpq_version, "%i%i%i",LIBMPQ_MAJOR_VERSION, LIBMPQ_MINOR_VERSION, LIBMPQ_PATCH_VERSION);
+
+		/* convert to number */
+		listdb_temp_version = atoi(listdb_version);
+		libmpq_temp_version = atoi(libmpq_version);
+
+		/* check if installed libmpq version is valid for listfile version */
+		if ((libmpq_temp_version < listdb_temp_version) || (libmpq_temp_version == 0) || (listdb_temp_version == 0)) {
+			return LIBMPQ_CONF_EFILE_VERSION;
+		}
+	}
+
+	/* check listfile header, the following entries must be set */
+	if (libmpq_conf_get_value(fp, "MPQ_SIZE", &mpq_size, LIBMPQ_CONF_TYPE_INT, 0)) {
+		return LIBMPQ_CONF_EFILE_CORRUPT;
+	}
+	if (libmpq_conf_get_value(fp, "MPQ_HASHTABLE_SIZE", &mpq_ht_size, LIBMPQ_CONF_TYPE_INT, 0)) {
+		return LIBMPQ_CONF_EFILE_CORRUPT;
+	}
+	if (libmpq_conf_get_value(fp, "MPQ_BLOCKTABLE_SIZE", &mpq_bt_size, LIBMPQ_CONF_TYPE_INT, 0)) {
+		return LIBMPQ_CONF_EFILE_CORRUPT;
+	}
+	if (libmpq_conf_get_value(fp, "MPQ_BLOCKSIZE", &mpq_blocksize, LIBMPQ_CONF_TYPE_INT, 0)) {
+		return LIBMPQ_CONF_EFILE_CORRUPT;
+	}
+	if (libmpq_conf_get_value(fp, "MPQ_FILES", &mpq_files, LIBMPQ_CONF_TYPE_INT, 0)) {
+		return LIBMPQ_CONF_EFILE_CORRUPT;
+	}
+	if (libmpq_conf_get_value(fp, "MPQ_COMPRESSED_SIZE", &mpq_csize, LIBMPQ_CONF_TYPE_INT, 0)) {
+		return LIBMPQ_CONF_EFILE_CORRUPT;
+	}
+	if (libmpq_conf_get_value(fp, "MPQ_UNCOMPRESSED_SIZE", &mpq_fsize, LIBMPQ_CONF_TYPE_INT, 0)) {
+		return LIBMPQ_CONF_EFILE_CORRUPT;
+	}
+	if (libmpq_conf_get_value(fp, "MPQ_NAME", mpq_a->mpq_l->mpq_name, LIBMPQ_CONF_TYPE_CHAR, PATH_MAX)) {
+		return LIBMPQ_CONF_EFILE_CORRUPT;
+	}
+	if (libmpq_conf_get_value(fp, "MPQ_TYPE", mpq_a->mpq_l->mpq_type, LIBMPQ_CONF_TYPE_CHAR, sizeof(mpq_a->mpq_l->mpq_type))) {
+		return LIBMPQ_CONF_EFILE_CORRUPT;
+	}
+
+	/* these are optional parameters, if they are empty we set the struct members empty */
+	libmpq_conf_get_value(fp, "MPQ_GAME", mpq_a->mpq_l->mpq_game, LIBMPQ_CONF_TYPE_CHAR, sizeof(mpq_a->mpq_l->mpq_game));
+	libmpq_conf_get_value(fp, "MPQ_GAME_VERSION", mpq_a->mpq_l->mpq_game_version, LIBMPQ_CONF_TYPE_CHAR, sizeof(mpq_a->mpq_l->mpq_game_version));
+
+	/* check if we found a valid listfile for the given archive */
+	if (mpq_a->header->hashtablesize == mpq_ht_size && mpq_a->header->blocktablesize == mpq_bt_size && mpq_a->blocksize == mpq_blocksize && libmpq_archive_info(mpq_a, LIBMPQ_MPQ_ARCHIVE_SIZE) == mpq_size && libmpq_archive_info(mpq_a, LIBMPQ_MPQ_NUMFILES) == mpq_files && libmpq_archive_info(mpq_a, LIBMPQ_MPQ_COMPRESSED_SIZE) == mpq_csize && libmpq_archive_info(mpq_a, LIBMPQ_MPQ_UNCOMPRESSED_SIZE) == mpq_fsize) {
+
+		/* check if the filelist is correct */
+		if (!libmpq_conf_get_array(fp, "FILE_NAMES", (char ***)&mpq_a->mpq_l->mpq_files, &entries)) {
+
+			/* we have a corrupt filelist, so return */
+			return LIBMPQ_CONF_EFILE_LIST_CORRUPT;
+		} else {
+
+			/* now check if filelist entries matches number of files in the archive. */
+			if (entries != libmpq_archive_info(mpq_a, LIBMPQ_MPQ_NUMFILES)) {
+				libmpq_free_listfile((char **)mpq_a->mpq_l->mpq_files);
+				mpq_a->mpq_l->mpq_files = NULL;
+				return LIBMPQ_CONF_EFILE_LIST_CORRUPT;
+			}
+		}
+	}
+
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+/*
+ *  This function frees up the space reserved by libmpq_get_listfile()
+ */
+int libmpq_free_listfile(char **filelist) {
+	int i = 0;
+	while (filelist[i]) {
+		free(filelist[i++]);
+	}
+	free(filelist);
+
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+/*
+ *  This function reads the directory and the subdirectories
+ *  of the listfile database and adds a entry to the lisfile
+ *  array.
+ */
+/*int libmpq_detect_listfile_rec(char path[PATH_MAX], char ***filelist, int *fl_count, int *fl_size) {
+	char nextpath[PATH_MAX];
+	DIR *dp = opendir(path);
+	FILE *fp;
+	struct dirent *entry;
+	struct stat statbuf;
+	char buf[LIBMPQ_CONF_BUFSIZE];
+
+	if (dp == NULL) {
+		return LIBMPQ_CONF_EOPEN_DIR;
+	} else {
+		while ((entry = readdir(dp)) != NULL) {
+			if (strncmp(entry->d_name, ".", 1) == 0 || strncmp(entry->d_name, "..", 2) == 0) {
+				continue;
+			}
+			if (strnlen(path, PATH_MAX) + strnlen(entry->d_name, PATH_MAX) + 2 > sizeof nextpath) {
+				continue;
+			}
+
+			snprintf(nextpath, PATH_MAX, "%s/%s", path, entry->d_name);
+
+			// check if file extension matches listdb file extension
+			if (strncmp(&entry->d_name[strlen(entry->d_name) - strlen(LIBMPQ_CONF_EXT)], LIBMPQ_CONF_EXT, strlen(LIBMPQ_CONF_EXT)) == 0) {
+
+				// check if it is really a listdb file
+				if ((fp = fopen(nextpath, "r")) != NULL ) {
+					while (fgets(buf, LIBMPQ_CONF_BUFSIZE, fp) != NULL) {
+						char *line;
+
+						buf[strlen(buf) - 1] = '\0';
+
+						// skip whitespace
+						for (line = buf; isspace(*line); line++) {
+							continue;
+						}
+
+						// skip empty line
+						if (line[0] == '\0') {
+							continue;
+						}
+
+						// skip comments
+						if (line[0] == '#') {
+							continue;
+						}
+
+						//search for listdb header; dirty but works :)
+						if (!strncasecmp(line, LIBMPQ_CONF_HEADER, strlen(LIBMPQ_CONF_HEADER))) {
+
+							// set the next filelist entry to a copy of the file path
+							(*filelist)[(*fl_count)++] = strdup(nextpath);
+
+							// increase the array size
+							if ((*fl_count) == (*fl_size)) {
+								(*filelist) = realloc((*filelist), ((*fl_size) + LIBMPQ_CONF_FL_INCREMENT) * sizeof(char *));
+								(*fl_size) += LIBMPQ_CONF_FL_INCREMENT;
+							}
+
+							// header found so we could stop reading the file.
+							break;
+						}
+					}
+					fclose(fp);
+				}
+			}
+
+			if (stat(nextpath, &statbuf) < 0) {
+				continue;
+			}
+
+			// if entry ia a subdirectory, read it
+			if (S_ISDIR(statbuf.st_mode)) {
+				libmpq_detect_listfile_rec(nextpath, filelist, fl_count, fl_size);
+			}
+		}
+		closedir(dp);
+	}
+
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+*/
+
+/*
+ *  This functions tries to get file decryption key. The trick comes from block
+ *  positions which are stored at the begin of each compressed file. We know the
+ *  file size, that means we know number of blocks that means we know the first
+ *  int value in block position. And if we know encrypted and decrypted value,
+ *  we can find the decryption key.
+ */
+int libmpq_detect_fileseed(mpq_archive *mpq_a, unsigned int *block, unsigned int decrypted) {
+	unsigned int saveseed1;
+	unsigned int temp = *block ^ decrypted;		/* temp = seed1 + seed2 */
+	int i = 0;
+	temp -= 0xEEEEEEEE;				/* temp = seed1 + mpq_a->buf[0x400 + (seed1 & 0xFF)] */
+
+	for (i = 0; i < 0x100; i++) {			/* Try all 255 possibilities */
+		unsigned int seed1;
+		unsigned int seed2 = 0xEEEEEEEE;
+		unsigned int ch;
+
+		/* Try the first unsigned int's (We exactly know the value) */
+		seed1  = temp - mpq_a->buf[0x400 + i];
+		seed2 += mpq_a->buf[0x400 + (seed1 & 0xFF)];
+		ch     = block[0] ^ (seed1 + seed2);
+
+		if (ch != decrypted) {
+			continue;
+		}
+
+		/* Add 1 because we are decrypting block positions */
+		saveseed1 = seed1 + 1;
+
+		/*
+		 *  If OK, continue and test the second value. We don't know exactly the value,
+		 *  but we know that the second one has lower 16 bits set to zero
+		 *  (no compressed block is larger than 0xFFFF bytes)
+		 */
+		seed1  = ((~seed1 << 0x15) + 0x11111111) | (seed1 >> 0x0B);
+		seed2  = ch + seed2 + (seed2 << 5) + 3;
+		seed2 += mpq_a->buf[0x400 + (seed1 & 0xFF)];
+		ch     = block[1] ^ (seed1 + seed2);
+		if ((ch & 0xFFFF0000) == 0) {
+			return saveseed1;
+		}
+	}
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+/*
+ *  This function initialize the decryption buffer
+ */
+int libmpq_init_buffer(mpq_archive *mpq_a) {
+	unsigned int seed   = 0x00100001;
+	unsigned int index1 = 0;
+	unsigned int index2 = 0;
+	int i;
+
+	memset(mpq_a->buf, 0, sizeof(mpq_a->buf));
+
+	/* Initialize the decryption buffer. */
+	for (index1 = 0; index1 < 0x100; index1++) {
+		for(index2 = index1, i = 0; i < 5; i++, index2 += 0x100) {
+			unsigned int temp1, temp2;
+			seed  = (seed * 125 + 3) % 0x2AAAAB;
+			temp1 = (seed & 0xFFFF) << 0x10;
+
+			seed  = (seed * 125 + 3) % 0x2AAAAB;
+			temp2 = (seed & 0xFFFF);
+
+			mpq_a->buf[index2] = (temp1 | temp2);
+		}
+	}
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+/*
+ *  This functions fills the mpq_hash structure with the
+ *  hashtable found in the MPQ file. The hashtable will
+ *  be decrypted for later use.
+ */
+int libmpq_read_hashtable(mpq_archive *mpq_a) {
+	unsigned int bytes = 0;
+	int rb = 0;
+
+	/*
+	 *  Allocate memory. Note that the block table should be as large as the
+	 *  hash table. (for later file additions)
+	 */
+	mpq_a->hashtable = (mpq_hash *)malloc(sizeof(mpq_hash) * mpq_a->header->hashtablesize);
+
+	if (!mpq_a->hashtable) {
+		return LIBMPQ_EALLOCMEM;
+	}
+
+	/* Read the hash table into the buffer */
+	bytes = mpq_a->header->hashtablesize * sizeof(mpq_hash);
+
+	#ifdef WIN32
+		_lseeki64(mpq_a->fd, mpq_a->header->hashtablepos, SEEK_SET);
+	#else
+		lseek64(mpq_a->fd, mpq_a->header->hashtablepos, SEEK_SET);
+	#endif
+
+	rb = _read(mpq_a->fd, mpq_a->hashtable, bytes);
+	if (rb != bytes) {
+		return LIBMPQ_EFILE_CORRUPT;
+	}
+
+	/* Decrypt hash table and check if it is correctly decrypted */
+	mpq_hash *mpq_h_end = mpq_a->hashtable + mpq_a->header->hashtablesize;
+	mpq_hash *mpq_h     = NULL;
+
+	libmpq_decrypt_hashtable(mpq_a, (unsigned char *)"(hash table)");
+
+	/* Check hash table if is correctly decrypted */
+	for (mpq_h = mpq_a->hashtable; mpq_h < mpq_h_end; mpq_h++) {
+		if (mpq_h->locale != 0xFFFFFFFF && (mpq_h->locale & 0xFFFF0000) != 0) {
+			return LIBMPQ_EFILE_FORMAT;
+		}
+
+		/* Remember the highest block table entry */
+		if (mpq_h->blockindex < LIBMPQ_HASH_ENTRY_DELETED && mpq_h->blockindex > 0) {
+			mpq_a->maxblockindex = mpq_h->blockindex;
+		}
+	}
+
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+/*
+ *  This functions fills the mpq_block structure with the
+ *  blocktable found in the MPQ file. The blocktable will
+ *  be decrypted for later use.
+ *
+ *  NOTICE: Some MPQs have decrypted block table, e.g.
+ *          cracked Diablo versions.
+ */
+int libmpq_read_blocktable(mpq_archive *mpq_a) {
+	unsigned int bytes = 0;
+	int rb = 0;
+
+	/*
+	 *  Allocate memory. Note that the block table should be as large as the
+	 *  hash table. (for later file additions)
+	 */
+	mpq_a->blocktable = (mpq_block *)malloc(sizeof(mpq_block) * mpq_a->header->hashtablesize);
+	mpq_a->blockbuf   = (unsigned char *)malloc(mpq_a->blocksize);
+
+	if (!mpq_a->blocktable || !mpq_a->blockbuf) {
+		return LIBMPQ_EALLOCMEM;
+	}
+
+	/* Read the block table into the buffer */
+	bytes = mpq_a->header->blocktablesize * sizeof(mpq_block);
+	memset(mpq_a->blocktable, 0, mpq_a->header->blocktablesize * sizeof(mpq_block));
+
+	#ifdef WIN32
+		_lseeki64(mpq_a->fd, mpq_a->header->blocktablepos, SEEK_SET);
+	#else
+		lseek64(mpq_a->fd, mpq_a->header->blocktablepos, SEEK_SET);
+	#endif	
+
+	rb = _read(mpq_a->fd, mpq_a->blocktable, bytes);
+	if (rb != bytes) {
+		return LIBMPQ_EFILE_CORRUPT;
+	}
+
+	/*
+	 *  Decrypt block table. Some MPQs don't have encrypted block table,
+	 *  e.g. cracked Diablo version. We have to check if block table is
+	 *  already decrypted
+	 */
+	mpq_block *mpq_b_end     = mpq_a->blocktable + mpq_a->maxblockindex + 1;
+	mpq_block *mpq_b         = NULL;
+	unsigned int archivesize = mpq_a->header->archivesize + mpq_a->mpqpos;
+
+	if (mpq_a->header->offset != mpq_a->blocktable->filepos) {
+		libmpq_decrypt_blocktable(mpq_a, (unsigned char *)"(block table)");
+	}
+	for (mpq_b = mpq_a->blocktable; mpq_b < mpq_b_end; mpq_b++) {
+		if (mpq_b->filepos > archivesize || mpq_b->csize > archivesize) {
+			if ((mpq_a->flags & LIBMPQ_FLAG_PROTECTED) == 0) {
+				return LIBMPQ_EFILE_FORMAT;
+			}
+		}
+		mpq_b->filepos += mpq_a->mpqpos;
+	}
+
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+int libmpq_file_read_block(mpq_archive *mpq_a, mpq_file *mpq_f, unsigned int blockpos, char *buffer, unsigned int blockbytes) {
+	unsigned char *tempbuf = NULL;			/* Buffer for reading compressed data from the file */
+	unsigned int readpos;				/* Reading position from the file */
+	unsigned int toread = 0;			/* Number of bytes to read */
+	unsigned int blocknum;				/* Block number (needed for decrypt) */
+	unsigned int bytesread = 0;			/* Total number of bytes read */
+	unsigned int nblocks;				/* Number of blocks to load */
+	unsigned int i;
+
+	/* Test parameters. Block position and block size must be block-aligned, block size nonzero */
+	if ((blockpos & (mpq_a->blocksize - 1)) || blockbytes == 0) {
+		return 0;
+	}
+
+	/* Check the end of file */
+	if ((blockpos + blockbytes) > mpq_f->mpq_b->fsize) {
+		blockbytes = mpq_f->mpq_b->fsize - blockpos;
+	}
+	blocknum = blockpos   / mpq_a->blocksize;
+	nblocks  = blockbytes / mpq_a->blocksize;
+	if (blockbytes % mpq_a->blocksize) {
+		nblocks++;
+	}
+
+	/* If file has variable block positions, we have to load them */
+	if ((mpq_f->mpq_b->flags & LIBMPQ_FILE_COMPRESSED) && mpq_f->blockposloaded == FALSE) {
+		unsigned int nread;
+
+		if (mpq_f->mpq_b->filepos != mpq_a->filepos) {
+		#ifdef WIN32
+			_lseeki64(mpq_a->fd, mpq_f->mpq_b->filepos, SEEK_SET);
+		#else
+			lseek64(mpq_a->fd, mpq_f->mpq_b->filepos, SEEK_SET);
+
+		#endif
+		}
+
+		/* Read block positions from begin of file. */
+		nread = (mpq_f->nblocks + 1) * sizeof(int);
+		nread = _read(mpq_a->fd, mpq_f->blockpos, nread);
+
+		/*
+		 *  If the archive is protected some way, perform additional check
+		 *  Sometimes, the file appears not to be encrypted, but it is.
+		 */
+		/*if (mpq_f->blockpos[0] != nread) {
+			mpq_f->mpq_b->flags |= LIBMPQ_FILE_ENCRYPTED;
+		}*/
+
+        if ((mpq_f->mpq_b->flags & LIBMPQ_FILE_HAS_METADATA) == 0) {
+            if (mpq_f->blockpos[0] != nread) {
+			    mpq_f->mpq_b->flags |= LIBMPQ_FILE_ENCRYPTED;
+		    }
+        }
+
+		/* Decrypt loaded block positions if necessary */
+		if (mpq_f->mpq_b->flags & LIBMPQ_FILE_ENCRYPTED) {
+
+			/* If we don't know the file seed, try to find it. */
+			if (mpq_f->seed == 0) {
+				mpq_f->seed = libmpq_detect_fileseed(mpq_a, mpq_f->blockpos, nread);
+			}
+
+			/* If we don't know the file seed, sorry but we cannot extract the file. */
+			if (mpq_f->seed == 0) {
+				return 0;
+			}
+
+			/* Decrypt block positions */
+			libmpq_decrypt_block(mpq_a, mpq_f->blockpos, nread, mpq_f->seed - 1);
+
+			/*
+			 *  Check if the block positions are correctly decrypted
+			 *  I don't know why, but sometimes it will result invalid
+			 *  block positions on some files.
+			 */
+			if (mpq_f->blockpos[0] != nread) {
+
+				/* Try once again to detect file seed and decrypt the blocks */
+
+				#ifdef WIN32
+					_lseeki64(mpq_a->fd, mpq_f->mpq_b->filepos, SEEK_SET);
+				#else
+					lseek64(mpq_a->fd, mpq_f->mpq_b->filepos, SEEK_SET);
+				#endif				
+
+				nread = _read(mpq_a->fd, mpq_f->blockpos, (mpq_f->nblocks + 1) * sizeof(int));
+				mpq_f->seed = libmpq_detect_fileseed(mpq_a, mpq_f->blockpos, nread);
+				libmpq_decrypt_block(mpq_a, mpq_f->blockpos, nread, mpq_f->seed - 1);
+
+				/* Check if the block positions are correctly decrypted. */
+				if (mpq_f->blockpos[0] != nread) {
+					return 0;
+				}
+			}
+		}
+
+		/* Update mpq_f's variables */
+		mpq_f->blockposloaded = TRUE;
+		mpq_a->filepos        = mpq_f->mpq_b->filepos + nread;
+	}
+
+	/* Get file position and number of bytes to read */
+	readpos = blockpos;
+	toread  = blockbytes;
+
+	if (mpq_f->mpq_b->flags & LIBMPQ_FILE_COMPRESSED) {
+		readpos = mpq_f->blockpos[blocknum];
+		toread  = mpq_f->blockpos[blocknum + nblocks] - readpos;
+	}
+
+	readpos += mpq_f->mpq_b->filepos;
+
+	/* Get work buffer for store read data */
+    if ((tempbuf = (unsigned char *)malloc(toread)) == NULL) {
+        /* Hmmm... We should add a better error handling here :) */
+        return 0;
+    }
+
+	/* Set file pointer, if necessary. */
+	if (mpq_a->filepos != readpos) {
+
+		#ifdef WIN32
+			mpq_a->filepos = _lseeki64(mpq_a->fd, readpos, SEEK_SET);
+		#else
+			mpq_a->filepos = lseek64(mpq_a->fd, readpos, SEEK_SET);
+		#endif	
+
+	}
+
+	/* 15018F87 - Read all requested blocks. */
+	bytesread = _read(mpq_a->fd, tempbuf, toread);
+	mpq_a->filepos = readpos + bytesread;
+
+	/* Block processing part. */
+	unsigned int blockstart = 0;			/* Index of block start in work buffer. */
+	unsigned int blocksize  = min(blockbytes, mpq_a->blocksize);
+	unsigned int index      = blocknum;		/* Current block index. */
+	bytesread = 0;					/* Clear read byte counter */
+
+	/* Walk through all blocks. */
+	for (i = 0; i < nblocks; i++, index++) {
+		int outlength = mpq_a->blocksize;
+
+		/* Get current block length */
+		if (mpq_f->mpq_b->flags & LIBMPQ_FILE_COMPRESSED) {
+			blocksize = mpq_f->blockpos[index + 1] - mpq_f->blockpos[index];
+		}
+
+		/* If block is encrypted, we have to decrypt it. */
+		if (mpq_f->mpq_b->flags & LIBMPQ_FILE_ENCRYPTED) {
+			if (mpq_f->seed == 0) {
+				return 0;
+			}
+			libmpq_decrypt_block(mpq_a, (unsigned int *)&tempbuf[blockstart], blocksize, mpq_f->seed + index);
+		}
+
+		/*
+		 *  If the block is really compressed, recompress it.
+		 *  WARNING: Some block may not be compressed, it can
+		 *  only be determined by comparing uncompressed and
+		 *  compressed size!
+		 */
+		if (blocksize < blockbytes) {
+
+			/* Is the file compressed with PKWARE Data Compression Library? */
+			if (mpq_f->mpq_b->flags & LIBMPQ_FILE_COMPRESS_PKWARE) {
+				libmpq_pkzip_decompress(buffer, &outlength, (char *)&tempbuf[blockstart], blocksize);
+			}
+
+			/*
+			 *  Is it a file compressed by Blizzard's multiple compression ?
+			 *  Note that Storm.dll v 1.0.9 distributed with Warcraft III
+			 *  passes the full path name of the opened archive as the new
+			 *  last parameter.
+			 */
+			if (mpq_f->mpq_b->flags & LIBMPQ_FILE_COMPRESS_MULTI) {
+				libmpq_multi_decompress(buffer, &outlength, (char *)&tempbuf[blockstart], blocksize);
+			}
+			bytesread += outlength;
+			buffer    += outlength;
+		} else {
+			memcpy(buffer, tempbuf, blocksize);
+			bytesread += blocksize;
+			buffer    += blocksize;
+		}
+		blockstart += blocksize;
+	}
+
+	/* Delete input buffer, if necessary. */
+    free(tempbuf);
+
+    return bytesread;
+}
+
+int libmpq_file_read_file(mpq_archive *mpq_a, mpq_file *mpq_f, unsigned int filepos, char *buffer, unsigned int toread) {
+	unsigned int bytesread = 0;			/* Number of bytes read from the file */
+	unsigned int blockpos;				/* Position in the file aligned to the whole blocks */
+	unsigned int loaded = 0;
+
+	/* File position is greater or equal to file size? */
+	if (filepos >= mpq_f->mpq_b->fsize) {
+		return 0;
+	}
+
+	/* If to few bytes in the file remaining, cut them */
+	if ((mpq_f->mpq_b->fsize - filepos) < toread) {
+		toread = (mpq_f->mpq_b->fsize - filepos);
+	}
+
+	/* Block position in the file */
+	blockpos = filepos & ~(mpq_a->blocksize - 1);
+
+	/*
+	 *  Load the first block, if noncomplete. It may be loaded in the cache buffer.
+	 *  We have to check if this block is loaded. If not, load it.
+	 */
+	if ((filepos % mpq_a->blocksize) != 0) {
+		/* Number of bytes remaining in the buffer */
+		unsigned int tocopy;
+		unsigned int loaded = mpq_a->blocksize;
+
+		/* Check if data are loaded in the cache */
+		if (mpq_f->accessed == FALSE || blockpos != mpq_a->blockpos) {   
+
+			/* Load one MPQ block into archive buffer */
+			loaded = libmpq_file_read_block(mpq_a, mpq_f, blockpos, (char *)mpq_a->blockbuf, mpq_a->blocksize);
+			if (loaded == 0) {
+				return 0;
+			}
+
+			/* Save lastly accessed file and block position for later use */
+			mpq_f->accessed = TRUE;
+			mpq_a->blockpos = blockpos;
+			mpq_a->bufpos   = filepos % mpq_a->blocksize;
+		}
+		tocopy = loaded - mpq_a->bufpos;
+		if (tocopy > toread) {
+			tocopy = toread;
+		}
+
+		/* Copy data from block buffer into target buffer */
+		memcpy(buffer, mpq_a->blockbuf + mpq_a->bufpos, tocopy);
+
+		/* Update pointers */
+		toread        -= tocopy;
+		bytesread     += tocopy;
+		buffer        += tocopy;
+		blockpos      += mpq_a->blocksize;
+		mpq_a->bufpos += tocopy;
+
+		/* If all, return. */
+		if (toread == 0) {
+			return bytesread;
+		}
+	}
+
+	/* Load the whole ("middle") blocks only if there are more or equal one block */
+	if (toread > mpq_a->blocksize) {
+		unsigned int blockbytes = toread & ~(mpq_a->blocksize - 1);
+		loaded = libmpq_file_read_block(mpq_a, mpq_f, blockpos, buffer, blockbytes);
+		if (loaded == 0) {
+			return 0;
+		}
+
+		/* Update pointers */
+		toread    -= loaded;
+		bytesread += loaded;
+		buffer    += loaded;
+		blockpos  += loaded;
+
+		/* If all, return. */
+		if (toread == 0) {
+			return bytesread;
+		}
+	}
+
+	/* Load the terminating block */
+	if (toread > 0) {
+		unsigned int tocopy = mpq_a->blocksize;
+
+		/* Check if data are loaded in the cache */
+		if (mpq_f->accessed == FALSE || blockpos != mpq_a->blockpos) {
+
+			/* Load one MPQ block into archive buffer */
+			tocopy = libmpq_file_read_block(mpq_a, mpq_f, blockpos, (char *)mpq_a->blockbuf, mpq_a->blocksize);
+			if (tocopy == 0) {
+				return 0;
+			}
+
+			/* Save lastly accessed file and block position for later use */
+			mpq_f->accessed = TRUE;
+			mpq_a->blockpos = blockpos;
+		}
+		mpq_a->bufpos  = 0;
+
+		/* Check number of bytes read */
+		if (tocopy > toread) {
+			tocopy = toread;
+		}
+
+		memcpy(buffer, mpq_a->blockbuf, tocopy);
+		bytesread     += tocopy;
+		mpq_a->bufpos  = tocopy;
+	}
+
+	/* Return what we've read */
+	return bytesread;
+}
diff --git a/contrib/extractor/libmpq/common.h b/contrib/extractor/libmpq/common.h
new file mode 100644
index 00000000000..ad2c0f101fa
--- /dev/null
+++ b/contrib/extractor/libmpq/common.h
@@ -0,0 +1,66 @@
+/*
+ *  common.h -- defines and structs used by the config files.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ *
+ *  $Id: common.h,v 1.4 2004/02/12 00:41:55 mbroemme Exp $
+ */
+
+#define LIBMPQ_CONF_FL_INCREMENT	512			/* i hope we did not need more :) */
+#define LIBMPQ_CONF_EXT			".conf"			/* listdb file seems to be valid with this extension */
+#define LIBMPQ_CONF_HEADER		"LIBMPQ_VERSION"	/* listdb file must include this entry to be valid */
+#define LIBMPQ_CONF_BUFSIZE		4096			/* maximum number of bytes a line in the file could contain */
+
+#define LIBMPQ_CONF_TYPE_CHAR		1			/* value in config file is from type char */
+#define LIBMPQ_CONF_TYPE_INT		2			/* value in config file is from type int */
+
+#define LIBMPQ_CONF_EOPEN_DIR		-1			/* error on open directory */
+#define LIBMPQ_CONF_EVALUE_NOT_FOUND	-2			/* value for the option was not found */
+
+#if defined( __GNUC__ )
+	#include <sys/types.h>
+	#include <unistd.h>
+
+	#define _lseek  lseek
+	#define _read   read
+	#define _open	open
+	#define _write	write
+	#define _close	close
+	#define _strdup	strdup
+
+	#ifndef O_BINARY
+		#define O_BINARY 0
+	#endif
+#else
+	#include <io.h>
+#endif
+
+#ifndef min
+	#define min(a, b) ((a < b) ? a : b)
+#endif
+
+int libmpq_init_buffer(mpq_archive *mpq_a);
+int libmpq_read_hashtable(mpq_archive *mpq_a);
+int libmpq_read_blocktable(mpq_archive *mpq_a);
+int libmpq_file_read_file(mpq_archive *mpq_a, mpq_file *mpq_f, unsigned int filepos, char *buffer, unsigned int toread);
+int libmpq_read_listfile(mpq_archive *mpq_a, FILE *fp);
+
+int libmpq_conf_get_value(FILE *fp, char *search_value, void *return_value, int type, int size);
+char *libmpq_conf_delete_char(char *buf, char *chars);
+int libmpq_conf_get_array(FILE *fp, char *search_value, char ***filelist, int *entries);
+int libmpq_free_listfile(char **filelist);
+int libmpq_read_listfile(mpq_archive *mpq_a, FILE *fp);
diff --git a/contrib/extractor/libmpq/explode.cpp b/contrib/extractor/libmpq/explode.cpp
new file mode 100644
index 00000000000..bcf9e7857a2
--- /dev/null
+++ b/contrib/extractor/libmpq/explode.cpp
@@ -0,0 +1,428 @@
+/*
+ *  explode.c -- explode function of PKWARE data compression library.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This source was adepted from the C++ version of pkware.cpp included
+ *  in stormlib. The C++ version belongs to the following authors,
+ *
+ *  Ladislav Zezula <ladik.zezula.net>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ */
+
+#include <assert.h>
+#include <string.h>
+
+#include "mpq.h"
+#include "explode.h"
+
+/* Tables */
+static unsigned char pkzip_dist_bits[] = {
+	0x02, 0x04, 0x04, 0x05, 0x05, 0x05, 0x05, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06,
+	0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+	0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+	0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08
+};
+
+static unsigned char pkzip_dist_code[] = {
+	0x03, 0x0D, 0x05, 0x19, 0x09, 0x11, 0x01, 0x3E, 0x1E, 0x2E, 0x0E, 0x36, 0x16, 0x26, 0x06, 0x3A,
+	0x1A, 0x2A, 0x0A, 0x32, 0x12, 0x22, 0x42, 0x02, 0x7C, 0x3C, 0x5C, 0x1C, 0x6C, 0x2C, 0x4C, 0x0C,
+	0x74, 0x34, 0x54, 0x14, 0x64, 0x24, 0x44, 0x04, 0x78, 0x38, 0x58, 0x18, 0x68, 0x28, 0x48, 0x08,
+	0xF0, 0x70, 0xB0, 0x30, 0xD0, 0x50, 0x90, 0x10, 0xE0, 0x60, 0xA0, 0x20, 0xC0, 0x40, 0x80, 0x00
+};
+
+static unsigned char pkzip_clen_bits[] = {
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08
+};
+
+static unsigned short pkzip_len_base[] = {
+	0x0000, 0x0001, 0x0002, 0x0003, 0x0004, 0x0005, 0x0006, 0x0007,
+	0x0008, 0x000A, 0x000E, 0x0016, 0x0026, 0x0046, 0x0086, 0x0106
+};
+
+static unsigned char pkzip_slen_bits[] = {
+	0x03, 0x02, 0x03, 0x03, 0x04, 0x04, 0x04, 0x05, 0x05, 0x05, 0x05, 0x06, 0x06, 0x06, 0x07, 0x07
+};
+
+static unsigned char pkzip_len_code[] = {
+	0x05, 0x03, 0x01, 0x06, 0x0A, 0x02, 0x0C, 0x14, 0x04, 0x18, 0x08, 0x30, 0x10, 0x20, 0x40, 0x00
+};
+
+static unsigned char pkzip_bits_asc[] = {
+	0x0B, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x08, 0x07, 0x0C, 0x0C, 0x07, 0x0C, 0x0C,
+	0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0D, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+	0x04, 0x0A, 0x08, 0x0C, 0x0A, 0x0C, 0x0A, 0x08, 0x07, 0x07, 0x08, 0x09, 0x07, 0x06, 0x07, 0x08,
+	0x07, 0x06, 0x07, 0x07, 0x07, 0x07, 0x08, 0x07, 0x07, 0x08, 0x08, 0x0C, 0x0B, 0x07, 0x09, 0x0B,
+	0x0C, 0x06, 0x07, 0x06, 0x06, 0x05, 0x07, 0x08, 0x08, 0x06, 0x0B, 0x09, 0x06, 0x07, 0x06, 0x06,
+	0x07, 0x0B, 0x06, 0x06, 0x06, 0x07, 0x09, 0x08, 0x09, 0x09, 0x0B, 0x08, 0x0B, 0x09, 0x0C, 0x08,
+	0x0C, 0x05, 0x06, 0x06, 0x06, 0x05, 0x06, 0x06, 0x06, 0x05, 0x0B, 0x07, 0x05, 0x06, 0x05, 0x05,
+	0x06, 0x0A, 0x05, 0x05, 0x05, 0x05, 0x08, 0x07, 0x08, 0x08, 0x0A, 0x0B, 0x0B, 0x0C, 0x0C, 0x0C,
+	0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D,
+	0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D,
+	0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D,
+	0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+	0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+	0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+	0x0D, 0x0C, 0x0D, 0x0D, 0x0D, 0x0C, 0x0D, 0x0D, 0x0D, 0x0C, 0x0D, 0x0D, 0x0D, 0x0D, 0x0C, 0x0D,
+	0x0D, 0x0D, 0x0C, 0x0C, 0x0C, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D
+};
+
+static unsigned short pkzip_code_asc[] = {
+	0x0490, 0x0FE0, 0x07E0, 0x0BE0, 0x03E0, 0x0DE0, 0x05E0, 0x09E0,
+	0x01E0, 0x00B8, 0x0062, 0x0EE0, 0x06E0, 0x0022, 0x0AE0, 0x02E0,
+	0x0CE0, 0x04E0, 0x08E0, 0x00E0, 0x0F60, 0x0760, 0x0B60, 0x0360,
+	0x0D60, 0x0560, 0x1240, 0x0960, 0x0160, 0x0E60, 0x0660, 0x0A60,
+	0x000F, 0x0250, 0x0038, 0x0260, 0x0050, 0x0C60, 0x0390, 0x00D8,
+	0x0042, 0x0002, 0x0058, 0x01B0, 0x007C, 0x0029, 0x003C, 0x0098,
+	0x005C, 0x0009, 0x001C, 0x006C, 0x002C, 0x004C, 0x0018, 0x000C,
+	0x0074, 0x00E8, 0x0068, 0x0460, 0x0090, 0x0034, 0x00B0, 0x0710,
+	0x0860, 0x0031, 0x0054, 0x0011, 0x0021, 0x0017, 0x0014, 0x00A8,
+	0x0028, 0x0001, 0x0310, 0x0130, 0x003E, 0x0064, 0x001E, 0x002E,
+	0x0024, 0x0510, 0x000E, 0x0036, 0x0016, 0x0044, 0x0030, 0x00C8,
+	0x01D0, 0x00D0, 0x0110, 0x0048, 0x0610, 0x0150, 0x0060, 0x0088,
+	0x0FA0, 0x0007, 0x0026, 0x0006, 0x003A, 0x001B, 0x001A, 0x002A,
+	0x000A, 0x000B, 0x0210, 0x0004, 0x0013, 0x0032, 0x0003, 0x001D,
+	0x0012, 0x0190, 0x000D, 0x0015, 0x0005, 0x0019, 0x0008, 0x0078,
+	0x00F0, 0x0070, 0x0290, 0x0410, 0x0010, 0x07A0, 0x0BA0, 0x03A0,
+	0x0240, 0x1C40, 0x0C40, 0x1440, 0x0440, 0x1840, 0x0840, 0x1040,
+	0x0040, 0x1F80, 0x0F80, 0x1780, 0x0780, 0x1B80, 0x0B80, 0x1380,
+	0x0380, 0x1D80, 0x0D80, 0x1580, 0x0580, 0x1980, 0x0980, 0x1180,
+	0x0180, 0x1E80, 0x0E80, 0x1680, 0x0680, 0x1A80, 0x0A80, 0x1280,
+	0x0280, 0x1C80, 0x0C80, 0x1480, 0x0480, 0x1880, 0x0880, 0x1080,
+	0x0080, 0x1F00, 0x0F00, 0x1700, 0x0700, 0x1B00, 0x0B00, 0x1300,
+	0x0DA0, 0x05A0, 0x09A0, 0x01A0, 0x0EA0, 0x06A0, 0x0AA0, 0x02A0,
+	0x0CA0, 0x04A0, 0x08A0, 0x00A0, 0x0F20, 0x0720, 0x0B20, 0x0320,
+	0x0D20, 0x0520, 0x0920, 0x0120, 0x0E20, 0x0620, 0x0A20, 0x0220,
+	0x0C20, 0x0420, 0x0820, 0x0020, 0x0FC0, 0x07C0, 0x0BC0, 0x03C0,
+	0x0DC0, 0x05C0, 0x09C0, 0x01C0, 0x0EC0, 0x06C0, 0x0AC0, 0x02C0,
+	0x0CC0, 0x04C0, 0x08C0, 0x00C0, 0x0F40, 0x0740, 0x0B40, 0x0340,
+	0x0300, 0x0D40, 0x1D00, 0x0D00, 0x1500, 0x0540, 0x0500, 0x1900,
+	0x0900, 0x0940, 0x1100, 0x0100, 0x1E00, 0x0E00, 0x0140, 0x1600,
+	0x0600, 0x1A00, 0x0E40, 0x0640, 0x0A40, 0x0A00, 0x1200, 0x0200,
+	0x1C00, 0x0C00, 0x1400, 0x0400, 0x1800, 0x0800, 0x1000, 0x0000  
+};
+
+/* Local variables */
+static char copyright[] = "PKWARE Data Compression Library for Win32\r\n"
+                          "Copyright 1989-1995 PKWARE Inc.  All Rights Reserved\r\n"
+                          "Patent No. 5,051,745\r\n"
+                          "PKWARE Data Compression Library Reg. U.S. Pat. and Tm. Off.\r\n"
+                          "Version 1.11\r\n";
+
+/* Local functions */
+static void libmpq_pkzip_gen_decode_tabs(long count, unsigned char *bits, unsigned char *code, unsigned char *buf2) {
+	long i;
+
+	for (i = count-1; i >= 0; i--) {		/* EBX - count */
+		unsigned long idx1 = code[i];
+		unsigned long idx2 = 1 << bits[i];
+		do {
+			buf2[idx1] = (unsigned char)i;
+			idx1      += idx2;
+		} while (idx1 < 0x100);
+	}
+}
+
+static void libmpq_pkzip_gen_asc_tabs(pkzip_data_cmp *mpq_pkzip) {
+	unsigned short *code_asc = &pkzip_code_asc[0xFF];
+	unsigned long acc, add;
+	unsigned short count;
+
+	for (count = 0x00FF; code_asc >= pkzip_code_asc; code_asc--, count--) {
+		unsigned char *bits_asc = mpq_pkzip->bits_asc + count;
+		unsigned char bits_tmp = *bits_asc;
+
+		if (bits_tmp <= 8) {
+			add = (1 << bits_tmp);
+			acc = *code_asc;
+			do {
+				mpq_pkzip->offs_2c34[acc] = (unsigned char)count;
+				acc += add;
+			} while (acc < 0x100);
+		} else {
+			if ((acc = (*code_asc & 0xFF)) != 0) {
+				mpq_pkzip->offs_2c34[acc] = 0xFF;
+				if (*code_asc & 0x3F) {
+					bits_tmp -= 4;
+					*bits_asc = bits_tmp;
+					add = (1 << bits_tmp);
+					acc = *code_asc >> 4;
+					do {
+						mpq_pkzip->offs_2d34[acc] = (unsigned char)count;
+						acc += add;
+					} while (acc < 0x100);
+				} else {
+					bits_tmp -= 6;
+					*bits_asc = bits_tmp;
+					add = (1 << bits_tmp);
+					acc = *code_asc >> 6;
+					do {
+						mpq_pkzip->offs_2e34[acc] = (unsigned char)count;
+						acc += add;
+					} while (acc < 0x80);
+				}
+			} else {
+				bits_tmp -= 8;
+				*bits_asc = bits_tmp;
+				add = (1 << bits_tmp);
+				acc = *code_asc >> 8;
+				do {
+					mpq_pkzip->offs_2eb4[acc] = (unsigned char)count;
+					acc += add;
+				} while (acc < 0x100);
+			}
+		}
+	}
+}
+
+/*
+ *  Skips given number of bits in bit buffer. Result is stored in mpq_pkzip->bit_buf
+ *  If no data in input buffer, returns true
+ */
+static int libmpq_pkzip_skip_bits(pkzip_data_cmp *mpq_pkzip, unsigned long bits) {
+	/* If number of bits required is less than number of (bits in the buffer) ? */
+	if (bits <= mpq_pkzip->extra_bits) {
+		mpq_pkzip->extra_bits -= bits;
+		mpq_pkzip->bit_buf >>= bits;
+		return 0;
+	}
+
+	/* Load input buffer if necessary */
+	mpq_pkzip->bit_buf >>= mpq_pkzip->extra_bits;
+	if (mpq_pkzip->in_pos == mpq_pkzip->in_bytes) {
+		mpq_pkzip->in_pos = sizeof(mpq_pkzip->in_buf);
+		if ((mpq_pkzip->in_bytes = mpq_pkzip->read_buf((char *)mpq_pkzip->in_buf, &mpq_pkzip->in_pos, mpq_pkzip->param)) == 0) {
+			return 1;
+		}
+		mpq_pkzip->in_pos = 0;
+	}
+
+	/* Update bit buffer */
+	mpq_pkzip->bit_buf |= (mpq_pkzip->in_buf[mpq_pkzip->in_pos++] << 8);
+	mpq_pkzip->bit_buf >>= (bits - mpq_pkzip->extra_bits);
+	mpq_pkzip->extra_bits = (mpq_pkzip->extra_bits - bits) + 8;
+	return 0;
+}
+
+/*
+ *  Decompress the imploded data using coded literals.
+ *  Returns: 0x000 - 0x0FF : One byte from compressed file.
+ *           0x100 - 0x305 : Copy previous block (0x100 = 1 byte)
+ *           0x306         : Out of buffer (?)
+ */
+static unsigned long libmpq_pkzip_explode_lit(pkzip_data_cmp *mpq_pkzip) {
+	unsigned long bits;				/* Number of bits to skip */
+	unsigned long value;				/* Position in buffers */
+
+	/* Test the current bit in byte buffer. If is not set, simply return the next byte. */
+	if (mpq_pkzip->bit_buf & 1) {
+
+		/* Skip current bit in the buffer. */
+		if (libmpq_pkzip_skip_bits(mpq_pkzip, 1)) {
+			return 0x306;
+		}
+
+		/* The next bits are position in buffers. */
+		value = mpq_pkzip->pos2[(mpq_pkzip->bit_buf & 0xFF)];
+
+		/* Get number of bits to skip */
+		if (libmpq_pkzip_skip_bits(mpq_pkzip, mpq_pkzip->slen_bits[value])) {
+			return 0x306;
+		}
+		if ((bits = mpq_pkzip->clen_bits[value]) != 0) {
+			unsigned long val2 = mpq_pkzip->bit_buf & ((1 << bits) - 1);
+			if (libmpq_pkzip_skip_bits(mpq_pkzip, bits)) {
+				if ((value + val2) != 0x10E) {
+					return 0x306;
+				}
+			}
+			value = mpq_pkzip->len_base[value] + val2;
+		}
+		return value + 0x100;			/* Return number of bytes to repeat */
+	}
+
+	/* Skip one bit */
+	if (libmpq_pkzip_skip_bits(mpq_pkzip, 1)) {
+		return 0x306;
+	}
+
+	/* If the binary compression type, read 8 bits and return them as one byte. */
+	if (mpq_pkzip->cmp_type == LIBMPQ_PKZIP_CMP_BINARY) {
+		value = mpq_pkzip->bit_buf & 0xFF;
+		if (libmpq_pkzip_skip_bits(mpq_pkzip, 8)) {
+			return 0x306;
+		}
+		return value;
+	}
+
+	/* When ASCII compression ... */
+	if (mpq_pkzip->bit_buf & 0xFF) {
+		value = mpq_pkzip->offs_2c34[mpq_pkzip->bit_buf & 0xFF];
+		if (value == 0xFF) {
+			if (mpq_pkzip->bit_buf & 0x3F) {
+				if (libmpq_pkzip_skip_bits(mpq_pkzip, 4)) {
+					return 0x306;
+				}
+				value = mpq_pkzip->offs_2d34[mpq_pkzip->bit_buf & 0xFF];
+			} else {
+				if (libmpq_pkzip_skip_bits(mpq_pkzip, 6)) {
+					return 0x306;
+				}
+				value = mpq_pkzip->offs_2e34[mpq_pkzip->bit_buf & 0x7F];
+			}
+		}
+	} else {
+		if (libmpq_pkzip_skip_bits(mpq_pkzip, 8)) {
+			return 0x306;
+		}
+		value = mpq_pkzip->offs_2eb4[mpq_pkzip->bit_buf & 0xFF];
+	}
+	return libmpq_pkzip_skip_bits(mpq_pkzip, mpq_pkzip->bits_asc[value]) ? 0x306 : value;
+}
+
+/*
+ *  Retrieves the number of bytes to move back.
+ */
+static unsigned long libmpq_pkzip_explode_dist(pkzip_data_cmp *mpq_pkzip, unsigned long length) {
+	unsigned long pos  = mpq_pkzip->pos1[(mpq_pkzip->bit_buf & 0xFF)];
+	unsigned long skip = mpq_pkzip->dist_bits[pos];	/* Number of bits to skip */
+
+	/* Skip the appropriate number of bits */
+	if (libmpq_pkzip_skip_bits(mpq_pkzip, skip) == 1) {
+		return 0;
+	}
+	if (length == 2) {
+		pos = (pos << 2) | (mpq_pkzip->bit_buf & 0x03);
+		if (libmpq_pkzip_skip_bits(mpq_pkzip, 2) == 1) {
+			return 0;
+		}
+	} else {
+		pos = (pos << mpq_pkzip->dsize_bits) | (mpq_pkzip->bit_buf & mpq_pkzip->dsize_mask);
+
+		/* Skip the bits */
+		if (libmpq_pkzip_skip_bits(mpq_pkzip, mpq_pkzip->dsize_bits) == 1) {
+			return 0;
+		}
+	}
+	return pos + 1;
+}
+
+static unsigned long libmpq_pkzip_expand(pkzip_data_cmp *mpq_pkzip) {
+	unsigned int copy_bytes;			/* Number of bytes to copy */
+	unsigned long one_byte;				/* One byte from compressed file */
+	unsigned long result;
+
+	mpq_pkzip->out_pos = 0x1000;			/* Initialize output buffer position */
+
+	/* If end of data or error, terminate decompress */
+	while ((result = one_byte = libmpq_pkzip_explode_lit(mpq_pkzip)) < 0x305) {
+
+		/* If one byte is greater than 0x100, means "Repeat n - 0xFE bytes" */
+		if (one_byte >= 0x100) {
+			unsigned char *source;		/* ECX */
+			unsigned char *target;		/* EDX */
+			unsigned long copy_length = one_byte - 0xFE;
+			unsigned long move_back;
+
+			/* Get length of data to copy */
+			if ((move_back = libmpq_pkzip_explode_dist(mpq_pkzip, copy_length)) == 0) {
+				result = 0x306;
+				break;
+			}
+
+			/* Target and source pointer */
+			target = &mpq_pkzip->out_buf[mpq_pkzip->out_pos];
+			source = target - move_back;
+			mpq_pkzip->out_pos += copy_length;
+			while (copy_length-- > 0) {
+				*target++ = *source++;
+			}
+		} else {
+			mpq_pkzip->out_buf[mpq_pkzip->out_pos++] = (unsigned char)one_byte;
+		}
+
+		/*
+		 * If number of extracted bytes has reached 1/2 of output buffer,
+		 * flush output buffer.
+		 */
+		if (mpq_pkzip->out_pos >= 0x2000) {
+
+			/* Copy decompressed data into user buffer. */
+			copy_bytes = 0x1000;
+			mpq_pkzip->write_buf((char *)&mpq_pkzip->out_buf[0x1000], &copy_bytes, mpq_pkzip->param);
+
+			/* If there are some data left, keep them alive */
+			memcpy(mpq_pkzip->out_buf, &mpq_pkzip->out_buf[0x1000], mpq_pkzip->out_pos - 0x1000);
+			mpq_pkzip->out_pos -= 0x1000;
+		}
+	}
+	copy_bytes = mpq_pkzip->out_pos - 0x1000;
+	mpq_pkzip->write_buf((char *)&mpq_pkzip->out_buf[0x1000], &copy_bytes, mpq_pkzip->param);
+	return result;
+}
+
+/*
+ * Main exploding function.
+ */
+unsigned int libmpq_pkzip_explode(
+	unsigned int	(*read_buf)(char *buf, unsigned  int *size, void *param),
+	void		(*write_buf)(char *buf, unsigned  int *size, void *param),
+	char		*work_buf,
+	void		*param) {
+
+	pkzip_data_cmp *mpq_pkzip = (pkzip_data_cmp *)work_buf;
+
+	/* Set the whole work buffer to zeros */
+	memset(mpq_pkzip, 0, sizeof(pkzip_data_cmp));
+
+	/* Initialize work struct and load compressed data */
+	mpq_pkzip->read_buf   = read_buf;
+	mpq_pkzip->write_buf  = write_buf;
+	mpq_pkzip->param      = param;
+	mpq_pkzip->in_pos     = sizeof(mpq_pkzip->in_buf);
+	mpq_pkzip->in_bytes   = mpq_pkzip->read_buf((char *)mpq_pkzip->in_buf, &mpq_pkzip->in_pos, mpq_pkzip->param);
+	if (mpq_pkzip->in_bytes <= 4) {
+		return LIBMPQ_PKZIP_CMP_BAD_DATA;
+	}
+	mpq_pkzip->cmp_type   = mpq_pkzip->in_buf[0];	/* Get the compression type */
+	mpq_pkzip->dsize_bits = mpq_pkzip->in_buf[1];	/* Get the dictionary size */
+	mpq_pkzip->bit_buf    = mpq_pkzip->in_buf[2];	/* Initialize 16-bit bit buffer */
+	mpq_pkzip->extra_bits = 0;			/* Extra (over 8) bits */
+	mpq_pkzip->in_pos     = 3;			/* Position in input buffer */
+
+	/* Test for the valid dictionary size */
+	if (4 > mpq_pkzip->dsize_bits || mpq_pkzip->dsize_bits > 6) {
+		return LIBMPQ_PKZIP_CMP_INV_DICTSIZE;
+	}
+	mpq_pkzip->dsize_mask = 0xFFFF >> (0x10 - mpq_pkzip->dsize_bits);	/* Shifted by 'sar' instruction */
+	if (mpq_pkzip->cmp_type != LIBMPQ_PKZIP_CMP_BINARY) {
+		if (mpq_pkzip->cmp_type != LIBMPQ_PKZIP_CMP_ASCII) {
+			return LIBMPQ_PKZIP_CMP_INV_MODE;
+		}
+		memcpy(mpq_pkzip->bits_asc, pkzip_bits_asc, sizeof(mpq_pkzip->bits_asc));
+		libmpq_pkzip_gen_asc_tabs(mpq_pkzip);
+	}
+	memcpy(mpq_pkzip->slen_bits, pkzip_slen_bits, sizeof(mpq_pkzip->slen_bits));
+	libmpq_pkzip_gen_decode_tabs(0x10, mpq_pkzip->slen_bits, pkzip_len_code, mpq_pkzip->pos2);
+	memcpy(mpq_pkzip->clen_bits, pkzip_clen_bits, sizeof(mpq_pkzip->clen_bits));
+	memcpy(mpq_pkzip->len_base, pkzip_len_base, sizeof(mpq_pkzip->len_base));
+	memcpy(mpq_pkzip->dist_bits, pkzip_dist_bits, sizeof(mpq_pkzip->dist_bits));
+	libmpq_pkzip_gen_decode_tabs(0x40, mpq_pkzip->dist_bits, pkzip_dist_code, mpq_pkzip->pos1);
+	if (libmpq_pkzip_expand(mpq_pkzip) != 0x306) {
+		return LIBMPQ_PKZIP_CMP_NO_ERROR;
+	}
+	return LIBMPQ_PKZIP_CMP_ABORT;
+}
diff --git a/contrib/extractor/libmpq/explode.h b/contrib/extractor/libmpq/explode.h
new file mode 100644
index 00000000000..1f916f778ae
--- /dev/null
+++ b/contrib/extractor/libmpq/explode.h
@@ -0,0 +1,86 @@
+/*
+ *  explode.h -- header file for PKWARE data decompression library
+ *               used by mpq-tools.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This source was adepted from the C++ version of pklib.h included
+ *  in stormlib. The C++ version belongs to the following authors,
+ *
+ *  Ladislav Zezula <ladik.zezula.net>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ */
+
+#ifndef _EXPLODE_H
+#define _EXPLODE_H
+
+#define LIBMPQ_PKZIP_EXP_BUFFER_SIZE	12596		/* Size of decompress buffer */
+#define LIBMPQ_PKZIP_CMP_BINARY		0		/* Binary compression */
+#define LIBMPQ_PKZIP_CMP_ASCII		1		/* Ascii compression */
+#define LIBMPQ_PKZIP_CMP_NO_ERROR	0
+#define LIBMPQ_PKZIP_CMP_INV_DICTSIZE	1
+#define LIBMPQ_PKZIP_CMP_INV_MODE	2
+#define LIBMPQ_PKZIP_CMP_BAD_DATA	3
+#define LIBMPQ_PKZIP_CMP_ABORT		4
+
+/* Compression structure (size: 12596 bytes on x86-32) */
+typedef struct {
+	unsigned long	offs0000;		/* 0000 */
+	unsigned long	cmp_type;		/* 0004 - Compression type (LIBMPQ_PZIP_CMP_BINARY or LIBMPQ_PKZIP_CMP_ASCII) */
+	unsigned long	out_pos;		/* 0008 - Position in output buffer */
+	unsigned long	dsize_bits;		/* 000C - Dict size (4, 5, 6 for 0x400, 0x800, 0x1000) */
+	unsigned long	dsize_mask;		/* 0010 - Dict size bitmask (0x0F, 0x1F, 0x3F for 0x400, 0x800, 0x1000) */
+	unsigned long	bit_buf;		/* 0014 - 16-bit buffer for processing input data */
+	unsigned long	extra_bits;		/* 0018 - Number of extra (above 8) bits in bit buffer */
+	unsigned int	in_pos;			/* 001C - Position in in_buf */
+	unsigned long	in_bytes;		/* 0020 - Number of bytes in input buffer */
+	void		*param;			/* 0024 - Custom parameter */
+	unsigned int	(*read_buf)(char *buf, unsigned  int *size, void *param);	/* 0028 */
+	void		(*write_buf)(char *buf, unsigned  int *size, void *param);	/* 002C */
+	unsigned char	out_buf[0x2000];	/* 0030 - Output circle buffer. Starting position is 0x1000 */
+	unsigned char	offs_2030[0x204];	/* 2030 - ??? */
+	unsigned char	in_buf[0x800];		/* 2234 - Buffer for data to be decompressed */
+	unsigned char	pos1[0x100];		/* 2A34 - Positions in buffers */
+	unsigned char	pos2[0x100];		/* 2B34 - Positions in buffers */
+	unsigned char	offs_2c34[0x100];	/* 2C34 - Buffer for */
+	unsigned char	offs_2d34[0x100];	/* 2D34 - Buffer for */
+	unsigned char	offs_2e34[0x80];	/* 2EB4 - Buffer for */
+	unsigned char	offs_2eb4[0x100];	/* 2EB4 - Buffer for */
+	unsigned char	bits_asc[0x100];	/* 2FB4 - Buffer for */
+	unsigned char	dist_bits[0x40];	/* 30B4 - Numbers of bytes to skip copied block length */
+	unsigned char	slen_bits[0x10];	/* 30F4 - Numbers of bits for skip copied block length */
+	unsigned char	clen_bits[0x10];	/* 3104 - Number of valid bits for copied block */
+	unsigned short	len_base[0x10];		/* 3114 - Buffer for */
+} pkzip_data_cmp;
+// __attribute__ ((packed)) pkzip_data_cmp;
+
+typedef struct {
+	char		*in_buf;	/* Pointer to input data buffer */
+	unsigned int	in_pos;		/* Current offset in input data buffer */
+	int		in_bytes;	/* Number of bytes in the input buffer */
+	char		*out_buf;	/* Pointer to output data buffer */
+	unsigned int	out_pos;	/* Position in the output buffer */
+	int		max_out;	/* Maximum number of bytes in the output buffer */
+} pkzip_data;
+
+extern unsigned int libmpq_pkzip_explode(
+	unsigned int	(*read_buf)(char *buf, unsigned int *size, void *param),
+	void		(*write_buf)(char *buf, unsigned int *size, void *param),
+	char		*work_buf,
+	void		*param
+);
+
+#endif					/* _EXPLODE_H */
diff --git a/contrib/extractor/libmpq/extract.cpp b/contrib/extractor/libmpq/extract.cpp
new file mode 100644
index 00000000000..41472b3c426
--- /dev/null
+++ b/contrib/extractor/libmpq/extract.cpp
@@ -0,0 +1,262 @@
+/*
+ *  extract.c -- global extracting function for all known file compressions
+ *               in a MPQ archive.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ */
+
+#ifdef HAVE_CONFIG_H
+#include "config.h"
+#endif
+
+#include <stdlib.h>
+#include <string.h>
+#include <stdio.h>
+
+#define HAVE_LIBZ
+#ifdef HAVE_LIBZ
+#include <zlib.h>
+#endif
+
+#include "mpq.h"
+#include "explode.h"
+#include "huffman.h"
+
+#include "wave.h"
+
+/*
+ *  Support functions for PKWARE data compression library.
+ *
+ *  Function loads data from the input buffer. Used by mpq_pkzip
+ *  "implode" and "explode" function as user-defined callback.
+ *  Returns number of bytes loaded.
+ *
+ *  char * buf          - Pointer to a buffer where to store loaded data
+ *  unsigned int * size - Max. number of bytes to read
+ *  void * param        - Custom pointer, parameter of implode/explode
+ */
+static unsigned int libmpq_pkzip_read_input_data(char *buf, unsigned int *size, void *param) {
+	pkzip_data *info = (pkzip_data *)param;
+	unsigned int max_avail = (info->in_bytes - info->in_pos);
+	unsigned int to_read = *size;
+
+	/* Check the case when not enough data available */
+	if (to_read > max_avail) {
+		to_read = max_avail;
+	}
+
+	/* Load data and increment offsets */
+	memcpy(buf, info->in_buf + info->in_pos, to_read);
+	info->in_pos += to_read;
+
+	return to_read;
+}
+
+/*
+ *  Support functions for PKWARE data compression library.
+ *
+ *  Function for store output data. Used by mpq_pkzip "implode" and
+ *  "explode" as user-defined callback.
+ *
+ *  char * buf          - Pointer to data to be written
+ *  unsigned int * size - Number of bytes to write
+ *  void * param        - Custom pointer, parameter of implode/explode
+ */
+static void libmpq_pkzip_write_output_data(char *buf, unsigned int *size, void *param) {
+	pkzip_data *info = (pkzip_data *)param;
+	unsigned int max_write = (info->max_out - info->out_pos);
+	unsigned int to_write = *size;
+
+	/* Check the case when not enough space in the output buffer */
+	if (to_write > max_write) {
+		to_write = max_write;
+	}
+
+	/* Write output data and increments offsets */
+	memcpy(info->out_buf + info->out_pos, buf, to_write);
+	info->out_pos += to_write;
+}
+
+int libmpq_pkzip_decompress(char *out_buf, int *out_length, char *in_buf, int in_length) {
+	pkzip_data info;					/* Data information */
+	char *work_buf = (char *)malloc(LIBMPQ_PKZIP_EXP_BUFFER_SIZE);	/* mpq_pkzip work buffer */
+
+	/* Fill data information structure */
+	info.in_buf   = in_buf;
+	info.in_pos   = 0;
+	info.in_bytes = in_length;
+	info.out_buf  = out_buf;
+	info.out_pos  = 0;
+	info.max_out  = *out_length;
+
+	/* Do the decompression */
+	libmpq_pkzip_explode(libmpq_pkzip_read_input_data, libmpq_pkzip_write_output_data, work_buf, &info);
+	*out_length = info.out_pos;
+	free(work_buf);
+	return 0;
+}
+
+int libmpq_wave_decompress_mono(char *out_buf, int *out_length, char *in_buf, int in_length) {
+	*out_length = libmpq_wave_decompress((unsigned char *)out_buf, *out_length, (unsigned char *)in_buf, in_length, 1);
+	return 1;
+}
+
+int libmpq_wave_decompress_stereo(char *out_buf, int *out_length, char *in_buf, int in_length) {
+	*out_length = libmpq_wave_decompress((unsigned char *)out_buf, *out_length, (unsigned char *)in_buf, in_length, 2);
+	return 1;
+}
+
+int libmpq_zlib_decompress(char *out_buf, int *out_length, char *in_buf, int in_length) {
+#ifdef HAVE_LIBZ
+	z_stream z;					/* Stream information for zlib */
+	int result;
+
+	/* Fill the stream structure for zlib */
+	z.next_in   = (Bytef *)in_buf;
+	z.avail_in  = (uInt)in_length;
+	z.total_in  = in_length;
+	z.next_out  = (Bytef *)out_buf;
+	z.avail_out = *out_length;
+	z.total_out = 0;
+	z.zalloc    = NULL;
+	z.zfree     = NULL;
+
+	/* Initialize the decompression structure. Storm.dll uses zlib version 1.1.3 */
+	if ((result = inflateInit(&z)) == 0) {
+
+		/* Call zlib to decompress the data */
+		result = inflate(&z, Z_FINISH);
+		*out_length = z.total_out;
+		inflateEnd(&z);
+	}
+	return result;
+#else
+	memset(out_buf, '0', *out_length);
+	return 0;
+#endif
+}
+
+/*
+ *  Huffmann decompression routine. The in_length parameter is not used, but needs
+ *  to be specified due to compatibility reasons.
+ *
+ *  1500F5F0
+ */
+int libmpq_huff_decompress(char *out_buf, int *out_length, char *in_buf, int in_length) {
+	struct huffman_tree		*ht = (huffman_tree *)malloc(sizeof(struct huffman_tree));
+	struct huffman_input_stream	*is = (huffman_input_stream *)malloc(sizeof(struct huffman_input_stream));
+	struct huffman_tree_item	*hi = (huffman_tree_item *)malloc(sizeof(struct huffman_tree_item));
+	memset(ht, 0, sizeof(struct huffman_tree));
+	memset(is, 0, sizeof(struct huffman_input_stream));
+	memset(hi, 0, sizeof(struct huffman_tree_item));
+
+	/* Initialize input stream */
+	is->bit_buf  = *(unsigned long *)in_buf;
+	in_buf      += sizeof(unsigned long);
+	is->in_buf   = (unsigned char *)in_buf;
+	is->bits     = 32;
+
+	/* Initialize the Huffmann tree for decompression */
+	libmpq_huff_init_tree(ht, hi, LIBMPQ_HUFF_DECOMPRESS);
+
+	*out_length = libmpq_huff_do_decompress(ht, is, (unsigned char *)out_buf, *out_length);
+
+	free(hi);
+	free(is);
+	free(ht);
+	return 0;
+}
+
+int libmpq_multi_decompress(char *out_buf, int *pout_length, char *in_buf, int in_length) {
+	char		*temp_buf = NULL;		/* Temporary storage for decompressed data */
+	char		*work_buf = NULL;		/* Where to store decompressed data */
+	int		out_length = *pout_length;	/* For storage number of output bytes */
+	unsigned	fDecompressions1;		/* Decompressions applied to the block */
+	unsigned	fDecompressions2;		/* Just another copy of decompressions applied to the block */
+	int		count = 0;			/* Counter for every use */
+	int		entries = (sizeof(dcmp_table) / sizeof(decompress_table));
+	int		i;
+
+	/* If the input length is the same as output, do nothing. */
+	if (in_length == out_length) {
+		if (in_buf == out_buf) {
+			return 1;
+		}
+		memcpy(out_buf, in_buf, in_length);
+		return 1;
+	}
+
+	/* Get applied compression types and decrement data length */
+	fDecompressions1 = fDecompressions2 = (unsigned char)*in_buf++;
+	in_length--;
+
+	/* Search decompression table type and get all types of compression */
+	for (i = 0; i < entries; i++) {
+		/* We have to apply this decompression? */
+		if (fDecompressions1 & dcmp_table[i].mask) {
+			count++;
+		}
+
+		/* Clear this flag from temporary variable. */
+		fDecompressions2 &= ~dcmp_table[i].mask;
+	}
+
+	/*
+	 *  Check if there is some method unhandled
+	 *  (E.g. compressed by future versions)
+	 */
+	if (fDecompressions2 != 0) {
+		printf("Unknown Compression\n");
+		return 0;
+	}
+
+	/* If there is more than only one compression, we have to allocate extra buffer */
+	if (count >= 2) {
+		temp_buf = (char *)malloc(out_length);
+	}
+
+	/* Apply all decompressions */
+	for (i = 0, count = 0; i < entries; i++) {
+
+		/* If not used this kind of compression, skip the loop */
+		if (fDecompressions1 & dcmp_table[i].mask) {
+
+			/* If odd case, use target buffer for output, otherwise use allocated tempbuf */
+			work_buf = (count++ & 1) ? temp_buf : out_buf;
+			out_length = *pout_length;
+
+			/* Decompress buffer using corresponding function */
+			dcmp_table[i].decompress(work_buf, &out_length, in_buf, in_length);
+
+			/* Move output length to src length for next compression */
+			in_length = out_length;
+			in_buf = work_buf;
+		}
+	}
+
+	/* If output buffer is not the same like target buffer, we have to copy data */
+	if (work_buf != out_buf) {
+		memcpy(out_buf, in_buf, out_length);
+	}
+	*pout_length = out_length;
+
+	/* Delete temporary buffer, if necessary */
+	if (temp_buf != NULL) {
+		free(temp_buf);
+	}
+	return 1;
+}
diff --git a/contrib/extractor/libmpq/huffman.cpp b/contrib/extractor/libmpq/huffman.cpp
new file mode 100644
index 00000000000..b63eee43e42
--- /dev/null
+++ b/contrib/extractor/libmpq/huffman.cpp
@@ -0,0 +1,833 @@
+/*
+ *  huffman.c -- functions do decompress files in MPQ files which
+ *               uses a modified huffman version.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  Differences between C++ and C version:
+ *
+ *    - Removed the object oriented stuff.
+ *    - Replaced the goto things with some better C code.
+ *
+ *  This source was adepted from the C++ version of huffman.cpp included
+ *  in stormlib. The C++ version belongs to the following authors,
+ *
+ *  Ladislav Zezula <ladik.zezula.net>
+ *  ShadowFlare <BlakFlare@hotmail.com>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ */
+#include <stdlib.h>
+#include <string.h>
+
+#include "mpq.h"
+#include "huffman.h"
+
+unsigned char table1502A630[] = {
+
+	/* Data for compression type 0x00 */
+	0x0A, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02,
+	0x00, 0x00,
+
+	/* Data for compression type 0x01 */
+	0x54, 0x16, 0x16, 0x0D, 0x0C, 0x08, 0x06, 0x05, 0x06, 0x05, 0x06, 0x03, 0x04, 0x04, 0x03, 0x05,
+	0x0E, 0x0B, 0x14, 0x13, 0x13, 0x09, 0x0B, 0x06, 0x05, 0x04, 0x03, 0x02, 0x03, 0x02, 0x02, 0x02,
+	0x0D, 0x07, 0x09, 0x06, 0x06, 0x04, 0x03, 0x02, 0x04, 0x03, 0x03, 0x03, 0x03, 0x03, 0x02, 0x02,
+	0x09, 0x06, 0x04, 0x04, 0x04, 0x04, 0x03, 0x02, 0x03, 0x02, 0x02, 0x02, 0x02, 0x03, 0x02, 0x04,
+	0x08, 0x03, 0x04, 0x07, 0x09, 0x05, 0x03, 0x03, 0x03, 0x03, 0x02, 0x02, 0x02, 0x03, 0x02, 0x02,
+	0x03, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x01, 0x01, 0x01, 0x02, 0x01, 0x02, 0x02,
+	0x06, 0x0A, 0x08, 0x08, 0x06, 0x07, 0x04, 0x03, 0x04, 0x04, 0x02, 0x02, 0x04, 0x02, 0x03, 0x03,
+	0x04, 0x03, 0x07, 0x07, 0x09, 0x06, 0x04, 0x03, 0x03, 0x02, 0x01, 0x02, 0x02, 0x02, 0x02, 0x02,
+	0x0A, 0x02, 0x02, 0x03, 0x02, 0x02, 0x01, 0x01, 0x02, 0x02, 0x02, 0x06, 0x03, 0x05, 0x02, 0x03,
+	0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x01, 0x01,
+	0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x04, 0x04, 0x04, 0x07, 0x09, 0x08, 0x0C, 0x02,
+	0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x03,
+	0x04, 0x01, 0x02, 0x04, 0x05, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01,
+	0x04, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+	0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+	0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x02, 0x01, 0x01, 0x02, 0x02, 0x02, 0x06, 0x4B,
+	0x00, 0x00,
+
+	/* Data for compression type 0x02 */
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x03, 0x27, 0x00, 0x00, 0x23, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0xFF, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x02, 0x01, 0x01, 0x06, 0x0E, 0x10, 0x04,
+	0x06, 0x08, 0x05, 0x04, 0x04, 0x03, 0x03, 0x02, 0x02, 0x03, 0x03, 0x01, 0x01, 0x02, 0x01, 0x01,
+	0x01, 0x04, 0x02, 0x04, 0x02, 0x02, 0x02, 0x01, 0x01, 0x04, 0x01, 0x01, 0x02, 0x03, 0x03, 0x02,
+	0x03, 0x01, 0x03, 0x06, 0x04, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x02, 0x01, 0x01,
+	0x01, 0x29, 0x07, 0x16, 0x12, 0x40, 0x0A, 0x0A, 0x11, 0x25, 0x01, 0x03, 0x17, 0x10, 0x26, 0x2A,
+	0x10, 0x01, 0x23, 0x23, 0x2F, 0x10, 0x06, 0x07, 0x02, 0x09, 0x01, 0x01, 0x01, 0x01, 0x01, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00,
+
+	/* Data for compression type 0x03 */
+	0xFF, 0x0B, 0x07, 0x05, 0x0B, 0x02, 0x02, 0x02, 0x06, 0x02, 0x02, 0x01, 0x04, 0x02, 0x01, 0x03,
+	0x09, 0x01, 0x01, 0x01, 0x03, 0x04, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01,
+	0x05, 0x01, 0x01, 0x01, 0x0D, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+	0x02, 0x01, 0x01, 0x03, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01,
+	0x0A, 0x04, 0x02, 0x01, 0x06, 0x03, 0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x01,
+	0x05, 0x02, 0x03, 0x04, 0x03, 0x03, 0x03, 0x02, 0x01, 0x01, 0x01, 0x02, 0x01, 0x02, 0x03, 0x03,
+	0x01, 0x03, 0x01, 0x01, 0x02, 0x05, 0x01, 0x01, 0x04, 0x03, 0x05, 0x01, 0x03, 0x01, 0x03, 0x03,
+	0x02, 0x01, 0x04, 0x03, 0x0A, 0x06, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+	0x02, 0x02, 0x01, 0x0A, 0x02, 0x05, 0x01, 0x01, 0x02, 0x07, 0x02, 0x17, 0x01, 0x05, 0x01, 0x01,
+	0x0E, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+	0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+	0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+	0x06, 0x02, 0x01, 0x04, 0x05, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01,
+	0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+	0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x07, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01,
+	0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x11,
+	0x00, 0x00,
+
+	/* Data for compression type 0x04 */
+	0xFF, 0xFB, 0x98, 0x9A, 0x84, 0x85, 0x63, 0x64, 0x3E, 0x3E, 0x22, 0x22, 0x13, 0x13, 0x18, 0x17,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00,
+
+	/* Data for compression type 0x05 */
+	0xFF, 0xF1, 0x9D, 0x9E, 0x9A, 0x9B, 0x9A, 0x97, 0x93, 0x93, 0x8C, 0x8E, 0x86, 0x88, 0x80, 0x82,
+	0x7C, 0x7C, 0x72, 0x73, 0x69, 0x6B, 0x5F, 0x60, 0x55, 0x56, 0x4A, 0x4B, 0x40, 0x41, 0x37, 0x37,
+	0x2F, 0x2F, 0x27, 0x27, 0x21, 0x21, 0x1B, 0x1C, 0x17, 0x17, 0x13, 0x13, 0x10, 0x10, 0x0D, 0x0D,
+	0x0B, 0x0B, 0x09, 0x09, 0x08, 0x08, 0x07, 0x07, 0x06, 0x05, 0x05, 0x04, 0x04, 0x04, 0x19, 0x18,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00,
+
+	/* Data for compression type 0x06 */
+	0xC3, 0xCB, 0xF5, 0x41, 0xFF, 0x7B, 0xF7, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0xBF, 0xCC, 0xF2, 0x40, 0xFD, 0x7C, 0xF7, 0x22, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x7A, 0x46, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00,
+
+	/* Data for compression type 0x07 */
+	0xC3, 0xD9, 0xEF, 0x3D, 0xF9, 0x7C, 0xE9, 0x1E, 0xFD, 0xAB, 0xF1, 0x2C, 0xFC, 0x5B, 0xFE, 0x17,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0xBD, 0xD9, 0xEC, 0x3D, 0xF5, 0x7D, 0xE8, 0x1D, 0xFB, 0xAE, 0xF0, 0x2C, 0xFB, 0x5C, 0xFF, 0x18,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x70, 0x6C, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00,
+
+	/* Data for compression type 0x08 */
+	0xBA, 0xC5, 0xDA, 0x33, 0xE3, 0x6D, 0xD8, 0x18, 0xE5, 0x94, 0xDA, 0x23, 0xDF, 0x4A, 0xD1, 0x10,
+	0xEE, 0xAF, 0xE4, 0x2C, 0xEA, 0x5A, 0xDE, 0x15, 0xF4, 0x87, 0xE9, 0x21, 0xF6, 0x43, 0xFC, 0x12,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0xB0, 0xC7, 0xD8, 0x33, 0xE3, 0x6B, 0xD6, 0x18, 0xE7, 0x95, 0xD8, 0x23, 0xDB, 0x49, 0xD0, 0x11,
+	0xE9, 0xB2, 0xE2, 0x2B, 0xE8, 0x5C, 0xDD, 0x15, 0xF1, 0x87, 0xE7, 0x20, 0xF7, 0x44, 0xFF, 0x13,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x5F, 0x9E, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+	0x00, 0x00
+};
+
+/* Gets previous Huffman tree item (?) */
+struct huffman_tree_item *libmpq_huff_get_prev_item(struct huffman_tree_item *hi, long value) {
+	if (PTR_INT(hi->prev) < 0) {
+		return PTR_NOT(hi->prev);
+	}
+	if (value < 0) {
+		value = hi - hi->next->prev;
+	}
+	return hi->prev + value;
+}
+
+/* 1500BC90 */
+static void libmpq_huff_remove_item(struct huffman_tree_item *hi) {
+	struct huffman_tree_item *temp;			/* EDX */
+
+	if (hi->next != NULL) {
+		temp = hi->prev;
+		if (PTR_INT(temp) <= 0) {
+			temp = PTR_NOT(temp);
+		} else {
+			temp += (hi - hi->next->prev);
+		}
+		temp->next          = hi->next;
+		hi->next->prev      = hi->prev;
+		hi->next = hi->prev = NULL;
+	}
+}
+
+static void libmpq_huff_insert_item(struct huffman_tree_item **p_item, struct huffman_tree_item *item, unsigned long where, struct huffman_tree_item *item2) {
+	struct huffman_tree_item *next = item->next;	/* EDI - next to the first item */
+	struct huffman_tree_item *prev = item->prev;	/* ESI - prev to the first item */
+	struct huffman_tree_item *prev2;		/* Pointer to previous item */
+	long next2;					/* Pointer to the next item */
+
+	/* The same code like in mpq_huff_remove_item(); */
+	if (next != 0) {				/* If the first item already has next one */
+		if (PTR_INT(prev) < 0) {
+			prev = PTR_NOT(prev);
+		} else {
+			prev += (item - next->prev);
+		}
+
+		/*
+		 * 150083C1
+		 * Remove the item from the tree
+		 */
+		prev->next = next;
+		next->prev = prev;
+
+		/* Invalidate 'prev' and 'next' pointer */
+		item->next = 0;
+		item->prev = 0;
+	}
+
+	if (item2 == NULL) {				/* EDX - If the second item is not entered, */
+		item2 = PTR_PTR(&p_item[1]);		/* take the first tree item */
+	}
+
+	switch (where) {
+		case SWITCH_ITEMS:			/* Switch the two items */
+			item->next  = item2->next;	/* item2->next (Pointer to pointer to first) */
+			item->prev  = item2->next->prev;
+			item2->next->prev = item;
+			item2->next = item;		/* Set the first item */
+			return;
+		case INSERT_ITEM:			/* Insert as the last item */
+			item->next = item2;		/* Set next item (or pointer to pointer to first item) */
+			item->prev = item2->prev;	/* Set prev item (or last item in the tree) */
+			next2 = PTR_INT(p_item[0]);	/* Usually NULL */
+			prev2 = item2->prev;		/* Prev item to the second (or last tree item) */
+			if (PTR_INT(prev2) < 0) {
+				prev2 = PTR_NOT(prev);
+				prev2->next = item;
+				item2->prev = item;	/* Next after last item */
+				return;
+			}
+			if (next2 < 0) {
+				next2 = item2 - item2->next->prev;
+			}
+			prev2 += next2;
+			prev2->next = item;
+			item2->prev = item;		/* Set the next/last item */
+			return;
+		default:
+			return;
+	}
+}
+
+/* Builds Huffman tree. Called with the first 8 bits loaded from input stream. */
+static void libmpq_huff_build_tree(struct huffman_tree *ht, unsigned int cmp_type) {
+	unsigned long max_byte;				/* [ESP+10] - The greatest character found in table */
+	unsigned char *byte_array;			/* [ESP+1C] - Pointer to unsigned char in table1502A630 */
+	unsigned long i;				/* egcs in linux doesn't like multiple for loops without an explicit i */
+	unsigned int found;				/* Thats needed to replace the goto stuff from original source :) */
+	struct huffman_tree_item **p_item;		/* [ESP+14] - Pointer to Huffman tree item pointer array */
+	struct huffman_tree_item *child1;
+
+	/* Loop while pointer has a negative value. */
+	while (PTR_INT(ht->last) > 0) {			/* ESI - Last entry */
+		struct huffman_tree_item *temp;		/* EAX */
+        
+		if (ht->last->next != NULL) {		/* ESI->next */
+			libmpq_huff_remove_item(ht->last);
+		}
+		ht->item3058   = PTR_PTR(&ht->item3054);/* [EDI+4] */
+		ht->last->prev = ht->item3058;		/* EAX */
+		temp           = libmpq_huff_get_prev_item(PTR_PTR(&ht->item3054), PTR_INT(&ht->item3050));
+		temp->next     = ht->last;
+		ht->item3054   = ht->last;
+	}
+
+	/* Clear all pointers in huffman tree item array. */
+	memset(ht->items306C, 0, sizeof(ht->items306C));
+
+	max_byte = 0;					/* Greatest character found init to zero. */
+	p_item = (struct huffman_tree_item **)&ht->items306C;	/* Pointer to current entry in huffman tree item pointer array */
+
+	/* Ensure we have low 8 bits only */
+	cmp_type   &= 0xFF;
+	byte_array  = table1502A630 + cmp_type * 258;	/* EDI also */
+
+	for (i = 0; i < 0x100; i++, p_item++) {
+		struct huffman_tree_item *item = ht->item3058;	/* Item to be created */
+		struct huffman_tree_item *p_item3 = ht->item3058;
+		unsigned char one_byte = byte_array[i];
+
+		/* Skip all the bytes which are zero. */
+		if (byte_array[i] == 0) {
+			continue;
+		}
+
+		/* If not valid pointer, take the first available item in the array. */
+		if (PTR_INT(item) <= 0) {
+			item = &ht->items0008[ht->items++];
+		}
+
+		/* Insert this item as the top of the tree. */
+		libmpq_huff_insert_item(&ht->item305C, item, SWITCH_ITEMS, NULL);
+
+		item->parent    = NULL;			/* Invalidate child and parent */
+		item->child     = NULL;
+		*p_item         = item;			/* Store pointer into pointer array */
+
+		item->dcmp_byte  = i;			/* Store counter */
+		item->byte_value = one_byte;		/* Store byte value */
+		if (one_byte >= max_byte) {
+			max_byte = one_byte;
+			continue;
+		}
+
+		/* Find the first item which has byte value greater than current one byte */
+		found = 0;
+		if (PTR_INT((p_item3 = ht->last)) > 0) {/* EDI - Pointer to the last item */
+
+			/* 15006AF7 */
+			if (p_item3 != NULL) {
+				do {			/* 15006AFB */
+					if (p_item3->byte_value >= one_byte) {
+						found = 1;
+						break;
+					}
+					p_item3 = p_item3->prev;
+				} while (PTR_INT(p_item3) > 0);
+			}
+		}
+
+		if (found == 0) {
+			p_item3 = NULL;
+		}
+
+		/* 15006B09 */
+		if (item->next != NULL) {
+			libmpq_huff_remove_item(item);
+		}
+
+		/* 15006B15 */
+		if (p_item3 == NULL) {
+			p_item3 = PTR_PTR(&ht->first);
+		}
+
+		/* 15006B1F */
+		item->next = p_item3->next;
+		item->prev = p_item3->next->prev;
+		p_item3->next->prev = item;
+		p_item3->next = item;
+	}
+
+	/* 15006B4A */
+	for (; i < 0x102; i++) {
+		struct huffman_tree_item **p_item2 = &ht->items306C[i];	/* EDI */
+
+		/* 15006B59  */
+		struct huffman_tree_item *item2 = ht->item3058;	/* ESI */
+		if (PTR_INT(item2) <= 0) {
+			item2 = &ht->items0008[ht->items++];
+		}
+		libmpq_huff_insert_item(&ht->item305C, item2, INSERT_ITEM, NULL);
+
+		/* 15006B89 */
+		item2->dcmp_byte  = i;
+		item2->byte_value = 1;
+		item2->parent     = NULL;
+		item2->child      = NULL;
+		*p_item2++        = item2;
+	}
+
+	/* 15006BAA */
+	if (PTR_INT((child1 = ht->last)) > 0) {		/* EDI - last item (first child to item */
+		struct huffman_tree_item *child2;	/* EBP */
+		struct huffman_tree_item *item;		/* ESI */
+
+		/* 15006BB8 */
+		while (PTR_INT((child2 = child1->prev)) > 0) {
+			if (PTR_INT((item = ht->item3058)) <= 0) {
+				item = &ht->items0008[ht->items++];
+			}
+			/* 15006BE3 */
+			libmpq_huff_insert_item(&ht->item305C, item, SWITCH_ITEMS, NULL);
+
+			/* 15006BF3 */
+			item->parent = NULL;
+			item->child  = NULL;
+
+			/*
+			 * EDX = child2->byte_value + child1->byte_value;
+			 * EAX = child1->byte_value;
+			 * ECX = max_byte;		The greatest character (0xFF usually)
+			 */
+			item->byte_value = child1->byte_value + child2->byte_value;	/* 0x02 */
+			item->child      = child1;	/* Prev item in the */
+			child1->parent   = item;
+			child2->parent   = item;
+
+			/* EAX = item->byte_value; */
+			if (item->byte_value >= max_byte) {
+				max_byte = item->byte_value;
+			} else {
+				struct huffman_tree_item *p_item2 = child2->prev;	/* EDI */
+				found = 0;
+				if (PTR_INT(p_item2) > 0) {
+
+					/* 15006C2D */
+					do {
+						if (p_item2->byte_value >= item->byte_value) {
+							found = 1;
+							break;
+						}
+						p_item2 = p_item2->prev;
+					} while (PTR_INT(p_item2) > 0);
+				}
+				if (found == 0) {
+					p_item2 = NULL;
+				}
+				if (item->next != 0) {
+					struct huffman_tree_item *temp4 = libmpq_huff_get_prev_item(item, -1);
+					temp4->next      = item->next;	/* The first item changed */
+					item->next->prev = item->prev;	/* First->prev changed to negative value */
+					item->next = NULL;
+					item->prev = NULL;
+				}
+
+				/* 15006C62 */
+				if (p_item2 == NULL) {
+					p_item2 = PTR_PTR(&ht->first);
+				}
+				item->next = p_item2->next;		/* Set item with 0x100 byte value */
+				item->prev = p_item2->next->prev;	/* Set item with 0x17 byte value */
+				p_item2->next->prev = item;		/* Changed prev of item with */
+				p_item2->next = item;
+			}
+
+			/* 15006C7B */
+			if (PTR_INT((child1 = child2->prev)) <= 0) {
+				break;
+			}
+		}
+	}
+
+	/* 15006C88 */
+	ht->offs0004 = 1;
+}
+
+/* Gets the whole byte from the input stream. */
+static unsigned long libmpq_huff_get_8bits(struct huffman_input_stream *is) {
+	unsigned long one_byte;
+
+	if (is->bits <= 8) {
+		is->bit_buf |= *(unsigned short *)is->in_buf << is->bits;
+		is->in_buf  += sizeof(unsigned short);
+		is->bits    += 16;
+	}
+
+	one_byte      = (is->bit_buf & 0xFF);
+	is->bit_buf >>= 8;
+	is->bits     -= 8;
+
+	return one_byte;
+}
+
+/* Gets 7 bits from the stream. */
+static unsigned long libmpq_huff_get_7bits(struct huffman_input_stream *is) {
+	if (is->bits <= 7) {
+		is->bit_buf |= *(unsigned short *)is->in_buf << is->bits;
+		is->in_buf  += sizeof(unsigned short);
+		is->bits    += 16;
+	}
+
+	/* Get 7 bits from input stream. */
+	return (is->bit_buf & 0x7F);
+}
+
+/* Gets one bit from input stream. */
+unsigned long libmpq_huff_get_bit(struct huffman_input_stream *is) {
+	unsigned long bit = (is->bit_buf & 1);
+
+	is->bit_buf >>= 1;
+	if (--is->bits == 0) {
+		is->bit_buf  = *(unsigned long *)is->in_buf;
+		is->in_buf  += sizeof(unsigned long);
+		is->bits     = 32;
+	}
+	return bit;
+}
+
+static struct huffman_tree_item *libmpq_huff_call1500E740(struct huffman_tree *ht, unsigned int value) {
+	struct huffman_tree_item *p_item1 = ht->item3058;	/* EDX */
+	struct huffman_tree_item *p_item2;			/* EAX */
+	struct huffman_tree_item *p_next;
+	struct huffman_tree_item *p_prev;
+	struct huffman_tree_item **pp_item;
+
+	if (PTR_INT(p_item1) <= 0 || (p_item2 = p_item1) == NULL) {
+		if((p_item2 = &ht->items0008[ht->items++]) != NULL) {
+			p_item1 = p_item2;
+		} else {
+			p_item1 = ht->first;
+		}
+	} else {
+		p_item1 = p_item2;
+	}
+
+	p_next = p_item1->next;
+	if (p_next != NULL) {
+		p_prev = p_item1->prev;
+		if (PTR_INT(p_prev) <= 0) {
+			p_prev = PTR_NOT(p_prev);
+		} else {
+			p_prev += (p_item1 - p_item1->next->prev);
+		}
+
+		p_prev->next = p_next;
+		p_next->prev = p_prev;
+		p_item1->next = NULL;
+		p_item1->prev = NULL;
+	}
+	pp_item = &ht->first;				/* ESI */
+	if (value > 1) {
+
+		/* ECX = ht->first->next; */
+		p_item1->next = *pp_item;
+		p_item1->prev = (*pp_item)->prev;
+
+		(*pp_item)->prev = p_item2;
+		*pp_item = p_item1;
+
+		p_item2->parent = NULL;
+		p_item2->child  = NULL;
+	} else {
+		p_item1->next = (struct huffman_tree_item *)pp_item;
+		p_item1->prev = pp_item[1];
+		/* EDI = ht->item305C; */
+		p_prev = pp_item[1];			/* ECX */
+		if (p_prev <= 0) {
+			p_prev = PTR_NOT(p_prev);
+			p_prev->next = p_item1;
+			p_prev->prev = p_item2;
+
+			p_item2->parent = NULL;
+			p_item2->child  = NULL;
+		} else {
+			if (PTR_INT(ht->item305C) < 0) {
+				p_prev += (struct huffman_tree_item *)pp_item - (*pp_item)->prev;
+			} else {
+				p_prev += PTR_INT(ht->item305C);
+			}
+
+			p_prev->next    = p_item1;
+			pp_item[1]      = p_item2;
+			p_item2->parent = NULL;
+			p_item2->child  = NULL;
+		}
+	}
+	return p_item2;
+}
+
+static void libmpq_huff_call1500E820(struct huffman_tree *ht, struct huffman_tree_item *p_item) {
+	struct huffman_tree_item *p_item1;		/* EDI */
+	struct huffman_tree_item *p_item2 = NULL;	/* EAX */
+	struct huffman_tree_item *p_item3;		/* EDX */
+	struct huffman_tree_item *p_prev;		/* EBX */
+
+	for (; p_item != NULL; p_item = p_item->parent) {
+		p_item->byte_value++;
+
+		for (p_item1 = p_item; ; p_item1 = p_prev) {
+			p_prev = p_item1->prev;
+			if (PTR_INT(p_prev) <= 0) {
+				p_prev = NULL;
+				break;
+			}
+			if (p_prev->byte_value >= p_item->byte_value) {
+				break;
+			}
+		}
+
+		if (p_item1 == p_item) {
+			continue;
+		}
+
+		if (p_item1->next != NULL) {
+			p_item2 = libmpq_huff_get_prev_item(p_item1, -1);
+			p_item2->next = p_item1->next;
+			p_item1->next->prev = p_item1->prev;
+			p_item1->next = NULL;
+			p_item1->prev = NULL;
+		}
+		p_item2 = p_item->next;
+		p_item1->next = p_item2;
+		p_item1->prev = p_item2->prev;
+		p_item2->prev = p_item1;
+		p_item->next = p_item1;
+		if ((p_item2 = p_item1) != NULL) {
+			p_item2 = libmpq_huff_get_prev_item(p_item, -1);
+			p_item2->next = p_item->next;
+			p_item->next->prev = p_item->prev;
+			p_item->next = NULL;
+			p_item->prev = NULL;
+		}
+
+		if (p_prev == NULL) {
+			p_prev = PTR_PTR(&ht->first);
+		}
+		p_item2       = p_prev->next;
+		p_item->next  = p_item2;
+		p_item->prev  = p_item2->prev;
+		p_item2->prev = p_item;
+		p_prev->next  = p_item;
+
+		p_item3 = p_item1->parent->child;
+		p_item2 = p_item->parent;
+		if (p_item2->child == p_item) {
+			p_item2->child = p_item1;
+		}
+
+		if (p_item3 == p_item1) {
+			p_item1->parent->child = p_item;
+		}
+
+		p_item2 = p_item->parent;
+		p_item->parent  = p_item1->parent;
+		p_item1->parent = p_item2;
+		ht->offs0004++;
+	}
+}
+
+int libmpq_huff_do_decompress(struct huffman_tree *ht, struct huffman_input_stream *is, unsigned char *out_buf, unsigned int out_length) {
+	unsigned int n8bits;				/* 8 bits loaded from input stream */
+	unsigned int n7bits;				/* 7 bits loaded from input stream */
+	unsigned int found;				/* Thats needed to replace the goto stuff from original source :) */
+	unsigned int dcmp_byte = 0;
+	unsigned long bit_count;
+	struct huffman_decompress *qd;
+	unsigned int has_qd;				/* Can we use quick decompression? */
+	struct huffman_tree_item *p_item1;
+	struct huffman_tree_item *p_item2;
+	unsigned char *out_pos = out_buf;
+
+	/* Test the output length. Must not be non zero. */
+	if (out_length == 0) {
+		return 0;
+	}
+
+	/* Get the compression type from the input stream. */
+	n8bits = libmpq_huff_get_8bits(is);
+
+	/* Build the Huffman tree */
+	libmpq_huff_build_tree(ht, n8bits);
+	ht->cmp0 = (n8bits == 0) ? TRUE : FALSE;
+
+	for(;;) {
+		n7bits = libmpq_huff_get_7bits(is);	/* Get 7 bits from input stream */
+
+		/*
+		 * Try to use quick decompression. Check huffman_decompress array for corresponding item.
+		 * If found, use the result byte instead.
+		 */
+		qd = &ht->qd3474[n7bits];
+
+		/* If there is a quick-pass possible (ebx) */
+		has_qd = (qd->offs00 >= ht->offs0004) ? TRUE : FALSE;
+
+		/* If we can use quick decompress, use it. */
+		if (has_qd) {
+			found = 0;
+			if (qd->bits > 7) {
+				is->bit_buf >>= 7;
+				is->bits -= 7;
+				p_item1 = qd->p_item;
+				found = 1;
+			}
+			if (found == 0) {
+				is->bit_buf >>= qd->bits;
+				is->bits     -= qd->bits;
+				dcmp_byte     = qd->dcmp_byte;
+			}
+		} else {
+			found = 1;
+			p_item1 = ht->first->next->prev;
+			if (PTR_INT(p_item1) <= 0) {
+				p_item1 = NULL;
+			}
+		}
+
+		if (found == 1) {
+			bit_count = 0;
+			p_item2 = NULL;
+			do {
+				p_item1 = p_item1->child;	/* Move down by one level */
+				if (libmpq_huff_get_bit(is)) {	/* If current bit is set, move to previous */
+					p_item1 = p_item1->prev;
+				}
+				if (++bit_count == 7) {		/* If we are at 7th bit, save current huffman tree item. */
+					p_item2 = p_item1;
+				}
+			} while (p_item1->child != NULL);	/* Walk until tree has no deeper level */
+
+			if (has_qd == FALSE) {
+				if (bit_count > 7) {
+					qd->offs00 = ht->offs0004;
+					qd->bits   = bit_count;
+					qd->p_item = p_item2;
+				} else {
+					unsigned long index = n7bits & (0xFFFFFFFF >> (32 - bit_count));
+					unsigned long add   = (1 << bit_count);
+
+					for (qd = &ht->qd3474[index]; index <= 0x7F; index += add, qd += add) {
+						qd->offs00    = ht->offs0004;
+						qd->bits      = bit_count;
+						qd->dcmp_byte = p_item1->dcmp_byte;
+					}
+				}
+			}
+			dcmp_byte = p_item1->dcmp_byte;
+		}
+
+		if (dcmp_byte == 0x101)	{		/* Huffman tree needs to be modified */
+			n8bits  = libmpq_huff_get_8bits(is);
+			p_item1 = (ht->last <= 0) ? NULL : ht->last;
+
+			p_item2 = libmpq_huff_call1500E740(ht, 1);
+			p_item2->parent     = p_item1;
+			p_item2->dcmp_byte  = p_item1->dcmp_byte;
+			p_item2->byte_value = p_item1->byte_value;
+			ht->items306C[p_item2->dcmp_byte] = p_item2;
+
+			p_item2 = libmpq_huff_call1500E740(ht, 1);
+			p_item2->parent     = p_item1;
+			p_item2->dcmp_byte  = n8bits;
+			p_item2->byte_value = 0;
+			ht->items306C[p_item2->dcmp_byte] = p_item2;
+
+			p_item1->child = p_item2;
+			libmpq_huff_call1500E820(ht, p_item2);
+			if (ht->cmp0 == 0) {
+				libmpq_huff_call1500E820(ht, ht->items306C[n8bits]);
+			}
+			dcmp_byte = n8bits;
+		}
+
+		if (dcmp_byte == 0x100) {
+			break;
+		}
+
+		*out_pos++ = (unsigned char)dcmp_byte;
+		if (--out_length == 0) {
+			break;
+		}
+		if (ht->cmp0) {
+			libmpq_huff_call1500E820(ht, ht->items306C[dcmp_byte]);
+		}
+	}
+	return (out_pos - out_buf);
+}
+
+int libmpq_huff_init_tree(struct huffman_tree *ht, struct huffman_tree_item *hi, unsigned int cmp) {
+	int count;
+
+	/* Clear links for all the items in the tree */
+	for (hi = ht->items0008, count = 0x203; count != 0; hi++, count--) {
+		hi->next = hi->prev = NULL;
+	}
+
+	ht->item3050 = NULL;
+	ht->item3054 = PTR_PTR(&ht->item3054);
+	ht->item3058 = PTR_NOT(ht->item3054);
+
+	ht->item305C = NULL;
+	ht->first    = PTR_PTR(&ht->first);
+	ht->last     = PTR_NOT(ht->first);
+
+	ht->offs0004 = 1;
+	ht->items    = 0;
+
+	/* Clear all huffman_decompress items. Do this only if preparing for decompression */
+	if (cmp == LIBMPQ_HUFF_DECOMPRESS) {
+		for (count = 0; count < sizeof(ht->qd3474) / sizeof(struct huffman_decompress); count++) {
+			ht->qd3474[count].offs00 = 0;
+		}
+	}
+
+    return 0;
+}
diff --git a/contrib/extractor/libmpq/huffman.h b/contrib/extractor/libmpq/huffman.h
new file mode 100644
index 00000000000..1f8eae54eb4
--- /dev/null
+++ b/contrib/extractor/libmpq/huffman.h
@@ -0,0 +1,105 @@
+/*
+ *  huffman.h -- structures used for huffman compression.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This source was adepted from the C++ version of huffman.h included
+ *  in stormlib. The C++ version belongs to the following authors,
+ *
+ *  Ladislav Zezula <ladik.zezula.net>
+ *  ShadowFlare <BlakFlare@hotmail.com>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ */
+
+#ifndef _HUFFMAN_H
+#define _HUFFMAN_H
+
+#define PTR_NOT(ptr)	(struct huffman_tree_item *)(~(unsigned long)(ptr))
+#define PTR_PTR(ptr)	((struct huffman_tree_item *)(ptr))
+#define PTR_INT(ptr)	(long)(ptr)
+
+#define INSERT_ITEM	1
+#define SWITCH_ITEMS	2				/* Switch the item1 and item2 */
+
+/*
+ *  Input stream for Huffmann decompression
+ */
+struct huffman_input_stream {
+	unsigned char *in_buf;				/* 00 - Input data */
+	unsigned long bit_buf;				/* 04 - Input bit buffer */
+	unsigned int bits;				/* 08 - Number of bits remaining in 'byte' */
+};
+
+/*
+ *  Huffmann tree item.
+ */
+struct huffman_tree_item {
+	struct huffman_tree_item *next;			/* 00 - Pointer to next huffman_tree_item */
+	struct huffman_tree_item *prev;			/* 04 - Pointer to prev huffman_tree_item (< 0 if none) */
+	unsigned long dcmp_byte;			/* 08 - Index of this item in item pointer array, decompressed byte value */
+	unsigned long byte_value;			/* 0C - Some byte value */
+	struct huffman_tree_item *parent;		/* 10 - Pointer to parent huffman_tree_item (NULL if none) */
+	struct huffman_tree_item *child;		/* 14 - Pointer to child huffman_tree_item */
+};
+
+/*
+ *  Structure used for quick decompress. The 'bits' contains
+ *  number of bits and dcmp_byte contains result decompressed byte
+ *  value. After each walk through Huffman tree are filled all entries
+ *  which are multiplies of number of bits loaded from input stream.
+ *  These entries contain number of bits and result value. At the next
+ *  7 bits is tested this structure first. If corresponding entry found,
+ *  decompression routine will not walk through Huffman tree and
+ *  directly stores output byte to output stream.
+ */
+struct huffman_decompress {
+	unsigned long offs00;				/* 00 - 1 if resolved */
+	unsigned long bits;				/* 04 - Bit count */
+	union {
+		unsigned long dcmp_byte;		/* 08 - Byte value for decompress (if bitCount <= 7) */
+		struct huffman_tree_item *p_item;	/* 08 - THTreeItem (if number of bits is greater than 7 */
+	};
+};
+
+/*
+ *  Structure for Huffman tree.
+ */
+struct huffman_tree {
+	unsigned long cmp0;				/* 0000 - 1 if compression type 0 */
+	unsigned long offs0004;				/* 0004 - Some flag */
+
+	struct huffman_tree_item items0008[0x203];	/* 0008 - huffman tree items */
+
+	/* Sometimes used as huffman tree item */
+	struct huffman_tree_item *item3050;		/* 3050 - Always NULL (?) */
+	struct huffman_tree_item *item3054;		/* 3054 - Pointer to huffman_tree_item */
+	struct huffman_tree_item *item3058;		/* 3058 - Pointer to huffman_tree_item (< 0 if invalid) */
+
+	/* Sometimes used as huffman tree item */
+	struct huffman_tree_item *item305C;		/* 305C - Usually NULL */
+	struct huffman_tree_item *first;		/* 3060 - Pointer to top (first) Huffman tree item */
+	struct huffman_tree_item *last;			/* 3064 - Pointer to bottom (last) Huffman tree item (< 0 if invalid) */
+	unsigned long items;				/* 3068 - Number of used huffman tree items */
+
+	struct huffman_tree_item *items306C[0x102];	/* 306C - huffman_tree_item pointer array */
+	struct huffman_decompress qd3474[0x80];		/* 3474 - Array for quick decompression */
+
+	//unsigned char table1502A630[];			/* Some table to make struct size flexible */
+};
+
+int libmpq_huff_init_tree(struct huffman_tree *ht, struct huffman_tree_item *hi, unsigned int cmp);
+int libmpq_huff_do_decompress(struct huffman_tree *ht, struct huffman_input_stream *is, unsigned char *out_buf, unsigned int out_length);
+#endif			/* _HUFFMAN_H */
diff --git a/contrib/extractor/libmpq/mpq.cpp b/contrib/extractor/libmpq/mpq.cpp
new file mode 100644
index 00000000000..dda89a3b989
--- /dev/null
+++ b/contrib/extractor/libmpq/mpq.cpp
@@ -0,0 +1,626 @@
+/*
+ *  mpq.c -- functions for developers using libmpq.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ *
+ *  $Id: mpq.c,v 1.6 2004/02/12 00:49:00 mbroemme Exp $
+ */
+#define _CRT_SECURE_NO_DEPRECATE
+
+#include <stdlib.h>
+#include <sys/stat.h>
+//#include <unistd.h>
+//#include <io.h>
+#include <fcntl.h>
+#include <stdio.h>
+#include <string.h>
+#include "mpq.h"
+#include "common.h"
+
+/*
+ *  This function returns version information.
+ *  format: MAJOR.MINOR.PATCH
+ */
+char *libmpq_version() {
+	static char version[10];
+	sprintf(version, "%i.%i.%i", LIBMPQ_MAJOR_VERSION, LIBMPQ_MINOR_VERSION, LIBMPQ_PATCH_VERSION);
+	return version;
+}
+
+/*
+ *  This function reads a file and verify if it is a legit MPQ archive
+ *  or not. Then it fills the mpq_header structure and reads the hash
+ *  table.
+ */
+int libmpq_archive_open(mpq_archive *mpq_a, unsigned char *mpq_filename) {
+	int fd = 0;
+	int rb = 0;
+	int ncnt = FALSE;
+	struct stat fileinfo;
+
+	/* allocate memory */
+	mpq_a->mpq_l = (mpq_list *)malloc(sizeof(mpq_list));
+	memset(mpq_a->mpq_l, 0, sizeof(mpq_list));
+	mpq_a->header = (mpq_header *)malloc(sizeof(mpq_header));
+	memset(mpq_a->header, 0, sizeof(mpq_header));
+
+	/* Check if file exists and is readable */
+	fd = _open((char *)mpq_filename, O_RDONLY | O_BINARY);
+	if (fd == LIBMPQ_EFILE) {
+		return LIBMPQ_EFILE;
+	}
+
+	/* fill the structures with informations */
+	strcpy((char *)mpq_a->filename, (char *)mpq_filename);
+	libmpq_init_buffer(mpq_a);
+	mpq_a->fd               = fd;
+	mpq_a->header->id       = 0;
+	mpq_a->maxblockindex    = 0;
+	mpq_a->mpq_l->mpq_files = NULL;
+
+    mpq_a->mpqpos = 0; //k
+
+	while (!ncnt) {
+		mpq_a->header->id = 0;
+		#ifdef WIN32
+			_lseeki64(mpq_a->fd, mpq_a->mpqpos, SEEK_SET);
+		#else
+			lseek64(mpq_a->fd, mpq_a->mpqpos, SEEK_SET);
+		#endif
+		rb = _read(mpq_a->fd, mpq_a->header, sizeof(mpq_header));
+
+		/* if different number of bytes read, break the loop */
+		if (rb != sizeof(mpq_header)) {
+			return LIBMPQ_EFILE_FORMAT;
+		}
+
+		/* special offset for protected MPQs */
+		if (mpq_a->header->offset == LIBMPQ_HEADER_W3M) {
+			mpq_a->flags |= LIBMPQ_FLAG_PROTECTED;
+			mpq_a->header->offset = sizeof(mpq_header);
+		}
+
+		/* if valid signature has been found, break the loop */
+        if (mpq_a->header->id == LIBMPQ_ID_MPQ) {
+            ncnt = true;
+        }
+        /*if (mpq_a->header->id == LIBMPQ_ID_MPQ &&
+		    mpq_a->header->offset == sizeof(mpq_header) &&
+		    mpq_a->header->hashtablepos < mpq_a->header->archivesize &&
+		    mpq_a->header->blocktablepos < mpq_a->header->archivesize) {
+			ncnt = TRUE;
+		}*/
+
+		/* move to the next possible offset */
+		if (!ncnt) {
+			mpq_a->mpqpos += 0x200;
+		}
+	}
+
+	/* get the right positions of the hash table and the block table. */
+	mpq_a->blocksize = (0x200 << mpq_a->header->blocksize);
+	fstat(mpq_a->fd, &fileinfo);
+
+	/* Normal MPQs must have position of */
+	/*if (mpq_a->header->hashtablepos + mpq_a->mpqpos < fileinfo.st_size &&
+	    mpq_a->header->blocktablepos + mpq_a->mpqpos < fileinfo.st_size) {
+		mpq_a->header->hashtablepos  += mpq_a->mpqpos;
+		mpq_a->header->blocktablepos += mpq_a->mpqpos;
+	} else {
+		return LIBMPQ_EFILE_FORMAT;
+	}*/
+
+	/* Try to read and decrypt the hashtable */
+	if (libmpq_read_hashtable(mpq_a) != 0) {
+		return LIBMPQ_EHASHTABLE;
+	}
+
+	/* Try to read and decrypt the blocktable */
+	if (libmpq_read_blocktable(mpq_a) != 0) {
+		return LIBMPQ_EBLOCKTABLE;
+	}
+
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+/*
+ *  This function closes the file descriptor opened by
+ *  mpq_open_archive(); and frees the decryption buffer.
+ */
+int libmpq_archive_close(mpq_archive *mpq_a) {
+	memset(mpq_a->buf, 0, sizeof(mpq_a->buf));
+
+	/* free the allocated memory. */
+	free(mpq_a->header);
+	free(mpq_a->mpq_l);
+
+	/* Check if file descriptor is valid. */
+	if ((_close(mpq_a->fd)) == LIBMPQ_EFILE) {
+		return LIBMPQ_EFILE;
+	}
+
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+/*
+ * This function returns the value for the given infotype.
+ * If an error occurs something < 0 is returned.
+ */
+int libmpq_archive_info(mpq_archive *mpq_a, unsigned int infotype) {
+	unsigned int filecount = 0;
+	unsigned int fsize = 0;
+	unsigned int csize = 0;
+	mpq_block *mpq_b_end = mpq_a->blocktable + mpq_a->header->blocktablesize;
+	mpq_block *mpq_b = NULL;
+
+	switch (infotype) {
+		case LIBMPQ_MPQ_ARCHIVE_SIZE:
+			return mpq_a->header->archivesize;
+		case LIBMPQ_MPQ_HASHTABLE_SIZE:
+			return mpq_a->header->hashtablesize;
+		case LIBMPQ_MPQ_BLOCKTABLE_SIZE:
+			return mpq_a->header->blocktablesize;
+		case LIBMPQ_MPQ_BLOCKSIZE:
+			return mpq_a->blocksize;
+		case LIBMPQ_MPQ_NUMFILES:
+			for (mpq_b = mpq_a->blocktable; mpq_b < mpq_b_end; mpq_b++) {
+				filecount++;
+			}
+			return filecount;
+		case LIBMPQ_MPQ_COMPRESSED_SIZE:
+			for (mpq_b = mpq_a->blocktable; mpq_b < mpq_b_end; mpq_b++) {
+				csize += mpq_b->csize;
+			}
+			return csize;
+		case LIBMPQ_MPQ_UNCOMPRESSED_SIZE:
+			for (mpq_b = mpq_a->blocktable; mpq_b < mpq_b_end; mpq_b++) {
+				fsize += mpq_b->fsize;
+			}
+			return fsize;
+		default:
+			return LIBMPQ_TOOLS_SUCCESS;
+	}
+}
+
+/*
+ * This function returns some useful file information.
+ */
+int libmpq_file_info(mpq_archive *mpq_a, unsigned int infotype, const int number) {
+	int blockindex = number; //-1;
+	int i = 0;
+	mpq_block *mpq_b = NULL;
+	mpq_hash *mpq_h = NULL;
+
+	/* check if given number is not out of range */
+	if (number < 1 || number > mpq_a->header->blocktablesize) {
+		return LIBMPQ_EINV_RANGE;
+	}
+
+	/* search for correct hashtable */
+	/*for (i = 0; i < mpq_a->header->hashtablesize; i++) {
+		if ((number - 1) == (mpq_a->hashtable[i]).blockindex) {
+			blockindex = (mpq_a->hashtable[i]).blockindex;
+			mpq_h = &(mpq_a->hashtable[i]);
+			break;
+		}
+	}*/
+
+	/* check if file was found */
+	/*if (blockindex == -1 || blockindex > mpq_a->header->blocktablesize) {
+		return LIBMPQ_EFILE_NOT_FOUND;
+	}*/
+
+	/* check if sizes are correct */
+	mpq_b = mpq_a->blocktable + blockindex;
+	if (mpq_b->filepos > (mpq_a->header->archivesize + mpq_a->mpqpos) || mpq_b->csize > mpq_a->header->archivesize) {
+		return LIBMPQ_EFILE_CORRUPT;
+	}
+
+	/* check if file exists */
+	if ((mpq_b->flags & LIBMPQ_FILE_EXISTS) == 0) {
+		return LIBMPQ_EFILE_NOT_FOUND;
+	}
+
+	switch (infotype) {
+		case LIBMPQ_FILE_COMPRESSED_SIZE:
+			return mpq_b->csize;
+		case LIBMPQ_FILE_UNCOMPRESSED_SIZE:
+			return mpq_b->fsize;
+		case LIBMPQ_FILE_COMPRESSION_TYPE:
+			if (mpq_b->flags & LIBMPQ_FILE_COMPRESS_PKWARE) {
+				return LIBMPQ_FILE_COMPRESS_PKWARE;
+			}
+			if (mpq_b->flags & LIBMPQ_FILE_COMPRESS_MULTI) {
+				return LIBMPQ_FILE_COMPRESS_MULTI;
+			}
+		default:
+			return LIBMPQ_TOOLS_SUCCESS;
+	}
+}
+
+/*
+ * This function searches the listfile for the filename.
+ * On success it returns the filename, otherwiese a name
+ * like file000001.xxx and if number is out of range it
+ * returns NULL.
+ */
+char *libmpq_file_name(mpq_archive *mpq_a, const int number) {
+	static char tempfile[PATH_MAX];
+
+	/* check if we are in the range of available files. */
+	if (number > libmpq_archive_info(mpq_a, LIBMPQ_MPQ_NUMFILES) || number < 1) {
+		return NULL;
+	}
+
+	/* this is safe because we built a fallback filelist, if something was wrong. */
+	sprintf(tempfile, (char *)mpq_a->mpq_l->mpq_files[number - 1], number);
+
+	return tempfile;
+}
+
+/*
+ *  This function returns the number to the given
+ *  filename.
+ */
+int libmpq_file_number(mpq_archive *mpq_a, const char *name) {
+	int i;
+	char tempfile[PATH_MAX];
+
+	for (i = 0; mpq_a->mpq_l->mpq_files[i]; i++) {
+		sprintf(tempfile, (char *)mpq_a->mpq_l->mpq_files[i], i + 1);
+		if (strncmp(tempfile, name, strlen(name)) == 0) {
+
+			/* if file found return the number */
+			return i + 1;
+		}
+	}
+
+	/* if no matching entry found return LIBMPQ_EFILE_NOT_FOUND */
+	return LIBMPQ_EFILE_NOT_FOUND;
+}
+
+/*
+ *  This function verifies if a given file (by number
+ *  or name) is in the opened mpq archive. On success
+ *  it returns 0, otherwise LIBMPQ_EFILE_NOT_FOUND.
+ */
+int libmpq_file_check(mpq_archive *mpq_a, void *file, int type) {
+	int found = 0;
+	int i;
+	char tempfile[PATH_MAX];
+
+	switch (type) {
+		case LIBMPQ_FILE_TYPE_INT:
+
+			/* check if we are in the range of available files. */
+			if (*(int *)file > libmpq_archive_info(mpq_a, LIBMPQ_MPQ_NUMFILES) || *(int *)file < 1) {
+				return LIBMPQ_EFILE_NOT_FOUND;
+			} else {
+				return LIBMPQ_TOOLS_SUCCESS;
+			}
+		case LIBMPQ_FILE_TYPE_CHAR:
+			for (i = 0; mpq_a->mpq_l->mpq_files[i]; i++) {
+				sprintf(tempfile, (char *)mpq_a->mpq_l->mpq_files[i], i);
+				if (strncmp(tempfile, (char *)file, strlen((char *)file)) == 0) {
+
+					/* if file found break */
+					found = 1;
+					break;
+				}
+			}
+
+			/* if a file was found return 0 */
+			if (found == 1) {
+				return LIBMPQ_TOOLS_SUCCESS;
+			} else {
+				return LIBMPQ_EFILE_NOT_FOUND;
+			}
+		default:
+			return LIBMPQ_TOOLS_SUCCESS;
+	}
+}
+
+/*
+ *  This function extracts a file from a MPQ archive
+ *  by the given number.
+ */
+int libmpq_file_extract(mpq_archive *mpq_a, const int number, const char *filename) {
+	int blockindex = number; //-1;
+	int fd = 0;
+	int i = 0;
+	char buffer[0x1000];
+	//char tempfile[PATH_MAX];
+	unsigned int transferred = 1;
+	mpq_file *mpq_f = NULL;
+	mpq_block *mpq_b = NULL;
+	mpq_hash *mpq_h = NULL;
+
+/*	if (number < 1 || number > mpq_a->header->blocktablesize) {
+		return LIBMPQ_EINV_RANGE;
+	}*/
+/*
+	sprintf(tempfile, libmpq_file_name(mpq_a, number));
+*/
+	/* check if mpq_f->filename could be written here. */
+	fd = _open(filename, O_RDWR|O_CREAT|O_TRUNC, 0644);
+	if (fd == LIBMPQ_EFILE) {
+		return LIBMPQ_EFILE;
+	}
+
+	/* search for correct hashtable */
+	/*for (i = 0; i < mpq_a->header->hashtablesize; i++) {
+		if ((number - 1) == (mpq_a->hashtable[i]).blockindex) {
+			blockindex = (mpq_a->hashtable[i]).blockindex;
+			mpq_h = &(mpq_a->hashtable[i]);
+			break;
+		}
+	}*/
+
+	/* check if file was found */
+	if (blockindex == -1 || blockindex > mpq_a->header->blocktablesize) {
+		return LIBMPQ_EFILE_NOT_FOUND;
+	}
+
+	/* check if sizes are correct */
+	mpq_b = mpq_a->blocktable + blockindex;
+	if (mpq_b->filepos > (mpq_a->header->archivesize + mpq_a->mpqpos) || mpq_b->csize > mpq_a->header->archivesize) {
+		return LIBMPQ_EFILE_CORRUPT;
+	}
+
+	/* check if file exists */
+	if ((mpq_b->flags & LIBMPQ_FILE_EXISTS) == 0) {
+		return LIBMPQ_EFILE_NOT_FOUND;
+	}
+
+	/* allocate memory for file structure */
+	mpq_f = (mpq_file *)malloc(sizeof(mpq_file));
+	if (!mpq_f) {
+		return LIBMPQ_EALLOCMEM;
+	}
+
+	/* initialize file structure */
+	memset(mpq_f, 0, sizeof(mpq_file));
+	mpq_f->fd             = fd;
+	mpq_f->mpq_b          = mpq_b;
+	mpq_f->nblocks        = (mpq_f->mpq_b->fsize + mpq_a->blocksize - 1) / mpq_a->blocksize;
+	mpq_f->mpq_h          = mpq_h;
+	mpq_f->accessed       = FALSE;
+	mpq_f->blockposloaded = FALSE;
+	sprintf((char *)mpq_f->filename, filename);
+
+	/* allocate buffers for decompression. */
+	if (mpq_f->mpq_b->flags & LIBMPQ_FILE_COMPRESSED) {
+
+		/*
+		 *  Allocate buffer for block positions. At the begin of file are stored
+		 *  unsigned ints holding positions of each block relative from begin of
+		 *  file in the archive.
+		 */
+		if ((mpq_f->blockpos = (unsigned int *)malloc(sizeof(int) * mpq_f->nblocks + 1)) == NULL) {
+			return LIBMPQ_EALLOCMEM;
+		}
+	}
+
+	while (transferred > 0) {
+		transferred = libmpq_file_read_file(mpq_a, mpq_f, mpq_f->filepos, buffer, sizeof(buffer));
+		if (transferred == 0) {
+			break;
+		} else {
+			mpq_f->accessed  = TRUE;
+			mpq_f->filepos  += transferred;
+		}
+
+		transferred = _write(mpq_f->fd, buffer, transferred);
+		if (transferred == 0) {
+			break;
+		}
+	}
+
+	_close(fd);
+
+	/* freeing the file structure */
+	free(mpq_f);
+	return LIBMPQ_TOOLS_SUCCESS;
+}
+
+/*
+ *  This function tries to get the filenames for the hashes. It uses
+ *  an internal listfile database and gets the correct listfile from
+ *  some specific archive informations.
+ */
+
+int libmpq_listfile_open(mpq_archive *mpq_a, char file[PATH_MAX]) {
+	FILE *fp;
+	//char **filelist;
+	int i = 0;
+	//int fl_count;
+	//int fl_size;
+	int fl_count_fb;
+	int fl_size_fb;
+	int result = LIBMPQ_TOOLS_SUCCESS;
+	struct stat statbuf;
+
+	/* get file status */
+	if (stat(file, &statbuf) < 0) {
+		result = LIBMPQ_CONF_EFILE_NOT_FOUND;
+	}
+
+	/* check if file is a filename or directory */
+	/*if (S_ISDIR(statbuf.st_mode)) {
+
+		// allocate memory for the file list
+		filelist = (char **)malloc(LIBMPQ_CONF_FL_INCREMENT * sizeof(char *));
+		fl_count = 0;
+		fl_size = LIBMPQ_CONF_FL_INCREMENT;
+
+		// check if it is a valid listfile
+		if (libmpq_detect_listfile_rec(file, &filelist, &fl_count, &fl_size)) {
+			filelist == NULL;
+		}
+
+		filelist[fl_count] = NULL;
+
+		// return if no listfile was found
+		if (filelist == NULL) {
+			result = LIBMPQ_CONF_EFILE_NOT_FOUND;
+		}
+
+		for (i = 0; filelist[i]; i++) {
+			if ((fp = fopen(filelist[i], "r")) != NULL ) {
+				result = libmpq_read_listfile(mpq_a, fp);
+				fclose(fp);
+			}
+		}
+
+		// freeing the listfile struct
+		libmpq_free_listfile(filelist);
+	}*/
+
+	/* if file is a regular file use it */
+	//if (S_ISREG(statbuf.st_mode)) {
+
+		/* if specific listfile was forced. */
+		if ((fp = fopen(file, "r")) != NULL ) {
+			result = libmpq_read_listfile(mpq_a, fp);
+			fclose(fp);
+		} else {
+			result = LIBMPQ_CONF_EFILE_OPEN;
+		}
+	//}
+
+	/* if error occured we need to create a fallback filelist. */
+	if (mpq_a->mpq_l->mpq_files == NULL) {
+
+		/* allocate memory for the file list */
+		mpq_a->mpq_l->mpq_files = (unsigned char **)malloc(LIBMPQ_CONF_FL_INCREMENT * sizeof(char *));
+		fl_count_fb = 0;
+		fl_size_fb = LIBMPQ_CONF_FL_INCREMENT;
+
+		for (i = 0; i < libmpq_archive_info(mpq_a, LIBMPQ_MPQ_NUMFILES); i++) {
+
+			/* set the next filelist entry to a copy of the file */
+			mpq_a->mpq_l->mpq_files[fl_count_fb++] = (unsigned char *)_strdup("file%06lu.xxx");
+
+			/* increase the array size */
+			if (fl_count_fb == fl_size_fb) {
+				mpq_a->mpq_l->mpq_files = (unsigned char **)realloc(mpq_a->mpq_l->mpq_files, (fl_size_fb + LIBMPQ_CONF_FL_INCREMENT) * sizeof(char *));
+				fl_size_fb += LIBMPQ_CONF_FL_INCREMENT;
+			}
+		}
+		mpq_a->mpq_l->mpq_files[fl_count_fb] = NULL;
+
+		/* if no error occurs and no listfile was assigned, we think there was no matching listfile. */
+		if (result == 0) {
+			result = LIBMPQ_CONF_EFILE_NOT_FOUND;
+		}
+	}
+
+	return result;
+}
+
+/*
+ *  This function frees the allocated memory for the listfile.
+ */
+int libmpq_listfile_close(mpq_archive *mpq_a) {
+	int i = 0;
+
+	/* safety check if we really have a filelist. */
+	if (mpq_a->mpq_l->mpq_files != NULL) {
+		/* freeing the filelist */
+		while (mpq_a->mpq_l->mpq_files[i]) {
+			free(mpq_a->mpq_l->mpq_files[i++]);
+		}
+		free(mpq_a->mpq_l->mpq_files);
+	}
+    return 0;
+}
+
+int libmpq_file_getdata(mpq_archive *mpq_a, mpq_hash mpq_h, const int number, unsigned char *dest) {
+	int blockindex = number; //-1;
+	int i = 0;
+	mpq_file *mpq_f = NULL;
+	mpq_block *mpq_b = NULL;
+	int success = 0;
+
+	/*if (number < 1 || number > mpq_a->header->blocktablesize) {
+		return LIBMPQ_EINV_RANGE;
+	}*/
+
+	/* search for correct hashtable */
+	/*for (i = 0; i < mpq_a->header->hashtablesize; i++) {
+		if ((number - 1) == (mpq_a->hashtable[i]).blockindex) {
+			blockindex = (mpq_a->hashtable[i]).blockindex;
+			mpq_h = &(mpq_a->hashtable[i]);
+			break;
+		}
+	}*/
+
+	/* check if file was found */
+	if (blockindex == -1 || blockindex > mpq_a->header->blocktablesize) {
+		return LIBMPQ_EFILE_NOT_FOUND;
+	}
+
+	/* check if sizes are correct */
+	mpq_b = mpq_a->blocktable + blockindex;
+	if (mpq_b->filepos > (mpq_a->header->archivesize + mpq_a->mpqpos) || mpq_b->csize > mpq_a->header->archivesize) {
+		return LIBMPQ_EFILE_CORRUPT;
+	}
+
+	/* check if file exists */
+	if ((mpq_b->flags & LIBMPQ_FILE_EXISTS) == 0) {
+		return LIBMPQ_EFILE_NOT_FOUND;
+	}
+
+	/* allocate memory for file structure */
+	mpq_f = (mpq_file*)malloc(sizeof(mpq_file));
+	if (!mpq_f) {
+		return LIBMPQ_EALLOCMEM;
+	}
+
+	/* initialize file structure */
+	memset(mpq_f, 0, sizeof(mpq_file));
+	mpq_f->mpq_b          = mpq_b;
+	mpq_f->nblocks        = (mpq_f->mpq_b->fsize + mpq_a->blocksize - 1) / mpq_a->blocksize;
+	mpq_f->mpq_h          = &mpq_h;
+	mpq_f->accessed       = FALSE;
+	mpq_f->blockposloaded = FALSE;
+
+	/* allocate buffers for decompression. */
+	if (mpq_f->mpq_b->flags & LIBMPQ_FILE_COMPRESSED) {
+
+		/*
+		 *  Allocate buffer for block positions. At the begin of file are stored
+		 *  unsigned ints holding positions of each block relative from begin of
+		 *  file in the archive.
+		 */
+		if ((mpq_f->blockpos = (unsigned int*)malloc(sizeof(int) * (mpq_f->nblocks + 1))) == NULL) {
+			return LIBMPQ_EALLOCMEM;
+		}
+	}
+
+    if(libmpq_file_read_file(mpq_a, mpq_f, 0, (char*)dest, mpq_b->fsize) == mpq_b->fsize)
+        success = 1;
+
+    if (mpq_f->mpq_b->flags & LIBMPQ_FILE_COMPRESSED) {
+        // Free buffer for block positions
+		
+	       free(mpq_f->blockpos);
+	}
+	/* freeing the file structure */
+	free(mpq_f);
+	return success?LIBMPQ_TOOLS_SUCCESS:LIBMPQ_EFILE_CORRUPT;
+}
diff --git a/contrib/extractor/libmpq/mpq.h b/contrib/extractor/libmpq/mpq.h
new file mode 100644
index 00000000000..0a136f95f30
--- /dev/null
+++ b/contrib/extractor/libmpq/mpq.h
@@ -0,0 +1,225 @@
+/*
+ *  mpq.h -- some default types and defines.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This source was adepted from the C++ version of StormLib.h and
+ *  StormPort.h included in stormlib. The C++ version belongs to
+ *  the following authors,
+ *
+ *  Ladislav Zezula <ladik.zezula.net>
+ *  Marko Friedemann <marko.friedemann@bmx-chemnitz.de>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ *
+ *  $Id: mpq.h,v 1.8 2004/02/12 00:45:50 mbroemme Exp $
+ */
+
+#ifndef _MPQ_H
+#define _MPQ_H
+
+#include <limits.h>
+
+#ifndef PATH_MAX
+	#define PATH_MAX 260
+#endif
+
+
+#define LIBMPQ_MAJOR_VERSION		0		/* Major version number... maybe sometimes we reach version 1 :) */
+#define LIBMPQ_MINOR_VERSION		3		/* Minor version number - increased only for small changes */
+#define LIBMPQ_PATCH_VERSION		0		/* Patchlevel - changed on bugfixes etc... */
+
+#define LIBMPQ_TOOLS_SUCCESS		0		/* return value for all functions which success */
+#define LIBMPQ_TOOLS_BUFSIZE		0x500		/* buffer size for the decryption engine */
+
+#define LIBMPQ_EFILE			-1		/* error on file operation */
+#define LIBMPQ_EFILE_FORMAT		-2		/* bad file format */
+#define LIBMPQ_EFILE_CORRUPT		-3		/* file corrupt */
+#define LIBMPQ_EFILE_NOT_FOUND		-4		/* file in archive not found */
+#define LIBMPQ_EFILE_READ		-5		/* Read error in archive */
+#define LIBMPQ_EALLOCMEM		-6		/* maybe not enough memory? :) */
+#define LIBMPQ_EFREEMEM			-7		/* can not free memory */
+#define LIBMPQ_EINV_RANGE		-8		/* Given filenumber is out of range */
+#define LIBMPQ_EHASHTABLE		-9		/* error in reading hashtable */
+#define LIBMPQ_EBLOCKTABLE		-10		/* error in reading blocktable */
+
+#define LIBMPQ_ID_MPQ			0x1A51504D	/* MPQ archive header ID ('MPQ\x1A') */
+#define LIBMPQ_HEADER_W3M		0x6D9E4B86	/* special value used by W3M Map Protector */
+#define LIBMPQ_FLAG_PROTECTED		0x00000002	/* Set on protected MPQs (like W3M maps) */
+#define LIBMPQ_HASH_ENTRY_DELETED	0xFFFFFFFE	/* Block index for deleted hash entry */
+
+#define LIBMPQ_FILE_COMPRESS_PKWARE	0x00000100	/* Compression made by PKWARE Data Compression Library */
+#define LIBMPQ_FILE_COMPRESS_MULTI	0x00000200	/* Multiple compressions */
+#define LIBMPQ_FILE_COMPRESSED		0x0000FF00	/* File is compressed */
+#define LIBMPQ_FILE_EXISTS		0x80000000	/* Set if file exists, reset when the file was deleted */
+#define LIBMPQ_FILE_ENCRYPTED		0x00010000	/* Indicates whether file is encrypted */
+#define LIBMPQ_FILE_HAS_METADATA    0x04000000
+
+#define LIBMPQ_FILE_COMPRESSED_SIZE	1		/* MPQ compressed filesize of given file */
+#define LIBMPQ_FILE_UNCOMPRESSED_SIZE	2		/* MPQ uncompressed filesize of given file */
+#define LIBMPQ_FILE_COMPRESSION_TYPE	3		/* MPQ compression type of given file */
+#define LIBMPQ_FILE_TYPE_INT		4		/* file is given by number */
+#define LIBMPQ_FILE_TYPE_CHAR		5		/* file is given by name */
+
+#define LIBMPQ_MPQ_ARCHIVE_SIZE		1		/* MPQ archive size */
+#define LIBMPQ_MPQ_HASHTABLE_SIZE	2		/* MPQ archive hashtable size */
+#define LIBMPQ_MPQ_BLOCKTABLE_SIZE	3		/* MPQ archive blocktable size */
+#define LIBMPQ_MPQ_BLOCKSIZE		4		/* MPQ archive blocksize */
+#define LIBMPQ_MPQ_NUMFILES		5		/* Number of files in the MPQ archive */
+#define LIBMPQ_MPQ_COMPRESSED_SIZE	6		/* Compressed archive size */
+#define LIBMPQ_MPQ_UNCOMPRESSED_SIZE	7		/* Uncompressed archive size */
+
+#define LIBMPQ_HUFF_DECOMPRESS		0		/* Defines that we want to decompress using huffman trees. */
+
+#define LIBMPQ_CONF_EFILE_OPEN		-1		/* error if a specific listfile was forced and could not be opened. */
+#define LIBMPQ_CONF_EFILE_CORRUPT	-2		/* listfile seems to be corrupt */
+#define LIBMPQ_CONF_EFILE_LIST_CORRUPT	-3		/* listfile seems correct, but filelist is broken */
+#define LIBMPQ_CONF_EFILE_NOT_FOUND	-4		/* error if no matching listfile found */
+#define LIBMPQ_CONF_EFILE_VERSION	-5		/* libmpq version does not match required listfile version */
+
+#ifndef FALSE
+#define FALSE 0
+#endif
+#ifndef TRUE
+#define TRUE 1
+#endif
+
+/*
+#ifndef min
+#define min(a, b) ((a < b) ? a : b)
+#endif
+*/
+
+typedef unsigned int	mpq_buffer[LIBMPQ_TOOLS_BUFSIZE];
+typedef int		(*DECOMPRESS)(char *, int *, char *, int);
+typedef struct {
+	unsigned long	mask;		/* Decompression bit */
+	DECOMPRESS	decompress;	/* Decompression function */
+} decompress_table;
+
+/* MPQ file header */
+typedef struct {
+	unsigned int	id;		/* The 0x1A51504D ('MPQ\x1A') signature */
+	unsigned int	offset;		/* Offset of the first file (Relative to MPQ start) */
+	unsigned int	archivesize;	/* Size of MPQ archive */
+	unsigned short	offsetsc;	/* 0000 for SC and BW */
+	unsigned short	blocksize;	/* Size of file block is (0x200 << blockSize) */
+	unsigned int	hashtablepos;	/* File position of hashTable */
+	unsigned int	blocktablepos;	/* File position of blockTable. Each entry has 16 bytes */
+	unsigned int	hashtablesize;	/* Number of entries in hash table */
+	unsigned int	blocktablesize;	/* Number of entries in the block table */
+} mpq_header;
+//} __attribute__ ((packed)) mpq_header;
+
+
+/* Hash entry. All files in the archive are searched by their hashes. */
+typedef struct {
+	unsigned int	name1;		/* The first two unsigned ints */
+	unsigned int	name2;		/* are the encrypted file name */
+	unsigned int	locale;		/* Locale information. */
+	unsigned int	blockindex;	/* Index to file description block */
+} mpq_hash;
+
+/* File description block contains informations about the file */
+typedef struct {
+	unsigned int	filepos;	/* Block file starting position in the archive */
+	unsigned int	csize;		/* Compressed file size */
+	unsigned int	fsize;		/* Uncompressed file size */
+	unsigned int	flags;		/* Flags */
+} mpq_block;
+
+/* File handle structure used since Diablo 1.00 (0x38 bytes) */
+typedef struct {
+	unsigned char	filename[PATH_MAX];	/* filename of the actual file in the archive */
+	int		fd;		/* File handle */
+	unsigned int	seed;		/* Seed used for file decrypt */
+	unsigned int	filepos;	/* Current file position */
+	unsigned int	offset;
+	unsigned int	nblocks;	/* Number of blocks in the file (incl. the last noncomplete one) */
+	unsigned int	*blockpos;	/* Position of each file block (only for compressed files) */
+	int		blockposloaded;	/* TRUE if block positions loaded */
+	unsigned int	offset2;	/* (Number of bytes somewhere ?) */
+	mpq_hash	*mpq_h;		/* Hash table entry */
+	mpq_block	*mpq_b;		/* File block pointer */
+
+	/* Non-Storm.dll members */
+
+	unsigned int	accessed;	/* Was something from the file already read? */
+} mpq_file;
+
+/* List handle structure */
+typedef struct {
+	unsigned char	mpq_version[10];	/* libmpq version required by the listfile */
+	unsigned char	mpq_name[PATH_MAX];	/* mpq archive name without full path */
+	unsigned char	mpq_type[20];		/* mpq archive type */
+	unsigned char	mpq_game[40];		/* blizzard title the file matches */
+	unsigned char	mpq_game_version[10];	/* game version */
+	unsigned char	**mpq_files;		/* filelist */
+} mpq_list;
+
+/* Archive handle structure used since Diablo 1.00 */
+typedef struct {
+	unsigned char	filename[PATH_MAX];	/* Opened archive file name */
+	int		fd;		/* File handle */
+	unsigned int	blockpos;	/* Position of loaded block in the file */
+	unsigned int	blocksize;	/* Size of file block */
+	unsigned char	*blockbuf;	/* Buffer (cache) for file block */
+	unsigned int	bufpos;		/* Position in block buffer */
+	unsigned int	mpqpos;		/* MPQ archive position in the file */
+	unsigned int	filepos;	/* Current file pointer */
+	unsigned int	openfiles;	/* Number of open files + 1 */
+	mpq_buffer	buf;		/* MPQ buffer */
+	mpq_header	*header;	/* MPQ file header */
+	mpq_hash	*hashtable;	/* Hash table */
+	mpq_block	*blocktable;	/* Block table */
+
+	/* Non-Storm.dll members */
+
+	mpq_list	*mpq_l;		/* Handle to file list from database */
+
+	unsigned int	flags;		/* See LIBMPQ_TOOLS_FLAG_XXXXX */
+	unsigned int	maxblockindex;	/* The highest block table entry */
+} mpq_archive;
+
+extern char *libmpq_version();
+extern int libmpq_archive_open(mpq_archive *mpq_a, unsigned char *mpq_filename);
+extern int libmpq_archive_close(mpq_archive *mpq_a);
+extern int libmpq_archive_info(mpq_archive *mpq_a, unsigned int infotype);
+//extern int libmpq_file_extract(mpq_archive *mpq_a, const int number);
+extern int libmpq_file_info(mpq_archive *mpq_a, unsigned int infotype, const int number);
+extern char *libmpq_file_name(mpq_archive *mpq_a, const int number);
+extern int libmpq_file_number(mpq_archive *mpq_a, const char *name);
+extern int libmpq_file_check(mpq_archive *mpq_a, void *file, int type);
+extern int libmpq_listfile_open(mpq_archive *mpq_a, char file[PATH_MAX]);
+extern int libmpq_listfile_close(mpq_archive *mpq_a);
+
+extern int libmpq_pkzip_decompress(char *out_buf, int *out_length, char *in_buf, int in_length);
+extern int libmpq_zlib_decompress(char *out_buf, int *out_length, char *in_buf, int in_length);
+extern int libmpq_huff_decompress(char *out_buf, int *out_length, char *in_buf, int in_length);
+extern int libmpq_wave_decompress_stereo(char *out_buf, int *out_length, char *in_buf, int in_length);
+extern int libmpq_wave_decompress_mono(char *out_buf, int *out_length, char *in_buf, int in_length);
+extern int libmpq_multi_decompress(char *out_buf, int *pout_length, char *in_buf, int in_length);
+
+static decompress_table dcmp_table[] = {
+	{0x08, libmpq_pkzip_decompress},		/* Decompression with Pkware Data Compression Library */
+	{0x02, libmpq_zlib_decompress},			/* Decompression with the "zlib" library */
+	{0x01, libmpq_huff_decompress},			/* Huffmann decompression */
+	{0x80, libmpq_wave_decompress_stereo},		/* WAVE decompression for stereo waves */
+	{0x40, libmpq_wave_decompress_mono}		/* WAVE decompression for mono waves */
+};
+
+int libmpq_file_extract(mpq_archive *mpq_a, const int number, const char *filename);
+int libmpq_file_getdata(mpq_archive *mpq_a, mpq_hash mpq_h, const int number, unsigned char *dest);
+#endif					/* _MPQ_H */
diff --git a/contrib/extractor/libmpq/parser.cpp b/contrib/extractor/libmpq/parser.cpp
new file mode 100644
index 00000000000..b7a70400f5a
--- /dev/null
+++ b/contrib/extractor/libmpq/parser.cpp
@@ -0,0 +1,294 @@
+/*
+ *  parser.c -- functions used to parse list or config file.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ *
+ *  $Id: parser.c,v 1.5 2004/02/12 00:47:53 mbroemme Exp $
+ */
+#define _CRT_SECURE_NO_DEPRECATE
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+#include "mpq.h"
+#include "common.h"
+#include <ctype.h>
+
+/*
+ *  This function deletes the specified characters, but leaves
+ *  escape sequences unaffected. This means that " would be
+ *  deleted but \" would not.
+ */
+char *libmpq_conf_delete_char(char *buf, char *chars) {
+	static char *temp;
+	char ch;
+
+	temp = buf;
+
+	/* strip out special chars like " */
+	while (temp = strpbrk(temp, chars)) {
+		ch = temp[0];
+		memmove(&temp[0], &temp[1], strlen(temp));
+		if (ch == '\\') {
+			temp++;
+		}
+	}
+
+	return buf;
+}
+
+/*
+ *  This function parses a line for the value to the given option. It
+ *  return 1 on success and the byte array or 0 and null.
+ */
+int libmpq_conf_parse_line(char *line, char *search_value, char *return_value, int size) {
+	int level = 0;
+	int found = 0;
+	int i = 0;
+	int pos = 0;
+
+	/* search value */
+	while (*(++line)) {
+
+		/* check for spaces */
+		if (!isspace(*line) && level == 1) {
+
+			/* we found our value so break */
+			found = 1;
+			break;
+		}
+
+		/* check for '=' so the value follows as next parameter */
+		if (*line == '=' && level == 0) {
+			level = 1;
+		}
+	}
+
+	/* now search for comment in this line */
+	for (i = 0; i < strlen(line); i++) {
+		if (line[i] == '#') {
+			pos = i - 1;
+			break;
+		}
+	}
+
+	/* now set end of byte array behind value, but only if comment was found */
+	if (pos != 0) {
+		for (i = pos; i >= 0; i--) {
+			if (line[i] != ' ' && line[i] != '\t') {
+				line[i + 1] = '\0';
+				break;
+			}
+		}
+	}
+
+	/* now check if line has trailing spaces */
+	for (i = strlen(line); i >= 0; i--) {
+		if (line[i] != ' ' && line[i] != '\t') {
+			line[i + 1] = '\0';
+			break;
+		}
+	}
+
+	/* now check if value is quoted with "" and if there is a char behind. */
+	for (i = strlen(line); i >= 0; i--) {
+		if (line[i] == '"') {
+			line[i + 1] = '\0';
+			break;
+		}
+	}
+
+	/* return the values */
+	strncpy(return_value, line, size);
+	return found;
+}
+
+/*
+ *  This function returns the value for a given option in the
+ *  listdb or config file. On success it returns 1, otherwise 0.
+ */
+int libmpq_conf_get_value(FILE *fp, char *search_value, void *return_value, int type, int size) {
+	char buf[LIBMPQ_CONF_BUFSIZE];
+	int found = 0;
+	int result = LIBMPQ_TOOLS_SUCCESS;
+
+	while (fgets(buf, LIBMPQ_CONF_BUFSIZE, fp) != NULL) {
+		char *line;
+
+		buf[strlen(buf) - 1] = '\0';
+
+		/* skip whitespace */
+		for (line = buf; isspace(*line); line++) {
+			continue;
+		}
+
+		/* skip empty line */
+		if (line[0] == '\0') {
+			continue;
+		}
+
+		/* skip comments */
+		if (line[0] == '#') {
+			continue;
+		}
+
+		/* process the line */
+		//if (!strncasecmp(line, search_value, strlen(search_value))) {
+        if (!strcmp(line, search_value)) {
+			found = libmpq_conf_parse_line(line, search_value, line, LIBMPQ_CONF_BUFSIZE);
+			if (found == 1) {
+				libmpq_conf_delete_char(line, "\"\\");
+
+				switch (type) {
+					case LIBMPQ_CONF_TYPE_INT:
+
+						/* if it is no valid number it is safe to return 0 */
+						*(int *)return_value = atoi(line);
+						break;
+					default:
+						strncpy((char *)return_value, line, size);
+						break;
+				}
+
+				/* value found, so rewind stream */
+				break;
+			}
+		}
+	}
+
+	/* if value was not found */
+	if (found == 0) {
+		switch (type) {
+			case LIBMPQ_CONF_TYPE_INT:
+				*(int *)return_value = 0;
+				result = LIBMPQ_CONF_EVALUE_NOT_FOUND;
+				break;
+			default:
+				strncpy((char *)return_value, "", size);
+				result = LIBMPQ_CONF_EVALUE_NOT_FOUND;
+				break;
+		}
+	}
+	fseek(fp, 0L, SEEK_SET);
+
+	return result;
+}
+
+/*
+ *  This function returns a pointer to a byte array, with all values
+ *  found in the config file. As second value it returns th number of
+ *  entries in the byte array. On success it returns 1, otherwise 0.
+ */
+int libmpq_conf_get_array(FILE *fp, char *search_value, char ***filelist, int *entries) {
+	char buf[LIBMPQ_CONF_BUFSIZE];
+	char temp[LIBMPQ_CONF_BUFSIZE];
+	int level = 0;
+	int array_start = 0;
+	int array_end = 0;
+	int fl_count;
+	int fl_size;
+	int found = 0;
+	int i = 0;
+
+	*entries = 0;
+
+	/* allocate memory for the file list */
+	(*filelist) = (char **)malloc(LIBMPQ_CONF_FL_INCREMENT * sizeof(char *));
+	fl_count = 0;
+	fl_size = LIBMPQ_CONF_FL_INCREMENT;
+
+	while (fgets(buf, LIBMPQ_CONF_BUFSIZE, fp) != NULL) {
+		char *line;
+
+		buf[strlen(buf) - 1] = '\0';
+
+		/* skip whitespace */
+		for (line = buf; isspace(*line); line++) {
+			continue;
+		}
+
+		/* skip empty line */
+		if (line[0] == '\0') {
+			continue;
+		}
+
+		/* skip comments */
+		if (line[0] == '#') {
+			continue;
+		}
+
+		/* check for array end ) */
+		if (*line == ')') {
+			array_end = 1;
+			break;
+		}
+
+		/* process entries between () */
+		if (array_start == 1 && array_end == 0) {
+
+			/* add dummy option to use with libmpq_conf_parse_line() */
+			strncpy(temp, "MPQ_BUFFER = ", LIBMPQ_CONF_BUFSIZE);
+			strncat(temp, line, LIBMPQ_CONF_BUFSIZE);
+			found = libmpq_conf_parse_line(temp, "MPQ_BUFFER", temp, LIBMPQ_CONF_BUFSIZE);
+
+			if (found == 1) {
+				libmpq_conf_delete_char(temp, "\"\\");
+
+				/* set the next filelist entry to a copy of the file */
+				(*filelist)[fl_count++] = _strdup(temp);
+
+				/* increase the array size */
+				if (fl_count == fl_size) {
+					(*filelist) = (char **)realloc((*filelist), (fl_size + LIBMPQ_CONF_FL_INCREMENT) * sizeof(char *));
+					fl_size += LIBMPQ_CONF_FL_INCREMENT;
+				}
+
+				/* increase number of entries */
+				(*entries)++;
+			}
+		}
+
+		/* process the line and search array start */
+		//if (!strncasecmp(line, search_value, strlen(search_value))) {
+        if (!strcmp(line, search_value)) {
+
+			/* search value */
+			while (*(++line)) {
+
+				/* check for array start ( */
+				if (*line == '(' && level == 1) {
+
+					/* we found our value so break */
+					array_start = 1;
+					break;
+				}
+
+				/* check for '=' so the value follows as next parameter */
+				if (*line == '=' && level == 0) {
+					level = 1;
+				}
+			}
+		}
+	}
+
+	/* we got all files, so rewind stream */
+	fseek(fp, 0L, SEEK_SET);
+
+	(*filelist)[fl_count] = NULL;
+
+	return found;
+}
diff --git a/contrib/extractor/libmpq/wave.cpp b/contrib/extractor/libmpq/wave.cpp
new file mode 100644
index 00000000000..8edc1f7fa41
--- /dev/null
+++ b/contrib/extractor/libmpq/wave.cpp
@@ -0,0 +1,185 @@
+/*
+ *  wave.c -- this file contains decompression methods used by Storm.dll
+ *            to decompress wave files.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This source was adepted from the C++ version of wave.cpp included
+ *  in stormlib. The C++ version belongs to the following authors,
+ *
+ *  Ladislav Zezula <ladik.zezula.net>
+ *  Tom Amigo <tomamigo@apexmail.com>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ */
+
+#include "wave.h"
+
+/* Tables necessary dor decompression */
+static unsigned long wave_table_1503f120[] = {
+	0xFFFFFFFF, 0x00000000, 0xFFFFFFFF, 0x00000004, 0xFFFFFFFF, 0x00000002, 0xFFFFFFFF, 0x00000006,
+	0xFFFFFFFF, 0x00000001, 0xFFFFFFFF, 0x00000005, 0xFFFFFFFF, 0x00000003, 0xFFFFFFFF, 0x00000007,
+	0xFFFFFFFF, 0x00000001, 0xFFFFFFFF, 0x00000005, 0xFFFFFFFF, 0x00000003, 0xFFFFFFFF, 0x00000007,  
+	0xFFFFFFFF, 0x00000002, 0xFFFFFFFF, 0x00000004, 0xFFFFFFFF, 0x00000006, 0xFFFFFFFF, 0x00000008  
+};
+
+static unsigned long wave_table_1503f1a0[] = {
+	0x00000007, 0x00000008, 0x00000009, 0x0000000A, 0x0000000B, 0x0000000C, 0x0000000D, 0x0000000E,
+	0x00000010, 0x00000011, 0x00000013, 0x00000015, 0x00000017, 0x00000019, 0x0000001C, 0x0000001F,
+	0x00000022, 0x00000025, 0x00000029, 0x0000002D, 0x00000032, 0x00000037, 0x0000003C, 0x00000042,
+	0x00000049, 0x00000050, 0x00000058, 0x00000061, 0x0000006B, 0x00000076, 0x00000082, 0x0000008F,
+	0x0000009D, 0x000000AD, 0x000000BE, 0x000000D1, 0x000000E6, 0x000000FD, 0x00000117, 0x00000133,
+	0x00000151, 0x00000173, 0x00000198, 0x000001C1, 0x000001EE, 0x00000220, 0x00000256, 0x00000292,
+	0x000002D4, 0x0000031C, 0x0000036C, 0x000003C3, 0x00000424, 0x0000048E, 0x00000502, 0x00000583,
+	0x00000610, 0x000006AB, 0x00000756, 0x00000812, 0x000008E0, 0x000009C3, 0x00000ABD, 0x00000BD0,
+	0x00000CFF, 0x00000E4C, 0x00000FBA, 0x0000114C, 0x00001307, 0x000014EE, 0x00001706, 0x00001954,
+	0x00001BDC, 0x00001EA5, 0x000021B6, 0x00002515, 0x000028CA, 0x00002CDF, 0x0000315B, 0x0000364B,
+	0x00003BB9, 0x000041B2, 0x00004844, 0x00004F7E, 0x00005771, 0x0000602F, 0x000069CE, 0x00007462,
+	0x00007FFF
+};
+
+/*
+ *  Decompress a wave file, mono or stereo
+ *
+ *  Offset: 1500F230
+ */
+int libmpq_wave_decompress(unsigned char *out_buf, int out_length, unsigned char *in_buf, int in_length, int channels) {
+	byte_and_short out;
+	byte_and_short in;
+	unsigned char *in_end = in_buf + in_length;	/* End on input buffer */
+	unsigned long index;
+	long nr_array1[2];
+	long nr_array2[2];
+	int count = 0;
+
+	out.pb     = out_buf;
+	in.pb      = in_buf;
+	nr_array1[0] = 0x2C;
+	nr_array1[1] = 0x2C;
+	in.pw++;
+
+	/* 15007AD7 */
+	for (count = 0; count < channels; count++) {
+		long temp;
+		temp = *(short *)in.pw++;
+		nr_array2[count] = temp;
+		if (out_length < 2) {
+			return out.pb - out_buf;
+		}
+		*out.pw++   = (unsigned short)temp;
+		out_length -= 2;
+	}
+	index = channels - 1;
+	while (in.pb < in_end) {
+		unsigned char one_byte = *in.pb++;
+		if (channels == 2) {
+			index = (index == 0) ? 1 : 0;
+		}
+
+		/*
+		 * Get one byte from input buffer
+		 * 15007B25
+		 */
+		if (one_byte & 0x80) {
+			/* 15007B32 */
+			switch(one_byte & 0x7F) {
+				case 0:					/* 15007B8E */
+					if (nr_array1[index] != 0) {
+						nr_array1[index]--;
+					}
+					if (out_length < 2) {
+						break;
+					}
+					*out.pw++ = (unsigned short)nr_array2[index];
+					out_length -= 2;
+					continue;
+				case 1:					/* 15007B72 */
+					nr_array1[index] += 8;		/* EBX also */
+					if (nr_array1[index] > 0x58) {
+						nr_array1[index] = 0x58;
+					}
+					if (channels == 2) {
+						index = (index == 0) ? 1 : 0;
+					}
+					continue;
+				case 2:
+					continue;
+				default:
+					nr_array1[index] -= 8;
+					if (nr_array1[index] < 0) {
+						nr_array1[index] = 0;
+					}
+					if (channels != 2) {
+						continue;
+					}
+					index = (index == 0) ? 1 : 0;
+					continue;
+			}
+		} else {
+			unsigned long temp1 = wave_table_1503f1a0[nr_array1[index]];	/* EDI */
+			unsigned long temp2 = temp1 >> in_buf[1];	/* ESI */
+			long temp3 = nr_array2[index];			/* ECX */
+			if (one_byte & 0x01) {				/* EBX = one_byte */
+				temp2 += (temp1 >> 0);
+			}
+			if (one_byte & 0x02) {
+				temp2 += (temp1 >> 1);
+			}
+			if (one_byte & 0x04) {
+				temp2 += (temp1 >> 2);
+			}
+			if (one_byte & 0x08) {
+				temp2 += (temp1 >> 3);
+			}
+			if (one_byte & 0x10) {
+				temp2 += (temp1 >> 4);
+			}
+			if (one_byte & 0x20) {
+				temp2 += (temp1 >> 5);
+			}
+			if(one_byte & 0x40) {
+				temp3 -= temp2;
+				if (temp3 <= (long)0xFFFF8000) {
+					temp3 = (long)0xFFFF8000;
+				}
+			} else {
+				temp3 += temp2;
+				if (temp3 >= 0x7FFF) {
+					temp3 = 0x7FFF;
+				}
+			}
+			nr_array2[index] = temp3;
+			if (out_length < 2) {
+				break;
+			}
+
+			temp2 = nr_array1[index];
+			one_byte &= 0x1F;
+			*out.pw++ = (unsigned short)temp3;
+			out_length -= 2;
+			temp2 += wave_table_1503f120[one_byte];
+			nr_array1[index] = temp2;
+
+			if (nr_array1[index] < 0) {
+				nr_array1[index] = 0;
+			} else {
+				if (nr_array1[index] > 0x58) {
+					nr_array1[index] = 0x58;
+				}
+			}
+		}
+	}
+	return (out.pb - out_buf);
+}
diff --git a/contrib/extractor/libmpq/wave.h b/contrib/extractor/libmpq/wave.h
new file mode 100644
index 00000000000..8920880a04f
--- /dev/null
+++ b/contrib/extractor/libmpq/wave.h
@@ -0,0 +1,37 @@
+/*
+ *  wave.h -- header file for WAVe unplode functions used by mpq-tools.
+ *
+ *  Copyright (C) 2003 Maik Broemme <mbroemme@plusserver.de>
+ *
+ *  This source was adepted from the C++ version of wave.h included
+ *  in stormlib. The C++ version belongs to the following authors,
+ *
+ *  Ladislav Zezula <ladik.zezula.net>
+ *  Tom Amigo <tomamigo@apexmail.com>
+ *
+ *  This program is free software; you can redistribute it and/or modify
+ *  it under the terms of the GNU General Public License as published by
+ *  the Free Software Foundation; either version 2 of the License, or
+ *  (at your option) any later version.
+ *
+ *  This program is distributed in the hope that it will be useful,
+ *  but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+ *  GNU General Public License for more details.
+ *
+ *  You should have received a copy of the GNU General Public License
+ *  along with this program; if not, write to the Free Software
+ *  Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
+ */       
+
+#ifndef _WAVE_H
+#define _WAVE_H
+
+typedef union {
+	unsigned short	*pw;
+	unsigned char	*pb;
+} byte_and_short;
+
+int libmpq_wave_decompress(unsigned char *out_buf, int out_length, unsigned char *in_buf, int in_length, int channels);
+
+#endif					/* _WAVE_H */
diff --git a/contrib/extractor/libmpq/zconf.h b/contrib/extractor/libmpq/zconf.h
new file mode 100644
index 00000000000..3cea897eda7
--- /dev/null
+++ b/contrib/extractor/libmpq/zconf.h
@@ -0,0 +1,323 @@
+/* zconf.h -- configuration of the zlib compression library
+ * Copyright (C) 1995-2003 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 deflatePrime  z_deflatePrime
+#  define deflateParams z_deflateParams
+#  define deflateBound  z_deflateBound
+#  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 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 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__)) && !defined(WIN32)
+#  define WIN32
+#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/contrib/extractor/libmpq/zlib.h b/contrib/extractor/libmpq/zlib.h
new file mode 100644
index 00000000000..92edf96ff3e
--- /dev/null
+++ b/contrib/extractor/libmpq/zlib.h
@@ -0,0 +1,1200 @@
+/* zlib.h -- interface of the 'zlib' general purpose compression library
+  version 1.2.1, November 17th, 2003
+
+  Copyright (C) 1995-2003 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.1"
+#define ZLIB_VERNUM 0x1210
+
+/*
+     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 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.
+
+     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.
+
+     This library does not provide any functions to write gzip files in memory.
+  However such functions could be easily written using zlib's deflate function,
+  the documentation in the gzip RFC, and the examples in gzio.c.
+
+     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: ascii or binary */
+    uLong   adler;      /* adler32 value of the uncompressed data */
+    uLong   reserved;   /* reserved for future use */
+} z_stream;
+
+typedef z_stream FAR *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.
+
+   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_DEFAULT_STRATEGY    0
+/* compression strategy; see deflateInit2() below for details */
+
+#define Z_BINARY   0
+#define Z_ASCII    1
+#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.
+
+    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
+  the 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 data_type if it can make a good guess about
+  the input data type (Z_ASCII or Z_BINARY). 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 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.
+
+    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).
+
+     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.
+
+      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.
+
+     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 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 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).
+
+     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 negative
+   memLevel). 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 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 (see deflateSetDictionary).
+
+     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 inflateBackInit OF((z_stream FAR *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_stream FAR *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_stream FAR *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    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 crc32   OF((uLong crc, const Bytef *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();
+*/
+
+
+                        /* 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_stream FAR *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 err));
+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/contrib/extractor/mpq_libmpq.cpp b/contrib/extractor/mpq_libmpq.cpp
new file mode 100644
index 00000000000..98d114c572f
--- /dev/null
+++ b/contrib/extractor/mpq_libmpq.cpp
@@ -0,0 +1,133 @@
+#include "mpq_libmpq.h"
+#include <deque>
+
+ArchiveSet gOpenArchives;
+
+MPQArchive::MPQArchive(const char* filename)
+{
+    int result = libmpq_archive_open(&mpq_a, (unsigned char*)filename);
+    printf("Opening %s\n", filename);
+    if(result) {
+        switch(result) {
+            case LIBMPQ_EFILE :                   /* error on file operation */
+                printf("Error opening archive '%s': File operation Error\n", filename);
+                break;
+            case LIBMPQ_EFILE_FORMAT :            /* bad file format */
+                printf("Error opening archive '%s': Bad file format\n", filename);
+                break;
+            case LIBMPQ_EFILE_CORRUPT :           /* file corrupt */
+                printf("Error opening archive '%s': File corrupt\n", filename);
+                break;
+            case LIBMPQ_EFILE_NOT_FOUND :         /* file in archive not found */
+                printf("Error opening archive '%s': File in archive not found\n", filename);
+                break;
+            case LIBMPQ_EFILE_READ :              /* Read error in archive */
+                printf("Error opening archive '%s': Read error in archive\n", filename);
+                break;
+            case LIBMPQ_EALLOCMEM :               /* maybe not enough memory? :) */
+                printf("Error opening archive '%s': Maybe not enough memory\n", filename);
+                break;
+            case LIBMPQ_EFREEMEM :                /* can not free memory */
+                printf("Error opening archive '%s': Cannot free memory\n", filename);
+                break;
+            case LIBMPQ_EINV_RANGE :              /* Given filenumber is out of range */
+                printf("Error opening archive '%s': Given filenumber is out of range\n", filename);
+                break;
+            case LIBMPQ_EHASHTABLE :              /* error in reading hashtable */
+                printf("Error opening archive '%s': Error in reading hashtable\n", filename);
+                break;
+            case LIBMPQ_EBLOCKTABLE :             /* error in reading blocktable */
+                printf("Error opening archive '%s': Error in reading blocktable\n", filename);
+                break;
+            default:
+                printf("Error opening archive '%s': Unknown error\n", filename);
+                break;
+        }
+        return;
+    }
+    gOpenArchives.push_front(this);
+}
+
+void MPQArchive::close()
+{
+    //gOpenArchives.erase(erase(&mpq_a);
+    libmpq_archive_close(&mpq_a);
+}
+
+MPQFile::MPQFile(const char* filename):
+    eof(false),
+    buffer(0),
+    pointer(0),
+    size(0)
+{
+    for(ArchiveSet::iterator i=gOpenArchives.begin(); i!=gOpenArchives.end();++i)
+    {
+        mpq_archive &mpq_a = (*i)->mpq_a;
+
+        mpq_hash hash = (*i)->GetHashEntry(filename);
+        uint32 blockindex = hash.blockindex;
+
+        if ((blockindex == 0xFFFFFFFF) || (blockindex == 0)) {
+            continue; //file not found
+        }
+
+        int fileno = blockindex;
+
+        //int fileno = libmpq_file_number(&mpq_a, filename);
+        //if(fileno == LIBMPQ_EFILE_NOT_FOUND)
+        //    continue;
+
+        // Found!
+        size = libmpq_file_info(&mpq_a, LIBMPQ_FILE_UNCOMPRESSED_SIZE, fileno);
+        // HACK: in patch.mpq some files don't want to open and give 1 for filesize
+        if (size<=1) {
+            eof = true;
+            buffer = 0;
+            return;
+        }
+        buffer = new char[size];
+
+        //libmpq_file_getdata
+        libmpq_file_getdata(&mpq_a, hash, fileno, (unsigned char*)buffer);
+        return;
+
+    }
+    eof = true;
+    buffer = 0;
+}
+
+size_t MPQFile::read(void* dest, size_t bytes)
+{
+    if (eof) return 0;
+
+    size_t rpos = pointer + bytes;
+    if (rpos > size) {
+        bytes = size - pointer;
+        eof = true;
+    }
+
+    memcpy(dest, &(buffer[pointer]), bytes);
+
+    pointer = rpos;
+
+    return bytes;
+}
+
+void MPQFile::seek(int offset)
+{
+    pointer = offset;
+    eof = (pointer >= size);
+}
+
+void MPQFile::seekRelative(int offset)
+{
+    pointer += offset;
+    eof = (pointer >= size);
+}
+
+void MPQFile::close()
+{
+    if (buffer) delete[] buffer;
+    buffer = 0;
+    eof = true;
+}
diff --git a/contrib/extractor/mpq_libmpq.h b/contrib/extractor/mpq_libmpq.h
new file mode 100644
index 00000000000..542e7b21d17
--- /dev/null
+++ b/contrib/extractor/mpq_libmpq.h
@@ -0,0 +1,124 @@
+#define _CRT_SECURE_NO_DEPRECATE
+#define _CRT_SECURE_NO_WARNINGS
+
+#ifndef MPQ_H
+#define MPQ_H
+
+#include "libmpq/mpq.h"
+#include <string.h>
+#include <ctype.h>
+#include <vector>
+#include <iostream>
+#include <deque>
+
+using namespace std;
+
+typedef unsigned int uint32;
+class MPQArchive
+{
+
+public:
+    mpq_archive mpq_a;
+
+    MPQArchive(const char* filename);
+    void close();
+
+    uint32 HashString(const char* Input, uint32 Offset) {
+        uint32 seed1 = 0x7fed7fed;
+        uint32 seed2 = 0xeeeeeeee;
+
+        for (uint32 i = 0; i < strlen(Input); i++) {
+            uint32 val = toupper(Input[i]);
+            seed1 = mpq_a.buf[Offset + val] ^ (seed1 + seed2);
+            seed2 = val + seed1 + seed2 + (seed2 << 5) + 3;
+        }
+
+        return seed1;
+    }
+    mpq_hash GetHashEntry(const char* Filename) {
+        uint32 index = HashString(Filename, 0);
+        index &= mpq_a.header->hashtablesize - 1;
+        uint32 name1 = HashString(Filename, 0x100);
+        uint32 name2 = HashString(Filename, 0x200);
+
+        for(uint32 i = index; i < mpq_a.header->hashtablesize; ++i) {
+            mpq_hash hash = mpq_a.hashtable[i];
+            if (hash.name1 == name1 && hash.name2 == name2) return hash;
+        }
+
+        mpq_hash nullhash;
+        nullhash.blockindex = 0xFFFFFFFF;
+        return nullhash;
+    }
+
+    vector<string> GetFileList() {
+        vector<string> filelist;
+
+        mpq_hash hash = GetHashEntry("(listfile)");
+        uint32 blockindex = hash.blockindex;
+
+        if ((blockindex == 0xFFFFFFFF) || (blockindex == 0))
+            return filelist;
+
+        uint32 size = libmpq_file_info(&mpq_a, LIBMPQ_FILE_UNCOMPRESSED_SIZE, blockindex);
+        char *buffer = new char[size];
+
+        libmpq_file_getdata(&mpq_a, hash, blockindex, (unsigned char*)buffer);
+
+        char seps[] = "\n";
+        char *token;
+
+        token = strtok( buffer, seps );
+        uint32 counter = 0;
+        while ((token != NULL) && (counter < size)) {
+            //cout << token << endl;
+            token[strlen(token) - 1] = 0;
+            string s = token;
+            filelist.push_back(s);
+            counter += strlen(token) + 2;
+            token = strtok(NULL, seps);
+        }
+
+        delete buffer;
+        return filelist;
+    }
+};
+typedef std::deque<MPQArchive*> ArchiveSet;
+
+class MPQFile
+{
+    //MPQHANDLE handle;
+    bool eof;
+    char *buffer;
+    size_t pointer,size;
+
+    // disable copying
+    MPQFile(const MPQFile &f) {}
+    void operator=(const MPQFile &f) {}
+
+public:
+    MPQFile(const char* filename);    // filenames are not case sensitive
+    ~MPQFile() { close(); }
+    size_t read(void* dest, size_t bytes);
+    size_t getSize() { return size; }
+    size_t getPos() { return pointer; }
+    char* getBuffer() { return buffer; }
+    char* getPointer() { return buffer + pointer; }
+    bool isEof() { return eof; }
+    void seek(int offset);
+    void seekRelative(int offset);
+    void close();
+};
+
+inline void flipcc(char *fcc)
+{
+    char t;
+    t=fcc[0];
+    fcc[0]=fcc[3];
+    fcc[3]=t;
+    t=fcc[1];
+    fcc[1]=fcc[2];
+    fcc[2]=t;
+}
+
+#endif
diff --git a/contrib/extractor/release/zlib.lib b/contrib/extractor/release/zlib.lib
new file mode 100644
index 00000000000..42dded3ce23
--- /dev/null
+++ b/contrib/extractor/release/zlib.lib
diff --git a/contrib/vmap_assembler/VC71/vmap_assembler.vcproj b/contrib/vmap_assembler/VC71/vmap_assembler.vcproj
new file mode 100644
index 00000000000..aaaeb4dfc3c
--- /dev/null
+++ b/contrib/vmap_assembler/VC71/vmap_assembler.vcproj
@@ -0,0 +1,322 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="7.10"
+	Name="vmap_assembler"
+	ProjectGUID="{572FFF74-480C-4472-8ABF-81733BB4049D}"
+	Keyword="Win32Proj">
+	<Platforms>
+		<Platform
+			Name="Win32"/>
+	</Platforms>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="..\Debug"
+			IntermediateDirectory="..\Debug\obj"
+			ConfigurationType="1"
+			CharacterSet="2">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..\dep\include\g3dlite; ..\..\..\src\shared\vmap"
+				PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
+				MinimalRebuild="TRUE"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="TRUE"
+				DebugInformationFormat="4"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/vmap_assembler.exe"
+				LinkIncremental="2"
+				GenerateDebugInformation="TRUE"
+				ProgramDatabaseFile="$(OutDir)/vmap_assembler.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="VCXMLDataGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+			<Tool
+				Name="VCManagedWrapperGeneratorTool"/>
+			<Tool
+				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
+		</Configuration>
+		<Configuration
+			Name="Release|Win32"
+			OutputDirectory="..\Release"
+			IntermediateDirectory="..\Release\obj"
+			ConfigurationType="1"
+			CharacterSet="2">
+			<Tool
+				Name="VCCLCompilerTool"
+				AdditionalIncludeDirectories="..\..\..\dep\include\g3dlite; ..\..\..\src\shared\vmap"
+				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
+				RuntimeLibrary="0"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="TRUE"
+				DebugInformationFormat="3"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/vmap_assembler.exe"
+				LinkIncremental="1"
+				GenerateDebugInformation="TRUE"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				TargetMachine="1"/>
+			<Tool
+				Name="VCMIDLTool"/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+			<Tool
+				Name="VCManagedWrapperGeneratorTool"/>
+			<Tool
+				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
+			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}">
+			<File
+				RelativePath=".\..\vmap_assembler.cpp">
+			</File>
+		</Filter>
+		<Filter
+			Name="vmaplib">
+			<File
+				RelativePath="..\..\..\src\shared\vmap\AABSPTree.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\BaseModel.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\BaseModel.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\CoordModelMapping.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\CoordModelMapping.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\DebugCmdLogger.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\DebugCmdLogger.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ManagedModelContainer.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ManagedModelContainer.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ModelContainer.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ModelContainer.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\NodeValueAccess.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ShortBox.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ShortVector.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\SubModel.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\SubModel.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TileAssembler.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TileAssembler.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TreeNode.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TreeNode.h">
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\VMapTools.h">
+			</File>
+		</Filter>
+		<Filter
+			Name="g3dlite">
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\AABox.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\AABox.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\AABSPTree.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Array.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Box.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Box.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\CollisionDetection.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\CoordinateFrame.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Crypto.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Crypto.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\debug.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\format.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\format.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\g3dmath.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\g3dmath.inl">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\GCamera.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Line.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Matrix3.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Matrix3.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Plane.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Plane.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\platform.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Quat.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Quat.inl">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Ray.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\RegistryUtil.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Sphere.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\stringutils.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\System.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\System.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Table.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Triangle.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Triangle.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector2.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector2.inl">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector2int16.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Vector3.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector3.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector3.inl">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector3int16.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Vector4.cpp">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector4.h">
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector4.inl">
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/contrib/vmap_assembler/VC80/vmap_assembler.vcproj b/contrib/vmap_assembler/VC80/vmap_assembler.vcproj
new file mode 100644
index 00000000000..3b3a58a05aa
--- /dev/null
+++ b/contrib/vmap_assembler/VC80/vmap_assembler.vcproj
@@ -0,0 +1,456 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8,00"
+	Name="vmap_assembler"
+	ProjectGUID="{572FFF74-480C-4472-8ABF-81733BB4049D}"
+	Keyword="Win32Proj"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="..\Debug"
+			IntermediateDirectory="..\Debug\obj"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories="..\..\..\dep\include\g3dlite;..\..\..\src\shared\vmap;"
+				PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				EnableEnhancedInstructionSet="1"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/vmap_assembler.exe"
+				LinkIncremental="2"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/vmap_assembler.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="Release|Win32"
+			OutputDirectory="..\Release"
+			IntermediateDirectory="..\Release\obj"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				AdditionalIncludeDirectories="..\..\..\dep\include\g3dlite;..\..\..\src\shared\vmap;"
+				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE"
+				RuntimeLibrary="0"
+				EnableEnhancedInstructionSet="1"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/vmap_assembler.exe"
+				LinkIncremental="1"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				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>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
+			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}"
+			>
+			<File
+				RelativePath=".\..\vmap_assembler.cpp"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="vmaplib"
+			>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\AABSPTree.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\BaseModel.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\BaseModel.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\CoordModelMapping.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\CoordModelMapping.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\DebugCmdLogger.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\DebugCmdLogger.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ManagedModelContainer.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ManagedModelContainer.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ModelContainer.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ModelContainer.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\NodeValueAccess.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ShortBox.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ShortVector.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\SubModel.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\SubModel.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TileAssembler.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TileAssembler.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TreeNode.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TreeNode.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\VMapTools.h"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="g3dlite"
+			>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\AABox.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\AABox.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\AABSPTree.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Array.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Box.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Box.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\CollisionDetection.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\CoordinateFrame.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Crypto.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Crypto.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\debug.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\format.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\format.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\g3dmath.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\g3dmath.inl"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\GCamera.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Line.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Matrix3.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Matrix3.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Plane.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Plane.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\platform.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Quat.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Quat.inl"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Ray.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\RegistryUtil.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Sphere.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\stringutils.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\System.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\System.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Table.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Triangle.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Triangle.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector2.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector2.inl"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector2int16.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Vector3.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector3.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector3.inl"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector3int16.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\src\g3dlite\Vector4.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector4.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\dep\include\g3dlite\G3D\Vector4.inl"
+				>
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/contrib/vmap_assembler/splitConfig.txt b/contrib/vmap_assembler/splitConfig.txt
new file mode 100644
index 00000000000..de8fd67bdc4
--- /dev/null
+++ b/contrib/vmap_assembler/splitConfig.txt
@@ -0,0 +1,17 @@
+# list of map names
+
+509 #AhnQiraj  
+469 #BlackwingLair
+189 #MonasteryInstances
+030 #PVPZone01
+037 #PVPZone02
+033 #Shadowfang
+533 #Stratholme Raid
+209 #TanarisInstance
+309 #Zul'gurub
+560 #HillsbradPast
+534 #HyjalPast
+532 #Karazahn
+543 #HellfireRampart
+568 #ZulAman
+564 #BlackTemple
diff --git a/contrib/vmap_assembler/vmap_assembler.cpp b/contrib/vmap_assembler/vmap_assembler.cpp
new file mode 100644
index 00000000000..233d4ba3c28
--- /dev/null
+++ b/contrib/vmap_assembler/vmap_assembler.cpp
@@ -0,0 +1,118 @@
+#include <stdlib.h>
+#include <stdio.h>
+#include <string>
+
+#include "TileAssembler.h"
+
+//=======================================================
+// remove last return or LF and tailing SPACE
+// remove all char after a #
+
+void chompAndTrim(std::string& str)
+{
+    for(unsigned int i=0;i<str.length(); ++i) {
+        char lc = str[i];
+        if(lc == '#') {
+            str = str.substr(0,i);
+            break;
+        }
+    }
+
+    while(str.length() >0) {
+        char lc = str[str.length()-1];
+        if(lc == '\r' || lc == '\n' || lc == ' ') {
+            str = str.substr(0,str.length()-1);
+        } else {
+            break;
+        }
+    }
+}
+
+//=======================================================
+/**
+This callback method is called for each model found in the dir file.
+return true if it should be included in the vmap
+*/
+bool modelNameFilter(char *pName)
+{
+#if 0
+    bool result;
+    result = !Wildcard::wildcardfit("*bush[0-9]*", pName);
+    if(result) result = !Wildcard::wildcardfit("*shrub[0-9]*", pName);
+    if(result) result = !Wildcard::wildcardfit("*_Bushes_*", pName);
+    if(result) result = !Wildcard::wildcardfit("*_Bush_*", pName);
+    if(!result) {
+        printf("%s",pName);
+    }
+#endif
+    return true;
+}
+
+//=======================================================
+/**
+File contains map names that should be split into tiles
+A '#' at the beginning of a line defines a comment
+*/
+
+bool readConfigFile(char *pConffile, VMAP::TileAssembler* pTa)
+{
+    bool result = false;
+    char buffer[501];
+    FILE *cf = fopen(pConffile, "rb");
+    if(cf) {
+        while(fgets(buffer, 500, cf)) {
+            std::string name = std::string(buffer);
+            size_t pos = name.find_first_not_of(' ');
+            name = name.substr(pos);
+            chompAndTrim(name); // just to be sure
+            if(name[0] != '#' && name.size() >0) { // comment?
+                unsigned int mapId = atoi(name.c_str());
+                pTa->addWorldAreaMapId(mapId);
+            }
+        }
+        fclose(cf);
+        result = true;
+    }
+    return(result);
+}
+//=======================================================
+int main(int argc, char* argv[])
+{
+    if(argc == 3 || argc == 4)
+    {
+        bool ok = true;
+        char *src = argv[1];
+        char *dest = argv[2];
+        char *conffile = NULL;
+        if(argc >= 4) {
+            conffile = argv[3];
+        }
+        VMAP::TileAssembler* ta = new VMAP::TileAssembler(std::string(src), std::string(dest));
+        ta->setModelNameFilterMethod(modelNameFilter);
+
+        /*
+        All the names in the list are considered to be world maps or huge instances.
+        These maps will be spilt into tiles in the vmap assemble process
+        */
+        if(conffile != NULL) {
+            ok = readConfigFile(conffile, ta);
+            if(!ok) {
+                printf("Can not open file config file: %s\n", conffile);
+            }
+        }
+        if(ok) { ok = ta->convertWorld(); }
+        if(ok) {
+            printf("Ok, all done\n");
+        } else {
+            printf("exit with errors\n");
+            return 1;
+        }
+        delete ta;
+    }
+    else
+    {
+        printf("\nusage: %s <raw data dir> <vmap dest dir> [config file name]\n", argv[0]);
+        return 1;
+    }
+    return 0;
+}
diff --git a/contrib/vmap_assembler/vmap_assemblerVC71.sln b/contrib/vmap_assembler/vmap_assemblerVC71.sln
new file mode 100644
index 00000000000..8fc03541941
--- /dev/null
+++ b/contrib/vmap_assembler/vmap_assemblerVC71.sln
@@ -0,0 +1,23 @@
+Microsoft Visual Studio Solution File, Format Version 8.00
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "vmap_assembler", "VC71\vmap_assembler.vcproj", "{572FFF74-480C-4472-8ABF-81733BB4049D}"
+	ProjectSection(ProjectDependencies) = postProject
+	EndProjectSection
+EndProject
+Global
+	GlobalSection(SolutionConfiguration) = preSolution
+		Debug = Debug
+		Release = Release
+	EndGlobalSection
+	GlobalSection(ProjectDependencies) = postSolution
+	EndGlobalSection
+	GlobalSection(ProjectConfiguration) = postSolution
+		{572FFF74-480C-4472-8ABF-81733BB4049D}.Debug.ActiveCfg = Debug|Win32
+		{572FFF74-480C-4472-8ABF-81733BB4049D}.Debug.Build.0 = Debug|Win32
+		{572FFF74-480C-4472-8ABF-81733BB4049D}.Release.ActiveCfg = Release|Win32
+		{572FFF74-480C-4472-8ABF-81733BB4049D}.Release.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(ExtensibilityGlobals) = postSolution
+	EndGlobalSection
+	GlobalSection(ExtensibilityAddIns) = postSolution
+	EndGlobalSection
+EndGlobal
diff --git a/contrib/vmap_assembler/vmap_assemblerVC80.sln b/contrib/vmap_assembler/vmap_assemblerVC80.sln
new file mode 100644
index 00000000000..66489bd0a79
--- /dev/null
+++ b/contrib/vmap_assembler/vmap_assemblerVC80.sln
@@ -0,0 +1,19 @@
+Microsoft Visual Studio Solution File, Format Version 9.00
+# Visual C++ Express 2005
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "vmap_assembler", "VC80\vmap_assembler.vcproj", "{572FFF74-480C-4472-8ABF-81733BB4049D}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Win32 = Debug|Win32
+		Release|Win32 = Release|Win32
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{572FFF74-480C-4472-8ABF-81733BB4049D}.Debug|Win32.ActiveCfg = Debug|Win32
+		{572FFF74-480C-4472-8ABF-81733BB4049D}.Debug|Win32.Build.0 = Debug|Win32
+		{572FFF74-480C-4472-8ABF-81733BB4049D}.Release|Win32.ActiveCfg = Release|Win32
+		{572FFF74-480C-4472-8ABF-81733BB4049D}.Release|Win32.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/contrib/vmap_debugger/G3D/AABSPTree.h b/contrib/vmap_debugger/G3D/AABSPTree.h
new file mode 100644
index 00000000000..543f06a881e
--- /dev/null
+++ b/contrib/vmap_debugger/G3D/AABSPTree.h
@@ -0,0 +1,1620 @@
+/**
+  @file AABSPTree.h
+  
+  @maintainer Morgan McGuire, matrix@graphics3d.com
+ 
+  @created 2004-01-11
+  @edited  2007-02-16
+
+  Copyright 2000-2007, Morgan McGuire.
+  All rights reserved.
+  
+  */
+
+#ifndef G3D_AABSPTREE_H
+#define G3D_AABSPTREE_H
+
+#include "VMapTools.h"
+
+#include "G3D/platform.h"
+#include "G3D/Array.h"
+#include "G3D/Table.h"
+#include "G3D/Vector3.h"
+#include "G3D/AABox.h"
+#include "G3D/Sphere.h"
+#include "G3D/Box.h"
+#include "G3D/Triangle.h"
+#include "G3D/Ray.h"
+#include "G3D/GCamera.h"
+#if 0
+#include "G3D/BinaryInput.h"
+#include "G3D/BinaryOutput.h"
+#endif
+#include "G3D/CollisionDetection.h"
+#include "G3D/GCamera.h"
+#include <algorithm>
+
+// If defined, in debug mode the tree is checked for consistency
+// as a way of detecting corruption due to implementation bugs
+// #define VERIFY_TREE
+
+inline void getBounds(const G3D::Vector3& v, G3D::AABox& out) {
+    out = G3D::AABox(v);
+}
+
+
+inline void getBounds(const G3D::AABox& a, G3D::AABox& out) {
+    out = a;
+}
+
+inline void getBounds(const G3D::Sphere& s, G3D::AABox& out) {
+    s.getBounds(out);
+}
+
+
+inline void getBounds(const G3D::Box& b, G3D::AABox& out) {
+    b.getBounds(out);
+}
+
+
+inline void getBounds(const G3D::Triangle& t, G3D::AABox& out) {
+    t.getBounds(out);
+}
+
+
+
+inline void getBounds(const G3D::Vector3* v, G3D::AABox& out) {
+    out = G3D::AABox(*v);
+}
+
+
+inline void getBounds(const G3D::AABox* a, G3D::AABox& out) {
+    getBounds(*a, out);
+}
+
+inline void getBounds(const G3D::Sphere* s, G3D::AABox& out) {
+    s->getBounds(out);
+}
+
+
+inline void getBounds(const G3D::Box* b, G3D::AABox& out) {
+    b->getBounds(out);
+}
+
+inline void getBounds(const G3D::Triangle* t, G3D::AABox& out) {
+    t->getBounds(out);
+}
+namespace G3D {
+    namespace _internal {
+
+    /**
+     Wraps a pointer value so that it can be treated as the instance itself;
+     convenient for inserting pointers into a Table but using the 
+     object equality instead of pointer equality.
+    */
+    template<class Type>
+    class Indirector {
+    public:
+        Type*         handle;
+
+        inline Indirector(Type* h) : handle(h) {}
+
+        inline Indirector() : handle(NULL) {}
+
+        /** Returns true iff the values referenced by the handles are equivalent. */
+        inline bool operator==(const Indirector& m) {
+            return *handle == *(m.handle);
+        }
+
+        inline bool operator==(const Type& m) {
+            return *handle == m;
+        }
+
+        inline size_t hashCode() const {
+            return handle->hashCode();
+        }
+    };
+ } // namespace internal
+} // namespace G3D
+
+template <class Handle>
+struct GHashCode<typename G3D::_internal::Indirector<Handle> >
+{
+    size_t operator()(const G3D::_internal::Indirector<Handle>& key) const { return key.hashCode(); }
+};
+
+namespace G3D {
+
+/**
+ A set that supports spatial queries using an axis-aligned
+ BSP tree for speed.
+
+ AABSPTree allows you to quickly find objects in 3D that lie within
+ a box or along a ray. For large sets of objects it is much faster
+ than testing each object for a collision.
+
+ AABSPTree is as powerful as but more general than a Quad Tree, Oct
+ Tree, or KD Tree, but less general than an unconstrained BSP tree
+ (which is much slower to create).
+ 
+ Internally, objects
+ are arranged into an axis-aligned BSP-tree according to their 
+ axis-aligned bounds.  This increases the cost of insertion to
+ O(log n) but allows fast overlap queries.
+
+ <B>Template Parameters</B>
+ <DT>The template parameter <I>T</I> must be one for which
+ the following functions are all overloaded:
+
+  <P><CODE>void ::getBounds(const T&, G3D::AABox&);</CODE>
+  <DT><CODE>bool ::operator==(const T&, const T&);</CODE>
+  <DT><CODE>unsigned int ::hashCode(const T&);</CODE>
+  <DT><CODE>T::T();</CODE> <I>(public constructor of no arguments)</I>
+
+ G3D provides these for common classes like G3D::Vector3 and G3D::Sphere.
+ If you use a custom class, or a pointer to a custom class, you will need
+ to define those functions.
+
+ <B>Moving %Set Members</B>
+ <DT>It is important that objects do not move without updating the
+ AABSPTree.  If the axis-aligned bounds of an object are about
+ to change, AABSPTree::remove it before they change and 
+ AABSPTree::insert it again afterward.  For objects
+ where the hashCode and == operator are invariant with respect 
+ to the 3D position,
+ you can use the AABSPTree::update method as a shortcut to
+ insert/remove an object in one step after it has moved.
+ 
+
+ Note: Do not mutate any value once it has been inserted into AABSPTree. Values
+ are copied interally. All AABSPTree iterators convert to pointers to constant
+ values to reinforce this.
+
+ If you want to mutate the objects you intend to store in a AABSPTree
+ simply insert <I>pointers</I> to your objects instead of the objects
+ themselves, and ensure that the above operations are defined. (And
+ actually, because values are copied, if your values are large you may
+ want to insert pointers anyway, to save space and make the balance
+ operation faster.)
+
+ <B>Dimensions</B>
+ Although designed as a 3D-data structure, you can use the AABSPTree
+ for data distributed along 2 or 1 axes by simply returning bounds
+ that are always zero along one or more dimensions.
+
+*/
+namespace _AABSPTree {
+
+    /** Wrapper for a value that includes a cache of its bounds. 
+        Except for the test value used in a set-query operation, there
+        is only ever one instance of the handle associated with any 
+        value and the memberTable and Nodes maintain pointers to that
+        heap-allocated value.
+     */
+    template<class TValue>
+    class Handle {
+    public:
+        /** The bounds of each object are constrained to AABox::maxFinite */
+        AABox               bounds;
+
+        /** Center of bounds.  We cache this value to avoid recomputing it
+            during the median sort, and because MSVC 6 std::sort goes into
+            an infinite loop if we compute the midpoint on the fly (possibly
+            a floating point roundoff issue, where B<A and A<B both are true).*/
+	Vector3             center;
+
+        TValue              value;
+
+        Handle<TValue>() {}
+
+        inline Handle<TValue>(const TValue& v) : value(v) {
+            getBounds(v, bounds);
+            bounds = bounds.intersect(AABox::maxFinite());
+            center = bounds.center();
+        }
+
+        inline bool operator==(const Handle<TValue>& other) const {
+            return (*value).operator==(*other.value);
+        }
+
+        inline size_t hashCode() const {
+            return value->hashCode();
+        }
+    };
+
+    template<>
+    class Handle<Triangle> {
+    public:
+        /** The bounds of each object are constrained to AABox::maxFinite */
+        AABox          bounds;
+
+        /** Center of bounds.  We cache this value to avoid recomputing it
+            during the median sort, and because MSVC 6 std::sort goes into
+            an infinite loop if we compute the midpoint on the fly (possibly
+            a floating point roundoff issue, where B<A and A<B both are true).*/
+        Vector3        center;
+
+        Triangle       value;
+
+        Handle<Triangle>() {}
+
+        inline Handle<Triangle>(const Triangle& v) : value(v) {
+            getBounds(v, bounds);
+            bounds = bounds.intersect(AABox::maxFinite());
+            center = bounds.center();
+        }
+
+        inline bool operator==(const Handle<Triangle>& other) const {
+            return value.operator==(other.value);
+        }
+
+        inline size_t hashCode() const {
+            return value.hashCode();
+        }
+    };
+}
+
+template<class T> class AABSPTree {
+protected:
+public:
+
+
+    /** Returns the bounds of the sub array. Used by makeNode. */
+    static AABox computeBounds(
+	const Array<_AABSPTree::Handle<T>*>& point, 
+        int                   beginIndex,
+        int                   endIndex) {
+    
+        Vector3 lo = Vector3::inf();
+        Vector3 hi = -lo;
+
+        for (int p = beginIndex; p <= endIndex; ++p) {
+            lo = lo.min(point[p]->bounds.low());
+            hi = hi.max(point[p]->bounds.high());
+        }
+
+        return AABox(lo, hi);
+    }
+
+    /** Compares centers */
+    class CenterComparator {
+    public:
+	    Vector3::Axis sortAxis;
+
+	    CenterComparator(Vector3::Axis a) : sortAxis(a) {}
+
+	    inline int operator()(_AABSPTree::Handle<T>* A, const _AABSPTree::Handle<T>* B) const {
+            float a = A->center[sortAxis];
+            float b = B->center[sortAxis];
+
+            if (a < b) {
+                return 1;
+            } else if (a > b) {
+                return -1;
+            } else {
+                return 0;
+            }
+	    }
+    };
+
+
+    /** Compares bounds for strict >, <, or overlap*/
+    class BoundsComparator {
+    public:
+	    Vector3::Axis sortAxis;
+
+	    BoundsComparator(Vector3::Axis a) : sortAxis(a) {}
+
+	    inline int operator()(_AABSPTree::Handle<T>* A, const _AABSPTree::Handle<T>* B) const {
+            const AABox& a = A->bounds;
+            const AABox& b = B->bounds;
+
+            if (a.high()[sortAxis] < b.low()[sortAxis]) {
+                return 1;
+            } else if (a.low()[sortAxis] > b.high()[sortAxis]) {
+                return -1;
+            } else {
+                return 0;
+            }
+	    }
+    };
+
+
+    /** Compares bounds to the sort location */
+    class Comparator {
+    public:
+	    Vector3::Axis sortAxis;
+	    float sortLocation;
+
+	    Comparator(Vector3::Axis a, float l) : sortAxis(a), sortLocation(l) {}
+
+	    inline int operator()(_AABSPTree::Handle<T>* ignore, const _AABSPTree::Handle<T>* handle) const {
+            const AABox& box = handle->bounds;
+            debugAssert(ignore == NULL);
+
+		    if (box.high()[sortAxis] < sortLocation) {
+                // Box is strictly below the sort location
+                return -1;
+		    } else if (box.low()[sortAxis] > sortLocation) {
+                // Box is strictly above the sort location
+			    return 1;
+		    } else {
+                // Box overlaps the sort location
+			    return 0;
+		    }
+	    }
+    };
+
+    // Using System::malloc with this class provided no speed improvement.
+    class Node {
+    public:
+
+        /** Spatial bounds on all values at this node and its children, based purely on
+            the parent's splitting planes.  May be infinite. */
+        AABox               splitBounds;
+
+        Vector3::Axis       splitAxis;
+
+        /** Location along the specified axis */
+        float               splitLocation;
+ 
+        /** child[0] contains all values strictly 
+            smaller than splitLocation along splitAxis.
+
+            child[1] contains all values strictly
+            larger.
+
+            Both may be NULL if there are not enough
+            values to bother recursing.
+        */
+        Node*               child[2];
+
+        /** Array of values at this node (i.e., values
+            straddling the split plane + all values if
+            this is a leaf node). 
+
+            This is an array of pointers because that minimizes
+            data movement during tree building, which accounts 
+            for about 15% of the time cost of tree building.
+          */
+        Array<_AABSPTree::Handle<T> * >      valueArray;
+
+        /** For each object in the value array, a copy of its bounds. 
+            Packing these into an array at the node level
+            instead putting them in the valueArray improves
+            cache coherence, which is about a 3x performance
+            increase when performing intersection computations.
+          */
+        Array<AABox>        boundsArray;
+
+        /** Creates node with NULL children */
+        Node() {
+            splitAxis     = Vector3::X_AXIS;
+            splitLocation = 0;
+            splitBounds   = AABox(-Vector3::inf(), Vector3::inf());
+            for (int i = 0; i < 2; ++i) {
+                child[i] = NULL;
+            }
+        }
+
+        /**
+         Doesn't clone children.
+         */
+        Node(const Node& other) : valueArray(other.valueArray), boundsArray(other.boundsArray) {
+            splitAxis       = other.splitAxis;
+            splitLocation   = other.splitLocation;
+            splitBounds     = other.splitBounds;            
+            for (int i = 0; i < 2; ++i) {
+                child[i] = NULL;
+            }
+        }
+
+        /** Copies the specified subarray of pt into point, NULLs the children.
+            Assumes a second pass will set splitBounds. */
+        Node(const Array<_AABSPTree::Handle<T> * >& pt) : valueArray(pt) {
+            splitAxis     = Vector3::X_AXIS;
+            splitLocation = 0;
+            for (int i = 0; i < 2; ++i) {
+                child[i] = NULL;
+            }
+
+            boundsArray.resize(valueArray.size());
+            for (int i = 0; i < valueArray.size(); ++i) {
+                boundsArray[i] = valueArray[i]->bounds;
+            }
+        }
+
+        /** Deletes the children (but not the values) */
+        ~Node() {
+            for (int i = 0; i < 2; ++i) {
+                delete child[i];
+            }
+        }
+
+        /** Returns true if this node is a leaf (no children) */
+        inline bool isLeaf() const {
+            return (child[0] == NULL) && (child[1] == NULL);
+        }
+
+
+        /**
+         Recursively appends all handles and children's handles
+         to the array.
+         */
+        void getHandles(Array<_AABSPTree::Handle<T> * >& handleArray) const {
+            handleArray.append(valueArray);
+            for (int i = 0; i < 2; ++i) {
+                if (child[i] != NULL) {
+                    child[i]->getHandles(handleArray);
+                }
+            }
+        }
+
+	    void verifyNode(const Vector3& lo, const Vector3& hi) {
+            //		debugPrintf("Verifying: split %d @ %f [%f, %f, %f], [%f, %f, %f]\n",
+            //			    splitAxis, splitLocation, lo.x, lo.y, lo.z, hi.x, hi.y, hi.z);
+
+            debugAssert(lo == splitBounds.low());
+            debugAssert(hi == splitBounds.high());
+
+		    for (int i = 0; i < valueArray.length(); ++i) {
+			    const AABox& b = valueArray[i]->bounds;
+                debugAssert(b == boundsArray[i]);
+
+			    for(int axis = 0; axis < 3; ++axis) {
+				    debugAssert(b.low()[axis] <= b.high()[axis]);
+				    debugAssert(b.low()[axis] >= lo[axis]);
+				    debugAssert(b.high()[axis] <= hi[axis]);
+			    }
+		    }
+
+		    if (child[0] || child[1]) {
+			    debugAssert(lo[splitAxis] < splitLocation);
+			    debugAssert(hi[splitAxis] > splitLocation);
+		    }
+
+		    Vector3 newLo = lo;
+		    newLo[splitAxis] = splitLocation;
+		    Vector3 newHi = hi;
+		    newHi[splitAxis] = splitLocation;
+
+		    if (child[0] != NULL) {
+			    child[0]->verifyNode(lo, newHi);
+		    }
+
+		    if (child[1] != NULL) {
+			    child[1]->verifyNode(newLo, hi);
+		    }
+	    }
+
+#if 0
+        /**
+          Stores the locations of the splitting planes (the structure but not the content)
+          so that the tree can be quickly rebuilt from a previous configuration without 
+          calling balance.
+         */
+        static void serializeStructure(const Node* n, BinaryOutput& bo) {
+            if (n == NULL) {
+                bo.writeUInt8(0);
+            } else {
+                bo.writeUInt8(1);
+                n->splitBounds.serialize(bo);
+                serialize(n->splitAxis, bo);
+                bo.writeFloat32(n->splitLocation);
+                for (int c = 0; c < 2; ++c) {
+                    serializeStructure(n->child[c], bo);
+                }
+            }
+        }
+
+        /** Clears the member table */
+        static Node* deserializeStructure(BinaryInput& bi) {
+            if (bi.readUInt8() == 0) {
+                return NULL;
+            } else {
+                Node* n = new Node();
+                n->splitBounds.deserialize(bi);
+                deserialize(n->splitAxis, bi);
+                n->splitLocation = bi.readFloat32();
+                for (int c = 0; c < 2; ++c) {
+                    n->child[c] = deserializeStructure(bi);
+                }
+            }
+        }
+#endif
+        /** Returns the deepest node that completely contains bounds. */
+        Node* findDeepestContainingNode(const AABox& bounds) {
+
+            // See which side of the splitting plane the bounds are on
+            if (bounds.high()[splitAxis] < splitLocation) {
+                // Bounds are on the low side.  Recurse into the child
+                // if it exists.
+                if (child[0] != NULL) {
+                    return child[0]->findDeepestContainingNode(bounds);
+                }
+            } else if (bounds.low()[splitAxis] > splitLocation) {
+                // Bounds are on the high side, recurse into the child
+                // if it exists.
+                if (child[1] != NULL) {
+                    return child[1]->findDeepestContainingNode(bounds);
+                }
+            }
+
+            // There was no containing child, so this node is the
+            // deepest containing node.
+            return this;
+        }
+
+
+        /** Appends all members that intersect the box. 
+            If useSphere is true, members that pass the box test
+            face a second test against the sphere. */
+        void getIntersectingMembers(
+            const AABox&        box,
+            const Sphere&       sphere,
+            Array<T>&           members,
+            bool                useSphere) const {
+
+            // Test all values at this node
+            for (int v = 0; v < boundsArray.size(); ++v) {
+                const AABox& bounds = boundsArray[v];
+                if (bounds.intersects(box) &&
+                    (! useSphere || bounds.intersects(sphere))) {
+                    members.append(valueArray[v]->value);
+                }
+            }
+
+            // If the left child overlaps the box, recurse into it
+            if ((child[0] != NULL) && (box.low()[splitAxis] < splitLocation)) {
+                child[0]->getIntersectingMembers(box, sphere, members, useSphere);
+            }
+
+            // If the right child overlaps the box, recurse into it
+            if ((child[1] != NULL) && (box.high()[splitAxis] > splitLocation)) {
+                child[1]->getIntersectingMembers(box, sphere, members, useSphere);
+            }
+        }
+
+        /**
+         Recurse through the tree, assigning splitBounds fields.
+         */
+        void assignSplitBounds(const AABox& myBounds) {
+            splitBounds = myBounds;
+
+            AABox childBounds[2];
+            myBounds.split(splitAxis, splitLocation, childBounds[0], childBounds[1]);
+
+#           if defined(G3D_DEBUG) && defined(VERIFY_TREE)
+                // Verify the split
+                for (int v = 0; v < boundsArray.size(); ++v) {
+                    const AABox& bounds = boundsArray[v];
+                    debugAssert(myBounds.contains(bounds));
+                }
+#           endif
+
+            for (int c = 0; c < 2; ++c) {
+                if (child[c]) {
+                    child[c]->assignSplitBounds(childBounds[c]);
+                }
+            }
+        }
+
+        /** Returns true if the ray intersects this node */
+        bool intersects(const Ray& ray, float distance) const {
+            // See if the ray will ever hit this node or its children
+            Vector3 location;
+            bool alreadyInsideBounds = false;
+            bool rayWillHitBounds = 
+                VMAP::MyCollisionDetection::collisionLocationForMovingPointFixedAABox(
+                    ray.origin, ray.direction, splitBounds, location, alreadyInsideBounds);
+           
+            bool canHitThisNode = (alreadyInsideBounds ||                
+                (rayWillHitBounds && ((location - ray.origin).squaredLength() < square(distance))));
+
+            return canHitThisNode;
+        }
+
+        template<typename RayCallback>
+        void intersectRay(
+            const Ray& ray, 
+            RayCallback& intersectCallback, 
+            float& distance,
+            bool pStopAtFirstHit,
+            bool intersectCallbackIsFast) const {
+                float enterDistance = distance;
+            
+            if (! intersects(ray, distance)) {
+                // The ray doesn't hit this node, so it can't hit the children of the node.
+                return;
+            }
+
+            // Test for intersection against every object at this node.
+            for (int v = 0; v < valueArray.size(); ++v) {        
+                bool canHitThisObject = true;
+
+                if (! intersectCallbackIsFast) {
+                    // See if
+                    Vector3 location;
+                    const AABox& bounds = boundsArray[v];
+                    bool alreadyInsideBounds = false;
+                    bool rayWillHitBounds = 
+                        VMAP::MyCollisionDetection::collisionLocationForMovingPointFixedAABox(
+                            ray.origin, ray.direction, bounds, location, alreadyInsideBounds);
+
+                    canHitThisObject = (alreadyInsideBounds ||                
+                        (rayWillHitBounds && ((location - ray.origin).squaredLength() < square(distance))));
+                }
+
+                if (canHitThisObject) {
+                    // It is possible that this ray hits this object.  Look for the intersection using the
+                    // callback.
+                    const T& value = valueArray[v]->value;
+                    intersectCallback(ray, value, pStopAtFirstHit, distance);
+                }
+                if(pStopAtFirstHit && distance < enterDistance)
+                    return;
+            }
+
+            // There are three cases to consider next:
+            // 
+            //  1. the ray can start on one side of the splitting plane and never enter the other,
+            //  2. the ray can start on one side and enter the other, and
+            //  3. the ray can travel exactly down the splitting plane
+
+            enum {NONE = -1};
+            int firstChild = NONE;
+            int secondChild = NONE;
+
+            if (ray.origin[splitAxis] < splitLocation) {
+                
+                // The ray starts on the small side
+                firstChild = 0;
+
+                if (ray.direction[splitAxis] > 0) {
+                    // The ray will eventually reach the other side
+                    secondChild = 1;
+                }
+
+            } else if (ray.origin[splitAxis] > splitLocation) {
+
+                // The ray starts on the large side
+                firstChild = 1;
+
+                if (ray.direction[splitAxis] < 0) {
+                    secondChild = 0;
+                }
+            } else {
+                // The ray starts on the splitting plane
+                if (ray.direction[splitAxis] < 0) {
+                    // ...and goes to the small side
+                    firstChild = 0;
+                } else if (ray.direction[splitAxis] > 0) {
+                    // ...and goes to the large side
+                    firstChild = 1;
+                }
+            }
+
+            // Test on the side closer to the ray origin.
+            if ((firstChild != NONE) && child[firstChild]) {
+                child[firstChild]->intersectRay(ray, intersectCallback, distance, pStopAtFirstHit, intersectCallbackIsFast);
+                if(pStopAtFirstHit && distance < enterDistance)
+                    return;
+            }
+
+            if (ray.direction[splitAxis] != 0) {
+                // See if there was an intersection before hitting the splitting plane.  
+                // If so, there is no need to look on the far side and recursion terminates.
+                float distanceToSplittingPlane = (splitLocation - ray.origin[splitAxis]) / ray.direction[splitAxis];
+                if (distanceToSplittingPlane > distance) {
+                    // We aren't going to hit anything else before hitting the splitting plane,
+                    // so don't bother looking on the far side of the splitting plane at the other
+                    // child.
+                    return;
+                }
+            }
+
+            // Test on the side farther from the ray origin.
+            if ((secondChild != NONE) && child[secondChild]) {
+                child[secondChild]->intersectRay(ray, intersectCallback, distance, pStopAtFirstHit, intersectCallbackIsFast);
+            }
+
+        }
+    };
+
+
+    /**
+     Recursively subdivides the subarray.
+    
+     Clears the source array as soon as it is no longer needed.
+
+     Call assignSplitBounds() on the root node after making a tree.
+     */
+    Node* makeNode(
+        Array<_AABSPTree::Handle<T> * >& source, 
+        int valuesPerNode, 
+        int numMeanSplits,
+        Array<_AABSPTree::Handle<T> * >& temp)  {
+
+	    Node* node = NULL;
+	    
+	    if (source.size() <= valuesPerNode) {
+		    // Make a new leaf node
+		    node = new Node(source);
+		    
+		    // Set the pointers in the memberTable
+		    for (int i = 0; i < source.size(); ++i) {
+			    memberTable.set(Member(source[i]), node);
+		    }
+            source.clear();
+		    
+        } else {
+		    // Make a new internal node
+		    node = new Node();
+		    
+            const AABox bounds = computeBounds(source, 0, source.size() - 1);
+		    const Vector3 extent = bounds.high() - bounds.low();
+		    
+		    Vector3::Axis splitAxis = extent.primaryAxis();
+		    
+            float splitLocation;
+
+            // Arrays for holding the children
+            Array<_AABSPTree::Handle<T> * > lt, gt;
+                
+            if (numMeanSplits <= 0) {
+
+                source.medianPartition(lt, node->valueArray, gt, temp, CenterComparator(splitAxis));
+
+                // Choose the split location to be the center of whatever fell in the center
+                splitLocation = node->valueArray[0]->center[splitAxis];
+
+                // Some of the elements in the lt or gt array might really overlap the split location.
+                // Move them as needed.
+                for (int i = 0; i < lt.size(); ++i) {
+                    const AABox& bounds = lt[i]->bounds;
+                    if ((bounds.low()[splitAxis] <= splitLocation) && (bounds.high()[splitAxis] >= splitLocation)) {
+                        node->valueArray.append(lt[i]);
+                        // Remove this element and process the new one that
+                        // is swapped in in its place.
+                        lt.fastRemove(i); --i;
+                    }
+                }
+
+                for (int i = 0; i < gt.size(); ++i) {
+                    const AABox& bounds = gt[i]->bounds;
+                    if ((bounds.low()[splitAxis] <= splitLocation) && (bounds.high()[splitAxis] >= splitLocation)) {
+                        node->valueArray.append(gt[i]);
+                        // Remove this element and process the new one that
+                        // is swapped in in its place.
+                        gt.fastRemove(i); --i;
+                    }
+                }            
+
+                if ((node->valueArray.size() > (source.size() / 2)) &&
+                    (source.size() > 6)) {
+                    // This was a bad partition; we ended up putting the splitting plane right in the middle of most of the 
+                    // objects.  We could try to split on a different axis, or use a different partition (e.g., the extents mean, 
+                    // or geometric mean).  This implementation falls back on the extents mean, since that case is already handled 
+                    // below.
+                    numMeanSplits = 1;
+                }
+            }
+
+            // Note: numMeanSplits may have been increased by the code in the previous case above in order to
+            // force a re-partition.
+
+            if (numMeanSplits > 0) {
+                // Split along the mean
+                splitLocation = (bounds.high()[splitAxis] + 
+                                 bounds.low()[splitAxis]) / 2.0;
+                
+                source.partition(NULL, lt, node->valueArray, gt, Comparator(splitAxis, splitLocation));
+
+                // The Comparator ensures that elements are strictly on the correct side of the split
+            }
+
+
+#           if defined(G3D_DEBUG) && defined(VERIFY_TREE)
+                debugAssert(lt.size() + node->valueArray.size() + gt.size() == source.size());
+                // Verify that all objects ended up on the correct side of the split.
+                // (i.e., make sure that the Array partition was correct) 
+                for (int i = 0; i < lt.size(); ++i) {
+                    const AABox& bounds  = lt[i]->bounds;
+                    debugAssert(bounds.high()[splitAxis] < splitLocation);
+                }
+
+                for (int i = 0; i < gt.size(); ++i) {
+                    const AABox& bounds  = gt[i]->bounds;
+                    debugAssert(bounds.low()[splitAxis] > splitLocation);
+                }
+
+                for (int i = 0; i < node->valueArray.size(); ++i) {
+                    const AABox& bounds  = node->valueArray[i]->bounds;
+                    debugAssert(bounds.high()[splitAxis] >= splitLocation);
+                    debugAssert(bounds.low()[splitAxis] <= splitLocation);
+                }
+#           endif
+
+            // The source array is no longer needed
+            source.clear();
+
+            node->splitAxis = splitAxis;
+            node->splitLocation = splitLocation;
+
+            // Update the bounds array and member table
+            node->boundsArray.resize(node->valueArray.size());
+            for (int i = 0; i < node->valueArray.size(); ++i) {
+                _AABSPTree::Handle<T> * v = node->valueArray[i];
+                node->boundsArray[i] = v->bounds;
+			    memberTable.set(Member(v), node);
+            }
+
+            if (lt.size() > 0) {		    
+			    node->child[0] = makeNode(lt, valuesPerNode, numMeanSplits - 1, temp);
+		    }
+		    
+		    if (gt.size() > 0) {
+			    node->child[1] = makeNode(gt, valuesPerNode, numMeanSplits - 1, temp);
+		    }
+		    
+	    }
+	    
+	    return node;
+    }
+
+    /**
+     Recursively clone the passed in node tree, setting
+     pointers for members in the memberTable as appropriate.
+     called by the assignment operator.
+     */
+    Node* cloneTree(Node* src) {
+        Node* dst = new Node(*src);
+
+        // Make back pointers
+        for (int i = 0; i < dst->valueArray.size(); ++i) {
+            memberTable.set(Member(dst->valueArray[i]), dst);
+        }
+
+        // Clone children
+        for (int i = 0; i < 2; ++i) {
+            if (src->child[i] != NULL) {
+                dst->child[i] = cloneTree(src->child[i]);
+            }
+        }
+
+        return dst;
+    }
+
+   /**
+    Wrapper for a Handle; used to create a memberTable that acts like Table<Handle, Node*> but
+    stores only Handle* internally to avoid memory copies.
+    */
+    typedef _internal::Indirector<_AABSPTree::Handle<T> > Member;
+
+    typedef Table<Member, Node*> MemberTable;
+
+    /** Maps members to the node containing them */
+    MemberTable             memberTable;
+
+    Node*                   root;
+
+public:
+
+    /** To construct a balanced tree, insert the elements and then call
+      AABSPTree::balance(). */
+    AABSPTree() : root(NULL) {}
+
+
+    AABSPTree(const AABSPTree& src) : root(NULL) {
+        *this = src;
+    }
+
+
+    AABSPTree& operator=(const AABSPTree& src) {
+        delete root;
+        // Clone tree takes care of filling out the memberTable.
+        root = cloneTree(src.root);
+        return *this;
+    }
+
+
+    ~AABSPTree() {
+        clear();
+    }
+
+    /**
+     Throws out all elements of the set.
+     */
+    void clear() {
+        typedef typename Table<_internal::Indirector<_AABSPTree::Handle<T> >, Node* >::Iterator It;
+  
+        // Delete all handles stored in the member table
+        It cur = memberTable.begin();
+        It end = memberTable.end();
+        while (cur != end) {
+            delete cur->key.handle;
+            cur->key.handle = NULL;
+            ++cur;
+        }
+        memberTable.clear();
+
+        // Delete the tree structure itself
+        delete root;
+        root = NULL;
+    }
+
+    size_t size() const {
+        return memberTable.size();
+    }
+
+    /**
+     Inserts an object into the set if it is not
+     already present.  O(log n) time.  Does not
+     cause the tree to be balanced.
+     */
+    void insert(const T& value) {
+        if (contains(value)) {
+            // Already in the set
+            return;
+        }
+
+        _AABSPTree::Handle<T>* h = new _AABSPTree::Handle<T>(value);
+
+        if (root == NULL) {
+            // This is the first node; create a root node
+            root = new Node();
+        }
+
+        Node* node = root->findDeepestContainingNode(h->bounds);
+
+        // Insert into the node
+        node->valueArray.append(h);
+        node->boundsArray.append(h->bounds);
+        
+        // Insert into the node table
+        Member m(h);
+        memberTable.set(m, node);
+    }
+
+    /** Inserts each elements in the array in turn.  If the tree
+        begins empty (no structure and no elements), this is faster
+        than inserting each element in turn.  You still need to balance
+        the tree at the end.*/
+    void insert(const Array<T>& valueArray) {
+        if (root == NULL) {
+            // Optimized case for an empty tree; don't bother
+            // searching or reallocating the root node's valueArray
+            // as we incrementally insert.
+            root = new Node();
+            root->valueArray.resize(valueArray.size());
+            root->boundsArray.resize(root->valueArray.size());
+            for (int i = 0; i < valueArray.size(); ++i) {
+                // Insert in opposite order so that we have the exact same
+                // data structure as if we inserted each (i.e., order is reversed
+                // from array).
+                _AABSPTree::Handle<T>* h = new _AABSPTree::Handle<T>(valueArray[i]);
+                int j = valueArray.size() - i - 1;
+                root->valueArray[j] = h;
+                root->boundsArray[j] = h->bounds;
+                memberTable.set(Member(h), root);
+            }
+
+        } else {
+            // Insert at appropriate tree depth.
+            for (int i = 0; i < valueArray.size(); ++i) {
+                insert(valueArray[i]);
+            }
+        }
+    }
+
+
+    /**
+     Returns true if this object is in the set, otherwise
+     returns false.  O(1) time.
+     */
+    bool contains(const T& value) {
+        // Temporarily create a handle and member
+        _AABSPTree::Handle<T> h(value);
+        return memberTable.containsKey(Member(&h));
+    }
+
+
+    /**
+     Removes an object from the set in O(1) time.
+     It is an error to remove members that are not already
+     present.  May unbalance the tree.  
+     
+     Removing an element never causes a node (split plane) to be removed...
+     nodes are only changed when the tree is rebalanced.  This behavior
+     is desirable because it allows the split planes to be serialized,
+     and then deserialized into an empty tree which can be repopulated.
+    */
+    void remove(const T& value) {
+        debugAssertM(contains(value),
+            "Tried to remove an element from a "
+            "AABSPTree that was not present");
+
+        // Get the list of elements at the node
+        _AABSPTree::Handle<T> h(value);
+        Member m(&h);
+
+        Array<_AABSPTree::Handle<T> * >& list = memberTable[m]->valueArray;
+
+        _AABSPTree::Handle<T>* ptr = NULL;
+
+        // Find the element and remove it
+        for (int i = list.length() - 1; i >= 0; --i) {
+            if (list[i]->value == value) {
+                // This was the element.  Grab the pointer so that
+                // we can delete it below
+                ptr = list[i];
+
+                // Remove the handle from the node
+                list.fastRemove(i);
+
+                // Remove the corresponding bounds
+                memberTable[m]->boundsArray.fastRemove(i);
+                break;
+            }
+        }
+
+        // Remove the member
+        memberTable.remove(m);
+
+        // Delete the handle data structure
+        delete ptr;
+        ptr = NULL;
+    }
+
+
+    /**
+     If the element is in the set, it is removed.
+     The element is then inserted.
+
+     This is useful when the == and hashCode methods
+     on <I>T</I> are independent of the bounds.  In
+     that case, you may call update(v) to insert an
+     element for the first time and call update(v)
+     again every time it moves to keep the tree 
+     up to date.
+     */
+    void update(const T& value) {
+        if (contains(value)) {
+            remove(value);
+        }
+        insert(value);
+    }
+
+
+    /**
+     Rebalances the tree (slow).  Call when objects
+     have moved substantially from their original positions
+     (which unbalances the tree and causes the spatial
+     queries to be slow).
+     
+     @param valuesPerNode Maximum number of elements to put at
+     a node.
+
+     @param numMeanSplits numMeanSplits = 0 gives a 
+     fully axis aligned BSP-tree, where the balance operation attempts to balance
+     the tree so that every splitting plane has an equal number of left
+     and right children (i.e. it is a <B>median</B> split along that axis).  
+     This tends to maximize average performance.  
+
+     You can override this behavior by
+     setting a number of <B>mean</B> (average) splits.  numMeanSplits = MAX_INT
+     creates a full oct-tree, which tends to optimize peak performance at the expense of
+     average performance.  It tends to have better clustering behavior when
+     members are not uniformly distributed.
+     */
+    void balance(int valuesPerNode = 5, int numMeanSplits = 3) {
+        if (root == NULL) {
+            // Tree is empty
+            return;
+        }
+
+        // Get all handles and delete the old tree structure
+        Node* oldRoot = root;
+        for (int c = 0; c < 2; ++c) {
+            if (root->child[c] != NULL) {
+                root->child[c]->getHandles(root->valueArray);
+
+                // Delete the child; this will delete all structure below it
+                delete root->child[c];
+                root->child[c] = NULL;
+            }
+        }
+
+        Array<_AABSPTree::Handle<T> * > temp;
+        // Make a new root.  Work with a copy of the value array because 
+        // makeNode clears the source array as it progresses
+        Array<_AABSPTree::Handle<T> * > copy(oldRoot->valueArray);
+        root = makeNode(copy, valuesPerNode, numMeanSplits, temp);
+
+        // Throw away the old root node
+        delete oldRoot;
+        oldRoot = NULL;
+
+        // Walk the tree, assigning splitBounds.  We start with unbounded
+        // space.  This will override the current member table.
+        root->assignSplitBounds(AABox::maxFinite());
+
+#       ifdef _DEBUG
+            // Ensure that the balanced tree is till correct
+            root->verifyNode(Vector3::minFinite(), Vector3::maxFinite());
+#       endif
+    }
+
+protected:
+
+    /**
+     @param parentMask The mask that this node returned from culledBy.
+     */
+    static void getIntersectingMembers(
+        const Array<Plane>&         plane,
+        Array<T>&                   members,
+        Node*                       node,
+        uint32                      parentMask) {
+
+        int dummy;
+
+        if (parentMask == 0) {
+            // None of these planes can cull anything
+            for (int v = node->valueArray.size() - 1; v >= 0; --v) {
+                members.append(node->valueArray[v]->value);
+            }
+
+            // Iterate through child nodes
+            for (int c = 0; c < 2; ++c) {
+                if (node->child[c]) {
+                    getIntersectingMembers(plane, members, node->child[c], 0);
+                }
+            }
+        } else {
+
+            // Test values at this node against remaining planes
+            for (int v = node->boundsArray.size() - 1; v >= 0; --v) {
+                if (! node->boundsArray[v].culledBy(plane, dummy, parentMask)) {
+                    members.append(node->valueArray[v]->value);
+                }
+            }
+
+            uint32 childMask  = 0xFFFFFF;
+
+            // Iterate through child nodes
+            for (int c = 0; c < 2; ++c) {
+                if (node->child[c] &&
+                    ! node->child[c]->splitBounds.culledBy(plane, dummy, parentMask, childMask)) {
+                    // This node was not culled
+                    getIntersectingMembers(plane, members, node->child[c], childMask);
+                }
+            }
+        }
+    }
+
+public:
+
+    /**
+     Returns all members inside the set of planes.  
+      @param members The results are appended to this array.
+     */
+    void getIntersectingMembers(const Array<Plane>& plane, Array<T>& members) const {
+        if (root == NULL) {
+            return;
+        }
+
+        getIntersectingMembers(plane, members, root, 0xFFFFFF);
+    }
+
+    /**
+     Typically used to find all visible
+     objects inside the view frustum (see also GCamera::getClipPlanes)... i.e. all objects
+     <B>not<B> culled by frustum.
+
+     Example:
+      <PRE>
+        Array<Object*>  visible;
+        tree.getIntersectingMembers(camera.frustum(), visible);
+        // ... Draw all objects in the visible array.
+      </PRE>
+      @param members The results are appended to this array.
+      */
+    void getIntersectingMembers(const GCamera::Frustum& frustum, Array<T>& members) const {
+        Array<Plane> plane;
+        
+        for (int i = 0; i < frustum.faceArray.size(); ++i) {
+            plane.append(frustum.faceArray[i].plane);
+        }
+
+        getIntersectingMembers(plane, members);
+    }
+
+    /**
+     C++ STL style iterator variable.  See beginBoxIntersection().
+     The iterator overloads the -> (dereference) operator, so this
+     acts like a pointer to the current member.
+     */
+    // This iterator turns Node::getIntersectingMembers into a
+    // coroutine.  It first translates that method from recursive to
+    // stack based, then captures the system state (analogous to a Scheme
+    // continuation) after each element is appended to the member array,
+    // and allowing the computation to be restarted.
+    class BoxIntersectionIterator {
+    private:
+        friend class AABSPTree<T>;
+
+        /** True if this is the "end" iterator instance */
+        bool            isEnd;
+
+        /** The box that we're testing against. */
+        AABox           box;
+
+        /** Node that we're currently looking at.  Undefined if isEnd
+            is true. */
+        Node*           node;
+
+        /** Nodes waiting to be processed */
+        // We could use backpointers within the tree and careful
+        // state management to avoid ever storing the stack-- but
+        // it is much easier this way and only inefficient if the
+        // caller uses post increment (which they shouldn't!).
+        Array<Node*>    stack;
+
+        /** The next index of current->valueArray to return. 
+            Undefined when isEnd is true.*/
+        int             nextValueArrayIndex;
+
+        BoxIntersectionIterator() : isEnd(true) {}
+        
+        BoxIntersectionIterator(const AABox& b, const Node* root) : 
+           isEnd(root == NULL), box(b), 
+           node(const_cast<Node*>(root)), nextValueArrayIndex(-1) {
+
+           // We intentionally start at the "-1" index of the current
+           // node so we can use the preincrement operator to move
+           // ourselves to element 0 instead of repeating all of the
+           // code from the preincrement method.  Note that this might
+           // cause us to become the "end" instance.
+           ++(*this);
+        }
+
+    public:
+
+        inline bool operator!=(const BoxIntersectionIterator& other) const {
+            return ! (*this == other);
+        }
+
+        bool operator==(const BoxIntersectionIterator& other) const {
+            if (isEnd) {
+                return other.isEnd;
+            } else if (other.isEnd) {
+                return false;
+            } else {
+                // Two non-end iterators; see if they match.  This is kind of 
+                // silly; users shouldn't call == on iterators in general unless
+                // one of them is the end iterator.
+                if ((box != other.box) || (node != other.node) || 
+                    (nextValueArrayIndex != other.nextValueArrayIndex) ||
+                    (stack.length() != other.stack.length())) {
+                    return false;
+                }
+
+                // See if the stacks are the same
+                for (int i = 0; i < stack.length(); ++i) {
+                    if (stack[i] != other.stack[i]) {
+                        return false;
+                    }
+                }
+
+                // We failed to find a difference; they must be the same
+                return true;
+            }
+        }
+
+        /**
+         Pre increment.
+         */
+        BoxIntersectionIterator& operator++() {
+            ++nextValueArrayIndex;
+
+			bool foundIntersection = false;
+            while (! isEnd && ! foundIntersection) {
+
+				// Search for the next node if we've exhausted this one
+                while ((! isEnd) &&  (nextValueArrayIndex >= node->valueArray.length())) {
+					// If we entered this loop, then the iterator has exhausted the elements at 
+					// node (possibly because it just switched to a child node with no members).
+					// This loop continues until it finds a node with members or reaches
+					// the end of the whole intersection search.
+
+					// If the right child overlaps the box, push it onto the stack for
+					// processing.
+					if ((node->child[1] != NULL) &&
+						(box.high()[node->splitAxis] > node->splitLocation)) {
+						stack.push(node->child[1]);
+					}
+                
+					// If the left child overlaps the box, push it onto the stack for
+					// processing.
+					if ((node->child[0] != NULL) &&
+						(box.low()[node->splitAxis] < node->splitLocation)) {
+						stack.push(node->child[0]);
+					}
+
+					if (stack.length() > 0) {
+						// Go on to the next node (which may be either one of the ones we 
+						// just pushed, or one from farther back the tree).
+						node = stack.pop();
+						nextValueArrayIndex = 0;
+					} else {
+						// That was the last node; we're done iterating
+						isEnd = true;
+					}
+				}
+
+				// Search for the next intersection at this node until we run out of children
+				while (! isEnd && ! foundIntersection && (nextValueArrayIndex < node->valueArray.length())) {
+					if (box.intersects(node->boundsArray[nextValueArrayIndex])) {
+						foundIntersection = true;
+					} else {
+						++nextValueArrayIndex;
+						// If we exhaust this node, we'll loop around the master loop 
+						// to find a new node.
+					}
+				}
+            }
+
+            return *this;
+        }
+
+    private:
+        /**
+         Post increment (much slower than preincrement!).  Intentionally overloaded to preclude accidentally slow code.
+         */
+        BoxIntersectionIterator operator++(int);
+        /*{
+            BoxIntersectionIterator old = *this;
+            ++this;
+            return old;
+        }*/
+
+    public:
+
+        /** Overloaded dereference operator so the iterator can masquerade as a pointer
+            to a member */
+        const T& operator*() const {
+            alwaysAssertM(! isEnd, "Can't dereference the end element of an iterator");
+            return node->valueArray[nextValueArrayIndex]->value;
+        }
+
+        /** Overloaded dereference operator so the iterator can masquerade as a pointer
+            to a member */
+        T const * operator->() const {
+            alwaysAssertM(! isEnd, "Can't dereference the end element of an iterator");
+            return &(stack.last()->valueArray[nextValueArrayIndex]->value);
+        }
+
+        /** Overloaded cast operator so the iterator can masquerade as a pointer
+            to a member */
+        operator T*() const {
+            alwaysAssertM(! isEnd, "Can't dereference the end element of an iterator");
+            return &(stack.last()->valueArray[nextValueArrayIndex]->value);
+        }
+    };
+
+
+    /**
+     Iterates through the members that intersect the box
+     */
+    BoxIntersectionIterator beginBoxIntersection(const AABox& box) const {
+        return BoxIntersectionIterator(box, root);
+    }
+
+    BoxIntersectionIterator endBoxIntersection() const {
+        // The "end" iterator instance
+        return BoxIntersectionIterator();
+    }
+
+    /**
+     Appends all members whose bounds intersect the box.
+     See also AABSPTree::beginBoxIntersection.
+     */
+    void getIntersectingMembers(const AABox& box, Array<T>& members) const {
+        if (root == NULL) {
+            return;
+        }
+        root->getIntersectingMembers(box, Sphere(Vector3::zero(), 0), members, false);
+    }
+
+
+    /**
+     Invoke a callback for every member along a ray until the closest intersection is found.
+
+     @param callback either a function or an instance of a class with an overloaded operator() of the form:
+             
+            <code>void callback(const Ray& ray, const T& object, float& distance)</code>.  If the ray hits the object
+            before travelling distance <code>distance</code>, updates <code>distance</code> with the new distance to
+            the intersection, otherwise leaves it unmodified.  A common example is:
+
+            <pre>
+            class Entity {
+            public:
+
+                void intersect(const Ray& ray, float& maxDist, Vector3& outLocation, Vector3& outNormal) {
+                    float d = maxDist;
+
+                    // ... search for intersection distance d
+
+                    if ((d > 0) && (d < maxDist)) {
+                        // Intersection occured
+                        maxDist = d;
+                        outLocation = ...;
+                        outNormal = ...;
+                    }
+                }
+            };
+
+            // Finds the surface normal and location of the first intersection with the scene
+            class Intersection {
+            public:
+                Entity*     closestEntity;
+                Vector3     hitLocation;
+                Vector3     hitNormal;
+
+                void operator()(const Ray& ray, const Entity* entity, float& distance) {
+                    entity->intersect(ray, distance, hitLocation, hitNormal);
+                }
+            };
+
+            AABSPTree<Entity*> scene;
+
+            Intersection intersection;
+            float distance = inf();
+            scene.intersectRay(camera.worldRay(x, y), intersection, distance);
+          </pre>
+
+
+     @param distance When the method is invoked, this is the maximum distance that the tree should search for an intersection.
+     On return, this is set to the distance to the first intersection encountered.
+
+     @param intersectCallbackIsFast  If false, each object's bounds are tested before the intersectCallback is invoked.
+      If the intersect callback runs at the same speed or faster than AABox-ray intersection, set this to true.
+     */
+    template<typename RayCallback>
+    void intersectRay(
+        const Ray& ray, 
+        RayCallback& intersectCallback, 
+        float& distance,
+        bool pStopAtFirstHit,
+        bool intersectCallbackIsFast = false) const {
+        
+        root->intersectRay(ray, intersectCallback, distance, pStopAtFirstHit, intersectCallbackIsFast);
+
+    }
+
+
+    /**
+      @param members The results are appended to this array.
+     */
+    void getIntersectingMembers(const Sphere& sphere, Array<T>& members) const {
+        if (root == NULL) {
+            return;
+        }
+
+        AABox box;
+        sphere.getBounds(box);
+        root->getIntersectingMembers(box, sphere, members, true);
+
+    }
+#if 0
+    /**
+      Stores the locations of the splitting planes (the structure but not the content)
+      so that the tree can be quickly rebuilt from a previous configuration without 
+      calling balance.
+     */
+    void serializeStructure(BinaryOutput& bo) const {
+        Node::serializeStructure(root, bo);
+    }
+
+    /** Clears the member table */
+    void deserializeStructure(BinaryInput& bi) {
+        clear();
+        root = Node::deserializeStructure(bi);
+    }
+#endif
+    /**
+     Returns an array of all members of the set.  See also AABSPTree::begin.
+     */
+    void getMembers(Array<T>& members) const {
+        Array<Member> temp;
+        memberTable.getKeys(temp);
+        for (int i = 0; i < temp.size(); ++i) {
+            members.append(temp[i].handle->value);
+        }
+    }
+
+
+    /**
+     C++ STL style iterator variable.  See begin().
+     Overloads the -> (dereference) operator, so this acts like a pointer
+     to the current member.
+    */
+    class Iterator {
+    private:
+        friend class AABSPTree<T>;
+
+        // Note: this is a Table iterator, we are currently defining
+        // Set iterator
+        typename Table<Member, Node*>::Iterator it;
+
+        Iterator(const typename Table<Member, Node*>::Iterator& it) : it(it) {}
+
+    public:
+
+        inline bool operator!=(const Iterator& other) const {
+            return !(*this == other);
+        }
+
+        bool operator==(const Iterator& other) const {
+            return it == other.it;
+        }
+
+        /**
+         Pre increment.
+         */
+        Iterator& operator++() {
+            ++it;
+            return *this;
+        }
+
+    private:
+        /**
+         Post increment (slower than preincrement).  Intentionally unimplemented to prevent slow code.
+         */
+        Iterator operator++(int);/* {
+            Iterator old = *this;
+            ++(*this);
+            return old;
+        }*/
+    public:
+
+        const T& operator*() const {
+            return it->key.handle->value;
+        }
+
+        T* operator->() const {
+            return &(it->key.handle->value);
+        }
+
+        operator T*() const {
+            return &(it->key.handle->value);
+        }
+    };
+
+
+    /**
+     C++ STL style iterator method.  Returns the first member.  
+     Use preincrement (++entry) to get to the next element (iteration
+     order is arbitrary).  
+     Do not modify the set while iterating.
+     */
+    Iterator begin() const {
+        return Iterator(memberTable.begin());
+    }
+
+
+    /**
+     C++ STL style iterator method.  Returns one after the last iterator
+     element.
+     */
+    Iterator end() const {
+        return Iterator(memberTable.end());
+    }
+};
+
+}
+
+#endif
+
+
+
diff --git a/contrib/vmap_debugger/ModelContainerView.cpp b/contrib/vmap_debugger/ModelContainerView.cpp
new file mode 100644
index 00000000000..c29666c0bca
--- /dev/null
+++ b/contrib/vmap_debugger/ModelContainerView.cpp
@@ -0,0 +1,570 @@
+#include "ModelContainerView.h"
+
+namespace VMAP
+{
+    char* gDataDir = NULL;
+    char* gLogFile = NULL;
+    //==========================================
+
+    ModelContainerView::ModelContainerView(const G3D::GApp::Settings& settings) : GApp(settings) {
+        i_App = this;
+
+        iCommandFileRW.setFileName(gLogFile);
+        iCurrCmdIndex = 0;
+        iVMapManager = new VMapManager();
+        iDrawLine = false;
+
+        iVARAreaRef = VARArea::create(1024*1024*60);
+        iVARAreaRef2 = VARArea::create(1024*1024*2);
+        iInstanceId = -1;
+        iPosSent = false;
+
+    }
+    //===================================================
+
+    ModelContainerView::~ModelContainerView(void)
+    {
+        Array<std::string > keys = iTriVarTable.getKeys();
+        Array<std::string>::ConstIterator i = keys.begin();
+        while(i != keys.end()) {
+            VAR* var = iTriVarTable.get(*i);
+            delete var;
+            ++i;
+        }
+    }
+
+    //===================================================
+
+    void ModelContainerView::cleanup() {
+    }
+
+    //===================================================
+    Vector3 getViewPos(const ModelContainer* mc, unsigned int pModelNr = 0) {
+        if(mc->getNSubModel() < pModelNr) {
+            pModelNr = mc->getNSubModel();
+        }
+        const SubModel sm = mc->getSubModel(pModelNr);
+        return (sm.getAABoxBounds().low());
+    }
+
+    void ModelContainerView::init() {
+    }
+
+    //==========================================
+
+    void fillSubModelArary(const ModelContainer* pModelContainer, const TreeNode *root, Array<SubModel>& array, Vector3& pLo, Vector3& pHi) {
+        Vector3 lo = Vector3(inf(), inf(), inf());
+        Vector3 hi = Vector3(-inf(), -inf(), -inf());
+
+        for(int i=0; i<	root->getNValues(); i++) {
+            SubModel sm = pModelContainer->getSubModel(root->getStartPosition() + i);
+            lo = lo.min(sm.getAABoxBounds().low());
+            hi = hi.max(sm.getAABoxBounds().high());
+            array.append(sm);
+        }
+
+        if(root->getChild((TreeNode *) &pModelContainer->getTreeNode(0), 0)) {
+            fillSubModelArary(pModelContainer, root->getChild((TreeNode *)&pModelContainer->getTreeNode(0), 0), array, lo, hi);
+        }
+        if(root->getChild((TreeNode *)&pModelContainer->getTreeNode(0), 1)) {
+            fillSubModelArary(pModelContainer, root->getChild((TreeNode *)&pModelContainer->getTreeNode(0), 1), array, lo, hi);
+        }
+
+        float dist1 = (hi -lo).magnitude();
+        AABox b;
+        root->getBounds(b);
+        float dist2 = (b.high() -b.low()).magnitude();
+        if(dist1 > dist2) {
+            // error
+            int xxx = 0;
+        }
+
+    }
+
+    //==========================================
+    void ModelContainerView::addModelContainer(const std::string& pName,const ModelContainer* pModelContainer) {
+        // VARArea::UsageHint::WRITE_EVERY_FEW_FRAMES
+
+        int offset=0;
+
+        Array<int> iIndexArray;
+        Array<Vector3> iGlobArray;
+
+        Array<SubModel> SMArray;
+        Vector3 lo, hi;
+        fillSubModelArary(pModelContainer, &pModelContainer->getTreeNode(0), SMArray,lo,hi);
+
+
+        for(int i=0; i<SMArray.size(); ++i) {
+            SubModel sm = SMArray[i];
+            Array<Vector3> vArray;
+            Array<int> iArray;
+            fillVertexAndIndexArrays(sm, vArray, iArray);
+
+            for(int j=0;j<iArray.size(); ++j) {
+                iIndexArray.append(offset+iArray[j]);
+
+            }
+            for(int j=0;j<vArray.size(); ++j) {
+                iGlobArray.append(vArray[j]);
+            }
+            offset += vArray.size();
+            //break;
+        }
+        iTriVarTable.set(pName, new VAR(iGlobArray ,iVARAreaRef));
+        iTriIndexTable.set(pName, iIndexArray);
+    }
+
+    //===================================================
+
+    void ModelContainerView::removeModelContainer(const std::string& pName, const ModelContainer* pModelContainer) {
+        VAR* var = iTriVarTable.get(pName);
+        iTriVarTable.remove(pName);
+        delete var;
+    }
+
+    Vector3 p1,p2,p3,p4,p5,p6,p7;
+    Array<AABox>gBoxArray;
+    Array<G3D::Triangle>gTriArray;
+    int gCount1 = 0, gCount2 = 0 , gCount3 = 0, gCount4 = 0;
+    bool myfound=false;
+
+    //===================================================
+
+    void ModelContainerView::onInit() {
+        // Called before the application loop beings.  Load data here and
+        // not in the constructor so that common exceptions will be
+        // automatically caught.
+        iSky = Sky::fromFile("../../data/sky/");
+
+        iSkyParameters = SkyParameters(G3D::toSeconds(11, 00, 00, AM));
+        iLighting = Lighting::fromSky(iSky, iSkyParameters, Color3::white());
+
+        // This simple demo has no shadowing, so make all lights unshadowed
+        iLighting->lightArray.append(iLighting->shadowedLightArray);
+        iLighting->shadowedLightArray.clear();
+
+        // Example debug GUI:
+        //debugPane->addCheckBox("Use explicit checking", &explicitCheck);
+        debugWindow->setVisible(true);
+
+        toneMap->setEnabled(false);
+    }
+
+    void ModelContainerView::onGraphics(RenderDevice* rd, Array<PosedModelRef> &posed3D, Array<PosedModel2DRef> &posed2D) {
+        Array<PosedModel::Ref>        opaque, transparent;
+        LightingRef   localLighting = toneMap->prepareLighting(iLighting);
+        SkyParameters localSky      = toneMap->prepareSkyParameters(iSkyParameters);
+
+
+        toneMap->beginFrame(rd);
+        rd->setProjectionAndCameraMatrix(defaultCamera);
+
+        rd->setColorClearValue(Color3::black());
+        rd->clear();
+        //iSky->render(rd, localSky);
+
+        // Setup lighting
+        rd->enableLighting();
+        //rd->setLight(0, localLighting->lightArray[0]);
+        //rd->setAmbientLightColor(localLighting->ambientAverage());
+
+        GLight light =GLight::directional(defaultController.pointer()->position() + defaultController.pointer()->lookVector()*2,Color3::white());
+        rd->setLight(0,light);
+
+        rd->setColor(Color3::blue());
+
+        Array<std::string > keys = iTriVarTable.getKeys();
+        Array<std::string>::ConstIterator i = keys.begin();
+        while(i != keys.end()) {
+            VAR* var = iTriVarTable.get(*i);
+            Array<int> indexArray = iTriIndexTable.get(*i);
+
+            rd->beginIndexedPrimitives();
+            rd->setVertexArray(*var);
+            rd->sendIndices(RenderDevice::LINES, indexArray);
+            rd->endIndexedPrimitives();
+            ++i;
+        }
+        for(int i=0; i<gBoxArray.size(); ++i) {
+            AABox b = gBoxArray[i];
+            Draw::box(b,rd,Color4(Color3::red(),0.9f));
+        }
+        //-------
+        //triangles
+        {
+            if(iTriDebugArray.size() > 0)
+            {
+                rd->setColor(Color3::red());
+                rd->beginIndexedPrimitives();
+                rd->setVertexArray(iTriDebugVar);
+                rd->sendIndices(RenderDevice::LINES, iTriDebugArray);
+                rd->endIndexedPrimitives();
+            }
+        }
+        //--------
+        if(iDrawLine) {
+            Draw::lineSegment(LineSegment::fromTwoPoints(iPos1, iPos2), rd, iColor, 3);
+
+            if(myfound) {
+                //Draw::lineSegment(LineSegment::fromTwoPoints(p1, p2), rd, iColor, 3);
+                //Draw::lineSegment(LineSegment::fromTwoPoints(p2, p3), rd, iColor, 3);
+                //Draw::lineSegment(LineSegment::fromTwoPoints(p3, p1), rd, iColor, 3);
+                Draw::sphere(Sphere(p4,0.5),rd, iColor);
+                //Draw::sphere(Sphere(p5,0.5),rd, Color3::green());
+            }
+        }
+
+
+        // Always render the posed models passed in or the Developer Window and
+        // other Widget features will not appear.
+        if (posed3D.size() > 0) {
+            Vector3 lookVector = renderDevice->getCameraToWorldMatrix().lookVector();
+            PosedModel::sort(posed3D, lookVector, opaque, transparent);
+
+            for (int i = 0; i < opaque.size(); ++i) {
+                opaque[i]->render(renderDevice);
+            }
+
+            for (int i = 0; i < transparent.size(); ++i) {
+                transparent[i]->render(renderDevice);
+            }
+        }
+
+        rd->disableLighting();
+
+        toneMap->endFrame(rd);
+        PosedModel2D::sortAndRender(rd, posed2D);
+    }
+
+    //===================================================
+
+    void ModelContainerView::fillRenderArray(const SubModel& pSm, Array<TriangleBox> &pArray, const TreeNode* pTreeNode) {
+        for(int i=0;i<pTreeNode->getNValues(); i++) {
+            pArray.append(pSm.getTriangles()[i+pTreeNode->getStartPosition()]);
+        }
+
+        if(pTreeNode->getChild(pSm.getTreeNodes(), 0) != 0) {
+            fillRenderArray(pSm, pArray, pTreeNode->getChild(pSm.getTreeNodes(), 0));
+        }
+
+        if(pTreeNode->getChild(pSm.getTreeNodes(), 1) != 0) {
+            fillRenderArray(pSm, pArray, pTreeNode->getChild(pSm.getTreeNodes(), 1));
+        }
+    }
+
+    //===================================================
+
+    void ModelContainerView::fillVertexAndIndexArrays(const SubModel& pSm, Array<Vector3>& vArray, Array<int>& iArray) {
+        Array<TriangleBox> tbarray;
+
+        fillRenderArray(pSm, tbarray, &pSm.getTreeNode(0));
+        MeshBuilder builder;
+        int len = tbarray.size();
+        int count = 0;
+        for(int i=0;i<len;++i) {
+            Triangle t = Triangle(tbarray[i].vertex(0).getVector3() + pSm.getBasePosition(),
+                tbarray[i].vertex(1).getVector3() + pSm.getBasePosition(),
+                tbarray[i].vertex(2).getVector3() + pSm.getBasePosition());
+
+            vArray.append(t.vertex(0));
+            vArray.append(t.vertex(1));
+            vArray.append(t.vertex(2));
+
+            iArray.append(count+0);
+            iArray.append(count+1);
+            iArray.append(count+1);
+            iArray.append(count+2);
+            iArray.append(count+2);
+            iArray.append(count+0);
+            count+=3;
+        }
+    }
+
+    //====================================================================
+
+    void ModelContainerView::showMap(int pMapId, int x, int y) {
+        MapTree* mt = iVMapManager->getInstanceMapTree(pMapId);
+        std::string dirFileName = iVMapManager->getDirFileName(pMapId);
+        if(!mt->hasDirFile(dirFileName)) {
+            dirFileName = iVMapManager->getDirFileName(pMapId, x, y);
+        }
+        showMap(mt,dirFileName);
+        iInstanceId = pMapId;
+    }
+
+    //====================================================================
+
+    bool ModelContainerView::loadAndShowTile(int pMapId, int x, int y) {
+        char buffer[500];
+        sprintf(buffer, "%s/vmaps",gDataDir);
+        bool result = false;
+        //if(pMapId == 1) return true; //+++
+        int val = iVMapManager->loadMap(buffer,(unsigned int) pMapId, x,y);
+        if(val == VMAP_LOAD_RESULT_OK) {
+            result = true;
+            showMap(pMapId,x,y);
+        } else {
+            printf("Unable to load %s\n", buffer);
+        }
+        return(result);
+    }
+
+    //=======================================================================
+
+    void ModelContainerView::showMap(MapTree* mt, std::string dirFileName) {
+        if(mt->hasDirFile(dirFileName)) {
+            FilesInDir filesInDir = mt->getDirFiles(dirFileName);
+            if(filesInDir.getRefCount() == 1) {
+                Array<std::string> fileNames = filesInDir.getFiles();
+                for(int i=0; i<fileNames.size(); ++i) {
+                    std::string name = fileNames[i];
+                    ManagedModelContainer* mc = mt->getModelContainer(name);
+                    //if(mc->getNSubModel() == 791) {
+                    addModelContainer(name, mc);
+                    //}
+                }
+            }
+        }
+    }
+
+    //=======================================================================
+
+    bool ModelContainerView::loadAndShowTile(int pMapId) {
+        char buffer[500];
+        sprintf(buffer, "%s/vmaps",gDataDir);
+        bool result = false;
+        int val = iVMapManager->loadMap(buffer, (unsigned int) pMapId,-1,-1);
+        if(val == VMAP_LOAD_RESULT_OK) {
+            result = true;
+            MapTree* mt = iVMapManager->getInstanceMapTree(pMapId);
+            std::string dirFileName = iVMapManager->getDirFileName(pMapId);
+            iTriVarTable = Table<std::string , VAR*>();
+            iTriIndexTable = Table<std::string , Array<int> >(); // reset table
+            iInstanceId = pMapId;
+            showMap(mt,dirFileName);
+        }
+        return(result);
+    }
+
+    //====================================================================
+
+    void ModelContainerView::processCommand() {
+        iDrawLine = false;
+        if(iCurrCmdIndex < iCmdArray.size()) {
+            bool cmdfound = false;
+            while(!cmdfound && (iCurrCmdIndex < iCmdArray.size())) {
+                Command c = iCmdArray[iCurrCmdIndex];
+                if(c.getType() == LOAD_TILE) {
+                    iPrevLoadCommands.push_back(c);
+                    if(iPosSent) {
+                        if(loadAndShowTile(c.getInt(2),  c.getInt(0), c.getInt(1))) {
+                            printf("load tile mapId=%d, %d, %d\n", c.getInt(2), c.getInt(0), c.getInt(1));
+                        } else {
+                            printf("ERROR: unable to load tile mapId= %d, %d, %d\n", c.getInt(2), c.getInt(0), c.getInt(1));
+                        }
+                        cmdfound = true;
+                    } else {
+                        printf("ignore load tile mapId=%d, %d, %d\n", c.getInt(2), c.getInt(0), c.getInt(1));
+                    }
+                } else if(c.getType() == LOAD_INSTANCE) {
+                    if(loadAndShowTile(c.getInt(0))) {
+                        printf("load instance %d\n", c.getInt(0));
+                    }
+                    cmdfound = true;
+                } else if(c.getType() == UNLOAD_TILE) {
+                    /*
+                    iVMapManager->unloadMap(c.getInt(2), c.getInt(0), c.getInt(1));
+                    printf("unload tile %d, %d\n", c.getInt(0), c.getInt(1));
+
+                    std::string dirFileName = iVMapManager->getDirFileName(iVMapManager->getMapIdNames(c.getInt(2)).iMapGroupName.c_str(), c.getInt(0), c.getInt(1));
+                    MapTree* mt = iVMapManager->getInstanceMapTree(c.getInt(2));
+                    if(mt->hasDirFile(dirFileName)) {
+                    Array<std::string> fileNames = mt->getDirFiles(dirFileName).getFiles();
+                    for(int i=0; i<fileNames.size(); ++i) {
+                    std::string name = fileNames[i];
+                    ManagedModelContainer* mc = mt->getModelContainer(name);
+                    removeModelContainer(name, mc);
+                    }
+                    }
+                    */
+                } else if(c.getType() == SET_POS) {
+                    if(!iPosSent) {
+                        int count = 3;
+                        while(iPrevLoadCommands.size() > 0 && count>0) {
+                            Command lc = iPrevLoadCommands.last();
+                            iPrevLoadCommands.pop_back();
+                            // first time, load the last map needed
+                            if(loadAndShowTile(lc.getInt(2),  lc.getInt(0), lc.getInt(1))) {
+                                printf("load tile mapid=%d, %d, %d\n", lc.getInt(2), lc.getInt(0), lc.getInt(1));
+                            } else {
+                                printf("ERROR: unable to load tile  mapid=%d, %d, %d\n", lc.getInt(2), lc.getInt(0), lc.getInt(1));
+                            }
+                            --count;
+                        }
+                    }
+                    iPosSent = true;
+                    defaultCamera.setPosition(Vector3(c.getVector(0).x,c.getVector(0).y+3, c.getVector(0).z));
+                    defaultController.pointer()->setPosition(Vector3(c.getVector(0).x,c.getVector(0).y+3, c.getVector(0).z));
+                    printf("set pos to %f, %f, %f\n",c.getVector(0).x, c.getVector(0).y, c.getVector(0).z );
+                    cmdfound = true;
+                } else if(c.getType() == TEST_VIS) {
+                    printf("TEST line of sight\n");
+                    iDrawLine = true;
+                    iPos1 = iVMapManager->convertPositionToInternalRep(c.getVector(0).x, c.getVector(0).y, c.getVector(0).z);
+                    iPos2 = iVMapManager->convertPositionToInternalRep(c.getVector(1).x, c.getVector(1).y, c.getVector(1).z);
+                    if(c.getInt(0) != 0) {
+                        iColor = Color3::green();
+                    } else {
+                        iColor = Color3::red();
+                    }
+                    cmdfound = true;
+/*
+                    {
+                        // draw debug-lines
+                        int count = 0;
+                        for(int i=0; i<gTriArray.size(); ++i) {
+                            Triangle &t = gTriArray[i];
+
+                            iVTriDebugArray.append(t.vertex(0));
+                            iVTriDebugArray.append(t.vertex(1));
+                            iVTriDebugArray.append(t.vertex(2));
+
+                            iTriDebugArray.append(count+0);
+                            iTriDebugArray.append(count+1);
+                            iTriDebugArray.append(count+1);
+                            iTriDebugArray.append(count+2);
+                            iTriDebugArray.append(count+2);
+                            iTriDebugArray.append(count+0);
+                            count+=3;
+                        }
+                        iTriDebugVar = VAR(iVTriDebugArray ,iVARAreaRef2);
+                    }
+                    */
+                }
+                ++iCurrCmdIndex;
+            }
+        } else {
+            printf("end reached\n");
+        }
+    }
+
+    //====================================================================
+
+    Vector3 ModelContainerView::convertPositionToMangosRep(float x, float y, float z) const {
+        float pos[3];
+        pos[0] = z;
+        pos[1] = x;
+        pos[2] = y;
+        double full = 64.0*533.33333333;
+        double mid = full/2.0;
+        pos[0] = -((mid+pos[0])-full);
+        pos[1] = -((mid+pos[1])-full);
+
+        return(Vector3(pos));
+    }
+
+
+    //====================================================================
+
+
+    void ModelContainerView::onUserInput(UserInput* ui) {
+        GApp::onUserInput(ui);
+
+        if(ui->keyPressed(GKey::fromString("l"))) { //load
+            iCmdArray = Array<Command>();
+            iCommandFileRW.getNewCommands(iCmdArray);
+            iCurrCmdIndex = 0;
+            processCommand();
+        }
+
+        if(ui->keyPressed(GKey::fromString("r"))) { //restart
+            iCurrCmdIndex = 0;
+        }
+
+        if(ui->keyPressed(GKey::fromString("1"))) { //inc count1
+            gCount1++;
+        }
+
+        if(ui->keyPressed(GKey::fromString("h"))) { //inc count1
+#if 0
+            i_App->defaultController.getPosition();
+            Vector3 pos = i_App->defaultController.getPosition();
+            Vector3 pos2 = convertPositionToMangosRep(pos.x, pos.y, pos.z);
+            //Vector3 pos3 = iVMapManager->convertPositionToInternalRep(pos2.x, pos2.y, pos2.z);
+            //pos3 = iVMapManager->convertPositionToInternalRep(pos2.x, pos2.y, pos2.z);
+
+            float hight = iVMapManager->getHeight(iInstanceId, pos2.x, pos2.y, pos2.z);
+            printf("Hight = %f\n",hight);
+#endif
+        }
+
+
+        if(ui->keyPressed(GKey::fromString("2"))) { //dec count1
+            gCount1--;
+            if(gCount1 < 0) 
+                gCount1 = 0;
+        }
+
+        if(ui->keyPressed(GKey::fromString("z"))) { //zero pos
+            i_App->defaultCamera.setPosition(Vector3(0,0,0));
+            printf("set pos to 0, 0, 0\n");
+        }
+
+
+        if(ui->keyPressed(GKey::fromString("c"))) { //restart
+            if(iCurrCmdIndex > 0) {
+                if(iCmdArray[iCurrCmdIndex-1].getType() == TEST_VIS) {
+                    Vector3 p1 = iCmdArray[iCurrCmdIndex-1].getVector(0);
+                    Vector3 p2 = iCmdArray[iCurrCmdIndex-1].getVector(1);
+                    bool result;
+                    int mapId = iCmdArray[iCurrCmdIndex-1].getInt(1);
+                    gCount3 = gCount2 = 0;// debug counter
+                    gBoxArray = Array<AABox>();
+                    result = iVMapManager->isInLineOfSight(mapId, p1.x,p1.y,p1.z,p2.x,p2.y,p2.z);
+                    printf("recalc last line of light: result = %d\n", result);
+                }
+            }
+        }
+
+
+        if(ui->keyPressed(GKey::LEFT_MOUSE)) {
+            if(		iCurrCmdIndex>0) {
+                --iCurrCmdIndex;
+                printf("restart last command\n");
+                processCommand();
+            }
+        }
+
+        if(ui->keyPressed(GKey::MIDDLE_MOUSE)) {
+            processCommand();
+        }
+
+    }
+    //==========================================
+
+    void ModelContainerView::setViewPosition(const Vector3& pPosition) {
+        //i_App->defaultController.setPosition(pPosition);
+        i_App->defaultCamera.setPosition(pPosition);
+    }
+
+    //==========================================
+    //==========================================
+}
+G3D_START_AT_MAIN();
+int main(int argc, char** argv) {
+    if(argc == 3) {
+        VMAP::gDataDir = argv[1];
+        VMAP::gLogFile = argv[2];
+
+        G3D::GApp::Settings settings;
+        settings.window.width = 1024;
+        settings.window.height = 768;
+        //settings.useDeveloperTools = true;
+
+        VMAP::ModelContainerView modelContainerView(settings);
+        modelContainerView.run();
+    } else {
+        printf("%s <data dir> <vmapcmd.log file>\n",argv[0]);
+    }
+}
diff --git a/contrib/vmap_debugger/ModelContainerView.h b/contrib/vmap_debugger/ModelContainerView.h
new file mode 100644
index 00000000000..28d992a0c16
--- /dev/null
+++ b/contrib/vmap_debugger/ModelContainerView.h
@@ -0,0 +1,89 @@
+#ifndef _MODELCONTAINERVIEW_H
+#define _MODELCONTAINERVIEW_H
+
+#include <G3D/G3DAll.h>
+#include <G3D/System.h>
+#include "ModelContainer.h"
+#include "DebugCmdLogger.h"
+#include "vmapmanager.h"
+
+
+
+
+namespace VMAP
+{
+	//==========================================
+
+
+	//==========================================
+
+	class ModelContainerView : 
+		public G3D::GApp
+	{
+	private:
+        SkyRef              iSky;
+        LightingRef         iLighting;
+        SkyParameters       iSkyParameters;
+
+		VARAreaRef iVARAreaRef;
+		Table<std::string , VAR*> iTriVarTable;
+		Table<std::string , Array<int> > iTriIndexTable;
+
+		VARAreaRef iVARAreaRef2;
+        VAR iTriDebugVar;
+        Array<Vector3> iVTriDebugArray;
+        Array<int> iTriDebugArray;
+
+        //Array<int> iLineIndexArray;
+
+		GApp* i_App;
+		CommandFileRW iCommandFileRW;
+		Array<Command> iCmdArray;
+		int iCurrCmdIndex;
+
+		VMapManager* iVMapManager;
+
+		Vector3 iPos1;
+		Vector3 iPos2;
+		Color3 iColor;
+		bool iDrawLine;
+		int iInstanceId;
+        bool iPosSent;
+        Array<Command> iPrevLoadCommands;
+	private:
+		Vector3 convertPositionToMangosRep(float x, float y, float z) const;
+
+	public:
+		ModelContainerView(const G3D::GApp::Settings& settings);
+
+		~ModelContainerView(void);
+
+		void addModelContainer(const std::string& pName,const ModelContainer* pModelContainer);
+		void removeModelContainer(const std::string& pName, const ModelContainer* pModelContainer);
+		void setViewPosition(const Vector3& pPosition);
+
+		void onGraphics(RenderDevice* rd, Array<PosedModelRef> &posed3D, Array<PosedModel2DRef> &posed2D);
+        virtual void onInit();
+        void init();
+		void cleanup();
+		void onUserInput(UserInput* ui);
+
+		void fillRenderArray(const SubModel& pSm,Array<TriangleBox> &pArray, const TreeNode* pTreeNode);
+		void fillVertexAndIndexArrays(const SubModel& pSm, Array<Vector3>& vArray, Array<int>& iArray);
+
+		bool loadAndShowTile(int pMapId, int x, int y);
+		void showMap(int pMapId, int x, int y);
+
+		void showMap(MapTree* mt, std::string dirFileName);
+		bool loadAndShowTile(int pMapId);
+
+
+		void processCommand();
+
+	};
+
+	//==========================================
+	//==========================================
+}
+
+#endif
diff --git a/contrib/vmap_debugger/VC8/Release/vmapdebugger.exe b/contrib/vmap_debugger/VC8/Release/vmapdebugger.exe
new file mode 100644
index 00000000000..c61082e496e
--- /dev/null
+++ b/contrib/vmap_debugger/VC8/Release/vmapdebugger.exe
diff --git a/contrib/vmap_debugger/VC8/vmapdebugger.vcproj b/contrib/vmap_debugger/VC8/vmapdebugger.vcproj
new file mode 100644
index 00000000000..100ee1eca5e
--- /dev/null
+++ b/contrib/vmap_debugger/VC8/vmapdebugger.vcproj
@@ -0,0 +1,308 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8,00"
+	Name="vmapdebugger"
+	ProjectGUID="{0F6BDF3C-9B6F-45A0-A443-E26E31C8A015}"
+	RootNamespace="vmapdebugger"
+	Keyword="Win32Proj"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug|Win32"
+			OutputDirectory="Debug"
+			IntermediateDirectory="Debug"
+			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="..\..\..\src\shared\vmap;&quot;G:\Core My Work\G3D-7.00\include&quot;"
+				PreprocessorDefinitions="WIN32;_DEBUG;_CONSOLE;_DEBUG_VMAPS"
+				MinimalRebuild="true"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="3"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="4"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/vmapdebugger.exe"
+				LinkIncremental="2"
+				AdditionalLibraryDirectories="&quot;G:\Core My Work\G3D-7.00\lib&quot;"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile="$(OutDir)/vmapdebugger.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="Release|Win32"
+			OutputDirectory="Release"
+			IntermediateDirectory="Release"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.vsprops"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				AdditionalIncludeDirectories="..\..\..\src\shared\vmap;&quot;G:\Core My Work\G3D-7.00\include&quot;"
+				PreprocessorDefinitions="WIN32;NDEBUG;_CONSOLE;_DEBUG;_DEBUG_VMAPS"
+				RuntimeLibrary="2"
+				UsePrecompiledHeader="0"
+				WarningLevel="3"
+				Detect64BitPortabilityProblems="true"
+				DebugInformationFormat="3"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile="$(OutDir)/vmapdebugger.exe"
+				LinkIncremental="1"
+				AdditionalLibraryDirectories="&quot;G:\Core My Work\G3D-7.00\lib&quot;"
+				GenerateDebugInformation="true"
+				SubSystem="1"
+				OptimizeReferences="2"
+				EnableCOMDATFolding="2"
+				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>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;def;odl;idl;hpj;bat;asm;asmx"
+			UniqueIdentifier="{4FC737F1-C7A5-4376-A066-2A32D752A2FF}"
+			>
+			<File
+				RelativePath="..\ModelContainerView.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\ModelContainerView.h"
+				>
+			</File>
+		</Filter>
+		<Filter
+			Name="vmap"
+			>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\AABSPTree.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\BaseModel.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\BaseModel.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\CoordModelMapping.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\CoordModelMapping.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\DebugCmdLogger.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\DebugCmdLogger.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\IVMapManager.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ManagedModelContainer.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ManagedModelContainer.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ModelContainer.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ModelContainer.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\NodeValueAccess.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ShortBox.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\ShortVector.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\SubModel.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\SubModel.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TileAssembler.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TileAssembler.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TreeNode.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\TreeNode.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\VMapDefinitions.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\VMapFactory.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\VMapFactory.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\VMapManager.cpp"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\VMapManager.h"
+				>
+			</File>
+			<File
+				RelativePath="..\..\..\src\shared\vmap\VMapTools.h"
+				>
+			</File>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/contrib/vmap_debugger/bin/vmapdebugger.exe b/contrib/vmap_debugger/bin/vmapdebugger.exe
new file mode 100644
index 00000000000..c61082e496e
--- /dev/null
+++ b/contrib/vmap_debugger/bin/vmapdebugger.exe
diff --git a/contrib/vmap_debugger/readme.txt b/contrib/vmap_debugger/readme.txt
new file mode 100644
index 00000000000..b97715ab080
--- /dev/null
+++ b/contrib/vmap_debugger/readme.txt
@@ -0,0 +1,121 @@
+Here you find a visual debugging tool. With that you can check it yourself. You need to compile it
+yourself or just use the precompiled version. The precompiled version should not need any 
+additional libraries. If you try to compile it yourself you need G3D library 7.00 and 
+SDL 1.2.8 or higher.
+
+There is NO �how to compile support�.... You will manage it, if you need to...
+
+What does it do?
+
+The program analyses the content of the vmapcmd.log file created by [b] mangosd compiled 
+in debug mode [/b] with vmap support. The commands written to disk are read and the result 
+is displayed in a graphical view. This view shows a wire frame model of the loaded vmaps 
+and you can move in these maps. Furthermore you can see witch line of sight query where 
+performed and its result. You are able to perform the ling of sight query again and will see, if 
+the current version of the vmap source compiled against the debugger, produces the same 
+result. This last function is useful for debugging the line of sight code.
+
+The little program is a real hack, but is fits is purpose. 
+
+How to use it:
+
+[b]Logging[b]
+You will need to set _VMAP_LOG_DEBUG when compiling core in debug mode to get this log.
+If mangos is compiled in debug mode it will then write the vmapcmd.log file. The file does only 
+contain the information which vmaps are loaded. I addition to that the file need the 
+information where your character currently in standing in the maps. This position information 
+has to be inserted manually. To do that I modified the .announce command to send the 
+position of the current character to the log file (modification is in the attached patch).
+
+The line of sight query is only stored in the log file if you enable this kind of logging. This is 
+done by performing the modified .gm off command. Enabling line of sight and moving your 
+character a bit will log the queries and there results. Don�t do this for log, it will produce lots 
+of data, which is hard to analyze later.
+
+The modified command .gm on will stop the logging of the line of sight calculation.
+
+What do you have to do for logging?
+1.	Apply the patch to mangos to modify your .announce, .gmoff and .gmon commands
+2.	Compile mangos in debug mode
+3.	Go to the position where you suspect a problem
+4.	Use .gmon to be sure you will not be attacked when you login
+5.	Save, Logoff and stop mangosd
+6.	Delete the vmapcmd.log from the mangos dir. The logger will append to that file.
+7.	Start mangos
+8.	Login with your character
+9.	Send your position to the log file. Do this with the .announce command (.announce 
+foo)
+10.	Type .gmoff enabling the line of sight logging
+11.	Move a bit to get the attention of the mobs
+12.	Type .gmon to stop the logging
+
+[b]Analysing the log file[/b]
+1. Start the vmap debugger with the path to the mangos data dir and the full path (name) of 
+the log file
+2. The debugger is controlled by single keys and the mouse. Here is a list of key commands. 
+The result is displayed at the console:
+
+l � (small L) Load the next block off logging data into the command queue and process the 
+first command from the queue. When the end is reached a message �end reached� is display at 
+the console. If you reached the you can press l again. Sending .gm on sets an end mark to the 
+file. You have to load the next logging block after each .gmon command.
+
+r � Reload the last command block
+
+mouse middle click � process the next command from the queue
+
+mouse left click � reprocess the last command from the queue
+
+c � recalculate the last line of sight command and send the result to the console
+
+w,s,a,d � move within the 3D view
+
+ESC � exit
+
+TAB � release/grep the mouse
+
+[b]How to test the included example with the precompiled version with the included 
+vmapcmd.log file:[b]
+
+open your console
+move to the contrib\vmap_debugger\bin directory
+run: vmapdebugger.exe <your mangos data dir> vmapcmd.log
+Wait until the block screen is open and arrange the console and the screen, so you can see 
+both
+Press: l  (small L not one)
+click middle
+click middle
+click middle
+
+Now you should see the wire frame model of scholo and the green line of sight line in the 
+display. The green line means the test was performed and you are seen. A red line means you 
+are not seen. Move around a bit with the mouse and the w,s,a,d keys.
+
+Press c
+Press ESC
+
+[b]Problems with your gfx.card[/b]
+Maybe the program does not woth with your graphics card. In this case you have dad luck. 
+One think might help, if not .... I do not know...:
+
+Here I take 60 MB Ram from Gfx-Card [b]VARArea::create(1024*1024*60)[/b]. That 
+might cause problems on your system.
+
+[code]
+    ModelContainerView::ModelContainerView(GApp* pApp) :  GApplet(pApp) {
+        i_App = pApp;
+
+        iCommandFileRW.setFileName(gLogFile);
+        iCurrCmdIndex = 0;
+        iVMapManager = new VMapManager();
+        iDrawLine = false;
+
+        iVARAreaRef = VARArea::create(1024*1024*60);
+        iInstanceId = -1;
+
+    }
+[/code]
+
+This should give all of you who, are interested the chance to check the content and behavior 
+of the vmaps.
+
diff --git a/contrib/vmap_debugger/vmapdebugger_VC8.sln b/contrib/vmap_debugger/vmapdebugger_VC8.sln
new file mode 100644
index 00000000000..7a6d347deb1
--- /dev/null
+++ b/contrib/vmap_debugger/vmapdebugger_VC8.sln
@@ -0,0 +1,19 @@
+Microsoft Visual Studio Solution File, Format Version 9.00
+# Visual Studio 2005
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "vmapdebugger", "VC8\vmapdebugger.vcproj", "{0F6BDF3C-9B6F-45A0-A443-E26E31C8A015}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug|Win32 = Debug|Win32
+		Release|Win32 = Release|Win32
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{0F6BDF3C-9B6F-45A0-A443-E26E31C8A015}.Debug|Win32.ActiveCfg = Debug|Win32
+		{0F6BDF3C-9B6F-45A0-A443-E26E31C8A015}.Debug|Win32.Build.0 = Debug|Win32
+		{0F6BDF3C-9B6F-45A0-A443-E26E31C8A015}.Release|Win32.ActiveCfg = Release|Win32
+		{0F6BDF3C-9B6F-45A0-A443-E26E31C8A015}.Release|Win32.Build.0 = Release|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/contrib/vmap_extract_assembler_bin/make vmaps.bat b/contrib/vmap_extract_assembler_bin/make vmaps.bat
new file mode 100644
index 00000000000..bd7e5ca5b25
--- /dev/null
+++ b/contrib/vmap_extract_assembler_bin/make vmaps.bat
@@ -0,0 +1,46 @@
+@echo off
+cls
+echo.
+echo                    Welcome to the vmaps extractor and assembler
+echo.
+echo You need 2GB of free space in disk, CTRL+C to stop process
+echo Hit Enter to start . . .
+pause>nul
+cls
+echo.
+echo.
+echo.
+IF EXIST buildings\dir (ECHO The buildings folder already exist do you want to delete it?
+echo If YES hit Enter to continue if no CLOSE the program now! . . .
+pause>nul
+DEL /S /Q buildings)
+vmapextract_v2.exe
+cls
+echo.
+echo.
+echo.
+IF NOT %ERRORLEVEL% LEQ 1 (echo The vmap extract tool finalized with errors.
+echo Hit Enter to continue . . .
+pause>nul)
+cls
+echo.
+echo.
+echo.
+echo Vmaps extracted check log.txt for errors, now it's time to assemble the vmaps press any key to continue . . .
+pause>nul
+md vmaps
+vmap_assembler.exe buildings vmaps splitConfig.txt
+cls
+echo.
+echo.
+echo.
+IF NOT %ERRORLEVEL% LEQ 1 (echo The vmap assembler tool finalized with errors.
+echo Hit Enter to continue . . .
+pause>nul)
+cls
+echo.
+echo.
+echo.
+echo Process done! copy vmaps folder to the MaNGOS main directory
+echo Press any key to exit . . .
+pause>nul
+\ No newline at end of file
diff --git a/contrib/vmap_extract_assembler_bin/makevmaps_SIMPLE.bat b/contrib/vmap_extract_assembler_bin/makevmaps_SIMPLE.bat
new file mode 100644
index 00000000000..bf01c24edc6
--- /dev/null
+++ b/contrib/vmap_extract_assembler_bin/makevmaps_SIMPLE.bat
@@ -0,0 +1,5 @@
+vmapextract_v2.exe
+md vmaps
+vmap_assembler.exe buildings vmaps splitConfig.txt
+
+pause
+\ No newline at end of file
diff --git a/contrib/vmap_extract_assembler_bin/readme.txt b/contrib/vmap_extract_assembler_bin/readme.txt
new file mode 100644
index 00000000000..85abfb237be
--- /dev/null
+++ b/contrib/vmap_extract_assembler_bin/readme.txt
@@ -0,0 +1,4 @@
+execute make vmaps.bat to make vmaps step by sep
+execute makevmaps_SIMPLE.bat to so it in one step no quesions final screen [recommended]
+
+put vmaps folder in mangos main folder to enable LOS [Line Of Sight]
+\ No newline at end of file
diff --git a/contrib/vmap_extract_assembler_bin/splitConfig.txt b/contrib/vmap_extract_assembler_bin/splitConfig.txt
new file mode 100644
index 00000000000..de8fd67bdc4
--- /dev/null
+++ b/contrib/vmap_extract_assembler_bin/splitConfig.txt
@@ -0,0 +1,17 @@
+# list of map names
+
+509 #AhnQiraj  
+469 #BlackwingLair
+189 #MonasteryInstances
+030 #PVPZone01
+037 #PVPZone02
+033 #Shadowfang
+533 #Stratholme Raid
+209 #TanarisInstance
+309 #Zul'gurub
+560 #HillsbradPast
+534 #HyjalPast
+532 #Karazahn
+543 #HellfireRampart
+568 #ZulAman
+564 #BlackTemple
diff --git a/contrib/vmap_extract_assembler_bin/vmap_assembler.exe b/contrib/vmap_extract_assembler_bin/vmap_assembler.exe
new file mode 100644
index 00000000000..5cb08f770aa
--- /dev/null
+++ b/contrib/vmap_extract_assembler_bin/vmap_assembler.exe
diff --git a/contrib/vmap_extract_assembler_bin/vmapextract_v2.exe b/contrib/vmap_extract_assembler_bin/vmapextract_v2.exe
new file mode 100644
index 00000000000..c38b6e64f64
--- /dev/null
+++ b/contrib/vmap_extract_assembler_bin/vmapextract_v2.exe
diff --git a/contrib/vmap_extractor_v2/doc/The MoPaQ File Format.txt b/contrib/vmap_extractor_v2/doc/The MoPaQ File Format.txt
new file mode 100644
index 00000000000..ce8d8f70166
--- /dev/null
+++ b/contrib/vmap_extractor_v2/doc/The MoPaQ File Format.txt
@@ -0,0 +1,318 @@
+THE MOPAQ ARCHIVE FORMAT
+v0.9 (Thursday, June 30, 2005)
+by Justin Olbrantz(Quantam)
+
+Distribution and reproduction of this specification are allowed without limitation, as long as it is not altered. Quoting
+in other works is freely allowed, as long as the source and author of the quote is stated.
+
+TABLE OF CONTENTS
+1. Introduction to the MoPaQ Format
+2. The MoPaQ Format
+	2.1 General Archive Layout
+	2.2 Archive Header
+	2.3 Block Table
+	2.4 Hash Table
+	2.5 File Data
+	2.6 Listfile
+	2.7 Extended Attributes
+	2.8 Weak (Old) Digital Signature
+	2.9 Strong (New) Digital Signature
+3. Algorithm Source Code
+	3.1 Encryption/Decryption
+	3.2 Hashing
+	3.3 Conversion of FILETIME and time_t
+
+1. INTRODUCTION TO THE MOPAQ FORMAT
+The MoPaQ (or MPQ) format is an archive file format designed by Mike O'Brien (hence the name Mike O'brien PaCK) at Blizzard
+Entertainment. The format has been used in all Blizzard games since (and including) Diablo. It is heavily optimized to be
+a read-only game archive format, and excels at this role. 
+
+The Blizzard MoPaQ-reading functions are contained in the Storm module, which my be either statically or dynamically linked.
+The Blizzard MoPaQ-writing functions are contained in the MPQAPI module, which is always statically linked.
+
+2. THE MOPAQ FORMAT
+All numbers in the MoPaQ format are in little endian. Data types are listed either as int (integer, the number of bits specified),
+byte (8 bits), and char (bytes which contain ASCII characters). All sizes and offsets are in bytes, unless specified otherwise.
+Structure members are listed in the following general form:
+offset from the beginning of the structure: data type(array size) member name : member description
+
+2.1 GENERAL ARCHIVE LAYOUT
+- Archive Header
+- File Data
+- File Data - Special Files
+- Hash Table
+- Block Table
+- Strong Digital signature
+
+This is the usual archive format, and is not absolutely essential. Some archives have been observed placing the hash table
+and file table after the archive header, and before the file data.
+
+2.2 ARCHIVE HEADER
+00h: char(4) Magic : Indicates that the file is a MoPaQ archive. Must be ASCII "MPQ" 1Ah.
+04h: int32 HeaderSize : Size of the archive header. Should be 32.
+08h: int32 ArchiveSize : Size of the whole archive, including the header. Does not include the strong digital signature, if present.
+This size is used, among other things, for determining the region to hash in computing the digital signature.
+0Ch: int16 Unknown : Unknown
+0Eh: int8 SectorSizeShift : Power of two exponent specifying the number of 512-byte disk sectors in each logical sector
+in the archive. The size of each logical sector the archive is 512 * 2^SectorSizeShift. Bugs in the Storm library dictate
+that this should always be 3 (4096 byte sectors).
+10h: int32 HashTableOffset : Offset to the beginning of the hash table, relative to the beginning of the archive.
+14h: int32 BlockTableOffset : Offset to the beginning of the block table, relative to the beginning of the archive.
+18h: int32 HashTableEntries : Number of entries in the hash table. Must be a power of two, and must be less than 2^16.
+1Ch: int32 BlockTableEntries : Number of entries in the block table.
+
+The archive header is the first structure in the archive, at archive offset 0, but the archive does not need to be at offset
+0 of the containing file. The offset of the archive in the file is referred to here as ArchiveOffset. If the archive is not
+at the beginning of the file, it must begin at a disk sector boundary (512 bytes). Early versions of Storm require that the
+archive be at the end of the containing file (ArchiveOffset + ArchiveSize = file size), but this is not required in newer
+versions (due to the strong digital signature not being considered a part of the archive).
+
+2.3 BLOCK TABLE
+The block table contains entries for each region in the archive. Regions may be either files or empty space, which may be
+overwritten by new files (typically this space is from deleted file data). The block table is encrypted, using the hash
+of "(block table)" as the key. Each entry is structured as follows:
+
+00h: int32 BlockOffset : Offset of the beginning of the block, relative to the beginning of the archive. Meaningless if the block size is 0.
+04h: int32 BlockSize : Size of the block in the archive.
+08h: int32 FileSize : Size of the file data stored in the block. Only valid if the block is a file, otherwise meaningless, and should be 0. If the file is compressed, this is the size of the uncompressed file data.
+0Ch: int32 Flags : Bit mask of the flags for the block. The following values are conclusively identified:
+	80000000h: Block is a file, and follows the file data format; otherwise, block is free space, and may be overwritten. If the block is not a file, all other flags should be cleared.
+	01000000h: File is stored as a single unit, rather than split into sectors.
+	00020000h: The file's encryption key is adjusted by the block offset and file size (explained in detail in the File Data section). File must be encrypted.
+	00010000h: File is encrypted.
+	00000200h: File is compressed. Mutually exclusive to file imploded.
+	00000100h: File is imploded. Mutually exclusive to file compressed.
+
+2.4 HASH TABLE
+Instead of storing file names, for quick access MoPaQs use a fixed, power of two-size hash table of files in the archive. A file is uniquely identified by its file path, its language, and its platform. The home entry for a file in the hash table is computed as a hash of the file path. In the event of a collision (the home entry is occupied by another file), progressive overflow is used, and the file is placed in the next available hash table entry. Searches for a desired file in the hash table proceed from the home entry for the file until either the file is found, the entire hash table is searched, or an empty hash table entry (FileBlockIndex of FFFFFFFFh) is encountered. The hash table is encrypted using the hash of "(hash table)" as the key. Each entry is structured as follows:
+
+00h: int32 FilePathHashA : The hash of the file path, using method A.
+04h: int32 FilePathHashB : The hash of the file path, using method B.
+08h: int16 Language : The language of the file. This is a Windows LANGID data type, and uses the same values. 0 indicates the default language (American English), or that the file is language-neutral.
+0Ah: int8 Platform : The platform the file is used for. 0 indicates the default platform. No other values have been observed.
+0Ch: int32 FileBlockIndex : If the hash table entry is valid, this is the index into the block table of the file. Otherwise, one of the following two values:
+	FFFFFFFFh: Hash table entry is empty, and has always been empty. Terminates searches for a given file.
+	FFFFFFFEh: Hash table entry is empty, but was valid at some point (in other words, the file was deleted). Does not terminate searches for a given file.
+
+2.5 FILE DATA
+00h: int32(SectorsInFile + 1) SectorOffsetTable : Offsets to the start of each sector's data, relative to the beginning of the file data. Not present if this information is calculatable (see details below).
+immediately following SectorOffsetTable: SectorData : Data of each sector in the file, packed end to end (see details below).
+
+Normally, file data is split up into sectors, for simple streaming. All sectors, save for the last, will contain as many bytes of file data as specified in the archive header's SectorSizeShift; the last sector may be smaller than this, depending on the size of the file data. This sector size is the size of the raw file data; if the file is compressed, the compressed sector will be smaller or the same size as the uncompressed sector size. Individual sectors in a compressed file may be stored uncompressed; this occurs if and only if the sector could not be compressed by the algorithm used (if the compressed sector size was greater than or equal to the size of the raw data), and is indicated by the sector's compressed size in SectorOffsetTable being equal to the uncompressed size of the sector (which may be calculated from the FileSize).
+
+If the sector is compressed (but not imploded), a bit mask byte of the compression algorithm(s) used to compress the sector is appended to the beginning of the compressed sector data. This additional byte counts towards the total size of the sector; if the size of the sector (including this byte) exceeds or matches the uncompressed size of the sector data, the sector will be stored uncompressed, and this byte omitted. Multiple compression algorithms may be used on the same sector; in this case, successive compression occurs in the order the algorithms are listed below, and decompression occurs in the opposite order. For implimentations of all of these algorithms, see StormLib.
+	40h: IMA ADPCM mono
+	80h: IMA ADPCM stereo
+	01h: Huffman encoded
+	02h: Deflated (see ZLib)
+	08h: Imploded (see PKWare Data Compression Library)
+	10h: BZip2 compressed (see BZip2)
+
+If the file is stored as a single unit (indicated in the file's Flags), there is effectively only a single sector, which
+contains the entire file.
+
+If the file is encrypted, each sector (after compression and appendage of the compression type byte, if applicable)
+is encrypted with the file's key. The base key for a file is determined by a hash of the file name stripped of the
+directory (i.e. the key for a file named "directory\file" would be computed as the hash of "file"). If this key is
+adjusted, as indicated in the file's Flags, the final key is calculated as ((base key + BlockOffset - ArchiveOffset)
+XOR FileSize) (StormLib - an open-source implementation of the MoPaQ reading and writing functions,
+by Ladislav Zezula - incorrectly uses an AND in place of the XOR). Each sector is encrypted using the key + the
+0-based index of the sector in the file. The SectorOffsetTable, if present, is encrypted using the key - 1.
+
+The SectorOffsetTable is omitted when the sizes and offsets of all sectors in the file are calculatable from the FileSize.
+This can happen in several circumstances. If the file is not compressed/imploded, then the size and offset of all sectors
+is known, based on the archive's SectorSizeShift. If the file is stored as a single unit compressed/imploded, then the
+SectorOffsetTable is omitted, as the single file "sector" corresponds to BlockSize and FileSize, as mentioned previously.
+Note that the SectorOffsetTable will always be present if the file is compressed/imploded and the file is not stored as
+a single unit, even if there is only a single sector in the file (the size of the file is less than or equal to the
+archive's sector size).
+
+2.6 LISTFILE
+The listfile is a very simple extension to the MoPaQ format that contains the file paths of (most) files in the archive.
+The languages and platforms of the files are not stored in the listfile. The listfile is contained in the file "(listfile)",
+and is simply a non-Unix-style text file with one file path on each line, lines terminated with the bytes 0Dh 0Ah. The file
+"(listfile)" may not be listed in the listfile.
+
+2.7 EXTENDED ATTRIBUTES
+The extended attributes are optional file attributes for files in the block table. These attributes were added at times after
+the MoPaQ format was already finalized, and it is not necessary for every archive to have all (or any) of the extended attributes.
+If an archive contains a given attribute, there will be an instance of that attribute for every block in the block table, although
+the attribute will be meaningless if the block is not a file. The order of the attributes for blocks correspond to the order of the
+blocks in the block table, and are of the same number. The attributes are stored in parallel arrays in the "(attributes)" file,
+in the archive. The attributes corresponding to this file need not be valid (and logically cannot be). Unlike all the other
+structures in the MoPaQ format, entries in the extended attributes are NOT guaranteed to be aligned. Also note that in some
+archives, malicious zeroing of the attributes has been observed, perhaps with the intent of breaking archive viewers. This
+file is structured as follows:
+
+00h: int32 Version : Specifies the extended attributes format version. For now, must be 100.
+04h: int32 AttributesPresent : Bit mask of the extended attributes present in the archive:
+	00000001h: File CRC32s.
+	00000002h: File timestamps.
+	00000004h: File MD5s.
+08h: int32(BlockTableEntries) CRC32s : CRC32s of the (uncompressed) file data for each block in the archive. Omitted if the
+archive does not have CRC32s. immediately after CRC32s: FILETIME(BlockTableEntries) Timestamps : Timestamps for each block
+in the archive. The format is that of the Windows FILETIME structure. Omitted if the archive does not have timestamps.
+immediately after Timestamps: MD5(BlockTableEntries) MD5s : MD5s of the (uncompressed) file data for each block in the archive.
+Omitted if the archive does not have MD5s.
+
+2.8 WEAK DIGITAL SIGNATURE
+The weak digital signature is a digital signature using Microsoft CryptoAPI. It is an implimentation of the RSASSA-PKCS1-v1_5
+digital signature protocol, using the MD5 hashing algorithm and a 512-bit (weak) RSA key (for more information about this
+protocol, see the RSA Labs PKCS1 specification). The public key and exponent are stored in a resource in Storm. The signature
+is stored uncompressed, unencrypted in the file "(signature)" in the archive. The archive is hashed from the beginning of the
+archive (ArchiveOffset in the containing file) to the end of the archive (the length indicated by ArchiveSize); the signature
+file is added to the archive before signing, and the space occupied by the file is considered to be all binary 0s during
+signing/verification. This file is structured as follows:
+
+00h: int32 Unknown : Must be 0.
+04h: int32 Unknown : must be 0.
+08h: int512 Signature : The digital signature. Like all other numbers in the MoPaQ format, this is stored in little-endian order.
+
+2.9 STRONG DIGITAL SIGNATURE
+The strong digital signature uses a simple proprietary implementation of RSA signing, using the SHA-1 hashing algorithm and
+a 2048-bit (strong) RSA key. The default public key and exponent are stored in Storm, but other keys may be used as well.
+The strong digital signature is stored immediately after the archive, in the containing file; the entire archive (ArchiveSize
+bytes, starting at ArchiveOffset in the containing file) is hashed as a single block. The signature has the following format:
+
+00h: char(4) Magic : Indicates the presence of a digital signature. Must be "NGIS" ("SIGN" backwards).
+04h: int2048 Signature : The digital signature, stored in little-endian format.
+
+When the Signature field is decrypted with the public key and exponent, and the result stored in little-endian order, it is structured as follows:
+
+00h: byte Padding : Must be 0Bh.
+01h: byte(235) Padding : Must be BBh.
+ECh: byte(20) SHA-1 : SHA-1 hash of the archive, in standard SHA-1 format.
+
+3. ALGORITHM SOURCE CODE
+3.1 ENCRYPTION/DECRYPTION
+I believe this was derived at some point from code in StormLib. Assumes the long type to be 32 bits, and the machine to be little endian order.
+
+unsigned long dwCryptTable[0x500];
+
+void InitializeCryptTable()
+{
+    unsigned long seed   = 0x00100001;
+    unsigned long index1 = 0;
+    unsigned long index2 = 0;
+    int   i;
+
+    for (index1 = 0; index1 < 0x100; index1++)
+    {
+        for (index2 = index1, i = 0; i < 5; i++, index2 += 0x100)
+        {
+            unsigned long temp1, temp2;
+
+            seed  = (seed * 125 + 3) % 0x2AAAAB;
+            temp1 = (seed & 0xFFFF) << 0x10;
+
+            seed  = (seed * 125 + 3) % 0x2AAAAB;
+            temp2 = (seed & 0xFFFF);
+
+            dwCryptTable[index2] = (temp1 | temp2);
+        }
+    }
+}
+
+void EncryptData(void *lpbyBuffer, unsigned long dwLength, unsigned long dwKey)
+{
+    unsigned long *lpdwBuffer = (unsigned long *)lpbyBuffer;
+    unsigned long seed = 0xEEEEEEEE;
+    unsigned long ch;
+
+	assert(lpbyBuffer);
+
+    dwLength /= sizeof(unsigned long);
+
+    while(dwLength-- > 0)
+    {
+        seed += dwCryptTable[0x400 + (dwKey & 0xFF)];
+        ch = *lpdwBuffer ^ (dwKey + seed);
+
+        dwKey = ((~dwKey << 0x15) + 0x11111111) | (dwKey >> 0x0B);
+        seed = *lpdwBuffer + seed + (seed << 5) + 3;
+
+		*lpdwBuffer++ = ch;
+    }
+}
+
+void DecryptData(void *lpbyBuffer, unsigned long dwLength, unsigned long dwKey)
+{
+	unsigned long *lpdwBuffer = (unsigned long *)lpbyBuffer;
+    unsigned long seed = 0xEEEEEEEE;
+    unsigned long ch;
+
+	assert(lpbyBuffer);
+
+    dwLength /= sizeof(unsigned long);
+
+    while(dwLength-- > 0)
+    {
+        seed += dwCryptTable[0x400 + (dwKey & 0xFF)];
+        ch = *lpdwBuffer ^ (dwKey + seed);
+
+        dwKey = ((~dwKey << 0x15) + 0x11111111) | (dwKey >> 0x0B);
+        seed = ch + seed + (seed << 5) + 3;
+
+		*lpdwBuffer++ = ch;
+    }
+}
+
+3.2 HASHING
+Based on code from StormLib.
+
+// Different types of hashes to make with HashString
+#define MPQ_HASH_TABLE_OFFSET	0
+#define MPQ_HASH_NAME_A	1
+#define MPQ_HASH_NAME_B	2
+#define MPQ_HASH_FILE_KEY	3
+
+unsigned long HashString(const char *lpszString, unsigned long dwHashType)
+{
+    unsigned long  seed1 = 0x7FED7FED;
+    unsigned long  seed2 = 0xEEEEEEEE;
+    int    ch;
+
+    while (*lpszString != 0)
+    {
+        ch = toupper(*lpszString++);
+
+        seed1 = dwCryptTable[(dwHashType * 0xFF) + ch] ^ (seed1 + seed2);
+        seed2 = ch + seed1 + seed2 + (seed2 << 5) + 3;
+    }
+    return seed1;
+}
+
+3.3 CONVERSION OF FILETIME AND time_t
+
+#define EPOCH_OFFSET 116444736000000000ULL	// Number of 100 ns units between 01/01/1601 and 01/01/1970
+
+bool GetTimeFromFileTime(FILETIME &fileTime, time_t &time)
+{
+	// The FILETIME represents a 64-bit integer: the number of 100 ns units since January 1, 1601
+	unsigned long long nTime = ((unsigned long long)fileTime.dwHighDateTime << 32) + fileTime.dwLowDateTime;
+
+	if (nTime < EPOCH_OFFSET)
+		return false;
+
+	nTime -= EPOCH_OFFSET;	// Convert the time base from 01/01/1601 to 01/01/1970
+	nTime /= 10000000ULL;	// Convert 100 ns to sec
+
+	time = (time_t)nTime;
+
+	// Test for overflow (FILETIME is 64 bits, time_t is 32 bits)
+	if ((nTime - (unsigned long long)time) > 0)
+		return false;
+
+	return true;
+}
+
+void GetFileTimeFromTime(time_t &time, FILETIME &fileTime)
+{
+	unsigned long long nTime = (unsigned long long)time;
+
+	nTime *= 10000000ULL;
+	nTime += EPOCH_OFFSET;
+
+	fileTime.dwLowDateTime = (DWORD)nTime;
+	fileTime.dwHighDateTime = (DWORD)(nTime >> 32);
+}
diff --git a/contrib/vmap_extractor_v2/doc/The_MoPaQ_File_Format.txt b/contrib/vmap_extractor_v2/doc/The_MoPaQ_File_Format.txt
new file mode 100644
index 00000000000..6a21eca5472
--- /dev/null
+++ b/contrib/vmap_extractor_v2/doc/The_MoPaQ_File_Format.txt
@@ -0,0 +1,421 @@
+THE MOPAQ ARCHIVE FORMAT
+v1.0 (Friday, September 1, 2006)
+by Justin Olbrantz(Quantam)
+
+Distribution and reproduction of this specification are allowed without limitation, as long as it is not altered. Quotation in other works is freely allowed, as long as the source and author of the quote are stated.
+
+TABLE OF CONTENTS
+1. Introduction to the MoPaQ Format
+2. The MoPaQ Format
+	2.1 General Archive Layout
+	2.2 Archive Header
+	2.3 Block Table
+	2.4 Extended Block Table
+	2.5 Hash Table
+	2.6 File Data
+	2.7 Listfile
+	2.8 Extended Attributes
+	2.9 Weak (Old) Digital Signature
+	2.10 Strong (New) Digital Signature
+3. Algorithm Source Code
+	3.1 Encryption/Decryption
+	3.2 Hashing and File Key Computation
+	3.3 Finding Files
+	3.4 Deleting Files
+	3.5 Conversion of FILETIME and time_t
+	3.6 Forming a 64-bit Large Archive Offset from 32-bit and 16-bit Components
+4. Revision History
+
+1. INTRODUCTION TO THE MOPAQ FORMAT
+The MoPaQ (or MPQ) format is an archive file format designed by Mike O'Brien (hence the name Mike O'brien PaCK) at Blizzard Entertainment. The format has been used in all Blizzard games since (and including) Diablo. It is heavily optimized to be a read-only game archive format, and excels at this role. 
+
+The Blizzard MoPaQ-reading functions are contained in the Storm module, which my be either statically or dynamically linked. The Blizzard MoPaQ-writing functions are contained in the MPQAPI module, which is always statically linked.
+
+StormLib - mentioned several times in this specification - is an open-source MoPaQ reading and writing library written by Ladislav Zezula (no affiliation with Blizzard Entertainment). While it's a bit dated, and does not support all of the newer MoPaQ features, it contains source code to the more exotic compression methods used by MoPaQ, such as the PKWare implode algorithm, MoPaQ's huffman compression algorithm, and the IMA ADPCM compression used by MoPaQ.
+
+2. THE MOPAQ FORMAT
+All numbers in the MoPaQ format are in little endian byte order; signed numbers use the two's complement system. Data types are listed either as int (integer, the number of bits specified), byte (8 bits), or char (bytes which contain ASCII characters). All sizes and offsets are in bytes, unless specified otherwise. Structure members are listed in the following general form:
+offset from the beginning of the structure: data type(array size) member name : member description
+
+2.1 GENERAL ARCHIVE LAYOUT
+- Archive Header
+- File Data
+- File Data - Special Files
+- Hash Table
+- Block Table
+- Extended Block Table
+- Strong Digital signature
+
+This is the usual archive format, but it is not mandatory. Some archives have been observed placing the hash table and file table after the archive header, and before the file data.
+
+2.2 ARCHIVE HEADER
+00h: char(4) Magic : Indicates that the file is a MoPaQ archive. Must be ASCII "MPQ" 1Ah.
+04h: int32 HeaderSize : Size of the archive header.
+08h: int32 ArchiveSize : Size of the whole archive, including the header. Does not include the strong digital signature, if present. This size is used, among other things, for determining the region to hash in computing the digital signature. This field is deprecated in the Burning Crusade MoPaQ format, and the size of the archive is calculated as the size from the beginning of the archive to the end of the hash table, block table, or extended block table (whichever is largest).
+0Ch: int16 FormatVersion : MoPaQ format version. MPQAPI will not open archives where this is negative. Known versions:
+	0000h: Original format. HeaderSize should be 20h, and large archives are not supported.
+	0001h: Burning Crusade format. Header size should be 2Ch, and large archives are supported.
+0Eh: int8 SectorSizeShift : Power of two exponent specifying the number of 512-byte disk sectors in each logical sector in the archive. The size of each logical sector in the archive is 512 * 2^SectorSizeShift. Bugs in the Storm library dictate that this should always be 3 (4096 byte sectors).
+10h: int32 HashTableOffset : Offset to the beginning of the hash table, relative to the beginning of the archive.
+14h: int32 BlockTableOffset : Offset to the beginning of the block table, relative to the beginning of the archive.
+18h: int32 HashTableEntries : Number of entries in the hash table. Must be a power of two, and must be less than 2^16 for the original MoPaQ format, or less than 2^20 for the Burning Crusade format.
+1Ch: int32 BlockTableEntries : Number of entries in the block table.
+Fields only present in the Burning Crusade format and later:
+20h: int64 ExtendedBlockTableOffset : Offset to the beginning of the extended block table, relative to the beginning of the archive.
+28h: int16 HashTableOffsetHigh : High 16 bits of the hash table offset for large archives.
+2Ah: int16 BlockTableOffsetHigh : High 16 bits of the block table offset for large archives.
+
+The archive header is the first structure in the archive, at archive offset 0; however, the archive does not need to be at offset 0 of the containing file. The offset of the archive in the file is referred to here as ArchiveOffset. If the archive is not at the beginning of the file, it must begin at a disk sector boundary (512 bytes). Early versions of Storm require that the archive be at the end of the containing file (ArchiveOffset + ArchiveSize = file size), but this is not required in newer versions (due to the strong digital signature not being considered a part of the archive).
+
+2.3 BLOCK TABLE
+The block table contains entries for each region in the archive. Regions may be either files, empty space, which may be overwritten by new files (typically this space is from deleted file data), or unused block table entries. Empty space entries should have BlockOffset and BlockSize nonzero, and FileSize and Flags zero; unused block table entries should have BlockSize, FileSize, and Flags zero. The block table is encrypted, using the hash of "(block table)" as the key. Each entry is structured as follows:
+
+00h: int32 BlockOffset : Offset of the beginning of the block, relative to the beginning of the archive.
+04h: int32 BlockSize : Size of the block in the archive.
+08h: int32 FileSize : Size of the file data stored in the block. Only valid if the block is a file; otherwise meaningless, and should be 0. If the file is compressed, this is the size of the uncompressed file data.
+0Ch: int32 Flags : Bit mask of the flags for the block. The following values are conclusively identified:
+	80000000h: Block is a file, and follows the file data format; otherwise, block is free space or unused. If the block is not a file, all other flags should be cleared, and FileSize should be 0.
+	01000000h: File is stored as a single unit, rather than split into sectors.
+	00020000h: The file's encryption key is adjusted by the block offset and file size (explained in detail in the File Data section). File must be encrypted.
+	00010000h: File is encrypted.
+	00000200h: File is compressed. File cannot be imploded.
+	00000100h: File is imploded. File cannot be compressed.
+
+2.4 EXTENDED BLOCK TABLE
+The extended block table was added to support archives larger than 4 gigabytes (2^32 bytes). The table contains the upper bits of the archive offsets for each block in the block table. It is simply an array of int16s, which become bits 32-47 of the archive offsets for each block, with bits 48-63 being zero. Individual blocks in the archive are still limited to 4 gigabytes in size. This table is only present in Burning Crusade format archives that exceed 4 gigabytes size.
+
+As of the Burning Crusade Friends and Family beta, this table is not encrypted.
+
+2.5 HASH TABLE
+Instead of storing file names, for quick access MoPaQs use a fixed, power of two-size hash table of files in the archive. A file is uniquely identified by its file path, its language, and its platform. The home entry for a file in the hash table is computed as a hash of the file path. In the event of a collision (the home entry is occupied by another file), progressive overflow is used, and the file is placed in the next available hash table entry. Searches for a desired file in the hash table proceed from the home entry for the file until either the file is found, the entire hash table is searched, or an empty hash table entry (FileBlockIndex of FFFFFFFFh) is encountered. The hash table is encrypted using the hash of "(hash table)" as the key. Each entry is structured as follows:
+
+00h: int32 FilePathHashA : The hash of the file path, using method A.
+04h: int32 FilePathHashB : The hash of the file path, using method B.
+08h: int16 Language : The language of the file. This is a Windows LANGID data type, and uses the same values. 0 indicates the default language (American English), or that the file is language-neutral.
+0Ah: int8 Platform : The platform the file is used for. 0 indicates the default platform. No other values have been observed.
+0Ch: int32 FileBlockIndex : If the hash table entry is valid, this is the index into the block table of the file. Otherwise, one of the following two values:
+	FFFFFFFFh: Hash table entry is empty, and has always been empty. Terminates searches for a given file.
+	FFFFFFFEh: Hash table entry is empty, but was valid at some point (in other words, the file was deleted). Does not terminate searches for a given file.
+
+2.6 FILE DATA
+The data for each file is composed of the following structure:
+00h: int32(SectorsInFile + 1) SectorOffsetTable : Offsets to the start of each sector, relative to the beginning of the file data. The last entry contains the file size, making it possible to easily calculate the size of any given sector. This table is not present if this information can be calculated (see details below).
+immediately following SectorOffsetTable: SECTOR Sectors(SectorsInFile) : Data of each sector in the file, packed end to end (see details below).
+
+Normally, file data is split up into sectors, for simple streaming. All sectors, save for the last, will contain as many bytes of file data as specified in the archive header's SectorSizeShift; the last sector may contain less than this, depending on the size of the entire file's data. If the file is compressed or imploded, the sector will be smaller or the same size as the file data it contains. Individual sectors in a compressed or imploded file may be stored uncompressed; this occurs if and only if the file data the sector contains could not be compressed by the algorithm(s) used (if the compressed sector size was greater than or equal to the size of the file data), and is indicated by the sector's size in SectorOffsetTable being equal to the size of the file data in the sector (which may be calculated from the FileSize). 
+
+The format of each sector depends on the kind of sector it is. Uncompressed sectors are simply the the raw file data contained in the sector. Imploded sectors are the raw compressed data following compression with the implode algorithm (these sectors can only be in imploded files). Compressed sectors (only found in compressed - not imploded - files) are compressed with one or more compression algorithms, and have the following structure:
+00h: byte CompressionMask : Mask of the compression types applied to this sector. If multiple compression types are used, they are applied in the order listed below, and decompression is performed in the opposite order. This byte counts towards the total sector size, meaning that the sector will be stored uncompressed if the data cannot be compressed by at least two bytes; as well, this byte is encrypted with the sector data, if applicable. The following compression types are defined (for implementations of these algorithms, see StormLib):
+	40h: IMA ADPCM mono
+	80h: IMA ADPCM stereo
+	01h: Huffman encoded
+	02h: Deflated (see ZLib)
+	08h: Imploded (see PKWare Data Compression Library)
+	10h: BZip2 compressed (see BZip2)
+01h: byte(SectorSize - 1) SectorData : The compressed data for the sector.
+
+If the file is stored as a single unit (indicated in the file's Flags), there is effectively only a single sector, which contains the entire file data.
+
+If the file is encrypted, each sector (after compression/implosion, if applicable) is encrypted with the file's key. The base key for a file is determined by a hash of the file name stripped of the directory (i.e. the key for a file named "directory\file" would be computed as the hash of "file"). If this key is adjusted, as indicated in the file's Flags, the final key is calculated as ((base key + BlockOffset - ArchiveOffset) XOR FileSize) (StormLib incorrectly uses an AND in place of the XOR). Each sector is encrypted using the key + the 0-based index of the sector in the file. The SectorOffsetTable, if present, is encrypted using the key - 1.
+
+The SectorOffsetTable is omitted when the sizes and offsets of all sectors in the file are calculatable from the FileSize. This can happen in several circumstances. If the file is not compressed/imploded, then the size and offset of all sectors is known, based on the archive's SectorSizeShift. If the file is stored as a single unit compressed/imploded, then the SectorOffsetTable is omitted, as the single file "sector" corresponds to BlockSize and FileSize, as mentioned previously. However, the SectorOffsetTable will be present if the file is compressed/imploded and the file is not stored as a single unit, even if there is only a single sector in the file (the size of the file is less than or equal to the archive's sector size).
+
+2.7 LISTFILE
+The listfile is a very simple extension to the MoPaQ format that contains the file paths of (most) files in the archive. The languages and platforms of the files are not stored in the listfile. The listfile is contained in the file "(listfile)" (default language and platform), and is simply a text file with file paths separated by ';', 0Dh, 0Ah, or some combination of these. The file "(listfile)" may not be listed in the listfile.
+
+2.8 EXTENDED ATTRIBUTES
+The extended attributes are optional file attributes for files in the block table. These attributes were added at times after the MoPaQ format was already finalized, and it is not necessary for every archive to have all (or any) of the extended attributes. If an archive contains a given attribute, there will be an instance of that attribute for every block in the block table, although the attribute will be meaningless if the block is not a file. The order of the attributes for blocks correspond to the order of the blocks in the block table, and are of the same number. The attributes are stored in parallel arrays in the "(attributes)" file (default language and platform), in the archive. The attributes corresponding to this file need not be valid (and logically cannot be). Unlike all the other structures in the MoPaQ format, entries in the extended attributes are NOT guaranteed to be aligned. Also note that in some archives, malicious zeroing of the attributes has been observed, perhaps with the intent of breaking archive viewers. This file is structured as follows:
+
+00h: int32 Version : Specifies the extended attributes format version. For now, must be 100.
+04h: int32 AttributesPresent : Bit mask of the extended attributes present in the archive:
+	00000001h: File CRC32s.
+	00000002h: File timestamps.
+	00000004h: File MD5s.
+08h: int32(BlockTableEntries) CRC32s : CRC32s of the (uncompressed) file data for each block in the archive. Omitted if the archive does not have CRC32s.
+immediately after CRC32s: FILETIME(BlockTableEntries) Timestamps : Timestamps for each block in the archive. The format is that of the Windows FILETIME structure. Omitted if the archive does not have timestamps.
+immediately after Timestamps: MD5(BlockTableEntries) MD5s : MD5s of the (uncompressed) file data for each block in the archive. Omitted if the archive does not have MD5s.
+
+2.9 WEAK DIGITAL SIGNATURE
+The weak digital signature is a digital signature using Microsoft CryptoAPI. It is an implimentation of the RSASSA-PKCS1-v1_5 digital signature protocol, using the MD5 hashing algorithm and a 512-bit (weak) RSA key (for more information about this protocol, see the RSA Labs PKCS1 specification). The public key and exponent are stored in a resource in Storm, the private key is stored in a separate file, whose filename is passed to MPQAPI (the private key is not stored in MPQAPI). The signature is stored uncompressed, unencrypted in the file "(signature)" (default language and platform) in the archive. The archive is hashed from the beginning of the archive (ArchiveOffset in the containing file) to the end of the archive (the length indicated by ArchiveSize, or calculated in the Burning Crusade MoPaQ format); the signature file is added to the archive before signing, and the space occupied by the file is considered to be all binary 0s during signing/verification. This file is structured as follows:
+
+00h: int32 Unknown : Must be 0.
+04h: int32 Unknown : Must be 0.
+08h: int512 Signature : The digital signature. Like all other numbers in the MoPaQ format, this is stored in little-endian order. The structure of this, when decrypted, follows the RSASSA-PKCS1-v1_5 specification; this format is rather icky to work with (I wrote a program to verify this signature using nothing but an MD5 function and huge integer functions; it wasn't pleasant), and best left to an encryption library such as Cryto++.
+
+2.10 STRONG DIGITAL SIGNATURE
+The strong digital signature uses a simple proprietary implementation of RSA signing, using the SHA-1 hashing algorithm and a 2048-bit (strong) RSA key. The default public key and exponent are stored in Storm, but other keys may be used as well. The strong digital signature is stored immediately after the archive, in the containing file; the entire archive (ArchiveSize bytes, starting at ArchiveOffset in the containing file) is hashed as a single block. The signature has the following format:
+
+00h: char(4) Magic : Indicates the presence of a digital signature. Must be "NGIS" ("SIGN" backwards).
+04h: int2048 Signature : The digital signature, stored in little-endian format.
+
+When the Signature field is decrypted with the public key and exponent, and the resulting large integer is stored in little-endian order, it is structured as follows:
+
+00h: byte Padding : Must be 0Bh.
+01h: byte(235) Padding : Must be BBh.
+ECh: byte(20) SHA-1 : SHA-1 hash of the archive, in standard SHA-1 byte order.
+
+3. ALGORITHM SOURCE CODE
+All of the sample code here assumes little endian machine byte order, that the short type is 16 bits, that the long type is 32 bits, and that the long long type is 64 bits. Adjustments must be made if these assumptions are not correct on a given platform. All code not credited otherwise was written by myself in the writing of this specification.
+
+3.1 ENCRYPTION/DECRYPTION
+Based on code from StormLib.
+
+unsigned long dwCryptTable[0x500];
+
+// The encryption and hashing functions use a number table in their procedures. This table must be initialized before the functions are called the first time.
+void InitializeCryptTable()
+{
+    unsigned long seed   = 0x00100001;
+    unsigned long index1 = 0;
+    unsigned long index2 = 0;
+    int   i;
+
+    for (index1 = 0; index1 < 0x100; index1++)
+    {
+        for (index2 = index1, i = 0; i < 5; i++, index2 += 0x100)
+        {
+            unsigned long temp1, temp2;
+
+            seed  = (seed * 125 + 3) % 0x2AAAAB;
+            temp1 = (seed & 0xFFFF) << 0x10;
+
+            seed  = (seed * 125 + 3) % 0x2AAAAB;
+            temp2 = (seed & 0xFFFF);
+
+            dwCryptTable[index2] = (temp1 | temp2);
+        }
+    }
+}
+
+void EncryptData(void *lpbyBuffer, unsigned long dwLength, unsigned long dwKey)
+{
+    assert(lpbyBuffer);
+
+    unsigned long *lpdwBuffer = (unsigned long *)lpbyBuffer;
+    unsigned long seed = 0xEEEEEEEE;
+    unsigned long ch;
+
+    dwLength /= sizeof(unsigned long);
+
+    while(dwLength-- > 0)
+    {
+        seed += dwCryptTable[0x400 + (dwKey & 0xFF)];
+        ch = *lpdwBuffer ^ (dwKey + seed);
+
+        dwKey = ((~dwKey << 0x15) + 0x11111111) | (dwKey >> 0x0B);
+        seed = *lpdwBuffer + seed + (seed << 5) + 3;
+
+		*lpdwBuffer++ = ch;
+    }
+}
+
+void DecryptData(void *lpbyBuffer, unsigned long dwLength, unsigned long dwKey)
+{
+    assert(lpbyBuffer);
+
+    unsigned long *lpdwBuffer = (unsigned long *)lpbyBuffer;
+    unsigned long seed = 0xEEEEEEEEL;
+    unsigned long ch;
+
+    dwLength /= sizeof(unsigned long);
+
+    while(dwLength-- > 0)
+    {
+        seed += dwCryptTable[0x400 + (dwKey & 0xFF)];
+        ch = *lpdwBuffer ^ (dwKey + seed);
+
+        dwKey = ((~dwKey << 0x15) + 0x11111111L) | (dwKey >> 0x0B);
+        seed = ch + seed + (seed << 5) + 3;
+
+		*lpdwBuffer++ = ch;
+    }
+}
+
+3.2 HASHING AND FILE KEY COMPUTATION
+These functions may have been derived from StormLib code at some point in the very distant past. It was so long ago that I don't remember for certain.
+
+// Different types of hashes to make with HashString
+#define MPQ_HASH_TABLE_OFFSET	0
+#define MPQ_HASH_NAME_A	1
+#define MPQ_HASH_NAME_B	2
+#define MPQ_HASH_FILE_KEY	3
+
+// Based on code from StormLib.
+unsigned long HashString(const char *lpszString, unsigned long dwHashType)
+{
+    assert(lpszString);
+    assert(dwHashType <= MPQ_HASH_FILE_KEY);
+    
+    unsigned long  seed1 = 0x7FED7FEDL;
+    unsigned long  seed2 = 0xEEEEEEEEL;
+    int    ch;
+
+    while (*lpszString != 0)
+    {
+        ch = toupper(*lpszString++);
+
+        seed1 = dwCryptTable[(dwHashType * 0x100) + ch] ^ (seed1 + seed2);
+        seed2 = ch + seed1 + seed2 + (seed2 << 5) + 3;
+    }
+    return seed1;
+}
+
+#define BLOCK_OFFSET_ADJUSTED_KEY 0x00020000L
+
+unsigned long ComputeFileKey(const char *lpszFilePath, const BlockTableEntry &blockEntry, unsigned long nArchiveOffset)
+{
+	assert(lpszFilePath);
+	
+	// Find the file name part of the path
+	const char *lpszFileName = strrchr(lpszFilePath, '\\');
+	if (lpszFileName)
+		lpszFileName++;	// Skip the \
+	else
+		lpszFileName = lpszFilePath;
+		
+	// Hash the name to get the base key
+	unsigned long nFileKey = HashString(lpszFileName, MPQ_HASH_FILE_KEY);
+	
+	// Offset-adjust the key if necessary
+	if (blockEntry.Flags & BLOCK_OFFSET_ADJUSTED_KEY)
+		nFileKey = (nFileKey + blockEntry.BlockOffset) ^ blockEntry.FileSize;
+		
+	return nFileKey;
+}
+
+3.3 FINDING FILES
+
+#define MPQ_HASH_ENTRY_EMPTY 0xFFFFFFFFL
+#define MPQ_HASH_ENTRY_DELETED 0xFFFFFFFEL
+
+bool FindFileInHashTable(const HashTableEntry *lpHashTable, unsigned long nHashTableSize, const char *lpszFilePath, unsigned short nLang, unsigned char nPlatform, unsigned long &iFileHashEntry)
+{
+	assert(lpHashTable);
+	assert(nHashTableSize);
+	assert(lpszFilePath);
+	
+	// Find the home entry in the hash table for the file
+	unsigned long iInitEntry = HashString(lpszFilePath, MPQ_HASH_TABLE_OFFSET) & (nHashTableSize - 1);
+		
+	// Is there anything there at all?
+	if (lpHashTable[iInitEntry].FileBlockIndex == MPQ_HASH_ENTRY_EMPTY)
+		return false;
+		
+	// Compute the hashes to compare the hash table entry against
+	unsigned long nNameHashA = HashString(lpszFilePath, MPQ_HASH_NAME_A),
+		nNameHashB = HashString(lpszFilePath, MPQ_HASH_NAME_B),
+		iCurEntry = iInitEntry;
+		
+	// Check each entry in the hash table till a termination point is reached
+	do
+	{
+		if (lpHashTable[iCurEntry].FileBlockIndex != MPQ_HASH_ENTRY_DELETED)
+		{
+			if (lpHashTable[iCurEntry].FilePathHashA == nNameHashA 
+				&& lpHashTable[iCurEntry].FilePathHashB == nNameHashB
+				&& lpHashTable[iCurEntry].Language == nLang
+				&& lpHashTable[iCurEntry].Platform == nPlatform)
+			{
+				iFileHashEntry = iCurEntry;
+				
+				return true;
+			}
+		}
+			
+		iCurEntry = (iCurEntry + 1) & (nHashTableSize - 1);
+	} while (iCurEntry != iInitEntry && lpHashTable[iCurEntry].FileBlockIndex != MPQ_HASH_ENTRY_EMPTY);
+	
+	return false;
+}
+
+3.4 DELETING FILES
+
+bool DeleteFile(HashTableEntry *lpHashTable, unsigned long nHashTableSize, BlockTableEntry *lpBlockTable, const char *lpszFilePath, unsigned short nLang, unsigned char nPlatform)
+{
+	assert(lpHashTable);
+	assert(nHashTableSize);
+	assert(lpBlockTable);
+	
+	// Find the file in the hash table
+	unsigned long iFileHashEntry;
+	
+	if (!FindFileInHashTable(lpHashTable, nHashTableSize, lpszFilePath, nLang, nPlatform, iFileHashEntry))
+		return false;
+	
+	// Get the block table index before we nuke the hash table entry
+	unsigned long iFileBlockEntry = lpHashTable[iFileHashEntry].FileBlockIndex;
+	
+	// Delete the file's entry in the hash table
+	memset(&lpHashTable[iFileHashEntry], 0xFF, sizeof(HashTableEntry));
+	
+	// If the next entry is empty, mark this one as empty; otherwise, mark this as deleted.
+	if (lpHashTable[(iFileHashEntry + 1) & (nHashTableSize - 1)].FileBlockIndex == MPQ_HASH_ENTRY_EMPTY)
+		lpHashTable[iFileHashEntry].FileBlockIndex = MPQ_HASH_ENTRY_EMPTY;
+	else
+		lpHashTable[iFileHashEntry].FileBlockIndex = MPQ_HASH_ENTRY_DELETED;
+	
+	// If the block occupies space, mark the block as free space; otherwise, clear the block table entry.
+	if (lpBlockTable[iFileBlockEntry].BlockSize > 0)
+	{
+		lpBlockTable[iFileBlockEntry].FileSize = 0;
+		lpBlockTable[iFileBlockEntry].Flags = 0;
+	}
+	else
+		memset(&lpBlockTable[iFileBlockEntry], 0, sizeof(BlockTableEntry);
+		
+	return true;
+}
+
+3.5 CONVERSION OF FILETIME AND time_t
+This code assumes that the base ("zero") date for time_t is 01/01/1970. This is true on Windows, Unix System V systems, and Mac OS X. It is unknown whether this is true on all other platforms. You'll need to research this yourself, if you plan on porting it somewhere else.
+
+#define EPOCH_OFFSET 116444736000000000ULL	// Number of 100 ns units between 01/01/1601 and 01/01/1970
+
+bool GetTimeFromFileTime(const FILETIME &fileTime, time_t &time)
+{
+	// The FILETIME represents a 64-bit integer: the number of 100 ns units since January 1, 1601
+	unsigned long long nTime = ((unsigned long long)fileTime.dwHighDateTime << 32) + fileTime.dwLowDateTime;
+
+	if (nTime < EPOCH_OFFSET)
+		return false;
+
+	nTime -= EPOCH_OFFSET;	// Convert the time base from 01/01/1601 to 01/01/1970
+	nTime /= 10000000ULL;	// Convert 100 ns to sec
+
+	time = (time_t)nTime;
+
+	// Test for overflow (FILETIME is 64 bits, time_t is 32 bits)
+	if ((nTime - (unsigned long long)time) > 0)
+		return false;
+
+	return true;
+}
+
+void GetFileTimeFromTime(const time_t &time, FILETIME &fileTime)
+{
+	unsigned long long nTime = (unsigned long long)time;
+
+	nTime *= 10000000ULL;
+	nTime += EPOCH_OFFSET;
+
+	fileTime.dwLowDateTime = (DWORD)nTime;
+	fileTime.dwHighDateTime = (DWORD)(nTime >> 32);
+}
+
+3.6 FORMING A 64-BIT LARGE ARCHIVE OFFSET FROM 32-BIT AND 16-BIT COMPONENTS
+unsigned long long MakeLargeArchiveOffset(unsigned long nOffsetLow, unsigned short nOffsetHigh)
+{
+	return ((unsigned long long)nOffsetHigh << 32) + (unsigned long long)nOffsetLow;
+}
+
+4. REVISION HISTORY
+1.0
+	- Updated to include most of the changes found in the Burning Crusade Friends and Family beta
+
+0.91.
+	- Updated several structure member descriptions
+	- Listed the full set of characters that can separate list file entries
+	- Noted that (attributes), (listfile), and (signature) use the default language and platform codes
+	- Redid part of the file data specs to clarify the format of sectors
+	- Enhanced descriptions of the different kinds of block table entries
+	- Added ComputeFileKey, FindFileInHashTable, and DeleteFile source
+\ No newline at end of file
diff --git a/contrib/vmap_extractor_v2/stormdll/StormDll.cpp b/contrib/vmap_extractor_v2/stormdll/StormDll.cpp
new file mode 100644
index 00000000000..2031180c7e3
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormdll/StormDll.cpp
@@ -0,0 +1,117 @@
+/*****************************************************************************/
+/* Storm.cpp                              Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* This is just a dummy module for building import library for Storm.dll     */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 11.04.03  1.00  Lad  The first version of Storm.cpp                       */
+/*****************************************************************************/
+
+#include <windows.h>
+
+#define BUILDING_STORM_CPP
+#define STORM_ALTERNATE_NAMES
+#include "StormDll.h"
+
+BOOL WINAPI SFILE(OpenArchive)(LPCSTR lpFileName, DWORD dwPriority, DWORD dwFlags, HANDLE *hMPQ)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(CloseArchive)(HANDLE hMPQ)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(GetArchiveName)(HANDLE hMPQ, LPCSTR lpBuffer, DWORD dwBufferLength)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(OpenFile)(LPCSTR lpFileName, HANDLE *hFile)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(OpenFileEx)(HANDLE hMPQ, LPCSTR lpFileName, DWORD dwSearchScope, HANDLE *hFile)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(CloseFile)(HANDLE hFile)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+DWORD WINAPI SFILE(GetFileSize)(HANDLE hFile, LPDWORD lpFileSizeHigh)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(GetFileArchive)(HANDLE hFile, HANDLE *hMPQ)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(GetFileName)(HANDLE hFile, LPCSTR lpBuffer, DWORD dwBufferLength)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+DWORD WINAPI SFILE(SetFilePointer)(HANDLE hFile, long lDistanceToMove, PLONG lplDistanceToMoveHigh, DWORD dwMoveMethod)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(ReadFile)(HANDLE hFile,LPVOID lpBuffer,DWORD nNumberOfBytesToRead,LPDWORD lpNumberOfBytesRead,LPOVERLAPPED lpOverlapped)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+LCID WINAPI SFILE(SetLocale)(LCID nNewLocale)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(GetBasePath)(LPCSTR lpBuffer, DWORD dwBufferLength)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(SetBasePath)(LPCSTR lpNewBasePath)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SFILE(Destroy)()
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SCOMP(Compress)(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int uCmp, int uCmpType, int nCmpLevel)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
+
+BOOL WINAPI SCOMP(Decompress)(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength)
+{
+    SetLastError(ERROR_CALL_NOT_IMPLEMENTED);
+    return FALSE;
+}
diff --git a/contrib/vmap_extractor_v2/stormdll/StormDll.def b/contrib/vmap_extractor_v2/stormdll/StormDll.def
new file mode 100644
index 00000000000..8de88f5db3d
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormdll/StormDll.def
@@ -0,0 +1,25 @@
+; Storm definition file with alternate Storm.dll names
+LIBRARY      "Storm"
+
+EXPORTS
+    StormCloseArchive      @252      ; 0x0FC
+    StormCloseFile         @253      ; 0x0FD
+    StormDestroy           @262      ; 0x106
+    StormGetFileArchive    @264      ; 0x108
+    StormGetFileSize       @265      ; 0x109
+    StormOpenArchive       @266      ; 0x10A
+    StormOpenFile          @267      ; 0x10B
+    StormOpenFileEx        @268      ; 0x10C
+    StormReadFile          @269      ; 0x10D
+    StormSetBasePath       @270      ; 0x10E
+    StormSetFilePointer    @271      ; 0x10F
+    StormSetLocale         @272      ; 0x110
+    StormGetBasePath       @273      ; 0x111
+    StormGetArchiveName    @275      ; 0x113
+    StormGetFileName       @276      ; 0x114
+
+;   StormSetLastError      @465      ; 0x
+
+    StormCompress          @551      ; 0x227
+    StormDecompress        @552      ; 0x228
+    
+\ No newline at end of file
diff --git a/contrib/vmap_extractor_v2/stormdll/StormDll.h b/contrib/vmap_extractor_v2/stormdll/StormDll.h
new file mode 100644
index 00000000000..6d67820a22f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormdll/StormDll.h
@@ -0,0 +1,67 @@
+/*****************************************************************************/
+/* Storm.h                           Copyright Justin Olbrantz(Quantam) 2000 */
+/*---------------------------------------------------------------------------*/
+/* Storm Interface Library v1.0 for Windows                                  */
+/*                                                                           */
+/* Author : Justin Olbrantz(Quantam)                                         */
+/* E-mail : omega@dragonfire.net                                             */
+/* WWW    : www.campaigncreations.com/starcraft/mpq2k/inside_mopaq/          */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* xx.xx.00  1.00  Qua  The first version of Storm.h                         */
+/* 11.04.03  1.00  Lad  Added some functions                                 */
+/*****************************************************************************/
+
+// We need the Windows data types for the Storm prototypes
+#include <windows.h>
+
+#ifndef __STORM_H__
+#define __STORM_H__
+
+// Somethimes is necessary to change the function names so they
+// will not conflict with other MPQ tools.
+#ifdef STORM_ALTERNATE_NAMES
+  #define SFILE(Name) Storm##Name
+  #define SCOMP(Name) Storm##Name
+#else
+  #define SFILE(Name) SFile##Name
+  #define SCOMP(Name) SComp##Name
+#endif
+
+
+// Just in case anyone is still using C out there
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// Storm file function prototypes
+BOOL  WINAPI SFILE(OpenArchive)(LPCSTR lpFileName, DWORD dwPriority, DWORD dwFlags, HANDLE *hMPQ);
+BOOL  WINAPI SFILE(CloseArchive)(HANDLE hMPQ);
+BOOL  WINAPI SFILE(GetArchiveName)(HANDLE hMPQ, LPCSTR lpBuffer, DWORD dwBufferLength);
+BOOL  WINAPI SFILE(OpenFile)(LPCSTR lpFileName, HANDLE *hFile);
+BOOL  WINAPI SFILE(OpenFileEx)(HANDLE hMPQ, LPCSTR lpFileName, DWORD dwSearchScope, HANDLE *hFile);
+BOOL  WINAPI SFILE(CloseFile)(HANDLE hFile);
+DWORD WINAPI SFILE(GetFileSize)(HANDLE hFile, LPDWORD lpFileSizeHigh);
+BOOL  WINAPI SFILE(GetFileArchive)(HANDLE hFile, HANDLE *hMPQ);
+BOOL  WINAPI SFILE(GetFileName)(HANDLE hFile, LPCSTR lpBuffer, DWORD dwBufferLength);
+DWORD WINAPI SFILE(SetFilePointer)(HANDLE hFile, long lDistanceToMove, PLONG lplDistanceToMoveHigh, DWORD dwMoveMethod);
+BOOL  WINAPI SFILE(ReadFile)(HANDLE hFile,LPVOID lpBuffer,DWORD nNumberOfBytesToRead,LPDWORD lpNumberOfBytesRead,LPOVERLAPPED lpOverlapped);
+LCID  WINAPI SFILE(SetLocale)(LCID nNewLocale);
+BOOL  WINAPI SFILE(GetBasePath)(LPCSTR lpBuffer, DWORD dwBufferLength);
+BOOL  WINAPI SFILE(SetBasePath)(LPCSTR lpNewBasePath);
+
+// Storm (de)compression functions
+BOOL  WINAPI SCOMP(Compress)  (char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int uCmp, int uCmpType, int nCmpLevel);
+BOOL  WINAPI SCOMP(Decompress)(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength);
+
+
+#if defined(_MSC_VER) && !defined(BUILDING_STORM_CPP)
+#pragma comment(lib, "Storm.lib")    // Force linking Storm.lib and thus Storm.dll
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // __STORM_H__
diff --git a/contrib/vmap_extractor_v2/stormlib/GfxDecode.cpp b/contrib/vmap_extractor_v2/stormlib/GfxDecode.cpp
new file mode 100644
index 00000000000..665e5d38e49
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/GfxDecode.cpp
@@ -0,0 +1,697 @@
+/***********************************************************************
+*
+* Description:  GfxDecode -- functions for reading Diablo's GFX files
+* Author: Marko Friedemann <marko.friedemann@bmx-chemnitz.de>
+* Created at: Son Jan 27 15:20:43 CET 2002
+* Computer: hangloose.flachland-chemnitz.de 
+* System: Linux 2.4.16 on i686
+*    
+* Copyright (c) 2002  BMX-Chemnitz.DE  All rights reserved.
+*
+* ---------------------------------------------------------------------
+* included are functions for getting:
+*  - the framecount of .CEL-files                  -> celGetFrameCount()
+*  - single frames of .CEL-files                   -> celGetFrameData()
+*  - the framecount of .CL2-files                  -> cl2GetFrameCount()
+*  - single directions of .CL2-files (all frames)  -> cl2GetDirData()
+*  - single .PCX-files (256 color; v2, v5)         -> pcxGetData()
+***********************************************************************/
+
+#include <vector>
+#include <cmath>
+#include <iostream>
+
+#include "StormLib.h"
+
+#define TRANS_COL 256
+
+using std::cerr;
+using std::vector;
+
+/****** RAMP stuff *****************************************************
+ * for a more detailed description/explanation see below
+ ***********************************************************************/
+// two variations: one/two ramp(s)
+static const uint16_t c_2RampSize = 544;    // the frame size
+static const uint16_t c_1RampSize = 800;    // the frame size
+
+// ramps (both variations) can be either left or right
+static const uint16_t c_RampOffsetLeft[17] = {
+    0,      //                                      __
+    8,      // +  8     note that this          __--
+    24,     // + 16     "drawing" is        __--
+    48,     // + 24     upside down!    __--    this area
+    80,     // + 32                 __--        is always
+    120,    // + 40             __--            colored
+    168,    // + 48         __--
+    224,    // + 56     __--  lower ramp ends here (+30 == 254)
+    288,    // + 64   --__    upper ramp might be missing
+    348,    // + 60   |   --__
+    400,    // + 52   |       --__              this area
+    444,    // + 44   |           --__          is always
+    480,    // + 36   |               --__      colored
+    508,    // + 28   | either trans-     --__
+    528,    // + 20   | parent or colored     --__
+    540,    // + 12   |                           --__   +2 Pixels = 544
+    542     // +  2   | this last one doesn't exist, it's those^ 2 pixels
+};
+
+static const uint16_t c_RampOffsetRight[17] = {
+    2,      //        __         before this, there are 2 Pixels
+    14,     // + 12     --__              4^2 - 2
+    34,     // + 20         --__          6^2 - 2
+    62,     // + 28  this area  --__      8^2 - 2 
+    98,     // + 36  is always      --__ 10^2 - 2  pattern anyone? ;)
+    142,    // + 44  colored            --__ 
+    194,    // + 52                         --__
+    254,    // + 60  lower ramp ends here       --__     (-30 == 224)
+    318,    // + 64  upper ramp might be missing  __--   
+    374,    // + 56                           __--   |
+    422,    // + 48  this area            __--       |   note that this
+    462,    // + 40  is always        __--           |   "drawing"
+    494,    // + 32  colored      __--  eiter trans- |   is upside down!
+    518,    // + 24           __-- parent or colored |
+    534,    // + 16       __--                       |
+    542,    // +  8   __--   +2 Startpixels = 544    |
+    542     // +  0  this last one doesn't exist, it |   would be EOF
+};
+
+/****** FrameBuffer class **********************************************
+ * holds buffers and size information of the actual target image
+ *  purpose: buffer management and avoidance of ugly globals
+ **********************************************************************/
+class FrameBuf
+{
+ protected:
+    vector <uint8_t *> vecData;
+    uint8_t  *pCurrRow;
+    uint8_t  *pPalette;
+    uint16_t  uRows;
+    uint16_t *upYSize;
+    uint16_t *upMaxX;
+ public:
+    uint16_t  uCols;
+    uint16_t  uXSize;
+    uint16_t  uMaxBlock;
+    uint16_t  uFrameNum;
+    bool      bHasBlocks;
+    bool      bHasRamps;
+    FrameBuf(
+        uint8_t *pPal=NULL, uint16_t frame=0, uint16_t xsize=0,
+        uint16_t *pysize=NULL, uint16_t *pmaxx=NULL, uint16_t maxblock=0)
+    {
+        pCurrRow  = new uint8_t[4*xsize];
+        pPalette  = pPal;
+        uCols     = 0;
+        uRows     = 0;
+        uXSize    = xsize;
+        uFrameNum = frame;
+        uMaxBlock = maxblock;
+        upYSize   = pysize;
+        upMaxX    = pmaxx;
+        bHasBlocks= false;
+        bHasRamps = false;
+    }
+    ~FrameBuf()
+    {
+        delete[] pCurrRow;
+        for (vector <uint8_t *>::iterator vi=vecData.begin(); vi!=vecData.end(); vi++)
+            delete[] *vi;
+        vecData.clear();
+    }
+    void addLine()
+    {
+        ++uRows;
+        uCols = 0;
+        vecData.push_back(pCurrRow);
+        pCurrRow = new uint8_t[4*uXSize];
+    }
+    void addPixel(uint16_t uColorNum)
+    {
+        if (uColorNum > TRANS_COL) {
+            cerr << "\n*** there seemed to be an error, illegal color index " << uColorNum;
+            cerr << "\n +++ at (" << uCols << "," << uRows << "), see for yourself *** \n\n";
+            uColorNum = TRANS_COL;      // sane setting to avoid segfaults
+        }
+        
+        memcpy(pCurrRow + 4*uCols, pPalette + 4*uColorNum, 4*sizeof(uint8_t));
+        if (++uCols == uXSize)
+            addLine();
+        else if ((uColorNum != TRANS_COL) && (upMaxX != NULL) && (uCols > *upMaxX))
+            *upMaxX = uCols;
+    }
+    // used to return the actual image data
+    uint8_t *getData()
+    {
+        uint16_t i;
+        vector <uint8_t *>::reverse_iterator vri;
+        // allocate a buffer to hold the actual image size
+        uint8_t *tmp = new uint8_t[4*uXSize*uRows];
+        
+        // the lines are upside down inside the vector, use reverse iterator
+        for (i=0, vri=vecData.rbegin(); vri!=vecData.rend(); vri++, i++)
+            memcpy(tmp+4*uXSize*i, *vri, 4*uXSize*sizeof(uint8_t));
+        
+        *upYSize = uRows;    // set height
+        
+        if (uCols > 0) {
+            cerr << "\n*** there seemed to be an error (last line does not match boundary, " << uCols << " pixels left)";
+            cerr << "\n +++ this is often caused by specifying an invalid width, see for yourself *** \n\n";
+        }
+        
+        return tmp;
+    }
+};
+
+uint16_t WINAPI celGetFrameCount(uint8_t *pFileBuf)
+{
+    uint32_t tmp;
+    memcpy(&tmp, pFileBuf, sizeof(uint32_t));
+    return (uint16_t)tmp;
+}
+
+/***** Block Decoder ***************************************************
+ * one of three possible decoding techniques necessary for .cel
+ *  possible block contents are either colored (in that case the
+ *  appropriate number of pixels are read) or transparent pixels
+ *  there are neither ramps nor plain pixels allowed here
+ ***********************************************************************/
+uint8_t *celDecodeBlocks(uint8_t *pFileBuf, FrameBuf *pFrame, uint32_t *framestart)
+{
+    uint32_t uFilePos=framestart[pFrame->uFrameNum];
+    uint8_t cRead=0, i=0;
+
+    if (!pFrame->bHasBlocks)      // sanity check
+        return NULL;
+        
+    while (uFilePos < framestart[pFrame->uFrameNum+1]) {
+        cRead = pFileBuf[uFilePos++];
+        
+        if ((uFilePos == framestart[pFrame->uFrameNum]+1))
+            // TODO: what is this 0x0A 0x00 stuff all about?
+            if ((cRead == 0x0A) && (pFileBuf[uFilePos] == 0x00)) {
+                uFilePos += 9;
+                cRead = pFileBuf[uFilePos++];
+            }
+    
+        if (cRead > 0x7F)
+            // transparent block (complement, 256-val)
+            for (i=0; i<256-cRead; i++)
+                pFrame->addPixel(TRANS_COL);
+        else if (cRead < pFrame->uMaxBlock + 1)
+                // pixel block (block size pixels to be read!)
+                for (i=0; i<cRead; i++)
+                    pFrame->addPixel(pFileBuf[uFilePos++]);
+        else
+            cerr << "\n*** block mode: illegal block (> max_size) ***\n\n";
+    }
+    return pFrame->getData();
+}
+
+/***** Ramp Decoder ****************************************************
+ * the second of three possible decoding techniques necessary for .cel
+ *  each block save the first/last is enclosed by two 0x00 pairs
+ *  those blocks affect _TWO_ rows with one being 2 colored pixels shorter
+ *  the first/last "block" affects only one row
+ ***********************************************************************/
+uint8_t *celDecodeRamps(uint8_t *pFileBuf, FrameBuf *pFrame, uint32_t *framestart, bool bLeft)
+{
+    uint32_t uFrameLen = framestart[pFrame->uFrameNum+1]-framestart[pFrame->uFrameNum];
+    uint32_t uFilePos=0;
+    uint16_t uBlockLen=0, i=0, j=0;
+    bool bFirstLonger=false;
+    
+    if (!pFrame->bHasRamps)     // sanity check
+        return NULL;
+        
+    if (pFrame->uXSize != 32)   // only used in that case
+        return NULL;
+
+    if (!bLeft) { // get first two pixels for right side ramps
+        pFrame->addPixel(pFileBuf[framestart[pFrame->uFrameNum]]);
+        pFrame->addPixel(pFileBuf[framestart[pFrame->uFrameNum]+1]);
+    }
+
+    // do all the ramp blocks
+    for (i=0; i<(uFrameLen == c_2RampSize ? 15 : 7); i++) {
+        uBlockLen = (bLeft ? (c_RampOffsetLeft[i+1] - c_RampOffsetLeft[i]) : (c_RampOffsetRight[i+1] - c_RampOffsetRight[i]));
+        uFilePos = framestart[pFrame->uFrameNum] + (bLeft ? c_RampOffsetLeft[i] : c_RampOffsetRight[i]) + 2;
+        bFirstLonger = (i>(bLeft ? 7 : 6));
+        if (bLeft) {
+            // OK, first line, starting with transparency
+            for (j=0; j<pFrame->uXSize - uBlockLen/2 + (bFirstLonger ? 0 : 2); j++)
+                pFrame->addPixel(TRANS_COL);
+            // fill it up with the pixel block
+            for (j=0; j<uBlockLen/2 - (bFirstLonger ? 0 : 2); j++)
+                pFrame->addPixel(pFileBuf[uFilePos++]);
+            // second line, starting again with transparency
+            for (j=0; j<pFrame->uXSize - uBlockLen/2 + (bFirstLonger ? 2 : 0); j++)
+                pFrame->addPixel(TRANS_COL);
+            // fill the second line with the remaining pixels
+            for (j=0; j<uBlockLen/2 - (bFirstLonger ? 2 : 0); j++)
+                pFrame->addPixel(pFileBuf[uFilePos++]);
+        } else {
+            if (pFrame->uCols != 0) // fill current line with trans (if not empty)
+                for (j=pFrame->uXSize - pFrame->uCols; j>0; j--)
+                    pFrame->addPixel(TRANS_COL);
+            // OK, insert the first pixels into a new line
+            for (j=0; j<uBlockLen/2 - (bFirstLonger ? 0 : 2); j++)
+                pFrame->addPixel(pFileBuf[uFilePos++]);
+            // fill the line with transparency
+            for (j=0; j<pFrame->uXSize - uBlockLen/2 + (bFirstLonger ? 0 : 2); j++)
+                pFrame->addPixel(TRANS_COL);
+            // start a second line with the remaining pixels
+            for (j=0; j<uBlockLen/2 - (bFirstLonger ? 2 : 0); j++)
+                pFrame->addPixel(pFileBuf[uFilePos++]);
+        }
+    }
+    
+    // now read the last 0x00 pair and fill up
+    uBlockLen = (uFrameLen == c_2RampSize ? 30 : 2); // one or two ramps?
+    uFilePos = framestart[pFrame->uFrameNum] + (bLeft ? c_RampOffsetLeft[i] : c_RampOffsetRight[i]) + 2;
+    // the transparency for the last (single) 0x00 pair
+    for (j=0; j<uBlockLen; j++)
+        pFrame->addPixel(TRANS_COL);
+    if (bLeft) {  // left side only: the remaining line
+        for (j=0; j<pFrame->uXSize - uBlockLen; j++)
+            pFrame->addPixel(pFileBuf[uFilePos++]);
+    }
+    
+    // now the rest of the file (plain)
+    while (uFilePos < framestart[pFrame->uFrameNum+1])
+        pFrame->addPixel(pFileBuf[uFilePos++]);
+    
+    // the uppermost line is emtpy when 2 ramps are used
+    if (uFrameLen == c_2RampSize)
+        for (j=0; j<pFrame->uXSize; j++)
+            pFrame->addPixel(TRANS_COL);
+            
+    return pFrame->getData();
+}
+
+/***** celGetFrameData *************************************************
+ *             decode .cel data for given frame and xsize
+ * Args:
+ *     *vpFileBuf       the buffer containing the filecontent
+ *     *palette         the palette (4 bytes for each of the 257 entries)
+ *                        256 colors are needed + 1 for alpha
+ *      uXSize          this information must be given
+ *      uFrameNume      the frame to get
+ *     *uYSize          the actual value is returned therein
+ *     *uMaxX           this can be used (if != NULL) to get the column
+ *                      of the rightmost nontransparent pixel (useable
+ *                      eg for fonts)
+ *
+ * Returns: an array containing 4 Bytes (RGBA) for each pixel
+ *
+ * ---------------------------------------------------------------
+ * Comments:     dirty hack, started from scratch @ 2000-10-11
+ *               cleanly rewritten during incorporation into ladiks StormLib
+ *      status:  structured hack ;)
+ *   
+ *   It took me approx. 6 days to understand the format basics (hex viewer)
+ *   For this I had a little help from a dos tool ("ddecode", from
+ *   www.cowlevel.com, binary only, no sources) which, however, gave 
+ *   me the general idea what the pictures are actually supposed to look like.
+ *   
+ *   The fine adjustments, however, took quite some time and a little luck.
+ *   After I had written to various people (mickyk and ladik), which could
+ *   not help me, but wished best luck (thanks, btw, it helped ;)), I tried
+ *   some reverse engineering which was not succesful in the end.
+ *   
+ *   I then had incidentally a new idea of what could be going on @ 2002-01-23.
+ *   It just came to my mind that I could retry some actual painting in
+ *   reverse order (had done that before to no avail) and when looking closer
+ *   at it I realized the "ramp" stuff. This really is the trickiest part and
+ *   it took me some eight days to implement it without breaking the other
+ *   parts of the code. Very odd format indeed.
+ *
+ * TODO: learn what 0x0A 0x00 means
+ **********************************************************************/
+uint8_t * WINAPI celGetFrameData(uint8_t *pFileBuf, uint8_t *palette, uint16_t uXSize, uint16_t uFrameNum, uint16_t *uYSize, uint16_t *uMaxX)
+{
+    FrameBuf *pFrame;
+    uint32_t *framestart=NULL, frames=0, uFilePos=0;
+    uint16_t i, tmpWord=0;
+    uint8_t cRead=0, *data;
+    
+    memcpy(&frames, pFileBuf, sizeof(uint32_t));
+    uFilePos += sizeof(uint32_t);
+    
+    if (pFileBuf == NULL) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+    
+    if (palette == NULL) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+    
+    if (uFrameNum > frames-1) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+        
+    if (uYSize == NULL) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+        
+    // in case we want to know the rightmost pixels column (usable eg. for fonts)
+    if (uMaxX != NULL)
+        *uMaxX = 0;
+    
+    // get the frame offsets
+    framestart = new uint32_t[frames+1];
+    for (i=0; i<frames+1; i++) {
+        memcpy(&framestart[i], pFileBuf+uFilePos, sizeof(uint32_t));
+        uFilePos += sizeof(uint32_t);
+    }
+    
+    /****** block size *************************************************
+     * depends on the image width
+     ******************************/
+    
+    double erg = rint(sqrt(pow(2, rint(log((double)(framestart[uFrameNum+1] - framestart[uFrameNum])) / log(2.0)))));
+    pFrame = new FrameBuf(palette, uFrameNum, uXSize, uYSize, uMaxX, max((uint16_t)min((int)erg, 0x7F), uXSize));
+    
+    /****** ramp detection -- AFAIK only needed for 32x32 tiles ********
+     * here I use hard coded constants because this is the only simple
+     * way to get the detection done; plus this stuff is only to be
+     * found in such 32x32 (tile) files and so wont hurt anyone ;)
+     ******************************************************************/
+
+    uint32_t uFrameLen = framestart[uFrameNum+1] - framestart[uFrameNum];
+    if ((uXSize == 32) && ((uFrameLen == c_2RampSize) || (uFrameLen == c_1RampSize))) {
+
+        // use the static arrays for the check        
+        for (i=0; i<(uFrameLen == c_2RampSize ? 16 : 8); i++) {
+            memcpy(&tmpWord, pFileBuf+framestart[uFrameNum]+c_RampOffsetLeft[i], sizeof(uint16_t));
+            if (tmpWord != 0)
+                break;
+        }
+        bool bRampsLeft = pFrame->bHasRamps = (i==(uFrameLen == c_2RampSize ? 16 : 8));
+        if (!pFrame->bHasRamps) { // only one can apply
+            for (i=0; i<(uFrameLen == c_2RampSize ? 16 : 8); i++) {
+                memcpy(&tmpWord, pFileBuf+framestart[uFrameNum]+c_RampOffsetRight[i], sizeof(uint16_t));
+                if (tmpWord != 0)
+                    break;
+            }
+            pFrame->bHasRamps = (i==(uFrameLen == c_2RampSize ? 16 : 8)); // bRampsLeft stays false in this case
+        }
+        
+        if (pFrame->bHasRamps) {  // decode ramps and be off (if appropriate)
+            data = celDecodeRamps(pFileBuf, pFrame, framestart, bRampsLeft);
+            delete pFrame;
+            delete[] framestart;
+            return data;
+        }
+    }
+    
+    /*********** block detection ***************************************
+     * 0x0A as start byte seems to be sufficient (though I still dunno
+     * what the trailing 10 bytes mean); in any other case we act as if
+     * blocks were to be used and check afterwards if the image looks
+     * OK (that is, the last line has no pixels in it)
+     ******************************************************************/
+    
+    cRead = pFileBuf[framestart[uFrameNum]];
+    if (cRead == 0x0A)          // sufficient
+        pFrame->bHasBlocks = true;
+    // if width == 32 && framelen == 32*32, assume plain
+    else if ((uXSize != 32) || (uFrameLen != 32*32)) {    // check needed
+        uFilePos=framestart[uFrameNum];             
+        i=0;
+        // rush through the frame
+        while (uFilePos < framestart[uFrameNum+1]) {
+            cRead = pFileBuf[uFilePos++];
+            
+            // transparency blocks
+            while (cRead > 0x7F) {
+                i += 256-cRead;
+                i %= uXSize;
+                if (uFilePos < framestart[uFrameNum+1])
+                    cRead = pFileBuf[uFilePos++];
+                else
+                    cRead = 0;
+            }
+            
+            // colored pixel block
+            if (uFilePos < framestart[uFrameNum+1]) {
+                if (cRead < pFrame->uMaxBlock + 1) {
+                    i+=cRead;
+                    i%=uXSize;
+                    uFilePos+=cRead;
+                } else {
+                    // when the value is out of valid blockrange
+                    i=1;    // trigger error (1%uXSize != 0)
+                    break;
+                }
+            }
+        }
+        if (i%uXSize == 0)      // looks as if we got it right
+            pFrame->bHasBlocks=true;
+    }
+    
+    if (pFrame->bHasBlocks) {   // use block decoder if appropriate
+        data = celDecodeBlocks(pFileBuf, pFrame, framestart);
+        delete pFrame;
+        delete[] framestart;
+        return data;
+    }
+        
+    // plain mode (#3), read each color index and write the pixel
+    uFilePos=framestart[uFrameNum];
+    while (uFilePos < framestart[uFrameNum+1])
+        pFrame->addPixel(pFileBuf[uFilePos++]);
+    
+    // cleanup, return image data and height
+    data = pFrame->getData();
+    delete pFrame;
+    delete[] framestart;
+    return data;
+}
+
+uint16_t WINAPI cl2GetFrameCount(uint8_t *pFileBuf)
+{
+    uint32_t tmp;
+    memcpy(&tmp, pFileBuf, sizeof(uint32_t));
+    memcpy(&tmp, pFileBuf+tmp, sizeof(uint32_t));
+    return (uint16_t)tmp;
+}
+
+/***** cl2GetDirData ***************************************************
+ *         decodes all frames of a .cl2 for given direction and xsize
+ * Args:
+ *     *pFileBuf        the buffer containing the filecontent
+ *     *palette         the palette (4 bytes for each of the 257 entries)
+ *                        256 colors are needed + 1 for alpha
+ *      uXSize          this information must be given
+ *      uDirNum         the direction to get the frames from
+ *     *uYSize          the actual height is returned herein
+ *
+ * Returns: <frames> arrays containing 4 Bytes (RGBA) for each pixel
+ *     where <frames> is read at runtime and handed back via *uFrames
+ *
+ * ---------------------------------------------------------------
+ * Comments:     dirty hack, started from scratch @ 2000-10-12
+ *   
+ *   The format basics are similar to .cel, with the main difference
+ *   that the values read have reverse interpretation. In .cel a value
+ *   greater than 0x7F means transparency, while in .cl2 this means
+ *   color and vice-versa. .cl2 has the additional understanding
+ *   of blocks of the same color (0x80 .. 0xBF) where the one color is
+ *   written multiple times.
+ *
+ *   .cl2 only uses the block scheme, so there is no detection
+ *   necessary in order to get it right. The only thing still unknown
+ *   is that 0x0A 0x00 stuff...
+ *   
+ * TODO: learn what 0x0A 0x00 means
+ ***********************************************************************/
+BYTE ** WINAPI cl2GetDirData(BYTE *pFileBuf, BYTE *palette, WORD uXSize, WORD uDirNum, WORD *uYSize)
+{
+    FrameBuf *pFrame;
+    uint32_t frames=0, *framestart=NULL, uFilePos=0;
+    uint16_t i, fc;
+    uint8_t cRead=0, **data=NULL;
+    
+    if (pFileBuf == NULL) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+    
+    if (palette == NULL) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+    
+    if (uDirNum > 7) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+        
+    if (uYSize == NULL) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+    
+    // get direction offsets
+    uint32_t dirstart[8];
+    for (i=0; i<8; i++) {
+        memcpy(&dirstart[i], pFileBuf+uFilePos, sizeof(uint32_t));
+        uFilePos += sizeof(uint32_t);
+    }
+
+    uFilePos = dirstart[uDirNum];
+    
+    memcpy(&frames, pFileBuf+uFilePos, sizeof(uint32_t));
+    uFilePos += sizeof(uint32_t);
+    
+    data = new uint8_t*[frames];
+    
+    // get frame offsets
+    framestart = new uint32_t[frames+1];
+    for (i=0; i<frames+1; i++) {
+        memcpy(&framestart[i], pFileBuf+uFilePos, sizeof(uint32_t));
+        uFilePos += sizeof(uint32_t);
+    }
+    
+    // get frame data        
+    for (fc=0; fc<frames; fc++) {
+        pFrame = new FrameBuf(palette, 0, uXSize, uYSize, NULL, 0);
+        
+        uFilePos = dirstart[uDirNum] + framestart[fc];
+        while (uFilePos < dirstart[uDirNum] + framestart[fc+1]) {
+
+            cRead = pFileBuf[uFilePos++];
+            if (cRead < 0x80) { // transparency
+                // TODO: what is this 0x0A 0x00 stuff all about?
+                if ((cRead == 0x0A) && (pFileBuf[uFilePos] == 0) && (uFilePos == dirstart[uDirNum] + framestart[fc] + 1))
+                    uFilePos += 9;  // ignore the 9 bytes after 0x0A 0x00 at the framestart
+                else
+                    for (i=0; i<cRead; i++)
+                        pFrame->addPixel(TRANS_COL);
+            } else if (cRead < 0xC0) {
+                // read the next byte and write it <0xBF - cRead> times
+                for (i=0; i<0xBF - cRead; i++)
+                    pFrame->addPixel(pFileBuf[uFilePos]);
+                ++uFilePos;
+            } else // cRead > 0xBF
+                // read a block of the given size and write it
+                for (i=0; i < 256-cRead; i++)
+                    pFrame->addPixel(pFileBuf[uFilePos++]);
+        }
+        
+        // got the frame data, save it
+        data[fc] = pFrame->getData();
+        delete pFrame;
+    }
+    
+    delete[] framestart;
+    return data;
+}
+
+/****** pcxGetData *****************************************************
+ *           decodes pcx files (256 color, as in diablo mpq)
+ * Args:
+ *     *pFileBuf        the buffer containing the filecontent
+ *      uFileSize       the size of the file buffer
+ *      uTransColor     the palette entry to be transparent
+ *     *uXSize          the actual width is returned herein
+ *     *uYSize          the actual height is returned herein
+ *
+ * Returns: an array containing 4 Bytes (RGBA) for each pixel
+ *
+ * ---------------------------------------------------------------
+ * Comments:    format info and pseudocode taken from:
+ *          Klaus Holtorf, "Das Handbuch der Grafikformate"
+ *          ISBN 3-7723-6393-8
+ ***********************************************************************/
+BYTE * WINAPI pcxGetData(BYTE *pFileBuf, DWORD uFileSize, BYTE uTransColor, WORD *uXSize, WORD *uYSize)
+{
+    uint32_t uFilePos=0;
+    uint32_t uDataRead=0;   // potentially big! (logo.pcx: 550 * 216 * 15 = 1,782,000)
+    uint16_t i=0;
+    uint8_t *data, *palette;
+    uint8_t uColorNum=0, uCount=0;
+    
+    struct pcx_header_t {
+        uint8_t     id;
+        uint8_t     version;
+        uint8_t     compressed;
+        uint8_t     bpp;
+        uint16_t    x0;
+        uint16_t    y0;
+        uint16_t    x1;
+        uint16_t    y1;
+        uint16_t    xdpi;
+        uint16_t    ydpi;
+        uint8_t     pal[16][3];
+        uint8_t     reserved;
+        uint8_t     layers;
+        uint16_t    rowbytes;
+        uint16_t    colortype;
+        uint8_t     pad[58];
+    } pcxHeader;
+    
+    if (pFileBuf == NULL) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+    
+    if (uXSize == NULL) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+        
+    if (uYSize == NULL) {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return NULL;
+    }
+
+    // get image information
+    memcpy(&pcxHeader, pFileBuf, sizeof(struct pcx_header_t));
+    *uXSize = (pcxHeader.x1 - pcxHeader.x0 + 1);
+    *uYSize = (pcxHeader.y1 - pcxHeader.y0 + 1);
+    
+    if ((pcxHeader.version != 2) && (pcxHeader.version != 5)) {
+        cerr << "cannot handle pcx v" << pcxHeader.version << "\n";
+        return NULL;
+    }
+    
+    // get palette
+    palette = new uint8_t[256*4];
+    if (pFileBuf[uFileSize - 768 - 1] != 0x0C) {
+        cerr << "palette error at " << uFileSize - 768 - 1 << "\n";
+        return NULL;
+    }
+    for (i=0; i<256; i++) {
+        memcpy(palette+i*4, pFileBuf+uFileSize-768+i*3, 3*sizeof(uint8_t));
+        palette[i*4+3] = 0xFF;
+    }
+    memset(palette+uTransColor*4, 0, 4*sizeof(uint8_t)); // transparent black
+    
+    // start right after the header
+    uFilePos = sizeof(struct pcx_header_t);
+    data = new uint8_t[*uXSize * *uYSize * 4];
+    while (uDataRead < (uint32_t)(*uXSize * *uYSize)) {
+        // decompress
+        uColorNum = pFileBuf[uFilePos++];
+        if ((pcxHeader.compressed) && (uColorNum > 0xBF)) {
+            uCount = (uColorNum & 0x3F);
+            uColorNum = pFileBuf[uFilePos++];
+        } else
+            uCount = 1;
+    
+        // draw count pixels with color val
+        for (i=0; i<uCount; i++)
+            memcpy(data+(uDataRead++)*4, palette+uColorNum*4, 4*sizeof(uint8_t));
+    }
+    
+    // cleanup
+    delete[] palette;
+    
+    return data;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/Makefile b/contrib/vmap_extractor_v2/stormlib/Makefile
new file mode 100644
index 00000000000..3c220e89b5f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/Makefile
@@ -0,0 +1,58 @@
+#####################################################################
+###
+#
+# Makefile for compiling StormLib under linux
+#
+# Author: Marko Friedemann <marko.friedemann@bmx-chemnitz.de>
+# Created at: Mon Jan 29 18:26:01 CEST 2001
+# Computer: whiplash.flachland-chemnitz.de 
+# System: Linux 2.4.0 on i686
+#    
+# Copyright (c) 2001 BMX-Chemnitz.DE All rights reserved.
+#
+#####################################################################
+###
+
+FILES.cpp = SCommon.cpp SCompression.cpp SFileCompactArchive.cpp \
+	SFileCreateArchiveEx.cpp SFileExtractFile.cpp SFileFindFile.cpp \
+	SListFile.cpp SFileOpenArchive.cpp SFileOpenFileEx.cpp SFileReadFile.cpp \
+	StormPortLinux.cpp wave/wave.cpp huffman/huff.cpp \
+	pklib/crc32.cpp pklib/explode.cpp pklib/implode.cpp 
+FILES.o = $(FILES.cpp:.cpp=.o)
+
+LIB = libStorm.so
+
+CXX = g++
+CFLAGS = -Wall -s -D__SYS_ZLIB
+I_FLAGS = 
+LDFLAGS = -lz -lbz2
+
+all: $(LIB)
+
+$(LIB): $(FILES.o)
+	$(LD) -shared $(LDFLAGS) -o $(LIB) $(FILES.o)
+
+%.o: %.cpp
+	$(CXX) $(CFLAGS) -c $< -o $@
+
+clean:
+	$(RM) $(FILES.o) $(LIB)
+
+new: clean all
+
+mrproper: clean
+	$(RM) Makefile.deps
+
+mrnew: mrproper new
+
+install: $(LIB)
+	install $(I_FLAGS) $(LIB) /usr/local/lib
+	mkdir -p /usr/local/include/StormLib
+	cp Storm.h /usr/local/include/StormLib
+	cp StormPort.h /usr/local/include/StormLib
+	ldconfig
+
+deps:
+	$(CXX) -MM $(CFLAGS) $(FILES.cpp) > Makefile.deps
+	
+-include Makefile.deps
+
+.PHONY: all clean new mrpoper mrnew install deps
diff --git a/contrib/vmap_extractor_v2/stormlib/SCommon.cpp b/contrib/vmap_extractor_v2/stormlib/SCommon.cpp
new file mode 100644
index 00000000000..393310f675d
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SCommon.cpp
@@ -0,0 +1,1074 @@
+/*****************************************************************************/
+/* SCommon.cpp                            Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Common functions for StormLib, used by all SFile*** modules               */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 24.03.03  1.00  Lad  The first version of SFileCommon.cpp                 */
+/* 19.11.03  1.01  Dan  Big endian handling                                  */
+/* 12.06.04  1.01  Lad  Renamed to SCommon.cpp                               */
+/*****************************************************************************/
+
+#define __STORMLIB_SELF__
+#include "StormLib.h"
+#include "SCommon.h"
+
+char StormLibCopyright[] = "StormLib v 4.50 Copyright Ladislav Zezula 1998-2003";
+
+//-----------------------------------------------------------------------------
+// The buffer for decryption engine.
+
+TMPQArchive * pFirstOpen = NULL;        // The first member of MPQ archives chain
+LCID    lcLocale  = LANG_NEUTRAL;       // File locale
+USHORT  wPlatform = 0;                  // File platform
+
+//-----------------------------------------------------------------------------
+// Compression types
+
+// 
+// Data compressions
+//
+// Can be combination of MPQ_COMPRESSION_PKWARE, MPQ_COMPRESSION_BZIP2
+// and MPQ_COMPRESSION_ZLIB. Some newer compressions are not supported
+// by older games. The table of supported compressions is here:
+//
+//   MPQ_COMPRESSION_PKWARE - All games since Diablo I
+//   MPQ_COMPRESSION_ZLIB   - Games since Starcraft
+//   MPQ_COMPRESSION_BZIP2  - Games since World of Warcraft
+//
+
+static int nDataCmp = MPQ_COMPRESSION_ZLIB;
+
+//
+// WAVE compressions by quality level
+//
+
+static int uWaveCmpLevel[] = {-1, 4, 2};
+static int uWaveCmpType[] = {MPQ_COMPRESSION_PKWARE, 0x81, 0x81};
+
+//-----------------------------------------------------------------------------
+// Storm buffer functions
+
+// Buffer for the decryption engine
+#define STORM_BUFFER_SIZE   0x500
+static DWORD StormBuffer[STORM_BUFFER_SIZE];
+static BOOL  bStormBufferCreated = FALSE;
+
+int PrepareStormBuffer()
+{
+    DWORD dwSeed = 0x00100001;
+    DWORD index1 = 0;
+    DWORD index2 = 0;
+    int   i;
+
+    // Initialize the decryption buffer.
+    // Do nothing if already done.
+    if(bStormBufferCreated == FALSE)
+    {
+        for(index1 = 0; index1 < 0x100; index1++)
+        {
+            for(index2 = index1, i = 0; i < 5; i++, index2 += 0x100)
+            {
+                DWORD temp1, temp2;
+
+                dwSeed = (dwSeed * 125 + 3) % 0x2AAAAB;
+                temp1  = (dwSeed & 0xFFFF) << 0x10;
+
+                dwSeed = (dwSeed * 125 + 3) % 0x2AAAAB;
+                temp2  = (dwSeed & 0xFFFF);
+
+                StormBuffer[index2] = (temp1 | temp2);
+            }
+        }
+        bStormBufferCreated = TRUE;
+    }
+    return ERROR_SUCCESS;
+}
+
+//-----------------------------------------------------------------------------
+// Encrypting and decrypting hash table
+
+void EncryptHashTable(DWORD * pdwTable, BYTE * pbKey, DWORD dwLength)
+{
+    DWORD dwSeed1 = 0x7FED7FED;
+    DWORD dwSeed2 = 0xEEEEEEEE;
+    DWORD ch;                           // One key character
+
+    // Prepare seeds
+    while(*pbKey != 0)
+    {
+        ch = toupper(*pbKey++);
+
+        dwSeed1 = StormBuffer[0x300 + ch] ^ (dwSeed1 + dwSeed2);
+        dwSeed2 = ch + dwSeed1 + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+
+    // Encrypt it
+    dwSeed2 = 0xEEEEEEEE;
+    while(dwLength-- > 0)
+    {
+        dwSeed2   += StormBuffer[0x400 + (dwSeed1 & 0xFF)];
+        ch       = *pdwTable;
+        *pdwTable++ = ch ^ (dwSeed1 + dwSeed2);
+
+        dwSeed1  = ((~dwSeed1 << 0x15) + 0x11111111) | (dwSeed1 >> 0x0B);
+        dwSeed2  = ch + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+}
+
+void DecryptHashTable(DWORD * pdwTable, BYTE * pbKey, DWORD dwLength)
+{
+    DWORD dwSeed1 = 0x7FED7FED;
+    DWORD dwSeed2 = 0xEEEEEEEE;
+    DWORD ch;                           // One key character
+
+    // Prepare seeds
+    while(*pbKey != 0)
+    {
+        ch = toupper(*pbKey++);
+
+        dwSeed1 = StormBuffer[0x300 + ch] ^ (dwSeed1 + dwSeed2);
+        dwSeed2 = ch + dwSeed1 + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+
+    // Decrypt it
+    dwSeed2 = 0xEEEEEEEE;
+    while(dwLength-- > 0)
+    {
+        dwSeed2 += StormBuffer[0x400 + (dwSeed1 & 0xFF)];
+        ch       = *pdwTable ^ (dwSeed1 + dwSeed2);
+
+        dwSeed1  = ((~dwSeed1 << 0x15) + 0x11111111) | (dwSeed1 >> 0x0B);
+        dwSeed2  = ch + dwSeed2 + (dwSeed2 << 5) + 3;
+        *pdwTable++ = ch;
+    }
+}
+
+//-----------------------------------------------------------------------------
+// Encrypting and decrypting block table
+
+void EncryptBlockTable(DWORD * pdwTable, BYTE * pbKey, DWORD dwLength)
+{
+    DWORD dwSeed1 = 0x7FED7FED;
+    DWORD dwSeed2 = 0xEEEEEEEE;
+    DWORD ch;                           // One key character
+
+    // Prepare seeds
+    while(*pbKey != 0)
+    {
+        ch = toupper(*pbKey++);
+
+        dwSeed1 = StormBuffer[0x300 + ch] ^ (dwSeed1 + dwSeed2);
+        dwSeed2 = ch + dwSeed1 + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+
+    // Decrypt it
+    dwSeed2 = 0xEEEEEEEE;
+    while(dwLength-- > 0)
+    {
+        dwSeed2   += StormBuffer[0x400 + (dwSeed1 & 0xFF)];
+        ch       = *pdwTable;
+        *pdwTable++ = ch ^ (dwSeed1 + dwSeed2);
+
+        dwSeed1  = ((~dwSeed1 << 0x15) + 0x11111111) | (dwSeed1 >> 0x0B);
+        dwSeed2  = ch + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+}
+
+void DecryptBlockTable(DWORD * pdwTable, BYTE * pbKey, DWORD dwLength)
+{
+    DWORD dwSeed1 = 0x7FED7FED;
+    DWORD dwSeed2 = 0xEEEEEEEE;
+    DWORD ch;                           // One key character
+
+    // Prepare seeds
+    while(*pbKey != 0)
+    {
+        ch = toupper(*pbKey++);
+
+        dwSeed1 = StormBuffer[0x300 + ch] ^ (dwSeed1 + dwSeed2);
+        dwSeed2 = ch + dwSeed1 + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+
+    // Encrypt it
+    dwSeed2 = 0xEEEEEEEE;
+    while(dwLength-- > 0)
+    {
+        dwSeed2 += StormBuffer[0x400 + (dwSeed1 & 0xFF)];
+        ch     = *pdwTable ^ (dwSeed1 + dwSeed2);
+
+        dwSeed1  = ((~dwSeed1 << 0x15) + 0x11111111) | (dwSeed1 >> 0x0B);
+        dwSeed2  = ch + dwSeed2 + (dwSeed2 << 5) + 3;
+        *pdwTable++ = ch;
+    }
+}
+
+//-----------------------------------------------------------------------------
+// Functions tries to get file decryption key. The trick comes from block
+// positions which are stored at the begin of each compressed file. We know the
+// file size, that means we know number of blocks that means we know the first
+// DWORD value in block position. And if we know encrypted and decrypted value,
+// we can find the decryption key !!!
+//
+// hf    - MPQ file handle
+// block - DWORD array of block positions
+// ch    - Decrypted value of the first block pos
+
+DWORD DetectFileSeed(DWORD * block, DWORD decrypted)
+{
+    DWORD saveSeed1;
+    DWORD temp = *block ^ decrypted;    // temp = seed1 + seed2
+    temp -= 0xEEEEEEEE;                 // temp = seed1 + StormBuffer[0x400 + (seed1 & 0xFF)]
+
+    for(int i = 0; i < 0x100; i++)      // Try all 255 possibilities
+    {
+        DWORD seed1;
+        DWORD seed2 = 0xEEEEEEEE;
+        DWORD ch;
+
+        // Try the first DWORD (We exactly know the value)
+        seed1  = temp - StormBuffer[0x400 + i];
+        seed2 += StormBuffer[0x400 + (seed1 & 0xFF)];
+        ch     = block[0] ^ (seed1 + seed2);
+
+        if(ch != decrypted)
+            continue;
+
+        // Add 1 because we are decrypting block positions
+        saveSeed1 = seed1 + 1;
+
+        // If OK, continue and test the second value. We don't know exactly the value,
+        // but we know that the second one has lower 16 bits set to zero
+        // (no compressed block is larger than 0xFFFF bytes)
+        seed1  = ((~seed1 << 0x15) + 0x11111111) | (seed1 >> 0x0B);
+        seed2  = ch + seed2 + (seed2 << 5) + 3;
+
+        seed2 += StormBuffer[0x400 + (seed1 & 0xFF)];
+        ch     = block[1] ^ (seed1 + seed2);
+
+        if((ch & 0xFFFF0000) == 0)
+            return saveSeed1;
+    }
+    return 0;
+}
+
+// Function tries to detect file seed. It expectes at least two uncompressed bytes
+DWORD DetectFileSeed2(DWORD * pdwBlock, UINT nDwords, ...)
+{
+    va_list argList;
+    DWORD dwDecrypted[0x10];
+    DWORD saveSeed1;
+    DWORD dwTemp;
+    DWORD i, j;
+    
+    // We need at least two DWORDS to detect the seed
+    if(nDwords < 0x02 || nDwords > 0x10)
+        return 0;
+    
+    va_start(argList, nDwords);
+    for(i = 0; i < nDwords; i++)
+        dwDecrypted[i] = va_arg(argList, DWORD);
+    va_end(argList);
+    
+    dwTemp = (*pdwBlock ^ dwDecrypted[0]) - 0xEEEEEEEE;
+    for(i = 0; i < 0x100; i++)      // Try all 255 possibilities
+    {
+        DWORD seed1;
+        DWORD seed2 = 0xEEEEEEEE;
+        DWORD ch;
+
+        // Try the first DWORD
+        seed1  = dwTemp - StormBuffer[0x400 + i];
+        seed2 += StormBuffer[0x400 + (seed1 & 0xFF)];
+        ch     = pdwBlock[0] ^ (seed1 + seed2);
+
+        if(ch != dwDecrypted[0])
+            continue;
+
+        saveSeed1 = seed1;
+
+        // If OK, continue and test all bytes.
+        for(j = 1; j < nDwords; j++)
+        {
+            seed1  = ((~seed1 << 0x15) + 0x11111111) | (seed1 >> 0x0B);
+            seed2  = ch + seed2 + (seed2 << 5) + 3;
+
+            seed2 += StormBuffer[0x400 + (seed1 & 0xFF)];
+            ch     = pdwBlock[j] ^ (seed1 + seed2);
+
+            if(ch == dwDecrypted[j] && j == nDwords - 1)
+                return saveSeed1;
+        }
+    }
+    return 0;
+}
+
+
+//-----------------------------------------------------------------------------
+// Encrypting and decrypting MPQ blocks
+
+void EncryptMPQBlock(DWORD * block, DWORD dwLength, DWORD dwSeed1)
+{
+    DWORD dwSeed2 = 0xEEEEEEEE;
+    DWORD ch;
+
+    // Round to DWORDs
+    dwLength >>= 2;
+
+    while(dwLength-- > 0)
+    {
+        dwSeed2 += StormBuffer[0x400 + (dwSeed1 & 0xFF)];
+        ch     = *block;
+        *block++ = ch ^ (dwSeed1 + dwSeed2);
+
+        dwSeed1  = ((~dwSeed1 << 0x15) + 0x11111111) | (dwSeed1 >> 0x0B);
+        dwSeed2  = ch + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+}
+
+void DecryptMPQBlock(DWORD * block, DWORD dwLength, DWORD dwSeed1)
+{
+    DWORD dwSeed2 = 0xEEEEEEEE;
+    DWORD ch;
+
+    // Round to DWORDs
+    dwLength >>= 2;
+
+    while(dwLength-- > 0)
+    {
+        dwSeed2 += StormBuffer[0x400 + (dwSeed1 & 0xFF)];
+        ch     = *block ^ (dwSeed1 + dwSeed2);
+
+        dwSeed1  = ((~dwSeed1 << 0x15) + 0x11111111) | (dwSeed1 >> 0x0B);
+        dwSeed2  = ch + dwSeed2 + (dwSeed2 << 5) + 3;
+        *block++ = ch;
+    }
+}
+
+
+DWORD DecryptHashIndex(TMPQArchive * ha, const char * szFileName)
+{
+    BYTE * pbKey   = (BYTE *)szFileName;
+    DWORD  dwSeed1 = 0x7FED7FED;
+    DWORD  dwSeed2 = 0xEEEEEEEE;
+    DWORD  ch;
+
+    while(*pbKey != 0)
+    {
+        ch = toupper(*pbKey++);
+
+        dwSeed1 = StormBuffer[0x000 + ch] ^ (dwSeed1 + dwSeed2);
+        dwSeed2 = ch + dwSeed1 + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+    return (dwSeed1 & (ha->pHeader->dwHashTableSize - 1));
+}
+
+DWORD DecryptName1(const char * szFileName)
+{
+    BYTE * pbKey   = (BYTE *)szFileName;
+    DWORD  dwSeed1 = 0x7FED7FED;
+    DWORD  dwSeed2 = 0xEEEEEEEE;
+    DWORD  ch;
+
+    while(*pbKey != 0)
+    {
+        ch = toupper(*pbKey++);
+
+        dwSeed1 = StormBuffer[0x100 + ch] ^ (dwSeed1 + dwSeed2);
+        dwSeed2 = ch + dwSeed1 + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+    return dwSeed1;
+}
+
+DWORD DecryptName2(const char * szFileName)
+{
+    BYTE * pbKey   = (BYTE *)szFileName;
+    DWORD  dwSeed1 = 0x7FED7FED;
+    DWORD  dwSeed2 = 0xEEEEEEEE;
+    int    ch;
+
+    while(*pbKey != 0)
+    {
+        ch = toupper(*pbKey++);
+
+        dwSeed1 = StormBuffer[0x200 + ch] ^ (dwSeed1 + dwSeed2);
+        dwSeed2 = ch + dwSeed1 + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+    return dwSeed1;
+}
+
+DWORD DecryptFileSeed(const char * szFileName)
+{
+    BYTE * pbKey   = (BYTE *)szFileName;
+    DWORD  dwSeed1 = 0x7FED7FED;          // EBX
+    DWORD  dwSeed2 = 0xEEEEEEEE;          // ESI
+    DWORD  ch;
+
+    while(*pbKey != 0)
+    {
+        ch = toupper(*pbKey++);           // ECX
+
+        dwSeed1 = StormBuffer[0x300 + ch] ^ (dwSeed1 + dwSeed2);
+        dwSeed2 = ch + dwSeed1 + dwSeed2 + (dwSeed2 << 5) + 3;
+    }
+    return dwSeed1;
+}
+
+TMPQHash * GetHashEntry(TMPQArchive * ha, const char * szFileName)
+{
+    TMPQHash * pHashEnd = ha->pHashTable + ha->pHeader->dwHashTableSize;
+    TMPQHash * pHash0;                      // File hash entry (start)
+    TMPQHash * pHash;                       // File hash entry (current)
+    DWORD dwIndex = (DWORD)(DWORD_PTR)szFileName;
+    DWORD dwName1;
+    DWORD dwName2;
+
+    // If filename is given by index, we have to search all hash entries for the right index.
+    if(dwIndex <= ha->pHeader->dwBlockTableSize)
+    {
+        // Pass all the hash entries and find the 
+        for(pHash = ha->pHashTable; pHash < pHashEnd; pHash++)
+        {
+            if(pHash->dwBlockIndex == dwIndex)
+                return pHash;
+        }
+        return NULL;
+    }
+
+    // Decrypt name and block index
+    dwIndex = DecryptHashIndex(ha, szFileName);
+    dwName1 = DecryptName1(szFileName);
+    dwName2 = DecryptName2(szFileName);
+    pHash   = pHash0 = ha->pHashTable + dwIndex;
+    
+    // Look for hash index
+    while(pHash->dwBlockIndex != HASH_ENTRY_FREE)
+    {
+        if(pHash->dwName1 == dwName1 && pHash->dwName2 == dwName2 && pHash->dwBlockIndex != HASH_ENTRY_DELETED)
+            return pHash;
+
+        // Move to the next hash entry
+        if(++pHash >= pHashEnd)
+            pHash = ha->pHashTable;
+        if(pHash == pHash0)
+            break;
+    }
+
+    // File was not found
+    return NULL;
+}
+
+// Retrieves the locale-specific hash entry
+TMPQHash * GetHashEntryEx(TMPQArchive * ha, const char * szFileName, LCID lcLocale)
+{
+    TMPQHash * pHashEnd = ha->pHashTable + ha->pHeader->dwHashTableSize;
+    TMPQHash * pHash0 = NULL;           // Language-neutral hash entry
+    TMPQHash * pHashX = NULL;           // Language-speficic
+    TMPQHash * pHash = GetHashEntry(ha, szFileName);
+
+    if(pHash != NULL)
+    {
+        TMPQHash * pHashStart = pHash;
+        DWORD dwName1 = pHash->dwName1;
+        DWORD dwName2 = pHash->dwName2;
+
+        while(pHash->dwBlockIndex != HASH_ENTRY_FREE)
+        {
+            if(pHash->dwName1 == dwName1 && pHash->dwName2 == dwName2)
+            {
+                if(pHash->lcLocale == LANG_NEUTRAL)
+                    pHash0 = pHash;
+                if(pHash->lcLocale == lcLocale)
+                    pHashX = pHash;
+
+                // If both found, break the loop
+                if(pHash0 != NULL && pHashX != NULL)
+                    break;
+            }
+
+            if(++pHash >= pHashEnd)
+                pHash = ha->pHashTable;
+            if(pHash == pHashStart)
+                return NULL;
+        }
+
+        if(lcLocale != LANG_NEUTRAL && pHashX != NULL)
+            return pHashX;
+        if(pHash0 != NULL)
+            return pHash0;
+        return NULL;
+    }
+
+    return pHash;
+}
+
+// Encrypts file name and gets the hash entry
+// Returns the hash pointer, which is always within the allocated array
+TMPQHash * FindFreeHashEntry(TMPQArchive * ha, const char * szFileName)
+{
+    TMPQHash * pHashEnd = ha->pHashTable + ha->pHeader->dwHashTableSize;
+    TMPQHash * pHash0;                    // File hash entry (search start)
+    TMPQHash * pHash;                     // File hash entry
+    DWORD dwIndex = DecryptHashIndex(ha, szFileName);
+    DWORD dwName1 = DecryptName1(szFileName);
+    DWORD dwName2 = DecryptName2(szFileName);
+    DWORD dwBlockIndex = 0xFFFFFFFF;
+
+    // Save the starting hash position
+    pHash = pHash0 = ha->pHashTable + dwIndex;
+
+    // Look for the first free hash entry. Can be also a deleted entry
+    while(pHash->dwBlockIndex < HASH_ENTRY_DELETED)
+    {
+        if(++pHash >= pHashEnd)
+            pHash = ha->pHashTable;
+        if(pHash == pHash0)
+            return NULL;
+    }
+
+    // Fill the hash entry with the informations about the file name
+    pHash->dwName1   = dwName1;
+    pHash->dwName2   = dwName2;
+    pHash->lcLocale  = (USHORT)lcLocale;
+    pHash->wPlatform = wPlatform;
+
+    // Now we have to find a free block entry
+    for(dwIndex = 0; dwIndex < ha->pHeader->dwBlockTableSize; dwIndex++)
+    {
+        TMPQBlock * pBlock = ha->pBlockTable + dwIndex;
+
+        if((pBlock->dwFlags & MPQ_FILE_EXISTS) == 0)
+        {
+            dwBlockIndex = dwIndex;
+            break;
+        }
+    }
+
+    // If no free block entry found, we have to use the index
+    // at the end of the current block table
+    if(dwBlockIndex == 0xFFFFFFFF)
+        dwBlockIndex = ha->pHeader->dwBlockTableSize;
+    pHash->dwBlockIndex = dwBlockIndex;
+    return pHash;
+}
+
+//-----------------------------------------------------------------------------
+// Checking for valid archive handle and valid file handle
+
+BOOL IsValidMpqHandle(TMPQArchive * ha)
+{
+    if(ha == NULL || IsBadReadPtr(ha, sizeof(TMPQArchive)))
+        return FALSE;
+    if(ha->pHeader == NULL || IsBadReadPtr(ha->pHeader, sizeof(TMPQHeader)))
+        return FALSE;
+    
+    return (ha->pHeader->dwID == ID_MPQ);
+}
+
+BOOL IsValidFileHandle(TMPQFile * hf)
+{
+    if(hf == NULL || IsBadReadPtr(hf, sizeof(TMPQFile)))
+        return FALSE;
+
+    if(hf->hFile != INVALID_HANDLE_VALUE)
+        return TRUE;
+
+    return IsValidMpqHandle(hf->ha);
+}
+
+// This function writes a local file into the MPQ archive.
+// Returns 0 if OK, otherwise error code.
+// TODO: Test for archives > 4GB
+int AddFileToArchive(
+    TMPQArchive * ha,
+    HANDLE hFile,
+    const char * szArchivedName,
+    DWORD dwFlags,
+    DWORD dwQuality,
+    int nFileType,
+    BOOL * pbReplaced)
+{
+    LARGE_INTEGER RelativePos = {0};
+    LARGE_INTEGER FilePos = {0};
+    LARGE_INTEGER TempPos;
+    TMPQBlockEx * pBlockEx = NULL;      // Entry in the extended block table
+    TMPQBlock * pBlock = NULL;          // Entry in the block table
+    TMPQHash * pHash = NULL;            // Entry in the hash table
+    DWORD * pdwBlockPos = NULL;         // Block position table (compressed files only)
+    BYTE  * pbFileData = NULL;          // Uncompressed (source) data
+    BYTE  * pbCompressed = NULL;        // Compressed (target) data
+    BYTE  * pbToWrite = NULL;           // Data to write to the file
+    DWORD   dwBlockPosLen = 0;          // Length of the block table positions
+    DWORD   dwTransferred = 0;          // Number of bytes written into archive file
+    DWORD   dwFileSize = 0;             // Size of the file to add
+    DWORD   dwSeed1   = 0;              // Encryption seed
+    DWORD   nBlocks   = 0;              // Number of file blocks
+    DWORD   nBlock = 0;                 // Index of the currently written block
+    BOOL    bReplaced = FALSE;          // TRUE if replaced, FALSE if added
+    int     nCmpFirst = nDataCmp;       // Compression for the first data block
+    int     nCmpNext  = nDataCmp;       // Compression for the next data blocks
+    int     nCmp      = nDataCmp;       // Current compression
+    int     nCmpLevel = -1;             // Compression level
+    int     nError = ERROR_SUCCESS;
+
+    // Set the correct compression types
+    if(dwFlags & MPQ_FILE_COMPRESS_PKWARE)
+        nCmpFirst = nCmpNext = MPQ_COMPRESSION_PKWARE;
+
+    if(dwFlags & MPQ_FILE_COMPRESS_MULTI)
+    {
+        if(nFileType == SFILE_TYPE_DATA)
+            nCmpFirst = nCmpNext = nDataCmp;
+    
+        if(nFileType == SFILE_TYPE_WAVE)
+        {
+            nCmpNext  = uWaveCmpType[dwQuality];
+            nCmpLevel = uWaveCmpLevel[dwQuality];
+        }
+    }
+
+    // Check if the file already exists in the archive
+    if(nError == ERROR_SUCCESS)
+    {
+        if((pHash = GetHashEntryEx(ha, szArchivedName, lcLocale)) != NULL)
+        {
+            if(pHash->lcLocale == lcLocale)
+            {
+                if((dwFlags & MPQ_FILE_REPLACEEXISTING) == 0)
+                {
+                    nError = ERROR_ALREADY_EXISTS;
+                    pHash = NULL;
+                }
+                else
+                    bReplaced = TRUE;
+            }
+            else
+                pHash = NULL;
+        }
+
+        if(nError == ERROR_SUCCESS && pHash == NULL)
+        {
+            pHash = FindFreeHashEntry(ha, szArchivedName);
+            if(pHash == NULL)
+                nError = ERROR_HANDLE_DISK_FULL;
+        }
+    }
+
+    // Get the block table entry for the file
+    if(nError == ERROR_SUCCESS)
+    {
+        DWORD dwFileSizeHigh = 0;
+
+        // Get the size of the added file
+        dwFileSize = GetFileSize(hFile, &dwFileSizeHigh);
+        if(dwFileSizeHigh != 0)
+            nError = ERROR_PARAMETER_QUOTA_EXCEEDED;
+
+        // Fix the flags, if the file is too small
+        if(dwFileSize < 0x04)
+            dwFlags &= ~(MPQ_FILE_ENCRYPTED | MPQ_FILE_FIXSEED);
+        if(dwFileSize < 0x20)
+            dwFlags &= ~MPQ_FILE_COMPRESSED;
+
+        if(pHash->dwBlockIndex == HASH_ENTRY_FREE)
+            pHash->dwBlockIndex = ha->pHeader->dwBlockTableSize;
+
+        // The block table index cannot be larger than hash table size
+        if(pHash->dwBlockIndex >= ha->pHeader->dwHashTableSize)
+            nError = ERROR_HANDLE_DISK_FULL;
+    }
+
+    // The file will be stored after the end of the last archived file
+    // (i.e. at old position of archived file
+    if(nError == ERROR_SUCCESS)
+    {
+        TMPQBlock * pBlockEnd = ha->pBlockTable + ha->pHeader->dwBlockTableSize;
+        const char * szTemp = strrchr(szArchivedName, '\\');
+
+        // Get the position of the first file
+        RelativePos.QuadPart = ha->pHeader->dwHeaderSize;
+
+        // Find the position of the last file. It has to be after the last archived file
+        // (Do not use the dwArchiveSize here, because it may or may not
+        // include the hash table at the end of the file
+        pBlockEx = ha->pExtBlockTable;
+        for(pBlock = ha->pBlockTable; pBlock < pBlockEnd; pBlock++, pBlockEx++)
+        {
+            if(pBlock->dwFlags & MPQ_FILE_EXISTS)
+            {
+                TempPos.HighPart = pBlockEx->wFilePosHigh;
+                TempPos.LowPart = pBlock->dwFilePos;
+                TempPos.QuadPart += pBlock->dwCSize;
+
+                if(TempPos.QuadPart > RelativePos.QuadPart)
+                    RelativePos = TempPos;
+            }
+        }
+
+        // When format V1, we cannot exceed 4 GB
+        if(ha->pHeader->wFormatVersion == MPQ_FORMAT_VERSION_1)
+        {
+            TempPos.QuadPart = ha->MpqPos.QuadPart + RelativePos.QuadPart;
+            TempPos.QuadPart += ha->pHeader->dwHashTableSize * sizeof(TMPQHash);
+            TempPos.QuadPart += ha->pHeader->dwBlockTableSize * sizeof(TMPQBlock);
+            TempPos.QuadPart += dwFileSize;
+
+            if(TempPos.HighPart != 0)
+                nError = ERROR_DISK_FULL;
+        }
+
+        // Get pointers to both block entries of the file
+        pBlockEx = ha->pExtBlockTable + pHash->dwBlockIndex;
+        pBlock = ha->pBlockTable + pHash->dwBlockIndex;
+        
+        // Save the file size info
+        pBlockEx->wFilePosHigh = (USHORT)RelativePos.HighPart;
+        pBlock->dwFilePos = RelativePos.LowPart;
+        pBlock->dwFSize   = GetFileSize(hFile, NULL);
+        pBlock->dwFlags   = dwFlags | MPQ_FILE_EXISTS;
+
+        // Create seed1 for file encryption
+        if(szTemp != NULL)
+            szArchivedName = szTemp + 1;
+
+        if(dwFlags & MPQ_FILE_ENCRYPTED)
+        {
+            dwSeed1 = DecryptFileSeed(szArchivedName);
+            
+            if(dwFlags & MPQ_FILE_FIXSEED)
+                dwSeed1 = (dwSeed1 + pBlock->dwFilePos) ^ pBlock->dwFSize;
+        }
+    }
+
+    // Allocate buffer for the input data
+    if(nError == ERROR_SUCCESS)
+    {
+        nBlocks = (pBlock->dwFSize / ha->dwBlockSize) + 1;
+        if(pBlock->dwFSize % ha->dwBlockSize)
+            nBlocks++;
+
+        pBlock->dwCSize = 0;
+        if((pbFileData = ALLOCMEM(BYTE, ha->dwBlockSize)) == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+        pbToWrite = pbFileData;
+    }
+
+    // Allocate buffers for the compressed data
+    if(nError == ERROR_SUCCESS && (dwFlags & MPQ_FILE_COMPRESSED))
+    {
+        pdwBlockPos  = ALLOCMEM(DWORD, nBlocks + 1);
+        pbCompressed = ALLOCMEM(BYTE, ha->dwBlockSize * 2);
+        if(pdwBlockPos == NULL || pbCompressed == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+        pbToWrite = pbCompressed;
+    }
+
+    // Set the file position to the point where the file will be stored
+    if(nError == ERROR_SUCCESS)
+    {
+        // Set the file pointer to file data position
+        FilePos.QuadPart = ha->MpqPos.QuadPart + RelativePos.QuadPart;
+        if(FilePos.QuadPart != ha->FilePointer.QuadPart)
+        {
+            SetFilePointer(ha->hFile, FilePos.LowPart, &FilePos.HighPart, FILE_BEGIN);
+            ha->FilePointer = FilePos;
+        }
+    }
+
+    // Write block positions (if the file will be compressed)
+    if(nError == ERROR_SUCCESS && (dwFlags & MPQ_FILE_COMPRESSED))
+    {
+        dwBlockPosLen = nBlocks * sizeof(DWORD);
+        if(dwFlags & MPQ_FILE_HAS_EXTRA)
+            dwBlockPosLen += sizeof(DWORD);
+
+        memset(pdwBlockPos, 0, dwBlockPosLen);
+        pdwBlockPos[0] = dwBlockPosLen;
+        
+        // Write the block positions
+        BSWAP_ARRAY32_UNSIGNED((DWORD *)pdwBlockPos, nBlocks);
+        WriteFile(ha->hFile, pdwBlockPos, dwBlockPosLen, &dwTransferred, NULL);
+        BSWAP_ARRAY32_UNSIGNED((DWORD *)pdwBlockPos, nBlocks);
+
+        if(dwTransferred == dwBlockPosLen)
+            pBlock->dwCSize += dwBlockPosLen;
+        else
+            nError = GetLastError();
+
+        // Update the current position in the file
+        ha->HashTablePos.QuadPart = FilePos.QuadPart + dwTransferred;
+    }
+
+    // Write all file blocks
+    if(nError == ERROR_SUCCESS)
+    {
+        nCmp = nCmpFirst;
+
+        SetFilePointer(hFile, 0, NULL, FILE_BEGIN);
+        for(nBlock = 0; nBlock < nBlocks-1; nBlock++)
+        {
+            DWORD dwInLength  = ha->dwBlockSize;
+            DWORD dwOutLength = ha->dwBlockSize;
+
+            // Load the block from the file
+            ReadFile(hFile, pbFileData, ha->dwBlockSize, &dwInLength, NULL);
+            if(dwInLength == 0)
+                break;
+
+            // Compress the block, if necessary
+            dwOutLength = dwInLength;
+            if(pBlock->dwFlags & MPQ_FILE_COMPRESSED)
+            {
+                // Should be enough for compression
+                int nOutLength = ha->dwBlockSize * 2;
+                int nCmpType = 0;
+
+                if(pBlock->dwFlags & MPQ_FILE_COMPRESS_PKWARE)
+                    Compress_pklib((char *)pbCompressed, &nOutLength, (char *)pbFileData, dwInLength, &nCmpType, 0);
+
+                if(pBlock->dwFlags & MPQ_FILE_COMPRESS_MULTI)
+                    SCompCompress((char *)pbCompressed, &nOutLength, (char *)pbFileData, dwInLength, nCmp, 0, nCmpLevel);
+
+                // The compressed block size must NOT be the same or greater like
+                // the original block size. If yes, do not compress the block
+                // and store the data as-is.
+                if(nOutLength >= (int)dwInLength)
+                {
+                    memcpy(pbCompressed, pbFileData, dwInLength);
+                    nOutLength = dwInLength;
+                }
+
+                // Update block positions
+                dwOutLength = nOutLength;
+                pdwBlockPos[nBlock+1] = pdwBlockPos[nBlock] + dwOutLength;
+                nCmp = nCmpNext;
+            }
+
+            // Encrypt the block, if necessary
+            if(pBlock->dwFlags & MPQ_FILE_ENCRYPTED)
+            {
+                BSWAP_ARRAY32_UNSIGNED((DWORD *)pbToWrite, dwOutLength / sizeof(DWORD));
+                EncryptMPQBlock((DWORD *)pbToWrite, dwOutLength, dwSeed1 + nBlock);
+                BSWAP_ARRAY32_UNSIGNED((DWORD *)pbToWrite, dwOutLength / sizeof(DWORD));
+            }
+            
+            // Write the block
+            WriteFile(ha->hFile, pbToWrite, dwOutLength, &dwTransferred, NULL);
+            if(dwTransferred != dwOutLength)
+            {
+                nError = ERROR_DISK_FULL;
+                break;
+            }
+
+            // Update the hash table position and the compressed file size
+            ha->HashTablePos.QuadPart += dwTransferred;
+            pBlock->dwCSize += dwOutLength;
+        }
+    }
+
+    // Now save the block positions
+    if(nError == ERROR_SUCCESS && (pBlock->dwFlags & MPQ_FILE_COMPRESSED))
+    {
+        if(dwFlags & MPQ_FILE_HAS_EXTRA)
+            pdwBlockPos[nBlocks] = pdwBlockPos[nBlocks-1];
+
+        // If file is encrypted, block positions are also encrypted
+        if(dwFlags & MPQ_FILE_ENCRYPTED)
+            EncryptMPQBlock(pdwBlockPos, dwBlockPosLen, dwSeed1 - 1);
+        
+        // Set the position back to the block table
+        SetFilePointer(ha->hFile, FilePos.LowPart, &FilePos.HighPart, FILE_BEGIN);
+        
+        // Write block positions to the archive
+        BSWAP_ARRAY32_UNSIGNED((DWORD *)pdwBlockPos, nBlocks);
+        WriteFile(ha->hFile, pdwBlockPos, dwBlockPosLen, &dwTransferred, NULL);
+        if(dwTransferred != dwBlockPosLen)
+            nError = ERROR_DISK_FULL;
+
+        ha->FilePointer.QuadPart = ha->FilePointer.QuadPart + dwTransferred;
+    }
+
+    // If success, we have to change the settings
+    // in MPQ header. If failed, we have to clean hash entry
+    if(nError == ERROR_SUCCESS)
+    {
+        ha->pLastFile  = NULL;
+        ha->dwBlockPos = 0;
+        ha->dwBuffPos  = 0;
+        ha->dwFlags   |= MPQ_FLAG_CHANGED;
+
+        // Add new entry to the block table (if needed)
+        if(pHash->dwBlockIndex >= ha->pHeader->dwBlockTableSize)
+            ha->pHeader->dwBlockTableSize++;
+
+        // Hash table size in the TMPQArchive is already set at this point
+        RelativePos.QuadPart = ha->HashTablePos.QuadPart - ha->MpqPos.QuadPart;
+        ha->pHeader->dwHashTablePos = RelativePos.LowPart;
+        ha->pHeader->wHashTablePosHigh = (USHORT)RelativePos.HighPart;
+
+        // Update block table pos
+        RelativePos.QuadPart += (ha->pHeader->dwHashTableSize * sizeof(TMPQHash));
+        ha->pHeader->wBlockTablePosHigh = (USHORT)RelativePos.HighPart;
+        ha->pHeader->dwBlockTablePos = RelativePos.LowPart;
+        ha->BlockTablePos.QuadPart = RelativePos.QuadPart + ha->MpqPos.QuadPart;
+
+        // If the archive size exceeded 4GB, we have to use extended block table pos
+        RelativePos.QuadPart += (ha->pHeader->dwBlockTableSize * sizeof(TMPQBlock));
+        if(RelativePos.HighPart != 0)
+        {
+            ha->pHeader->ExtBlockTablePos = RelativePos;
+            ha->ExtBlockTablePos.QuadPart = RelativePos.QuadPart + ha->MpqPos.QuadPart;
+
+            RelativePos.QuadPart += (ha->pHeader->dwBlockTableSize * sizeof(TMPQBlockEx));
+        }
+
+        // Update archive size (only valid for version V1)
+        ha->MpqSize = RelativePos;
+        ha->pHeader->dwArchiveSize = ha->MpqSize.LowPart;
+    }
+    else
+    {
+        // Clear the hash table entry
+        if(pHash != NULL)
+            memset(pHash, 0xFF, sizeof(TMPQHash));
+    }
+
+    // Cleanup
+    if(pbCompressed != NULL)
+        FREEMEM(pbCompressed);
+    if(pdwBlockPos != NULL)
+        FREEMEM(pdwBlockPos);
+    if(pbFileData != NULL)
+        FREEMEM(pbFileData);
+    if(pbReplaced != NULL)
+        *pbReplaced = bReplaced;
+    return nError;
+}
+
+int SetDataCompression(int nDataCompression)
+{
+    nDataCmp = nDataCompression;
+    return 0;
+}
+
+// This method saves MPQ header, hash table and block table.
+// TODO: Test for archives > 4GB
+int SaveMPQTables(TMPQArchive * ha)
+{
+    BYTE * pbBuffer = NULL;
+    DWORD dwBytes;
+    DWORD dwWritten;
+    DWORD dwBuffSize = max(ha->pHeader->dwHashTableSize, ha->pHeader->dwBlockTableSize);
+    int   nError = ERROR_SUCCESS;
+
+    // Allocate buffer for encrypted tables
+    if(nError == ERROR_SUCCESS)
+    {
+        // Allocate temporary buffer for tables encryption
+        pbBuffer = ALLOCMEM(BYTE, sizeof(TMPQHash) * dwBuffSize);
+        if(pbBuffer == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+    }
+
+    // Write the MPQ Header
+    if(nError == ERROR_SUCCESS)
+    {
+        DWORD dwHeaderSize = ha->pHeader->dwHeaderSize;
+
+        // Write the MPQ header
+        SetFilePointer(ha->hFile, ha->MpqPos.LowPart, &ha->MpqPos.HighPart, FILE_BEGIN);
+
+        // Convert to little endian for file save
+        BSWAP_TMPQHEADER(ha->pHeader);
+        WriteFile(ha->hFile, ha->pHeader, dwHeaderSize, &dwWritten, NULL);
+        BSWAP_TMPQHEADER(ha->pHeader);
+
+        if(dwWritten != ha->pHeader->dwHeaderSize)
+            nError = ERROR_DISK_FULL;
+    }
+
+    // Write the hash table
+    if(nError == ERROR_SUCCESS)
+    {
+        // Copy the hash table to temporary buffer
+        dwBytes = ha->pHeader->dwHashTableSize * sizeof(TMPQHash);
+        memcpy(pbBuffer, ha->pHashTable, dwBytes);
+
+        // Convert to little endian for file save
+        EncryptHashTable((DWORD *)pbBuffer, (BYTE *)"(hash table)", dwBytes >> 2);
+        BSWAP_ARRAY32_UNSIGNED((DWORD *)pbBuffer, dwBytes / sizeof(DWORD));
+
+        // Set the file pointer to the offset of the hash table and write it
+        SetFilePointer(ha->hFile, ha->HashTablePos.LowPart, (PLONG)&ha->HashTablePos.HighPart, FILE_BEGIN);
+        WriteFile(ha->hFile, pbBuffer, dwBytes, &dwWritten, NULL);
+        if(dwWritten != dwBytes)
+            nError = ERROR_DISK_FULL;
+    }
+
+    // Write the block table
+    if(nError == ERROR_SUCCESS)
+    {
+        // Copy the block table to temporary buffer
+        dwBytes = ha->pHeader->dwBlockTableSize * sizeof(TMPQBlock);
+        memcpy(pbBuffer, ha->pBlockTable, dwBytes);
+
+        // Encrypt the block table and write it to the file
+        EncryptBlockTable((DWORD *)pbBuffer, (BYTE *)"(block table)", dwBytes >> 2);
+        
+        // Convert to little endian for file save
+        BSWAP_ARRAY32_UNSIGNED((DWORD *)pbBuffer, dwBytes / sizeof(DWORD));
+        WriteFile(ha->hFile, pbBuffer, dwBytes, &dwWritten, NULL);
+        if(dwWritten != dwBytes)
+            nError = ERROR_DISK_FULL;
+    }
+
+    // Write the extended block table
+    if(nError == ERROR_SUCCESS && ha->pHeader->ExtBlockTablePos.QuadPart != 0)
+    {
+        // We expect format V2 or newer in this case
+        assert(ha->pHeader->wFormatVersion >= MPQ_FORMAT_VERSION_2);
+
+        // Copy the block table to temporary buffer
+        dwBytes = ha->pHeader->dwBlockTableSize * sizeof(TMPQBlockEx);
+        memcpy(pbBuffer, ha->pExtBlockTable, dwBytes);
+
+        // Convert to little endian for file save
+        BSWAP_ARRAY16_UNSIGNED((USHORT *)pbBuffer, dwBytes / sizeof(USHORT));
+        WriteFile(ha->hFile, pbBuffer, dwBytes, &dwWritten, NULL);
+        if(dwWritten != dwBytes)
+            nError = ERROR_DISK_FULL;
+    }
+
+
+    // Set end of file here
+    if(nError == ERROR_SUCCESS)
+    {
+        SetEndOfFile(ha->hFile);
+    }
+
+    // Cleanup and exit
+    if(pbBuffer != NULL)
+        FREEMEM(pbBuffer);
+    return nError;
+}
+
+// Frees the MPQ archive
+// TODO: Test for archives > 4GB
+void FreeMPQArchive(TMPQArchive *& ha)
+{
+    if(ha != NULL)
+    {
+        FREEMEM(ha->pbBlockBuffer);
+        FREEMEM(ha->pBlockTable);
+        FREEMEM(ha->pExtBlockTable);
+        FREEMEM(ha->pHashTable);
+        if(ha->pListFile != NULL)
+            SListFileFreeListFile(ha);
+
+        if(ha->hFile != INVALID_HANDLE_VALUE)
+            CloseHandle(ha->hFile);
+        FREEMEM(ha);
+        ha = NULL;
+    }
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/SCommon.h b/contrib/vmap_extractor_v2/stormlib/SCommon.h
new file mode 100644
index 00000000000..b53be0ae2a8
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SCommon.h
@@ -0,0 +1,88 @@
+/*****************************************************************************/
+/* SCommon.h                              Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Common functions for encryption/decryption from Storm.dll. Included by    */
+/* SFile*** functions, do not include and do not use this file directly      */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 24.03.03  1.00  Lad  The first version of SFileCommon.h                   */
+/* 12.06.04  1.00  Lad  Renamed to SCommon.h                                 */
+/*****************************************************************************/
+
+#ifndef __SCOMMON_H__
+#define __SCOMMON_H__
+
+//-----------------------------------------------------------------------------
+// StormLib private defines
+
+#define SFILE_TYPE_DATA  0              // Process the file as data file
+#define SFILE_TYPE_WAVE  1              // Process the file as WAVe file
+
+//-----------------------------------------------------------------------------
+// External variables
+
+extern TMPQArchive * pFirstOpen;
+extern LCID          lcLocale;
+
+//-----------------------------------------------------------------------------
+// Encryption and decryption functions
+
+int   PrepareStormBuffer();
+
+void  EncryptHashTable(DWORD * pdwTable, BYTE * pbKey, DWORD dwLength);
+void  DecryptHashTable(DWORD * pdwTable, BYTE * pbKey, DWORD dwLength);
+TMPQHash * FindFreeHashEntry(TMPQArchive * ha, const char * szFileName);
+
+void  EncryptBlockTable(DWORD * pdwTable, BYTE * pbKey, DWORD dwLength);
+void  DecryptBlockTable(DWORD * pdwTable, BYTE * pbKey, DWORD dwLength);
+
+DWORD DetectFileSeed(DWORD * block, DWORD decrypted);
+DWORD DetectFileSeed2(DWORD * block, UINT nDwords, ...);
+void  EncryptMPQBlock(DWORD * pdwBlock, DWORD dwLength, DWORD dwSeed1);
+void  DecryptMPQBlock(DWORD * pdwBlock, DWORD dwLength, DWORD dwSeed1);
+
+DWORD DecryptHashIndex(TMPQArchive * ha, const char * szFileName);
+DWORD DecryptName1    (const char * szFileName);
+DWORD DecryptName2    (const char * szFileName);
+DWORD DecryptFileSeed (const char * szFileName);
+
+TMPQHash * GetHashEntry  (TMPQArchive * ha, const char * szFileName);
+TMPQHash * GetHashEntryEx(TMPQArchive * ha, const char * szFileName, LCID lcLocale);
+
+//-----------------------------------------------------------------------------
+// Compression and decompression functions
+
+int Compress_pklib  (char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int * pCmpType, int nCmpLevel);
+int Decompress_pklib(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength);
+
+//-----------------------------------------------------------------------------
+// Checking functions
+
+BOOL IsValidMpqHandle(TMPQArchive * ha);
+BOOL IsValidFileHandle(TMPQFile * hf);
+
+//-----------------------------------------------------------------------------
+// Other functions
+
+BOOL SFileOpenArchiveEx(const char * szMpqName, DWORD dwPriority, DWORD dwFlags, HANDLE * phMPQ, DWORD dwAccessMode = GENERIC_READ);
+int  AddFileToArchive(TMPQArchive * ha, HANDLE hFile, const char * szArchivedName, DWORD dwFlags, DWORD dwQuality, int nFileType, BOOL * pbReplaced);
+int  SetDataCompression(int nDataCompression);
+int  SaveMPQTables(TMPQArchive * ha);
+void FreeMPQArchive(TMPQArchive *& ha);
+
+BOOL CheckWildCard(const char * szString, const char * szWildCard);
+
+//-----------------------------------------------------------------------------
+// Listfile functions
+
+int  SListFileCreateListFile(TMPQArchive * ha);
+int  SListFileAddNode(TMPQArchive * ha, const char * szAddedFile);
+int  SListFileRemoveNode(TMPQArchive * ha, const char * szFileName);
+int  SListFileRenameNode(TMPQArchive * ha, const char * szOldFileName, const char * szNewFileName);
+int  SListFileFreeListFile(TMPQArchive * ha);
+
+int  SListFileSaveToMpq(TMPQArchive * ha);
+
+#endif // __SCOMMON_H__
+
diff --git a/contrib/vmap_extractor_v2/stormlib/SCompression.cpp b/contrib/vmap_extractor_v2/stormlib/SCompression.cpp
new file mode 100644
index 00000000000..612ef2cc262
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SCompression.cpp
@@ -0,0 +1,715 @@
+/*****************************************************************************/
+/* SCompression.cpp                       Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* This module serves as a bridge between StormLib code and (de)compression  */
+/* functions. All (de)compression calls go (and should only go) through this */   
+/* module. No system headers should be included in this module to prevent    */
+/* compile-time problems.                                                    */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 01.04.03  1.00  Lad  The first version of SCompression.cpp                */
+/* 19.11.03  1.01  Dan  Big endian handling                                  */
+/*****************************************************************************/
+
+#define __STORMLIB_SELF__
+#include "StormLib.h"
+#include "SCommon.h"
+
+#include <string.h>
+
+// Include functions from Pkware Data Compression Library
+#include "pklib/pklib.h"              
+
+// Include functions from zlib
+#ifndef __SYS_ZLIB
+#include "zlib/zlib.h"      // Include functions from zlib
+#else
+#include <zlib.h>           // If zlib is available on system, use this instead
+#endif
+
+// Include functions from Huffmann compression
+#include "huffman/huff.h"  
+
+// Include functions from WAVe compression
+#include "wave/wave.h"  
+
+// Include functions from BZip2 compression library
+#ifndef __SYS_BZLIB
+#include "bzip2/bzlib.h"      // Include functions from bzlib
+#else
+#include <bzlib.h>           // If bzlib is available on system, use this instead
+#endif
+
+//-----------------------------------------------------------------------------
+// Local structures
+
+// Information about the input and output buffers for pklib
+typedef struct
+{
+    char * pInBuff;                     // Pointer to input data buffer
+    int    nInPos;                      // Current offset in input data buffer
+    int    nInBytes;                    // Number of bytes in the input buffer
+    char * pOutBuff;                    // Pointer to output data buffer
+    int    nOutPos;                     // Position in the output buffer
+    int    nMaxOut;                     // Maximum number of bytes in the output buffer
+} TDataInfo;
+
+// Table of compression functions
+typedef int (*COMPRESS)(char *, int *, char *, int, int *, int);
+typedef struct  
+{
+    unsigned long dwMask;               // Compression mask
+    COMPRESS Compress;                  // Compression function
+} TCompressTable;
+
+// Table of decompression functions
+typedef int (*DECOMPRESS)(char *, int *, char *, int);
+typedef struct
+{
+    unsigned long dwMask;               // Decompression bit
+    DECOMPRESS    Decompress;           // Decompression function
+} TDecompressTable;
+
+
+/*****************************************************************************/
+/*                                                                           */
+/*  Support functions for Pkware Data Compression Library                    */
+/*                                                                           */
+/*****************************************************************************/
+
+// Function loads data from the input buffer. Used by Pklib's "implode"
+// and "explode" function as user-defined callback
+// Returns number of bytes loaded
+//    
+//   char * buf          - Pointer to a buffer where to store loaded data
+//   unsigned int * size - Max. number of bytes to read
+//   void * param        - Custom pointer, parameter of implode/explode
+
+static unsigned int ReadInputData(char * buf, unsigned int * size, void * param)
+{
+    TDataInfo * pInfo = (TDataInfo *)param;
+    unsigned int nMaxAvail = (pInfo->nInBytes - pInfo->nInPos);
+    unsigned int nToRead = *size;
+
+    // Check the case when not enough data available
+    if(nToRead > nMaxAvail)
+        nToRead = nMaxAvail;
+    
+    // Load data and increment offsets
+    memcpy(buf, pInfo->pInBuff + pInfo->nInPos, nToRead);
+    pInfo->nInPos += nToRead;
+
+    return nToRead;
+}
+
+// Function for store output data. Used by Pklib's "implode" and "explode"
+// as user-defined callback
+//    
+//   char * buf          - Pointer to data to be written
+//   unsigned int * size - Number of bytes to write
+//   void * param        - Custom pointer, parameter of implode/explode
+
+static void WriteOutputData(char * buf, unsigned int * size, void * param)
+{
+    TDataInfo * pInfo = (TDataInfo *)param;
+    unsigned int nMaxWrite = (pInfo->nMaxOut - pInfo->nOutPos);
+    unsigned int nToWrite = *size;
+
+    // Check the case when not enough space in the output buffer
+    if(nToWrite > nMaxWrite)
+        nToWrite = nMaxWrite;
+
+    // Write output data and increments offsets
+    memcpy(pInfo->pOutBuff + pInfo->nOutPos, buf, nToWrite);
+    pInfo->nOutPos += nToWrite;
+}
+
+/*****************************************************************************/
+/*                                                                           */
+/*  "80" is IMA ADPCM stereo (de)compression                                 */
+/*  "40" is IMA ADPCM mono (de)compression                                   */
+/*                                                                           */
+/*****************************************************************************/
+
+int Compress_wave_mono(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int * pCmpType, int nCmpLevel)
+{
+    // Prepare the compression level for the next compression
+    // (After us, the Huffmann compression will be called)
+    if(0 < nCmpLevel && nCmpLevel <= 2)
+    {
+        nCmpLevel = 4;
+        *pCmpType = 6;
+    }
+    else if(nCmpLevel == 3)
+    {
+        nCmpLevel = 6;
+        *pCmpType = 8;
+    }
+    else
+    {
+        nCmpLevel = 5;
+        *pCmpType = 7;
+    }
+    *pdwOutLength = CompressWave((unsigned char *)pbOutBuffer, *pdwOutLength, (short *)pbInBuffer, dwInLength, 1, nCmpLevel);
+    return 0;
+}
+
+int Decompress_wave_mono(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength)
+{
+    *pdwOutLength = DecompressWave((unsigned char *)pbOutBuffer, *pdwOutLength, (unsigned char *)pbInBuffer, dwInLength, 1);
+    return 1;
+}
+
+int Compress_wave_stereo(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int * pCmpType, int nCmpLevel)
+{
+    // Prepare the compression type for the next compression
+    // (After us, the Huffmann compression will be called)
+    if(0 < nCmpLevel && nCmpLevel <= 2)
+    {
+        nCmpLevel = 4;
+        *pCmpType = 6;
+    }
+    else if(nCmpLevel == 3)
+    {
+        nCmpLevel = 6;
+        *pCmpType = 8;
+    }
+    else
+    {
+        nCmpLevel = 5;
+        *pCmpType = 7;
+    }
+    *pdwOutLength = CompressWave((unsigned char *)pbOutBuffer, *pdwOutLength, (short *)pbInBuffer, dwInLength, 2, nCmpLevel);
+    return 0;
+}
+
+int Decompress_wave_stereo(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength)
+{
+    *pdwOutLength = DecompressWave((unsigned char *)pbOutBuffer, *pdwOutLength, (unsigned char *)pbInBuffer, dwInLength, 2);
+    return 1;
+}
+
+/*****************************************************************************/
+/*                                                                           */
+/*  The "01" (de)compression is the Huffman (de)compression                  */
+/*                                                                           */
+/*****************************************************************************/
+
+// 1500F4C0
+int Compress_huff(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int * pCmpType, int /* nCmpLevel */)
+{
+    THuffmannTree ht;                   // Huffmann tree for compression
+    TOutputStream os;                   // Output stream
+
+    // Initialize output stream
+    os.pbOutBuffer = (unsigned char *)pbOutBuffer;
+    os.dwOutSize   = *pdwOutLength;
+    os.pbOutPos    = (unsigned char *)pbOutBuffer;
+    os.dwBitBuff   = 0;
+    os.nBits       = 0;
+
+    // Initialize the Huffmann tree for compression
+    ht.InitTree(true);
+
+    *pdwOutLength = ht.DoCompression(&os, (unsigned char *)pbInBuffer, dwInLength, *pCmpType);
+
+    // The following code is not necessary to run, because it has no
+    // effect on the output data. It only clears the huffmann tree, but when
+    // the tree is on the stack, who cares ?
+//  ht.UninitTree();
+    return 0;
+}
+
+// 1500F5F0
+int Decompress_huff(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int /* dwInLength */)
+{
+    THuffmannTree ht;
+    TInputStream  is;
+
+    // Initialize input stream
+//  is.pbInBuffer  = (unsigned char *)pbInBuffer;
+    is.dwBitBuff   = BSWAP_INT32_UNSIGNED(*(unsigned long *)pbInBuffer);
+    pbInBuffer    += sizeof(unsigned long);
+    is.pbInBuffer  = (unsigned char *)pbInBuffer;
+    is.nBits       = 32;
+
+    // Initialize the Huffmann tree for compression
+    ht.InitTree(false);
+    *pdwOutLength = ht.DoDecompression((unsigned char *)pbOutBuffer, *pdwOutLength, &is);
+
+    // The following code is not necessary to run, because it has no
+    // effect on the output data. It only clears the huffmann tree, but when
+    // the tree is on the stack, who cares ?
+//  ht.UninitTree();
+    return 0;
+}
+
+/*****************************************************************************/
+/*                                                                           */
+/*  The "02" (de)compression is the ZLIB (de)compression                     */
+/*                                                                           */
+/*****************************************************************************/
+
+int Compress_zlib(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int * /* pCmpType */, int /* nCmpLevel */)
+{
+    z_stream z;                        // Stream information for zlib
+    int nResult;
+
+    // Fill the stream structure for zlib
+    z.next_in   = (Bytef *)pbInBuffer;
+    z.avail_in  = (uInt)dwInLength;
+    z.total_in  = dwInLength;
+    z.next_out  = (Bytef *)pbOutBuffer;
+    z.avail_out = *pdwOutLength;
+    z.total_out = 0;
+    z.zalloc    = NULL;
+    z.zfree     = NULL;
+
+    // Initialize the compression structure. Storm.dll uses zlib version 1.1.3
+    *pdwOutLength = 0;
+    if((nResult = deflateInit(&z, Z_DEFAULT_COMPRESSION)) == 0)
+    {
+        // Call zlib to compress the data
+        nResult = deflate(&z, Z_FINISH);
+        
+        if(nResult == Z_OK || nResult == Z_STREAM_END)
+            *pdwOutLength = z.total_out;
+
+        deflateEnd(&z);
+    }
+    return nResult;
+}
+
+int Decompress_zlib(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength)
+{
+    z_stream z;                        // Stream information for zlib
+    int nResult;
+
+    // Fill the stream structure for zlib
+    z.next_in   = (Bytef *)pbInBuffer;
+    z.avail_in  = (uInt)dwInLength;
+    z.total_in  = dwInLength;
+    z.next_out  = (Bytef *)pbOutBuffer;
+    z.avail_out = *pdwOutLength;
+    z.total_out = 0;
+    z.zalloc    = NULL;
+    z.zfree     = NULL;
+
+    // Initialize the decompression structure. Storm.dll uses zlib version 1.1.3
+    if((nResult = inflateInit(&z)) == 0)
+    {
+        // Call zlib to decompress the data
+        nResult = inflate(&z, Z_FINISH);
+        *pdwOutLength = z.total_out;
+        inflateEnd(&z);
+    }
+    return nResult;
+}
+
+/*****************************************************************************/
+/*                                                                           */
+/*  The "08" (de)compression is the Pkware DCL (de)compression               */
+/*                                                                           */
+/*****************************************************************************/
+
+int Compress_pklib(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int * pCmpType, int /* nCmpLevel */)
+{
+    TDataInfo Info;                             // Data information
+    char * work_buf = ALLOCMEM(char, CMP_BUFFER_SIZE);// Pklib's work buffer
+    unsigned int dict_size;                     // Dictionary size
+    unsigned int ctype;                         // Compression type
+
+    // Fill data information structure
+    Info.pInBuff  = pbInBuffer;
+    Info.nInPos   = 0;
+    Info.nInBytes = dwInLength;
+    Info.pOutBuff = pbOutBuffer;
+    Info.nOutPos  = 0;
+    Info.nMaxOut  = *pdwOutLength;
+
+    // Set the compression type and dictionary size
+    ctype = (*pCmpType == 2) ? CMP_ASCII : CMP_BINARY;
+    if (dwInLength < 0x600)
+        dict_size = 0x400;
+    else if(0x600 <= dwInLength && dwInLength < 0xC00)
+        dict_size = 0x800;
+    else
+        dict_size = 0x1000;
+
+    // Do the compression
+    implode(ReadInputData, WriteOutputData, work_buf, &Info, &ctype, &dict_size);
+    *pdwOutLength = Info.nOutPos;
+    FREEMEM(work_buf);
+    return 0;
+}
+
+int Decompress_pklib(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength)
+{
+    TDataInfo Info;                             // Data information
+    char * work_buf = ALLOCMEM(char, EXP_BUFFER_SIZE);// Pklib's work buffer
+
+    // Fill data information structure
+    Info.pInBuff  = pbInBuffer;
+    Info.nInPos   = 0;
+    Info.nInBytes = dwInLength;
+    Info.pOutBuff = pbOutBuffer;
+    Info.nOutPos  = 0;
+    Info.nMaxOut  = *pdwOutLength;
+
+    // Do the decompression
+    explode(ReadInputData, WriteOutputData, work_buf, &Info);
+    
+    // Fix: If PKLIB is unable to decompress the data, they are uncompressed
+    if(Info.nOutPos == 0)
+    {
+        Info.nOutPos = min(*pdwOutLength, dwInLength);
+        memcpy(pbOutBuffer, pbInBuffer, Info.nOutPos);
+    }
+
+    *pdwOutLength = Info.nOutPos;
+    FREEMEM(work_buf);
+    return 0;
+}
+
+/*****************************************************************************/
+/*                                                                           */
+/*  The "10" (de)compression is the Bzip2 (de)compression                    */
+/*                                                                           */
+/*****************************************************************************/
+
+int Compress_bzip2(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int * pCmpType, int nCmpLevel)
+{
+    bz_stream strm;
+    int blockSize100k;
+    int workFactor = 30;
+
+    // Keep compiler happy
+    nCmpLevel = nCmpLevel;
+
+    // Initialize the BZLIB compression
+    strm.bzalloc = NULL;
+    strm.bzfree  = NULL;
+
+    // Adjust the block size
+    blockSize100k = *pCmpType;
+    if(blockSize100k < 1 || blockSize100k > 9)
+        blockSize100k = 9;
+
+    // Blizzard uses 9 as blockSize100k, (0 as workFactor)
+    if(BZ2_bzCompressInit(&strm, blockSize100k, 0, workFactor) == 0)
+    {
+        strm.next_in   = pbInBuffer;
+        strm.avail_in  = dwInLength;
+        strm.next_out  = pbOutBuffer;
+        strm.avail_out = *pdwOutLength;
+
+        // Perform the compression
+        while(BZ2_bzCompress(&strm, (strm.avail_in != 0) ? BZ_RUN : BZ_FINISH) != BZ_STREAM_END);
+
+        // Put the stream into idle state
+        BZ2_bzCompressEnd(&strm);
+        *pdwOutLength = strm.total_out_lo32;
+    }
+    else
+    {
+        *pdwOutLength = 0;
+    }
+
+    return 0;
+}
+
+int Decompress_bzip2(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength)
+{
+    bz_stream strm;
+
+    // Initialize the BZLIB decompression
+    strm.bzalloc = NULL;
+    strm.bzfree  = NULL;
+    if(BZ2_bzDecompressInit(&strm, 0, 0) == 0)
+    {
+        strm.next_in   = pbInBuffer;
+        strm.avail_in  = dwInLength;
+        strm.next_out  = pbOutBuffer;
+        strm.avail_out = *pdwOutLength;
+
+        // Perform the decompression
+        while(BZ2_bzDecompress(&strm) != BZ_STREAM_END);
+
+        // Put the stream into idle state
+        BZ2_bzDecompressEnd(&strm);
+        *pdwOutLength = strm.total_out_lo32;
+    }
+    else
+    {
+        // Set zero output length
+        *pdwOutLength = 0;
+    }
+
+    return 0;
+}
+
+/*****************************************************************************/
+/*                                                                           */
+/*   SCompCompress                                                           */
+/*                                                                           */
+/*****************************************************************************/
+
+// This table contains compress functions which can be applied to
+// uncompressed blocks. Each bit set means the corresponding
+// compression method/function must be applied.
+//
+//   WAVes compression            Data compression
+//   ------------------           -------------------
+//   1st block   - 0x08           0x08 (D, HF, W2, SC, D2)
+//   Rest blocks - 0x81           0x02 (W3)
+
+static TCompressTable cmp_table[] =
+{
+    {MPQ_COMPRESSION_WAVE_MONO,   Compress_wave_mono},   // IMA ADPCM mono compression
+    {MPQ_COMPRESSION_WAVE_STEREO, Compress_wave_stereo}, // IMA ADPCM stereo compression
+    {MPQ_COMPRESSION_HUFFMANN,    Compress_huff},        // Huffmann compression
+    {MPQ_COMPRESSION_ZLIB,        Compress_zlib},        // Compression with the "zlib" library
+    {MPQ_COMPRESSION_PKWARE,      Compress_pklib},       // Compression with Pkware DCL
+    {MPQ_COMPRESSION_BZIP2,       Compress_bzip2}        // Compression Bzip2 library
+};
+
+int WINAPI SCompCompress(char * pbCompressed, int * pdwOutLength, char * pbUncompressed, int dwInLength,
+                  int uCompressions, int nCmpType, int nCmpLevel)
+{
+    char * pbTempBuff = NULL;           // Temporary storage for decompressed data
+    char * pbOutput = pbCompressed;     // Current output buffer
+    char * pbInput;                     // Current input buffer
+    int uCompressions2;
+    int dwCompressCount = 0;
+    int dwDoneCount = 0;
+    int dwOutSize = 0;
+    int dwInSize  = dwInLength;
+    int dwEntries = (sizeof(cmp_table) / sizeof(TCompressTable));
+    int nResult = 1;
+    int i;       
+
+    // Check for valid parameters
+    if(!pdwOutLength || *pdwOutLength < dwInLength || !pbCompressed || !pbUncompressed)
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return 0;
+    }
+
+    // Count the compressions
+    for(i = 0, uCompressions2 = uCompressions; i < dwEntries; i++)
+    {
+        if(uCompressions & cmp_table[i].dwMask)
+            dwCompressCount++;
+
+        uCompressions2 &= ~cmp_table[i].dwMask;
+    }
+
+    // If a compression remains, do nothing
+    if(uCompressions2 != 0)
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return 0;
+    }
+
+    // If more that one compression, allocate intermediate buffer
+    if(dwCompressCount >= 2)
+        pbTempBuff = ALLOCMEM(char, *pdwOutLength + 1);
+
+    // Perform the compressions
+    pbInput = pbUncompressed;
+    dwInSize = dwInLength;
+    for(i = 0, uCompressions2 = uCompressions; i < dwEntries; i++)
+    {
+        if(uCompressions2 & cmp_table[i].dwMask)
+        {
+            // Set the right output buffer 
+            dwCompressCount--;
+            pbOutput = (dwCompressCount & 1) ? pbTempBuff : pbCompressed;
+
+            // Perform the partial compression
+            dwOutSize = *pdwOutLength - 1;
+
+            cmp_table[i].Compress(pbOutput + 1, &dwOutSize, pbInput, dwInSize, &nCmpType, nCmpLevel);
+            if(dwOutSize == 0)
+            {
+                SetLastError(ERROR_GEN_FAILURE);
+                *pdwOutLength = 0;
+                nResult = 0;
+                break;
+            }
+
+            // If the compression failed, copy the block instead
+            if(dwOutSize >= dwInSize - 1)
+            {
+                if(dwDoneCount > 0)
+                    pbOutput++;
+
+                memcpy(pbOutput, pbInput, dwInSize);
+                pbInput = pbOutput;
+                uCompressions &= ~cmp_table[i].dwMask;
+                dwOutSize = dwInSize;
+            }
+            else
+            {
+                pbInput = pbOutput + 1;
+                dwInSize = dwOutSize;
+                dwDoneCount++;
+            }
+        }
+    }
+
+    // Copy the compressed data to the correct output buffer
+    if(nResult != 0)
+    {
+        if(uCompressions && (dwInSize + 1) < *pdwOutLength)
+        {
+            if(pbOutput != pbCompressed  && pbOutput != pbCompressed + 1)
+                memcpy(pbCompressed, pbOutput, dwInSize);
+            *pbCompressed = (char)uCompressions;
+            *pdwOutLength = dwInSize + 1;
+        }
+        else
+        {
+            memmove(pbCompressed, pbUncompressed, dwInSize);
+            *pdwOutLength = dwInSize;
+        }
+    }
+
+    // Cleanup and return
+    if(pbTempBuff != NULL)
+        FREEMEM(pbTempBuff);
+    return nResult;
+}
+
+/*****************************************************************************/
+/*                                                                           */
+/*   SCompDecompress                                                         */
+/*                                                                           */
+/*****************************************************************************/
+
+// This table contains decompress functions which can be applied to
+// uncompressed blocks. The compression mask is stored in the first byte
+// of compressed block
+static TDecompressTable dcmp_table[] =
+{
+    {MPQ_COMPRESSION_BZIP2,       Decompress_bzip2},       // Decompression with Bzip2 library
+    {MPQ_COMPRESSION_PKWARE,      Decompress_pklib},       // Decompression with Pkware Data Compression Library
+    {MPQ_COMPRESSION_ZLIB,        Decompress_zlib},        // Decompression with the "zlib" library
+    {MPQ_COMPRESSION_HUFFMANN,    Decompress_huff},        // Huffmann decompression
+    {MPQ_COMPRESSION_WAVE_STEREO, Decompress_wave_stereo}, // IMA ADPCM stereo decompression
+    {MPQ_COMPRESSION_WAVE_MONO,   Decompress_wave_mono}    // IMA ADPCM mono decompression
+};
+
+int WINAPI SCompDecompress(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength)
+{
+    char *   pbTempBuff = NULL;           // Temporary storage for decompressed data
+    char *   pbWorkBuff = NULL;           // Where to store decompressed data
+    int      dwOutLength = *pdwOutLength; // For storage number of output bytes
+    unsigned fDecompressions1;            // Decompressions applied to the block
+    unsigned fDecompressions2;            // Just another copy of decompressions applied to the block
+    int      dwCount = 0;                 // Counter for every use
+    int      dwEntries = (sizeof(dcmp_table) / sizeof(TDecompressTable));
+    int      nResult = 1;
+    int      i;       
+
+    // If the input length is the same as output, do nothing.
+    if(dwInLength == dwOutLength)
+    {
+        if(pbInBuffer == pbOutBuffer)
+            return 1;
+
+        memcpy(pbOutBuffer, pbInBuffer, dwInLength);
+        *pdwOutLength = dwInLength;
+        return 1;
+    }
+    
+    // Get applied compression types and decrement data length
+    fDecompressions1 = fDecompressions2 = (unsigned char)*pbInBuffer++;              
+    dwInLength--;
+    
+    // Search decompression table type and get all types of compression
+    for(i = 0; i < dwEntries; i++)
+    {
+        // We have to apply this decompression ?
+        if(fDecompressions1 & dcmp_table[i].dwMask)
+            dwCount++;
+
+        // Clear this flag from temporary variable.
+        fDecompressions2 &= ~dcmp_table[i].dwMask;
+    }
+
+    // Check if there is some method unhandled
+    // (E.g. compressed by future versions)
+    if(fDecompressions2 != 0)
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return 0;
+    }
+
+    // If there is more than only one compression, we have to allocate extra buffer
+    if(dwCount >= 2)
+        pbTempBuff = ALLOCMEM(char, dwOutLength);
+
+    // Apply all decompressions
+    for(i = 0, dwCount = 0; i < dwEntries; i++)
+    {
+        // If not used this kind of compression, skip the loop
+        if(fDecompressions1 & dcmp_table[i].dwMask)
+        {
+            // If odd case, use target buffer for output, otherwise use allocated tempbuffer
+            pbWorkBuff  = (dwCount++ & 1) ? pbTempBuff : pbOutBuffer;
+            dwOutLength = *pdwOutLength;
+
+            // Decompress buffer using corresponding function
+            dcmp_table[i].Decompress(pbWorkBuff, &dwOutLength, pbInBuffer, dwInLength);
+            if(dwOutLength == 0)
+            {
+                SetLastError(ERROR_GEN_FAILURE);
+                nResult = 0;
+                break;
+            }
+
+            // Move output length to src length for next compression
+            dwInLength = dwOutLength;
+            pbInBuffer = pbWorkBuff;
+        }
+    }
+
+    // If output buffer is not the same like target buffer, we have to copy data
+    if(nResult != 0)
+    {
+        if(pbWorkBuff != pbOutBuffer)
+            memcpy(pbOutBuffer, pbInBuffer, dwOutLength);
+        
+    }
+
+    // Delete temporary buffer, if necessary
+    if(pbTempBuff != NULL)
+        FREEMEM(pbTempBuff);
+    
+    *pdwOutLength = dwOutLength;
+    return nResult;
+}
+
+/*****************************************************************************/
+/*                                                                           */
+/*   SCompSetDataCompression                                                 */
+/*                                                                           */
+/*****************************************************************************/
+
+int WINAPI SCompSetDataCompression(int nDataCompression)
+{
+    int nValidMask = (MPQ_COMPRESSION_ZLIB | MPQ_COMPRESSION_PKWARE | MPQ_COMPRESSION_BZIP2);
+
+    if((nDataCompression & nValidMask) != nDataCompression)
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return FALSE;
+    }
+
+    SetDataCompression(nDataCompression);
+    return TRUE;
+}
+
+
diff --git a/contrib/vmap_extractor_v2/stormlib/SFileCompactArchive.cpp b/contrib/vmap_extractor_v2/stormlib/SFileCompactArchive.cpp
new file mode 100644
index 00000000000..9510b15ae1f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SFileCompactArchive.cpp
@@ -0,0 +1,691 @@
+/*****************************************************************************/
+/* SFileCompactArchive.cpp                Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Archive compacting function                                               */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 14.04.03  1.00  Lad  Splitted from SFileCreateArchiveEx.cpp               */
+/* 19.11.03  1.01  Dan  Big endian handling                                  */
+/*****************************************************************************/
+
+#define __STORMLIB_SELF__
+#include "StormLib.h"
+#include "SCommon.h"
+
+/*****************************************************************************/
+/* Local structures                                                          */
+/*****************************************************************************/
+
+/*****************************************************************************/
+/* Local variables                                                           */
+/*****************************************************************************/
+
+static COMPACTCB CompactCB  = NULL;
+static void    * lpUserData = NULL;
+
+/*****************************************************************************/
+/* Local functions                                                           */
+/*****************************************************************************/
+
+// Creates a copy of hash table
+static TMPQHash * CopyHashTable(TMPQArchive * ha)
+{
+    TMPQHash * pHashTableCopy = ALLOCMEM(TMPQHash, ha->pHeader->dwHashTableSize);
+
+    if(pHashTableCopy != NULL)
+        memcpy(pHashTableCopy, ha->pHashTable, sizeof(TMPQHash) * ha->pHeader->dwHashTableSize);
+
+    return pHashTableCopy;
+}
+
+// TODO: Test for archives > 4GB
+static int CheckIfAllFilesKnown(TMPQArchive * ha, const char * szListFile, DWORD * pFileSeeds)
+{
+    TMPQHash * pHashTableCopy = NULL;   // Copy of the hash table
+    TMPQHash * pHash;
+    TMPQHash * pHashEnd = NULL;         // End of the hash table
+    DWORD dwFileCount = 0;
+    int nError = ERROR_SUCCESS;
+
+    // First of all, create a copy of hash table
+    if(nError == ERROR_SUCCESS)
+    {
+        if((pHashTableCopy = CopyHashTable(ha)) == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+        pHashEnd = pHashTableCopy + ha->pHeader->dwHashTableSize;
+
+        // Notify the user
+        if(CompactCB != NULL)
+            CompactCB(lpUserData, CCB_CHECKING_FILES, 0, ha->pHeader->dwBlockTableSize);
+    }
+
+    // Now check all the files from the filelist
+    if(nError == ERROR_SUCCESS)
+    {
+        SFILE_FIND_DATA wf;
+        HANDLE hFind = SFileFindFirstFile((HANDLE)ha, "*", &wf, szListFile);
+        BOOL bResult = TRUE;
+
+        // Do while some files have been found
+        while(hFind != NULL && bResult)
+        {
+            TMPQHash * pHash = GetHashEntry(ha, wf.cFileName);
+
+            // If the hash table entry has been found, find it's position
+            // in the hash table copy
+            if(pHash != NULL)
+            {
+                pHash = pHashTableCopy + (pHash - ha->pHashTable);
+                if(pHash->dwName1 != (DWORD)-1 && pHash->dwName2 != (DWORD)-1)
+                {
+                    TMPQBlock * pBlock = ha->pBlockTable + pHash->dwBlockIndex;
+                    DWORD dwSeed = 0;
+
+                    // Resolve the file seed. Use plain file name for it
+                    if(pBlock->dwFlags & MPQ_FILE_ENCRYPTED)
+                    {
+                        char * szFileName = strrchr(wf.cFileName, '\\');
+
+                        if(szFileName == NULL)
+                            szFileName = wf.cFileName;
+                        else
+                            szFileName++;
+
+                        dwSeed = DecryptFileSeed(szFileName);
+                        if(pBlock->dwFlags & MPQ_FILE_FIXSEED)
+                            dwSeed = (dwSeed + pBlock->dwFilePos) ^ pBlock->dwFSize;
+                    }
+                    pFileSeeds[pHash->dwBlockIndex] = dwSeed;
+
+                    pHash->dwName1      = 0xFFFFFFFF;
+                    pHash->dwName2      = 0xFFFFFFFF;
+                    pHash->lcLocale     = 0xFFFF;
+                    pHash->wPlatform    = 0xFFFF;
+                    pHash->dwBlockIndex = 0xFFFFFFFF;
+                }
+            }
+            // Notify the user
+            if(CompactCB != NULL)
+                CompactCB(lpUserData, CCB_CHECKING_FILES, ++dwFileCount, ha->pHeader->dwBlockTableSize);
+
+            // Find the next file in the archive
+            bResult = SFileFindNextFile(hFind, &wf);
+        }
+
+        if(hFind != NULL)
+            SFileFindClose(hFind);
+    }
+
+    // When the filelist checking is complete, parse the hash table copy and find the
+    if(nError == ERROR_SUCCESS)
+    {
+        // Notify the user about checking hash table
+        dwFileCount = 0;
+        if(CompactCB != NULL)
+            CompactCB(lpUserData, CCB_CHECKING_HASH_TABLE, dwFileCount, ha->pHeader->dwBlockTableSize);
+
+        for(pHash = pHashTableCopy; pHash < pHashEnd; pHash++)
+        {
+            // If there is an unresolved entry, try to detect its seed. If it fails,
+            // we cannot complete the work
+            if(pHash->dwName1 != (DWORD)-1 && pHash->dwName2 != (DWORD)-1)
+            {
+                HANDLE hFile  = NULL;
+                DWORD dwFlags = 0;
+                DWORD dwSeed  = 0;
+
+                if(SFileOpenFileEx((HANDLE)ha, (char *)(DWORD_PTR)pHash->dwBlockIndex, 0, &hFile))
+                {
+                    TMPQFile * hf = (TMPQFile *)hFile;
+                    dwFlags = hf->pBlock->dwFlags;
+                    dwSeed = hf->dwSeed1;
+                    SFileCloseFile(hFile);
+                }
+
+                // If the file is encrypted, we have to check 
+                // If we can apply the file decryption seed
+                if(dwFlags & MPQ_FILE_ENCRYPTED && dwSeed == 0)
+                {
+                    nError = ERROR_CAN_NOT_COMPLETE;
+                    break;
+                }
+
+                // Remember the seed
+                pFileSeeds[pHash->dwBlockIndex] = dwSeed;
+
+                // Notify the user
+                if(CompactCB != NULL)
+                    CompactCB(lpUserData, CCB_CHECKING_HASH_TABLE, ++dwFileCount, ha->pHeader->dwBlockTableSize);
+            }
+        }
+    }
+
+    // Delete the copy of hash table
+    if(pHashTableCopy != NULL)
+        FREEMEM(pHashTableCopy);
+    return nError;
+}
+
+// Copies all file blocks into another archive.
+// TODO: Test for archives > 4GB
+static int CopyMpqFileBlocks(
+    HANDLE hFile,
+    TMPQArchive * ha,
+    TMPQBlockEx * pBlockEx,
+    TMPQBlock * pBlock,
+    DWORD dwSeed)
+{
+    LARGE_INTEGER FilePos = {0};
+    DWORD * pdwBlockPos2 = NULL;        // File block positions to be written to target file
+    DWORD * pdwBlockPos = NULL;         // File block positions (unencrypted)
+    BYTE  * pbBlock = NULL;             // Buffer for the file block
+    DWORD dwTransferred;                // Number of bytes transferred
+    DWORD dwCSize = 0;                  // Compressed file size
+    DWORD dwBytes = 0;                  // Number of bytes
+    DWORD dwSeed1 = 0;                  // File seed used for decryption
+    DWORD dwSeed2 = 0;                  // File seed used for encryption
+    DWORD nBlocks = 0;                  // Number of file blocks
+    DWORD nBlock = 0;                   // Currently processed file block
+    int nError = ERROR_SUCCESS;
+
+    // When file length is zero, do nothing
+    if(pBlock->dwFSize == 0)
+        return ERROR_SUCCESS;
+
+    // Calculate number of blocks in the file
+    if(nError == ERROR_SUCCESS)
+    {
+        nBlocks = pBlock->dwFSize / ha->dwBlockSize;
+        if(pBlock->dwFSize % ha->dwBlockSize)
+            nBlocks++;
+        pbBlock = ALLOCMEM(BYTE, ha->dwBlockSize);
+        if(pbBlock == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+    }
+
+    // Set the position to the begin of the file within archive
+    if(nError == ERROR_SUCCESS)
+    {
+        FilePos.HighPart = pBlockEx->wFilePosHigh;
+        FilePos.LowPart = pBlock->dwFilePos;
+        FilePos.QuadPart += ha->MpqPos.QuadPart;
+        if(SetFilePointer(ha->hFile, FilePos.LowPart, &FilePos.HighPart, FILE_BEGIN) != FilePos.LowPart)
+            nError = GetLastError();
+    }
+
+    // Remember the position in the destination file
+    if(nError == ERROR_SUCCESS)
+    {
+        FilePos.HighPart = 0;
+        FilePos.LowPart = SetFilePointer(hFile, 0, &FilePos.HighPart, FILE_CURRENT);
+    }
+
+    // Resolve decryption seeds. The 'dwSeed' parameter is the decryption
+    // seed for the file.
+    if(nError == ERROR_SUCCESS && (pBlock->dwFlags & MPQ_FILE_ENCRYPTED))
+    {
+        dwSeed1 = dwSeed;
+        if(pBlock->dwFlags & MPQ_FILE_FIXSEED)
+            dwSeed = (dwSeed1 ^ pBlock->dwFSize) - pBlock->dwFilePos;
+
+        dwSeed2 = dwSeed;
+        if(pBlock->dwFlags & MPQ_FILE_FIXSEED)
+            dwSeed2 = (dwSeed + (DWORD)(FilePos.QuadPart - ha->MpqPos.QuadPart)) ^ pBlock->dwFSize;
+    }
+
+    // Load the file positions from the archive and save it to the target file
+    // (only if the file is compressed)
+    if(pBlock->dwFlags & MPQ_FILE_COMPRESSED)
+    {
+        // Allocate buffers
+        if(nError == ERROR_SUCCESS)
+        {
+            pdwBlockPos = ALLOCMEM(DWORD, nBlocks + 2);
+            pdwBlockPos2 = ALLOCMEM(DWORD, nBlocks + 2);
+
+            if(pdwBlockPos == NULL || pdwBlockPos2 == NULL)
+                nError = ERROR_NOT_ENOUGH_MEMORY;
+        }
+
+        // Load the block positions
+        if(nError == ERROR_SUCCESS)
+        {
+            dwBytes = (nBlocks + 1) * sizeof(DWORD);
+            if(pBlock->dwFlags & MPQ_FILE_HAS_EXTRA)
+                dwBytes += sizeof(DWORD);
+
+            ReadFile(ha->hFile, pdwBlockPos, dwBytes, &dwTransferred, NULL);
+            if(dwTransferred != dwBytes)
+                nError = ERROR_FILE_CORRUPT;
+        }
+
+        // Re-encrypt the block table positions
+        if(nError == ERROR_SUCCESS)
+        {
+            BSWAP_ARRAY32_UNSIGNED(pdwBlockPos, dwBytes / sizeof(DWORD));
+            if(pBlock->dwFlags & MPQ_FILE_ENCRYPTED)
+            {
+                DecryptMPQBlock(pdwBlockPos, dwBytes, dwSeed1 - 1);
+                if(pdwBlockPos[0] != dwBytes)
+                    nError = ERROR_FILE_CORRUPT;
+            
+                memcpy(pdwBlockPos2, pdwBlockPos, dwBytes);
+                EncryptMPQBlock(pdwBlockPos2, dwBytes, dwSeed2 - 1);
+            }
+            else
+            {
+                memcpy(pdwBlockPos2, pdwBlockPos, dwBytes);
+            }
+            BSWAP_ARRAY32_UNSIGNED(pdwBlockPos2, dwBytes / sizeof(DWORD));
+        }
+
+        // Write to the target file
+        if(nError == ERROR_SUCCESS)
+        {
+            WriteFile(hFile, pdwBlockPos2, dwBytes, &dwTransferred, NULL);
+            dwCSize += dwTransferred;
+            if(dwTransferred != dwBytes)
+                nError = ERROR_DISK_FULL;
+        }
+    }
+
+    // Now we have to copy all file block. We will do it without
+    // recompression, because re-compression is not necessary in this case
+    if(nError == ERROR_SUCCESS)
+    {
+        for(nBlock = 0; nBlock < nBlocks; nBlock++)
+        {
+            // Fix: The last block must not be exactly the size of one block.
+            dwBytes = ha->dwBlockSize;
+            if(nBlock == nBlocks - 1)
+            {
+                dwBytes = pBlock->dwFSize - (ha->dwBlockSize * (nBlocks - 1));
+            }
+
+            if(pBlock->dwFlags & MPQ_FILE_COMPRESSED)
+                dwBytes = pdwBlockPos[nBlock+1] - pdwBlockPos[nBlock];
+
+            // Read the file block
+            ReadFile(ha->hFile, pbBlock, dwBytes, &dwTransferred, NULL);
+            if(dwTransferred != dwBytes)
+            {
+                nError = ERROR_FILE_CORRUPT;
+                break;
+            }
+
+            // If necessary, re-encrypt the block
+            // Note: Recompression is not necessary here. Unlike encryption, 
+            // the compression does not depend on the position of the file in MPQ.
+            if((pBlock->dwFlags & MPQ_FILE_ENCRYPTED) && dwSeed1 != dwSeed2)
+            {
+                BSWAP_ARRAY32_UNSIGNED((DWORD *)pbBlock, dwBytes/sizeof(DWORD));
+                DecryptMPQBlock((DWORD *)pbBlock, dwBytes, dwSeed1 + nBlock);
+                EncryptMPQBlock((DWORD *)pbBlock, dwBytes, dwSeed2 + nBlock);
+                BSWAP_ARRAY32_UNSIGNED((DWORD *)pbBlock, dwBytes/sizeof(DWORD));
+            }
+
+            // Now write the block back to the file
+            WriteFile(hFile, pbBlock, dwBytes, &dwTransferred, NULL);
+            dwCSize += dwTransferred;
+            if(dwTransferred != dwBytes)
+            {
+                nError = ERROR_DISK_FULL;
+                break;
+            }
+        }
+    }
+
+    // Copy the file extras, if any
+    // These extras does not seem to be encrypted, and their purpose is unknown
+    if(nError == ERROR_SUCCESS && (pBlock->dwFlags & MPQ_FILE_HAS_EXTRA))
+    {
+        dwBytes = pdwBlockPos[nBlocks + 1] - pdwBlockPos[nBlocks];
+        if(dwBytes != 0)
+        {
+            ReadFile(ha->hFile, pbBlock, dwBytes, &dwTransferred, NULL);
+            if(dwTransferred == dwBytes)
+            {
+                WriteFile(hFile, pbBlock, dwBytes, &dwTransferred, NULL);
+                dwCSize += dwTransferred;
+                if(dwTransferred != dwBytes)
+                    nError = ERROR_DISK_FULL;
+            }
+            else
+            {
+                nError = ERROR_FILE_CORRUPT;
+            }
+        }
+    }
+
+    // Update file position in the block table
+    if(nError == ERROR_SUCCESS)
+    {
+        // At this point, number of bytes written should be exactly
+        // the same like the compressed file size. If it isn't, there's something wrong
+        // (maybe new archive version ?)
+        assert(dwCSize == pBlock->dwCSize);
+
+        // Update file pos in the block table
+        FilePos.QuadPart -= ha->MpqPos.QuadPart;
+        pBlockEx->wFilePosHigh = (USHORT)FilePos.HighPart;
+        pBlock->dwFilePos = FilePos.LowPart;
+    }
+
+    // Cleanup and return
+    if(pdwBlockPos2 != NULL)
+        FREEMEM(pdwBlockPos2);
+    if(pdwBlockPos != NULL)
+        FREEMEM(pdwBlockPos);
+    if(pbBlock != NULL)
+        FREEMEM(pbBlock);
+    return nError;
+}
+
+
+static int CopyNonMpqData(
+    HANDLE hSrcFile,
+    HANDLE hTrgFile,
+    LARGE_INTEGER & DataSizeToCopy)
+{
+    LARGE_INTEGER DataSize = DataSizeToCopy;
+    DWORD dwTransferred;
+    DWORD dwToRead;
+    char DataBuffer[0x1000];
+    int nError = ERROR_SUCCESS;
+
+    while(DataSize.QuadPart > 0)
+    {
+        // Get the proper size of data
+        dwToRead = sizeof(DataBuffer);
+        if(DataSize.HighPart == 0 && DataSize.LowPart < dwToRead)
+            dwToRead = DataSize.LowPart;
+
+        // Read the source file
+        ReadFile(hSrcFile, DataBuffer, dwToRead, &dwTransferred, NULL);
+        if(dwTransferred != dwToRead)
+        {
+            nError = ERROR_CAN_NOT_COMPLETE;
+            break;
+        }
+
+        // Write to the target file
+        WriteFile(hTrgFile, DataBuffer, dwToRead, &dwTransferred, NULL);
+        if(dwTransferred != dwToRead)
+        {
+            nError = ERROR_DISK_FULL;
+            break;
+        }
+
+        // Decrement the number of data to be copied
+        DataSize.QuadPart -= dwTransferred;
+    }
+
+    return ERROR_SUCCESS;
+}
+
+// TODO: Test for archives > 4GB
+static int CopyMpqFiles(HANDLE hFile, TMPQArchive * ha, DWORD * pFileSeeds)
+{
+    TMPQBlockEx * pBlockEx;
+    TMPQBlock * pBlock;
+    DWORD dwSeed1;
+    DWORD dwIndex;
+    int nError = ERROR_SUCCESS;
+
+    // Walk through all files and write them to the destination MPQ archive
+    for(dwIndex = 0; dwIndex < ha->pHeader->dwBlockTableSize; dwIndex++)
+    {
+        pBlockEx = ha->pExtBlockTable + dwIndex;
+        pBlock = ha->pBlockTable + dwIndex;
+        dwSeed1 = pFileSeeds[dwIndex];
+
+        // Notify the caller about work
+        if(CompactCB != NULL)
+            CompactCB(lpUserData, CCB_COMPACTING_FILES, dwIndex, ha->pHeader->dwBlockTableSize);
+
+//      if(dwIndex == 0x1B9)
+//          DebugBreak();
+
+        // Copy all the file blocks
+        // Debug: Break at (dwIndex == 5973)
+        if(pBlock->dwFlags & MPQ_FILE_EXISTS)
+        {
+            nError = CopyMpqFileBlocks(hFile, ha, pBlockEx, pBlock, dwSeed1);
+            if(nError != ERROR_SUCCESS)
+                break;
+        }
+    }
+
+    // Cleanup and exit
+    return nError;
+}
+
+
+/*****************************************************************************/
+/* Public functions                                                          */
+/*****************************************************************************/
+
+BOOL WINAPI SFileSetCompactCallback(HANDLE /* hMPQ */, COMPACTCB aCompactCB, void * lpData)
+{
+    CompactCB = aCompactCB;
+    lpUserData = lpData;
+    return TRUE;
+}
+
+//-----------------------------------------------------------------------------
+// Archive compacting (incomplete)
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileCompactArchive(HANDLE hMPQ, const char * szListFile, BOOL /* bReserved */)
+{
+    TMPQArchive * ha = (TMPQArchive *)hMPQ;
+    HANDLE hFile = INVALID_HANDLE_VALUE;
+    DWORD * pFileSeeds = NULL;
+    char szTempFile[MAX_PATH] = "";
+    char * szTemp = NULL;
+    DWORD dwTransferred;
+    int nError = ERROR_SUCCESS;
+
+    // Test the valid parameters
+    if(!IsValidMpqHandle(ha))
+        nError = ERROR_INVALID_PARAMETER;
+
+    // Create the table with file seeds
+    if(nError == ERROR_SUCCESS)
+    {
+        if((pFileSeeds = ALLOCMEM(DWORD, ha->pHeader->dwBlockTableSize)) != NULL)
+            memset(pFileSeeds, 0, sizeof(DWORD) * ha->pHeader->dwBlockTableSize);
+        else
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+    }
+
+    // First of all, we have to check of we are able to decrypt all files.
+    // If not, sorry, but the archive cannot be compacted.
+    if(nError == ERROR_SUCCESS)
+        nError = CheckIfAllFilesKnown(ha, szListFile, pFileSeeds);
+
+    // Get the temporary file name and create it
+    if(nError == ERROR_SUCCESS)
+    {
+        if(CompactCB != NULL)
+            CompactCB(lpUserData, CCB_COPYING_NON_MPQ_DATA, 0, 0);
+
+        strcpy(szTempFile, ha->szFileName);
+        if((szTemp = strrchr(szTempFile, '.')) != NULL)
+            strcpy(szTemp + 1, "mp_");
+        else
+            strcat(szTempFile, "_");
+
+        hFile = CreateFile(szTempFile, GENERIC_READ|GENERIC_WRITE, FILE_SHARE_READ, NULL, CREATE_ALWAYS, 0, NULL);
+        if(hFile == INVALID_HANDLE_VALUE)
+            nError = GetLastError();
+    }
+
+    // Write the data before MPQ header (if any)
+    if(nError == ERROR_SUCCESS && ha->MpqPos.QuadPart > 0)
+    {
+        SetFilePointer(ha->hFile, 0, NULL, FILE_BEGIN);
+        if(ha->pShunt != NULL)
+            nError = CopyNonMpqData(ha->hFile, hFile, ha->ShuntPos);
+        else
+            nError = CopyNonMpqData(ha->hFile, hFile, ha->MpqPos);
+    }
+
+    // Write the MPQ shunt (if any)
+    if(nError == ERROR_SUCCESS && ha->pShunt != NULL)
+    {
+        BSWAP_TMPQSHUNT(ha->pShunt);
+        WriteFile(hFile, ha->pShunt, sizeof(TMPQShunt), &dwTransferred, NULL);
+        BSWAP_TMPQSHUNT(ha->pShunt);
+
+        if(dwTransferred != sizeof(TMPQShunt))
+            nError = ERROR_DISK_FULL;
+    }
+
+    // Write the data between MPQ shunt and the MPQ header (if any)
+    if(nError == ERROR_SUCCESS && ha->pShunt != NULL)
+    {
+        LARGE_INTEGER BytesToCopy;
+
+        BytesToCopy.QuadPart = ha->MpqPos.QuadPart - (ha->ShuntPos.QuadPart + sizeof(TMPQShunt));
+        nError = CopyNonMpqData(ha->hFile, hFile, BytesToCopy);
+    }
+
+    // Write the MPQ header
+    if(nError == ERROR_SUCCESS)
+    {
+        BSWAP_TMPQHEADER(ha->pHeader);
+        WriteFile(hFile, ha->pHeader, ha->pHeader->dwHeaderSize, &dwTransferred, NULL);
+        BSWAP_TMPQHEADER(ha->pHeader);
+        if(dwTransferred != ha->pHeader->dwHeaderSize)
+            nError = ERROR_DISK_FULL;
+    }
+
+    // Write the data between the header and between the first file
+    // For this, we have to determine where the first file begins
+    if(nError == ERROR_SUCCESS)
+    {
+        LARGE_INTEGER FirstFilePos;
+        LARGE_INTEGER TempPos;
+        TMPQBlockEx * pBlockEx = ha->pExtBlockTable;
+        TMPQBlock * pBlockEnd = ha->pBlockTable + ha->pHeader->dwBlockTableSize;
+        TMPQBlock * pBlock = ha->pBlockTable;
+
+        // Maximum file position
+        FirstFilePos.HighPart = 0x7FFFFFFF;
+        FirstFilePos.LowPart = 0xFFFFFFFF;
+
+        // Find the block with the least position in the MPQ
+        while(pBlock < pBlockEnd)
+        {
+            TempPos.HighPart = pBlockEx->wFilePosHigh;
+            TempPos.LowPart = pBlock->dwFilePos;
+            if(TempPos.QuadPart < FirstFilePos.QuadPart)
+                FirstFilePos = TempPos;
+        
+            pBlockEx++;
+            pBlock++;
+        }
+
+        // Set the position in the source file right after the file header
+        TempPos.QuadPart = ha->MpqPos.QuadPart + ha->pHeader->dwHeaderSize;
+        SetFilePointer(ha->hFile, TempPos.LowPart, &TempPos.HighPart, FILE_BEGIN);
+
+        // Get the number of bytes to copy
+        FirstFilePos.QuadPart -= ha->pHeader->dwHeaderSize;
+        nError = CopyNonMpqData(ha->hFile, hFile, FirstFilePos);
+    }
+
+    // Now write all file blocks.
+    if(nError == ERROR_SUCCESS)
+        nError = CopyMpqFiles(hFile, ha, pFileSeeds);
+
+    // Now we need to update the tables positions
+    // (but only if the tables are at the end of the file)
+    if(nError == ERROR_SUCCESS)
+    {
+        LARGE_INTEGER RelativePos;
+        LARGE_INTEGER FilePos = {0};
+
+        // Set the hash table position
+        FilePos.LowPart = SetFilePointer(hFile, 0, &FilePos.HighPart, FILE_CURRENT);
+        RelativePos.QuadPart = FilePos.QuadPart - ha->MpqPos.QuadPart;
+        ha->pHeader->wHashTablePosHigh = (USHORT)RelativePos.HighPart;
+        ha->pHeader->dwHashTablePos = RelativePos.LowPart;
+        ha->HashTablePos = FilePos;
+
+        // Set the block table position
+        RelativePos.QuadPart += ha->pHeader->dwHashTableSize * sizeof(TMPQHash);
+        FilePos.QuadPart += ha->pHeader->dwHashTableSize * sizeof(TMPQHash);
+        ha->pHeader->wBlockTablePosHigh = (USHORT)RelativePos.HighPart;
+        ha->pHeader->dwBlockTablePos = RelativePos.LowPart;
+        ha->BlockTablePos = FilePos;
+
+        // Set the extended block table position
+        RelativePos.QuadPart += ha->pHeader->dwBlockTableSize * sizeof(TMPQBlock);
+        FilePos.QuadPart += ha->pHeader->dwBlockTableSize * sizeof(TMPQBlock);
+        if(ha->ExtBlockTablePos.QuadPart != 0)
+        {
+            ha->pHeader->ExtBlockTablePos = RelativePos;
+            ha->ExtBlockTablePos = FilePos;
+
+            RelativePos.QuadPart += ha->pHeader->dwBlockTableSize * sizeof(TMPQBlockEx);
+            FilePos.QuadPart += ha->pHeader->dwBlockTableSize * sizeof(TMPQBlockEx);
+        }
+
+        // Set the archive size
+        ha->pHeader->dwArchiveSize = RelativePos.LowPart;
+        ha->MpqSize = RelativePos;
+    }
+
+    // If succeeded, update the tables in the file
+    if(nError == ERROR_SUCCESS)
+    {
+        CloseHandle(ha->hFile);
+        ha->FilePointer.QuadPart = 0;
+        ha->hFile = hFile;
+        hFile = INVALID_HANDLE_VALUE;
+        nError = SaveMPQTables(ha);
+    }
+
+    // If all succeeded, switch the archives
+    if(nError == ERROR_SUCCESS)
+    {
+        if(CompactCB != NULL)
+            CompactCB(lpUserData, CCB_CLOSING_ARCHIVE, 0, 0);
+
+        if(!DeleteFile(ha->szFileName) ||           // Delete the old archive
+           !CloseHandle(ha->hFile)     ||           // Close the new archive
+           !MoveFile(szTempFile, ha->szFileName))   // Rename the temporary archive
+            nError = GetLastError();
+    }
+
+    // Now open the freshly renamed archive file
+    if(nError == ERROR_SUCCESS)
+    {
+        ha->hFile = CreateFile(ha->szFileName, GENERIC_READ | GENERIC_WRITE, FILE_SHARE_READ, NULL, OPEN_EXISTING, 0, NULL);
+        if(ha->hFile == INVALID_HANDLE_VALUE)
+            nError = GetLastError();
+    }
+
+    // Invalidate the positions of the archive
+    if(nError == ERROR_SUCCESS)
+    {
+        ha->FilePointer.QuadPart = 0;
+        ha->pLastFile  = NULL;
+        ha->dwBlockPos = 0;
+        ha->dwBuffPos  = 0;
+    }
+
+    // Cleanup and return
+    if(hFile != INVALID_HANDLE_VALUE)
+        CloseHandle(hFile);
+    if(pFileSeeds != NULL)
+        FREEMEM(pFileSeeds);
+    if(nError != ERROR_SUCCESS)
+        SetLastError(nError);
+    DeleteFile(szTempFile);
+    CompactCB = NULL;
+    return (nError == ERROR_SUCCESS);
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/SFileCreateArchiveEx.cpp b/contrib/vmap_extractor_v2/stormlib/SFileCreateArchiveEx.cpp
new file mode 100644
index 00000000000..2410920fc93
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SFileCreateArchiveEx.cpp
@@ -0,0 +1,530 @@
+/*****************************************************************************/
+/* SFileCreateArchiveEx.cpp               Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* MPQ Editing functions                                                     */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 24.03.03  1.00  Lad  Splitted from SFileOpenArchive.cpp                   */
+/*****************************************************************************/
+
+#define __STORMLIB_SELF__
+#include "StormLib.h"
+#include "SCommon.h"
+
+//-----------------------------------------------------------------------------
+// Defines
+
+#define DEFAULT_BLOCK_SIZE  3       // Default size of the block
+
+//-----------------------------------------------------------------------------
+// Local tables
+
+static DWORD PowersOfTwo[] = 
+{
+               0x0000002, 0x0000004, 0x0000008,
+    0x0000010, 0x0000020, 0x0000040, 0x0000080,
+    0x0000100, 0x0000200, 0x0000400, 0x0000800,
+    0x0001000, 0x0002000, 0x0004000, 0x0008000,
+    0x0010000, 0x0020000, 0x0040000, 0x0080000,
+    0x0000000
+};
+
+/*****************************************************************************/
+/* Public functions                                                          */
+/*****************************************************************************/
+
+//-----------------------------------------------------------------------------
+// Opens or creates a (new) MPQ archive.
+//
+//  szMpqName - Name of the archive to be created.
+//
+//  dwCreationDisposition:
+//
+//   Value          Archive exists         Archive doesn't exist
+//   ----------     ---------------------  ---------------------
+//   CREATE_NEW     Fails                  Creates new archive
+//   CREATE_ALWAYS  Overwrites existing    Creates new archive
+//   OPEN_EXISTING  Opens the archive      Fails
+//   OPEN_ALWAYS    Opens the archive      Creates new archive
+//
+//   The above mentioned values can be combined with the following flags:
+//
+//   MPQ_CREATE_ARCHIVE_V1 - Creates MPQ archive version 1
+//   MPQ_CREATE_ARCHIVE_V2 - Creates MPQ archive version 2
+//   
+// dwHashTableSize - Size of the hash table (only if creating a new archive).
+//        Must be between 2^4 (= 16) and 2^18 (= 262 144)
+//
+// phMpq - Receives handle to the archive
+//
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileCreateArchiveEx(const char * szMpqName, DWORD dwCreationDisposition, DWORD dwHashTableSize, HANDLE * phMPQ)
+{
+    LARGE_INTEGER MpqPos = {0};             // Position of MPQ header in the file
+    TMPQArchive * ha = NULL;                // MPQ archive handle
+    HANDLE hFile = INVALID_HANDLE_VALUE;    // File handle
+    DWORD dwTransferred = 0;                // Number of bytes written into the archive
+    USHORT wFormatVersion;
+    BOOL bFileExists = FALSE;
+    int nIndex = 0;
+    int nError = ERROR_SUCCESS;
+
+    // Pre-initialize the result value
+    if(phMPQ != NULL)
+        *phMPQ = NULL;
+
+    // Check the parameters, if they are valid
+    if(szMpqName == NULL || *szMpqName == 0 || phMPQ == NULL)
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return FALSE;
+    }
+
+    // Check the value of dwCreationDisposition against file existence
+    bFileExists = (GetFileAttributes(szMpqName) != 0xFFFFFFFF);
+
+    // Extract format version from the "dwCreationDisposition"
+    wFormatVersion = (USHORT)(dwCreationDisposition >> 0x10);
+    dwCreationDisposition &= 0x0000FFFF;
+
+    // If the file exists and open required, do it.
+    if(bFileExists && (dwCreationDisposition == OPEN_EXISTING || dwCreationDisposition == OPEN_ALWAYS))
+    {
+        // Try to open the archive normal way. If it fails, it means that
+        // the file exist, but it is not a MPQ archive.
+        if(SFileOpenArchiveEx(szMpqName, 0, 0, phMPQ, GENERIC_READ | GENERIC_WRITE))
+            return TRUE;
+    }
+
+    // Two error cases
+    if(dwCreationDisposition == CREATE_NEW && bFileExists)
+    {
+        SetLastError(ERROR_ALREADY_EXISTS);
+        return FALSE;
+    }
+    if(dwCreationDisposition == OPEN_EXISTING && bFileExists == FALSE)
+    {
+        SetLastError(ERROR_FILE_NOT_FOUND);
+        return FALSE;
+    }
+
+    // At this point, we have to create the archive. If the file exists,
+    // we will convert it to MPQ archive.
+    // Check the value of hash table size. It has to be a power of two
+    // and must be between HASH_TABLE_SIZE_MIN and HASH_TABLE_SIZE_MAX
+    if(dwHashTableSize < HASH_TABLE_SIZE_MIN)
+        dwHashTableSize = HASH_TABLE_SIZE_MIN;
+    if(dwHashTableSize > HASH_TABLE_SIZE_MAX)
+        dwHashTableSize = HASH_TABLE_SIZE_MAX;
+    
+    // Round the hash table size up to the nearest power of two
+    for(nIndex = 0; PowersOfTwo[nIndex] != 0; nIndex++)
+    {
+        if(dwHashTableSize <= PowersOfTwo[nIndex])
+        {
+            dwHashTableSize = PowersOfTwo[nIndex];
+            break;
+        }
+    }
+
+    // Prepare the buffer for decryption engine
+    if(nError == ERROR_SUCCESS)
+        nError = PrepareStormBuffer();
+
+    // Get the position where the MPQ header will begin.
+    if(nError == ERROR_SUCCESS)
+    {
+        hFile = CreateFile(szMpqName,
+                           GENERIC_READ | GENERIC_WRITE,
+                           FILE_SHARE_READ,
+                           NULL,
+                           dwCreationDisposition,
+                           0,
+                           NULL);
+        if(hFile == INVALID_HANDLE_VALUE)
+            nError = GetLastError();
+    }
+
+    // Retrieve the file size and round it up to 0x200 bytes
+    if(nError == ERROR_SUCCESS)
+    {
+        MpqPos.LowPart  = GetFileSize(hFile, (LPDWORD)&MpqPos.HighPart);
+        MpqPos.QuadPart += 0x1FF;
+        MpqPos.LowPart &= 0xFFFFFE00;
+
+        if(wFormatVersion == MPQ_FORMAT_VERSION_1 && MpqPos.HighPart != 0)
+            nError = ERROR_DISK_FULL;
+        if(wFormatVersion == MPQ_FORMAT_VERSION_2 && MpqPos.HighPart > 0x0000FFFF)
+            nError = ERROR_DISK_FULL;
+    }
+
+    // Move to the end of the file (i.e. begin of the MPQ)
+    if(nError == ERROR_SUCCESS)
+    {
+        if(SetFilePointer(hFile, MpqPos.LowPart, &MpqPos.HighPart, FILE_BEGIN) == 0xFFFFFFFF)
+            nError = GetLastError();
+    }
+
+    // Set the new end of the file to the MPQ header position
+    if(nError == ERROR_SUCCESS)
+    {
+        if(!SetEndOfFile(hFile))
+            nError = GetLastError();
+    }
+
+    // Create the archive handle
+    if(nError == ERROR_SUCCESS)
+    {
+        if((ha = ALLOCMEM(TMPQArchive, 1)) == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+    }
+
+    // Fill the MPQ archive handle structure and create the header,
+    // block buffer, hash table and block table
+    if(nError == ERROR_SUCCESS)
+    {
+        memset(ha, 0, sizeof(TMPQArchive));
+        strcpy(ha->szFileName, szMpqName);
+        ha->hFile          = hFile;
+        ha->dwBlockSize    = 0x200 << DEFAULT_BLOCK_SIZE;
+        ha->MpqPos         = MpqPos;
+        ha->FilePointer    = MpqPos;
+        ha->pHeader        = &ha->Header;
+        ha->pHashTable     = ALLOCMEM(TMPQHash, dwHashTableSize);
+        ha->pBlockTable    = ALLOCMEM(TMPQBlock, dwHashTableSize);
+        ha->pExtBlockTable = ALLOCMEM(TMPQBlockEx, dwHashTableSize);
+        ha->pbBlockBuffer  = ALLOCMEM(BYTE, ha->dwBlockSize);
+        ha->pListFile      = NULL;
+        ha->dwFlags       |= MPQ_FLAG_CHANGED;
+
+        if(!ha->pHashTable || !ha->pBlockTable || !ha->pExtBlockTable || !ha->pbBlockBuffer)
+            nError = GetLastError();
+        hFile = INVALID_HANDLE_VALUE;
+    }
+
+    // Fill the MPQ header and all buffers
+    if(nError == ERROR_SUCCESS)
+    {
+        LARGE_INTEGER TempPos;
+        TMPQHeader2 * pHeader = ha->pHeader;
+        DWORD dwHeaderSize = (wFormatVersion == MPQ_FORMAT_VERSION_2) ? sizeof(TMPQHeader2) : sizeof(TMPQHeader);
+
+        memset(pHeader, 0, sizeof(TMPQHeader2));
+        pHeader->dwID            = ID_MPQ;
+        pHeader->dwHeaderSize    = dwHeaderSize;
+        pHeader->dwArchiveSize   = pHeader->dwHeaderSize + dwHashTableSize * sizeof(TMPQHash);
+        pHeader->wFormatVersion  = wFormatVersion;
+        pHeader->wBlockSize      = 3;               // 0x1000 bytes per block
+        pHeader->dwHashTableSize = dwHashTableSize;
+
+        // Set proper hash table positions
+        ha->HashTablePos.QuadPart = ha->MpqPos.QuadPart + pHeader->dwHeaderSize;
+        ha->pHeader->dwHashTablePos = pHeader->dwHeaderSize;
+        ha->pHeader->wHashTablePosHigh = 0;
+
+        // Set proper block table positions
+        ha->BlockTablePos.QuadPart = ha->HashTablePos.QuadPart +
+                                     (ha->pHeader->dwHashTableSize * sizeof(TMPQHash));
+        TempPos.QuadPart = ha->BlockTablePos.QuadPart - ha->MpqPos.QuadPart;
+        ha->pHeader->dwBlockTablePos = TempPos.LowPart;
+        ha->pHeader->wBlockTablePosHigh = (USHORT)TempPos.HighPart;
+
+        // For now, we set extended block table positioon top zero unless we add enough
+        // files to cause the archive size exceed 4 GB
+        ha->ExtBlockTablePos.QuadPart = 0;
+
+        // Clear all tables
+        memset(ha->pBlockTable, 0, sizeof(TMPQBlock) * dwHashTableSize);
+        memset(ha->pExtBlockTable, 0, sizeof(TMPQBlockEx) * dwHashTableSize);
+        memset(ha->pHashTable, 0xFF, sizeof(TMPQHash) * dwHashTableSize);
+    }
+
+    // Write the MPQ header to the file
+    if(nError == ERROR_SUCCESS)
+    {
+        DWORD dwHeaderSize = ha->pHeader->dwHeaderSize;
+
+        BSWAP_TMPQHEADER(ha->pHeader);
+        WriteFile(ha->hFile, ha->pHeader, dwHeaderSize, &dwTransferred, NULL);
+        BSWAP_TMPQHEADER(ha->pHeader);
+        
+        if(dwTransferred != ha->pHeader->dwHeaderSize)
+            nError = ERROR_DISK_FULL;
+
+        ha->FilePointer.QuadPart = ha->MpqPos.QuadPart + dwTransferred;
+        ha->MpqSize.QuadPart += dwTransferred;
+    }
+
+    // Create the internal listfile
+    if(nError == ERROR_SUCCESS)
+        nError = SListFileCreateListFile(ha);
+
+    // Try to add the internal listfile
+    if(nError == ERROR_SUCCESS)
+        SFileAddListFile((HANDLE)ha, NULL);
+
+    // Cleanup : If an error, delete all buffers and return
+    if(nError != ERROR_SUCCESS)
+    {
+        FreeMPQArchive(ha);
+        if(hFile != INVALID_HANDLE_VALUE)
+            CloseHandle(hFile);
+        SetLastError(nError);
+    }
+    
+    // Return the values
+    *phMPQ = (HANDLE)ha;
+    return (nError == ERROR_SUCCESS);
+}
+
+//-----------------------------------------------------------------------------
+// Changes locale ID of a file
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileSetFileLocale(HANDLE hFile, LCID lcNewLocale)
+{
+    TMPQFile * hf = (TMPQFile *)hFile;
+
+    // Invalid handle => do nothing
+    if(IsValidFileHandle(hf) == FALSE || IsValidMpqHandle(hf->ha) == FALSE)
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return FALSE;
+    }
+
+    // If the file has not been open for writing, do nothing.
+    if(hf->ha->pListFile == NULL)
+        return ERROR_ACCESS_DENIED;
+
+    hf->pHash->lcLocale = (USHORT)lcNewLocale;
+    hf->ha->dwFlags |= MPQ_FLAG_CHANGED;
+    return TRUE;
+}
+
+//-----------------------------------------------------------------------------
+// Adds a file into the archive
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileAddFileEx(HANDLE hMPQ, const char * szFileName, const char * szArchivedName, DWORD dwFlags, DWORD dwQuality, int nFileType)
+{
+    TMPQArchive * ha = (TMPQArchive *)hMPQ;
+    HANDLE hFile = INVALID_HANDLE_VALUE;
+    BOOL   bReplaced = FALSE;          // TRUE if replacing file in the archive
+    int    nError = ERROR_SUCCESS;
+
+    if(nError == ERROR_SUCCESS)
+    {
+        // Check valid parameters
+        if(IsValidMpqHandle(ha) == FALSE || szFileName == NULL || *szFileName == 0 || szArchivedName == NULL || *szArchivedName == 0)
+            nError = ERROR_INVALID_PARAMETER;
+
+        // Check the values of dwFlags
+        if((dwFlags & MPQ_FILE_COMPRESS_PKWARE) && (dwFlags & MPQ_FILE_COMPRESS_MULTI))
+            nError = ERROR_INVALID_PARAMETER;
+    }
+
+    // If anyone is trying to add listfile, and the archive already has a listfile,
+    // deny the operation, but return success.
+    if(nError == ERROR_SUCCESS)
+    {
+        if(ha->pListFile != NULL && !_stricmp(szFileName, LISTFILE_NAME))
+            return ERROR_SUCCESS;
+    }
+
+    // Open added file
+    if(nError == ERROR_SUCCESS)
+    {
+        hFile = CreateFile(szFileName, GENERIC_READ, FILE_SHARE_READ, 0, OPEN_EXISTING, 0, NULL);
+        if(hFile == INVALID_HANDLE_VALUE)
+            nError = GetLastError();
+    }
+
+    if(nError == ERROR_SUCCESS)
+        nError = AddFileToArchive(ha, hFile, szArchivedName, dwFlags, dwQuality, nFileType, &bReplaced);
+
+    // Add the file into listfile also
+    if(nError == ERROR_SUCCESS && bReplaced == FALSE)
+        nError = SListFileAddNode(ha, szArchivedName);
+
+    // Cleanup and exit
+    if(hFile != INVALID_HANDLE_VALUE)
+        CloseHandle(hFile);
+    if(nError != ERROR_SUCCESS)
+        SetLastError(nError);
+    return (nError == ERROR_SUCCESS);
+}
+                                                                                                                                 
+// Adds a data file into the archive
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileAddFile(HANDLE hMPQ, const char * szFileName, const char * szArchivedName, DWORD dwFlags)
+{
+    return SFileAddFileEx(hMPQ, szFileName, szArchivedName, dwFlags, 0, SFILE_TYPE_DATA);
+}
+
+// Adds a WAVE file into the archive
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileAddWave(HANDLE hMPQ, const char * szFileName, const char * szArchivedName, DWORD dwFlags, DWORD dwQuality)
+{
+    return SFileAddFileEx(hMPQ, szFileName, szArchivedName, dwFlags, dwQuality, SFILE_TYPE_WAVE);
+}
+
+//-----------------------------------------------------------------------------
+// BOOL SFileRemoveFile(HANDLE hMPQ, char * szFileName)
+//
+// This function removes a file from the archive. The file content
+// remains there, only the entries in the hash table and in the block
+// table are updated. 
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileRemoveFile(HANDLE hMPQ, const char * szFileName, DWORD dwSearchScope)
+{
+    TMPQArchive * ha = (TMPQArchive *)hMPQ;
+    TMPQBlockEx * pBlockEx = NULL;  // Block entry of deleted file
+    TMPQBlock   * pBlock = NULL;    // Block entry of deleted file
+    TMPQHash    * pHash = NULL;     // Hash entry of deleted file
+    DWORD dwBlockIndex = 0;
+    int nError = ERROR_SUCCESS;
+
+    // Check the parameters
+    if(nError == ERROR_SUCCESS)
+    {
+        if(IsValidMpqHandle(ha) == FALSE)
+            nError = ERROR_INVALID_PARAMETER;
+        if(dwSearchScope != SFILE_OPEN_BY_INDEX && *szFileName == 0)
+            nError = ERROR_INVALID_PARAMETER;
+    }
+
+    // Do not allow to remove listfile
+    if(nError == ERROR_SUCCESS)
+    {
+        if(dwSearchScope != SFILE_OPEN_BY_INDEX && !_stricmp(szFileName, LISTFILE_NAME))
+            nError = ERROR_ACCESS_DENIED;
+    }
+
+    // Get hash entry belonging to this file
+    if(nError == ERROR_SUCCESS)
+    {
+        if((pHash = GetHashEntryEx(ha, (char *)szFileName, lcLocale)) == NULL)
+            nError = ERROR_FILE_NOT_FOUND;
+    }
+
+    // If index was not found, or is greater than number of files, exit.
+    if(nError == ERROR_SUCCESS)
+    {
+        if((dwBlockIndex = pHash->dwBlockIndex) > ha->pHeader->dwBlockTableSize)
+            nError = ERROR_FILE_NOT_FOUND;
+    }
+
+    // Get block and test if the file is not already deleted
+    if(nError == ERROR_SUCCESS)
+    {
+        pBlockEx = ha->pExtBlockTable + dwBlockIndex;
+        pBlock = ha->pBlockTable + dwBlockIndex;
+        if((pBlock->dwFlags & MPQ_FILE_EXISTS) == 0)
+            nError = ERROR_FILE_NOT_FOUND;
+    }
+
+    // Now invalidate the block entry and the hash entry. Do not make any
+    // relocations and file copying, use SFileCompactArchive for it.
+    if(nError == ERROR_SUCCESS)
+    {
+        pBlockEx->wFilePosHigh = 0;
+        pBlock->dwFilePos   = 0;
+        pBlock->dwFSize     = 0;
+        pBlock->dwCSize     = 0;
+        pBlock->dwFlags     = 0;
+        pHash->dwName1      = 0xFFFFFFFF;
+        pHash->dwName2      = 0xFFFFFFFF;
+        pHash->lcLocale     = 0xFFFF;
+        pHash->wPlatform    = 0xFFFF;
+        pHash->dwBlockIndex = HASH_ENTRY_DELETED;
+
+        // Update MPQ archive
+        ha->dwFlags |= MPQ_FLAG_CHANGED;
+    }
+
+    // Remove the file from the list file
+    if(nError == ERROR_SUCCESS && lcLocale == LANG_NEUTRAL)
+        nError = SListFileRemoveNode(ha, szFileName);
+
+    // Resolve error and exit
+    if(nError != ERROR_SUCCESS)
+        SetLastError(nError);
+    return (nError == ERROR_SUCCESS);
+}
+
+// Renames the file within the archive.
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileRenameFile(HANDLE hMPQ, const char * szFileName, const char * szNewFileName)
+{
+    TMPQArchive * ha = (TMPQArchive *)hMPQ;
+    TMPQHash * pOldHash = NULL;         // Hash entry for the original file
+    TMPQHash * pNewHash = NULL;         // Hash entry for the renamed file
+    DWORD dwBlockIndex = 0;
+    int nError = ERROR_SUCCESS;
+
+    // Test the valid parameters
+    if(nError == ERROR_SUCCESS)
+    {
+        if(hMPQ == NULL || szNewFileName == NULL || *szNewFileName == 0)
+            nError = ERROR_INVALID_PARAMETER;
+        if(szFileName == NULL || *szFileName == 0)
+            nError = ERROR_INVALID_PARAMETER;
+    }
+
+    // Do not allow to rename listfile
+    if(nError == ERROR_SUCCESS)
+    {
+        if(!_stricmp(szFileName, LISTFILE_NAME))
+            nError = ERROR_ACCESS_DENIED;
+    }
+
+    // Test if the file already exists in the archive
+    if(nError == ERROR_SUCCESS)
+    {
+        if((pNewHash = GetHashEntryEx(ha, szNewFileName, lcLocale)) != NULL)
+            nError = ERROR_ALREADY_EXISTS;
+    }
+
+    // Get the hash table entry for the original file
+    if(nError == ERROR_SUCCESS)
+    {
+        if((pOldHash = GetHashEntryEx(ha, szFileName, lcLocale)) == NULL)
+            nError = ERROR_FILE_NOT_FOUND;
+    }
+
+    // Get the hash table entry for the renamed file
+    if(nError == ERROR_SUCCESS)
+    {
+        // Save block table index and remove the hash table entry
+        dwBlockIndex = pOldHash->dwBlockIndex;
+        pOldHash->dwName1      = 0xFFFFFFFF;
+        pOldHash->dwName2      = 0xFFFFFFFF;
+        pOldHash->lcLocale     = 0xFFFF;
+        pOldHash->wPlatform    = 0xFFFF;
+        pOldHash->dwBlockIndex = HASH_ENTRY_DELETED;
+
+        if((pNewHash = FindFreeHashEntry(ha, szNewFileName)) == NULL)
+            nError = ERROR_CAN_NOT_COMPLETE;
+    }
+
+    // Save the block index and clear the hash entry
+    if(nError == ERROR_SUCCESS)
+    {
+        // Copy the block table index
+        pNewHash->dwBlockIndex = dwBlockIndex;
+        ha->dwFlags |= MPQ_FLAG_CHANGED;
+    }
+
+    // Rename the file in the list file
+    if(nError == ERROR_SUCCESS)
+        nError = SListFileRenameNode(ha, szFileName, szNewFileName);
+
+    // Resolve error and return
+    if(nError != ERROR_SUCCESS)
+        SetLastError(nError);
+    return (nError == ERROR_SUCCESS);
+}
+
diff --git a/contrib/vmap_extractor_v2/stormlib/SFileExtractFile.cpp b/contrib/vmap_extractor_v2/stormlib/SFileExtractFile.cpp
new file mode 100644
index 00000000000..7f16cde0171
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SFileExtractFile.cpp
@@ -0,0 +1,63 @@
+/*****************************************************************************/
+/* SFileExtractFile.cpp                   Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Simple extracting utility                                                 */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 20.06.03  1.00  Lad  The first version of SFileExtractFile.cpp            */
+/*****************************************************************************/
+
+#define __STORMLIB_SELF__
+#include "StormLib.h"
+#include "SCommon.h"
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileExtractFile(HANDLE hMpq, const char * szToExtract, const char * szExtracted)
+{
+    HANDLE hLocalFile = INVALID_HANDLE_VALUE;
+    HANDLE hMpqFile = NULL;
+    int nError = ERROR_SUCCESS;
+
+    // Create the local file
+    if(nError == ERROR_SUCCESS)
+    {
+        hLocalFile = CreateFile(szExtracted, GENERIC_WRITE, FILE_SHARE_READ, NULL, CREATE_ALWAYS, 0, NULL);
+        if(hLocalFile == INVALID_HANDLE_VALUE)
+            nError = GetLastError();
+    }
+
+    // Open the MPQ file
+    if(nError == ERROR_SUCCESS)
+    {
+        if(!SFileOpenFileEx(hMpq, szToExtract, 0, &hMpqFile))
+            nError = GetLastError();
+    }
+
+    // Copy the file's content
+    if(nError == ERROR_SUCCESS)
+    {
+        char  szBuffer[0x1000];
+        DWORD dwTransferred = 1;
+
+        while(dwTransferred > 0)
+        {
+            SFileReadFile(hMpqFile, szBuffer, sizeof(szBuffer), &dwTransferred, NULL);
+            if(dwTransferred == 0)
+                break;
+
+            WriteFile(hLocalFile, szBuffer, dwTransferred, &dwTransferred, NULL);
+            if(dwTransferred == 0)
+                break;
+        }
+    }
+
+    // Close the files
+    if(hMpqFile != NULL)
+        SFileCloseFile(hMpqFile);
+    if(hLocalFile != INVALID_HANDLE_VALUE)
+        CloseHandle(hLocalFile);
+    if(nError != ERROR_SUCCESS)
+        SetLastError(nError);
+    return (BOOL)(nError == ERROR_SUCCESS);
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/SFileFindFile.cpp b/contrib/vmap_extractor_v2/stormlib/SFileFindFile.cpp
new file mode 100644
index 00000000000..41dbeba900c
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SFileFindFile.cpp
@@ -0,0 +1,291 @@
+/*****************************************************************************/
+/* SFileFindFile.cpp                      Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* A module for file searching within MPQs                                   */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 25.03.03  1.00  Lad  The first version of SFileFindFile.cpp               */
+/*****************************************************************************/
+
+#define __STORMLIB_SELF__
+#include "StormLib.h"
+#include "SCommon.h"
+
+//-----------------------------------------------------------------------------
+// Defines
+
+#define LISTFILE_CACHE_SIZE 0x1000
+
+//-----------------------------------------------------------------------------
+// Local functions
+
+static BOOL IsValidSearchHandle(TMPQSearch * hs)
+{
+    if(hs == NULL || IsBadReadPtr(hs, sizeof(TMPQSearch)))
+        return FALSE;
+
+    if(!IsValidMpqHandle(hs->ha))
+        return FALSE;
+
+    return TRUE;
+}
+
+// This function compares a string with a wildcard search string.
+// returns TRUE, when the string matches with the wildcard.
+BOOL CheckWildCard(const char * szString, const char * szWildCard)
+{
+    char * szTemp;                      // Temporary helper pointer
+    int nResult = 0;                    // For memcmp return values
+    int nMustNotMatch = 0;              // Number of following chars int szString,
+                                        // which must not match with szWildCard
+    int nMustMatch = 0;                 // Number of the following characters,
+                                        // which must match
+
+    // When the string is empty, it does not match with every wildcard
+    if(*szString == 0)
+        return FALSE;
+
+    // When the mask is empty, it matches to every wildcard
+    if(szWildCard == NULL || *szWildCard == 0)
+        return FALSE;
+
+    // Do normal test
+    for(;;)
+    {
+        switch(*szWildCard)
+        {
+            case '*': // Means "every number of characters"
+                // Skip all asterisks
+                while(*szWildCard == '*')
+                    szWildCard++;
+
+                // When no more characters in wildcard, it means that the strings match
+                if(*szWildCard == 0)
+                    return TRUE;
+
+                // The next N characters must not agree
+                nMustNotMatch |= 0x70000000;
+                break;
+            
+            case '?':  // Means "One or no character"
+                while(*szWildCard == '?')
+                {
+                    nMustNotMatch++;
+                    szWildCard++;
+                }
+                break;
+
+            default:
+                // If the two characters match
+                if(toupper(*szString) == toupper(*szWildCard))
+                {
+                    // When end of string, they agree
+                    if(*szString == 0)
+                        return TRUE;
+
+                    nMustNotMatch = 0;
+                    szWildCard++;
+                    szString++;
+                    break;
+                }
+
+                // If the next character must match, the string does not match
+                if(nMustNotMatch == 0)
+                    return FALSE;
+
+                // Count the characters which must match after characters
+                // that must not match
+                szTemp = (char *)szWildCard;
+                nMustMatch = 0;
+                while(*szTemp != 0 && *szTemp != '*' && *szTemp != '?')
+                {
+                    nMustMatch++;
+                    szTemp++;
+                }
+
+                // Now skip characters from szString up to number of chars
+                // that must not match
+                nResult = -1;
+                while(nMustNotMatch > 0 && *szString != 0)
+                {
+                    if((nResult = _strnicmp(szString, szWildCard, nMustMatch)) == 0)
+                        break;
+                    
+                    szString++;
+                    nMustNotMatch--;
+                }
+
+                // Make one more comparison
+                if(nMustNotMatch == 0)
+                    nResult = _strnicmp(szString, szWildCard, nMustMatch);
+
+                // If a match has been found, continue the search
+                if(nResult == 0)
+                {
+                    nMustNotMatch = 0;
+                    szWildCard += nMustMatch;
+                    szString   += nMustMatch;
+                    break;
+                }
+                return FALSE;
+        }
+    }
+}
+
+// Performs one MPQ search
+// TODO: Test for archives > 4GB
+static int DoMPQSearch(TMPQSearch * hs, SFILE_FIND_DATA * lpFindFileData)
+{
+    TMPQArchive * ha = hs->ha;
+    TFileNode * pNode;
+    TMPQHash * pHashEnd = ha->pHashTable + ha->pHeader->dwHashTableSize;
+    TMPQHash * pHash = ha->pHashTable + hs->dwNextIndex;
+
+    // Do until some file found or no more files
+    while(pHash < pHashEnd)
+    {
+        pNode = ha->pListFile[hs->dwNextIndex++];
+
+        // If this entry is free, do nothing
+        if(pHash->dwBlockIndex < HASH_ENTRY_FREE && (DWORD_PTR)pNode < HASH_ENTRY_FREE)
+        {
+            // Check the file name.
+            if(CheckWildCard(pNode->szFileName, hs->szSearchMask))
+            {
+                TMPQBlock * pBlock = ha->pBlockTable + pHash->dwBlockIndex;
+
+                lpFindFileData->lcLocale     = pHash->lcLocale;
+                lpFindFileData->dwFileSize   = pBlock->dwFSize;
+                lpFindFileData->dwFileFlags  = pBlock->dwFlags;
+                lpFindFileData->dwBlockIndex = pHash->dwBlockIndex;
+                lpFindFileData->dwCompSize   = pBlock->dwCSize;
+
+                // Fill the file name and plain file name
+                strcpy(lpFindFileData->cFileName, pNode->szFileName);
+                lpFindFileData->szPlainName = strrchr(lpFindFileData->cFileName, '\\');
+                if(lpFindFileData->szPlainName == NULL)
+                    lpFindFileData->szPlainName = lpFindFileData->cFileName;
+                else
+                    lpFindFileData->szPlainName++;
+
+                // Fill the next entry
+                return ERROR_SUCCESS;
+            }
+        }
+
+        pHash++;
+    }
+
+    // No more files found, return error
+    return ERROR_NO_MORE_FILES;
+}
+
+// TODO: Test for archives > 4GB
+static void FreeMPQSearch(TMPQSearch *& hs)
+{
+    if(hs != NULL)
+    {
+        FREEMEM(hs);
+        hs = NULL;
+    }
+}
+
+//-----------------------------------------------------------------------------
+// Public functions
+
+// TODO: Test for archives > 4GB
+HANDLE WINAPI SFileFindFirstFile(HANDLE hMPQ, const char * szMask, SFILE_FIND_DATA * lpFindFileData, const char * szListFile)
+{
+    TMPQArchive * ha = (TMPQArchive *)hMPQ;
+    TMPQSearch * hs = NULL;             // Search object handle
+    size_t nSize  = 0;
+    int nError = ERROR_SUCCESS;
+
+    // Check for the valid parameters
+    if(nError == ERROR_SUCCESS)
+    {
+        if(!IsValidMpqHandle(ha))
+            nError = ERROR_INVALID_PARAMETER;
+       
+        if(szMask == NULL || lpFindFileData == NULL)
+            nError = ERROR_INVALID_PARAMETER;
+
+        if(szListFile == NULL && !IsValidMpqHandle(ha))
+            nError = ERROR_INVALID_PARAMETER;
+    }
+
+    // Include the listfile into the MPQ's internal listfile
+    // Note that if the listfile name is NULL, do nothing because the
+    // internal listfile is always included.
+    if(nError == ERROR_SUCCESS && szListFile != NULL)
+        nError = SFileAddListFile((HANDLE)ha, szListFile);
+
+    // Allocate the structure for MPQ search
+    if(nError == ERROR_SUCCESS)
+    {
+        nSize = sizeof(TMPQSearch) + strlen(szMask) + 1;
+        if((hs = (TMPQSearch *)ALLOCMEM(char, nSize)) == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+    }
+
+    // Perform the first search
+    if(nError == ERROR_SUCCESS)
+    {
+        memset(hs, 0, sizeof(TMPQSearch));
+        hs->ha          = ha;
+        hs->dwNextIndex = 0;
+        strcpy(hs->szSearchMask, szMask);
+        nError = DoMPQSearch(hs, lpFindFileData);
+    }
+
+    // Cleanup
+    if(nError != ERROR_SUCCESS)
+    {
+        FreeMPQSearch(hs);
+        SetLastError(nError);
+    }
+    
+    // Return the result value
+    return (HANDLE)hs;
+}
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileFindNextFile(HANDLE hFind, SFILE_FIND_DATA * lpFindFileData)
+{
+    TMPQSearch * hs = (TMPQSearch *)hFind;
+    int nError = ERROR_SUCCESS;
+
+    // Check the parameters
+    if(nError == ERROR_SUCCESS)
+    {
+        if(!IsValidSearchHandle(hs) || lpFindFileData == NULL)
+            nError = ERROR_INVALID_PARAMETER;
+    }
+
+    if(nError == ERROR_SUCCESS)
+        nError = DoMPQSearch(hs, lpFindFileData);
+
+    if(nError != ERROR_SUCCESS)
+    {
+        SetLastError(nError);
+        return FALSE;
+    }
+    return TRUE;
+}
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileFindClose(HANDLE hFind)
+{
+    TMPQSearch * hs = (TMPQSearch *)hFind;
+
+    // Check the parameters
+    if(!IsValidSearchHandle(hs))
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return FALSE;
+    }
+
+    FreeMPQSearch(hs);
+    return TRUE;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/SFileOpenArchive.cpp b/contrib/vmap_extractor_v2/stormlib/SFileOpenArchive.cpp
new file mode 100644
index 00000000000..cadb4e023a2
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SFileOpenArchive.cpp
@@ -0,0 +1,497 @@
+/*****************************************************************************/
+/* SFileOpenArchive.cpp                       Copyright Ladislav Zezula 1999 */
+/*                                                                           */
+/* Author : Ladislav Zezula                                                  */
+/* E-mail : ladik@zezula.net                                                 */
+/* WWW    : www.zezula.net                                                   */
+/*---------------------------------------------------------------------------*/
+/*                       Archive functions of Storm.dll                      */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* xx.xx.xx  1.00  Lad  The first version of SFileOpenArchive.cpp            */
+/* 19.11.03  1.01  Dan  Big endian handling                                  */
+/*****************************************************************************/
+
+#define __STORMLIB_SELF__
+#include "StormLib.h"
+#include "SCommon.h"
+
+/*****************************************************************************/
+/* Local functions                                                           */
+/*****************************************************************************/
+
+static BOOL IsAviFile(TMPQHeader * pHeader)
+{
+    DWORD * AviHdr = (DWORD *)pHeader;
+
+    // Test for 'RIFF', 'AVI ' or 'LIST'
+    return (AviHdr[0] == 'FFIR' && AviHdr[2] == ' IVA' && AviHdr[3] == 'TSIL');
+}
+
+// This function gets the right positions of the hash table and the block table.
+// TODO: Test for archives > 4GB
+static int RelocateMpqTablePositions(TMPQArchive * ha)
+{
+    TMPQHeader2 * pHeader = ha->pHeader;
+    LARGE_INTEGER FileSize;
+    LARGE_INTEGER TempSize;
+
+    // Get the size of the file
+    FileSize.LowPart = GetFileSize(ha->hFile, (LPDWORD)&FileSize.HighPart);
+
+    // Set the proper hash table position
+    ha->HashTablePos.HighPart = pHeader->wHashTablePosHigh;
+    ha->HashTablePos.LowPart = pHeader->dwHashTablePos;
+    ha->HashTablePos.QuadPart += ha->MpqPos.QuadPart;
+    if(ha->HashTablePos.QuadPart > FileSize.QuadPart)
+        return ERROR_BAD_FORMAT;
+
+    // Set the proper block table position
+    ha->BlockTablePos.HighPart = pHeader->wBlockTablePosHigh;
+    ha->BlockTablePos.LowPart = pHeader->dwBlockTablePos;
+    ha->BlockTablePos.QuadPart += ha->MpqPos.QuadPart;
+    if(ha->BlockTablePos.QuadPart > FileSize.QuadPart)
+        return ERROR_BAD_FORMAT;
+
+    // Set the proper position of the extended block table
+    if(pHeader->ExtBlockTablePos.QuadPart != 0)
+    {
+        ha->ExtBlockTablePos = pHeader->ExtBlockTablePos;
+        ha->ExtBlockTablePos.QuadPart += ha->MpqPos.QuadPart;
+        if(ha->ExtBlockTablePos.QuadPart > FileSize.QuadPart)
+            return ERROR_BAD_FORMAT;
+    }
+
+    // Size of MPQ archive is computed as the biggest of
+    // (EndOfBlockTable, EndOfHashTable, EndOfExtBlockTable)
+    TempSize.QuadPart = ha->HashTablePos.QuadPart + (pHeader->dwHashTableSize * sizeof(TMPQHash));
+    if(TempSize.QuadPart > ha->MpqSize.QuadPart)
+        ha->MpqSize = TempSize;
+    TempSize.QuadPart = ha->BlockTablePos.QuadPart + (pHeader->dwBlockTableSize * sizeof(TMPQBlock));
+    if(TempSize.QuadPart > ha->MpqSize.QuadPart)
+        ha->MpqSize = TempSize;
+    TempSize.QuadPart = ha->ExtBlockTablePos.QuadPart + (pHeader->dwBlockTableSize * sizeof(TMPQBlockEx));
+    if(TempSize.QuadPart > ha->MpqSize.QuadPart)
+        ha->MpqSize = TempSize;
+    
+    // MPQ size does not include the bytes before MPQ header
+    ha->MpqSize.QuadPart -= ha->MpqPos.QuadPart;
+    return ERROR_SUCCESS;
+}
+
+
+/*****************************************************************************/
+/* Public functions                                                          */
+/*****************************************************************************/
+
+//-----------------------------------------------------------------------------
+// SFileGetLocale and SFileSetLocale
+// Set the locale for all neewly opened archives and files
+
+LCID WINAPI SFileGetLocale()
+{
+    return lcLocale;
+}
+
+LCID WINAPI SFileSetLocale(LCID lcNewLocale)
+{
+    lcLocale = lcNewLocale;
+    return lcLocale;
+}
+
+//-----------------------------------------------------------------------------
+// SFileOpenArchiveEx (not a public function !!!)
+//
+//   szFileName - MPQ archive file name to open
+//   dwPriority - When SFileOpenFileEx called, this contains the search priority for searched archives
+//   dwFlags    - If contains MPQ_OPEN_NO_LISTFILE, then the internal list file will not be used.
+//   phMPQ      - Pointer to store open archive handle
+
+BOOL SFileOpenArchiveEx(
+    const char * szMpqName,
+    DWORD dwPriority,
+    DWORD dwFlags,
+    HANDLE * phMPQ,
+    DWORD dwAccessMode)
+{
+    LARGE_INTEGER TempPos;
+    TMPQArchive * ha = NULL;            // Archive handle
+    HANDLE hFile = INVALID_HANDLE_VALUE;// Opened archive file handle
+    DWORD dwMaxBlockIndex = 0;          // Maximum value of block entry
+    DWORD dwBlockTableSize = 0;         // Block table size.
+    DWORD dwTransferred;                // Number of bytes read
+    DWORD dwBytes = 0;                  // Number of bytes to read
+    int nError = ERROR_SUCCESS;   
+
+    // Check the right parameters
+    if(nError == ERROR_SUCCESS)
+    {
+        if(szMpqName == NULL || *szMpqName == 0 || phMPQ == NULL)
+            nError = ERROR_INVALID_PARAMETER;
+    }
+
+    // Ensure that StormBuffer is allocated
+    if(nError == ERROR_SUCCESS)
+        nError = PrepareStormBuffer();
+
+    // Open the MPQ archive file
+    if(nError == ERROR_SUCCESS)
+    {
+        hFile = CreateFile(szMpqName, dwAccessMode, FILE_SHARE_READ, NULL, OPEN_EXISTING, 0, NULL);
+        if(hFile == INVALID_HANDLE_VALUE)
+            nError = GetLastError();
+    }
+    
+    // Allocate the MPQhandle
+    if(nError == ERROR_SUCCESS)
+    {
+        if((ha = ALLOCMEM(TMPQArchive, 1)) == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+    }
+
+    // Initialize handle structure and allocate structure for MPQ header
+    if(nError == ERROR_SUCCESS)
+    {
+        memset(ha, 0, sizeof(TMPQArchive));
+        strncpy(ha->szFileName, szMpqName, strlen(szMpqName));
+        ha->hFile      = hFile;
+        ha->dwPriority = dwPriority;
+        ha->pHeader    = &ha->Header;
+        ha->pListFile  = NULL;
+        hFile = INVALID_HANDLE_VALUE;
+    }
+
+    // Find the offset of MPQ header within the file
+    if(nError == ERROR_SUCCESS)
+    {
+        LARGE_INTEGER SearchPos = {0};
+        LARGE_INTEGER MpqPos = {0};
+        DWORD dwHeaderID;
+
+        for(;;)
+        {
+            // Invalidate the MPQ ID and read the eventual header
+            SetFilePointer(ha->hFile, MpqPos.LowPart, &MpqPos.HighPart, FILE_BEGIN);
+            ReadFile(ha->hFile, ha->pHeader, sizeof(TMPQHeader2), &dwTransferred, NULL);
+            dwHeaderID = BSWAP_INT32_UNSIGNED(ha->pHeader->dwID);
+
+            // Special check : Some MPQs are actually AVI files, only with
+            // changed extension.
+            if(MpqPos.QuadPart == 0 && IsAviFile(ha->pHeader))
+            {
+                nError = ERROR_AVI_FILE;
+                break;
+            }
+
+            // If different number of bytes read, break the loop
+            if(dwTransferred != sizeof(TMPQHeader2))
+            {
+                nError = ERROR_BAD_FORMAT;
+                break;
+            }
+
+            // If there is the MPQ shunt signature, process it
+            if(dwHeaderID == ID_MPQ_SHUNT && ha->pShunt == NULL)
+            {
+                // Fill the shunt header
+                ha->ShuntPos = MpqPos;
+                ha->pShunt = &ha->Shunt;
+                memcpy(ha->pShunt, ha->pHeader, sizeof(TMPQShunt));
+                BSWAP_TMPQSHUNT(ha->pShunt);
+
+                // Set the MPQ pos and repeat the search
+                MpqPos.QuadPart = SearchPos.QuadPart + ha->pShunt->dwHeaderPos;
+                continue;
+            }
+
+            // There must be MPQ header signature
+            if(dwHeaderID == ID_MPQ)
+            {
+                BSWAP_TMPQHEADER(ha->pHeader);
+
+                // Save the position where the MPQ header has been found
+                ha->MpqPos = MpqPos;
+
+                // If valid signature has been found, break the loop
+                if(ha->pHeader->wFormatVersion == MPQ_FORMAT_VERSION_1)
+                {
+                    // W3M Map Protectors set some garbage value into the "dwHeaderSize"
+                    // field of MPQ header. This value is apparently ignored by Storm.dll
+                    if(ha->pHeader->dwHeaderSize != sizeof(TMPQHeader) &&
+                       ha->pHeader->dwHeaderSize != sizeof(TMPQHeader2))
+                    {
+                        ha->dwFlags |= MPQ_FLAG_PROTECTED;
+                        ha->pHeader->dwHeaderSize = sizeof(TMPQHeader);
+                    }
+
+                    if(ha->pHeader->dwHashTablePos < ha->pHeader->dwArchiveSize &&
+                       ha->pHeader->dwBlockTablePos < ha->pHeader->dwArchiveSize)
+                    {
+                        break;
+                    }
+                }
+
+                if(ha->pHeader->wFormatVersion == MPQ_FORMAT_VERSION_2)
+                {
+                    break;
+                }
+
+                nError = ERROR_NOT_SUPPORTED;
+                break;
+            }
+
+            // If a MPQ shunt already has been found, 
+            // and no MPQ header was at potision pointed by the shunt,
+            // then the archive is corrupt
+            if(ha->pShunt != NULL)
+            {
+                nError = ERROR_BAD_FORMAT;
+                break;
+            }
+
+            // Move to the next possible offset
+            SearchPos.QuadPart += 0x200;
+            MpqPos = SearchPos;
+        }
+    }
+
+    // Relocate tables position
+    if(nError == ERROR_SUCCESS)
+    {
+        // Clear the fields not supported in older formats
+        if(ha->pHeader->wFormatVersion < MPQ_FORMAT_VERSION_2)
+        {
+            ha->pHeader->ExtBlockTablePos.QuadPart = 0;
+            ha->pHeader->wBlockTablePosHigh = 0;
+            ha->pHeader->wHashTablePosHigh = 0;
+        }
+
+        ha->dwBlockSize = (0x200 << ha->pHeader->wBlockSize);
+        nError = RelocateMpqTablePositions(ha);
+    }
+
+    // Allocate buffers
+    if(nError == ERROR_SUCCESS)
+    {
+        //
+        // Note that the block table should be as large as the hash table
+        // (For later file additions).
+        //
+        // I have found a MPQ which has the block table larger than
+        // the hash table. We should avoid buffer overruns caused by that.
+        //
+        dwBlockTableSize = max(ha->pHeader->dwHashTableSize, ha->pHeader->dwBlockTableSize);
+
+        ha->pHashTable     = ALLOCMEM(TMPQHash, ha->pHeader->dwHashTableSize);
+        ha->pBlockTable    = ALLOCMEM(TMPQBlock, dwBlockTableSize);
+        ha->pExtBlockTable = ALLOCMEM(TMPQBlockEx, dwBlockTableSize);
+        ha->pbBlockBuffer  = ALLOCMEM(BYTE, ha->dwBlockSize);
+
+        if(!ha->pHashTable || !ha->pBlockTable || !ha->pExtBlockTable || !ha->pbBlockBuffer)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+    }
+
+    // Read the hash table into memory
+    if(nError == ERROR_SUCCESS)
+    {
+        dwBytes = ha->pHeader->dwHashTableSize * sizeof(TMPQHash);
+        SetFilePointer(ha->hFile, ha->HashTablePos.LowPart, &ha->HashTablePos.HighPart, FILE_BEGIN);
+        ReadFile(ha->hFile, ha->pHashTable, dwBytes, &dwTransferred, NULL);
+
+        if(dwTransferred != dwBytes)
+            nError = ERROR_FILE_CORRUPT;
+    }
+
+    // Decrypt hash table and check if it is correctly decrypted
+    if(nError == ERROR_SUCCESS)
+    {
+        TMPQHash * pHashEnd = ha->pHashTable + ha->pHeader->dwHashTableSize;
+        TMPQHash * pHash;
+
+        // We have to convert the hash table from LittleEndian
+        BSWAP_ARRAY32_UNSIGNED((DWORD *)ha->pHashTable, (dwBytes / sizeof(DWORD)));
+        DecryptHashTable((DWORD *)ha->pHashTable, (BYTE *)"(hash table)", (ha->pHeader->dwHashTableSize * 4));
+
+        // Check hash table if is correctly decrypted
+        for(pHash = ha->pHashTable; pHash < pHashEnd; pHash++)
+        {
+            // Note: Some MPQs from World of Warcraft have wPlatform set to 0x0100.
+
+            // If not free or deleted hash entry, check for valid values
+            if(pHash->dwBlockIndex < HASH_ENTRY_DELETED)
+            {
+                // The block index should not be larger than size of the block table
+                if(pHash->dwBlockIndex > ha->pHeader->dwBlockTableSize)
+                {
+                    nError = ERROR_BAD_FORMAT;
+                    break;
+                }
+            
+                // Remember the highest block table entry
+                if(pHash->dwBlockIndex > dwMaxBlockIndex)
+                    dwMaxBlockIndex = pHash->dwBlockIndex;
+            }
+        }
+    }
+
+    // Now, read the block table
+    if(nError == ERROR_SUCCESS)
+    {
+        memset(ha->pBlockTable, 0, dwBlockTableSize * sizeof(TMPQBlock));
+
+        dwBytes = ha->pHeader->dwBlockTableSize * sizeof(TMPQBlock);
+        SetFilePointer(ha->hFile, ha->BlockTablePos.LowPart, &ha->BlockTablePos.HighPart, FILE_BEGIN);
+        ReadFile(ha->hFile, ha->pBlockTable, dwBytes, &dwTransferred, NULL);
+
+        // We have to convert every DWORD in ha->block from LittleEndian
+        BSWAP_ARRAY32_UNSIGNED((DWORD *)ha->pBlockTable, dwBytes / sizeof(DWORD));
+
+        if(dwTransferred != dwBytes)
+            nError = ERROR_FILE_CORRUPT;
+    }
+
+    // Decrypt block table.
+    // Some MPQs don't have Decrypted block table, e.g. cracked Diablo version
+    // We have to check if block table is really encrypted
+    if(nError == ERROR_SUCCESS)
+    {
+        TMPQBlock * pBlockEnd = ha->pBlockTable + ha->pHeader->dwBlockTableSize;
+        TMPQBlock * pBlock = ha->pBlockTable;
+        BOOL bBlockTableEncrypted = FALSE;
+
+        // Verify all blocks entries in the table
+        // The loop usually stops at the first entry
+        while(pBlock < pBlockEnd)
+        {
+            // The lower 8 bits of the MPQ flags are always zero.
+            // Note that this may change in next MPQ versions
+            if(pBlock->dwFlags & 0x000000FF)
+            {
+                bBlockTableEncrypted = TRUE;
+                break;
+            }
+
+            // Move to the next block table entry
+            pBlock++;
+        }
+
+        if(bBlockTableEncrypted)
+        {
+            DecryptBlockTable((DWORD *)ha->pBlockTable,
+                               (BYTE *)"(block table)",
+                                       (ha->pHeader->dwBlockTableSize * 4));
+        }
+    }
+
+    // Now, read the extended block table.
+    // For V1 archives, we still will maintain the extended block table
+    // (it will be filled with zeros)
+    // TODO: Test with >4GB
+    if(nError == ERROR_SUCCESS)
+    {
+        memset(ha->pExtBlockTable, 0, dwBlockTableSize * sizeof(TMPQBlockEx));
+
+        if(ha->pHeader->ExtBlockTablePos.QuadPart != 0)
+        {
+            dwBytes = ha->pHeader->dwBlockTableSize * sizeof(TMPQBlockEx);
+            SetFilePointer(ha->hFile,
+                           ha->ExtBlockTablePos.LowPart,
+                          &ha->ExtBlockTablePos.HighPart,
+                           FILE_BEGIN);
+            ReadFile(ha->hFile, ha->pExtBlockTable, dwBytes, &dwTransferred, NULL);
+
+            // We have to convert every DWORD in ha->block from LittleEndian
+            BSWAP_ARRAY16_UNSIGNED((USHORT *)ha->pExtBlockTable, dwBytes / sizeof(USHORT));
+
+            // The extended block table is not encrypted (so far)
+            if(dwTransferred != dwBytes)
+                nError = ERROR_FILE_CORRUPT;
+        }
+    }
+
+    // Verify the both block tables (If the MPQ file is not protected)
+    if(nError == ERROR_SUCCESS && (ha->dwFlags & MPQ_FLAG_PROTECTED) == 0)
+    {
+        TMPQBlockEx * pBlockEx = ha->pExtBlockTable;
+        TMPQBlock * pBlockEnd = ha->pBlockTable + dwMaxBlockIndex + 1;
+        TMPQBlock * pBlock   = ha->pBlockTable;
+
+        // If the MPQ file is not protected,
+        // we will check if all sizes in the block table is correct.
+        // Note that we will not relocate the block table (change from previous versions)
+        for(; pBlock < pBlockEnd; pBlock++, pBlockEx++)
+        {
+            if(pBlock->dwFlags & MPQ_FILE_EXISTS)
+            {
+                // Get the 64-bit file position
+                TempPos.HighPart = pBlockEx->wFilePosHigh;
+                TempPos.LowPart = pBlock->dwFilePos;
+
+                if(TempPos.QuadPart > ha->MpqSize.QuadPart || pBlock->dwCSize > ha->MpqSize.QuadPart)
+                {
+                    nError = ERROR_BAD_FORMAT;
+                    break;
+                }
+            }
+        }
+    }
+
+    // If the user didn't specified otherwise, 
+    // include the internal listfile to the TMPQArchive structure
+    if((dwFlags & MPQ_OPEN_NO_LISTFILE) == 0)
+    {
+        if(nError == ERROR_SUCCESS)
+            SListFileCreateListFile(ha);
+
+        // Add the internal listfile
+        if(nError == ERROR_SUCCESS)
+            SFileAddListFile((HANDLE)ha, NULL);
+    }
+
+    // Cleanup and exit
+    if(nError != ERROR_SUCCESS)
+    {
+        FreeMPQArchive(ha);
+        if(hFile != INVALID_HANDLE_VALUE)
+            CloseHandle(hFile);
+        SetLastError(nError);
+    }
+    else
+    {
+        if(pFirstOpen == NULL)
+            pFirstOpen = ha;
+    }
+    *phMPQ = ha;
+    return (nError == ERROR_SUCCESS);
+}
+
+BOOL WINAPI SFileOpenArchive(const char * szMpqName, DWORD dwPriority, DWORD dwFlags, HANDLE * phMPQ)
+{
+    return SFileOpenArchiveEx(szMpqName, dwPriority, dwFlags, phMPQ, GENERIC_READ);
+}
+
+//-----------------------------------------------------------------------------
+// BOOL SFileCloseArchive(HANDLE hMPQ);
+//
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileCloseArchive(HANDLE hMPQ)
+{
+    TMPQArchive * ha = (TMPQArchive *)hMPQ;
+    
+    if(!IsValidMpqHandle(ha))
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return FALSE;
+    }
+
+    if(ha->dwFlags & MPQ_FLAG_CHANGED)
+    {
+        SListFileSaveToMpq(ha);
+        SaveMPQTables(ha);
+    }
+    FreeMPQArchive(ha);
+    return TRUE;
+}
+
diff --git a/contrib/vmap_extractor_v2/stormlib/SFileOpenFileEx.cpp b/contrib/vmap_extractor_v2/stormlib/SFileOpenFileEx.cpp
new file mode 100644
index 00000000000..dae312144eb
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SFileOpenFileEx.cpp
@@ -0,0 +1,403 @@
+/*****************************************************************************/
+/* SFileOpenFileEx.cpp                    Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Description :                                                             */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* xx.xx.99  1.00  Lad  The first version of SFileOpenFileEx.cpp             */
+/*****************************************************************************/
+
+#define __STORMLIB_SELF__
+#include "StormLib.h"
+#include "SCommon.h"
+
+/*****************************************************************************/
+/* Local functions                                                           */
+/*****************************************************************************/
+
+// TODO: Test for archives > 4GB
+static BOOL OpenLocalFile(const char * szFileName, HANDLE * phFile)
+{
+    TMPQFile * hf = NULL;
+    HANDLE hFile = CreateFile(szFileName, GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, FILE_FLAG_SEQUENTIAL_SCAN, NULL);
+
+    if(hFile != INVALID_HANDLE_VALUE)
+    {
+        // Allocate and initialize file handle
+        size_t nHandleSize = sizeof(TMPQFile) + strlen(szFileName); 
+        if((hf = (TMPQFile *)ALLOCMEM(char, nHandleSize)) != NULL)
+        {
+            memset(hf, 0, nHandleSize);
+            strcpy(hf->szFileName, szFileName);
+            hf->hFile = hFile;
+            *phFile   = hf;
+            return TRUE;
+        }
+        else
+            SetLastError(ERROR_NOT_ENOUGH_MEMORY);
+    }
+    *phFile = NULL;
+    return FALSE;
+}
+
+// TODO: Test for archives > 4GB
+static void FreeMPQFile(TMPQFile *& hf)
+{
+    if(hf != NULL)
+    {
+        if(hf->hFile != INVALID_HANDLE_VALUE)
+            CloseHandle(hf->hFile);
+        if(hf->pdwBlockPos != NULL)
+            FREEMEM(hf->pdwBlockPos);
+        if(hf->pbFileBuffer != NULL)
+            FREEMEM(hf->pbFileBuffer);
+        FREEMEM(hf);
+        hf = NULL;
+    }
+}
+
+/*****************************************************************************/
+/* Public functions                                                          */
+/*****************************************************************************/
+
+//-----------------------------------------------------------------------------
+// SFileEnumLocales enums all locale versions within MPQ. 
+// Functions fills all available language identifiers on a file into the buffer
+// pointed by plcLocales. There must be enough entries to copy the localed,
+// otherwise the function returns ERROR_INSUFFICIENT_BUFFER.
+
+// TODO: Test for archives > 4GB
+int WINAPI SFileEnumLocales(
+    HANDLE hMPQ,
+    const char * szFileName,
+    LCID * plcLocales,
+    DWORD * pdwMaxLocales,
+    DWORD dwSearchScope)
+{
+    TMPQArchive * ha = (TMPQArchive *)hMPQ;
+    TMPQHash * pHash = NULL;
+    TMPQHash * pHashEnd = NULL;
+    DWORD dwLocales = 0;
+    int nError = ERROR_SUCCESS;
+
+    // Test the parameters
+    if(nError == ERROR_SUCCESS)
+    {
+        if(!IsValidMpqHandle(ha) || pdwMaxLocales == NULL)
+            nError = ERROR_INVALID_PARAMETER;
+        if(dwSearchScope == SFILE_OPEN_BY_INDEX && (DWORD_PTR)szFileName > ha->pHeader->dwBlockTableSize)
+            nError = ERROR_INVALID_PARAMETER;
+        if(dwSearchScope != SFILE_OPEN_BY_INDEX && *szFileName == 0)
+            nError = ERROR_INVALID_PARAMETER;
+    }
+
+    // Retrieve the hash entry for the required file
+    if(nError == ERROR_SUCCESS)
+    {
+        pHashEnd = ha->pHashTable + ha->pHeader->dwHashTableSize;
+
+        if(dwSearchScope == SFILE_OPEN_BY_INDEX)
+        {
+            for(pHash = ha->pHashTable; pHash < pHashEnd; pHash++)
+            {
+                if(pHash->dwBlockIndex == (DWORD_PTR)szFileName)
+                    break;
+            }
+            if(pHash == pHashEnd)
+                pHash = NULL;
+        }
+        else
+            pHash = GetHashEntry(ha, szFileName);
+    }
+
+    // If the file was not found, sorry
+    if(nError == ERROR_SUCCESS)
+    {
+        if(pHash == NULL)
+            nError = ERROR_FILE_NOT_FOUND;
+    }
+
+    // Count the entries which correspond to the same file name
+    if(nError == ERROR_SUCCESS)
+    {
+        TMPQHash * pSaveHash = pHash;
+        DWORD dwName1 = pHash->dwName1;
+        DWORD dwName2 = pHash->dwName2;
+
+        // For nameless access, return 1 locale always
+        if(dwSearchScope == SFILE_OPEN_BY_INDEX)
+            dwLocales++;
+        else
+        {
+            while(pHash < pHashEnd && pHash->dwName1 == dwName1 && pHash->dwName2 == dwName2)
+            {
+                dwLocales++;
+                pHash++;
+            }
+        }
+
+        pHash = pSaveHash;
+    }
+
+    // Test if there is enough space to copy the locales
+    if(nError == ERROR_SUCCESS)
+    {
+        DWORD dwMaxLocales = *pdwMaxLocales;
+
+        *pdwMaxLocales = dwLocales;
+        if(dwMaxLocales < dwLocales)
+            nError = ERROR_INSUFFICIENT_BUFFER;
+    }
+
+    // Fill all the locales
+    if(nError == ERROR_SUCCESS)
+    {
+        for(DWORD i = 0; i < dwLocales; i++, pHash++)
+            *plcLocales++ = (LCID)pHash->lcLocale;
+    }
+    return nError;
+}
+
+//-----------------------------------------------------------------------------
+// SFileHasFile
+//
+//   hMPQ          - Handle of opened MPQ archive
+//   szFileName    - Name of file to look for
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileHasFile(HANDLE hMPQ, char * szFileName)
+{
+    TMPQArchive * ha = (TMPQArchive *)hMPQ;
+    int nError = ERROR_SUCCESS;
+
+    if(nError == ERROR_SUCCESS)
+    {
+        if(ha == NULL)
+            nError = ERROR_INVALID_PARAMETER;
+        if(*szFileName == 0)
+            nError = ERROR_INVALID_PARAMETER;
+    }
+
+    // Prepare the file opening
+    if(nError == ERROR_SUCCESS)
+    {
+        if(GetHashEntryEx(ha, szFileName, lcLocale) == NULL)
+        {
+            nError = ERROR_FILE_NOT_FOUND;
+        }
+    }
+
+    // Cleanup
+    if(nError != ERROR_SUCCESS)
+    {
+        SetLastError(nError);
+    }
+
+    return (nError == ERROR_SUCCESS);
+}
+
+
+//-----------------------------------------------------------------------------
+// SFileOpenFileEx
+//
+//   hMPQ          - Handle of opened MPQ archive
+//   szFileName    - Name of file to open
+//   dwSearchScope - Where to search
+//   phFile        - Pointer to store opened file handle
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileOpenFileEx(HANDLE hMPQ, const char * szFileName, DWORD dwSearchScope, HANDLE * phFile)
+{
+    LARGE_INTEGER FilePos;
+    TMPQArchive * ha = (TMPQArchive *)hMPQ;
+    TMPQFile    * hf = NULL;
+    TMPQHash    * pHash  = NULL;        // Hash table index
+    TMPQBlock   * pBlock = NULL;        // File block
+    TMPQBlockEx * pBlockEx = NULL;
+    DWORD dwHashIndex  = 0;             // Hash table index
+    DWORD dwBlockIndex = (DWORD)-1;     // Found table index
+    size_t nHandleSize = 0;             // Memory space necessary to allocate TMPQHandle
+    int nError = ERROR_SUCCESS;
+
+#ifdef _DEBUG    
+    // Due to increasing numbers of files in MPQs, I had to change the behavior
+    // of opening by file index. Now, the SFILE_OPEN_BY_INDEX value of dwSearchScope
+    // must be entered. This check will allow to find code places that are incompatible
+    // with the new behavior.
+    if(dwSearchScope != SFILE_OPEN_BY_INDEX && szFileName != NULL)
+    {
+        assert((DWORD_PTR)szFileName > 0x10000);
+    }
+#endif
+
+    if(nError == ERROR_SUCCESS)
+    {
+        if(ha == NULL && dwSearchScope == SFILE_OPEN_FROM_MPQ)
+            nError = ERROR_INVALID_PARAMETER;
+        if(phFile == NULL)
+            nError = ERROR_INVALID_PARAMETER;
+        if(dwSearchScope == SFILE_OPEN_BY_INDEX && (DWORD_PTR)szFileName > ha->pHeader->dwBlockTableSize)
+            nError = ERROR_INVALID_PARAMETER;
+        if(dwSearchScope != SFILE_OPEN_BY_INDEX && (szFileName == NULL || *szFileName == 0))
+            nError = ERROR_INVALID_PARAMETER;
+    }
+
+    // Prepare the file opening
+    if(nError == ERROR_SUCCESS)
+    {
+        // When the file is given by number, ...
+        if(dwSearchScope == SFILE_OPEN_BY_INDEX)
+        {
+            TMPQHash * pHashEnd = ha->pHashTable + ha->pHeader->dwHashTableSize;
+
+            // Set handle size to be sizeof(TMPQFile) + length of FileXXXXXXXX.xxx
+            nHandleSize  = sizeof(TMPQFile) + 20;
+            for(pHash = ha->pHashTable; pHash < pHashEnd; pHash++)
+            {
+                if((DWORD_PTR)szFileName == pHash->dwBlockIndex)
+                {
+                    dwHashIndex  = (DWORD)(pHash - ha->pHashTable);
+                    dwBlockIndex = pHash->dwBlockIndex;
+                    break;
+                }
+            }
+        }
+        else
+        {
+            // If we have to open a disk file
+            if(dwSearchScope == SFILE_OPEN_LOCAL_FILE)
+                return OpenLocalFile(szFileName, phFile);
+
+            nHandleSize = sizeof(TMPQFile) + strlen(szFileName);
+            if((pHash = GetHashEntryEx(ha, szFileName, lcLocale)) != NULL)
+            {
+                dwHashIndex  = (DWORD)(pHash - ha->pHashTable);
+                dwBlockIndex = pHash->dwBlockIndex;
+            }
+        }
+    }
+
+    // Get block index from file name and test it
+    if(nError == ERROR_SUCCESS)
+    {
+        // If index was not found, or is greater than number of files, exit.
+        if(dwBlockIndex == (DWORD)-1 || dwBlockIndex > ha->pHeader->dwBlockTableSize)
+            nError = ERROR_FILE_NOT_FOUND;
+    }
+
+    // Get block and test if the file was not already deleted.
+    if(nError == ERROR_SUCCESS)
+    {
+        // Get both block tables and file position
+        pBlockEx = ha->pExtBlockTable + dwBlockIndex;
+        pBlock = ha->pBlockTable + dwBlockIndex;
+        FilePos.HighPart = pBlockEx->wFilePosHigh;
+        FilePos.LowPart = pBlock->dwFilePos;
+
+        if(FilePos.QuadPart > ha->MpqSize.QuadPart ||
+           pBlock->dwCSize > ha->MpqSize.QuadPart)
+            nError = ERROR_FILE_CORRUPT;
+        if((pBlock->dwFlags & MPQ_FILE_EXISTS) == 0)
+            nError = ERROR_FILE_NOT_FOUND;
+        if(pBlock->dwFlags & ~MPQ_FILE_VALID_FLAGS)
+            nError = ERROR_NOT_SUPPORTED;
+    }
+
+    // Allocate file handle
+    if(nError == ERROR_SUCCESS)
+    {
+        if((hf = (TMPQFile *)ALLOCMEM(char, nHandleSize)) == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+    }
+
+    // Initialize file handle
+    if(nError == ERROR_SUCCESS)
+    {
+        memset(hf, 0, nHandleSize);
+        hf->hFile    = INVALID_HANDLE_VALUE;
+        hf->ha       = ha;
+        hf->pBlockEx = pBlockEx;
+        hf->pBlock   = pBlock;
+        hf->nBlocks  = (hf->pBlock->dwFSize + ha->dwBlockSize - 1) / ha->dwBlockSize;
+        hf->pHash    = pHash;
+        
+        hf->MpqFilePos.HighPart = pBlockEx->wFilePosHigh;
+        hf->MpqFilePos.LowPart = pBlock->dwFilePos;
+        hf->MpqFilePos.QuadPart += ha->MpqPos.QuadPart;
+
+        hf->dwHashIndex = dwHashIndex;
+        hf->dwFileIndex = dwBlockIndex; 
+
+        // Allocate buffers for decompression.
+        if(hf->pBlock->dwFlags & MPQ_FILE_COMPRESSED)
+        {
+            // Allocate buffer for block positions. At the begin of file are stored
+            // DWORDs holding positions of each block relative from begin of file in the archive
+            // As for newer MPQs, there may be one additional entry in the block table
+            // (if the MPQ_FILE_HAS_EXTRA flag is set).
+            // Allocate the buffer to include this DWORD as well
+            
+            if((hf->pdwBlockPos = ALLOCMEM(DWORD, hf->nBlocks + 2)) == NULL)
+                nError = ERROR_NOT_ENOUGH_MEMORY;
+        }
+        
+        // Decrypt file seed. Cannot be used if the file is given by index
+        if(dwSearchScope != SFILE_OPEN_BY_INDEX)
+        {
+            if(hf->pBlock->dwFlags & MPQ_FILE_ENCRYPTED)
+            {
+                const char * szTemp = strrchr(szFileName, '\\');
+
+                strcpy(hf->szFileName, szFileName);
+                if(szTemp != NULL)
+                    szFileName = szTemp + 1;
+                hf->dwSeed1 = DecryptFileSeed((char *)szFileName);
+
+                if(hf->pBlock->dwFlags & MPQ_FILE_FIXSEED)
+                {
+                    hf->dwSeed1 = (hf->dwSeed1 + hf->pBlock->dwFilePos) ^ hf->pBlock->dwFSize;
+                }
+            }
+        }
+        else
+        {
+            // If the file is encrypted and not compressed, we cannot detect the file seed
+            if(SFileGetFileName(hf, hf->szFileName) == FALSE)
+                nError = GetLastError();
+        }
+    }
+
+    // Cleanup
+    if(nError != ERROR_SUCCESS)
+    {
+        FreeMPQFile(hf);
+        SetLastError(nError);
+    }
+
+    *phFile = hf;
+    return (nError == ERROR_SUCCESS);
+}
+
+//-----------------------------------------------------------------------------
+// BOOL SFileCloseFile(HANDLE hFile);
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileCloseFile(HANDLE hFile)
+{
+    TMPQFile * hf = (TMPQFile *)hFile;
+    
+    if(!IsValidFileHandle(hf))
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return FALSE;
+    }
+
+    // Set the last accessed file in the archive
+    if(hf->ha != NULL)
+        hf->ha->pLastFile = NULL;
+
+    // Free the structure
+    FreeMPQFile(hf);
+    return TRUE;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/SFileReadFile.cpp b/contrib/vmap_extractor_v2/stormlib/SFileReadFile.cpp
new file mode 100644
index 00000000000..27fd1e0f085
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SFileReadFile.cpp
@@ -0,0 +1,826 @@
+/*****************************************************************************/
+/* SFileReadFile.cpp                      Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Description :                                                             */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* xx.xx.99  1.00  Lad  The first version of SFileReadFile.cpp               */
+/* 24.03.99  1.00  Lad  Added the SFileGetFileInfo function                  */
+/*****************************************************************************/
+
+#define __STORMLIB_SELF__
+#include "StormLib.h"
+#include "SCommon.h"
+
+//-----------------------------------------------------------------------------
+// Defines
+
+#define ID_WAVE     0x46464952          // Signature of WAVes for name breaking
+#define ID_EXE      0x00005A4D          // Signature of executable files
+
+//-----------------------------------------------------------------------------
+// Local structures
+
+struct TID2Ext
+{
+    DWORD dwID;
+    char * szExt;
+};
+
+//-----------------------------------------------------------------------------
+// ReadMPQBlock
+//
+//  hf          - MPQ File handle.
+//  dwBlockPos  - Position of block in the file (relative to file begin)
+//  buffer      - Pointer to target buffer to store blocks.
+//  dwBlockSize - Number of bytes to read. Must be multiplier of block size.
+//
+//  Returns number of bytes read.
+
+// TODO: Test for archives > 4GB
+static DWORD WINAPI ReadMPQBlocks(TMPQFile * hf, DWORD dwBlockPos, BYTE * buffer, DWORD blockBytes)
+{
+    LARGE_INTEGER FilePos;
+    TMPQArchive * ha = hf->ha;          // Archive handle
+    BYTE  * tempBuffer = NULL;          // Buffer for reading compressed data from the file
+    DWORD   dwFilePos = dwBlockPos;     // Reading position from the file
+    DWORD   dwToRead;                   // Number of bytes to read
+    DWORD   blockNum;                   // Block number (needed for decrypt)
+    DWORD   dwBytesRead = 0;            // Total number of bytes read
+    DWORD   bytesRemain = 0;            // Number of data bytes remaining up to the end of the file
+    DWORD   nBlocks;                    // Number of blocks to load
+    DWORD   i;
+
+    // Test parameters. Block position and block size must be block-aligned, block size nonzero
+    if((dwBlockPos & (ha->dwBlockSize - 1)) || blockBytes == 0)
+        return 0;
+
+    // Check the end of file
+    if((dwBlockPos + blockBytes) > hf->pBlock->dwFSize)
+        blockBytes = hf->pBlock->dwFSize - dwBlockPos;
+
+    bytesRemain = hf->pBlock->dwFSize - dwBlockPos;
+    blockNum    = dwBlockPos / ha->dwBlockSize;
+    nBlocks     = blockBytes / ha->dwBlockSize;
+    if(blockBytes % ha->dwBlockSize)
+        nBlocks++;
+
+    // If file has variable block positions, we have to load them
+    if((hf->pBlock->dwFlags & MPQ_FILE_COMPRESSED) && hf->bBlockPosLoaded == FALSE)
+    {
+        // Move file pointer to the begin of the file in the MPQ
+        if(hf->MpqFilePos.QuadPart != ha->FilePointer.QuadPart)
+        {
+            SetFilePointer(ha->hFile, hf->MpqFilePos.LowPart, &hf->MpqFilePos.HighPart, FILE_BEGIN);
+        }
+
+        // Read block positions from begin of file.
+        dwToRead = (hf->nBlocks+1) * sizeof(DWORD);
+        if(hf->pBlock->dwFlags & MPQ_FILE_HAS_EXTRA)
+            dwToRead += sizeof(DWORD);
+
+        // Read the block pos table and convert the buffer to little endian
+        ReadFile(ha->hFile, hf->pdwBlockPos, dwToRead, &dwBytesRead, NULL);
+        BSWAP_ARRAY32_UNSIGNED(hf->pdwBlockPos, (hf->nBlocks+1));
+
+        //
+        // If the archive if protected some way, perform additional check
+        // Sometimes, the file appears not to be encrypted, but it is.
+        //
+        // Note: In WoW 1.10+, there's a new flag. With this flag present,
+        // there's one additional entry in the block table.
+        //
+
+        if(hf->pdwBlockPos[0] != dwBytesRead)
+            hf->pBlock->dwFlags |= MPQ_FILE_ENCRYPTED;
+
+        // Decrypt loaded block positions if necessary
+        if(hf->pBlock->dwFlags & MPQ_FILE_ENCRYPTED)
+        {
+            // If we don't know the file seed, try to find it.
+            if(hf->dwSeed1 == 0)
+                hf->dwSeed1 = DetectFileSeed(hf->pdwBlockPos, dwBytesRead);
+
+            // If we don't know the file seed, sorry but we cannot extract the file.
+            if(hf->dwSeed1 == 0)
+                return 0;
+
+            // Decrypt block positions
+            DecryptMPQBlock(hf->pdwBlockPos, dwBytesRead, hf->dwSeed1 - 1);
+
+            // Check if the block positions are correctly decrypted
+            // I don't know why, but sometimes it will result invalid block positions on some files
+            if(hf->pdwBlockPos[0] != dwBytesRead)
+            {
+                // Try once again to detect file seed and decrypt the blocks
+                // TODO: Test with >4GB
+                SetFilePointer(ha->hFile, hf->MpqFilePos.LowPart, &hf->MpqFilePos.HighPart, FILE_BEGIN);
+                ReadFile(ha->hFile, hf->pdwBlockPos, dwToRead, &dwBytesRead, NULL);
+
+                BSWAP_ARRAY32_UNSIGNED(hf->pdwBlockPos, (hf->nBlocks+1));
+                hf->dwSeed1 = DetectFileSeed(hf->pdwBlockPos, dwBytesRead);
+                DecryptMPQBlock(hf->pdwBlockPos, dwBytesRead, hf->dwSeed1 - 1);
+
+                // Check if the block positions are correctly decrypted
+                if(hf->pdwBlockPos[0] != dwBytesRead)
+                    return 0;
+            }
+        }
+
+        // Update hf's variables
+        ha->FilePointer.QuadPart = hf->MpqFilePos.QuadPart + dwBytesRead;
+        hf->bBlockPosLoaded = TRUE;
+    }
+
+    // Get file position and number of bytes to read
+    dwFilePos = dwBlockPos;
+    dwToRead  = blockBytes;
+    if(hf->pBlock->dwFlags & MPQ_FILE_COMPRESSED)
+    {
+        dwFilePos = hf->pdwBlockPos[blockNum];
+        dwToRead  = hf->pdwBlockPos[blockNum + nBlocks] - dwFilePos;
+    }
+    FilePos.QuadPart = hf->MpqFilePos.QuadPart + dwFilePos;
+
+    // Get work buffer for store read data
+    tempBuffer = buffer;
+    if(hf->pBlock->dwFlags & MPQ_FILE_COMPRESSED)
+    {
+        if((tempBuffer = ALLOCMEM(BYTE, dwToRead)) == NULL)
+        {
+            SetLastError(ERROR_NOT_ENOUGH_MEMORY);
+            return 0;
+        }
+    }
+
+    // Set file pointer, if necessary 
+    if(ha->FilePointer.QuadPart != FilePos.QuadPart) 
+    {
+        SetFilePointer(ha->hFile, FilePos.LowPart, &FilePos.HighPart, FILE_BEGIN);
+    }
+
+    // 15018F87 : Read all requested blocks
+    ReadFile(ha->hFile, tempBuffer, dwToRead, &dwBytesRead, NULL);
+    ha->FilePointer.QuadPart = FilePos.QuadPart + dwBytesRead;
+
+    // Block processing part.
+    DWORD blockStart = 0;               // Index of block start in work buffer
+    DWORD blockSize  = min(blockBytes, ha->dwBlockSize);
+    DWORD index      = blockNum;        // Current block index
+
+    dwBytesRead = 0;                      // Clear read byte counter
+
+    // Walk through all blocks
+    for(i = 0; i < nBlocks; i++, index++)
+    {
+        BYTE * inputBuffer = tempBuffer + blockStart;
+        int    outLength = ha->dwBlockSize;
+
+        if(bytesRemain < (DWORD)outLength)
+            outLength = bytesRemain;
+
+        // Get current block length
+        if(hf->pBlock->dwFlags & MPQ_FILE_COMPRESSED)
+            blockSize = hf->pdwBlockPos[index+1] - hf->pdwBlockPos[index];
+
+        // If block is encrypted, we have to decrypt it.
+        if(hf->pBlock->dwFlags & MPQ_FILE_ENCRYPTED)
+        {
+            BSWAP_ARRAY32_UNSIGNED((DWORD *)inputBuffer, blockSize / sizeof(DWORD));
+
+            // If we don't know the seed, try to decode it as WAVE file
+            if(hf->dwSeed1 == 0)
+                hf->dwSeed1 = DetectFileSeed2((DWORD *)inputBuffer, 3, ID_WAVE, hf->pBlock->dwFSize - 8, 0x45564157);
+
+            // Let's try MSVC's standard EXE or header
+            if(hf->dwSeed1 == 0)
+                hf->dwSeed1 = DetectFileSeed2((DWORD *)inputBuffer, 2, 0x00905A4D, 0x00000003);
+
+            if(hf->dwSeed1 == 0)
+                return 0;
+
+            DecryptMPQBlock((DWORD *)inputBuffer, blockSize, hf->dwSeed1 + index);
+            BSWAP_ARRAY32_UNSIGNED((DWORD *)inputBuffer, blockSize / sizeof(DWORD));
+        }
+
+        // If the block is really compressed, decompress it.
+        // WARNING : Some block may not be compressed, it can be determined only
+        // by comparing uncompressed and compressed size !!!
+        if(blockSize < (DWORD)outLength)
+        {
+            // Is the file compressed with PKWARE Data Compression Library ?
+            if(hf->pBlock->dwFlags & MPQ_FILE_COMPRESS_PKWARE)
+                Decompress_pklib((char *)buffer, &outLength, (char *)inputBuffer, (int)blockSize);
+
+            // Is it a file compressed by Blizzard's multiple compression ?
+            // Note that Storm.dll v 1.0.9 distributed with Warcraft III
+            // passes the full path name of the opened archive as the new last parameter
+            if(hf->pBlock->dwFlags & MPQ_FILE_COMPRESS_MULTI)
+                SCompDecompress((char *)buffer, &outLength, (char *)inputBuffer, (int)blockSize);
+            dwBytesRead += outLength;
+            buffer    += outLength;
+        }
+        else
+        {
+            if(buffer != inputBuffer)
+                memcpy(buffer, inputBuffer, blockSize);
+
+            dwBytesRead += blockSize;
+            buffer    += blockSize;
+        }
+        blockStart  += blockSize;
+        bytesRemain -= outLength;
+    }
+
+    // Delete input buffer, if necessary
+    if(hf->pBlock->dwFlags & MPQ_FILE_COMPRESSED)
+        FREEMEM(tempBuffer);
+
+    return dwBytesRead;
+}
+
+// When this function is called, it is already ensured that the parameters are valid
+// (e.g. the "dwToRead + dwFilePos" is not greater than the file size)
+// TODO: Test for archives > 4GB
+static DWORD WINAPI ReadMPQFileSingleUnit(TMPQFile * hf, DWORD dwFilePos, BYTE * pbBuffer, DWORD dwToRead)
+{
+    TMPQArchive * ha = hf->ha; 
+    DWORD dwBytesRead = 0;
+
+    if(ha->FilePointer.QuadPart != hf->MpqFilePos.QuadPart)
+    {
+        SetFilePointer(ha->hFile, hf->MpqFilePos.LowPart, &hf->MpqFilePos.HighPart, FILE_BEGIN);
+        ha->FilePointer = hf->MpqFilePos;
+    }
+
+    // If the file is really compressed, decompress it.
+    // Otherwise, read the data as-is to the caller.
+    if(hf->pBlock->dwCSize < hf->pBlock->dwFSize)
+    {
+        if(hf->pbFileBuffer == NULL)
+        {
+            BYTE * inputBuffer = NULL;
+            int outputBufferSize = (int)hf->pBlock->dwFSize;
+            int inputBufferSize = (int)hf->pBlock->dwCSize;
+
+            hf->pbFileBuffer = ALLOCMEM(BYTE, outputBufferSize);
+            inputBuffer = ALLOCMEM(BYTE, inputBufferSize);
+            if(inputBuffer != NULL && hf->pbFileBuffer != NULL)
+            {
+                // Read the compressed file data
+                ReadFile(ha->hFile, inputBuffer, inputBufferSize, &dwBytesRead, NULL);
+
+                // Is the file compressed with PKWARE Data Compression Library ?
+                if(hf->pBlock->dwFlags & MPQ_FILE_COMPRESS_PKWARE)
+                    Decompress_pklib((char *)hf->pbFileBuffer, &outputBufferSize, (char *)inputBuffer, (int)inputBufferSize);
+
+                // Is it a file compressed by Blizzard's multiple compression ?
+                // Note that Storm.dll v 1.0.9 distributed with Warcraft III
+                // passes the full path name of the opened archive as the new last parameter
+                if(hf->pBlock->dwFlags & MPQ_FILE_COMPRESS_MULTI)
+                    SCompDecompress((char *)hf->pbFileBuffer, &outputBufferSize, (char *)inputBuffer, (int)inputBufferSize);
+            }
+
+            // Free the temporary buffer
+            if(inputBuffer != NULL)
+                FREEMEM(inputBuffer);
+        }
+
+        // Copy the file data, if any there
+        if(hf->pbFileBuffer != NULL)
+        {
+            memcpy(pbBuffer, hf->pbFileBuffer + dwFilePos, dwToRead);
+            dwBytesRead += dwToRead;
+        }
+    }
+    else
+    {
+        // Read the uncompressed file data
+        ReadFile(ha->hFile, pbBuffer, dwToRead, &dwBytesRead, NULL);
+        dwBytesRead = (int)dwBytesRead;
+    }
+
+    return (DWORD)dwBytesRead;
+}
+
+
+//-----------------------------------------------------------------------------
+// ReadMPQFile
+
+// TODO: Test for archives > 4GB
+static DWORD WINAPI ReadMPQFile(TMPQFile * hf, DWORD dwFilePos, BYTE * pbBuffer, DWORD dwToRead)
+{
+    TMPQArchive * ha = hf->ha; 
+    TMPQBlock * pBlock = hf->pBlock; // Pointer to file block
+    DWORD dwBytesRead = 0;           // Number of bytes read from the file
+    DWORD dwBlockPos;                // Position in the file aligned to the whole blocks
+    DWORD dwLoaded;
+
+    // File position is greater or equal to file size ?
+    if(dwFilePos >= pBlock->dwFSize)
+        return dwBytesRead;
+
+    // If too few bytes in the file remaining, cut them
+    if((pBlock->dwFSize - dwFilePos) < dwToRead)
+        dwToRead = (pBlock->dwFSize - dwFilePos);
+
+    // If the file is stored as single unit, handle it separately
+    if(pBlock->dwFlags & MPQ_FILE_SINGLE_UNIT)
+        return ReadMPQFileSingleUnit(hf, dwFilePos, pbBuffer, dwToRead);
+
+    // Block position in the file
+    dwBlockPos = dwFilePos & ~(ha->dwBlockSize - 1);  // Position in the block
+
+    // Load the first block, if incomplete. It may be loaded in the cache buffer.
+    // We have to check if this block is loaded. If not, load it.
+    if((dwFilePos % ha->dwBlockSize) != 0)
+    {
+        // Number of bytes remaining in the buffer
+        DWORD dwToCopy;
+        DWORD dwLoaded = ha->dwBlockSize;
+
+        // Check if data are loaded in the cache
+        if(hf != ha->pLastFile || dwBlockPos != ha->dwBlockPos)
+        {
+            // Load one MPQ block into archive buffer
+            dwLoaded = ReadMPQBlocks(hf, dwBlockPos, ha->pbBlockBuffer, ha->dwBlockSize);
+            if(dwLoaded == 0)
+                return (DWORD)-1;
+
+            // Save lastly accessed file and block position for later use
+            ha->pLastFile  = hf;
+            ha->dwBlockPos = dwBlockPos;
+            ha->dwBuffPos  = dwFilePos % ha->dwBlockSize;
+        }
+        dwToCopy = dwLoaded - ha->dwBuffPos;
+        if(dwToCopy > dwToRead)
+            dwToCopy = dwToRead;
+
+        // Copy data from block buffer into target buffer
+        memcpy(pbBuffer, ha->pbBlockBuffer + ha->dwBuffPos, dwToCopy);
+    
+        // Update pointers
+        dwToRead      -= dwToCopy;
+        dwBytesRead   += dwToCopy;
+        pbBuffer      += dwToCopy;
+        dwBlockPos    += ha->dwBlockSize;
+        ha->dwBuffPos += dwToCopy;
+
+        // If all, return.
+        if(dwToRead == 0)
+            return dwBytesRead;
+    }
+
+    // Load the whole ("middle") blocks only if there are more or equal one block
+    if(dwToRead > ha->dwBlockSize)
+    {                                           
+        DWORD dwBlockBytes = dwToRead & ~(ha->dwBlockSize - 1);
+
+        dwLoaded = ReadMPQBlocks(hf, dwBlockPos, pbBuffer, dwBlockBytes);
+        if(dwLoaded == 0)
+            return (DWORD)-1;
+
+        // Update pointers
+        dwToRead    -= dwLoaded;
+        dwBytesRead += dwLoaded;
+        pbBuffer    += dwLoaded;
+        dwBlockPos  += dwLoaded;
+
+        // If all, return.
+        if(dwToRead == 0)
+            return dwBytesRead;
+    }
+
+    // Load the terminating block
+    if(dwToRead > 0)
+    {
+        DWORD dwToCopy = ha->dwBlockSize;
+
+        // Check if data are loaded in the cache
+        if(hf != ha->pLastFile || dwBlockPos != ha->dwBlockPos)
+        {
+            // Load one MPQ block into archive buffer
+            dwToCopy = ReadMPQBlocks(hf, dwBlockPos, ha->pbBlockBuffer, ha->dwBlockSize);
+            if(dwToCopy == 0)
+                return (DWORD)-1;
+
+            // Save lastly accessed file and block position for later use
+            ha->pLastFile  = hf;
+            ha->dwBlockPos = dwBlockPos;
+        }
+        ha->dwBuffPos  = 0;
+
+        // Check number of bytes read
+        if(dwToCopy > dwToRead)
+            dwToCopy = dwToRead;
+
+        memcpy(pbBuffer, ha->pbBlockBuffer, dwToCopy);
+        dwBytesRead  += dwToCopy;
+        ha->dwBuffPos = dwToCopy;
+    }
+    
+    // Return what we've read
+    return dwBytesRead;
+}
+
+//-----------------------------------------------------------------------------
+// SFileReadFile
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileReadFile(HANDLE hFile, VOID * lpBuffer, DWORD dwToRead, DWORD * pdwRead, LPOVERLAPPED lpOverlapped)
+{
+    TMPQFile * hf = (TMPQFile *)hFile;
+    DWORD dwBytes = 0;                  // Number of bytes (for everything)
+    int nError = ERROR_SUCCESS;
+
+    // Zero the number of bytes read
+    if(pdwRead != NULL)
+        *pdwRead = 0;
+
+    // Check valid parameters
+    if(nError == ERROR_SUCCESS)
+    {
+        if(hf == NULL || lpBuffer == NULL)
+            nError = ERROR_INVALID_PARAMETER;
+    }
+
+    // If direct access to the file, use Win32 for reading
+    if(nError == ERROR_SUCCESS && hf->hFile != INVALID_HANDLE_VALUE)
+    {
+        DWORD dwTransferred;
+
+        ReadFile(hf->hFile, lpBuffer, dwToRead, &dwTransferred, lpOverlapped);
+        if(dwTransferred < dwToRead)
+        {
+            SetLastError(ERROR_HANDLE_EOF);
+            return FALSE;
+        }
+        
+        if(pdwRead != NULL)
+            *pdwRead = dwTransferred;
+        return TRUE;
+    }
+
+    // Read all the bytes available in the buffer (If any)
+    if(nError == ERROR_SUCCESS)
+    {
+        if(dwToRead > 0)
+        {
+            dwBytes = ReadMPQFile(hf, hf->dwFilePos, (BYTE *)lpBuffer, dwToRead);
+            if(dwBytes == (DWORD)-1)
+            {
+                SetLastError(ERROR_CAN_NOT_COMPLETE);
+                return FALSE;
+            }
+            hf->ha->pLastFile = hf;
+            hf->dwFilePos += dwBytes;
+        }
+        if(pdwRead != NULL)
+            *pdwRead = dwBytes;
+    }
+
+    // Check number of bytes read. If not OK, return FALSE.
+    if(dwBytes < dwToRead)
+    {
+        SetLastError(ERROR_HANDLE_EOF);
+        return FALSE;
+    }
+    return TRUE;
+}
+
+//-----------------------------------------------------------------------------
+// SFileGetFilePos
+//
+// Returns position of archive file in the archive (relative to begin of file)
+
+// TODO: Test for archives > 4GB
+DWORD WINAPI SFileGetFilePos(HANDLE hFile, DWORD * pdwFilePosHigh)
+{
+    TMPQFile * hf = (TMPQFile *)hFile;
+    
+    if(pdwFilePosHigh != NULL)
+        *pdwFilePosHigh = 0;
+
+    if(hf == NULL)
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return (DWORD)-1;
+    }
+
+    // If opened as plain file, ...
+    if(hf->hFile != INVALID_HANDLE_VALUE)
+        return 0;
+
+    // If opened from archive, return file size
+    if(pdwFilePosHigh != NULL)
+        *pdwFilePosHigh = hf->MpqFilePos.HighPart;
+    return hf->MpqFilePos.LowPart;
+}
+
+//-----------------------------------------------------------------------------
+// SFileGetFileSize
+
+// TODO: Test for archives > 4GB
+DWORD WINAPI SFileGetFileSize(HANDLE hFile, DWORD * pdwFileSizeHigh)
+{
+    TMPQFile * hf = (TMPQFile *)hFile;
+    
+    if(pdwFileSizeHigh != NULL)
+        *pdwFileSizeHigh = 0;
+
+    if(hf == NULL)
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return (DWORD)-1;
+    }
+
+    // If opened as plain file, ...
+    if(hf->hFile != INVALID_HANDLE_VALUE)
+        return GetFileSize(hf->hFile, pdwFileSizeHigh);
+
+    // If opened from archive, return file size
+    return hf->pBlock->dwFSize;
+}
+
+// TODO: Test for archives > 4GB
+DWORD WINAPI SFileSetFilePointer(HANDLE hFile, LONG lFilePos, LONG * pdwFilePosHigh, DWORD dwMethod)
+{
+    TMPQArchive * ha;
+    TMPQFile * hf = (TMPQFile *)hFile;
+
+    if(hf == NULL || (pdwFilePosHigh != NULL && *pdwFilePosHigh != 0))
+    {
+        SetLastError(ERROR_INVALID_PARAMETER);
+        return (DWORD)-1;
+    }
+
+    // If opened as plain file, call Win32 API
+    if(hf->hFile != INVALID_HANDLE_VALUE)
+        return SetFilePointer(hf->hFile, lFilePos, pdwFilePosHigh, dwMethod);
+    ha = hf->ha;
+
+    switch(dwMethod)
+    {
+        case FILE_BEGIN:
+            // Cannot set pointer before begin of file
+            if(-lFilePos > (LONG)hf->dwFilePos)
+                hf->dwFilePos = 0;
+            else
+                hf->dwFilePos = lFilePos;
+            break;
+
+        case FILE_CURRENT:
+            // Cannot set pointer before begin of file
+            if(-lFilePos > (LONG)hf->dwFilePos)
+                hf->dwFilePos = 0;
+            else
+                hf->dwFilePos += lFilePos;
+            break;
+
+        case FILE_END:
+            // Cannot set file position before begin of file
+            if(-lFilePos >= (LONG)hf->pBlock->dwFSize)
+                hf->dwFilePos = 0;
+            else
+                hf->dwFilePos = hf->pBlock->dwFSize + lFilePos;
+            break;
+
+        default:
+            return ERROR_INVALID_PARAMETER;
+    }
+
+    if(hf == ha->pLastFile && (hf->dwFilePos & ~(ha->dwBlockSize - 1)) == ha->dwBlockPos)
+        ha->dwBuffPos = hf->dwFilePos & (ha->dwBlockSize - 1);
+    else
+    {
+        ha->pLastFile = NULL;
+        ha->dwBuffPos = 0;
+    }
+
+    return hf->dwFilePos;
+}
+
+//-----------------------------------------------------------------------------
+// Tries to retrieve the file name
+
+static TID2Ext id2ext[] = 
+{
+    {0x1A51504D, "mpq"},                // MPQ archive header ID ('MPQ\x1A')
+    {0x46464952, "wav"},                // WAVE header 'RIFF'
+    {0x324B4D53, "smk"},                // Old "Smacker Video" files 'SMK2'
+    {0x694B4942, "bik"},                // Bink video files (new)
+    {0x0801050A, "pcx"},                // PCX images used in Diablo I
+    {0x544E4F46, "fnt"},                // Font files used in Diablo II
+    {0x6D74683C, "html"},               // HTML '<htm'
+    {0x4D54483C, "html"},               // HTML '<HTM
+    {0x216F6F57, "tbl"},                // Table files
+    {0x31504C42, "blp"},                // BLP textures
+    {0x32504C42, "blp"},                // BLP textures (v2)
+    {0x584C444D, "mdx"},                // MDX files
+    {0x45505954, "pud"},                // Warcraft II maps
+    {0x38464947, "gif"},                // GIF images 'GIF8'
+    {0x3032444D, "m2"},                 // WoW ??? .m2
+    {0x43424457, "dbc"},                // ??? .dbc
+    {0x47585053, "bls"},                // WoW pixel shaders
+    {0, NULL}                           // Terminator 
+};
+
+// TODO: Test for archives > 4GB
+BOOL WINAPI SFileGetFileName(HANDLE hFile, char * szFileName)
+{
+    TMPQFile * hf = (TMPQFile *)hFile;  // MPQ File handle
+    char * szExt = "xxx";               // Default extension
+    DWORD dwFirstBytes[2];              // The first 4 bytes of the file
+    DWORD dwFilePos;                    // Saved file position
+    int nError = ERROR_SUCCESS;
+    int i;
+
+    // Pre-zero the output buffer
+    if(szFileName != NULL)
+        *szFileName = 0;
+
+    // Check valid parameters
+    if(nError == ERROR_SUCCESS)
+    {
+        if(hf == NULL || szFileName == NULL)
+            nError = ERROR_INVALID_PARAMETER;
+    }
+    
+    // If the file name is already filled, return it.
+    if(nError == ERROR_SUCCESS && *hf->szFileName != 0)
+    {
+        if(szFileName != hf->szFileName)
+            strcpy(szFileName, hf->szFileName);
+        return TRUE;
+    }
+
+    if(nError == ERROR_SUCCESS)
+    {
+        if(hf->dwFileIndex == (DWORD)-1)
+            nError = ERROR_CAN_NOT_COMPLETE;
+    }
+
+    // Read the first 8 bytes from the file
+    if(nError == ERROR_SUCCESS)
+    {
+        dwFirstBytes[0] = dwFirstBytes[1] = 0;
+        dwFilePos = SFileSetFilePointer(hf, 0, NULL, FILE_CURRENT);   
+        if(!SFileReadFile(hFile, &dwFirstBytes, sizeof(dwFirstBytes), NULL))
+            nError = GetLastError();
+        BSWAP_ARRAY32_UNSIGNED(dwFirstBytes, sizeof(dwFirstBytes) / sizeof(DWORD));
+        SFileSetFilePointer(hf, dwFilePos, NULL, FILE_BEGIN);
+    }
+
+    if(nError == ERROR_SUCCESS)
+    {
+        if((dwFirstBytes[0] & 0x0000FFFF) == ID_EXE)
+            szExt = "exe";
+        else if(dwFirstBytes[0] == 0x00000006 && dwFirstBytes[1] == 0x00000001)
+            szExt = "dc6";
+        else
+        {
+            for(i = 0; id2ext[i].szExt != NULL; i++)
+            {
+                if(id2ext[i].dwID == dwFirstBytes[0])
+                {
+                    szExt = id2ext[i].szExt;
+                    break;
+                }
+            }
+        }
+
+        // Create the file name
+        sprintf(hf->szFileName, "File%08lu.%s", hf->dwFileIndex, szExt);
+        if(szFileName != hf->szFileName)
+            strcpy(szFileName, hf->szFileName);
+    }
+    return (nError == ERROR_SUCCESS);
+}
+
+//-----------------------------------------------------------------------------
+// Retrieves an information about an archive or about a file within the archive
+//
+//  hMpqOrFile - Handle to an MPQ archive or to a file
+//  dwInfoType - Information to obtain
+
+// TODO: Test for archives > 4GB
+DWORD_PTR WINAPI SFileGetFileInfo(HANDLE hMpqOrFile, DWORD dwInfoType)
+{
+    TMPQArchive * ha = (TMPQArchive *)hMpqOrFile;
+    TMPQFile    * hf = (TMPQFile *)hMpqOrFile;
+    TMPQBlock   * pBlockEnd;
+    TMPQBlock   * pBlock;
+    DWORD dwFileCount = 0;
+    DWORD dwSeed;
+
+    switch(dwInfoType)
+    {
+        case SFILE_INFO_ARCHIVE_SIZE:
+            if(IsValidMpqHandle(ha))
+                return ha->pHeader->dwArchiveSize;
+            break;
+
+        case SFILE_INFO_HASH_TABLE_SIZE: // Size of the hash table
+            if(IsValidMpqHandle(ha))
+                return ha->pHeader->dwHashTableSize;
+            break;
+
+        case SFILE_INFO_BLOCK_TABLE_SIZE: // Size of the hash table
+            if(IsValidMpqHandle(ha))
+                return ha->pHeader->dwBlockTableSize;
+            break;
+
+        case SFILE_INFO_BLOCK_SIZE:
+            if(IsValidMpqHandle(ha))
+                return ha->dwBlockSize;
+            break;
+
+        case SFILE_INFO_HASH_TABLE:
+            if(IsValidMpqHandle(ha))
+                return (DWORD_PTR)ha->pHashTable;
+            break;
+
+        case SFILE_INFO_BLOCK_TABLE:
+            if(IsValidMpqHandle(ha))
+                return (DWORD_PTR)ha->pBlockTable;
+            break;
+
+        case SFILE_INFO_NUM_FILES:
+            if(IsValidMpqHandle(ha))
+            {
+                pBlockEnd = ha->pBlockTable + ha->pHeader->dwBlockTableSize;
+                for(pBlock = ha->pBlockTable; pBlock < pBlockEnd; pBlock++)
+                {
+                    if(pBlock->dwFlags & MPQ_FILE_EXISTS)
+                        dwFileCount++;
+                }
+                return dwFileCount;
+            }
+            break;
+
+        case SFILE_INFO_HASH_INDEX:
+            if(IsValidFileHandle(hf))
+                return hf->dwHashIndex;
+            break;
+
+        case SFILE_INFO_CODENAME1:
+            if(IsValidFileHandle(hf))
+                return hf->pHash->dwName1;
+            break;
+
+        case SFILE_INFO_CODENAME2:
+            if(IsValidFileHandle(hf))
+                return hf->pHash->dwName2;
+            break;
+
+        case SFILE_INFO_LOCALEID:
+            if(IsValidFileHandle(hf))
+                return hf->pHash->lcLocale;
+            break;
+
+        case SFILE_INFO_BLOCKINDEX:
+            if(IsValidFileHandle(hf))
+                return hf->dwFileIndex;
+            break;
+
+        case SFILE_INFO_FILE_SIZE:
+            if(IsValidFileHandle(hf))
+                return hf->pBlock->dwFSize;
+            break;
+
+        case SFILE_INFO_COMPRESSED_SIZE:
+            if(IsValidFileHandle(hf))
+                return hf->pBlock->dwCSize;
+            break;
+
+        case SFILE_INFO_FLAGS:
+            if(IsValidFileHandle(hf))
+                return hf->pBlock->dwFlags;
+            break;
+
+        case SFILE_INFO_POSITION:
+            if(IsValidFileHandle(hf))
+                return hf->pBlock->dwFilePos;
+            break;
+
+        case SFILE_INFO_SEED:
+            if(IsValidFileHandle(hf))
+                return hf->dwSeed1;
+            break;
+
+        case SFILE_INFO_SEED_UNFIXED:
+            if(IsValidFileHandle(hf))
+            {
+                dwSeed = hf->dwSeed1;
+                if(hf->pBlock->dwFlags & MPQ_FILE_FIXSEED)
+                    dwSeed = (dwSeed ^ hf->pBlock->dwFSize) - (DWORD)(hf->MpqFilePos.QuadPart - hf->ha->MpqPos.QuadPart);
+                return dwSeed;
+            }
+            break;
+    }
+
+    // Unknown parameter or invalid handle
+    SetLastError(ERROR_INVALID_PARAMETER);
+    return 0xFFFFFFFF;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/SListFile.cpp b/contrib/vmap_extractor_v2/stormlib/SListFile.cpp
new file mode 100644
index 00000000000..c3723d17dcd
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/SListFile.cpp
@@ -0,0 +1,561 @@
+/*****************************************************************************/
+/* SListFile.cpp                          Copyright (c) Ladislav Zezula 2004 */
+/*---------------------------------------------------------------------------*/
+/* Description:                                                              */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 12.06.04  1.00  Lad  The first version of SListFile.cpp                   */
+/*****************************************************************************/
+
+#define __STORMLIB_SELF__
+#include "StormLib.h"
+#include "SCommon.h"
+#include <assert.h>
+
+//-----------------------------------------------------------------------------
+// Listfile entry structure
+
+#define LISTFILE_CACHE_SIZE 0x1000      // Size of one cache element
+#define NO_MORE_CHARACTERS 256
+#define HASH_TABLE_SIZE    31           // Initial hash table size (should be a prime number)
+
+// TODO: Check on x64 !!!
+#define LISTFILE_ENTRY_DELETED   (DWORD_PTR)(-2)
+#define LISTFILE_ENTRY_FREE      (DWORD_PTR)(-1)
+
+struct TListFileCache
+{
+    HANDLE  hFile;                      // Stormlib file handle
+    char  * szMask;                     // File mask
+    DWORD   dwFileSize;                 // Total size of the cached file
+    DWORD   dwBuffSize;                 // File of the cache
+    DWORD   dwFilePos;                  // Position of the cache in the file
+    BYTE  * pBegin;                     // The begin of the listfile cache
+    BYTE  * pPos;
+    BYTE  * pEnd;                       // The last character in the file cache
+
+    BYTE Buffer[1];                     // Listfile cache itself
+};
+
+//-----------------------------------------------------------------------------
+// Local functions (cache)
+
+// Reloads the cache. Returns number of characters
+// that has been loaded into the cache.
+static int ReloadCache(TListFileCache * pCache)
+{
+    // Check if there is enough characters in the cache
+    // If not, we have to reload the next block
+    if(pCache->pPos >= pCache->pEnd)
+    {
+        // If the cache is already at the end, do nothing more
+        if((pCache->dwFilePos + pCache->dwBuffSize) >= pCache->dwFileSize)
+            return 0;
+
+        pCache->dwFilePos += pCache->dwBuffSize;
+        SFileReadFile(pCache->hFile, pCache->Buffer, pCache->dwBuffSize, &pCache->dwBuffSize, NULL);
+        if(pCache->dwBuffSize == 0)
+            return 0;
+
+        // Set the buffer pointers
+        pCache->pBegin =
+        pCache->pPos = &pCache->Buffer[0];
+        pCache->pEnd = pCache->pBegin + pCache->dwBuffSize;
+    }
+
+    return pCache->dwBuffSize;
+}
+
+static size_t ReadLine(TListFileCache * pCache, char * szLine, int nMaxChars)
+{
+    char * szLineBegin = szLine;
+    char * szLineEnd = szLine + nMaxChars - 1;
+    
+__BeginLoading:
+
+    // Skip newlines, spaces, tabs and another non-printable stuff
+    while(pCache->pPos < pCache->pEnd && *pCache->pPos <= 0x20)
+        pCache->pPos++;
+
+    // Copy the remaining characters
+    while(pCache->pPos < pCache->pEnd && szLine < szLineEnd)
+    {
+        // If we have found a newline, stop loading
+        if(*pCache->pPos == 0x0D || *pCache->pPos == 0x0A)
+            break;
+
+        *szLine++ = *pCache->pPos++;
+    }
+
+    // If we now need to reload the cache, do it
+    if(pCache->pPos == pCache->pEnd)
+    {
+        if(ReloadCache(pCache) > 0)
+            goto __BeginLoading;
+    }
+
+    *szLine = 0;
+    return (szLine - szLineBegin);
+}
+
+//-----------------------------------------------------------------------------
+// Local functions (listfile nodes)
+
+// This function creates the name for the listfile.
+// the file will be created under unique name in the temporary directory
+static void GetListFileName(TMPQArchive * /* ha */, char * szListFile)
+{
+    char szTemp[MAX_PATH];
+
+    // Create temporary file name int TEMP directory
+    GetTempPath(sizeof(szTemp)-1, szTemp);
+    GetTempFileName(szTemp, LISTFILE_NAME, 0, szListFile);
+}
+
+// Creates new listfile. The listfile is an array of TListFileNode
+// structures. The size of the array is the same like the hash table size,
+// the ordering is the same too (listfile item index is the same like
+// the index in the MPQ hash table)
+
+int SListFileCreateListFile(TMPQArchive * ha)
+{
+    DWORD dwItems = ha->pHeader->dwHashTableSize;
+
+    // The listfile should be NULL now
+    assert(ha->pListFile == NULL);
+
+    ha->pListFile = ALLOCMEM(TFileNode *, dwItems);
+    if(ha->pListFile == NULL)
+        return ERROR_NOT_ENOUGH_MEMORY;
+
+    memset(ha->pListFile, 0xFF, dwItems * sizeof(TFileNode *));
+    return ERROR_SUCCESS;
+}
+
+// Adds a filename into the listfile. If the file name is already there,
+// does nothing.
+int SListFileAddNode(TMPQArchive * ha, const char * szFileName)
+{
+    TFileNode * pNode   = NULL;
+    TMPQHash * pHashEnd = ha->pHashTable + ha->pHeader->dwHashTableSize;
+    TMPQHash * pHash0   = GetHashEntry(ha, szFileName);
+    TMPQHash * pHash    = pHash0;
+    DWORD dwHashIndex = 0;
+    size_t nLength;                     // File name lentgth
+    DWORD dwName1;
+    DWORD dwName2;
+
+    // If the file does not exist within the MPQ, do nothing
+    if(pHash == NULL)
+        return ERROR_SUCCESS;
+
+    // If the listfile entry already exists, do nothing
+    dwHashIndex = (DWORD)(pHash - ha->pHashTable);
+    dwName1     = pHash->dwName1;
+    dwName2     = pHash->dwName2;
+    if((DWORD_PTR)ha->pListFile[dwHashIndex] <= LISTFILE_ENTRY_DELETED)
+        return ERROR_SUCCESS;
+    
+    // Create the listfile node and insert it into the listfile table
+    nLength = strlen(szFileName);
+    pNode = (TFileNode *)ALLOCMEM(char, sizeof(TFileNode) + nLength);
+    pNode->dwRefCount = 0;
+    pNode->nLength    = nLength;
+    strcpy(pNode->szFileName, szFileName);
+
+    // Fill the nodes for all language versions
+    while(pHash->dwBlockIndex < LISTFILE_ENTRY_DELETED)
+    {
+        if(pHash->dwName1 == dwName1 && pHash->dwName2 == dwName2)
+        {
+            pNode->dwRefCount++;
+            ha->pListFile[pHash - ha->pHashTable] = pNode;
+        }
+
+        if(++pHash >= pHashEnd)
+            pHash = ha->pHashTable;
+        if(pHash == pHash0)
+            break;
+    }
+
+    return ERROR_SUCCESS;
+}
+
+// Removes a filename from the listfile.
+// If the name is not there, does nothing
+int SListFileRemoveNode(TMPQArchive * ha, const char * szFileName)
+{
+    TFileNode * pNode = NULL;
+    TMPQHash * pHash = GetHashEntry(ha, szFileName);
+    size_t nHashIndex = 0;
+
+    if(pHash != NULL)
+    {
+        nHashIndex = pHash - ha->pHashTable;
+        pNode = ha->pListFile[nHashIndex];
+        ha->pListFile[nHashIndex] = (TFileNode *)LISTFILE_ENTRY_DELETED;
+
+        // If the reference count has reached zero, do nothing
+        if(--pNode->dwRefCount == 0)
+            FREEMEM(pNode);
+    }
+    return ERROR_SUCCESS;
+}
+
+
+// Renames a node. We will not deal with the renaming, we'll simply
+// remove the old node and insert the new one.
+// TODO: Test for archives > 4GB
+int SListFileRenameNode(TMPQArchive * ha, const char * szOldFileName, const char * szNewFileName)
+{
+    SListFileRemoveNode(ha, szOldFileName);
+    return SListFileAddNode(ha, szNewFileName);
+}
+
+// TODO: Test for archives > 4GB
+int SListFileFreeListFile(TMPQArchive * ha)
+{
+    if(ha->pListFile != NULL)
+    {
+        for(DWORD i = 0; i < ha->pHeader->dwHashTableSize; i++)
+        {
+            TFileNode * pNode = ha->pListFile[i];
+
+            if((DWORD_PTR)pNode < LISTFILE_ENTRY_FREE)
+            {
+                if(--pNode->dwRefCount == 0)
+                {
+                    FREEMEM(pNode);
+                    ha->pListFile[i] = (TFileNode *)LISTFILE_ENTRY_FREE;
+                }
+            }
+        }
+
+        FREEMEM(ha->pListFile);
+        ha->pListFile = NULL;
+    }
+
+    return ERROR_SUCCESS;
+}
+
+// Saves the whole listfile into the MPQ.
+// TODO: Test for archives > 4GB
+int SListFileSaveToMpq(TMPQArchive * ha)
+{
+    TFileNode * pNode = NULL;
+    TMPQHash * pHashEnd = NULL;
+    TMPQHash * pHash0 = NULL;
+    TMPQHash * pHash = NULL;
+    HANDLE hFile = INVALID_HANDLE_VALUE;
+    char   szListFile[MAX_PATH];
+    char   szBuffer[MAX_PATH+4];
+    DWORD dwTransferred;
+    size_t nLength = 0;
+    DWORD dwName1 = 0;
+    DWORD dwName2 = 0;
+    LCID lcSave = lcLocale;
+    int  nError = ERROR_SUCCESS;
+
+    // If no listfile, do nothing
+    if(ha->pListFile == NULL)
+        return ERROR_SUCCESS;
+
+    // Create the local listfile
+    if(nError == ERROR_SUCCESS)
+    {
+        GetListFileName(ha, szListFile);
+        hFile = CreateFile(szListFile, GENERIC_READ | GENERIC_WRITE, 0, NULL, CREATE_ALWAYS, FILE_FLAG_DELETE_ON_CLOSE, NULL);
+        if(hFile == INVALID_HANDLE_VALUE)
+            nError = GetLastError();
+    }
+
+    // Find the hash entry corresponding to listfile
+    pHashEnd = ha->pHashTable + ha->pHeader->dwHashTableSize;
+    pHash0 = pHash = GetHashEntry(ha, 0);
+    if(pHash == NULL)
+        pHash0 = pHash = ha->pHashTable;
+
+    // Save the file
+    if(nError == ERROR_SUCCESS)
+    {
+        for(;;)
+        {
+            if(pHash->dwName1 != dwName1 && pHash->dwName2 != dwName2 && pHash->dwBlockIndex < LISTFILE_ENTRY_DELETED)
+            {
+                dwName1 = pHash->dwName1;
+                dwName2 = pHash->dwName2;
+                pNode = ha->pListFile[pHash - ha->pHashTable];
+
+                if((DWORD_PTR)pNode < LISTFILE_ENTRY_DELETED)
+                {
+                    memcpy(szBuffer, pNode->szFileName, pNode->nLength);
+                    szBuffer[pNode->nLength + 0] = 0x0D;
+                    szBuffer[pNode->nLength + 1] = 0x0A;
+                    WriteFile(hFile, szBuffer, (DWORD)(pNode->nLength + 2), &dwTransferred, NULL);
+                }
+            }
+
+            if(++pHash >= pHashEnd)
+                pHash = ha->pHashTable;
+            if(pHash == pHash0)
+                break;
+        }
+
+        // Write the listfile name (if not already there)
+        if(GetHashEntry(ha, LISTFILE_NAME) == NULL)
+        {
+            nLength = strlen(LISTFILE_NAME);
+            memcpy(szBuffer, LISTFILE_NAME, nLength);
+            szBuffer[nLength + 0] = 0x0D;
+            szBuffer[nLength + 1] = 0x0A;
+            WriteFile(hFile, szBuffer, (DWORD)(nLength + 2), &dwTransferred, NULL);
+        }                     
+        
+        // Add the listfile into the archive.
+        SFileSetLocale(LANG_NEUTRAL);
+        nError = AddFileToArchive(ha, hFile, LISTFILE_NAME, MPQ_FILE_COMPRESS_PKWARE | MPQ_FILE_ENCRYPTED | MPQ_FILE_REPLACEEXISTING, 0, SFILE_TYPE_DATA, NULL);
+    }
+
+    // Close the temporary file. This will delete it too.
+    if(hFile != INVALID_HANDLE_VALUE)
+        CloseHandle(hFile);
+
+    lcLocale = lcSave;
+    return nError;
+}
+
+//-----------------------------------------------------------------------------
+// File functions
+
+// Adds a listfile into the MPQ archive.
+// Note that the function does not remove the 
+// TODO: Test for archives > 4GB
+int WINAPI SFileAddListFile(HANDLE hMpq, const char * szListFile)
+{
+    TListFileCache * pCache = NULL;
+    TMPQArchive * ha = (TMPQArchive *)hMpq;
+    HANDLE hListFile = NULL;
+    char  szFileName[MAX_PATH + 1];
+    DWORD dwSearchScope = SFILE_OPEN_LOCAL_FILE;
+    DWORD dwCacheSize = 0;
+    DWORD dwFileSize = 0;
+    size_t nLength = 0;
+    int nError = ERROR_SUCCESS;
+
+    // If the szListFile is NULL, it means we have to open internal listfile
+    if(szListFile == NULL)
+    {
+        szListFile = LISTFILE_NAME;
+        dwSearchScope = SFILE_OPEN_FROM_MPQ;
+    }
+
+    // Open the local/internal listfile
+    if(nError == ERROR_SUCCESS)
+    {
+        if(!SFileOpenFileEx((HANDLE)ha, szListFile, dwSearchScope, &hListFile))
+            nError = GetLastError();
+    }
+
+    if(nError == ERROR_SUCCESS)
+    {
+        dwCacheSize = 
+        dwFileSize = SFileGetFileSize(hListFile, NULL);
+
+        // Try to allocate memory for the complete file. If it fails,
+        // load the part of the file
+        pCache = (TListFileCache *)ALLOCMEM(char, (sizeof(TListFileCache) + dwCacheSize));
+        if(pCache == NULL)
+        {
+            dwCacheSize = LISTFILE_CACHE_SIZE;
+            pCache = (TListFileCache *)ALLOCMEM(char, sizeof(TListFileCache) + dwCacheSize);
+        }
+
+        if(pCache == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+    }
+
+    if(nError == ERROR_SUCCESS)
+    {
+        // Initialize the file cache
+        memset(pCache, 0, sizeof(TListFileCache));
+        pCache->hFile      = hListFile;
+        pCache->dwFileSize = dwFileSize;
+        pCache->dwBuffSize = dwCacheSize;
+        pCache->dwFilePos  = 0;
+
+        // Fill the cache
+        SFileReadFile(hListFile, pCache->Buffer, pCache->dwBuffSize, &pCache->dwBuffSize, NULL);
+
+        // Initialize the pointers
+        pCache->pBegin =
+        pCache->pPos = &pCache->Buffer[0];
+        pCache->pEnd = pCache->pBegin + pCache->dwBuffSize;
+
+        // Load the node tree
+        while((nLength = ReadLine(pCache, szFileName, sizeof(szFileName) - 1)) > 0)
+            SListFileAddNode(ha, szFileName);
+
+        // Add well-known names
+        // Sometimes, they are not in listfile, but they exist in the archive
+        SListFileAddNode(ha, LISTFILE_NAME);
+        SListFileAddNode(ha, SIGNATURE_NAME);
+        SListFileAddNode(ha, ATTRIBUTES_NAME);
+    }
+
+    // Cleanup & exit
+    if(pCache != NULL)
+        SListFileFindClose((HANDLE)pCache);
+    return nError;
+}
+
+//-----------------------------------------------------------------------------
+// Passing through the listfile
+
+// TODO: Test for archives > 4GB
+HANDLE SListFileFindFirstFile(HANDLE hMpq, const char * szListFile, const char * szMask, SFILE_FIND_DATA * lpFindFileData)
+{
+    TListFileCache * pCache = NULL;
+    TMPQArchive * ha = (TMPQArchive *)hMpq;
+    HANDLE hListFile = NULL;
+    DWORD dwSearchScope = SFILE_OPEN_LOCAL_FILE;
+    DWORD dwCacheSize = 0;
+    DWORD dwFileSize = 0;
+    size_t nLength = 0;
+    int nError = ERROR_SUCCESS;
+
+    // Initialize the structure with zeros
+    memset(lpFindFileData, 0, sizeof(SFILE_FIND_DATA));
+
+    // If the szListFile is NULL, it means we have to open internal listfile
+    if(szListFile == NULL)
+    {
+        szListFile = LISTFILE_NAME;
+        dwSearchScope = SFILE_OPEN_FROM_MPQ;
+    }
+
+    // Open the local/internal listfile
+    if(nError == ERROR_SUCCESS)
+    {
+        if(!SFileOpenFileEx((HANDLE)ha, szListFile, dwSearchScope, &hListFile))
+            nError = GetLastError();
+    }
+
+    if(nError == ERROR_SUCCESS)
+    {
+        dwCacheSize = 
+        dwFileSize = SFileGetFileSize(hListFile, NULL);
+
+        // Try to allocate memory for the complete file. If it fails,
+        // load the part of the file
+        pCache = (TListFileCache *)ALLOCMEM(char, sizeof(TListFileCache) + dwCacheSize);
+        if(pCache == NULL)
+        {
+            dwCacheSize = LISTFILE_CACHE_SIZE;
+            pCache = (TListFileCache *)ALLOCMEM(char, sizeof(TListFileCache) + dwCacheSize);
+        }
+
+        if(pCache == NULL)
+            nError = ERROR_NOT_ENOUGH_MEMORY;
+    }
+
+    if(nError == ERROR_SUCCESS)
+    {
+        // Initialize the file cache
+        memset(pCache, 0, sizeof(TListFileCache));
+        pCache->hFile      = hListFile;
+        pCache->dwFileSize = dwFileSize;
+        pCache->dwBuffSize = dwCacheSize;
+        pCache->dwFilePos  = 0;
+        if(szMask != NULL)
+        {
+            pCache->szMask = ALLOCMEM(char, strlen(szMask) + 1);
+            strcpy(pCache->szMask, szMask);
+        }
+
+        // Fill the cache
+        SFileReadFile(hListFile, pCache->Buffer, pCache->dwBuffSize, &pCache->dwBuffSize, NULL);
+
+        // Initialize the pointers
+        pCache->pBegin =
+        pCache->pPos = &pCache->Buffer[0];
+        pCache->pEnd = pCache->pBegin + pCache->dwBuffSize;
+
+        for(;;)
+        {
+            // Read the (next) line
+            nLength = ReadLine(pCache, lpFindFileData->cFileName, sizeof(lpFindFileData->cFileName));
+            if(nLength == 0)
+            {
+                nError = ERROR_NO_MORE_FILES;
+                break;
+            }
+
+            // If some mask entered, check it
+            if(CheckWildCard(lpFindFileData->cFileName, pCache->szMask))
+                break;                
+        }
+    }
+
+    // Cleanup & exit
+    if(nError != ERROR_SUCCESS)
+    {
+        memset(lpFindFileData, 0, sizeof(SFILE_FIND_DATA));
+        SListFileFindClose((HANDLE)pCache);
+        pCache = NULL;
+
+        SetLastError(nError);
+    }
+    return (HANDLE)pCache;
+}
+
+// TODO: Test for archives > 4GB
+BOOL SListFileFindNextFile(HANDLE hFind, SFILE_FIND_DATA * lpFindFileData)
+{
+    TListFileCache * pCache = (TListFileCache *)hFind;
+    size_t nLength;
+    BOOL bResult = FALSE;
+    int nError = ERROR_SUCCESS;
+
+    for(;;)
+    {
+        // Read the (next) line
+        nLength = ReadLine(pCache, lpFindFileData->cFileName, sizeof(lpFindFileData->cFileName));
+        if(nLength == 0)
+        {
+            nError = ERROR_NO_MORE_FILES;
+            break;
+        }
+
+        // If some mask entered, check it
+        if(CheckWildCard(lpFindFileData->cFileName, pCache->szMask))
+        {
+            bResult = TRUE;
+            break;
+        }
+    }
+
+    if(nError != ERROR_SUCCESS)
+        SetLastError(nError);
+    return bResult;
+}
+
+// TODO: Test for archives > 4GB
+BOOL SListFileFindClose(HANDLE hFind)
+{
+    TListFileCache * pCache = (TListFileCache *)hFind;
+
+    if(pCache != NULL)
+    {
+        if(pCache->hFile != NULL)
+            SFileCloseFile(pCache->hFile);
+        if(pCache->szMask != NULL)
+            FREEMEM(pCache->szMask);
+
+        FREEMEM(pCache);
+        return TRUE;
+    }
+
+    return FALSE;
+}
+
diff --git a/contrib/vmap_extractor_v2/stormlib/StormDll.h b/contrib/vmap_extractor_v2/stormlib/StormDll.h
new file mode 100644
index 00000000000..6d67820a22f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/StormDll.h
@@ -0,0 +1,67 @@
+/*****************************************************************************/
+/* Storm.h                           Copyright Justin Olbrantz(Quantam) 2000 */
+/*---------------------------------------------------------------------------*/
+/* Storm Interface Library v1.0 for Windows                                  */
+/*                                                                           */
+/* Author : Justin Olbrantz(Quantam)                                         */
+/* E-mail : omega@dragonfire.net                                             */
+/* WWW    : www.campaigncreations.com/starcraft/mpq2k/inside_mopaq/          */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* xx.xx.00  1.00  Qua  The first version of Storm.h                         */
+/* 11.04.03  1.00  Lad  Added some functions                                 */
+/*****************************************************************************/
+
+// We need the Windows data types for the Storm prototypes
+#include <windows.h>
+
+#ifndef __STORM_H__
+#define __STORM_H__
+
+// Somethimes is necessary to change the function names so they
+// will not conflict with other MPQ tools.
+#ifdef STORM_ALTERNATE_NAMES
+  #define SFILE(Name) Storm##Name
+  #define SCOMP(Name) Storm##Name
+#else
+  #define SFILE(Name) SFile##Name
+  #define SCOMP(Name) SComp##Name
+#endif
+
+
+// Just in case anyone is still using C out there
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+// Storm file function prototypes
+BOOL  WINAPI SFILE(OpenArchive)(LPCSTR lpFileName, DWORD dwPriority, DWORD dwFlags, HANDLE *hMPQ);
+BOOL  WINAPI SFILE(CloseArchive)(HANDLE hMPQ);
+BOOL  WINAPI SFILE(GetArchiveName)(HANDLE hMPQ, LPCSTR lpBuffer, DWORD dwBufferLength);
+BOOL  WINAPI SFILE(OpenFile)(LPCSTR lpFileName, HANDLE *hFile);
+BOOL  WINAPI SFILE(OpenFileEx)(HANDLE hMPQ, LPCSTR lpFileName, DWORD dwSearchScope, HANDLE *hFile);
+BOOL  WINAPI SFILE(CloseFile)(HANDLE hFile);
+DWORD WINAPI SFILE(GetFileSize)(HANDLE hFile, LPDWORD lpFileSizeHigh);
+BOOL  WINAPI SFILE(GetFileArchive)(HANDLE hFile, HANDLE *hMPQ);
+BOOL  WINAPI SFILE(GetFileName)(HANDLE hFile, LPCSTR lpBuffer, DWORD dwBufferLength);
+DWORD WINAPI SFILE(SetFilePointer)(HANDLE hFile, long lDistanceToMove, PLONG lplDistanceToMoveHigh, DWORD dwMoveMethod);
+BOOL  WINAPI SFILE(ReadFile)(HANDLE hFile,LPVOID lpBuffer,DWORD nNumberOfBytesToRead,LPDWORD lpNumberOfBytesRead,LPOVERLAPPED lpOverlapped);
+LCID  WINAPI SFILE(SetLocale)(LCID nNewLocale);
+BOOL  WINAPI SFILE(GetBasePath)(LPCSTR lpBuffer, DWORD dwBufferLength);
+BOOL  WINAPI SFILE(SetBasePath)(LPCSTR lpNewBasePath);
+
+// Storm (de)compression functions
+BOOL  WINAPI SCOMP(Compress)  (char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int uCmp, int uCmpType, int nCmpLevel);
+BOOL  WINAPI SCOMP(Decompress)(char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength);
+
+
+#if defined(_MSC_VER) && !defined(BUILDING_STORM_CPP)
+#pragma comment(lib, "Storm.lib")    // Force linking Storm.lib and thus Storm.dll
+#endif
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif // __STORM_H__
diff --git a/contrib/vmap_extractor_v2/stormlib/StormLib.h b/contrib/vmap_extractor_v2/stormlib/StormLib.h
new file mode 100644
index 00000000000..eeb8daa6468
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/StormLib.h
@@ -0,0 +1,579 @@
+/*****************************************************************************/
+/* StormLib.h                        Copyright (c) Ladislav Zezula 1999-2005 */
+/*---------------------------------------------------------------------------*/
+/* StormLib library v 5.00                                                   */
+/*                                                                           */
+/* Author : Ladislav Zezula                                                  */
+/* E-mail : ladik@zezula.net                                                 */
+/* WWW    : http://www.zezula.net                                            */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* xx.xx.99  1.00  Lad  Created                                              */
+/* 24.03.03  2.50  Lad  Version 2.50                                         */
+/* 02.04.03  3.00  Lad  Version 3.00 with compression                        */
+/* 11.04.03  3.01  Lad  Renamed to StormLib.h for compatibility with         */
+/*                      original headers for Storm.dll                       */
+/* 10.05.03  3.02  Lad  Added Pkware DCL compression                         */
+/* 26.05.03  4.00  Lad  Completed all compressions                           */
+/* 18.06.03  4.01  Lad  Added SFileSetFileLocale                             */
+/*                      Added SFileExtractFile                               */
+/* 26.07.03  4.02  Lad  Implemented nameless rename and delete               */
+/* 26.07.03  4.03  Lad  Added support for protected MPQs                     */
+/* 28.08.03  4.10  Lad  Fixed bugs that caused StormLib incorrectly work     */
+/*                      with Diablo I savegames and with files having full   */
+/*                      hash table                                           */
+/* 08.12.03  4.11  DCH  Fixed bug in reading file block larger than 0x1000   */
+/*                      on certain files.                                    */
+/*                      Fixed bug in AddFile with MPQ_FILE_REPLACE_EXISTING  */
+/*                      (Thanx Daniel Chiamarello, dchiamarello@madvawes.com)*/
+/* 21.12.03  4.50  Lad  Completed port for Mac                               */
+/*                      Fixed bug in compacting (if fsize is mul of 0x1000)  */
+/*                      Fixed bug in SCompCompress                           */
+/* 27.05.04  4.51  Lad  Changed memory management from new/delete to our     */
+/*                      own macros                                           */
+/* 22.06.04  4.60  Lad  Optimized search. Support for multiple listfiles.    */
+/* 30.09.04  4.61  Lad  Fixed some bugs (Aaargh !!!)                         */
+/*                      Correctly works if HashTableSize > BlockTableSize    */
+/* 29.12.04  4.70  Lad  Fixed compatibility problem with MPQs from WoW       */
+/* 14.07.05  5.00  Lad  Added the BZLIB compression support                  */
+/*                      Added suport of files stored as single unit          */
+/* 17.04.06  5.01  Lad  Converted to MS Visual Studio 8.0                    */
+/*                      Fixed issue with protected Warcraft 3 protected maps */
+/* 15.05.06  5.02  Lad  Fixed issue with WoW 1.10+                           */
+/* 07.09.06  5.10  Lad  Fixed processing files longer than 2GB               */
+/* 22.11.06  6.00  Lad  Support for MPQ archives V2                          */
+/*****************************************************************************/
+
+#ifndef __STORMLIB_H_
+#define __STORMLIB_H_
+
+#include "StormPort.h"
+
+//-----------------------------------------------------------------------------
+// Use the apropriate library
+//
+// The library type is encoded in the library name as the following
+// StormLibXYZ.lib
+// 
+//  X - D for Debug version, R for Release version
+//  Y - A for ANSI version, U for Unicode version (Unicode version does not exist yet)
+//  Z - S for static C library, D for multithreaded DLL C-library
+//
+
+#if defined(_MSC_VER) && !defined (__STORMLIB_SELF__)
+  #ifdef _DEBUG                                 // DEBUG VERSIONS
+    #ifdef _DLL                               
+      #pragma comment(lib, "StormLibDAD.lib")   // Debug Ansi Dynamic version
+    #else        
+      #pragma comment(lib, "StormLibDAS.lib")   // Debug Ansi Static version
+    #endif
+  #else                                         // RELEASE VERSIONS
+    #ifdef _DLL
+      #pragma comment(lib, "StormLibRAD.lib")   // Release Ansi Dynamic version
+    #else        
+      #pragma comment(lib, "StormLibRAS.lib")   // Release Ansi Static version
+    #endif
+  #endif
+#endif
+
+//-----------------------------------------------------------------------------
+// Defines
+
+#define ID_MPQ            0x1A51504D        // MPQ archive header ID ('MPQ\x1A')
+#define ID_MPQ_SHUNT      0x1B51504D        // MPQ shunt entry ('MPQ\x1B')
+
+#define ERROR_AVI_FILE         10000        // No MPQ file, but AVI file.
+
+// Values for SFileCreateArchiveEx
+#define HASH_TABLE_SIZE_MIN    0x00002
+#define HASH_TABLE_SIZE_MAX    0x40000
+
+#define HASH_ENTRY_DELETED       0xFFFFFFFE // Block index for deleted hash entry
+#define HASH_ENTRY_FREE          0xFFFFFFFF // Block index for free hash entry
+
+// Values for SFileOpenArchive
+#define SFILE_OPEN_HARD_DISK_FILE   2       // Open the archive on HDD
+#define SFILE_OPEN_CDROM_FILE       3       // Open the archive only if it is on CDROM
+
+// Values for SFileOpenFile
+#define SFILE_OPEN_FROM_MPQ         0       // Open the file from the MPQ archive
+#define SFILE_OPEN_BY_INDEX         1       // The 'szFileName' parameter is actually the file index
+#define SFILE_OPEN_LOCAL_FILE   (DWORD)-1   // Open the file from the MPQ archive
+
+// Flags for TMPQArchive::dwFlags
+#define MPQ_FLAG_CHANGED         0x00000001 // If set, the MPQ has been changed
+#define MPQ_FLAG_PROTECTED       0x00000002 // Set on protected MPQs (like W3M maps)
+
+// Flags for SFileAddFile
+#define MPQ_FILE_COMPRESS_PKWARE 0x00000100 // Compression made by PKWARE Data Compression Library
+#define MPQ_FILE_COMPRESS_MULTI  0x00000200 // Multiple compressions
+#define MPQ_FILE_COMPRESSED      0x0000FF00 // File is compressed
+#define MPQ_FILE_ENCRYPTED       0x00010000 // Indicates whether file is encrypted 
+#define MPQ_FILE_FIXSEED         0x00020000 // File decrypt seed has to be fixed
+#define MPQ_FILE_SINGLE_UNIT     0x01000000 // File is stored as a single unit, rather than split into sectors (Thx, Quantam)
+#define MPQ_FILE_DUMMY_FILE      0x02000000 // The file is only 1 byte long and its name is a hash
+#define MPQ_FILE_HAS_EXTRA       0x04000000 // The file has extra data appended after regular data.
+                                            // Must be with compressed files only
+#define MPQ_FILE_EXISTS          0x80000000 // Set if file exists, reset when the file was deleted
+#define MPQ_FILE_REPLACEEXISTING 0x80000000 // Replace when the file exist (SFileAddFile)
+
+#define MPQ_FILE_VALID_FLAGS     (MPQ_FILE_COMPRESS_PKWARE |  \
+                                  MPQ_FILE_COMPRESS_MULTI |   \
+                                  MPQ_FILE_ENCRYPTED |        \
+                                  MPQ_FILE_FIXSEED |          \
+                                  MPQ_FILE_SINGLE_UNIT |      \
+                                  MPQ_FILE_DUMMY_FILE |         \
+                                  MPQ_FILE_HAS_EXTRA |        \
+                                  MPQ_FILE_EXISTS)
+
+// Compression types for multilpe compressions
+#define MPQ_COMPRESSION_HUFFMANN    0x01    // Huffmann compression (used on WAVE files only)
+#define MPQ_COMPRESSION_ZLIB        0x02    // ZLIB compression
+#define MPQ_COMPRESSION_PKWARE      0x08    // PKWARE DCL compression
+#define MPQ_COMPRESSION_BZIP2       0x10    // BZIP2 compression
+#define MPQ_COMPRESSION_WAVE_MONO   0x40    // 
+#define MPQ_COMPRESSION_WAVE_STEREO 0x80    // 
+
+
+// Constants for SFileAddWave
+#define MPQ_WAVE_QUALITY_HIGH        0      // Best quality, the worst compression
+#define MPQ_WAVE_QUALITY_MEDIUM      1      // Medium quality, medium compression
+#define MPQ_WAVE_QUALITY_LOW         2      // Low quality, the best compression
+
+// Constants for SFileGetFileInfo
+#define SFILE_INFO_ARCHIVE_SIZE      1      // MPQ size (value from header)
+#define SFILE_INFO_HASH_TABLE_SIZE   2      // Size of hash table, in entries
+#define SFILE_INFO_BLOCK_TABLE_SIZE  3      // Number of entries in the block table
+#define SFILE_INFO_BLOCK_SIZE        4      // Size of file block (in bytes)
+#define SFILE_INFO_HASH_TABLE        5      // Pointer to Hash table (TMPQHash *)
+#define SFILE_INFO_BLOCK_TABLE       6      // Pointer to Block Table (TMPQBlock *)
+#define SFILE_INFO_NUM_FILES         7      // Real number of files within archive
+//------
+#define SFILE_INFO_HASH_INDEX        8      // Hash index of file in MPQ
+#define SFILE_INFO_CODENAME1         9      // The first codename of the file
+#define SFILE_INFO_CODENAME2        10      // The second codename of the file
+#define SFILE_INFO_LOCALEID         11      // Locale ID of file in MPQ
+#define SFILE_INFO_BLOCKINDEX       12      // Index to Block Table
+#define SFILE_INFO_FILE_SIZE        13      // Original file size
+#define SFILE_INFO_COMPRESSED_SIZE  14      // Compressed file size
+#define SFILE_INFO_FLAGS            15      // File flags
+#define SFILE_INFO_POSITION         16      // File position within archive
+#define SFILE_INFO_SEED             17      // File decryption seed
+#define SFILE_INFO_SEED_UNFIXED     18      // Decryption seed not fixed to file pos and size
+
+// Values for compact callback
+#define CCB_CHECKING_FILES           1      // Checking archive (dwParam1 = current, dwParam2 = total)
+#define CCB_CHECKING_HASH_TABLE      2      // Checking hash table (dwParam1 = current, dwParam2 = total)
+#define CCB_COPYING_NON_MPQ_DATA     3      // Copying non-MPQ data: No params used
+#define CCB_COMPACTING_FILES         4      // Compacting archive (dwParam1 = current, dwParam2 = total)
+#define CCB_CLOSING_ARCHIVE          5      // Closing archive: No params used
+                                      
+#define LISTFILE_NAME     "(listfile)"      // Name of internal listfile
+#define SIGNATURE_NAME   "(signature)"      // Name of internal signature
+#define ATTRIBUTES_NAME "(attributes)"      // Name of internal attributes file
+
+#define STORMLIB_VERSION      (0x0600)      // Current version of StormLib
+
+#define MPQ_FORMAT_VERSION_1        0       // Up to The Burning Crusade
+#define MPQ_FORMAT_VERSION_2        1       // The Burning Crusade and newer,
+
+// Flags for SFileOpenArchiveEx
+#define MPQ_OPEN_NO_LISTFILE    0x00000001  // Don't add the internal listfile
+
+// supports archives with size > 4 GB
+// Additional flags for SFileCreateArchiveEx
+#define MPQ_CREATE_ARCHIVE_V1   0x00000000  // Creates archive with size up to 4GB
+#define MPQ_CREATE_ARCHIVE_V2   0x00010000  // Creates archive larger than 4 GB
+
+//-----------------------------------------------------------------------------
+// Structures
+
+#if (defined(WIN32) || defined(WIN64))
+#include <pshpack1.h>
+#else
+#pragma pack(1)
+#endif
+
+struct TMPQFile;
+
+struct TMPQShunt
+{
+    // The ID_MPQ_SHUNT ('MPQ\x1B') signature
+    DWORD dwID;
+
+    DWORD dwUnknown;
+
+    // Position of the MPQ header, relative to the begin of the shunt
+    DWORD dwHeaderPos;
+};
+
+
+// MPQ file header
+struct TMPQHeader
+{
+    // The ID_MPQ ('MPQ\x1A') signature
+    DWORD dwID;                         
+
+    // Size of the archive header
+    DWORD dwHeaderSize;                   
+
+    // Size of MPQ archive
+    // This field is deprecated in the Burning Crusade MoPaQ format, and the size of the archive
+    // is calculated as the size from the beginning of the archive to the end of the hash table,
+    // block table, or extended block table (whichever is largest).
+    DWORD dwArchiveSize;
+
+    // 0 = Original format
+    // 1 = Extended format (The Burning Crusade and newer)
+    USHORT wFormatVersion;
+
+    // Power of two exponent specifying the number of 512-byte disk sectors in each logical sector
+    // in the archive. The size of each logical sector in the archive is 512 * 2^SectorSizeShift.
+    // Bugs in the Storm library dictate that this should always be 3 (4096 byte sectors).
+    USHORT wBlockSize;
+
+    // Offset to the beginning of the hash table, relative to the beginning of the archive.
+    DWORD dwHashTablePos;
+    
+    // Offset to the beginning of the block table, relative to the beginning of the archive.
+    DWORD dwBlockTablePos;
+    
+    // Number of entries in the hash table. Must be a power of two, and must be less than 2^16 for
+    // the original MoPaQ format, or less than 2^20 for the Burning Crusade format.
+    DWORD dwHashTableSize;
+    
+    // Number of entries in the block table
+    DWORD dwBlockTableSize;
+};
+
+
+// Extended MPQ file header. Valid only if wFormatVersion is 1 or higher
+struct TMPQHeader2 : public TMPQHeader
+{
+    // Offset to the beginning of the extended block table, relative to the beginning of the archive.
+    LARGE_INTEGER ExtBlockTablePos;
+
+    // High 16 bits of the hash table offset for large archives.
+    USHORT wHashTablePosHigh;
+
+    // High 16 bits of the block table offset for large archives.
+    USHORT wBlockTablePosHigh;
+};
+
+
+// Hash entry. All files in the archive are searched by their hashes.
+struct TMPQHash
+{
+    // The hash of the file path, using method A.
+    DWORD dwName1;
+    
+    // The hash of the file path, using method B.
+    DWORD dwName2;
+
+#ifdef PLATFORM_LITTLE_ENDIAN
+
+    // The language of the file. This is a Windows LANGID data type, and uses the same values.
+    // 0 indicates the default language (American English), or that the file is language-neutral.
+    USHORT lcLocale;
+
+    // The platform the file is used for. 0 indicates the default platform.
+    // No other values have been observed.
+    USHORT wPlatform;
+
+#else
+
+    USHORT wPlatform;
+    USHORT lcLocale;
+
+#endif
+
+    // If the hash table entry is valid, this is the index into the block table of the file.
+    // Otherwise, one of the following two values:
+    //  - FFFFFFFFh: Hash table entry is empty, and has always been empty.
+    //               Terminates searches for a given file.
+    //  - FFFFFFFEh: Hash table entry is empty, but was valid at some point (a deleted file).
+    //               Does not terminate searches for a given file.
+    DWORD dwBlockIndex;
+};
+
+
+// File description block contains informations about the file
+struct TMPQBlock
+{
+    // Offset of the beginning of the block, relative to the beginning of the archive.
+    DWORD dwFilePos;
+    
+    // Compressed file size
+    DWORD dwCSize;
+    
+    // Only valid if the block is a file; otherwise meaningless, and should be 0.
+    // If the file is compressed, this is the size of the uncompressed file data.
+    DWORD dwFSize;                      
+    
+    // Flags for the file. See MPQ_FILE_XXXX constants
+    DWORD dwFlags;                      
+};
+
+
+// The extended block table was added to support archives larger than 4 gigabytes (2^32 bytes).
+// The table contains the upper bits of the archive offsets for each block in the block table.
+// It is simply an array of int16s, which become bits 32-47 of the archive offsets for each block,
+// with bits 48-63 being zero. Individual blocks in the archive are still limited to 4 gigabytes
+// in size. This table is only present in Burning Crusade format archives that exceed 4 gigabytes size.
+struct TMPQBlockEx
+{
+    USHORT wFilePosHigh;
+};
+
+
+struct TFileNode
+{
+    DWORD dwRefCount;                   // Number of references
+                                        // There can be more files that have the same name.
+                                        // (e.g. multiple language files). We don't want to
+                                        // have an entry for each of them, so the entries will be referenced.
+                                        // When a number of node references reaches zero, 
+                                        // the node will be deleted
+
+    size_t nLength;                     // File name length
+    char  szFileName[1];                // File name, variable length
+};
+
+#if (defined(WIN32) || defined(WIN64))
+#include <poppack.h>
+#else
+#pragma options align=reset
+#endif
+
+// Archive handle structure. Note that it does not agree with Storm.dll's structure.
+struct TMPQArchive
+{
+//  TMPQArchive * pNext;                // Next archive (used by Storm.dll only)
+//  TMPQArchive * pPrev;                // Previous archive (used by Storm.dll only)
+    char          szFileName[MAX_PATH]; // Opened archive file name
+    HANDLE        hFile;                // File handle
+    DWORD         dwPriority;           // Priority of the archive
+    LARGE_INTEGER ShuntPos;             // Position of MPQShunt (only valid if a shunt is present)
+    LARGE_INTEGER MpqPos;               // MPQ position in the file, relative to the begin of the file
+    LARGE_INTEGER MpqSize;              // Size of MPQ archive
+    LARGE_INTEGER HashTablePos;         // Offset of the hast table in the MPQ, relative to the begin of the file
+    LARGE_INTEGER BlockTablePos;        // Offset of the hast table in the MPQ, relative to the begin
+    LARGE_INTEGER ExtBlockTablePos;     // Offset of the extended block table, relative to the begin
+    LARGE_INTEGER FilePointer;          // Current position in the file (relative to begin of the file)
+
+    TMPQFile    * pLastFile;            // Recently read file
+    DWORD         dwBlockPos;           // Position of loaded block in the file
+    DWORD         dwBlockSize;          // Size of file block
+    BYTE        * pbBlockBuffer;        // Buffer (cache) for file block
+    DWORD         dwBuffPos;            // Position in block buffer
+    TMPQShunt   * pShunt;               // MPQ shunt (NULL if not present in the file)
+    TMPQHeader2 * pHeader;              // MPQ file header
+    TMPQHash    * pHashTable;           // Hash table
+    TMPQBlock   * pBlockTable;          // Block table
+    TMPQBlockEx * pExtBlockTable;       // Extended block table
+    
+    TMPQShunt     Shunt;                // MPQ shunt. Valid only when ID_MPQ_SHUNT has been found
+    TMPQHeader2   Header;               // MPQ header
+
+    // Non-Storm.dll members
+    TFileNode  ** pListFile;            // File name array
+//  HANDLE        hListFile;            // Handle to temporary listfile (when open with write access)
+    DWORD         dwFlags;              // See MPQ_FLAG_XXXXX
+//  BOOL          bChanged;             // TRUE if the archive was changed since open.
+//  BOOL          bProtected;           // TRUE if the archive is protected by somehow
+};
+
+
+// File handle structure. Note that it does not agree with Storm.dll structures
+struct TMPQFile
+{
+    HANDLE        hFile;                // File handle
+    TMPQArchive * ha;                   // Archive handle
+    TMPQHash    * pHash;                // Hash table entry
+    TMPQBlockEx * pBlockEx;             // Pointer to extended file block entry
+    TMPQBlock   * pBlock;               // File block pointer
+    DWORD         dwSeed1;              // Seed used for file decrypt
+    DWORD         dwFilePos;            // Current file position
+    LARGE_INTEGER MpqFilePos;           // Position of the file data in MPQ archive
+                                        // (relative to file begin)
+
+    DWORD       * pdwBlockPos;          // Position of each file block (only for compressed files)
+    DWORD         nBlocks;              // Number of blocks in the file (incl. the last noncomplete one)
+    BOOL          bBlockPosLoaded;      // TRUE if block positions loaded
+    BYTE        * pbFileBuffer;         // Decompressed file (for single unit files, size is the uncompressed file size)
+
+    DWORD         dwHashIndex;          // Index to Hash table
+    DWORD         dwFileIndex;          // Index to Block table
+    char          szFileName[1];        // File name (variable length)
+};
+
+
+// Used by searching in MPQ archives
+struct TMPQSearch
+{
+    TMPQArchive * ha;                   // Handle to MPQ, where the search runs
+    DWORD  dwNextIndex;                 // The next searched hash index
+    DWORD  dwName1;                     // Lastly found Name1
+    DWORD  dwName2;                     // Lastly found Name2
+    char   szSearchMask[1];             // Search mask (variable length)
+};
+
+
+struct SFILE_FIND_DATA
+{
+    char   cFileName[MAX_PATH];         // Full name of the found file
+    char * szPlainName;                 // Pointer to file part
+    LCID   lcLocale;                    // Locale version
+    DWORD  dwFileSize;                  // File size in bytes
+    DWORD  dwFileFlags;                 // File flags (compressed or encrypted)
+    DWORD  dwBlockIndex;                // Block index for the file
+    DWORD  dwCompSize;                  // Compressed file size
+};
+
+//-----------------------------------------------------------------------------
+// Memory management
+//
+// We use our own macros for allocating/freeing memory. If you want
+// to redefine them, please keep the following rules
+//
+//  - The memory allocation must return NULL if not enough memory
+//    (i.e not to throw exception)
+//  - It is not necessary to fill the allocated block with zeros
+//  - Memory freeing function must not test the pointer to NULL.
+//
+
+
+__inline void * DebugMalloc(char * szFile, int nLine, int nSize)
+{
+    void * ptr = malloc(nSize + 100);
+    char * plain;
+
+    plain = strrchr(szFile, '\\');
+    if(plain == NULL)
+        plain = strrchr(szFile, '/');
+    if(plain == NULL)
+        plain = szFile;
+
+#if _MSC_VER > 0x1300
+    sprintf_s((char *)ptr, nSize+100, "%s(%u)", plain, nLine);
+#else
+    sprintf((char *)ptr, "%s(%u)", plain, nLine);
+#endif
+
+    return (char *)ptr + 100;
+}
+
+
+__inline void DebugFree(void * ptr)
+{
+    free((char *)ptr - 100);
+}
+
+
+#ifndef ALLOCMEM
+  #define ALLOCMEM(type, nitems)   (type *)malloc((nitems) * sizeof(type))
+  #define FREEMEM(ptr) free(ptr)
+#endif
+
+//#define ALLOCMEM(type, nitems)   (type *)DebugMalloc(__FILE__, __LINE__, (nitems) * sizeof(type))
+//#define FREEMEM(ptr) DebugFree(ptr)
+
+//-----------------------------------------------------------------------------
+// Functions in StormLib - compatible with Storm.dll
+
+// Typedefs for functions exported by Storm.dll
+typedef LCID  (WINAPI * SFILESETLOCALE)(LCID);
+typedef BOOL  (WINAPI * SFILEOPENARCHIVE)(const char *, DWORD, DWORD, HANDLE *);
+typedef BOOL  (WINAPI * SFILECLOSEARCHIVE)(HANDLE);
+typedef BOOL  (WINAPI * SFILEOPENFILEEX)(HANDLE, const char *, DWORD, HANDLE *);
+typedef BOOL  (WINAPI * SFILECLOSEFILE)(HANDLE);
+typedef DWORD (WINAPI * SFILEGETFILESIZE)(HANDLE, DWORD *);
+typedef DWORD (WINAPI * SFILESETFILEPOINTER)(HANDLE, LONG, LONG *, DWORD);
+typedef BOOL  (WINAPI * SFILEREADFILE)(HANDLE, VOID *, DWORD, DWORD *, LPOVERLAPPED);
+
+// Archive opening/closing
+LCID  WINAPI SFileSetLocale(LCID lcNewLocale);
+LCID  WINAPI SFileGetLocale();
+BOOL  WINAPI SFileOpenArchive(const char * szMpqName, DWORD dwPriority, DWORD dwFlags, HANDLE * phMPQ);
+BOOL  WINAPI SFileCloseArchive(HANDLE hMPQ);
+
+// File opening/closing
+BOOL  WINAPI SFileOpenFileEx(HANDLE hMPQ, const char * szFileName, DWORD dwSearchScope, HANDLE * phFile);
+BOOL  WINAPI SFileCloseFile(HANDLE hFile);
+
+// File I/O
+DWORD WINAPI SFileGetFilePos(HANDLE hFile, DWORD * pdwFilePosHigh = NULL);
+DWORD WINAPI SFileGetFileSize(HANDLE hFile, DWORD * pdwFileSizeHigh = NULL);
+DWORD WINAPI SFileSetFilePointer(HANDLE hFile, LONG lFilePos, LONG * pdwFilePosHigh, DWORD dwMethod);
+BOOL  WINAPI SFileReadFile(HANDLE hFile, VOID * lpBuffer, DWORD dwToRead, DWORD * pdwRead = NULL, LPOVERLAPPED lpOverlapped = NULL);
+
+BOOL  WINAPI SFileExtractFile(HANDLE hMpq, const char * szToExtract, const char * szExtracted);
+
+// Adds another listfile into MPQ. The currently added listfile(s) remain,
+// so you can use this API to combining more listfiles.
+// Note that this function is internally called by SFileFindFirstFile
+int   WINAPI SFileAddListFile(HANDLE hMpq, const char * szListFile);
+
+//-----------------------------------------------------------------------------
+// Functions in StormLib - not implemented in Storm.dll
+
+// Archive creating and editing
+BOOL  WINAPI SFileCreateArchiveEx(const char * szMpqName, DWORD dwCreationDisposition, DWORD dwHashTableSize, HANDLE * phMPQ);
+BOOL  WINAPI SFileAddFile(HANDLE hMPQ, const char * szFileName, const char * szArchivedName, DWORD dwFlags); 
+BOOL  WINAPI SFileAddWave(HANDLE hMPQ, const char * szFileName, const char * szArchivedName, DWORD dwFlags, DWORD dwQuality); 
+BOOL  WINAPI SFileRemoveFile(HANDLE hMPQ, const char * szFileName, DWORD dwSearchScope = SFILE_OPEN_BY_INDEX);
+BOOL  WINAPI SFileRenameFile(HANDLE hMPQ, const char * szOldFileName, const char * szNewFileName);
+BOOL  WINAPI SFileSetFileLocale(HANDLE hFile, LCID lcNewLocale);
+
+// Retrieving info about the file
+BOOL  WINAPI SFileHasFile(HANDLE hMPQ, char * szFileName);
+BOOL  WINAPI SFileGetFileName(HANDLE hFile, char * szFileName);
+DWORD_PTR WINAPI SFileGetFileInfo(HANDLE hMpqOrFile, DWORD dwInfoType);
+
+// File search
+// Note that the SFileFindFirstFileEx has been removed. Use SListFileFindFirst/Next
+HANDLE WINAPI SFileFindFirstFile(HANDLE hMPQ, const char * szMask, SFILE_FIND_DATA * lpFindFileData, const char * szListFile);
+BOOL   WINAPI SFileFindNextFile(HANDLE hFind, SFILE_FIND_DATA * lpFindFileData);
+BOOL   WINAPI SFileFindClose(HANDLE hFind);
+
+// Listfile search
+HANDLE SListFileFindFirstFile(HANDLE hMpq, const char * szListFile, const char * szMask, SFILE_FIND_DATA * lpFindFileData);
+BOOL   SListFileFindNextFile(HANDLE hFind, SFILE_FIND_DATA * lpFindFileData);
+BOOL   SListFileFindClose(HANDLE hFind);
+
+// Archive compacting
+typedef void  (WINAPI * COMPACTCB)(void * lpUserData, DWORD dwWorkType, DWORD dwParam1, DWORD dwParam2);
+BOOL  WINAPI SFileSetCompactCallback(HANDLE hMPQ, COMPACTCB CompactCB, void * lpData);
+BOOL  WINAPI SFileCompactArchive(HANDLE hMPQ, const char * szListFile = NULL, BOOL bReserved = 0);
+
+// Locale support
+int   WINAPI SFileEnumLocales(HANDLE hMPQ, const char * szFileName, LCID * plcLocales, DWORD * pdwMaxLocales, DWORD dwSearchScope = SFILE_OPEN_BY_INDEX);
+
+// (De)compression
+int WINAPI SCompCompress   (char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength, int uCompressions, int nCmpType, int nCmpLevel);
+int WINAPI SCompDecompress (char * pbOutBuffer, int * pdwOutLength, char * pbInBuffer, int dwInLength);
+
+// Sets the default data compression for files added to MPQ,
+// if MPQ_FILE_COMPRESS_MULTI has been specified in call to SFileAddFile
+int WINAPI SCompSetDataCompression(int nDataCompression);
+
+//-----------------------------------------------------------------------------
+// Functions from Storm.dll. They use slightly different names for keeping
+// possibility to use them together with StormLib (StormXXX instead of SFileXXX)
+
+#ifdef __LINK_STORM_DLL__
+  #define STORM_ALTERNATE_NAMES         // Force Storm.h to use alternate fnc names
+  #include "StormDll.h"
+#endif // __LINK_STORM_DLL__
+
+//-----------------------------------------------------------------------------
+// GFX decode functions. See GfxDecode.cpp for details and description
+
+USHORT  WINAPI celGetFrameCount(BYTE * fileBuf);
+BYTE  * WINAPI celGetFrameData(BYTE *fileBuf, BYTE *palette, USHORT xsize, USHORT frame, USHORT *ysize, USHORT *maxX=NULL);
+USHORT  WINAPI cl2GetFrameCount(BYTE *fileBuf);
+BYTE ** WINAPI cl2GetDirData(BYTE *fileBuf, BYTE *palette, USHORT xsize, USHORT dir, USHORT *ysize);
+BYTE  * WINAPI pcxGetData(BYTE *filebuf, DWORD filesize, BYTE transcol, USHORT *xsize, USHORT *ysize);
+
+#endif  // __STORMLIB_H_
diff --git a/contrib/vmap_extractor_v2/stormlib/StormPort.h b/contrib/vmap_extractor_v2/stormlib/StormPort.h
new file mode 100644
index 00000000000..4cb8d84bd57
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/StormPort.h
@@ -0,0 +1,278 @@
+/*****************************************************************************/
+/* StormPort.h                           Copyright (c) Marko Friedemann 2001 */
+/*---------------------------------------------------------------------------*/
+/* Portability module for the StormLib library. Contains a wrapper symbols   */
+/* to make the compilation under Linux work                                  */
+/*                                                                           */
+/* Author: Marko Friedemann <marko.friedemann@bmx-chemnitz.de>               */
+/* Created at: Mon Jan 29 18:26:01 CEST 2001                                 */
+/* Computer: whiplash.flachland-chemnitz.de                                  */
+/* System: Linux 2.4.0 on i686                                               */
+/*                                                                           */
+/* Author: Sam Wilkins                                                       */
+/* System: Mac OS X and port to big endian processor                         */
+/*                                                                           */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 29.01.01  1.00  Mar  Created                                              */
+/* 24.03.03  1.01  Lad  Some cosmetic changes                                */
+/* 12.11.03  1.02  Dan  Macintosh compatibility                              */
+/* 24.07.04  1.03  Sam  Mac OS X compatibility                               */
+/* 22.11.06  1.04  Sam  Mac OS X compatibility (for StormLib 6.0)            */
+/* 31.12.06  1.05  XPinguin  Full GNU/Linux compatibility		     */
+/*****************************************************************************/
+
+#ifndef __STORMPORT_H__
+#define __STORMPORT_H__
+
+// Defines for Windows
+#if !defined(PLATFORM_DEFINED) && (defined(WIN32) || defined(WIN64))
+
+  // In MSVC 8.0, there are some functions declared as deprecated.
+  #if _MSC_VER >= 1400
+  #define _CRT_SECURE_NO_DEPRECATE
+  #define _CRT_NON_CONFORMING_SWPRINTFS
+  #endif
+
+  #include <assert.h>      
+  #include <stdio.h>      
+  #include <windows.h>      
+  #define PLATFORM_LITTLE_ENDIAN  1
+
+  #ifdef WIN64
+    #define PLATFORM_64BIT
+  #else
+    #define PLATFORM_32BIT
+  #endif
+
+  #define PLATFORM_DEFINED                  // The platform is known now
+
+#endif
+
+// Defines for Mac Carbon 
+#if !defined(PLATFORM_DEFINED) && defined(__APPLE__)  // Mac Carbon API
+
+  // Macintosh using Carbon
+  #include <Carbon/Carbon.h> // Mac OS X
+  #define _stricmp strcasecmp  // Case insensitive strcmp has a different name on this platform.
+  #define _strnicmp strncasecmp
+  
+  typedef void          * LPCSTR;
+  typedef unsigned long * LPDWORD;
+  typedef long          * PLONG;
+  typedef void          * LPVOID;
+  typedef unsigned int  UINT;
+  
+  #define    PKEXPORT
+  #define    __SYS_ZLIB
+  #define    __SYS_BZLIB
+  #define    LANG_NEUTRAL   0
+
+  #if defined(__BIG_ENDIAN__)
+    #define PLATFORM_LITTLE_ENDIAN  0
+  #else
+    #define PLATFORM_LITTLE_ENDIAN  1       // Apple is now making Macs with Intel CPUs
+  #endif
+  #define PLATFORM_DEFINED                  // The platform is known now
+
+#endif
+
+// Assumption: we are not on Windows nor Macintosh, so this must be linux *grin*
+// Ladik : Why the hell Linux does not use some OS-dependent #define ?
+#if !defined(PLATFORM_DEFINED)
+
+  #include <sys/types.h>
+  #include <sys/stat.h>
+  #include <fcntl.h>
+  #include <unistd.h>
+  #include <stdint.h>
+  #include <stdlib.h>
+  #include <stdio.h>
+  #include <stdarg.h>
+  #include <string.h>
+  #include <ctype.h>
+  #include <assert.h>
+
+  #define PLATFORM_LITTLE_ENDIAN  1
+  #define PLATFORM_DEFINED
+  #define LANG_NEUTRAL   0
+
+#endif  /* not __powerc */
+
+
+#if !defined(WIN32) && !defined(WIN64)
+
+  // Typedefs for ANSI C
+  typedef unsigned char  BYTE;
+  typedef short          SHORT;
+  typedef unsigned short WORD;
+  typedef unsigned short USHORT;
+  typedef long           LONG;
+  typedef unsigned long  DWORD;
+  typedef unsigned long  DWORD_PTR;
+  typedef long           LONG_PTR;
+  typedef long long      LONGLONG;
+#ifndef __OBJC__
+  #define BOOL           bool
+#endif
+  typedef void         * HANDLE;
+  typedef void         * LPOVERLAPPED; // Unsupported on Linux
+  typedef char           TCHAR;
+  typedef unsigned long  LCID;
+  
+  typedef void          * LPCSTR;
+  typedef unsigned long * LPDWORD;
+  typedef long          * PLONG;
+  typedef void          * LPVOID;
+  typedef unsigned int  UINT;
+  
+  typedef struct _FILETIME
+  { 
+      DWORD dwLowDateTime; 
+      DWORD dwHighDateTime; 
+  }
+  FILETIME, *PFILETIME;
+
+  typedef union _LARGE_INTEGER
+  {
+  #if PLATFORM_LITTLE_ENDIAN
+    struct
+    {
+        DWORD LowPart;
+        LONG HighPart;
+    };
+  #else
+    struct
+    {
+        LONG HighPart;
+        DWORD LowPart;
+    };
+  #endif
+    LONGLONG QuadPart;
+  }
+  LARGE_INTEGER, *PLARGE_INTEGER;
+  
+  // Some Windows-specific defines
+  #ifndef MAX_PATH
+    #define MAX_PATH 1024
+  #endif
+
+  #ifndef TRUE
+    #define TRUE true
+  #endif
+
+  #ifndef FALSE
+    #define FALSE false
+  #endif
+
+  #define VOID     void
+  #define WINAPI 
+
+  #define FILE_BEGIN    SEEK_SET
+  #define FILE_CURRENT  SEEK_CUR
+  #define FILE_END      SEEK_END
+  
+  #define CREATE_NEW    1
+  #define CREATE_ALWAYS 2
+  #define OPEN_EXISTING 3
+  #define OPEN_ALWAYS   4
+  
+  #define FILE_SHARE_READ 0x00000001L
+  #define GENERIC_WRITE   0x40000000
+  #define GENERIC_READ    0x80000000
+  
+  #define FILE_FLAG_DELETE_ON_CLOSE         1   // Sam: Added these two defines so it would compile.
+  #define FILE_FLAG_SEQUENTIAL_SCAN         2
+  
+  #define ERROR_SUCCESS                     0
+  #define ERROR_INVALID_FUNCTION            1
+  #define ERROR_FILE_NOT_FOUND              2
+  #define ERROR_ACCESS_DENIED               5
+  #define ERROR_NOT_ENOUGH_MEMORY           8
+  #define ERROR_BAD_FORMAT                 11
+  #define ERROR_NO_MORE_FILES              18
+  #define ERROR_GEN_FAILURE                31
+  #define ERROR_HANDLE_EOF                 38
+  #define ERROR_HANDLE_DISK_FULL           39
+  #define ERROR_NOT_SUPPORTED              50
+  #define ERROR_INVALID_PARAMETER          87
+  #define ERROR_DISK_FULL                 112
+  #define ERROR_CALL_NOT_IMPLEMENTED      120
+  #define ERROR_ALREADY_EXISTS            183
+  #define ERROR_CAN_NOT_COMPLETE         1003
+  #define ERROR_PARAMETER_QUOTA_EXCEEDED 1283
+  #define ERROR_FILE_CORRUPT             1392
+  #define ERROR_INSUFFICIENT_BUFFER      4999
+  
+  #define INVALID_HANDLE_VALUE ((HANDLE) -1)
+  
+  #ifndef min
+  #define min(a, b) ((a < b) ? a : b)
+  #endif
+  
+  #ifndef max
+  #define max(a, b) ((a > b) ? a : b)
+  #endif
+  
+  #define _stricmp strcasecmp
+  #define _strnicmp strncasecmp
+  
+  extern int globalerr;
+  
+  void  SetLastError(int err);
+  int   GetLastError();
+  char *ErrString(int err);
+
+  // Emulation of functions for file I/O available in Win32
+  HANDLE CreateFile(const char * lpFileName, DWORD dwDesiredAccess, DWORD dwShareMode, void * lpSecurityAttributes, DWORD dwCreationDisposition, DWORD dwFlagsAndAttributes, HANDLE hTemplateFile);
+  BOOL   CloseHandle(HANDLE hObject);
+
+  DWORD  GetFileSize(HANDLE hFile, DWORD * lpFileSizeHigh);
+  DWORD  SetFilePointer(HANDLE, LONG lDistanceToMove, LONG * lpDistanceToMoveHigh, DWORD dwMoveMethod);
+  BOOL   SetEndOfFile(HANDLE hFile);
+
+  BOOL   ReadFile(HANDLE hFile, void * lpBuffer, DWORD nNumberOfBytesToRead, DWORD * lpNumberOfBytesRead, void * lpOverLapped);
+  BOOL   WriteFile(HANDLE hFile, const void * lpBuffer, DWORD nNumberOfBytesToWrite, DWORD * lpNumberOfBytesWritten, void * lpOverLapped);
+
+  BOOL   IsBadReadPtr(const void * ptr, int size);
+  DWORD  GetFileAttributes(const char * szileName);
+
+  BOOL   DeleteFile(const char * lpFileName);
+  BOOL   MoveFile(const char * lpFromFileName, const char * lpToFileName);
+  void   GetTempPath(DWORD szTempLength, char * szTemp);
+  void   GetTempFileName(const char * lpTempFolderPath, const char * lpFileName, DWORD something, char * szLFName);
+
+  #define strnicmp strncasecmp
+
+#endif // !WIN32
+
+#if PLATFORM_LITTLE_ENDIAN
+    #define    BSWAP_INT16_UNSIGNED(a)          (a)
+    #define    BSWAP_INT16_SIGNED(a)            (a)
+    #define    BSWAP_INT32_UNSIGNED(a)          (a)
+    #define    BSWAP_INT32_SIGNED(a)            (a)
+    #define    BSWAP_ARRAY16_UNSIGNED(a,b)      {}
+    #define    BSWAP_ARRAY32_UNSIGNED(a,b)      {}
+    #define    BSWAP_TMPQSHUNT(a)               {}
+    #define    BSWAP_TMPQHEADER(a)              {}
+#else
+    extern unsigned short SwapUShort(unsigned short);
+    extern unsigned long SwapULong(unsigned long);
+    extern short SwapShort(unsigned short);
+    extern long SwapLong(unsigned long);
+    extern void ConvertUnsignedLongBuffer(unsigned long *buffer, unsigned long nbLongs);
+    extern void ConvertUnsignedShortBuffer(unsigned short *buffer, unsigned long nbShorts);
+    extern void ConvertTMPQShunt(void *shunt);
+    extern void ConvertTMPQHeader(void *header);
+    #define    BSWAP_INT16_UNSIGNED(a)          SwapUShort((a))
+    #define    BSWAP_INT32_UNSIGNED(a)          SwapULong((a))
+    #define    BSWAP_INT16_SIGNED(a)            SwapShort((a))
+    #define    BSWAP_INT32_SIGNED(a)            SwapLong((a))
+    #define    BSWAP_ARRAY16_UNSIGNED(a,b)      ConvertUnsignedShortBuffer((a),(b))
+    #define    BSWAP_ARRAY32_UNSIGNED(a,b)      ConvertUnsignedLongBuffer((a),(b))
+    #define    BSWAP_TMPQSHUNT(a)               ConvertTMPQShunt((a))
+    #define    BSWAP_TMPQHEADER(a)              ConvertTMPQHeader((a))
+#endif
+
+#endif // __STORMPORT_H__
diff --git a/contrib/vmap_extractor_v2/stormlib/StormPortLinux.cpp b/contrib/vmap_extractor_v2/stormlib/StormPortLinux.cpp
new file mode 100644
index 00000000000..0cd827fde9f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/StormPortLinux.cpp
@@ -0,0 +1,168 @@
+/********************************************************************
+*
+* Description:  implementation for StormLib - linux port
+*       intended to be used in GLdiablo
+*       
+*   ---->   StormLib was originally developed for Windows by
+*       Ladislav Zezula (www.zezula.net), and he did
+*       a _great_ job! Thanks Ladislav!
+*
+*   this is currently a quick and dirty hack to get it working
+*    don't expect beauty and/or miracles :)
+*
+*   these are function wraps to execute Windows API calls
+*        as native Macintosh file calls (open/close/read/write/...)
+*
+*   continue you work: added some wrapping functions for GNU/Linux  by XPinguin
+*
+* Author: Marko Friedemann <marko.friedemann@bmx-chemnitz.de>
+* Created at: Mon Jan 29 19:01:37 CEST 2001
+* Computer: whiplash.flachland-chemnitz.de 
+* System: Linux 2.4.0 on i686
+*    
+* Copyright (c) 2001 BMX-Chemnitz.DE All rights reserved.
+*
+********************************************************************/
+
+#ifndef _WIN32
+#include "StormPort.h"
+
+int globalerr;
+
+void SetLastError(int err)
+{
+    globalerr = err;
+}
+
+int GetLastError()
+{
+    return(globalerr);
+}
+
+char *ErrString(int err)
+{
+    switch (err) {
+    case ERROR_INVALID_FUNCTION:
+        return "function not implemented";
+    case ERROR_FILE_NOT_FOUND:
+        return "file not found";
+    case ERROR_ACCESS_DENIED:
+        return "access denied";
+    case ERROR_NOT_ENOUGH_MEMORY:
+        return "not enough memory";
+    case ERROR_BAD_FORMAT:
+        return "bad format";
+    case ERROR_NO_MORE_FILES:
+        return "no more files";
+    case ERROR_HANDLE_EOF:
+        return "access beyound EOF";
+    case ERROR_HANDLE_DISK_FULL:
+        return "no space left on device";
+    case ERROR_INVALID_PARAMETER:
+        return "invalid parameter";
+    case ERROR_DISK_FULL:
+        return "no space left on device";
+    case ERROR_ALREADY_EXISTS:
+        return "file exists";
+    case ERROR_CAN_NOT_COMPLETE:
+        return "operation cannot be completed";
+    default:
+        return "unknown error";
+    }
+}
+
+HANDLE CreateFile(const char *sFileName, DWORD ulMode, DWORD ulSharing, void *pSecAttrib, DWORD ulCreation, DWORD ulFlags, HANDLE hFile)
+{
+    switch (ulCreation) {
+    case OPEN_EXISTING:
+        return (HANDLE)open(sFileName, O_RDONLY | O_LARGEFILE);
+    case OPEN_ALWAYS:
+        return (HANDLE)open(sFileName, O_RDWR | O_CREAT);
+    case CREATE_NEW:
+        return (HANDLE)open(sFileName, O_RDWR | O_CREAT | O_TRUNC);
+    default:
+        return INVALID_HANDLE_VALUE;
+    }
+}
+
+BOOL CloseHandle(HANDLE hFile)
+{
+    return (close((int)hFile) == 0);
+}
+
+DWORD GetFileSize(HANDLE hFile, DWORD *ulOffSetHigh)
+{
+    if ((hFile == NULL) || (hFile == INVALID_HANDLE_VALUE))
+        return 0xffffffff;
+
+    struct stat fileinfo;
+    fstat((int)hFile, &fileinfo);
+    
+    return fileinfo.st_size;
+}
+
+DWORD SetFilePointer(HANDLE hFile, LONG lOffSetLow, LONG *pOffSetHigh, DWORD ulMethod)
+{
+    return lseek64((int)hFile, (off64_t)(*pOffSetHigh) << 32 | (DWORD)lOffSetLow, ulMethod);
+}
+
+BOOL SetEndOfFile(HANDLE hFile)
+{
+    return (ftruncate((int)hFile, lseek((int)hFile, 0, SEEK_CUR)) == 0);
+}
+
+BOOL ReadFile(HANDLE hFile, void *pBuffer, DWORD ulLen, DWORD *ulRead, void *pOverLapped)
+{
+    ssize_t count;
+    if ((count = read((int)hFile, pBuffer, ulLen)) == -1) {
+        *ulRead = 0;
+        return false;
+    }
+    *ulRead = count;
+    return true;
+}
+
+BOOL WriteFile(HANDLE hFile, const void *pBuffer, DWORD ulLen, DWORD *ulWritten, void *pOverLapped)
+{
+    ssize_t count;
+    if ((count = write((int)hFile, pBuffer, ulLen)) == -1) {
+        *ulWritten = 0;
+        return false;
+    }
+    *ulWritten = count;
+    return true;
+}
+
+// Check if a memory block is accessible for reading
+BOOL IsBadReadPtr(const void * ptr, int size)
+{
+    return FALSE;
+}
+
+// Returns attributes of a file
+DWORD GetFileAttributes(const char * szFileName)
+{
+    return 0;
+}
+
+void GetTempPath(DWORD szTempLength, char * szTemp)
+{
+    strncpy(szTemp, P_tmpdir, szTempLength);
+}
+
+void GetTempFileName(const char * lpTempFolderPath, const char * lpFileName, DWORD something, char * szLFName)
+{
+    strcpy(szLFName, tempnam(lpTempFolderPath, lpFileName));
+}
+
+BOOL DeleteFile(const char *lpFileName)
+{
+    return (BOOL)remove(lpFileName);
+}
+
+BOOL MoveFile(const char *lpExistingFileName, const char *lpNewFileName)
+{
+    return rename(lpExistingFileName, lpNewFileName);
+}	
+
+#endif
diff --git a/contrib/vmap_extractor_v2/stormlib/StormPortMac.cpp b/contrib/vmap_extractor_v2/stormlib/StormPortMac.cpp
new file mode 100644
index 00000000000..26f67872a14
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/StormPortMac.cpp
@@ -0,0 +1,762 @@
+/********************************************************************
+*
+* Description:  implementation for StormLib - Macintosh port
+*        
+*   these are function wraps to execute Windows API calls
+*   as native Macintosh file calls (open/close/read/write/...)
+*   requires Mac OS X
+*
+* Derived from Marko Friedemann <marko.friedemann@bmx-chemnitz.de>
+* StormPort.cpp for Linux
+*
+* Author: Daniel Chiaramello <daniel@chiaramello.net>
+*
+* Carbonized by: Sam Wilkins <swilkins1337@gmail.com>
+*
+********************************************************************/
+
+#ifndef _WIN32 || _WIN64
+#include "StormPort.h"
+#include "StormLib.h"
+
+// FUNCTIONS EXTRACTED FROM MOREFILE PACKAGE!!!
+// FEEL FREE TO REMOVE THEM AND TO ADD THE ORIGINAL ONES!
+
+/*****************************************************************************
+* BEGIN OF MOREFILES COPY-PASTE
+*****************************************************************************/
+
+#ifdef    __USEPRAGMAINTERNAL
+    #ifdef __MWERKS__
+        #pragma internal on
+    #endif
+#endif
+
+union TLongAnd4Bytes
+{
+    unsigned char bytes[4];
+    unsigned long uvalue;
+    signed long svalue;
+};
+
+
+static OSErr FSGetFullPath(const FSRef *ref, UInt8 *fullPath, UInt32 fullPathLength)
+{
+    OSErr       result;
+
+    result = FSRefMakePath(ref, fullPath, fullPathLength);
+    
+    return result;
+}
+
+static OSErr FSLocationFromFullPath(const void *fullPath, FSRef *ref)
+{
+    OSErr       result;
+    
+    result = FSPathMakeRef((UInt8 *)fullPath, ref, NULL); // Create an FSRef from the path
+    return result;
+}
+
+/*****************************************************************************/
+
+/*****************************************************************************/
+
+static OSErr FSCreateCompat(const FSRef *parentRef, OSType creator, OSType fileType, const UniChar *fileName, 
+                            UniCharCount nameLength, FSRef *ref)
+{
+    FSCatalogInfo theCatInfo;
+    OSErr theErr;
+    ((FileInfo *)&theCatInfo.finderInfo)->fileCreator = creator;
+    ((FileInfo *)&theCatInfo.finderInfo)->fileType = fileType;
+    ((FileInfo *)&theCatInfo.finderInfo)->finderFlags = 0;
+    SetPt(&((FileInfo *)&theCatInfo.finderInfo)->location, 0, 0);
+    ((FileInfo *)&theCatInfo.finderInfo)->reservedField = 0;
+        
+    theErr = FSCreateFileUnicode(parentRef, nameLength, fileName, kFSCatInfoFinderInfo, &theCatInfo, ref, NULL);
+    return theErr;
+}
+
+
+/*****************************************************************************/
+
+static OSErr FSOpenDFCompat(FSRef *ref, char permission, short *refNum)
+{
+    HFSUniStr255 forkName;
+    OSErr theErr;
+    Boolean isFolder, wasChanged;
+    
+    theErr = FSResolveAliasFile(ref, TRUE, &isFolder, &wasChanged);
+    if (theErr != noErr)
+        return theErr;
+    
+    FSGetDataForkName(&forkName);
+    theErr = FSOpenFork(ref, forkName.length, forkName.unicode, permission, refNum);
+    return theErr;
+}
+
+/*****************************************************************************
+* END OF MOREFILES COPY-PASTE
+*****************************************************************************/
+
+#pragma mark -
+
+int globalerr;
+
+/********************************************************************
+*    SwapLong
+********************************************************************/
+
+unsigned long SwapULong(unsigned long data)
+{
+    // Apple provided function
+    uint32_t result;
+
+    __asm__("lwbrx %0,0,%1" : "=r" (result) : "r" (&data), "m" (data));
+    return result;
+
+/*
+    TLongAnd4Bytes Work;
+    unsigned char * value_as_4bytes = (unsigned char *)&value;
+
+    Work.bytes[0] = value_as_4bytes[3];
+    Work.bytes[1] = value_as_4bytes[2];
+    Work.bytes[2] = value_as_4bytes[1];
+    Work.bytes[3] = value_as_4bytes[0];
+
+    return Work.uvalue;
+*/
+}
+
+long SwapLong(unsigned long data)
+{
+    // Apple provided function
+    uint32_t result;
+
+    __asm__("lwbrx %0,0,%1" : "=r" (result) : "r" (&data), "m" (data));
+    return (long)result;
+
+/*
+    TLongAnd4Bytes Work;
+    unsigned char * value_as_4bytes = (unsigned char *)&value;
+
+    Work.bytes[0] = value_as_4bytes[3];
+    Work.bytes[1] = value_as_4bytes[2];
+    Work.bytes[2] = value_as_4bytes[1];
+    Work.bytes[3] = value_as_4bytes[0];
+
+    return Work.svalue;
+*/
+}
+
+/********************************************************************
+*    SwapShort
+********************************************************************/
+unsigned short SwapUShort(unsigned short data)
+{
+    // Apple provided function
+    uint16_t result;
+    __asm__("lhbrx %0,0,%1" : "=r" (result) : "r" (&data), "m" (data));
+    return result;
+}
+
+short SwapShort(unsigned short data)
+{
+    // Apple provided function
+    uint16_t result;
+    __asm__("lhbrx %0,0,%1" : "=r" (result) : "r" (&data), "m" (data));
+    return (short)result;
+}
+
+/********************************************************************
+*    ConvertUnsignedLongBuffer
+********************************************************************/
+void ConvertUnsignedLongBuffer(unsigned long *buffer, unsigned long nbLongs)
+{
+    while (nbLongs-- > 0)
+    {
+        *buffer = SwapLong(*buffer);
+        buffer++;
+    }
+}
+
+/********************************************************************
+*    ConvertUnsignedShortBuffer
+********************************************************************/
+void ConvertUnsignedShortBuffer(unsigned short *buffer, unsigned long nbShorts)
+{
+    while (nbShorts-- > 0)
+    {
+        *buffer = SwapShort(*buffer);
+        buffer++;
+    }
+}
+
+/********************************************************************
+*    ConvertTMPQShunt
+********************************************************************/
+void ConvertTMPQShunt(void *shunt)
+{
+    TMPQShunt * theShunt = (TMPQShunt *)shunt;
+
+    theShunt->dwID = SwapULong(theShunt->dwID);
+    theShunt->dwUnknown = SwapULong(theShunt->dwUnknown);
+    theShunt->dwHeaderPos = SwapULong(theShunt->dwHeaderPos);
+}
+
+/********************************************************************
+*    ConvertTMPQHeader
+********************************************************************/
+void ConvertTMPQHeader(void *header)
+{
+    TMPQHeader2 * theHeader = (TMPQHeader2 *)header;
+    
+    theHeader->dwID = SwapULong(theHeader->dwID);
+    theHeader->dwHeaderSize = SwapULong(theHeader->dwHeaderSize);
+    theHeader->dwArchiveSize = SwapULong(theHeader->dwArchiveSize);
+    theHeader->wFormatVersion = SwapUShort(theHeader->wFormatVersion);
+    theHeader->wBlockSize = SwapUShort(theHeader->wBlockSize);
+    theHeader->dwHashTablePos = SwapULong(theHeader->dwHashTablePos);
+    theHeader->dwBlockTablePos = SwapULong(theHeader->dwBlockTablePos);
+    theHeader->dwHashTableSize = SwapULong(theHeader->dwHashTableSize);
+    theHeader->dwBlockTableSize = SwapULong(theHeader->dwBlockTableSize);
+
+    if(theHeader->wFormatVersion >= MPQ_FORMAT_VERSION_2)
+    {
+        DWORD dwTemp = theHeader->ExtBlockTablePos.LowPart;
+        theHeader->ExtBlockTablePos.LowPart = theHeader->ExtBlockTablePos.HighPart;
+        theHeader->ExtBlockTablePos.HighPart = dwTemp;
+        theHeader->ExtBlockTablePos.LowPart = SwapULong(theHeader->ExtBlockTablePos.LowPart);
+        theHeader->ExtBlockTablePos.HighPart = SwapULong(theHeader->ExtBlockTablePos.HighPart);
+        theHeader->wHashTablePosHigh = SwapUShort(theHeader->wHashTablePosHigh);
+        theHeader->wBlockTablePosHigh = SwapUShort(theHeader->wBlockTablePosHigh);
+    }
+}
+
+/********************************************************************
+*    ConvertTMPQHash
+********************************************************************/
+void ConvertHashTable(void *hashtable, DWORD nHashEntries)
+{
+    TMPQHash * theHash = (TMPQHash *)hashtable;
+    USHORT lcLocale;
+
+    for(DWORD i = 0; i < nHashEntries; i++, theHash++)
+    {
+        lcLocale = theHash->lcLocale;
+        theHash->lcLocale = theHash->wPlatform;
+        theHash->wPlatform = lcLocale;
+    }
+}
+
+#pragma mark -
+
+/********************************************************************
+*    SetLastError
+********************************************************************/
+void SetLastError(int err)
+{
+    globalerr = err;
+}
+
+/********************************************************************
+*    GetLastError
+********************************************************************/
+int GetLastError()
+{
+    return globalerr;
+}
+
+/********************************************************************
+*    ErrString
+********************************************************************/
+char *ErrString(int err)
+{
+    switch (err) 
+    {
+        case ERROR_INVALID_FUNCTION:
+            return "function not implemented";
+        case ERROR_FILE_NOT_FOUND:
+            return "file not found";
+        case ERROR_ACCESS_DENIED:
+            return "access denied";
+        case ERROR_NOT_ENOUGH_MEMORY:
+            return "not enough memory";
+        case ERROR_BAD_FORMAT:
+            return "bad format";
+        case ERROR_NO_MORE_FILES:
+            return "no more files";
+        case ERROR_HANDLE_EOF:
+            return "access beyound EOF";
+        case ERROR_HANDLE_DISK_FULL:
+            return "no space left on device";
+        case ERROR_INVALID_PARAMETER:
+            return "invalid parameter";
+        case ERROR_DISK_FULL:
+            return "no space left on device";
+        case ERROR_ALREADY_EXISTS:
+            return "file exists";
+        case ERROR_CAN_NOT_COMPLETE:
+            return "operation cannot be completed";
+        case ERROR_INSUFFICIENT_BUFFER:
+            return "insufficient buffer";
+        default:
+            return "unknown error";
+    }
+}
+
+#pragma mark -
+
+/********************************************************************
+*    GetTempPath - returns a '/' or ':'-terminated path
+*        szTempLength: length for path
+*        szTemp: file path
+********************************************************************/
+void GetTempPath(DWORD szTempLength, char * szTemp)  // I think I'll change this to use FSRefs.
+{
+    FSRef   theFSRef;
+    OSErr theErr = FSFindFolder(kOnAppropriateDisk, kTemporaryFolderType, kCreateFolder, &theFSRef);
+    if (theErr == noErr)
+    {
+        theErr = FSGetFullPath(&theFSRef, (UInt8 *)szTemp, MAX_PATH);
+        if (theErr != noErr)
+            szTemp[0] = '\0';
+    }
+    else
+        szTemp[0] = '\0';
+    strcat(szTemp, "/");
+    
+    SetLastError(theErr);
+}
+
+/********************************************************************
+*    GetTempFileName
+*        lpTempFolderPath: the temporary folder path, terminated by "/"
+*        lpFileName: a file name base
+*        something: unknown
+*        szLFName: the final path, built from the path, the file name and a random pattern
+********************************************************************/
+void GetTempFileName(const char * lpTempFolderPath, const char * lpFileName, DWORD something, char * szLFName)
+{
+#pragma unused (something)
+    char    tmp[2] = "A";
+
+    while (true)
+    {
+        HANDLE  fHandle;
+
+        strcpy(szLFName, lpTempFolderPath);
+        strcat(szLFName, lpFileName);
+        strcat(szLFName, tmp);
+        
+        if ((fHandle = CreateFile(szLFName, GENERIC_READ, 0, NULL, OPEN_EXISTING, 0, 0)) == INVALID_HANDLE_VALUE)
+            // OK we found it!
+            break;
+        CloseHandle(fHandle);
+        tmp[0]++;
+    }
+}
+
+/********************************************************************
+*    DeleteFile
+*        lpFileName: file path
+********************************************************************/
+BOOL DeleteFile(const char * lpFileName)
+{
+    OSErr   theErr;
+    FSRef   theFileRef;
+    
+    theErr = FSLocationFromFullPath(lpFileName, &theFileRef);
+    if (theErr != noErr)
+    {
+        SetLastError(theErr);
+        return FALSE;
+    }
+    
+    theErr = FSDeleteObject(&theFileRef);
+    
+    SetLastError(theErr);
+
+    return theErr == noErr;
+}
+
+/********************************************************************
+*    MoveFile
+*        lpFromFileName: old file path
+*        lpToFileName: new file path
+********************************************************************/
+BOOL MoveFile(const char * lpFromFileName, const char * lpToFileName)
+{
+    OSErr theErr;
+    FSRef fromFileRef;
+    FSRef toFileRef;
+    FSRef parentFolderRef;
+    
+    // Get the path to the old file
+    theErr = FSLocationFromFullPath(lpFromFileName, &fromFileRef);
+    if (theErr != noErr)
+    {
+        SetLastError(theErr);
+        return false;
+    }
+    
+    // Get the path to the new folder for the file
+    char folderName[strlen(lpToFileName)];
+    CFStringRef folderPathCFString = CFStringCreateWithCString(NULL, lpToFileName, kCFStringEncodingUTF8);
+    CFURLRef fileURL = CFURLCreateWithFileSystemPath(NULL, folderPathCFString, kCFURLPOSIXPathStyle, FALSE);
+    CFURLRef folderURL = CFURLCreateCopyDeletingLastPathComponent(NULL, fileURL);
+    CFURLGetFileSystemRepresentation(folderURL, TRUE, (UInt8 *)folderName, strlen(lpToFileName));
+    theErr = FSLocationFromFullPath(folderName, &parentFolderRef);
+    CFRelease(fileURL);
+    CFRelease(folderURL);
+    CFRelease(folderPathCFString);
+    
+    // Move the old file
+    theErr = FSMoveObject(&fromFileRef, &parentFolderRef, &toFileRef);
+    if (theErr != noErr)
+    {
+        SetLastError(theErr);
+        return false;
+    }
+    
+    // Get a CFString for the new file name
+    CFStringRef newFileNameCFString = CFStringCreateWithCString(NULL, lpToFileName, kCFStringEncodingUTF8);
+    fileURL = CFURLCreateWithFileSystemPath(NULL, newFileNameCFString, kCFURLPOSIXPathStyle, FALSE);
+    CFRelease(newFileNameCFString);
+    newFileNameCFString = CFURLCopyLastPathComponent(fileURL);
+    CFRelease(fileURL);
+    
+    // Convert CFString to Unicode and rename the file
+    UniChar unicodeFileName[256]; 
+    CFStringGetCharacters(newFileNameCFString, CFRangeMake(0, CFStringGetLength(newFileNameCFString)), 
+                          unicodeFileName);
+    theErr = FSRenameUnicode(&toFileRef, CFStringGetLength(newFileNameCFString), unicodeFileName, 
+                             kTextEncodingUnknown, NULL);
+    if (theErr != noErr)
+    {
+        SetLastError(theErr);
+        CFRelease(newFileNameCFString);
+        return false;
+    }
+    
+    CFRelease(newFileNameCFString);
+    
+    SetLastError(theErr);
+    return true;
+}
+
+/********************************************************************
+*    CreateFile
+*        ulMode: GENERIC_READ | GENERIC_WRITE
+*        ulSharing: FILE_SHARE_READ
+*        pSecAttrib: NULL
+*        ulCreation: OPEN_EXISTING, OPEN_ALWAYS, CREATE_NEW
+*        ulFlags: 0
+*        hFile: NULL
+********************************************************************/
+HANDLE CreateFile(  const char *sFileName,          /* file name */
+                    DWORD ulMode,                   /* access mode */
+                    DWORD ulSharing,                /* share mode */
+                    void *pSecAttrib,               /* SD */
+                    DWORD ulCreation,               /* how to create */
+                    DWORD ulFlags,                  /* file attributes */
+                    HANDLE hFile    )               /* handle to template file */
+{
+#pragma unused (ulSharing, pSecAttrib, ulFlags, hFile)
+
+    OSErr   theErr;
+    FSRef   theFileRef;
+    FSRef   theParentRef;
+    short   fileRef;
+    char    permission;
+    static OSType   gCreator;
+    static OSType   gType;
+    
+    theErr = FSLocationFromFullPath(sFileName, &theFileRef);
+    if (theErr == fnfErr)
+    {   // Create the FSRef for the parent directory.
+        memset(&theFileRef, 0, sizeof(FSRef));
+        UInt8 folderName[MAX_PATH];
+        CFStringRef folderPathCFString = CFStringCreateWithCString(NULL, sFileName, kCFStringEncodingUTF8);
+        CFURLRef fileURL = CFURLCreateWithFileSystemPath(NULL, folderPathCFString, kCFURLPOSIXPathStyle, FALSE);
+        CFURLRef folderURL = CFURLCreateCopyDeletingLastPathComponent(NULL, fileURL);
+        CFURLGetFileSystemRepresentation(folderURL, TRUE, folderName, MAX_PATH);
+        theErr = FSLocationFromFullPath(folderName, &theParentRef);
+        CFRelease(fileURL);
+        CFRelease(folderURL);
+        CFRelease(folderPathCFString);
+    }         
+    if (theErr != noErr)
+    {
+        SetLastError(theErr);
+        if (ulCreation == OPEN_EXISTING || theErr != fnfErr)
+            return INVALID_HANDLE_VALUE;
+    }
+    
+    if (ulCreation != OPEN_EXISTING)
+    {   /* We create the file */
+        UniChar unicodeFileName[256];
+        CFStringRef filePathCFString = CFStringCreateWithCString(NULL, sFileName, kCFStringEncodingUTF8);
+        CFURLRef fileURL = CFURLCreateWithFileSystemPath(NULL, filePathCFString, kCFURLPOSIXPathStyle, FALSE);
+        CFStringRef fileNameCFString = CFURLCopyLastPathComponent(fileURL);
+        CFStringGetCharacters(fileNameCFString, CFRangeMake(0, CFStringGetLength(fileNameCFString)), 
+                              unicodeFileName);
+        theErr = FSCreateCompat(&theParentRef, gCreator, gType, unicodeFileName, 
+                                CFStringGetLength(fileNameCFString), &theFileRef);
+        CFRelease(fileNameCFString);
+        CFRelease(filePathCFString);
+        CFRelease(fileURL);
+        if (theErr != noErr)
+        {
+            SetLastError(theErr);
+            return INVALID_HANDLE_VALUE;
+        }
+    }
+
+    if (ulMode == GENERIC_READ)
+        permission = fsRdPerm;
+    else
+    {
+        if (ulMode == GENERIC_WRITE)
+            permission = fsWrPerm;
+        else
+            permission = fsRdWrPerm;
+    }
+    theErr = FSOpenDFCompat(&theFileRef, permission, &fileRef);
+    
+    SetLastError(theErr);
+
+    if (theErr == noErr)
+        return (HANDLE)(int)fileRef;
+    else
+        return INVALID_HANDLE_VALUE;
+}
+
+/********************************************************************
+*    CloseHandle
+********************************************************************/
+BOOL CloseHandle(   HANDLE hFile    )    /* handle to object */
+{
+    OSErr theErr;
+    
+    if ((hFile == NULL) || (hFile == INVALID_HANDLE_VALUE))
+        return FALSE;
+
+    theErr = FSCloseFork((short)(int)hFile);
+    
+    SetLastError(theErr);
+    
+    return theErr != noErr;
+}
+
+/********************************************************************
+*    GetFileSize
+********************************************************************/
+DWORD GetFileSize(  HANDLE hFile,           /* handle to file */
+                    DWORD *ulOffSetHigh )   /* high-order word of file size */
+{
+    SInt64  fileLength;
+    OSErr   theErr;
+
+    if ((hFile == NULL) || (hFile == INVALID_HANDLE_VALUE))
+    {
+        SetLastError(theErr);
+        return -1u;
+    }
+    
+    theErr = FSGetForkSize((short)(int)hFile, &fileLength);
+    if (theErr != noErr)
+    {
+        SetLastError(theErr);
+        return -1u;
+    }
+    
+    if (ulOffSetHigh != NULL)
+        *ulOffSetHigh = fileLength >> 32;
+
+    SetLastError(theErr);
+    
+    return fileLength;
+}
+
+/********************************************************************
+*    SetFilePointer
+*        pOffSetHigh: NULL
+*        ulMethod: FILE_BEGIN, FILE_CURRENT
+********************************************************************/
+DWORD SetFilePointer(   HANDLE hFile,           /* handle to file */
+                        LONG lOffSetLow,        /* bytes to move pointer */
+                        LONG *pOffSetHigh,      /* bytes to move pointer */
+                        DWORD ulMethod  )       /* starting point */
+{
+    OSErr theErr;
+
+    if (ulMethod == FILE_CURRENT)
+    {
+        SInt64  bytesToMove;
+        
+        if (pOffSetHigh != NULL)
+            bytesToMove = ((SInt64)*pOffSetHigh << 32) + lOffSetLow;
+        else
+            bytesToMove = lOffSetLow;
+        
+        SInt64  newPos;
+        
+        theErr = FSSetForkPosition((short)(int)hFile, fsFromMark, bytesToMove);
+        if (theErr != noErr)
+        {
+            SetLastError(theErr);
+            return -1u;
+        }
+        
+        theErr = FSGetForkPosition((short)(int)hFile, &newPos);
+        if (theErr != noErr)
+        {
+            SetLastError(theErr);
+            return -1u;
+        }
+        
+        if (pOffSetHigh != NULL)
+            *pOffSetHigh = newPos >> 32;
+        
+        SetLastError(theErr);
+        return newPos;
+    }
+    else if (ulMethod == FILE_BEGIN)
+    {
+        SInt64  bytesToMove;
+        
+        if (pOffSetHigh != NULL)
+            bytesToMove = ((SInt64)*pOffSetHigh << 32) + lOffSetLow;
+        else
+            bytesToMove = lOffSetLow;
+        
+        theErr = FSSetForkPosition((short)(int)hFile, fsFromStart, bytesToMove);
+        if (theErr != noErr)
+        {
+            SetLastError(theErr);
+            return -1u;
+        }
+        
+        SetLastError(theErr);
+        return lOffSetLow;
+    }
+    else
+    {
+        SInt64  bytesToMove;
+        
+        if (pOffSetHigh != NULL)
+            bytesToMove = ((SInt64)*pOffSetHigh << 32) + lOffSetLow;
+        else
+            bytesToMove = lOffSetLow;
+        
+        SInt64  newPos;
+        
+        theErr = FSSetForkPosition((short)(int)hFile, fsFromLEOF, bytesToMove);
+        if (theErr != noErr)
+        {
+            SetLastError(theErr);
+            return -1u;
+        }
+        
+        theErr = FSGetForkPosition((short)(int)hFile, &newPos);
+        if (theErr != noErr)
+        {
+            SetLastError(theErr);
+            return -1u;
+        }
+        
+        if (pOffSetHigh != NULL)
+            *pOffSetHigh = newPos >> 32;
+        
+        SetLastError(theErr);
+        return newPos;
+    }
+}
+
+/********************************************************************
+*    SetEndOfFile
+********************************************************************/
+BOOL SetEndOfFile(  HANDLE hFile    )   /* handle to file */
+{
+    OSErr theErr;
+    
+    theErr = FSSetForkSize((short)(int)hFile, fsAtMark, 0);
+    
+    SetLastError(theErr);
+    
+    return theErr == noErr;
+}
+
+/********************************************************************
+*    ReadFile
+*        pOverLapped: NULL
+********************************************************************/
+BOOL ReadFile(  HANDLE hFile,           /* handle to file */
+                void *pBuffer,          /* data buffer */
+                DWORD ulLen,            /* number of bytes to read */
+                DWORD *ulRead,          /* number of bytes read */
+                void *pOverLapped   )   /* overlapped buffer */
+{
+#pragma unused (pOverLapped)
+
+    ByteCount   nbCharsRead;
+    OSErr       theErr;
+    
+    nbCharsRead = ulLen;
+    theErr = FSReadFork((short)(int)hFile, fsAtMark, 0, nbCharsRead, pBuffer, &nbCharsRead);
+    *ulRead = nbCharsRead;
+    
+    SetLastError(theErr);
+    
+    return theErr == noErr;
+}
+
+/********************************************************************
+*    WriteFile
+*        pOverLapped: NULL
+********************************************************************/
+BOOL WriteFile( HANDLE hFile,           /* handle to file */
+                const void *pBuffer,    /* data buffer */
+                DWORD ulLen,            /* number of bytes to write */
+                DWORD *ulWritten,       /* number of bytes written */
+                void *pOverLapped   )   /* overlapped buffer */
+{
+#pragma unused (pOverLapped)
+
+    ByteCount   nbCharsToWrite;
+    OSErr       theErr;
+    
+    nbCharsToWrite = ulLen; 
+    theErr = FSWriteFork((short)(int)hFile, fsAtMark, 0, nbCharsToWrite, pBuffer, &nbCharsToWrite);
+    *ulWritten = nbCharsToWrite;
+    
+    SetLastError(theErr);
+        
+    return theErr == noErr;
+}
+
+// Check if a memory block is accessible for reading. It's probably too
+// hard to check on Mac, so sorry, we'll just have to crash
+BOOL IsBadReadPtr(const void * ptr, int size)
+{
+#pragma unused (ptr, size)
+
+    return FALSE;
+}
+
+// Returns attributes of a file. Actually, it doesn't, it just checks if 
+// the file exists, since that's all StormLib uses it for
+DWORD GetFileAttributes(const char * szFileName)
+{
+    FSRef       theRef;
+    OSErr       theErr;
+    
+    theErr = FSLocationFromFullPath(szFileName, &theRef);
+    
+    if (theErr != noErr)
+        return -1u;
+    else
+        return 0;
+}
+
+#endif
diff --git a/contrib/vmap_extractor_v2/stormlib/bzip2/CHANGES b/contrib/vmap_extractor_v2/stormlib/bzip2/CHANGES
new file mode 100644
index 00000000000..e31b03a0118
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/LICENSE b/contrib/vmap_extractor_v2/stormlib/bzip2/LICENSE
new file mode 100644
index 00000000000..e60845b4dcc
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/Makefile b/contrib/vmap_extractor_v2/stormlib/bzip2/Makefile
new file mode 100644
index 00000000000..eea329a626e
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/Makefile-libbz2_so b/contrib/vmap_extractor_v2/stormlib/bzip2/Makefile-libbz2_so
new file mode 100644
index 00000000000..458c5a135e7
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/README b/contrib/vmap_extractor_v2/stormlib/bzip2/README
new file mode 100644
index 00000000000..1aff4487e8c
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/README.COMPILATION.PROBLEMS b/contrib/vmap_extractor_v2/stormlib/bzip2/README.COMPILATION.PROBLEMS
new file mode 100644
index 00000000000..f1bc396b765
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/README.XML.STUFF b/contrib/vmap_extractor_v2/stormlib/bzip2/README.XML.STUFF
new file mode 100644
index 00000000000..0ff209f4466
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/Y2K_INFO b/contrib/vmap_extractor_v2/stormlib/bzip2/Y2K_INFO
new file mode 100644
index 00000000000..55fd56a2edb
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/blocksort.c b/contrib/vmap_extractor_v2/stormlib/bzip2/blocksort.c
new file mode 100644
index 00000000000..33ec9f5dcb0
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bz-common.xsl b/contrib/vmap_extractor_v2/stormlib/bzip2/bz-common.xsl
new file mode 100644
index 00000000000..66fcd6fe0b6
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bz-fo.xsl b/contrib/vmap_extractor_v2/stormlib/bzip2/bz-fo.xsl
new file mode 100644
index 00000000000..7f2a7674f04
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bz-html.xsl b/contrib/vmap_extractor_v2/stormlib/bzip2/bz-html.xsl
new file mode 100644
index 00000000000..1785fffbc95
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzdiff b/contrib/vmap_extractor_v2/stormlib/bzip2/bzdiff
new file mode 100644
index 00000000000..3c2eb859fca
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzdiff.1 b/contrib/vmap_extractor_v2/stormlib/bzip2/bzdiff.1
new file mode 100644
index 00000000000..adb7a8e724e
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzgrep b/contrib/vmap_extractor_v2/stormlib/bzip2/bzgrep
new file mode 100644
index 00000000000..dbfc00e8dbe
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzgrep.1 b/contrib/vmap_extractor_v2/stormlib/bzip2/bzgrep.1
new file mode 100644
index 00000000000..930af8c7fcb
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzip.css b/contrib/vmap_extractor_v2/stormlib/bzip2/bzip.css
new file mode 100644
index 00000000000..43193d8db0b
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzip2.1 b/contrib/vmap_extractor_v2/stormlib/bzip2/bzip2.1
new file mode 100644
index 00000000000..d2c06615683
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzip2.1.preformatted b/contrib/vmap_extractor_v2/stormlib/bzip2/bzip2.1.preformatted
new file mode 100644
index 00000000000..129ca835c9c
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzip2.c b/contrib/vmap_extractor_v2/stormlib/bzip2/bzip2.c
new file mode 100644
index 00000000000..79f87a51986
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzip2.txt b/contrib/vmap_extractor_v2/stormlib/bzip2/bzip2.txt
new file mode 100644
index 00000000000..bf895b6cb8a
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzip2recover.c b/contrib/vmap_extractor_v2/stormlib/bzip2/bzip2recover.c
new file mode 100644
index 00000000000..5cd405dd4cb
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzlib.c b/contrib/vmap_extractor_v2/stormlib/bzip2/bzlib.c
new file mode 100644
index 00000000000..195f51a7840
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/bzlib.c
@@ -0,0 +1,1617 @@
+
+/*-------------------------------------------------------------*/
+/*--- 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.
+--*/
+
+#define _CRT_SECURE_NO_DEPRECATE
+#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 = 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 = BZALLOC( n                  * sizeof(UInt32) );
+   s->arr2 = BZALLOC( (n+BZ_N_OVERSHOOT) * sizeof(UInt32) );
+   s->ftab = 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 = 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 = 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 = 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 = 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 = 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 = 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 = 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  = 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 = 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 = 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/contrib/vmap_extractor_v2/stormlib/bzip2/bzlib.h b/contrib/vmap_extractor_v2/stormlib/bzip2/bzlib.h
new file mode 100644
index 00000000000..323724394a2
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzlib_private.h b/contrib/vmap_extractor_v2/stormlib/bzip2/bzlib_private.h
new file mode 100644
index 00000000000..ca76fe62b3b
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzmore b/contrib/vmap_extractor_v2/stormlib/bzip2/bzmore
new file mode 100644
index 00000000000..d3140434049
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/bzmore.1 b/contrib/vmap_extractor_v2/stormlib/bzip2/bzmore.1
new file mode 100644
index 00000000000..b437d3b031f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/compress.c b/contrib/vmap_extractor_v2/stormlib/bzip2/compress.c
new file mode 100644
index 00000000000..7e0c29155ab
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/crctable.c b/contrib/vmap_extractor_v2/stormlib/bzip2/crctable.c
new file mode 100644
index 00000000000..b6dadfc62f2
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/decompress.c b/contrib/vmap_extractor_v2/stormlib/bzip2/decompress.c
new file mode 100644
index 00000000000..81c3d2cc3f4
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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 = BZALLOC( s->blockSize100k * 100000 * sizeof(UInt16) );
+         s->ll4  = BZALLOC( 
+                      ((1 + s->blockSize100k * 100000) >> 1) * sizeof(UChar) 
+                   );
+         if (s->ll16 == NULL || s->ll4 == NULL) RETURN(BZ_MEM_ERROR);
+      } else {
+         s->tt  = 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/contrib/vmap_extractor_v2/stormlib/bzip2/dlltest.c b/contrib/vmap_extractor_v2/stormlib/bzip2/dlltest.c
new file mode 100644
index 00000000000..eb86bb61a59
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/dlltest.dsp b/contrib/vmap_extractor_v2/stormlib/bzip2/dlltest.dsp
new file mode 100644
index 00000000000..04819a49563
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/entities.xml b/contrib/vmap_extractor_v2/stormlib/bzip2/entities.xml
new file mode 100644
index 00000000000..6d0975fdbf6
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/format.pl b/contrib/vmap_extractor_v2/stormlib/bzip2/format.pl
new file mode 100644
index 00000000000..8ab47acd384
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/huffman.c b/contrib/vmap_extractor_v2/stormlib/bzip2/huffman.c
new file mode 100644
index 00000000000..5bf190be9a1
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/libbz2.def b/contrib/vmap_extractor_v2/stormlib/bzip2/libbz2.def
new file mode 100644
index 00000000000..4f83fcc6102
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/libbz2.dsp b/contrib/vmap_extractor_v2/stormlib/bzip2/libbz2.dsp
new file mode 100644
index 00000000000..06c1d376251
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/libbz2.dsp
@@ -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/contrib/vmap_extractor_v2/stormlib/bzip2/makefile.msc b/contrib/vmap_extractor_v2/stormlib/bzip2/makefile.msc
new file mode 100644
index 00000000000..6a628a753a0
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/manual.html b/contrib/vmap_extractor_v2/stormlib/bzip2/manual.html
new file mode 100644
index 00000000000..b28cc79a8c6
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/manual.pdf b/contrib/vmap_extractor_v2/stormlib/bzip2/manual.pdf
new file mode 100644
index 00000000000..394b8092565
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/manual.pdf
diff --git a/contrib/vmap_extractor_v2/stormlib/bzip2/manual.ps b/contrib/vmap_extractor_v2/stormlib/bzip2/manual.ps
new file mode 100644
index 00000000000..03831d194c8
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/manual.xml b/contrib/vmap_extractor_v2/stormlib/bzip2/manual.xml
new file mode 100644
index 00000000000..1ab5bd71d9e
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/mk251.c b/contrib/vmap_extractor_v2/stormlib/bzip2/mk251.c
new file mode 100644
index 00000000000..205778a84e6
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/randtable.c b/contrib/vmap_extractor_v2/stormlib/bzip2/randtable.c
new file mode 100644
index 00000000000..940462d693d
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/sample1.bz2 b/contrib/vmap_extractor_v2/stormlib/bzip2/sample1.bz2
new file mode 100644
index 00000000000..18dea60043b
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/sample1.bz2
diff --git a/contrib/vmap_extractor_v2/stormlib/bzip2/sample1.ref b/contrib/vmap_extractor_v2/stormlib/bzip2/sample1.ref
new file mode 100644
index 00000000000..a56e52b77f9
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/sample1.ref
diff --git a/contrib/vmap_extractor_v2/stormlib/bzip2/sample2.bz2 b/contrib/vmap_extractor_v2/stormlib/bzip2/sample2.bz2
new file mode 100644
index 00000000000..d5a6160ba20
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/sample2.bz2
diff --git a/contrib/vmap_extractor_v2/stormlib/bzip2/sample2.ref b/contrib/vmap_extractor_v2/stormlib/bzip2/sample2.ref
new file mode 100644
index 00000000000..34af95839a0
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/sample2.ref
diff --git a/contrib/vmap_extractor_v2/stormlib/bzip2/sample3.bz2 b/contrib/vmap_extractor_v2/stormlib/bzip2/sample3.bz2
new file mode 100644
index 00000000000..d90cff9208f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/sample3.bz2
diff --git a/contrib/vmap_extractor_v2/stormlib/bzip2/sample3.ref b/contrib/vmap_extractor_v2/stormlib/bzip2/sample3.ref
new file mode 100644
index 00000000000..775a2f68e21
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/spewG.c b/contrib/vmap_extractor_v2/stormlib/bzip2/spewG.c
new file mode 100644
index 00000000000..7934e765818
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/unzcrash.c b/contrib/vmap_extractor_v2/stormlib/bzip2/unzcrash.c
new file mode 100644
index 00000000000..f0f17fcca53
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/words0 b/contrib/vmap_extractor_v2/stormlib/bzip2/words0
new file mode 100644
index 00000000000..164a8ed287a
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/words1 b/contrib/vmap_extractor_v2/stormlib/bzip2/words1
new file mode 100644
index 00000000000..2e83de9f083
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/words2 b/contrib/vmap_extractor_v2/stormlib/bzip2/words2
new file mode 100644
index 00000000000..203ee39c4c2
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/words3 b/contrib/vmap_extractor_v2/stormlib/bzip2/words3
new file mode 100644
index 00000000000..7a6b462443c
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/bzip2/xmlproc.sh b/contrib/vmap_extractor_v2/stormlib/bzip2/xmlproc.sh
new file mode 100644
index 00000000000..6fe4d5748bb
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/bzip2/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/contrib/vmap_extractor_v2/stormlib/huffman/huff.cpp b/contrib/vmap_extractor_v2/stormlib/huffman/huff.cpp
new file mode 100644
index 00000000000..612fcb08386
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/huffman/huff.cpp
@@ -0,0 +1,1453 @@
+/*****************************************************************************/
+/* huffman.cpp                       Copyright (c) Ladislav Zezula 1998-2003 */
+/*---------------------------------------------------------------------------*/
+/* This module contains Huffmann (de)compression methods                     */
+/*                                                                           */
+/* Authors : Ladislav Zezula (ladik.zezula.net)                              */
+/*           ShadowFlare     (BlakFlare@hotmail.com)                         */
+/*                                                                           */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* xx.xx.xx  1.00  Lad  The first version of dcmp.cpp                        */
+/* 03.05.03  1.00  Lad  Added compression methods                            */
+/* 19.11.03  1.01  Dan  Big endian handling                                  */
+/* 08.12.03  2.01  Dan  High-memory handling (> 0x80000000)                  */
+/*****************************************************************************/
+ 
+#include <assert.h>
+#include <string.h>
+ 
+#include "huff.h"
+
+// Special for Mac - we have to know if normal pointer greater or less
+// than 0x80000000. This variable is used in the PTR_VALID and PTR_INVALID
+// macros
+static long mul = 1;
+
+#define PTR_VALID(ptr)           (((LONG_PTR)(ptr) * mul) > 0)
+#define PTR_INVALID(ptr)         (((LONG_PTR)(ptr) * mul) < 0)
+#define PTR_INVALID_OR_NULL(ptr) (((LONG_PTR)(ptr) * mul) <= 0)
+
+ 
+//-----------------------------------------------------------------------------
+// Methods of the THTreeItem struct
+ 
+// 1501DB70
+THTreeItem * THTreeItem::Call1501DB70(THTreeItem * pLast)
+{
+    if(pLast == NULL)
+        pLast = this + 1;
+    return pLast;
+}
+ 
+// Gets previous Huffman tree item (?)
+THTreeItem * THTreeItem::GetPrevItem(LONG_PTR value)
+{
+    if(PTR_INVALID(prev))
+        return PTR_NOT(prev);
+ 
+    if(value == -1 || PTR_INVALID(value))
+        value = (long)(this - next->prev);
+    return prev + value;
+ 
+// OLD VERSION
+//  if(PTR_INT(value) < 0)
+//      value = PTR_INT((item - item->next->prev));
+//  return (THTreeItem *)((char *)prev + value);
+}
+ 
+// 1500F5E0
+void THTreeItem::ClearItemLinks()
+{
+    next = prev = NULL;
+}
+ 
+// 1500BC90
+void THTreeItem::RemoveItem()
+{
+    THTreeItem * pTemp;                // EDX
+ 
+    if(next != NULL)
+    {
+        pTemp = prev;
+       
+        if(PTR_INVALID_OR_NULL(pTemp))
+            pTemp = PTR_NOT(pTemp);
+        else
+            pTemp += (this - next->prev);
+ 
+        pTemp->next = next;
+        next->prev  = prev;
+        next = prev = NULL;
+    }
+}
+ 
+/*
+// OLD VERSION : Removes item from the tree (?)
+static void RemoveItem(THTreeItem * item)
+{
+    THTreeItem * next = item->next;     // ESI
+    THTreeItem * prev = item->prev;     // EDX
+ 
+    if(next == NULL)
+        return;
+ 
+    if(PTR_INT(prev) < 0)
+        prev = PTR_NOT(prev);
+    else
+        // ??? usually item == next->prev, so what is it ?
+        prev = (THTreeItem *)((unsigned char *)prev + (unsigned long)((unsigned char *)item - (unsigned char *)(next->prev)));
+ 
+    // Remove HTree item from the chain
+    prev->next = next;                  // Sets the 'first' pointer
+    next->prev = item->prev;
+ 
+    // Invalidate pointers
+    item->next = NULL;
+    item->prev = NULL;
+}
+*/
+ 
+//-----------------------------------------------------------------------------
+// TOutputStream functions
+ 
+void TOutputStream::PutBits(unsigned long dwBuff, unsigned int nPutBits)
+{
+    dwBitBuff |= (dwBuff << nBits);
+    nBits     += nPutBits;
+ 
+    // Flush completed bytes
+    while(nBits >= 8)
+    {
+        if(dwOutSize != 0)
+        {
+            *pbOutPos++ = (unsigned char)dwBitBuff;
+            dwOutSize--;
+        }
+ 
+        dwBitBuff >>= 8;
+        nBits      -= 8;
+    }
+}
+ 
+//-----------------------------------------------------------------------------
+// TInputStream functions
+ 
+// Gets one bit from input stream
+unsigned long TInputStream::GetBit()
+{
+    unsigned long dwBit = (dwBitBuff & 1);
+ 
+    dwBitBuff >>= 1;
+    if(--nBits == 0)
+    {
+        dwBitBuff   = BSWAP_INT32_UNSIGNED(*(unsigned long *)pbInBuffer);
+        pbInBuffer += sizeof(unsigned long);
+        nBits       = 32;
+    }
+    return dwBit;
+}   
+ 
+// Gets 7 bits from the stream
+unsigned long TInputStream::Get7Bits()
+{
+    if(nBits <= 7)
+    {
+        dwBitBuff  |= BSWAP_INT16_UNSIGNED(*(unsigned short *)pbInBuffer) << nBits;
+        pbInBuffer += sizeof(unsigned short);
+        nBits      += 16;
+    }
+ 
+    // Get 7 bits from input stream
+ return (dwBitBuff & 0x7F);
+}
+ 
+// Gets the whole byte from the input stream.
+unsigned long TInputStream::Get8Bits()
+{
+    unsigned long dwOneByte;
+ 
+    if(nBits <= 8)
+    {
+        dwBitBuff  |= BSWAP_INT16_UNSIGNED(*(unsigned short *)pbInBuffer) << nBits;
+        pbInBuffer += sizeof(unsigned short);
+        nBits      += 16;
+    }
+   
+    dwOneByte   = (dwBitBuff & 0xFF);
+    dwBitBuff >>= 8;
+    nBits      -= 8;
+    return dwOneByte;
+}
+ 
+//-----------------------------------------------------------------------------
+// Functions for huffmann tree items
+ 
+// Inserts item into the tree (?)
+static void InsertItem(THTreeItem ** itemPtr, THTreeItem * item, unsigned long where, THTreeItem * item2)
+{
+    THTreeItem * next = item->next;     // EDI - next to the first item
+    THTreeItem * prev = item->prev;     // ESI - prev to the first item
+    THTreeItem * prev2;                 // Pointer to previous item
+    LONG_PTR next2;                     // Pointer to the next item
+   
+    // The same code like in RemoveItem(item);
+    if(next != 0)                       // If the first item already has next one
+    {
+        if(PTR_INVALID(prev))
+            prev = PTR_NOT(prev);
+        else
+            prev += (item - next->prev);
+ 
+        // 150083C1
+        // Remove the item from the tree
+        prev->next = next;
+        next->prev = prev;
+ 
+        // Invalidate 'prev' and 'next' pointer
+        item->next = 0;
+        item->prev = 0;
+    }
+ 
+    if(item2 == NULL)                   // EDX - If the second item is not entered,
+        item2 = PTR_PTR(&itemPtr[1]);   // take the first tree item
+ 
+    switch(where)
+    {
+        case SWITCH_ITEMS :             // Switch the two items
+            item->next  = item2->next;  // item2->next (Pointer to pointer to first)
+            item->prev  = item2->next->prev;
+            item2->next->prev = item;
+            item2->next = item;         // Set the first item
+            return;
+       
+        case INSERT_ITEM:               // Insert as the last item
+            item->next = item2;         // Set next item (or pointer to pointer to first item)
+            item->prev = item2->prev;   // Set prev item (or last item in the tree)
+ 
+            next2 = PTR_INT(itemPtr[0]);// Usually NULL
+            prev2 = item2->prev;        // Prev item to the second (or last tree item)
+           
+            if(PTR_INVALID(prev2))
+            {
+                prev2 = PTR_NOT(prev);
+ 
+                prev2->next = item;
+                item2->prev = item;     // Next after last item
+                return;
+            }
+ 
+            if(PTR_INVALID(next2))
+                next2 = (long)(item2 - item2->next->prev);
+//              next2 = (THTreeItem *)(unsigned long)((unsigned char *)item2 - (unsigned char *)(item2->next->prev));
+ 
+//          prev2 = (THTreeItem *)((char *)prev2 + (unsigned long)next2);// ???
+            prev2 += next2;
+            prev2->next = item;
+            item2->prev = item;         // Set the next/last item
+            return;
+ 
+        default:
+            return;
+    }
+}
+ 
+//-----------------------------------------------------------------------------
+// THuffmannTree class functions
+ 
+THuffmannTree::THuffmannTree()
+{
+    // We have to check if the "this" pointer is less than zero
+    if((LONG_PTR)this < 0)
+        mul = -1;
+}
+ 
+void THuffmannTree::InitTree(bool bCompression)
+{
+    THTreeItem * pItem;
+    unsigned int nCount;
+ 
+    // Clear links for all the items in the tree
+    for(pItem = items0008, nCount = 0x203; nCount != 0; pItem++, nCount--)
+        pItem->ClearItemLinks();
+ 
+    pItem3050 = NULL;
+    pItem3054 = PTR_PTR(&pItem3054);
+    pItem3058 = PTR_NOT(pItem3054);
+   
+    pItem305C = NULL;
+    pFirst    = PTR_PTR(&pFirst);
+    pLast     = PTR_NOT(pFirst);
+ 
+    offs0004  = 1;
+    nItems    = 0;
+ 
+    // Clear all TQDecompress items. Do this only if preparing for decompression
+    if(bCompression == false)
+    {
+        for(nCount = 0; nCount < sizeof(qd3474) / sizeof(TQDecompress); nCount++)
+            qd3474[nCount].offs00 = 0;
+    }
+}
+ 
+// Builds Huffman tree. Called with the first 8 bits loaded from input stream
+void THuffmannTree::BuildTree(unsigned int nCmpType)
+{
+    unsigned long   maxByte;            // [ESP+10] - The greatest character found in table
+    THTreeItem   ** itemPtr;            // [ESP+14] - Pointer to Huffman tree item pointer array
+    unsigned char * byteArray;          // [ESP+1C] - Pointer to unsigned char in Table1502A630
+    THTreeItem    * child1;
+    unsigned long   i;                  // egcs in linux doesn't like multiple for loops without an explicit i
+ 
+    // Loop while pointer has a valid value
+    while(PTR_VALID(pLast))             // ESI - Last entry
+    {
+        THTreeItem * temp;              // EAX
+ 
+        if(pLast->next != NULL)         // ESI->next
+            pLast->RemoveItem();
+                                        // EDI = &offs3054
+        pItem3058   = PTR_PTR(&pItem3054);// [EDI+4]
+        pLast->prev = pItem3058;  // EAX
+ 
+        temp = PTR_PTR(&pItem3054)->GetPrevItem(PTR_INT(&pItem3050));
+ 
+        temp->next = pLast;
+        pItem3054  = pLast;
+    }
+ 
+    // Clear all pointers in HTree item array
+    memset(items306C, 0, sizeof(items306C));
+ 
+    maxByte = 0;                        // Greatest character found init to zero.
+    itemPtr = (THTreeItem **)&items306C; // Pointer to current entry in HTree item pointer array
+ 
+    // Ensure we have low 8 bits only
+    nCmpType &= 0xFF;
+    byteArray  = Table1502A630 + nCmpType * 258; // EDI also
+ 
+    for(i = 0; i < 0x100; i++, itemPtr++)
+    {
+        THTreeItem * item   = pItem3058;    // Item to be created
+        THTreeItem * pItem3 = pItem3058;
+        unsigned char         oneByte = byteArray[i];
+ 
+        // Skip all the bytes which are zero.
+        if(byteArray[i] == 0)
+            continue;
+ 
+        // If not valid pointer, take the first available item in the array
+        if(PTR_INVALID_OR_NULL(item))
+            item = &items0008[nItems++];
+ 
+        // Insert this item as the top of the tree
+        InsertItem(&pItem305C, item, SWITCH_ITEMS, NULL);
+ 
+        item->parent    = NULL;                 // Invalidate child and parent
+        item->child     = NULL;
+        *itemPtr        = item;                 // Store pointer into pointer array
+ 
+        item->dcmpByte  = i;                    // Store counter
+        item->byteValue = oneByte;              // Store byte value
+        if(oneByte >= maxByte)
+        {
+            maxByte = oneByte;
+            continue;
+        }
+ 
+        // Find the first item which has byte value greater than current one byte
+        if(PTR_VALID(pItem3 = pLast))           // EDI - Pointer to the last item
+        {
+            // 15006AF7
+            if(pItem3 != NULL)
+            {
+                do  // 15006AFB
+                {
+                    if(pItem3->byteValue >= oneByte)
+                        goto _15006B09;
+                    pItem3 = pItem3->prev;
+                }
+                while(PTR_VALID(pItem3));
+            }
+        }
+        pItem3 = NULL;
+ 
+        // 15006B09
+        _15006B09:
+        if(item->next != NULL)
+            item->RemoveItem();
+ 
+        // 15006B15
+        if(pItem3 == NULL)
+            pItem3 = PTR_PTR(&pFirst);
+ 
+        // 15006B1F
+        item->next = pItem3->next;
+        item->prev = pItem3->next->prev;
+        pItem3->next->prev = item;
+        pItem3->next = item;
+    }
+ 
+    // 15006B4A
+    for(; i < 0x102; i++)
+    {
+        THTreeItem ** itemPtr = &items306C[i];  // EDI
+ 
+        // 15006B59
+        THTreeItem * item = pItem3058;          // ESI
+        if(PTR_INVALID_OR_NULL(item))
+            item = &items0008[nItems++];
+ 
+        InsertItem(&pItem305C, item, INSERT_ITEM, NULL);
+ 
+        // 15006B89
+        item->dcmpByte   = i;
+        item->byteValue  = 1;
+        item->parent     = NULL;
+        item->child      = NULL;
+        *itemPtr++ = item;
+    }
+ 
+    // 15006BAA
+    if(PTR_VALID(child1 = pLast))                   // EDI - last item (first child to item
+    {
+        THTreeItem * child2;                        // EBP
+        THTreeItem * item;                          // ESI
+ 
+        // 15006BB8
+        while(PTR_VALID(child2 = child1->prev))
+        {
+            if(PTR_INVALID_OR_NULL(item = pItem3058))
+                item = &items0008[nItems++];
+ 
+            // 15006BE3
+            InsertItem(&pItem305C, item, SWITCH_ITEMS, NULL);
+ 
+            // 15006BF3
+            item->parent = NULL;
+            item->child  = NULL;
+ 
+            //EDX = child2->byteValue + child1->byteValue;
+            //EAX = child1->byteValue;
+            //ECX = maxByte;                        // The greatest character (0xFF usually)
+ 
+            item->byteValue = child1->byteValue + child2->byteValue; // 0x02
+            item->child     = child1;                                // Prev item in the
+            child1->parent  = item;
+            child2->parent  = item;
+ 
+            // EAX = item->byteValue;
+            if(item->byteValue >= maxByte)
+                maxByte = item->byteValue;
+            else
+            {
+                THTreeItem * pItem2 = child2->prev;   // EDI
+ 
+                // 15006C2D
+                while(PTR_VALID(pItem2))
+                {
+                    if(pItem2->byteValue >= item->byteValue)
+                        goto _15006C3B;
+                    pItem2 = pItem2->prev;
+                }
+                pItem2 = NULL;
+ 
+                _15006C3B:
+                if(item->next != 0)
+                {
+                    THTreeItem * temp4 = item->GetPrevItem(-1);
+                                                                   
+                    temp4->next      = item->next;                 // The first item changed
+                    item->next->prev = item->prev;                 // First->prev changed to negative value
+                    item->next = NULL;
+                    item->prev = NULL;
+                }
+ 
+                // 15006C62
+                if(pItem2 == NULL)
+                    pItem2 = PTR_PTR(&pFirst);
+ 
+                item->next = pItem2->next;                           // Set item with 0x100 byte value
+                item->prev = pItem2->next->prev;                     // Set item with 0x17 byte value
+                pItem2->next->prev = item;                           // Changed prev of item with
+                pItem2->next = item;
+            }
+
+            // 15006C7B
+            if(PTR_INVALID_OR_NULL(child1 = child2->prev))
+                break;
+        }
+    }
+    // 15006C88
+    offs0004 = 1;
+}
+/*
+// Modifies Huffman tree. Adds new item and changes
+void THuffmannTree::ModifyTree(unsigned long dwIndex)
+{
+    THTreeItem * pItem1 = pItem3058;                              // ESI
+    THTreeItem * pSaveLast = (PTR_INT(pLast) <= 0) ? NULL : pLast;  // EBX
+    THTreeItem * temp;                                              // EAX
+ 
+    // Prepare the first item to insert to the tree
+    if(PTR_INT(pItem1) <= 0)
+        pItem1 = &items0008[nItems++];
+ 
+    // If item has any next item, remove it from the chain
+    if(pItem1->next != NULL)
+    {
+        THTreeItem * temp = pItem1->GetPrevItem(-1);                  // EAX
+ 
+        temp->next = pItem1->next;
+        pItem1->next->prev = pItem1->prev;
+        pItem1->next = NULL;
+        pItem1->prev = NULL;
+    }
+ 
+    pItem1->next = PTR_PTR(&pFirst);
+    pItem1->prev = pLast;
+    temp = pItem1->next->GetPrevItem(PTR_INT(pItem305C));
+ 
+    // 150068E9
+    temp->next = pItem1;
+    pLast  = pItem1;
+ 
+    pItem1->parent = NULL;
+    pItem1->child  = NULL;
+ 
+    // 150068F6
+    pItem1->dcmpByte  = pSaveLast->dcmpByte;   // Copy item index
+    pItem1->byteValue = pSaveLast->byteValue;  // Copy item byte value
+    pItem1->parent    = pSaveLast;             // Set parent to last item
+    items306C[pSaveLast->dcmpByte] = pItem1;  // Insert item into item pointer array
+ 
+    // Prepare the second item to insert into the tree
+    if(PTR_INT((pItem1 = pItem3058)) <= 0)
+        pItem1 = &items0008[nItems++];
+ 
+    // 1500692E
+    if(pItem1->next != NULL)
+    {
+        temp = pItem1->GetPrevItem(-1);   // EAX
+ 
+        temp->next = pItem1->next;
+        pItem1->next->prev = pItem1->prev;
+        pItem1->next = NULL;
+        pItem1->prev = NULL;
+    }
+    // 1500694C
+    pItem1->next = PTR_PTR(&pFirst);
+    pItem1->prev = pLast;
+    temp = pItem1->next->GetPrevItem(PTR_INT(pItem305C));
+ 
+    // 15006968
+    temp->next = pItem1;
+    pLast      = pItem1;
+ 
+    // 1500696E
+    pItem1->child     = NULL;
+    pItem1->dcmpByte  = dwIndex;
+    pItem1->byteValue = 0;
+    pItem1->parent    = pSaveLast;
+    pSaveLast->child   = pItem1;
+    items306C[dwIndex] = pItem1;
+ 
+    do
+    {
+        THTreeItem  * pItem2 = pItem1;
+        THTreeItem  * pItem3;
+        unsigned long byteValue;
+ 
+        // 15006993
+        byteValue = ++pItem1->byteValue;
+ 
+        // Pass through all previous which have its value greater than byteValue
+        while(PTR_INT((pItem3 = pItem2->prev)) > 0)  // EBX
+        {
+            if(pItem3->byteValue >= byteValue)
+                goto _150069AE;
+ 
+            pItem2 = pItem2->prev;
+        }
+        // 150069AC
+        pItem3 = NULL;
+ 
+        _150069AE:
+        if(pItem2 == pItem1)
+            continue;
+ 
+        // 150069B2
+        // Switch pItem2 with item
+        InsertItem(&pItem305C, pItem2, SWITCH_ITEMS, pItem1);
+        InsertItem(&pItem305C, pItem1, SWITCH_ITEMS, pItem3);
+ 
+        // 150069D0
+        // Switch parents of pItem1 and pItem2
+        temp = pItem2->parent->child;
+        if(pItem1 == pItem1->parent->child)
+            pItem1->parent->child = pItem2;
+ 
+        if(pItem2 == temp)
+            pItem2->parent->child = pItem1;
+ 
+        // 150069ED
+        // Switch parents of pItem1 and pItem3
+        temp = pItem1->parent;
+        pItem1 ->parent = pItem2->parent;
+        pItem2->parent = temp;
+        offs0004++;
+    }
+    while(PTR_INT((pItem1 = pItem1->parent)) > 0);
+}
+ 
+void THuffmannTree::UninitTree()
+{
+    while(PTR_INT(pLast) > 0)
+    {
+        pItem = pItem305C->Call1501DB70(pLast);
+        pItem->RemoveItem();
+    }
+ 
+    for(pItem = pFirst; PTR_INT(pItem3058) > 0; pItem = pItem3058)
+        pItem->RemoveItem();
+    PTR_PTR(&pItem3054)->RemoveItem();
+ 
+    for(pItem = items0008 + 0x203, nCount = 0x203; nCount != 0; nCount--)
+    {
+        pItem--;
+        pItem->RemoveItem();
+        pItem->RemoveItem();
+    }
+}
+*/
+ 
+THTreeItem * THuffmannTree::Call1500E740(unsigned int nValue)
+{
+    THTreeItem * pItem1 = pItem3058;    // EDX
+    THTreeItem * pItem2;                // EAX
+    THTreeItem * pNext;
+    THTreeItem * pPrev;
+    THTreeItem ** ppItem;
+ 
+    if(PTR_INVALID_OR_NULL(pItem1) || (pItem2 = pItem1) == NULL)
+    {
+        if((pItem2 = &items0008[nItems++]) != NULL)
+            pItem1 = pItem2;
+        else
+            pItem1 = pFirst;
+    }
+    else
+        pItem1 = pItem2;
+ 
+    pNext = pItem1->next;
+    if(pNext != NULL)
+    {
+        pPrev = pItem1->prev;
+        if(PTR_INVALID_OR_NULL(pPrev))
+            pPrev = PTR_NOT(pPrev);
+        else
+            pPrev += (pItem1 - pItem1->next->prev);
+ 
+        pPrev->next = pNext;
+        pNext->prev = pPrev;
+        pItem1->next = NULL;
+        pItem1->prev = NULL;
+    }
+ 
+    ppItem = &pFirst;       // esi
+    if(nValue > 1)
+    {
+        // ecx = pFirst->next;
+        pItem1->next = *ppItem;
+        pItem1->prev = (*ppItem)->prev;
+ 
+        (*ppItem)->prev = pItem2;
+        *ppItem = pItem1;
+ 
+        pItem2->parent = NULL;
+        pItem2->child  = NULL;
+    }
+    else
+    {
+        pItem1->next = (THTreeItem *)ppItem;
+        pItem1->prev = ppItem[1];
+        // edi = pItem305C;
+        pPrev = ppItem[1];      // ecx
+        if(PTR_INVALID_OR_NULL(pPrev))
+        {
+            pPrev = PTR_NOT(pPrev);
+            pPrev->next = pItem1;
+            pPrev->prev = pItem2;
+ 
+            pItem2->parent = NULL;
+            pItem2->child  = NULL;
+        }
+        else
+        {
+            if(PTR_INVALID(pItem305C))
+                pPrev += (THTreeItem *)ppItem - (*ppItem)->prev;
+            else
+                pPrev += PTR_INT(pItem305C);
+ 
+            pPrev->next    = pItem1;
+            ppItem[1]      = pItem2;
+            pItem2->parent = NULL;
+            pItem2->child  = NULL;
+        }
+    }
+    return pItem2;
+}
+ 
+void THuffmannTree::Call1500E820(THTreeItem * pItem)
+{
+    THTreeItem * pItem1;                // edi
+    THTreeItem * pItem2 = NULL;         // eax
+    THTreeItem * pItem3;                // edx
+    THTreeItem * pPrev;                 // ebx
+ 
+    for(; pItem != NULL; pItem = pItem->parent)
+    {
+        pItem->byteValue++;
+       
+        for(pItem1 = pItem; ; pItem1 = pPrev)
+        {
+            pPrev = pItem1->prev;
+            if(PTR_INVALID_OR_NULL(pPrev))
+            {
+                pPrev = NULL;
+                break;
+            }
+ 
+            if(pPrev->byteValue >= pItem->byteValue)
+                break;
+        }
+ 
+        if(pItem1 == pItem)
+            continue;
+ 
+        if(pItem1->next != NULL)
+        {
+            pItem2 = pItem1->GetPrevItem(-1);
+            pItem2->next = pItem1->next;
+            pItem1->next->prev = pItem1->prev;
+            pItem1->next = NULL;
+            pItem1->prev = NULL;
+        }
+ 
+        pItem2 = pItem->next;
+        pItem1->next = pItem2;
+        pItem1->prev = pItem2->prev;
+        pItem2->prev = pItem1;
+        pItem->next = pItem1;
+        if((pItem2 = pItem1) != NULL)
+        {
+            pItem2 = pItem->GetPrevItem(-1);
+            pItem2->next = pItem->next;
+            pItem->next->prev = pItem->prev;
+            pItem->next = NULL;
+            pItem->prev = NULL;
+        }
+ 
+        if(pPrev == NULL)
+            pPrev = PTR_PTR(&pFirst);
+ 
+        pItem2       = pPrev->next;
+        pItem->next  = pItem2;
+        pItem->prev  = pItem2->prev;
+        pItem2->prev = pItem;
+        pPrev->next  = pItem;
+ 
+        pItem3 = pItem1->parent->child;
+        pItem2 = pItem->parent;
+        if(pItem2->child == pItem)
+            pItem2->child = pItem1;
+        if(pItem3 == pItem1)
+            pItem1->parent->child = pItem;
+ 
+        pItem2 = pItem->parent;
+        pItem->parent  = pItem1->parent;
+        pItem1->parent = pItem2;
+        offs0004++;
+    }
+}
+ 
+// 1500E920
+unsigned int THuffmannTree::DoCompression(TOutputStream * os, unsigned char * pbInBuffer, int nInLength, int nCmpType)
+{
+    THTreeItem  * pItem1;
+    THTreeItem  * pItem2;
+    THTreeItem  * pItem3;
+    THTreeItem  * pTemp;
+    unsigned long dwBitBuff;
+    unsigned int  nBits;
+    unsigned int  nBit;
+ 
+    BuildTree(nCmpType);
+    bIsCmp0 = (nCmpType == 0);
+ 
+    // Store the compression type into output buffer
+    os->dwBitBuff |= (nCmpType << os->nBits);
+    os->nBits     += 8;
+ 
+    // Flush completed bytes
+    while(os->nBits >= 8)
+    {
+        if(os->dwOutSize != 0)
+        {
+            *os->pbOutPos++ = (unsigned char)os->dwBitBuff;
+            os->dwOutSize--;
+        }
+ 
+        os->dwBitBuff >>= 8;
+        os->nBits      -= 8;
+    }
+ 
+    for(; nInLength != 0; nInLength--)
+    {
+        unsigned char bOneByte = *pbInBuffer++;
+ 
+        if((pItem1 = items306C[bOneByte]) == NULL)
+        {
+            pItem2    = items306C[0x101];  // ecx
+            pItem3    = pItem2->parent;    // eax
+            dwBitBuff = 0;
+            nBits     = 0;
+ 
+            for(; pItem3 != NULL; pItem3 = pItem3->parent)
+            {
+                nBit      = (pItem3->child != pItem2) ? 1 : 0;
+                dwBitBuff = (dwBitBuff << 1) | nBit;
+                nBits++;
+                pItem2  = pItem3;
+            }
+            os->PutBits(dwBitBuff, nBits);
+ 
+            // Store the loaded byte into output stream
+            os->dwBitBuff |= (bOneByte << os->nBits);
+            os->nBits     += 8;
+ 
+            // Flush the whole byte(s)
+            while(os->nBits >= 8)
+            {
+                if(os->dwOutSize != 0)
+                {
+                    *os->pbOutPos++ = (unsigned char)os->dwBitBuff;
+                    os->dwOutSize--;
+                }
+                os->dwBitBuff >>= 8;
+                os->nBits -= 8;
+            }
+ 
+            pItem1 = (PTR_INVALID_OR_NULL(pLast)) ? NULL : pLast;
+            pItem2 = Call1500E740(1);
+            pItem2->dcmpByte  = pItem1->dcmpByte;
+            pItem2->byteValue = pItem1->byteValue;
+            pItem2->parent    = pItem1;
+            items306C[pItem2->dcmpByte] = pItem2;
+ 
+            pItem2 = Call1500E740(1);
+            pItem2->dcmpByte  = bOneByte;
+            pItem2->byteValue = 0;
+            pItem2->parent    = pItem1;
+            items306C[pItem2->dcmpByte] = pItem2;
+            pItem1->child = pItem2;
+ 
+            Call1500E820(pItem2);
+ 
+            if(bIsCmp0 != 0)
+            {
+                Call1500E820(items306C[bOneByte]);
+                continue;
+            }
+ 
+            for(pItem1 = items306C[bOneByte]; pItem1 != NULL; pItem1 = pItem1->parent)
+            {
+                pItem1->byteValue++;
+                pItem2 = pItem1;
+ 
+                for(;;)
+                {
+                    pItem3 = pItem2->prev;
+                    if(PTR_INVALID_OR_NULL(pItem3))
+                    {
+                        pItem3 = NULL;
+                        break;
+                    }
+                    if(pItem3->byteValue >= pItem1->byteValue)
+                        break;
+                    pItem2 = pItem3;
+                }
+ 
+                if(pItem2 != pItem1)
+                {
+                    InsertItem(&pItem305C, pItem2, SWITCH_ITEMS, pItem1);
+                    InsertItem(&pItem305C, pItem1, SWITCH_ITEMS, pItem3);
+ 
+                    pItem3 = pItem2->parent->child;
+                    if(pItem1->parent->child == pItem1)
+                        pItem1->parent->child = pItem2;
+ 
+                    if(pItem3 == pItem2)
+                        pItem2->parent->child = pItem1;
+ 
+                    pTemp = pItem1->parent;
+                    pItem1->parent = pItem2->parent;
+                    pItem2->parent = pTemp;
+                    offs0004++;
+                }
+            }
+        }
+// 1500EB62
+        else
+        {
+            dwBitBuff = 0;
+            nBits = 0;
+            for(pItem2 = pItem1->parent; pItem2 != NULL; pItem2 = pItem2->parent)
+            {
+                nBit      = (pItem2->child != pItem1) ? 1 : 0;
+                dwBitBuff = (dwBitBuff << 1) | nBit;
+                nBits++;
+                pItem1    = pItem2;
+            }
+            os->PutBits(dwBitBuff, nBits);
+        }
+ 
+// 1500EB98
+        if(bIsCmp0 != 0)
+            Call1500E820(items306C[bOneByte]);  // 1500EB9D
+// 1500EBAF
+    } // for(; nInLength != 0; nInLength--)
+ 
+// 1500EBB8
+    pItem1 = items306C[0x100];
+    dwBitBuff = 0;
+    nBits = 0;
+    for(pItem2 = pItem1->parent; pItem2 != NULL; pItem2 = pItem2->parent)
+    {
+        nBit      = (pItem2->child != pItem1) ? 1 : 0;
+        dwBitBuff = (dwBitBuff << 1) | nBit;
+        nBits++;
+        pItem1    = pItem2;
+    }
+ 
+// 1500EBE6
+    os->PutBits(dwBitBuff, nBits);
+ 
+// 1500EBEF
+    // Flush the remaining bits
+    while(os->nBits != 0)
+    {
+        if(os->dwOutSize != 0)
+        {
+            *os->pbOutPos++ = (unsigned char)os->dwBitBuff;
+            os->dwOutSize--;
+        }
+        os->dwBitBuff >>= 8;
+        os->nBits -= ((os->nBits > 8) ? 8 : os->nBits);
+    }
+ 
+    return (unsigned int)(os->pbOutPos - os->pbOutBuffer);
+}
+ 
+// Decompression using Huffman tree (1500E450)
+unsigned int THuffmannTree::DoDecompression(unsigned char * pbOutBuffer, unsigned int dwOutLength, TInputStream * is)
+{
+    TQDecompress  * qd;
+    THTreeItem    * pItem1;
+    THTreeItem    * pItem2;
+    unsigned char * pbOutPos = pbOutBuffer;
+    unsigned long nBitCount;
+    unsigned int nDcmpByte = 0;
+    unsigned int n8Bits;                // 8 bits loaded from input stream
+    unsigned int n7Bits;                // 7 bits loaded from input stream
+    bool bHasQdEntry;
+   
+    // Test the output length. Must not be NULL.
+    if(dwOutLength == 0)
+        return 0;
+ 
+    // Get the compression type from the input stream
+    n8Bits = is->Get8Bits();
+ 
+    // Build the Huffman tree
+    BuildTree(n8Bits);    
+    bIsCmp0 = (n8Bits == 0) ? 1 : 0;
+ 
+    for(;;)
+    {
+        n7Bits = is->Get7Bits();            // Get 7 bits from input stream
+ 
+        // Try to use quick decompression. Check TQDecompress array for corresponding item.
+        // If found, ise the result byte instead.
+        qd = &qd3474[n7Bits];
+ 
+        // If there is a quick-pass possible (ebx)
+        bHasQdEntry = (qd->offs00 >= offs0004) ? true : false;
+ 
+        // If we can use quick decompress, use it.
+        if(bHasQdEntry)
+        {
+            if(qd->nBits > 7)
+            {
+                is->dwBitBuff >>= 7;
+                is->nBits -= 7;
+                pItem1 = qd->pItem;
+                goto _1500E549;
+            }
+            is->dwBitBuff >>= qd->nBits;
+            is->nBits -= qd->nBits;
+            nDcmpByte = qd->dcmpByte;
+        }
+        else
+        {
+            pItem1 = pFirst->next->prev;
+            if(PTR_INVALID_OR_NULL(pItem1))
+                pItem1 = NULL;
+_1500E549:           
+            nBitCount = 0;
+            pItem2 = NULL;
+ 
+            do
+            {
+                pItem1 = pItem1->child;     // Move down by one level
+                if(is->GetBit())            // If current bit is set, move to previous
+                    pItem1 = pItem1->prev;
+ 
+                if(++nBitCount == 7)        // If we are at 7th bit, save current HTree item.
+                    pItem2 = pItem1;
+            }
+            while(pItem1->child != NULL);   // Walk until tree has no deeper level
+ 
+            if(bHasQdEntry == false)
+            {
+                if(nBitCount > 7)
+                {
+                    qd->offs00 = offs0004;
+                    qd->nBits  = nBitCount;
+                    qd->pItem  = pItem2;
+                }
+                else
+                {
+                    unsigned long nIndex = n7Bits & (0xFFFFFFFF >> (32 - nBitCount));
+                    unsigned long nAdd   = (1 << nBitCount);
+                   
+                    for(qd = &qd3474[nIndex]; nIndex <= 0x7F; nIndex += nAdd, qd += nAdd)
+                    {
+                        qd->offs00   = offs0004;
+                        qd->nBits    = nBitCount;
+                        qd->dcmpByte = pItem1->dcmpByte;
+                    }
+                }
+            }
+            nDcmpByte = pItem1->dcmpByte;
+        }
+ 
+        if(nDcmpByte == 0x101)          // Huffman tree needs to be modified
+        {
+            n8Bits = is->Get8Bits();
+            pItem1 = (PTR_INVALID_OR_NULL(pLast)) ? NULL : pLast;
+ 
+            pItem2 = Call1500E740(1);
+            pItem2->parent    = pItem1;
+            pItem2->dcmpByte  = pItem1->dcmpByte;
+            pItem2->byteValue = pItem1->byteValue;
+            items306C[pItem2->dcmpByte] = pItem2;
+ 
+            pItem2 = Call1500E740(1);
+            pItem2->parent    = pItem1;
+            pItem2->dcmpByte  = n8Bits;
+            pItem2->byteValue = 0;
+            items306C[pItem2->dcmpByte] = pItem2;
+ 
+            pItem1->child = pItem2;
+            Call1500E820(pItem2);
+            if(bIsCmp0 == 0)
+                Call1500E820(items306C[n8Bits]);
+ 
+            nDcmpByte = n8Bits;
+        }
+ 
+        if(nDcmpByte == 0x100)
+            break;
+ 
+        *pbOutPos++ = (unsigned char)nDcmpByte;
+        if(--dwOutLength == 0)
+            break;
+ 
+        if(bIsCmp0)
+            Call1500E820(items306C[nDcmpByte]);
+    }
+ 
+    return (unsigned int)(pbOutPos - pbOutBuffer);
+}
+ 
+/* OLD VERSION
+unsigned int THuffmannTree::DoDecompression(unsigned char * pbOutBuffer, unsigned int dwOutLength, TInputStream * is)
+{
+    THTreeItem  * pItem1;               // Current item if walking HTree
+    unsigned long bitCount;             // Bit counter if walking HTree
+    unsigned long oneByte;              // 8 bits from bit stream/Pointer to target
+    unsigned char * outPtr;             // Current pointer to output buffer
+    bool          hasQDEntry;           // true if entry for quick decompression if filled
+    THTreeItem  * itemAt7 = NULL;       // HTree item found at 7th bit
+    THTreeItem  * temp;                 // For every use
+    unsigned long dcmpByte = 0;         // Decompressed byte value
+    bool          bFlag = 0;
+   
+    // Test the output length. Must not be NULL.
+    if(dwOutLength == 0)
+        return 0;
+ 
+    // If too few bits in input bit buffer, we have to load next 16 bits
+    is->EnsureHasMoreThan8Bits();
+ 
+    // Get 8 bits from input stream
+    oneByte = is->Get8Bits();
+ 
+    // Build the Huffman tree
+    BuildTree(oneByte);    
+ 
+    bIsCmp0 = (oneByte == 0) ? 1 : 0;
+    outPtr  = pbOutBuffer;              // Copy pointer to output data
+ 
+    for(;;)
+    {
+        TQDecompress * qd;              // For quick decompress
+        unsigned long sevenBits = is->Get7Bits();// 7 bits from input stream
+ 
+        // Try to use quick decompression. Check TQDecompress array for corresponding item.
+        // If found, ise the result byte instead.
+        qd = &qd3474[sevenBits];
+ 
+        // If there is a quick-pass possible
+        hasQDEntry = (qd->offs00 == offs0004) ? 1 : 0;
+ 
+        // Start passing the Huffman tree. Set item to tree root item
+        pItem1 = pFirst;
+ 
+        // If we can use quick decompress, use it.
+        bFlag = 1;
+        if(hasQDEntry == 1)
+        {
+            // Check the bit count is greater than 7, move item to 7 levels deeper
+            if((bitCount = qd->bitCount) > 7)
+            {
+                is->dwBitBuff >>= 7;
+                is->nBits  -= 7;
+                pItem1      = qd->item; // Don't start with root item, but with some deeper-laying
+            }
+            else
+            {
+                // If OK, use their byte value
+                is->dwBitBuff >>= bitCount;
+                is->nBits  -= bitCount;
+                dcmpByte    = qd->dcmpByte;
+                bFlag       = 0;
+            }
+        }
+        else
+        {
+            pItem1 = pFirst->next->prev;
+            if(PTR_INT(pItem1) <= 0)
+                pItem1 = NULL;
+        }
+ 
+        if(bFlag == 1)
+        {
+            // Walk through Huffman Tree
+            bitCount = 0;               // Clear bit counter
+            do
+            {
+                pItem1 = pItem1->child;    
+                if(is->GetBit() != 0)   // If current bit is set, move to previous
+                    pItem1 = pItem1->prev;  // item in current level
+ 
+                if(++bitCount == 7)     // If we are at 7th bit, store current HTree item.
+                    itemAt7 = pItem1;   // Store Huffman tree item
+            }
+            while(pItem1->child != NULL); // Walk until tree has no deeper level
+ 
+            // If quick decompress entry is not filled yet, fill it.
+            if(hasQDEntry == 0)
+            {
+                if(bitCount > 7)        // If we passed more than 7 bits, store bitCount and item
+                {
+                    qd->offs00   = offs0004;   // Value indicates that entry is resolved
+                    qd->bitCount = bitCount;   // Number of bits passed
+                    qd->item     = itemAt7;    // Store item at 7th bit
+                }
+                // If we passed less than 7 bits, fill entry and bit count multipliers
+                else                   
+                {
+                    unsigned long index = sevenBits & (0xFFFFFFFF >> (32 - bitCount)); // Index for quick-decompress entry
+                    unsigned long addIndex = (1 << bitCount);                          // Add value for index
+ 
+                    qd = &qd3474[index];
+ 
+                    do
+                    {
+                        qd->offs00   = offs0004;
+                        qd->bitCount = bitCount;
+                        qd->dcmpByte = pItem1->dcmpByte;
+ 
+                        index += addIndex;
+                        qd    += addIndex;
+                    }
+                    while(index <= 0x7F);
+                }
+            }
+            dcmpByte = pItem1->dcmpByte;
+        }
+ 
+        if(dcmpByte == 0x101)        // Huffman tree needs to be modified
+        {
+            // Check if there is enough bits in the buffer
+            is->EnsureHasMoreThan8Bits();
+ 
+            // Get 8 bits from the buffer
+            oneByte = is->Get8Bits();
+ 
+            // Modify Huffman tree
+            ModifyTree(oneByte);
+ 
+            // Get lastly added tree item
+            pItem1 = items306C[oneByte];
+ 
+            if(bIsCmp0 == 0 && pItem1 != NULL)
+            {
+                // 15006F15
+                do
+                {
+                    THTreeItem * pItem2 = pItem1;
+                    THTreeItem * pItem3;
+                    unsigned long byteValue;
+ 
+                    byteValue = ++pItem1->byteValue;
+ 
+                    while(PTR_INT((pItem3 = pItem2->prev)) > 0)
+                    {
+                        if(pItem3->byteValue >= byteValue)
+                            goto _15006F30;
+ 
+                        pItem2 = pItem2->prev;
+                    }
+                    pItem3 = NULL;
+ 
+                    _15006F30:
+                    if(pItem2 == pItem1)
+                        continue;
+ 
+                    InsertItem(&pItem305C, pItem2, SWITCH_ITEMS, pItem1);
+                    InsertItem(&pItem305C, pItem1, SWITCH_ITEMS, pItem3);
+ 
+                    temp = pItem2->parent->child;
+                    if(pItem1 == pItem1->parent->child)
+                        pItem1->parent->child = pItem2;
+ 
+                    if(pItem2 == temp)
+                        pItem2->parent->child = pItem1;
+ 
+                    // Switch parents of pItem1 and pItem3
+                    temp = pItem1->parent;
+                    pItem1->parent = pItem2->parent;
+                    pItem2->parent = temp;
+                    offs0004++;
+                }
+                while(PTR_INT((pItem1 = pItem1->parent)) > 0);
+            }
+            dcmpByte = oneByte;
+        }
+ 
+        if(dcmpByte != 0x100)        // Not at the end of data ?
+        {
+            *outPtr++ = (unsigned char)dcmpByte;
+            if(--dwOutLength > 0)
+            {
+                if(bIsCmp0 != 0)
+                    Call1500E820(items306C[pItem1->byteValue]);
+            }                   
+            else
+                break;
+        }
+        else
+            break;
+    }
+    return (unsigned long)(outPtr - pbOutBuffer);
+}
+*/
+ 
+// Table for (de)compression. Every compression type has 258 entries
+unsigned char THuffmannTree::Table1502A630[] =
+{
+    // Data for compression type 0x00
+    0x0A, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x02,
+    0x00, 0x00,
+   
+    // Data for compression type 0x01
+    0x54, 0x16, 0x16, 0x0D, 0x0C, 0x08, 0x06, 0x05, 0x06, 0x05, 0x06, 0x03, 0x04, 0x04, 0x03, 0x05,
+    0x0E, 0x0B, 0x14, 0x13, 0x13, 0x09, 0x0B, 0x06, 0x05, 0x04, 0x03, 0x02, 0x03, 0x02, 0x02, 0x02,
+    0x0D, 0x07, 0x09, 0x06, 0x06, 0x04, 0x03, 0x02, 0x04, 0x03, 0x03, 0x03, 0x03, 0x03, 0x02, 0x02,
+    0x09, 0x06, 0x04, 0x04, 0x04, 0x04, 0x03, 0x02, 0x03, 0x02, 0x02, 0x02, 0x02, 0x03, 0x02, 0x04,
+    0x08, 0x03, 0x04, 0x07, 0x09, 0x05, 0x03, 0x03, 0x03, 0x03, 0x02, 0x02, 0x02, 0x03, 0x02, 0x02,
+    0x03, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x02, 0x01, 0x01, 0x01, 0x02, 0x01, 0x02, 0x02,
+    0x06, 0x0A, 0x08, 0x08, 0x06, 0x07, 0x04, 0x03, 0x04, 0x04, 0x02, 0x02, 0x04, 0x02, 0x03, 0x03,
+    0x04, 0x03, 0x07, 0x07, 0x09, 0x06, 0x04, 0x03, 0x03, 0x02, 0x01, 0x02, 0x02, 0x02, 0x02, 0x02,
+    0x0A, 0x02, 0x02, 0x03, 0x02, 0x02, 0x01, 0x01, 0x02, 0x02, 0x02, 0x06, 0x03, 0x05, 0x02, 0x03,
+    0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x03, 0x01, 0x01, 0x01,
+    0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x04, 0x04, 0x04, 0x07, 0x09, 0x08, 0x0C, 0x02,
+    0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x03,
+    0x04, 0x01, 0x02, 0x04, 0x05, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01,
+    0x04, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+    0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+    0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x02, 0x01, 0x01, 0x02, 0x02, 0x02, 0x06, 0x4B,
+    0x00, 0x00,
+   
+    // Data for compression type 0x02
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x03, 0x27, 0x00, 0x00, 0x23, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0xFF, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x02, 0x01, 0x01, 0x06, 0x0E, 0x10, 0x04,
+    0x06, 0x08, 0x05, 0x04, 0x04, 0x03, 0x03, 0x02, 0x02, 0x03, 0x03, 0x01, 0x01, 0x02, 0x01, 0x01,
+    0x01, 0x04, 0x02, 0x04, 0x02, 0x02, 0x02, 0x01, 0x01, 0x04, 0x01, 0x01, 0x02, 0x03, 0x03, 0x02,
+    0x03, 0x01, 0x03, 0x06, 0x04, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x02, 0x01, 0x01,
+    0x01, 0x29, 0x07, 0x16, 0x12, 0x40, 0x0A, 0x0A, 0x11, 0x25, 0x01, 0x03, 0x17, 0x10, 0x26, 0x2A,
+    0x10, 0x01, 0x23, 0x23, 0x2F, 0x10, 0x06, 0x07, 0x02, 0x09, 0x01, 0x01, 0x01, 0x01, 0x01, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00,
+   
+    // Data for compression type 0x03
+    0xFF, 0x0B, 0x07, 0x05, 0x0B, 0x02, 0x02, 0x02, 0x06, 0x02, 0x02, 0x01, 0x04, 0x02, 0x01, 0x03,
+    0x09, 0x01, 0x01, 0x01, 0x03, 0x04, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01,
+    0x05, 0x01, 0x01, 0x01, 0x0D, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+    0x02, 0x01, 0x01, 0x03, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01,
+    0x0A, 0x04, 0x02, 0x01, 0x06, 0x03, 0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x03, 0x01, 0x01, 0x01,
+    0x05, 0x02, 0x03, 0x04, 0x03, 0x03, 0x03, 0x02, 0x01, 0x01, 0x01, 0x02, 0x01, 0x02, 0x03, 0x03,
+    0x01, 0x03, 0x01, 0x01, 0x02, 0x05, 0x01, 0x01, 0x04, 0x03, 0x05, 0x01, 0x03, 0x01, 0x03, 0x03,
+    0x02, 0x01, 0x04, 0x03, 0x0A, 0x06, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+    0x02, 0x02, 0x01, 0x0A, 0x02, 0x05, 0x01, 0x01, 0x02, 0x07, 0x02, 0x17, 0x01, 0x05, 0x01, 0x01,
+    0x0E, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+    0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+    0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+    0x06, 0x02, 0x01, 0x04, 0x05, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01,
+    0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01,
+    0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x07, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01,
+    0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x02, 0x01, 0x01, 0x01, 0x01, 0x01, 0x01, 0x11,
+    0x00, 0x00,
+   
+    // Data for compression type 0x04
+    0xFF, 0xFB, 0x98, 0x9A, 0x84, 0x85, 0x63, 0x64, 0x3E, 0x3E, 0x22, 0x22, 0x13, 0x13, 0x18, 0x17,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00,
+   
+    // Data for compression type 0x05
+    0xFF, 0xF1, 0x9D, 0x9E, 0x9A, 0x9B, 0x9A, 0x97, 0x93, 0x93, 0x8C, 0x8E, 0x86, 0x88, 0x80, 0x82,
+    0x7C, 0x7C, 0x72, 0x73, 0x69, 0x6B, 0x5F, 0x60, 0x55, 0x56, 0x4A, 0x4B, 0x40, 0x41, 0x37, 0x37,
+    0x2F, 0x2F, 0x27, 0x27, 0x21, 0x21, 0x1B, 0x1C, 0x17, 0x17, 0x13, 0x13, 0x10, 0x10, 0x0D, 0x0D,
+    0x0B, 0x0B, 0x09, 0x09, 0x08, 0x08, 0x07, 0x07, 0x06, 0x05, 0x05, 0x04, 0x04, 0x04, 0x19, 0x18,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00,
+   
+    // Data for compression type 0x06
+    0xC3, 0xCB, 0xF5, 0x41, 0xFF, 0x7B, 0xF7, 0x21, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0xBF, 0xCC, 0xF2, 0x40, 0xFD, 0x7C, 0xF7, 0x22, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x7A, 0x46, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00,
+   
+    // Data for compression type 0x07
+    0xC3, 0xD9, 0xEF, 0x3D, 0xF9, 0x7C, 0xE9, 0x1E, 0xFD, 0xAB, 0xF1, 0x2C, 0xFC, 0x5B, 0xFE, 0x17,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0xBD, 0xD9, 0xEC, 0x3D, 0xF5, 0x7D, 0xE8, 0x1D, 0xFB, 0xAE, 0xF0, 0x2C, 0xFB, 0x5C, 0xFF, 0x18,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x70, 0x6C, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00,
+   
+    // Data for compression type 0x08
+    0xBA, 0xC5, 0xDA, 0x33, 0xE3, 0x6D, 0xD8, 0x18, 0xE5, 0x94, 0xDA, 0x23, 0xDF, 0x4A, 0xD1, 0x10,
+    0xEE, 0xAF, 0xE4, 0x2C, 0xEA, 0x5A, 0xDE, 0x15, 0xF4, 0x87, 0xE9, 0x21, 0xF6, 0x43, 0xFC, 0x12,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0xB0, 0xC7, 0xD8, 0x33, 0xE3, 0x6B, 0xD6, 0x18, 0xE7, 0x95, 0xD8, 0x23, 0xDB, 0x49, 0xD0, 0x11,
+    0xE9, 0xB2, 0xE2, 0x2B, 0xE8, 0x5C, 0xDD, 0x15, 0xF1, 0x87, 0xE7, 0x20, 0xF7, 0x44, 0xFF, 0x13,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x5F, 0x9E, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
+    0x00, 0x00
+};
+\ No newline at end of file
diff --git a/contrib/vmap_extractor_v2/stormlib/huffman/huff.h b/contrib/vmap_extractor_v2/stormlib/huffman/huff.h
new file mode 100644
index 00000000000..f06aa771acd
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/huffman/huff.h
@@ -0,0 +1,142 @@
+/*****************************************************************************/
+/* huffman.h                              Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Description :                                                             */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* xx.xx.xx  1.00  Lad  The first version of huffman.h                       */
+/* 03.05.03  2.00  Lad  Added compression                                    */
+/* 08.12.03  2.01  Dan  High-memory handling (> 0x80000000)                  */
+/*****************************************************************************/
+ 
+#ifndef __HUFFMAN_H__
+#define __HUFFMAN_H__
+
+#include "../StormPort.h"
+ 
+//-----------------------------------------------------------------------------
+// Defines
+ 
+#define INSERT_ITEM    1                   
+#define SWITCH_ITEMS   2                    // Switch the item1 and item2
+ 
+#define PTR_NOT(ptr)  (THTreeItem *)(~(DWORD_PTR)(ptr))
+#define PTR_PTR(ptr)  ((THTreeItem *)(ptr))
+#define PTR_INT(ptr)  (LONG_PTR)(ptr)
+ 
+#ifndef NULL
+#define NULL 0
+#endif
+ 
+//-----------------------------------------------------------------------------
+// Structures and classes
+ 
+// Input stream for Huffmann decompression
+class TInputStream
+{
+    public:
+ 
+    unsigned long GetBit();
+    unsigned long Get7Bits();
+    unsigned long Get8Bits();
+ 
+    unsigned char * pbInBuffer;         // 00 - Input data
+    unsigned long   dwBitBuff;          // 04 - Input bit buffer
+    unsigned int    nBits;              // 08 - Number of bits remaining in 'dwValue'
+};
+ 
+// Output stream for Huffmann compression
+class TOutputStream
+{
+    public:
+ 
+    void PutBits(unsigned long dwBuff, unsigned int nPutBits);
+ 
+    unsigned char * pbOutBuffer;        // 00 : Output buffer
+    unsigned long   dwOutSize;          // 04 : Size of output buffer
+    unsigned char * pbOutPos;           // 08 : Current output position
+    unsigned long   dwBitBuff;          // 0C : Bit buffer
+    unsigned long   nBits;              // 10 : Number of bits in the bit buffer
+};
+ 
+// Huffmann tree item (?)
+struct THTreeItem
+{
+    public:
+    
+    THTreeItem * Call1501DB70(THTreeItem * pLast);
+    THTreeItem * GetPrevItem(LONG_PTR value);
+    void         ClearItemLinks();
+    void         RemoveItem();
+ 
+    THTreeItem  * next;                 // 00 - Pointer to next THTreeItem
+    THTreeItem  * prev;                 // 04 - Pointer to prev THTreeItem (< 0 if none)
+    unsigned long dcmpByte;             // 08 - Index of this item in item pointer array, decompressed byte value
+    unsigned long byteValue;            // 0C - Some byte value
+    THTreeItem  * parent;               // 10 - Pointer to parent THTreeItem (NULL if none)
+    THTreeItem  * child;                // 14 - Pointer to child  THTreeItem
+    int           addressMultiplier;    // -1 if object on negative address (>0x80000000), +1 if positive
+};
+ 
+// Structure used for quick decompress. The 'bitCount' contains number of bits
+// and byte value contains result decompressed byte value.
+// After each walk through Huffman tree are filled all entries which are
+// multiplies of number of bits loaded from input stream. These entries
+// contain number of bits and result value. At the next 7 bits is tested this
+// structure first. If corresponding entry found, decompression routine will
+// not walk through Huffman tree and directly stores output byte to output stream.
+struct TQDecompress
+{
+    unsigned long offs00;               // 00 - 1 if resolved
+    unsigned long nBits;                // 04 - Bit count
+    union
+    {
+        unsigned long dcmpByte;         // 08 - Byte value for decompress (if bitCount <= 7)
+        THTreeItem  * pItem;            // 08 - THTreeItem (if number of bits is greater than 7
+    };
+};
+ 
+// Structure for Huffman tree (Size 0x3674 bytes). Because I'm not expert
+// for the decompression, I do not know actually if the class is really a Hufmann
+// tree. If someone knows the decompression details, please let me know
+class THuffmannTree
+{
+    public:
+    
+    THuffmannTree();
+    void  InitTree(bool bCompression);
+    void  BuildTree(unsigned int nCmpType);
+//  void  ModifyTree(unsigned long dwIndex);
+//  void  UninitTree();
+ 
+//  void  Call15007010(Bit32 dwInLength, THTreeItem * item);
+    THTreeItem * Call1500E740(unsigned int nValue);
+    void         Call1500E820(THTreeItem * pItem);
+    unsigned int DoCompression(TOutputStream * os, unsigned char * pbInBuffer, int nInLength, int nCmpType);
+    unsigned int DoDecompression(unsigned char * pbOutBuffer, unsigned int dwOutLength, TInputStream * is);
+ 
+    unsigned long bIsCmp0;              // 0000 - 1 if compression type 0
+    unsigned long offs0004;             // 0004 - Some flag
+    THTreeItem    items0008[0x203];     // 0008 - HTree items
+ 
+    //- Sometimes used as HTree item -----------
+    THTreeItem  * pItem3050;            // 3050 - Always NULL (?)
+    THTreeItem  * pItem3054;            // 3054 - Pointer to Huffman tree item
+    THTreeItem  * pItem3058;            // 3058 - Pointer to Huffman tree item (< 0 if invalid)
+ 
+    //- Sometimes used as HTree item -----------
+    THTreeItem  * pItem305C;            // 305C - Usually NULL
+    THTreeItem  * pFirst;               // 3060 - Pointer to top (first) Huffman tree item
+    THTreeItem  * pLast;                // 3064 - Pointer to bottom (last) Huffman tree item (< 0 if invalid)
+    unsigned long nItems;               // 3068 - Number of used HTree items
+ 
+    //-------------------------------------------
+    THTreeItem * items306C[0x102];      // 306C - THTreeItem pointer array
+    TQDecompress qd3474[0x80];          // 3474 - Array for quick decompression
+    int          addressMultiplier;     // -1 if object on negative address (>0x80000000), +1 if positive
+ 
+    static unsigned char Table1502A630[];// Some table
+};
+ 
+#endif // __HUFFMAN_H__
diff --git a/contrib/vmap_extractor_v2/stormlib/pklib/crc32.c b/contrib/vmap_extractor_v2/stormlib/pklib/crc32.c
new file mode 100644
index 00000000000..a7f52103be4
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/pklib/crc32.c
@@ -0,0 +1,72 @@
+/*****************************************************************************/
+/* crc32.c                                Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Pkware Data Compression Library Version 1.11                              */
+/* Dissassembled method crc32 - cdecl version                                */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 09.04.03  1.00  Lad  The first version of crc32.c                         */
+/* 02.05.03  1.00  Lad  Stress test done                                     */
+/*****************************************************************************/
+
+#include "pklib.h"
+
+static char CopyRight[] = "PKWARE Data Compression Library for Win32\r\n"
+                          "Copyright 1989-1995 PKWARE Inc.  All Rights Reserved\r\n"
+                          "Patent No. 5,051,745\r\n"
+                          "PKWARE Data Compression Library Reg. U.S. Pat. and Tm. Off.\r\n"
+                          "Version 1.11\r\n";
+
+static unsigned long crc_table[] =
+{
+    0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3,
+    0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91,
+    0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
+    0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5,
+    0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B,
+    0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
+    0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F,
+    0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D,
+    0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
+    0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01,
+    0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457,
+    0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
+    0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB,
+    0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9,
+    0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
+    0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD,
+    0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683,
+    0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
+    0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7,
+    0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5,
+    0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
+    0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79,
+    0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F,
+    0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
+    0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713,
+    0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21,
+    0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
+    0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45,
+    0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB,
+    0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
+    0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF,
+    0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D
+};
+
+
+unsigned long PKEXPORT crc32pk(char * buffer, unsigned int * psize, unsigned long * old_crc)
+{
+    unsigned int  size = *psize;
+    unsigned long ch;
+    unsigned long crc_value = *old_crc;
+
+    while(size-- != 0)
+    {
+        ch = *buffer++ ^ (char)crc_value;
+        crc_value >>= 8;
+
+        crc_value = crc_table[ch & 0x0FF] ^ crc_value;
+    }
+    return crc_value;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/pklib/crc32_pk.c b/contrib/vmap_extractor_v2/stormlib/pklib/crc32_pk.c
new file mode 100644
index 00000000000..a7f52103be4
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/pklib/crc32_pk.c
@@ -0,0 +1,72 @@
+/*****************************************************************************/
+/* crc32.c                                Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Pkware Data Compression Library Version 1.11                              */
+/* Dissassembled method crc32 - cdecl version                                */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 09.04.03  1.00  Lad  The first version of crc32.c                         */
+/* 02.05.03  1.00  Lad  Stress test done                                     */
+/*****************************************************************************/
+
+#include "pklib.h"
+
+static char CopyRight[] = "PKWARE Data Compression Library for Win32\r\n"
+                          "Copyright 1989-1995 PKWARE Inc.  All Rights Reserved\r\n"
+                          "Patent No. 5,051,745\r\n"
+                          "PKWARE Data Compression Library Reg. U.S. Pat. and Tm. Off.\r\n"
+                          "Version 1.11\r\n";
+
+static unsigned long crc_table[] =
+{
+    0x00000000, 0x77073096, 0xEE0E612C, 0x990951BA, 0x076DC419, 0x706AF48F, 0xE963A535, 0x9E6495A3,
+    0x0EDB8832, 0x79DCB8A4, 0xE0D5E91E, 0x97D2D988, 0x09B64C2B, 0x7EB17CBD, 0xE7B82D07, 0x90BF1D91,
+    0x1DB71064, 0x6AB020F2, 0xF3B97148, 0x84BE41DE, 0x1ADAD47D, 0x6DDDE4EB, 0xF4D4B551, 0x83D385C7,
+    0x136C9856, 0x646BA8C0, 0xFD62F97A, 0x8A65C9EC, 0x14015C4F, 0x63066CD9, 0xFA0F3D63, 0x8D080DF5,
+    0x3B6E20C8, 0x4C69105E, 0xD56041E4, 0xA2677172, 0x3C03E4D1, 0x4B04D447, 0xD20D85FD, 0xA50AB56B,
+    0x35B5A8FA, 0x42B2986C, 0xDBBBC9D6, 0xACBCF940, 0x32D86CE3, 0x45DF5C75, 0xDCD60DCF, 0xABD13D59,
+    0x26D930AC, 0x51DE003A, 0xC8D75180, 0xBFD06116, 0x21B4F4B5, 0x56B3C423, 0xCFBA9599, 0xB8BDA50F,
+    0x2802B89E, 0x5F058808, 0xC60CD9B2, 0xB10BE924, 0x2F6F7C87, 0x58684C11, 0xC1611DAB, 0xB6662D3D,
+    0x76DC4190, 0x01DB7106, 0x98D220BC, 0xEFD5102A, 0x71B18589, 0x06B6B51F, 0x9FBFE4A5, 0xE8B8D433,
+    0x7807C9A2, 0x0F00F934, 0x9609A88E, 0xE10E9818, 0x7F6A0DBB, 0x086D3D2D, 0x91646C97, 0xE6635C01,
+    0x6B6B51F4, 0x1C6C6162, 0x856530D8, 0xF262004E, 0x6C0695ED, 0x1B01A57B, 0x8208F4C1, 0xF50FC457,
+    0x65B0D9C6, 0x12B7E950, 0x8BBEB8EA, 0xFCB9887C, 0x62DD1DDF, 0x15DA2D49, 0x8CD37CF3, 0xFBD44C65,
+    0x4DB26158, 0x3AB551CE, 0xA3BC0074, 0xD4BB30E2, 0x4ADFA541, 0x3DD895D7, 0xA4D1C46D, 0xD3D6F4FB,
+    0x4369E96A, 0x346ED9FC, 0xAD678846, 0xDA60B8D0, 0x44042D73, 0x33031DE5, 0xAA0A4C5F, 0xDD0D7CC9,
+    0x5005713C, 0x270241AA, 0xBE0B1010, 0xC90C2086, 0x5768B525, 0x206F85B3, 0xB966D409, 0xCE61E49F,
+    0x5EDEF90E, 0x29D9C998, 0xB0D09822, 0xC7D7A8B4, 0x59B33D17, 0x2EB40D81, 0xB7BD5C3B, 0xC0BA6CAD,
+    0xEDB88320, 0x9ABFB3B6, 0x03B6E20C, 0x74B1D29A, 0xEAD54739, 0x9DD277AF, 0x04DB2615, 0x73DC1683,
+    0xE3630B12, 0x94643B84, 0x0D6D6A3E, 0x7A6A5AA8, 0xE40ECF0B, 0x9309FF9D, 0x0A00AE27, 0x7D079EB1,
+    0xF00F9344, 0x8708A3D2, 0x1E01F268, 0x6906C2FE, 0xF762575D, 0x806567CB, 0x196C3671, 0x6E6B06E7,
+    0xFED41B76, 0x89D32BE0, 0x10DA7A5A, 0x67DD4ACC, 0xF9B9DF6F, 0x8EBEEFF9, 0x17B7BE43, 0x60B08ED5,
+    0xD6D6A3E8, 0xA1D1937E, 0x38D8C2C4, 0x4FDFF252, 0xD1BB67F1, 0xA6BC5767, 0x3FB506DD, 0x48B2364B,
+    0xD80D2BDA, 0xAF0A1B4C, 0x36034AF6, 0x41047A60, 0xDF60EFC3, 0xA867DF55, 0x316E8EEF, 0x4669BE79,
+    0xCB61B38C, 0xBC66831A, 0x256FD2A0, 0x5268E236, 0xCC0C7795, 0xBB0B4703, 0x220216B9, 0x5505262F,
+    0xC5BA3BBE, 0xB2BD0B28, 0x2BB45A92, 0x5CB36A04, 0xC2D7FFA7, 0xB5D0CF31, 0x2CD99E8B, 0x5BDEAE1D,
+    0x9B64C2B0, 0xEC63F226, 0x756AA39C, 0x026D930A, 0x9C0906A9, 0xEB0E363F, 0x72076785, 0x05005713,
+    0x95BF4A82, 0xE2B87A14, 0x7BB12BAE, 0x0CB61B38, 0x92D28E9B, 0xE5D5BE0D, 0x7CDCEFB7, 0x0BDBDF21,
+    0x86D3D2D4, 0xF1D4E242, 0x68DDB3F8, 0x1FDA836E, 0x81BE16CD, 0xF6B9265B, 0x6FB077E1, 0x18B74777,
+    0x88085AE6, 0xFF0F6A70, 0x66063BCA, 0x11010B5C, 0x8F659EFF, 0xF862AE69, 0x616BFFD3, 0x166CCF45,
+    0xA00AE278, 0xD70DD2EE, 0x4E048354, 0x3903B3C2, 0xA7672661, 0xD06016F7, 0x4969474D, 0x3E6E77DB,
+    0xAED16A4A, 0xD9D65ADC, 0x40DF0B66, 0x37D83BF0, 0xA9BCAE53, 0xDEBB9EC5, 0x47B2CF7F, 0x30B5FFE9,
+    0xBDBDF21C, 0xCABAC28A, 0x53B39330, 0x24B4A3A6, 0xBAD03605, 0xCDD70693, 0x54DE5729, 0x23D967BF,
+    0xB3667A2E, 0xC4614AB8, 0x5D681B02, 0x2A6F2B94, 0xB40BBE37, 0xC30C8EA1, 0x5A05DF1B, 0x2D02EF8D
+};
+
+
+unsigned long PKEXPORT crc32pk(char * buffer, unsigned int * psize, unsigned long * old_crc)
+{
+    unsigned int  size = *psize;
+    unsigned long ch;
+    unsigned long crc_value = *old_crc;
+
+    while(size-- != 0)
+    {
+        ch = *buffer++ ^ (char)crc_value;
+        crc_value >>= 8;
+
+        crc_value = crc_table[ch & 0x0FF] ^ crc_value;
+    }
+    return crc_value;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/pklib/explode.c b/contrib/vmap_extractor_v2/stormlib/pklib/explode.c
new file mode 100644
index 00000000000..a5b41e3dcf9
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/pklib/explode.c
@@ -0,0 +1,480 @@
+/*****************************************************************************/
+/* explode.c                              Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Implode function of PKWARE Data Compression library                       */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 11.03.03  1.00  Lad  Splitted from Pkware.cpp                             */
+/* 08.04.03  1.01  Lad  Renamed to explode.c to be compatible with pklib     */
+/* 02.05.03  1.01  Lad  Stress test done                                     */
+/*****************************************************************************/
+
+#include <assert.h>
+#include <string.h>
+
+#include "pklib.h"
+
+//-----------------------------------------------------------------------------
+// Tables
+
+static unsigned char DistBits[] = 
+{
+    0x02, 0x04, 0x04, 0x05, 0x05, 0x05, 0x05, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06,
+    0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+    0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+    0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08
+};
+
+static unsigned char DistCode[] = 
+{
+    0x03, 0x0D, 0x05, 0x19, 0x09, 0x11, 0x01, 0x3E, 0x1E, 0x2E, 0x0E, 0x36, 0x16, 0x26, 0x06, 0x3A,
+    0x1A, 0x2A, 0x0A, 0x32, 0x12, 0x22, 0x42, 0x02, 0x7C, 0x3C, 0x5C, 0x1C, 0x6C, 0x2C, 0x4C, 0x0C,
+    0x74, 0x34, 0x54, 0x14, 0x64, 0x24, 0x44, 0x04, 0x78, 0x38, 0x58, 0x18, 0x68, 0x28, 0x48, 0x08,
+    0xF0, 0x70, 0xB0, 0x30, 0xD0, 0x50, 0x90, 0x10, 0xE0, 0x60, 0xA0, 0x20, 0xC0, 0x40, 0x80, 0x00
+};
+
+static unsigned char ExLenBits[] =
+{
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08
+};
+
+static unsigned short LenBase[] =
+{
+    0x0000, 0x0001, 0x0002, 0x0003, 0x0004, 0x0005, 0x0006, 0x0007,
+    0x0008, 0x000A, 0x000E, 0x0016, 0x0026, 0x0046, 0x0086, 0x0106
+};
+
+static unsigned char LenBits[] =
+{
+    0x03, 0x02, 0x03, 0x03, 0x04, 0x04, 0x04, 0x05, 0x05, 0x05, 0x05, 0x06, 0x06, 0x06, 0x07, 0x07
+};
+
+static unsigned char LenCode[] =
+{
+    0x05, 0x03, 0x01, 0x06, 0x0A, 0x02, 0x0C, 0x14, 0x04, 0x18, 0x08, 0x30, 0x10, 0x20, 0x40, 0x00
+};
+
+static unsigned char ChBitsAsc[] =
+{
+    0x0B, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x08, 0x07, 0x0C, 0x0C, 0x07, 0x0C, 0x0C,
+    0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0D, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+    0x04, 0x0A, 0x08, 0x0C, 0x0A, 0x0C, 0x0A, 0x08, 0x07, 0x07, 0x08, 0x09, 0x07, 0x06, 0x07, 0x08,
+    0x07, 0x06, 0x07, 0x07, 0x07, 0x07, 0x08, 0x07, 0x07, 0x08, 0x08, 0x0C, 0x0B, 0x07, 0x09, 0x0B,
+    0x0C, 0x06, 0x07, 0x06, 0x06, 0x05, 0x07, 0x08, 0x08, 0x06, 0x0B, 0x09, 0x06, 0x07, 0x06, 0x06,
+    0x07, 0x0B, 0x06, 0x06, 0x06, 0x07, 0x09, 0x08, 0x09, 0x09, 0x0B, 0x08, 0x0B, 0x09, 0x0C, 0x08,
+    0x0C, 0x05, 0x06, 0x06, 0x06, 0x05, 0x06, 0x06, 0x06, 0x05, 0x0B, 0x07, 0x05, 0x06, 0x05, 0x05,
+    0x06, 0x0A, 0x05, 0x05, 0x05, 0x05, 0x08, 0x07, 0x08, 0x08, 0x0A, 0x0B, 0x0B, 0x0C, 0x0C, 0x0C,
+    0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D,
+    0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D,
+    0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D,
+    0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+    0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+    0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+    0x0D, 0x0C, 0x0D, 0x0D, 0x0D, 0x0C, 0x0D, 0x0D, 0x0D, 0x0C, 0x0D, 0x0D, 0x0D, 0x0D, 0x0C, 0x0D,
+    0x0D, 0x0D, 0x0C, 0x0C, 0x0C, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D
+};
+
+static unsigned short ChCodeAsc[] = 
+{
+    0x0490, 0x0FE0, 0x07E0, 0x0BE0, 0x03E0, 0x0DE0, 0x05E0, 0x09E0,
+    0x01E0, 0x00B8, 0x0062, 0x0EE0, 0x06E0, 0x0022, 0x0AE0, 0x02E0,
+    0x0CE0, 0x04E0, 0x08E0, 0x00E0, 0x0F60, 0x0760, 0x0B60, 0x0360,
+    0x0D60, 0x0560, 0x1240, 0x0960, 0x0160, 0x0E60, 0x0660, 0x0A60,
+    0x000F, 0x0250, 0x0038, 0x0260, 0x0050, 0x0C60, 0x0390, 0x00D8,
+    0x0042, 0x0002, 0x0058, 0x01B0, 0x007C, 0x0029, 0x003C, 0x0098,
+    0x005C, 0x0009, 0x001C, 0x006C, 0x002C, 0x004C, 0x0018, 0x000C,
+    0x0074, 0x00E8, 0x0068, 0x0460, 0x0090, 0x0034, 0x00B0, 0x0710,
+    0x0860, 0x0031, 0x0054, 0x0011, 0x0021, 0x0017, 0x0014, 0x00A8,
+    0x0028, 0x0001, 0x0310, 0x0130, 0x003E, 0x0064, 0x001E, 0x002E,
+    0x0024, 0x0510, 0x000E, 0x0036, 0x0016, 0x0044, 0x0030, 0x00C8,
+    0x01D0, 0x00D0, 0x0110, 0x0048, 0x0610, 0x0150, 0x0060, 0x0088,
+    0x0FA0, 0x0007, 0x0026, 0x0006, 0x003A, 0x001B, 0x001A, 0x002A,
+    0x000A, 0x000B, 0x0210, 0x0004, 0x0013, 0x0032, 0x0003, 0x001D,
+    0x0012, 0x0190, 0x000D, 0x0015, 0x0005, 0x0019, 0x0008, 0x0078,
+    0x00F0, 0x0070, 0x0290, 0x0410, 0x0010, 0x07A0, 0x0BA0, 0x03A0,
+    0x0240, 0x1C40, 0x0C40, 0x1440, 0x0440, 0x1840, 0x0840, 0x1040,
+    0x0040, 0x1F80, 0x0F80, 0x1780, 0x0780, 0x1B80, 0x0B80, 0x1380,
+    0x0380, 0x1D80, 0x0D80, 0x1580, 0x0580, 0x1980, 0x0980, 0x1180,
+    0x0180, 0x1E80, 0x0E80, 0x1680, 0x0680, 0x1A80, 0x0A80, 0x1280,
+    0x0280, 0x1C80, 0x0C80, 0x1480, 0x0480, 0x1880, 0x0880, 0x1080,
+    0x0080, 0x1F00, 0x0F00, 0x1700, 0x0700, 0x1B00, 0x0B00, 0x1300,
+    0x0DA0, 0x05A0, 0x09A0, 0x01A0, 0x0EA0, 0x06A0, 0x0AA0, 0x02A0,
+    0x0CA0, 0x04A0, 0x08A0, 0x00A0, 0x0F20, 0x0720, 0x0B20, 0x0320,
+    0x0D20, 0x0520, 0x0920, 0x0120, 0x0E20, 0x0620, 0x0A20, 0x0220,
+    0x0C20, 0x0420, 0x0820, 0x0020, 0x0FC0, 0x07C0, 0x0BC0, 0x03C0,
+    0x0DC0, 0x05C0, 0x09C0, 0x01C0, 0x0EC0, 0x06C0, 0x0AC0, 0x02C0,
+    0x0CC0, 0x04C0, 0x08C0, 0x00C0, 0x0F40, 0x0740, 0x0B40, 0x0340,
+    0x0300, 0x0D40, 0x1D00, 0x0D00, 0x1500, 0x0540, 0x0500, 0x1900,
+    0x0900, 0x0940, 0x1100, 0x0100, 0x1E00, 0x0E00, 0x0140, 0x1600,
+    0x0600, 0x1A00, 0x0E40, 0x0640, 0x0A40, 0x0A00, 0x1200, 0x0200,
+    0x1C00, 0x0C00, 0x1400, 0x0400, 0x1800, 0x0800, 0x1000, 0x0000  
+};
+
+//-----------------------------------------------------------------------------
+// Local variables
+
+static char Copyright[] = "PKWARE Data Compression Library for Win32\r\n"
+                          "Copyright 1989-1995 PKWARE Inc.  All Rights Reserved\r\n"
+                          "Patent No. 5,051,745\r\n"
+                          "PKWARE Data Compression Library Reg. U.S. Pat. and Tm. Off.\r\n"
+                          "Version 1.11\r\n";
+
+//-----------------------------------------------------------------------------
+// Local functions
+
+// Copies a block to another location
+static void lmemcpy(void * trg, const void * src, size_t count)
+{
+    memcpy(trg, src, count);
+}
+
+static void GenDecodeTabs(long count, unsigned char * bits, unsigned char * pCode, unsigned char * buffer2)
+{
+    long i;
+
+    for(i = count-1; i >= 0; i--)             // EBX - count
+    {
+        unsigned long idx1 = pCode[i];
+        unsigned long idx2 = 1 << bits[i];
+
+        do
+        {
+            buffer2[idx1] = (unsigned char)i;
+            idx1         += idx2;
+        }
+        while(idx1 < 0x100);
+    }
+}
+
+static void GenAscTabs(TDcmpStruct * pWork)
+{
+    unsigned short * pChCodeAsc = &ChCodeAsc[0xFF];
+    unsigned long  acc, add;
+    unsigned short count;
+
+    for(count = 0x00FF; pChCodeAsc >= ChCodeAsc; pChCodeAsc--, count--)
+    {
+        unsigned char * pChBitsAsc = pWork->ChBitsAsc + count;
+        unsigned char bits_asc = *pChBitsAsc;
+
+        if(bits_asc <= 8)
+        {
+            add = (1 << bits_asc);
+            acc = *pChCodeAsc;
+
+            do
+            {
+                pWork->offs2C34[acc] = (unsigned char)count;
+                acc += add;
+            }
+            while(acc < 0x100);
+        }
+        else if((acc = (*pChCodeAsc & 0xFF)) != 0)
+        {
+            pWork->offs2C34[acc] = 0xFF;
+
+            if(*pChCodeAsc & 0x3F)
+            {
+                bits_asc -= 4;
+                *pChBitsAsc = bits_asc;
+
+                add = (1 << bits_asc);
+                acc = *pChCodeAsc >> 4;
+                do
+                {
+                    pWork->offs2D34[acc] = (unsigned char)count;
+                    acc += add;
+                }
+                while(acc < 0x100);
+            }
+            else
+            {
+                bits_asc -= 6;
+                *pChBitsAsc = bits_asc;
+
+                add = (1 << bits_asc);
+                acc = *pChCodeAsc >> 6;
+                do
+                {
+                    pWork->offs2E34[acc] = (unsigned char)count;
+                    acc += add;
+                }
+                while(acc < 0x80);
+            }
+        }
+        else
+        {
+            bits_asc -= 8;
+            *pChBitsAsc = bits_asc;
+
+            add = (1 << bits_asc);
+            acc = *pChCodeAsc >> 8;
+            do
+            {
+                pWork->offs2EB4[acc] = (unsigned char)count;
+                acc += add;
+            }
+            while(acc < 0x100);
+        }
+    }
+}
+
+//-----------------------------------------------------------------------------
+// Skips given number of bits in bit buffer. Result is stored in pWork->bit_buff
+// If no data in input buffer, returns true
+
+static int WasteBits(TDcmpStruct * pWork, unsigned long nBits)
+{
+    // If number of bits required is less than number of (bits in the buffer) ?
+    if(nBits <= pWork->extra_bits)
+    {
+        pWork->extra_bits -= nBits;
+        pWork->bit_buff  >>= nBits;
+        return 0;
+    }
+
+    // Load input buffer if necessary
+    pWork->bit_buff >>= pWork->extra_bits;
+    if(pWork->in_pos == pWork->in_bytes)
+    {
+        pWork->in_pos = sizeof(pWork->in_buff);
+        if((pWork->in_bytes = pWork->read_buf((char *)pWork->in_buff, &pWork->in_pos, pWork->param)) == 0)
+            return 1;
+        pWork->in_pos = 0;
+    }
+
+    // Update bit buffer
+    pWork->bit_buff  |= (pWork->in_buff[pWork->in_pos++] << 8);
+    pWork->bit_buff >>= (nBits - pWork->extra_bits);
+    pWork->extra_bits    = (pWork->extra_bits - nBits) + 8;
+    return 0;
+}
+
+//-----------------------------------------------------------------------------
+// Returns : 0x000 - 0x0FF : One byte from compressed file.
+//           0x100 - 0x305 : Copy previous block (0x100 = 1 byte)
+//           0x306         : Out of buffer (?)
+
+static unsigned long DecodeLit(TDcmpStruct * pWork)
+{
+    unsigned long nBits;                // Number of bits to skip
+    unsigned long value;                // Position in buffers
+
+    // Test the current bit in byte buffer. If is not set, simply return the next byte.
+    if(pWork->bit_buff & 1)
+    {
+        // Skip current bit in the buffer
+        if(WasteBits(pWork, 1))
+            return 0x306;   
+
+        // The next bits are position in buffers
+        value = pWork->position2[(pWork->bit_buff & 0xFF)];
+        
+        // Get number of bits to skip
+        if(WasteBits(pWork, pWork->LenBits[value]))
+            return 0x306;
+
+        if((nBits = pWork->ExLenBits[value]) != 0)
+        {
+            unsigned long val2 = pWork->bit_buff & ((1 << nBits) - 1);
+
+            if(WasteBits(pWork, nBits))
+            {
+                if((value + val2) != 0x10E)
+                    return 0x306;
+            }
+            value = pWork->LenBase[value] + val2;
+        }
+        return value + 0x100;           // Return number of bytes to repeat
+    }
+
+    // Waste one bit
+    if(WasteBits(pWork, 1))
+        return 0x306;
+
+    // If the binary compression type, read 8 bits and return them as one byte.
+    if(pWork->ctype == CMP_BINARY)
+    {
+        value = pWork->bit_buff & 0xFF;
+        if(WasteBits(pWork, 8))
+            return 0x306;
+        return value;
+    }
+
+    // When ASCII compression ...
+    if(pWork->bit_buff & 0xFF)
+    {
+        value = pWork->offs2C34[pWork->bit_buff & 0xFF];
+
+        if(value == 0xFF)
+        {
+            if(pWork->bit_buff & 0x3F)
+            {
+                if(WasteBits(pWork, 4))
+                    return 0x306;
+
+                value = pWork->offs2D34[pWork->bit_buff & 0xFF];
+            }
+            else
+            {
+                if(WasteBits(pWork, 6))
+                    return 0x306;
+
+                value = pWork->offs2E34[pWork->bit_buff & 0x7F];
+            }
+        }
+    }
+    else
+    {
+        if(WasteBits(pWork, 8))
+            return 0x306;
+
+        value = pWork->offs2EB4[pWork->bit_buff & 0xFF];
+    }
+
+    return WasteBits(pWork, pWork->ChBitsAsc[value]) ? 0x306 : value;
+}
+
+//-----------------------------------------------------------------------------
+// Retrieves the number of bytes to move back 
+
+static unsigned long DecodeDist(TDcmpStruct * pWork, unsigned long dwLength)
+{
+    unsigned long pos   = pWork->position1[(pWork->bit_buff & 0xFF)];
+    unsigned long nSkip = pWork->DistBits[pos];     // Number of bits to skip
+
+    // Skip the appropriate number of bits
+    if(WasteBits(pWork, nSkip) == 1)
+        return 0;
+
+    if(dwLength == 2)
+    {
+        pos = (pos << 2) | (pWork->bit_buff & 0x03);
+
+        if(WasteBits(pWork, 2) == 1)
+            return 0;
+    }
+    else
+    {
+        pos = (pos << pWork->dsize_bits) | (pWork->bit_buff & pWork->dsize_mask);
+
+        // Skip the bits
+        if(WasteBits(pWork, pWork->dsize_bits) == 1)
+            return 0;
+    }
+    return pos+1;
+}
+
+static unsigned long Expand(TDcmpStruct * pWork)
+{
+    unsigned int  copyBytes;            // Number of bytes to copy
+    unsigned long oneByte;              // One byte from compressed file
+    unsigned long dwResult;
+
+    pWork->outputPos = 0x1000;          // Initialize output buffer position
+
+    // If end of data or error, terminate decompress
+    while((dwResult = oneByte = DecodeLit(pWork)) < 0x305)
+    {
+        // If one byte is greater than 0x100, means "Repeat n - 0xFE bytes"
+        if(oneByte >= 0x100)
+        {
+            unsigned char * source;          // ECX
+            unsigned char * target;          // EDX
+            unsigned long  copyLength = oneByte - 0xFE;
+            unsigned long  moveBack;
+
+            // Get length of data to copy
+            if((moveBack = DecodeDist(pWork, copyLength)) == 0)
+            {
+                dwResult = 0x306;
+                break;
+            }
+
+            // Target and source pointer
+            target = &pWork->out_buff[pWork->outputPos];
+            source = target - moveBack;
+            pWork->outputPos += copyLength;
+
+            while(copyLength-- > 0)
+                *target++ = *source++;
+        }
+        else
+            pWork->out_buff[pWork->outputPos++] = (unsigned char)oneByte;
+    
+        // If number of extracted bytes has reached 1/2 of output buffer,
+        // flush output buffer.
+        if(pWork->outputPos >= 0x2000)
+        {
+            // Copy decompressed data into user buffer
+            copyBytes = 0x1000;
+            pWork->write_buf((char *)&pWork->out_buff[0x1000], &copyBytes, pWork->param);
+
+            // If there are some data left, keep them alive
+            lmemcpy(pWork->out_buff, &pWork->out_buff[0x1000], pWork->outputPos - 0x1000);
+            pWork->outputPos -= 0x1000;
+        }
+    }
+
+    copyBytes = pWork->outputPos - 0x1000;
+    pWork->write_buf((char *)&pWork->out_buff[0x1000], &copyBytes, pWork->param);
+    return dwResult;
+}
+
+
+//-----------------------------------------------------------------------------
+// Main exploding function.
+
+unsigned int explode(
+        unsigned int (*read_buf)(char *buf, unsigned  int *size, void *param),
+        void         (*write_buf)(char *buf, unsigned  int *size, void *param),
+        char         *work_buf,
+        void         *param)
+{
+    TDcmpStruct * pWork = (TDcmpStruct *)work_buf;
+
+    // Set the whole work buffer to zeros
+    memset(pWork, 0, sizeof(TDcmpStruct));
+
+    // Initialize work struct and load compressed data
+    pWork->read_buf   = read_buf;
+    pWork->write_buf  = write_buf;
+    pWork->param      = param;
+    pWork->in_pos     = sizeof(pWork->in_buff);
+    pWork->in_bytes   = pWork->read_buf((char *)pWork->in_buff, &pWork->in_pos, pWork->param);
+    if(pWork->in_bytes <= 4)
+        return CMP_BAD_DATA;
+
+    pWork->ctype      = pWork->in_buff[0]; // Get the compression type
+    pWork->dsize_bits = pWork->in_buff[1]; // Get the dictionary size
+    pWork->bit_buff   = pWork->in_buff[2]; // Initialize 16-bit bit buffer
+    pWork->extra_bits = 0;                 // Extra (over 8) bits
+    pWork->in_pos     = 3;                 // Position in input buffer
+
+    // Test for the valid dictionary size
+    if(4 > pWork->dsize_bits || pWork->dsize_bits > 6) 
+        return CMP_INVALID_DICTSIZE;
+
+    pWork->dsize_mask = 0xFFFF >> (0x10 - pWork->dsize_bits); // Shifted by 'sar' instruction
+
+    if(pWork->ctype != CMP_BINARY)
+    {
+        if(pWork->ctype != CMP_ASCII)
+            return CMP_INVALID_MODE;
+
+        lmemcpy(pWork->ChBitsAsc, ChBitsAsc, sizeof(pWork->ChBitsAsc));
+        GenAscTabs(pWork);
+    }
+
+    lmemcpy(pWork->LenBits, LenBits, sizeof(pWork->LenBits));
+    GenDecodeTabs(0x10, pWork->LenBits, LenCode, pWork->position2);
+    lmemcpy(pWork->ExLenBits, ExLenBits, sizeof(pWork->ExLenBits));
+    lmemcpy(pWork->LenBase, LenBase, sizeof(pWork->LenBase));
+    lmemcpy(pWork->DistBits, DistBits, sizeof(pWork->DistBits));
+    GenDecodeTabs(0x40, pWork->DistBits, DistCode, pWork->position1);
+    if(Expand(pWork) != 0x306)
+        return CMP_NO_ERROR;
+        
+    return CMP_ABORT;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/pklib/implode.c b/contrib/vmap_extractor_v2/stormlib/pklib/implode.c
new file mode 100644
index 00000000000..68d5301cc8d
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/pklib/implode.c
@@ -0,0 +1,674 @@
+/*****************************************************************************/
+/* implode.c                              Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Implode function of PKWARE Data Compression library                       */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 11.04.03  1.00  Lad  First version of implode.c                           */
+/* 02.05.03  1.00  Lad  Stress test done                                     */
+/*****************************************************************************/
+
+#include <assert.h>
+#include <string.h>
+
+#include "pklib.h"
+
+#if ((1200 < _MSC_VER) && (_MSC_VER < 1400))
+#pragma optimize("", off)               // Fucking Microsoft VS.NET 2003 compiler !!!
+                                        // (_MSC_VER=1310)
+#endif
+
+//-----------------------------------------------------------------------------
+// Defines
+
+#define DICT_OFFSET   0x204
+#define UNCMP_OFFSET  (pWork->dsize_bytes + DICT_OFFSET)
+
+//-----------------------------------------------------------------------------
+// Tables
+
+static unsigned char DistBits[] = 
+{
+    0x02, 0x04, 0x04, 0x05, 0x05, 0x05, 0x05, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x06,
+    0x06, 0x06, 0x06, 0x06, 0x06, 0x06, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+    0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07, 0x07,
+    0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08, 0x08
+};
+
+static unsigned char DistCode[] = 
+{
+    0x03, 0x0D, 0x05, 0x19, 0x09, 0x11, 0x01, 0x3E, 0x1E, 0x2E, 0x0E, 0x36, 0x16, 0x26, 0x06, 0x3A,
+    0x1A, 0x2A, 0x0A, 0x32, 0x12, 0x22, 0x42, 0x02, 0x7C, 0x3C, 0x5C, 0x1C, 0x6C, 0x2C, 0x4C, 0x0C,
+    0x74, 0x34, 0x54, 0x14, 0x64, 0x24, 0x44, 0x04, 0x78, 0x38, 0x58, 0x18, 0x68, 0x28, 0x48, 0x08,
+    0xF0, 0x70, 0xB0, 0x30, 0xD0, 0x50, 0x90, 0x10, 0xE0, 0x60, 0xA0, 0x20, 0xC0, 0x40, 0x80, 0x00
+};
+
+static unsigned char ExLenBits[] =
+{
+    0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, 0x07, 0x08
+};
+
+static unsigned char LenBits[] =
+{
+    0x03, 0x02, 0x03, 0x03, 0x04, 0x04, 0x04, 0x05, 0x05, 0x05, 0x05, 0x06, 0x06, 0x06, 0x07, 0x07
+};
+
+static unsigned char LenCode[] =
+{
+    0x05, 0x03, 0x01, 0x06, 0x0A, 0x02, 0x0C, 0x14, 0x04, 0x18, 0x08, 0x30, 0x10, 0x20, 0x40, 0x00
+};
+
+static unsigned char ChBitsAsc[] =
+{
+    0x0B, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x08, 0x07, 0x0C, 0x0C, 0x07, 0x0C, 0x0C,
+    0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0D, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+    0x04, 0x0A, 0x08, 0x0C, 0x0A, 0x0C, 0x0A, 0x08, 0x07, 0x07, 0x08, 0x09, 0x07, 0x06, 0x07, 0x08,
+    0x07, 0x06, 0x07, 0x07, 0x07, 0x07, 0x08, 0x07, 0x07, 0x08, 0x08, 0x0C, 0x0B, 0x07, 0x09, 0x0B,
+    0x0C, 0x06, 0x07, 0x06, 0x06, 0x05, 0x07, 0x08, 0x08, 0x06, 0x0B, 0x09, 0x06, 0x07, 0x06, 0x06,
+    0x07, 0x0B, 0x06, 0x06, 0x06, 0x07, 0x09, 0x08, 0x09, 0x09, 0x0B, 0x08, 0x0B, 0x09, 0x0C, 0x08,
+    0x0C, 0x05, 0x06, 0x06, 0x06, 0x05, 0x06, 0x06, 0x06, 0x05, 0x0B, 0x07, 0x05, 0x06, 0x05, 0x05,
+    0x06, 0x0A, 0x05, 0x05, 0x05, 0x05, 0x08, 0x07, 0x08, 0x08, 0x0A, 0x0B, 0x0B, 0x0C, 0x0C, 0x0C,
+    0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D,
+    0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D,
+    0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D,
+    0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+    0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+    0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C, 0x0C,
+    0x0D, 0x0C, 0x0D, 0x0D, 0x0D, 0x0C, 0x0D, 0x0D, 0x0D, 0x0C, 0x0D, 0x0D, 0x0D, 0x0D, 0x0C, 0x0D,
+    0x0D, 0x0D, 0x0C, 0x0C, 0x0C, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D, 0x0D
+};
+
+static unsigned short ChCodeAsc[] = 
+{
+    0x0490, 0x0FE0, 0x07E0, 0x0BE0, 0x03E0, 0x0DE0, 0x05E0, 0x09E0,
+    0x01E0, 0x00B8, 0x0062, 0x0EE0, 0x06E0, 0x0022, 0x0AE0, 0x02E0,
+    0x0CE0, 0x04E0, 0x08E0, 0x00E0, 0x0F60, 0x0760, 0x0B60, 0x0360,
+    0x0D60, 0x0560, 0x1240, 0x0960, 0x0160, 0x0E60, 0x0660, 0x0A60,
+    0x000F, 0x0250, 0x0038, 0x0260, 0x0050, 0x0C60, 0x0390, 0x00D8,
+    0x0042, 0x0002, 0x0058, 0x01B0, 0x007C, 0x0029, 0x003C, 0x0098,
+    0x005C, 0x0009, 0x001C, 0x006C, 0x002C, 0x004C, 0x0018, 0x000C,
+    0x0074, 0x00E8, 0x0068, 0x0460, 0x0090, 0x0034, 0x00B0, 0x0710,
+    0x0860, 0x0031, 0x0054, 0x0011, 0x0021, 0x0017, 0x0014, 0x00A8,
+    0x0028, 0x0001, 0x0310, 0x0130, 0x003E, 0x0064, 0x001E, 0x002E,
+    0x0024, 0x0510, 0x000E, 0x0036, 0x0016, 0x0044, 0x0030, 0x00C8,
+    0x01D0, 0x00D0, 0x0110, 0x0048, 0x0610, 0x0150, 0x0060, 0x0088,
+    0x0FA0, 0x0007, 0x0026, 0x0006, 0x003A, 0x001B, 0x001A, 0x002A,
+    0x000A, 0x000B, 0x0210, 0x0004, 0x0013, 0x0032, 0x0003, 0x001D,
+    0x0012, 0x0190, 0x000D, 0x0015, 0x0005, 0x0019, 0x0008, 0x0078,
+    0x00F0, 0x0070, 0x0290, 0x0410, 0x0010, 0x07A0, 0x0BA0, 0x03A0,
+    0x0240, 0x1C40, 0x0C40, 0x1440, 0x0440, 0x1840, 0x0840, 0x1040,
+    0x0040, 0x1F80, 0x0F80, 0x1780, 0x0780, 0x1B80, 0x0B80, 0x1380,
+    0x0380, 0x1D80, 0x0D80, 0x1580, 0x0580, 0x1980, 0x0980, 0x1180,
+    0x0180, 0x1E80, 0x0E80, 0x1680, 0x0680, 0x1A80, 0x0A80, 0x1280,
+    0x0280, 0x1C80, 0x0C80, 0x1480, 0x0480, 0x1880, 0x0880, 0x1080,
+    0x0080, 0x1F00, 0x0F00, 0x1700, 0x0700, 0x1B00, 0x0B00, 0x1300,
+    0x0DA0, 0x05A0, 0x09A0, 0x01A0, 0x0EA0, 0x06A0, 0x0AA0, 0x02A0,
+    0x0CA0, 0x04A0, 0x08A0, 0x00A0, 0x0F20, 0x0720, 0x0B20, 0x0320,
+    0x0D20, 0x0520, 0x0920, 0x0120, 0x0E20, 0x0620, 0x0A20, 0x0220,
+    0x0C20, 0x0420, 0x0820, 0x0020, 0x0FC0, 0x07C0, 0x0BC0, 0x03C0,
+    0x0DC0, 0x05C0, 0x09C0, 0x01C0, 0x0EC0, 0x06C0, 0x0AC0, 0x02C0,
+    0x0CC0, 0x04C0, 0x08C0, 0x00C0, 0x0F40, 0x0740, 0x0B40, 0x0340,
+    0x0300, 0x0D40, 0x1D00, 0x0D00, 0x1500, 0x0540, 0x0500, 0x1900,
+    0x0900, 0x0940, 0x1100, 0x0100, 0x1E00, 0x0E00, 0x0140, 0x1600,
+    0x0600, 0x1A00, 0x0E40, 0x0640, 0x0A40, 0x0A00, 0x1200, 0x0200,
+    0x1C00, 0x0C00, 0x1400, 0x0400, 0x1800, 0x0800, 0x1000, 0x0000  
+};
+
+//-----------------------------------------------------------------------------
+// Local variables
+
+static char Copyright[] = "PKWARE Data Compression Library for Win32\r\n"
+                          "Copyright 1989-1995 PKWARE Inc.  All Rights Reserved\r\n"
+                          "Patent No. 5,051,745\r\n"
+                          "PKWARE Data Compression Library Reg. U.S. Pat. and Tm. Off.\r\n"
+                          "Version 1.11\r\n";
+
+//-----------------------------------------------------------------------------
+// Local functions
+
+// Fills memory block with a character
+static void lmemset(void * buff, int c, size_t count)
+{
+    memset(buff, c, count);
+}
+
+// Copies memory block to another location
+static void lmemcpy(void * trg, const void * src, size_t count)
+{
+    memcpy(trg, src, count);
+}
+
+static void SortBuffer(TCmpStruct * pWork, unsigned char * uncmp_data, unsigned char * work_end)
+{
+    unsigned short * pin0DC8;
+    unsigned char  * puncmp;
+    unsigned long    offs1, offs2;
+    unsigned long    ndwords;
+    unsigned int     add;
+
+    // Fill 0x480 dwords (0x1200 bytes)
+    ndwords = (unsigned long)((pWork->out_buff - (char *)pWork->offs0DC8 + 1) >> 2);
+    if(ndwords <= 1)
+        ndwords = 1;
+    memset(pWork->offs0DC8, 0, ndwords << 2);
+
+    for(puncmp = uncmp_data; work_end > puncmp; puncmp++)
+        pWork->offs0DC8[(puncmp[0] * 4) + (puncmp[1] * 5)]++;
+
+    add = 0;
+    for(pin0DC8 = pWork->offs0DC8; pin0DC8 < &pWork->offs1FC8; pin0DC8++)
+    {
+        add     += *pin0DC8;
+        *pin0DC8 = (unsigned short)add;
+    }
+
+    for(work_end--; work_end >= uncmp_data; work_end--)
+    {
+        offs1 = (work_end[0] * 4) + (work_end[1] * 5);  // EAX
+        offs2 = (unsigned long)(work_end - pWork->work_buff);          // EDI
+
+        pWork->offs0DC8[offs1]--;
+        pWork->offs49D0[pWork->offs0DC8[offs1]] = (unsigned short)offs2;
+    }
+}
+
+static void FlushBuf(TCmpStruct * pWork)
+{
+    unsigned char save_ch1;
+    unsigned char save_ch2;
+    unsigned int size = 0x800;
+
+    pWork->write_buf(pWork->out_buff, &size, pWork->param);
+
+    save_ch1 = pWork->out_buff[0x800];
+    save_ch2 = pWork->out_buff[pWork->out_bytes];
+    pWork->out_bytes -= 0x800;
+
+    lmemset(pWork->out_buff, 0, 0x802);
+
+    if(pWork->out_bytes != 0)
+        pWork->out_buff[0] = save_ch1;
+    if(pWork->out_bits != 0)
+        pWork->out_buff[pWork->out_bytes] = save_ch2;
+}
+
+static void OutputBits(TCmpStruct * pWork, unsigned int nbits, unsigned long bit_buff)
+{
+    unsigned int out_bits;
+
+    // If more than 8 bits to output, do recursion
+    if(nbits > 8)
+    {
+        OutputBits(pWork, 8, bit_buff);
+        bit_buff >>= 8;
+        nbits -= 8;
+    }
+
+    // Add bits to the last out byte in out_buff;
+    out_bits = pWork->out_bits;
+    pWork->out_buff[pWork->out_bytes] |= (unsigned char)(bit_buff << out_bits);
+    pWork->out_bits += nbits;
+
+    // If 8 or more bits, increment number of bytes
+    if(pWork->out_bits > 8)
+    {
+        pWork->out_bytes++;
+        bit_buff >>= (8 - out_bits);
+        
+        pWork->out_buff[pWork->out_bytes] = (unsigned char)bit_buff;
+        pWork->out_bits &= 7;
+    }
+    else
+    {
+        pWork->out_bits &= 7;
+        if(pWork->out_bits == 0)
+            pWork->out_bytes++;
+    }
+
+    // If there is enough compressed bytes, flush them
+    if(pWork->out_bytes >= 0x800)
+        FlushBuf(pWork);
+}
+
+static unsigned long FindRep(TCmpStruct * pWork, unsigned char * srcbuff)
+{
+    unsigned short  esp12;
+    unsigned char * esp14;
+    unsigned short  esp18;
+    unsigned char * srcbuff2;
+    unsigned char   esp20;
+
+    unsigned char  * srcbuff3;
+    unsigned short * pin0DC8;
+    unsigned char  * pin27CC;
+    unsigned short * pin49D0;
+    unsigned long    nreps = 1;         // EAX
+    unsigned long    ebx, esi;
+    unsigned short   di;
+
+    pin0DC8 = pWork->offs0DC8 + (srcbuff[0] * 4) + (srcbuff[1] * 5);
+    esi     = (unsigned long)(srcbuff - pWork->dsize_bytes - pWork->work_buff + 1);
+    esp18   = *pin0DC8;
+    pin49D0 = pWork->offs49D0 + esp18;
+
+    if(*pin49D0 < esi)
+    {
+        while(*pin49D0 < esi)
+        {
+            pin49D0++;
+            esp18++;
+        }
+        *pin0DC8 = esp18;
+    }
+//---------------------------------------------------------------------------
+    srcbuff2 = srcbuff - 1;
+    pin49D0  = pWork->offs49D0 + esp18;
+    pin27CC  = pWork->work_buff + *pin49D0;
+    if(srcbuff2 <= pin27CC)
+        return 0;
+//---------------------------------------------------------------------------
+    srcbuff3 = srcbuff;
+    for(;;)
+    {
+        if(srcbuff3[nreps-1] == pin27CC[nreps-1] && *srcbuff3 == *pin27CC)
+        {
+            //
+            // The following code does not work when compiled with MSVC.NET 2003
+            // optimizing compiler. We have to switch the optimizations off to make it work
+            // I found that in debug version (where the optimizations are off), the value
+            // of "pin27CC" gets incremented twice (once at below, once in the "for" loop)
+            //
+
+            pin27CC++;
+            srcbuff3++;
+
+            for(ebx = 2; ebx < DICT_OFFSET; ebx++)
+            {
+                pin27CC++;
+                srcbuff3++;
+                if(*pin27CC != *srcbuff3)
+                    break;
+            }
+
+            srcbuff3 = srcbuff;
+            if(ebx >= nreps)
+            {
+                pWork->offs0000 = (unsigned int)(srcbuff3 - pin27CC + ebx - 1);
+                if((nreps = ebx) > 10)
+                    break;
+            }
+        }
+
+        pin49D0++;
+        esp18++;
+        pin27CC = pWork->work_buff + *pin49D0;
+
+        if(srcbuff2 > pin27CC)
+            continue;
+
+        return (nreps >= 2) ? nreps : 0;
+    }
+//---------------------------------------------------------------------------
+    if(ebx == DICT_OFFSET)
+    {
+        pWork->offs0000--;
+        return ebx;
+    }
+//---------------------------------------------------------------------------
+    pin49D0 = pWork->offs49D0 + esp18;
+    if(pWork->work_buff + pin49D0[1] >= srcbuff2)
+        return nreps;
+//---------------------------------------------------------------------------
+    di = 0;
+    pWork->offs09BC[0] = 0xFFFF;
+    pWork->offs09BC[1] = di;
+    esp12 = 1;
+
+    do
+    {
+        esi = di;
+        if(srcbuff[esp12] != srcbuff[esi])
+        {
+            di = pWork->offs09BC[esi];
+            if(di != 0xFFFF)
+                continue;
+        }
+        pWork->offs09BC[++esp12] = ++di;
+    }
+    while(esp12 < nreps);
+//---------------------------------------------------------------------------
+    esi     = nreps;
+    pin27CC = pWork->work_buff + pin49D0[0] + nreps;
+    esp14   = pin27CC;
+    
+    for(;;)   // 0040268B
+    {
+        esi = pWork->offs09BC[esi];
+        if(esi == 0xFFFF)
+            esi = 0;
+
+        pin49D0 = pWork->offs49D0 + esp18;
+        do
+        {
+            pin49D0++;
+            esp18++;
+            pin27CC = pWork->work_buff + pin49D0[0];
+            if(pin27CC >= srcbuff2)
+                return nreps;
+        }
+        while(pin27CC + esi < esp14);
+//---------------------------------------------------------------------------
+        esp20 = srcbuff[nreps - 2];
+        if(esp20 == pin27CC[nreps - 2])
+        {
+            if(pin27CC + esi != esp14)
+            {
+                esp14 = pin27CC;
+                esi = 0;
+            }
+        }
+        else
+        {
+            pin49D0 = pWork->offs49D0 + esp18;
+            do
+            {
+                pin49D0++;
+                esp18++;
+                pin27CC = pWork->work_buff + pin49D0[0];
+                if(pin27CC >= srcbuff2)
+                    return nreps;
+            }
+            while(pin27CC[nreps - 2] != esp20 || pin27CC[0] != *srcbuff);
+
+            esp14 = pin27CC + 2;
+            esi   = 2;
+        }
+//---------------------------------------------------------------------------
+        for(; esp14[0] == srcbuff[esi]; esp14++)
+        {
+            if(++esi >= DICT_OFFSET)
+                break;
+        }
+
+        if(esi < nreps)
+            continue;
+        pWork->offs0000 = (unsigned int)(srcbuff - pin27CC - 1);
+        if(esi <= nreps)
+            continue;
+        nreps = esi;
+        if(esi == DICT_OFFSET)
+            return nreps;
+
+        do
+        {
+            if(srcbuff[esp12] != srcbuff[di])
+            {
+                di = pWork->offs09BC[di];
+                if(di != 0xFFFF)
+                    continue;
+            }
+            pWork->offs09BC[++esp12] = ++di;
+        }
+        while(esp12 < esi);
+    }
+}
+
+static void WriteCmpData(TCmpStruct * pWork)
+{
+    unsigned int    nreps = 0;          // ESP+10 : Number of repeats
+    unsigned char * uncmp_end;          // ESP+14 : End of uncompressed data
+    unsigned int    esp18 = 0;          // ESP+18 :
+    unsigned int    bytes_required;     // ESP+1C : Number of bytes required to read
+    unsigned int    esp20 = 0;          // ESP+20 :
+    unsigned char * uncmp_begin = pWork->work_buff + UNCMP_OFFSET; // EDI
+    unsigned long   nreps1;
+    unsigned long   save_offs0000 = 0;
+
+    // Store the compression type and dictionary size
+    pWork->out_buff[0] = (char)pWork->ctype;
+    pWork->out_buff[1] = (char)pWork->dsize_bits;
+    pWork->out_bytes = 2;
+
+    // Reset output buffer to zero
+    lmemset(&pWork->out_buff[2], 0, sizeof(pWork->out_buff) - 2);
+    pWork->out_bits = 0;
+
+    do
+    {
+        int total_loaded = 0;
+
+        for(bytes_required = 0x1000; bytes_required != 0; )
+        {
+            int loaded = pWork->read_buf((char *)pWork->work_buff + UNCMP_OFFSET + total_loaded,
+                       &bytes_required, pWork->param);
+
+            if(loaded == 0)
+            {
+                if(total_loaded == 0 && esp20 == 0)
+                    goto __Exit;
+                esp18 = 1;
+                break;
+            }
+            else
+            {
+                total_loaded += loaded;
+                bytes_required -= loaded;
+            }
+        }
+
+        uncmp_end = pWork->work_buff + pWork->dsize_bytes + total_loaded;
+        if(esp18 != 0)
+            uncmp_end += DICT_OFFSET;
+
+        //
+        // Warning: Passing "uncmp_end + 1" to the SortBuffer function may cause
+        // the output to be unpredictable in Storm.dll's compression. Because Storm.dll
+        // does not pass the zeroed buffer to the "implode" function, the byte after
+        // uncmp_end contains random data. This causes difference within dictionary
+        // created in SortBuffer function and may also cause different compressed output.
+        // We always zero the data before compression, so this thing never occurs.
+        // Funny is that it is actually not a bug, because if we decompress the data back,
+        // we'll get the identical data with the original input.
+        //
+        switch(esp20)
+        {
+            case 0: 
+                SortBuffer(pWork, uncmp_begin, uncmp_end + 1);
+                esp20++;
+                if(pWork->dsize_bytes != 0x1000)
+                    esp20++;
+                break;
+
+            case 1:
+                SortBuffer(pWork, uncmp_begin - pWork->dsize_bytes + DICT_OFFSET, uncmp_end + 1);
+                esp20++;
+                break;
+
+            default:
+                SortBuffer(pWork, uncmp_begin - pWork->dsize_bytes, uncmp_end + 1);
+                break;
+        }
+
+        while(uncmp_end > uncmp_begin)
+        {
+            nreps1 = FindRep(pWork, uncmp_begin);
+            while(nreps1 != 0)
+            {
+                if(nreps1 == 2 && pWork->offs0000 >= 0x100)
+                    break;
+
+                if(esp18 != 0 && uncmp_begin + nreps1 > uncmp_end)
+                    goto _004022DB;
+
+                if(nreps1 >= 8 || uncmp_begin + 1 >= uncmp_end)
+                    goto _004022FF;
+
+                save_offs0000 = pWork->offs0000;    // ebp
+                nreps  = nreps1;
+                nreps1 = FindRep(pWork, uncmp_begin + 1);
+
+                if(nreps >= nreps1)
+                    goto _004022F9;
+
+                if(nreps + 1 >= nreps1 && save_offs0000 <= 0x80)
+                    goto _004022F9;
+
+                OutputBits(pWork, pWork->nChBits[*uncmp_begin], pWork->nChCodes[*uncmp_begin]);
+                uncmp_begin++;
+            }
+
+_0040222F:
+            OutputBits(pWork, pWork->nChBits[*uncmp_begin], pWork->nChCodes[*uncmp_begin]);
+            uncmp_begin++;
+_00402252:;
+        }
+
+        if(esp18 == 0)
+        {
+            uncmp_begin -= 0x1000;
+            lmemcpy(pWork->work_buff, pWork->work_buff + 0x1000, pWork->dsize_bytes + DICT_OFFSET);
+        }
+    }
+    while(esp18 == 0);
+
+__Exit:
+    OutputBits(pWork, pWork->nChBits[0x305], pWork->nChCodes[0x305]);
+    if(pWork->out_bits != 0)
+        pWork->out_bytes++;
+    pWork->write_buf(pWork->out_buff, &pWork->out_bytes, pWork->param);
+    return;
+
+_004022DB:
+    nreps1 = (unsigned long)(uncmp_end - uncmp_begin);
+    if(nreps1 < 2)
+        goto _0040222F;
+
+    if(nreps1 != 2 || pWork->offs0000 < 0x100)
+        goto _004022FF;
+    goto _0040222F;
+
+_004022F9:
+    nreps1 = nreps;
+    pWork->offs0000 = save_offs0000;
+
+_004022FF:
+    OutputBits(pWork, pWork->nChBits[nreps1 + 0xFE], pWork->nChCodes[nreps1 + 0xFE]);
+
+    if(nreps1 == 2)
+    {
+        OutputBits(pWork, pWork->dist_bits[pWork->offs0000 >> 2],
+                          pWork->dist_codes[pWork->offs0000 >> 2]);
+        OutputBits(pWork, 2, pWork->offs0000 & 3);
+    }
+    else
+    {
+        OutputBits(pWork, pWork->dist_bits[pWork->offs0000 >> pWork->dsize_bits],
+                          pWork->dist_codes[pWork->offs0000 >> pWork->dsize_bits]);
+        OutputBits(pWork, pWork->dsize_bits, pWork->dsize_mask & pWork->offs0000);
+    }
+    uncmp_begin += nreps1;
+    goto _00402252;
+}
+
+//-----------------------------------------------------------------------------
+// Main imploding function
+
+unsigned int PKEXPORT implode(
+    unsigned int (*read_buf)(char *buf, unsigned int *size, void *param),
+    void         (*write_buf)(char *buf, unsigned int *size, void *param),
+    char         *work_buf,
+    void         *param,
+    unsigned int *type,
+    unsigned int *dsize)
+{
+    TCmpStruct * pWork = (TCmpStruct *)work_buf;
+    unsigned int nChCode;
+    unsigned int nCount;
+    unsigned int i;
+
+    // Initialize the work buffer. This is not in the Pklib,
+    // but it seems to be a bug. Storm always pre-fills the data with zeros,
+    // and always compresses one block only. So the bug will not appear.
+    // But when a larger data block (size > 0x1000) is compressed, 
+    // it may fail.
+    memset(pWork, 0, sizeof(TCmpStruct));
+
+    // Fill the work buffer information
+    pWork->read_buf    = read_buf;
+    pWork->write_buf   = write_buf;
+    pWork->dsize_bytes = *dsize;
+    pWork->ctype       = *type;
+    pWork->param       = param;
+    pWork->dsize_bits  = 4;
+    pWork->dsize_mask  = 0x0F;
+
+    // Test dictionary size
+    switch(*dsize)
+    {
+        case 0x1000 :
+            pWork->dsize_bits++;
+            pWork->dsize_mask |= 0x20;
+            // No break here !!!
+
+        case 0x0800 :
+            pWork->dsize_bits++;
+            pWork->dsize_mask |= 0x10;
+            // No break here !!!
+
+        case 0x0400 :
+            break;
+
+        default:
+            return CMP_INVALID_DICTSIZE;
+    }
+
+    // Test the compression type
+    switch(*type)
+    {
+        case CMP_BINARY: // We will compress data with binary compression type
+            for(nChCode = 0, nCount = 0; nCount < 0x100; nCount++)
+            {
+                pWork->nChBits[nCount]  = 9;
+                pWork->nChCodes[nCount] = (unsigned short)nChCode;
+                nChCode = (nChCode & 0x0000FFFF) + 2;
+            }
+            break;
+
+
+        case CMP_ASCII: // We will compress data with ASCII compression type
+            for(nCount = 0; nCount < 0x100; nCount++)
+            {
+                pWork->nChBits[nCount]  = (unsigned char )(ChBitsAsc[nCount] + 1);
+                pWork->nChCodes[nCount] = (unsigned short)(ChCodeAsc[nCount] * 2);
+            }
+            break;
+
+        default:
+            return CMP_INVALID_MODE;
+    }
+
+    for(i = 0; i < 0x10; i++)
+    {
+        int nCount2 = 0;    // EBX 
+
+        if((1 << ExLenBits[i]) == 0)
+            continue;
+
+        do
+        {
+            pWork->nChBits[nCount]  = (unsigned char)(ExLenBits[i] + LenBits[i] + 1);
+            pWork->nChCodes[nCount] = (unsigned short)((nCount2 << (LenBits[i] + 1)) | ((LenCode[i] & 0xFFFF00FF) * 2) | 1);
+
+            nCount2++;
+            nCount++;
+        }
+        while((1 << ExLenBits[i]) > nCount2);
+    }
+
+    // Copy the distance codes and distance bits and perform the compression
+    lmemcpy(&pWork->dist_codes, DistCode, sizeof(DistCode));
+    lmemcpy(&pWork->dist_bits, DistBits, sizeof(DistBits));
+    WriteCmpData(pWork);
+    return CMP_NO_ERROR;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/pklib/pklib.h b/contrib/vmap_extractor_v2/stormlib/pklib/pklib.h
new file mode 100644
index 00000000000..881262e3839
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/pklib/pklib.h
@@ -0,0 +1,137 @@
+/*****************************************************************************/
+/* pklib.h                                Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Header file for PKWARE Data Compression Library                           */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 31.03.03  1.00  Lad  The first version of pkware.h                        */
+/*****************************************************************************/
+
+#ifndef __PKLIB_H__
+#define __PKLIB_H__
+
+#include "../StormPort.h"
+
+//-----------------------------------------------------------------------------
+// Defines
+
+#define CMP_BINARY             0        // Binary compression
+#define CMP_ASCII              1        // Ascii compression
+
+#define CMP_NO_ERROR           0
+#define CMP_INVALID_DICTSIZE   1
+#define CMP_INVALID_MODE       2
+#define CMP_BAD_DATA           3
+#define CMP_ABORT              4
+
+//-----------------------------------------------------------------------------
+// Define calling convention
+
+#ifndef PKEXPORT
+#define PKEXPORT  //__cdecl               // Use for normal __cdecl calling 
+#endif
+//#define PKEXPORT  __stdcall
+//#define PKEXPORT  __fastcall
+
+//-----------------------------------------------------------------------------
+// Internal structures
+
+// Compression structure
+typedef struct
+{
+    unsigned int   offs0000;            // 0000 : 
+    unsigned int   out_bytes;           // 0004 : # bytes available in out_buff            
+    unsigned int   out_bits;            // 0008 : # of bits available in the last out byte
+    unsigned int   dsize_bits;          // 000C : Dict size : 4=0x400, 5=0x800, 6=0x1000
+    unsigned int   dsize_mask;          // 0010 : Dict size : 0x0F=0x400, 0x1F=0x800, 0x3F=0x1000
+    unsigned int   ctype;               // 0014 : Compression type (Ascii or binary)
+    unsigned int   dsize_bytes;         // 0018 : Dictionary size in bytes
+    unsigned char  dist_bits[0x40];     // 001C : Distance bits
+    unsigned char  dist_codes[0x40];    // 005C : Distance codes
+    unsigned char  nChBits[0x306];      // 009C : 
+    unsigned short nChCodes[0x306];     // 03A2 : 
+    unsigned short offs09AE;            // 09AE : 
+
+    void         * param;               // 09B0 : User parameter
+    unsigned int (*read_buf)(char *buf, unsigned int *size, void *param);  // 9B4
+    void         (*write_buf)(char *buf, unsigned int *size, void *param); // 9B8
+
+    unsigned short offs09BC[0x204];     // 09BC :
+    unsigned long  offs0DC4;            // 0DC4 : 
+    unsigned short offs0DC8[0x900];     // 0DC8 :
+    unsigned short offs1FC8;            // 1FC8 : 
+    char           out_buff[0x802];     // 1FCA : Output (compressed) data
+    unsigned char  work_buff[0x2204];   // 27CC : Work buffer
+                                        //  + DICT_OFFSET  => Dictionary
+                                        //  + UNCMP_OFFSET => Uncompressed data
+    unsigned short offs49D0[0x2000];    // 49D0 : 
+} TCmpStruct;
+
+#define CMP_BUFFER_SIZE  sizeof(TCmpStruct) // Size of compression buffer
+
+
+// Decompression structure
+typedef struct
+{
+    unsigned long offs0000;             // 0000
+    unsigned long ctype;                // 0004 - Compression type (CMP_BINARY or CMP_ASCII)
+    unsigned long outputPos;            // 0008 - Position in output buffer
+    unsigned long dsize_bits;           // 000C - Dict size (4, 5, 6 for 0x400, 0x800, 0x1000)
+    unsigned long dsize_mask;           // 0010 - Dict size bitmask (0x0F, 0x1F, 0x3F for 0x400, 0x800, 0x1000)
+    unsigned long bit_buff;             // 0014 - 16-bit buffer for processing input data
+    unsigned long extra_bits;           // 0018 - Number of extra (above 8) bits in bit buffer
+    unsigned int  in_pos;               // 001C - Position in in_buff
+    unsigned long in_bytes;             // 0020 - Number of bytes in input buffer
+    void        * param;                // 0024 - Custom parameter
+    unsigned int (*read_buf)(char *buf, unsigned  int *size, void *param); // 0028
+    void         (*write_buf)(char *buf, unsigned  int *size, void *param);// 002C
+    unsigned char out_buff[0x2000];     // 0030 - Output circle buffer. Starting position is 0x1000
+    unsigned char offs2030[0x204];      // 2030 - ???
+    unsigned char in_buff[0x800];       // 2234 - Buffer for data to be decompressed
+    unsigned char position1[0x100];     // 2A34 - Positions in buffers
+    unsigned char position2[0x100];     // 2B34 - Positions in buffers
+    unsigned char offs2C34[0x100];      // 2C34 - Buffer for 
+    unsigned char offs2D34[0x100];      // 2D34 - Buffer for 
+    unsigned char offs2E34[0x80];       // 2EB4 - Buffer for 
+    unsigned char offs2EB4[0x100];      // 2EB4 - Buffer for 
+    unsigned char ChBitsAsc[0x100];     // 2FB4 - Buffer for 
+    unsigned char DistBits[0x40];       // 30B4 - Numbers of bytes to skip copied block length
+    unsigned char LenBits[0x10];        // 30F4 - Numbers of bits for skip copied block length
+    unsigned char ExLenBits[0x10];      // 3104 - Number of valid bits for copied block
+    unsigned short LenBase[0x10];       // 3114 - Buffer for 
+} TDcmpStruct;
+
+#define EXP_BUFFER_SIZE    sizeof(TDcmpStruct)  // Size of decompress buffer
+
+//-----------------------------------------------------------------------------
+// Public functions
+
+#ifdef __cplusplus
+   extern "C" {
+#endif
+
+unsigned int PKEXPORT implode(
+   unsigned int (*read_buf)(char *buf, unsigned int *size, void *param),
+   void         (*write_buf)(char *buf, unsigned int *size, void *param),
+   char         *work_buf,
+   void         *param,
+   unsigned int *type,
+   unsigned int *dsize);
+
+
+unsigned int PKEXPORT explode(
+   unsigned int (*read_buf)(char *buf, unsigned  int *size, void *param),
+   void         (*write_buf)(char *buf, unsigned  int *size, void *param),
+   char         *work_buf,
+   void         *param);
+
+// The original name "crc32" was changed to "crc32pk" due
+// to compatibility with zlib
+unsigned long PKEXPORT crc32pk(char *buffer, unsigned int *size, unsigned long *old_crc);
+
+#ifdef __cplusplus
+   }                         // End of 'extern "C"' declaration
+#endif
+
+#endif // __PKLIB_H__
diff --git a/contrib/vmap_extractor_v2/stormlib/wave/wave.cpp b/contrib/vmap_extractor_v2/stormlib/wave/wave.cpp
new file mode 100644
index 00000000000..936525f4eae
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/wave/wave.cpp
@@ -0,0 +1,356 @@
+/*****************************************************************************/
+/* wave.cpp                               Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* This module contains decompression methods used by Storm.dll to decompress*/
+/* WAVe files. Thanks to Tom Amigo for releasing his sources.                */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 11.03.03  1.00  Lad  Splitted from Pkware.cpp                             */
+/* 20.05.03  2.00  Lad  Added compression                                    */
+/* 19.11.03  2.01  Dan  Big endian handling                                  */
+/*****************************************************************************/
+
+#include "wave.h"
+
+//------------------------------------------------------------------------------
+// Structures
+
+union TByteAndWordPtr
+{
+    short * pw;
+    unsigned char * pb;
+};
+
+union TWordAndByteArray
+{
+    short w;
+    unsigned char b[2];
+};
+
+//-----------------------------------------------------------------------------
+// Tables necessary dor decompression
+
+static long Table1503F120[] =
+{
+    0xFFFFFFFF, 0x00000000, 0xFFFFFFFF, 0x00000004, 0xFFFFFFFF, 0x00000002, 0xFFFFFFFF, 0x00000006,
+    0xFFFFFFFF, 0x00000001, 0xFFFFFFFF, 0x00000005, 0xFFFFFFFF, 0x00000003, 0xFFFFFFFF, 0x00000007,
+    0xFFFFFFFF, 0x00000001, 0xFFFFFFFF, 0x00000005, 0xFFFFFFFF, 0x00000003, 0xFFFFFFFF, 0x00000007,  
+    0xFFFFFFFF, 0x00000002, 0xFFFFFFFF, 0x00000004, 0xFFFFFFFF, 0x00000006, 0xFFFFFFFF, 0x00000008  
+};
+
+static long Table1503F1A0[] =
+{
+    0x00000007, 0x00000008, 0x00000009, 0x0000000A, 0x0000000B, 0x0000000C, 0x0000000D, 0x0000000E,
+    0x00000010, 0x00000011, 0x00000013, 0x00000015, 0x00000017, 0x00000019, 0x0000001C, 0x0000001F,
+    0x00000022, 0x00000025, 0x00000029, 0x0000002D, 0x00000032, 0x00000037, 0x0000003C, 0x00000042,
+    0x00000049, 0x00000050, 0x00000058, 0x00000061, 0x0000006B, 0x00000076, 0x00000082, 0x0000008F,
+    0x0000009D, 0x000000AD, 0x000000BE, 0x000000D1, 0x000000E6, 0x000000FD, 0x00000117, 0x00000133,
+    0x00000151, 0x00000173, 0x00000198, 0x000001C1, 0x000001EE, 0x00000220, 0x00000256, 0x00000292,
+    0x000002D4, 0x0000031C, 0x0000036C, 0x000003C3, 0x00000424, 0x0000048E, 0x00000502, 0x00000583,
+    0x00000610, 0x000006AB, 0x00000756, 0x00000812, 0x000008E0, 0x000009C3, 0x00000ABD, 0x00000BD0,
+    0x00000CFF, 0x00000E4C, 0x00000FBA, 0x0000114C, 0x00001307, 0x000014EE, 0x00001706, 0x00001954,
+    0x00001BDC, 0x00001EA5, 0x000021B6, 0x00002515, 0x000028CA, 0x00002CDF, 0x0000315B, 0x0000364B,
+    0x00003BB9, 0x000041B2, 0x00004844, 0x00004F7E, 0x00005771, 0x0000602F, 0x000069CE, 0x00007462,
+    0x00007FFF
+};
+
+//----------------------------------------------------------------------------
+// CompressWave
+
+// 1500EF70
+int CompressWave(unsigned char * pbOutBuffer, int dwOutLength, short * pwInBuffer, int dwInLength, int nChannels, int nCmpLevel)
+//               ECX                          EDX
+{
+    TWordAndByteArray Wcmp;
+    TByteAndWordPtr out;                    // Pointer to the output buffer
+    long SInt32Array1[2];
+    long SInt32Array2[2];
+    long SInt32Array3[2];
+    long nBytesRemains = dwOutLength;       // Number of bytes remaining
+    long nWordsRemains;                     // Number of words remaining
+//  unsigned char * pbSaveOutBuffer;        // Copy of output buffer (actually not used)
+    unsigned long dwBitBuff;
+    unsigned long dwStopBit;
+    unsigned long dwBit;
+    unsigned long ebx;
+    unsigned long esi;
+    long nTableValue;
+    long nOneWord;
+    long var_1C;
+    long var_2C;
+    int nLength;
+    int nIndex;
+    int nValue;
+
+    // If less than 2 bytes remain, don't decompress anything
+//  pbSaveOutBuffer = pbOutBuffer;
+    out.pb = pbOutBuffer;
+    if(nBytesRemains < 2)
+        return 2;
+
+    Wcmp.b[1] = (unsigned char)(nCmpLevel - 1);
+    Wcmp.b[0] = (unsigned char)0;
+
+    *out.pw++ = BSWAP_INT16_SIGNED(Wcmp.w);
+    if((out.pb - pbOutBuffer + (nChannels * 2)) > nBytesRemains)
+        return (int)(out.pb - pbOutBuffer + (nChannels * 2));
+
+    SInt32Array1[0] = SInt32Array1[1] = 0x2C;
+
+    for(int i = 0; i < nChannels; i++)
+    {
+        nOneWord = BSWAP_INT16_SIGNED(*pwInBuffer++);
+        *out.pw++ = BSWAP_INT16_SIGNED((short)nOneWord);
+        SInt32Array2[i] = nOneWord;
+    }
+
+    // Weird. But it's there
+    nLength = dwInLength;
+    if(nLength < 0)                     // mov eax, dwInLength; cdq; sub eax, edx;
+        nLength++;
+
+    nLength = (nLength / 2) - (int)(out.pb - pbOutBuffer);
+    nLength = (nLength < 0) ? 0 : nLength;
+    
+    nIndex  = nChannels - 1;            // edi
+    nWordsRemains = dwInLength / 2;     // eax
+    
+    // ebx - nChannels
+    // ecx - pwOutPos
+    for(int chnl = nChannels; chnl < nWordsRemains; chnl++)
+    {
+        // 1500F030
+        if((out.pb - pbOutBuffer + 2) > nBytesRemains)
+            return (int)(out.pb - pbOutBuffer + 2);
+
+        // Switch index
+        if(nChannels == 2)
+            nIndex = (nIndex == 0) ? 1 : 0;
+
+        // Load one word from the input stream
+        nOneWord = BSWAP_INT16_SIGNED(*pwInBuffer++);   // ecx - nOneWord
+        SInt32Array3[nIndex] = nOneWord;
+
+        // esi - SInt32Array2[nIndex]
+        // eax - nValue
+        nValue = nOneWord - SInt32Array2[nIndex];
+        nValue = (nValue < 0) ? ((nValue ^ 0xFFFFFFFF) + 1) : nValue;
+
+        ebx = (nOneWord >= SInt32Array2[nIndex]) ? 0 : 0x40;
+
+        // esi - SInt32Array2[nIndex]
+        // edx - Table1503F1A0[SInt32Array2[nIndex]]
+        // edi - (Table1503F1A0[SInt32Array1[nIndex]] >> nCmpLevel)
+        nTableValue = Table1503F1A0[SInt32Array1[nIndex]];
+        dwStopBit = (unsigned long)nCmpLevel;
+
+        // edi - nIndex;
+        if(nValue < (nTableValue >> nCmpLevel))
+        {
+            if(SInt32Array1[nIndex] != 0)
+                SInt32Array1[nIndex]--;
+            *out.pb++ = 0x80;
+        }
+        else
+        {
+            while(nValue > nTableValue * 2)
+            {
+                if(SInt32Array1[nIndex] >= 0x58 || nLength == 0)
+                    break;
+
+                SInt32Array1[nIndex] += 8;
+                if(SInt32Array1[nIndex] > 0x58)
+                    SInt32Array1[nIndex] = 0x58;
+
+                nTableValue = Table1503F1A0[SInt32Array1[nIndex]];
+                *out.pb++ = 0x81;
+                nLength--;
+            }
+
+            var_2C = nTableValue >> Wcmp.b[1];
+            dwBitBuff = 0;
+
+            esi = (1 << (dwStopBit - 2));
+            dwStopBit = (esi <= 0x20) ? esi : 0x20;
+
+            for(var_1C = 0, dwBit = 1; ; dwBit <<= 1)
+            {
+//              esi = var_1C + nTableValue;
+                if((var_1C + nTableValue) <= nValue)
+                {
+                    var_1C += nTableValue;
+                    dwBitBuff |= dwBit;
+                }
+                if(dwBit == dwStopBit)
+                    break;
+               
+                nTableValue >>= 1;
+            }
+
+            nValue = SInt32Array2[nIndex];
+            if(ebx != 0)
+            {
+                nValue -= (var_1C + var_2C);
+                if(nValue < -32768)
+                    nValue = -32768;
+            }
+            else
+            {
+                nValue += (var_1C + var_2C);
+                if(nValue > 32767)
+                    nValue = 32767;
+            }
+
+            SInt32Array2[nIndex]  = nValue;
+            *out.pb++ = (unsigned char)(dwBitBuff | ebx);
+            nTableValue = Table1503F120[dwBitBuff & 0x1F];
+            SInt32Array1[nIndex]  = SInt32Array1[nIndex] + nTableValue; 
+            if(SInt32Array1[nIndex] < 0)
+                SInt32Array1[nIndex] = 0;
+            else if(SInt32Array1[nIndex] > 0x58)
+                SInt32Array1[nIndex] = 0x58;
+        }
+    }
+
+    return (int)(out.pb - pbOutBuffer);
+}
+
+//----------------------------------------------------------------------------
+// DecompressWave
+
+// 1500F230
+int DecompressWave(unsigned char * pbOutBuffer, int dwOutLength, unsigned char * pbInBuffer, int dwInLength, int nChannels)
+{
+    TByteAndWordPtr out;                // Output buffer
+    TByteAndWordPtr in;
+    unsigned char * pbInBufferEnd = (pbInBuffer + dwInLength);
+    long SInt32Array1[2];
+    long SInt32Array2[2];
+    long nOneWord;
+    int dwOutLengthCopy = dwOutLength;
+    int nIndex;
+
+    SInt32Array1[0] = SInt32Array1[1] = 0x2C;
+    out.pb = pbOutBuffer;
+    in.pb = pbInBuffer;
+    in.pw++;
+
+    // Fill the Uint32Array2 array by channel values.
+    for(int i = 0; i < nChannels; i++)
+    {
+        nOneWord = BSWAP_INT16_SIGNED(*in.pw++);
+        SInt32Array2[i] = nOneWord;
+        if(dwOutLengthCopy < 2)
+            return (int)(out.pb - pbOutBuffer);
+
+        *out.pw++ = BSWAP_INT16_SIGNED((short)nOneWord);
+        dwOutLengthCopy -= sizeof(short);
+    }
+
+    // Get the initial index
+    nIndex = nChannels - 1;
+
+    // Perform the decompression
+    while(in.pb < pbInBufferEnd)
+    {
+        unsigned char nOneByte = *in.pb++;
+
+        // Switch index
+        if(nChannels == 2)
+            nIndex = (nIndex == 0) ? 1 : 0;
+
+        // 1500F2A2: Get one byte from input buffer
+        if(nOneByte & 0x80)
+        {
+            switch(nOneByte & 0x7F)
+            {
+                case 0:     // 1500F315
+                    if(SInt32Array1[nIndex] != 0)
+                        SInt32Array1[nIndex]--;
+
+                    if(dwOutLengthCopy < 2)
+                        return (int)(out.pb - pbOutBuffer);
+
+                    *out.pw++ = BSWAP_INT16_SIGNED((unsigned short)SInt32Array2[nIndex]);
+                    dwOutLength -= sizeof(unsigned short);
+                    break;
+
+                case 1:     // 1500F2E8
+                    SInt32Array1[nIndex] += 8;
+                    if(SInt32Array1[nIndex] > 0x58)
+                        SInt32Array1[nIndex] = 0x58;
+                    
+                    if(nChannels == 2)
+                        nIndex = (nIndex == 0) ? 1 : 0;
+                    break;
+
+                case 2:     // 1500F41E
+                    break;
+
+                default:    // 1500F2C4
+                    SInt32Array1[nIndex] -= 8;
+                    if(SInt32Array1[nIndex] < 0)
+                        SInt32Array1[nIndex] = 0;
+
+                    if(nChannels == 2)
+                        nIndex = (nIndex == 0) ? 1 : 0;
+                    break;
+            }
+        }
+        else
+        {
+            // 1500F349
+            long temp1 = Table1503F1A0[SInt32Array1[nIndex]];  // EDI
+            long temp2 = temp1 >> pbInBuffer[1];               // ESI
+            long temp3 = SInt32Array2[nIndex];                 // ECX
+
+            if(nOneByte & 0x01)          // EBX = nOneByte
+                temp2 += (temp1 >> 0);
+
+            if(nOneByte & 0x02)
+                temp2 += (temp1 >> 1);
+
+            if(nOneByte & 0x04)
+                temp2 += (temp1 >> 2);
+
+            if(nOneByte & 0x08)
+                temp2 += (temp1 >> 3);
+
+            if(nOneByte & 0x10)
+                temp2 += (temp1 >> 4);
+
+            if(nOneByte & 0x20)
+                temp2 += (temp1 >> 5);
+
+            if(nOneByte & 0x40)
+            {
+                temp3 = temp3 - temp2;
+                if(temp3 <= -32768)
+                    temp3 = -32768;
+            }
+            else
+            {
+                temp3 = temp3 + temp2;
+                if(temp3 >= 32767)
+                    temp3 = 32767;
+            }
+
+            SInt32Array2[nIndex] = temp3;
+            if(dwOutLength < 2)
+                break;
+
+            // Store the output 16-bit value
+            *out.pw++ = BSWAP_INT16_SIGNED((short)SInt32Array2[nIndex]);
+            dwOutLength -= 2;
+
+            SInt32Array1[nIndex] += Table1503F120[nOneByte & 0x1F];
+
+            if(SInt32Array1[nIndex] < 0)
+                SInt32Array1[nIndex] = 0;
+            else if(SInt32Array1[nIndex] > 0x58)
+                SInt32Array1[nIndex] = 0x58;
+        }
+    }
+    return (int)(out.pb - pbOutBuffer);
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/wave/wave.h b/contrib/vmap_extractor_v2/stormlib/wave/wave.h
new file mode 100644
index 00000000000..81b5add9cfc
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/wave/wave.h
@@ -0,0 +1,22 @@
+/*****************************************************************************/
+/* Wave.h                                 Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* Header file for WAVe unplode functions                                    */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 31.03.03  1.00  Lad  The first version of Wave.h                          */
+/*****************************************************************************/
+
+#ifndef __WAVE_H__
+#define __WAVE_H__
+
+//-----------------------------------------------------------------------------
+// Functions
+
+#include "../StormPort.h"
+
+int  CompressWave  (unsigned char * pbOutBuffer, int dwOutLength, short * pwInBuffer, int dwInLength, int nCmpType, int nChannels);
+int  DecompressWave(unsigned char * pbOutBuffer, int dwOutLength, unsigned char * pbInBuffer, int dwInLength, int nChannels);
+
+#endif // __WAVE_H__
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/ChangeLog b/contrib/vmap_extractor_v2/stormlib/zlib/ChangeLog
new file mode 100644
index 00000000000..bf2e3f925bc
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/ChangeLog
@@ -0,0 +1,481 @@
+
+		ChangeLog file for zlib
+
+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 occuring 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/contrib/vmap_extractor_v2/stormlib/zlib/FAQ b/contrib/vmap_extractor_v2/stormlib/zlib/FAQ
new file mode 100644
index 00000000000..47a7d60c6de
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/FAQ
@@ -0,0 +1,100 @@
+
+		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. If you
+    want a precompiled DLL, see http://www.winimage.com/zLibDll/ . Questions
+    about the zlib DLL should be sent to Gilles Vollant (info@winimage.com).
+
+ 3. Where can I get a Visual Basic interface to zlib?
+
+    See
+        * http://www.winimage.com/zLibDll/cmp-z-it.zip
+        * http://www.dogma.net/markn/articles/zlibtool/zlibtool.htm
+        * contrib/visual-basic.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.
+
+ 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 Jean-loup Gailly (jloup@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 directories contrib/delphi and contrib/delphi2 in the zlib
+    distribution.
+
+11. Can zlib handle .zip archives?
+
+    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. Why does "make test" fail on Mac OS X?
+
+    Mac OS X already includes zlib as a shared library, and so -lz links the
+    shared library instead of the one that the "make" compiled. For zlib
+    1.1.3, the two are incompatible due to different compile-time
+    options. Simply change the -lz in the Makefile to libz.a, and it will use
+    the compiled library instead of the shared one and the "make test" will
+    succeed.
+
+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.
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/INDEX b/contrib/vmap_extractor_v2/stormlib/zlib/INDEX
new file mode 100644
index 00000000000..8a245766402
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/INDEX
@@ -0,0 +1,86 @@
+ChangeLog		history of changes
+INDEX			this file
+FAQ			Frequently Asked Questions about zlib
+Make_vms.com		script for Vax/VMS
+Makefile		makefile for Unix (generated by configure)
+Makefile.in		makefile for Unix (template for configure)
+Makefile.riscos 	makefile for RISCOS
+README			guess what
+algorithm.txt		description of the (de)compression algorithm
+configure		configure script for Unix
+descrip.mms		makefile for Vax/VMS
+zlib.3			mini man page for zlib (volunteers to write full
+			man pages from zlib.h welcome. write to jloup@gzip.org)
+
+amiga/Makefile.sas	makefile for Amiga SAS/C
+amiga/Makefile.pup      makefile for Amiga powerUP SAS/C PPC
+
+msdos/Makefile.w32      makefile for Microsoft Visual C++ 32-bit
+msdos/Makefile.b32	makefile for Borland C++   32-bit
+msdos/Makefile.bor	makefile for Borland C/C++ 16-bit
+msdos/Makefile.dj2	makefile for DJGPP 2.x
+msdos/Makefile.emx	makefile for EMX 0.9c (32-bit DOS/OS2)
+msdos/Makefile.msc	makefile for Microsoft C 16-bit
+msdos/Makefile.tc	makefile for Turbo C
+msdos/Makefile.wat	makefile for Watcom C
+msdos/zlib.def        	definition file for Windows DLL
+msdos/zlib.rc         	definition file for Windows DLL
+
+nt/Makefile.nt		makefile for Windows NT
+nt/zlib.dnt		definition file for Windows NT DLL
+nt/Makefile.emx		makefile for EMX 0.9c/RSXNT 1.41 (Win32 Intel)
+nt/Makefile.gcc		makefile for Windows NT using GCC (mingw32)
+
+
+		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
+deflate.c
+deflate.h
+gzio.c
+infblock.c
+infblock.h
+infcodes.c
+infcodes.h
+inffast.c
+inffast.h
+inflate.c
+inftrees.c
+inftrees.h
+infutil.c
+infutil.h
+maketree.c
+trees.c
+uncompr.c
+zutil.c
+zutil.h
+
+		source files for sample programs:
+example.c
+minigzip.c
+
+		unsupported contribution by third parties
+
+contrib/asm386/ by Gilles Vollant <info@winimage.com>
+	386 asm code replacing longest_match().
+
+contrib/minizip/ by Gilles Vollant <info@winimage.com>
+	Mini zip and unzip based on zlib
+        See http://www.winimage.com/zLibDll/unzip.html
+
+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 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.
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/Makefile b/contrib/vmap_extractor_v2/stormlib/zlib/Makefile
new file mode 100644
index 00000000000..531562b2ef1
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/Makefile
@@ -0,0 +1,175 @@
+# Makefile for zlib
+# Copyright (C) 1995-2002 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 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=-L. -lz
+LDSHARED=$(CC)
+CPP=$(CC) -E
+
+VER=1.1.4
+LIBS=libz.a
+SHAREDLIB=libz.so
+
+AR=ar rc
+RANLIB=ranlib
+TAR=tar
+SHELL=/bin/sh
+
+prefix = /usr/local
+exec_prefix = ${prefix}
+libdir = ${exec_prefix}/lib
+includedir = ${prefix}/include
+
+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
+
+OBJA =
+# to use the asm code: make OBJA=match.o
+
+TEST_OBJS = example.o minigzip.o
+
+DISTFILES = README FAQ INDEX ChangeLog configure Make*[a-z0-9] *.[ch] *.mms \
+  algorithm.txt zlib.3 zlib.html \
+  msdos/Make*[a-z0-9] msdos/zlib.def msdos/zlib.rc \
+  nt/Make*[a-z0-9] nt/zlib.dnt amiga/Make*.??? os2/M*.os2 os2/zlib.def \
+  contrib/RE*.contrib contrib/*.txt contrib/asm386/*.asm contrib/asm386/*.c \
+  contrib/asm386/*.bat contrib/asm386/zlibvc.d?? contrib/asm[56]86/*.?86 \
+  contrib/asm[56]86/*.S contrib/iostream/*.cpp \
+  contrib/iostream/*.h  contrib/iostream2/*.h contrib/iostream2/*.cpp \
+  contrib/untgz/Makefile contrib/untgz/*.c contrib/untgz/*.w32 \
+  contrib/minizip/[CM]*[pe] contrib/minizip/*.[ch] contrib/minizip/*.[td]?? \
+  contrib/delphi*/*.???
+
+all: example minigzip
+
+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
+
+$(SHAREDLIB).$(VER): $(OBJS)
+	$(LDSHARED) -o $@ $(OBJS)
+	rm -f $(SHAREDLIB) $(SHAREDLIB).1
+	ln -s $@ $(SHAREDLIB)
+	ln -s $@ $(SHAREDLIB).1
+
+example: example.o $(LIBS)
+	$(CC) $(CFLAGS) -o $@ example.o $(LDFLAGS)
+
+minigzip: minigzip.o $(LIBS)
+	$(CC) $(CFLAGS) -o $@ minigzip.o $(LDFLAGS)
+
+install: $(LIBS)
+	-@if [ ! -d $(includedir)  ]; then mkdir $(includedir); fi
+	-@if [ ! -d $(libdir) ]; then mkdir $(libdir); 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 $(SHAREDLIB).$(VER); then \
+	  rm -f $(SHAREDLIB) $(SHAREDLIB).1; \
+	  ln -s $(SHAREDLIB).$(VER) $(SHAREDLIB); \
+	  ln -s $(SHAREDLIB).$(VER) $(SHAREDLIB).1; \
+	  (ldconfig || true)  >/dev/null 2>&1; \
+	fi
+# The ranlib in install is needed on NeXTSTEP which checks file times
+# ldconfig is for Linux
+
+uninstall:
+	cd $(includedir); \
+	v=$(VER); \
+	if test -f zlib.h; then \
+	  v=`sed -n '/VERSION "/s/.*"\(.*\)".*/\1/p' < zlib.h`; \
+          rm -f zlib.h zconf.h; \
+	fi; \
+	cd $(libdir); rm -f libz.a; \
+	if test -f $(SHAREDLIB).$$v; then \
+	  rm -f $(SHAREDLIB).$$v $(SHAREDLIB) $(SHAREDLIB).1; \
+	fi
+
+clean:
+	rm -f *.o *~ example minigzip libz.a libz.so* foo.gz so_locations \
+	   _match.s maketree
+
+distclean:	clean
+
+zip:
+	mv Makefile Makefile~; cp -p Makefile.in Makefile
+	rm -f test.c ztest*.c contrib/minizip/test.zip
+	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 contrib/minizip/test.zip
+	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/contrib/vmap_extractor_v2/stormlib/zlib/Makefile.in b/contrib/vmap_extractor_v2/stormlib/zlib/Makefile.in
new file mode 100644
index 00000000000..531562b2ef1
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/Makefile.in
@@ -0,0 +1,175 @@
+# Makefile for zlib
+# Copyright (C) 1995-2002 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 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=-L. -lz
+LDSHARED=$(CC)
+CPP=$(CC) -E
+
+VER=1.1.4
+LIBS=libz.a
+SHAREDLIB=libz.so
+
+AR=ar rc
+RANLIB=ranlib
+TAR=tar
+SHELL=/bin/sh
+
+prefix = /usr/local
+exec_prefix = ${prefix}
+libdir = ${exec_prefix}/lib
+includedir = ${prefix}/include
+
+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
+
+OBJA =
+# to use the asm code: make OBJA=match.o
+
+TEST_OBJS = example.o minigzip.o
+
+DISTFILES = README FAQ INDEX ChangeLog configure Make*[a-z0-9] *.[ch] *.mms \
+  algorithm.txt zlib.3 zlib.html \
+  msdos/Make*[a-z0-9] msdos/zlib.def msdos/zlib.rc \
+  nt/Make*[a-z0-9] nt/zlib.dnt amiga/Make*.??? os2/M*.os2 os2/zlib.def \
+  contrib/RE*.contrib contrib/*.txt contrib/asm386/*.asm contrib/asm386/*.c \
+  contrib/asm386/*.bat contrib/asm386/zlibvc.d?? contrib/asm[56]86/*.?86 \
+  contrib/asm[56]86/*.S contrib/iostream/*.cpp \
+  contrib/iostream/*.h  contrib/iostream2/*.h contrib/iostream2/*.cpp \
+  contrib/untgz/Makefile contrib/untgz/*.c contrib/untgz/*.w32 \
+  contrib/minizip/[CM]*[pe] contrib/minizip/*.[ch] contrib/minizip/*.[td]?? \
+  contrib/delphi*/*.???
+
+all: example minigzip
+
+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
+
+$(SHAREDLIB).$(VER): $(OBJS)
+	$(LDSHARED) -o $@ $(OBJS)
+	rm -f $(SHAREDLIB) $(SHAREDLIB).1
+	ln -s $@ $(SHAREDLIB)
+	ln -s $@ $(SHAREDLIB).1
+
+example: example.o $(LIBS)
+	$(CC) $(CFLAGS) -o $@ example.o $(LDFLAGS)
+
+minigzip: minigzip.o $(LIBS)
+	$(CC) $(CFLAGS) -o $@ minigzip.o $(LDFLAGS)
+
+install: $(LIBS)
+	-@if [ ! -d $(includedir)  ]; then mkdir $(includedir); fi
+	-@if [ ! -d $(libdir) ]; then mkdir $(libdir); 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 $(SHAREDLIB).$(VER); then \
+	  rm -f $(SHAREDLIB) $(SHAREDLIB).1; \
+	  ln -s $(SHAREDLIB).$(VER) $(SHAREDLIB); \
+	  ln -s $(SHAREDLIB).$(VER) $(SHAREDLIB).1; \
+	  (ldconfig || true)  >/dev/null 2>&1; \
+	fi
+# The ranlib in install is needed on NeXTSTEP which checks file times
+# ldconfig is for Linux
+
+uninstall:
+	cd $(includedir); \
+	v=$(VER); \
+	if test -f zlib.h; then \
+	  v=`sed -n '/VERSION "/s/.*"\(.*\)".*/\1/p' < zlib.h`; \
+          rm -f zlib.h zconf.h; \
+	fi; \
+	cd $(libdir); rm -f libz.a; \
+	if test -f $(SHAREDLIB).$$v; then \
+	  rm -f $(SHAREDLIB).$$v $(SHAREDLIB) $(SHAREDLIB).1; \
+	fi
+
+clean:
+	rm -f *.o *~ example minigzip libz.a libz.so* foo.gz so_locations \
+	   _match.s maketree
+
+distclean:	clean
+
+zip:
+	mv Makefile Makefile~; cp -p Makefile.in Makefile
+	rm -f test.c ztest*.c contrib/minizip/test.zip
+	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 contrib/minizip/test.zip
+	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/contrib/vmap_extractor_v2/stormlib/zlib/Makefile.riscos b/contrib/vmap_extractor_v2/stormlib/zlib/Makefile.riscos
new file mode 100644
index 00000000000..d97f4492370
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/README b/contrib/vmap_extractor_v2/stormlib/zlib/README
new file mode 100644
index 00000000000..29d67146a9b
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/README
@@ -0,0 +1,147 @@
+zlib 1.1.4 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 jloup@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 or descrip.mms.
+
+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.1.4 are documented in the file ChangeLog.
+The only changes made since 1.1.3 are bug corrections:
+
+- 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).
+
+The beta version 1.1.5beta includes many more changes. A new official
+version 1.1.5 will be released as soon as extensive testing has been
+completed on it.
+
+
+Unsupported third party contributions are provided in directory "contrib".
+
+A Java implementation of zlib is available in the Java Development Kit
+http://www.javasoft.com/products/JDK/1.1/docs/api/Package-java.util.zip.html
+See the zlib home page http://www.zlib.org for details.
+
+A Perl interface to zlib written by Paul Marquess <pmarquess@bfsec.bt.co.uk>
+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@magnet.com>
+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.westend.com/~kupries/doc/trf/man/man.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 at http://www.winimage.com/zLibDll/unzip.html
+and also in the contrib/minizip directory of zlib.
+
+
+Notes for some targets:
+
+- To build a Windows DLL version, include in a DLL project zlib.def, zlib.rc
+  and all .c files except example.c and minigzip.c; compile with -DZLIB_DLL
+  The zlib DLL support was initially done by Alessandro Iacopetti and is
+  now maintained by Gilles Vollant <info@winimage.com>. Check the zlib DLL
+  home page at http://www.winimage.com/zLibDll
+
+  From Visual Basic, you can call the DLL functions which do not take
+  a structure as argument: compress, uncompress and all gz* functions.
+  See contrib/visual-basic.txt for more information, or get
+  http://www.tcfb.com/dowseware/cmp-z-it.zip
+
+- 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 Turbo C the small model is supported only with reduced performance to
+  avoid any far allocation; it was tested with -DMAX_WBITS=11 -DMAX_MEM_LEVEL=3
+
+- For PalmOs, see http://www.cs.uit.no/~perm/PASTA/pilot/software.html
+  Per Harald Myrvang <perm@stud.cs.uit.no>
+
+
+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-2002 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.
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/adler32.c b/contrib/vmap_extractor_v2/stormlib/zlib/adler32.c
new file mode 100644
index 00000000000..fae88b65593
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/adler32.c
@@ -0,0 +1,48 @@
+/* adler32.c -- compute the Adler-32 checksum of a data stream
+ * Copyright (C) 1995-2002 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+/* @(#) $Id$ */
+
+#include "zlib.h"
+
+#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 DO1(buf,i)  {s1 += buf[i]; s2 += s1;}
+#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);
+
+/* ========================================================================= */
+uLong ZEXPORT adler32(adler, buf, len)
+    uLong adler;
+    const Bytef *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) {
+            DO16(buf);
+	    buf += 16;
+            k -= 16;
+        }
+        if (k != 0) do {
+            s1 += *buf++;
+	    s2 += s1;
+        } while (--k);
+        s1 %= BASE;
+        s2 %= BASE;
+    }
+    return (s2 << 16) | s1;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/algorithm.txt b/contrib/vmap_extractor_v2/stormlib/zlib/algorithm.txt
new file mode 100644
index 00000000000..cdc830b5deb
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/algorithm.txt
@@ -0,0 +1,213 @@
+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 real question is, given a Huffman tree, how to decode fast.  The most
+important realization 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 set it
+for the maximum speed.
+
+inflate() sends new trees relatively often, so it is possibly set for a
+smaller first level table than an application that has only one tree for
+all the data.  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.  It would be
+interesting to see if optimizing the first level table for other
+applications gave values within a bit or two of the flat code size.
+
+
+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 to 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
+ftp://ds.internic.net/rfc/rfc1951.txt
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/amiga/Makefile.pup b/contrib/vmap_extractor_v2/stormlib/zlib/amiga/Makefile.pup
new file mode 100644
index 00000000000..6cfad1dc04a
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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
+
+CC       = scppc
+CFLAGS   = NOSTKCHK NOSINT OPTIMIZE OPTGO OPTPEEP OPTINLOCAL OPTINL \
+           OPTLOOP OPTRDEP=8 OPTDEP=8 OPTCOMP=8
+LIBNAME  = libzip.a
+AR       = ppc-amigaos-ar
+AR_FLAGS = cr
+RANLIB   = ppc-amigaos-ranlib
+LDFLAGS  = -r -o
+LDLIBS   = LIB:scppc.a
+LN       = ppc-amigaos-ld
+RM       = delete quiet
+
+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
+
+all: example minigzip
+
+test: all
+        example
+        echo hello world | minigzip | minigzip -d
+
+$(LIBNAME): $(OBJS)
+            $(AR) $(AR_FLAGS) $@ $(OBJS)
+            $(RANLIB) $@
+
+example: example.o $(LIBNAME)
+        $(LN) $(LDFLAGS) example LIB:c_ppc.o example.o $(LIBNAME) $(LDLIBS) LIB:end.o
+
+minigzip: minigzip.o $(LIBNAME)
+        $(LN) $(LDFLAGS) minigzip LIB:c_ppc.o minigzip.o $(LIBNAME) $(LDLIBS) LIB:end.o
+
+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: zutil.h zlib.h zconf.h
+compress.o: zlib.h zconf.h
+crc32.o: zutil.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
+infblock.o: zutil.h zlib.h zconf.h infblock.h inftrees.h infcodes.h infutil.h
+infcodes.o: zutil.h zlib.h zconf.h inftrees.h infutil.h infcodes.h inffast.h
+inffast.o: zutil.h zlib.h zconf.h inftrees.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 inftrees.h infutil.h
+minigzip.o: zlib.h zconf.h
+trees.o: deflate.h zutil.h zlib.h zconf.h
+uncompr.o: zlib.h zconf.h
+zutil.o: zutil.h zlib.h zconf.h
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/amiga/Makefile.sas b/contrib/vmap_extractor_v2/stormlib/zlib/amiga/Makefile.sas
new file mode 100644
index 00000000000..5323e821708
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/amiga/Makefile.sas
@@ -0,0 +1,64 @@
+# 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 
+
+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
+
+all: SCOPTIONS example minigzip
+
+test: all
+	`cd`/example
+	echo hello world | minigzip | minigzip -d 
+
+install: z.lib
+	copy zlib.h zconf.h INCLUDE: clone
+	copy z.lib LIB: clone
+
+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)
+
+clean:
+	-delete force quiet *.o example minigzip z.lib foo.gz *.lnk SCOPTIONS
+
+SCOPTIONS: Smakefile
+        copy to $@ <from <
+$(SCOPTIONS)
+<
+
+# DO NOT DELETE THIS LINE -- make depend depends on it.
+
+adler32.o: zutil.h zlib.h zconf.h
+compress.o: zlib.h zconf.h
+crc32.o: zutil.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
+infblock.o: zutil.h zlib.h zconf.h infblock.h inftrees.h infcodes.h infutil.h
+infcodes.o: zutil.h zlib.h zconf.h inftrees.h infutil.h infcodes.h inffast.h
+inffast.o: zutil.h zlib.h zconf.h inftrees.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 inftrees.h infutil.h
+minigzip.o: zlib.h zconf.h
+trees.o: deflate.h zutil.h zlib.h zconf.h
+uncompr.o: zlib.h zconf.h
+zutil.o: zutil.h zlib.h zconf.h
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/compress.c b/contrib/vmap_extractor_v2/stormlib/zlib/compress.c
new file mode 100644
index 00000000000..814bd9d6061
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/compress.c
@@ -0,0 +1,68 @@
+/* compress.c -- compress a memory buffer
+ * Copyright (C) 1995-2002 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+/* @(#) $Id$ */
+
+#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 (dest, destLen, source, sourceLen, level)
+    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 (dest, destLen, source, sourceLen)
+    Bytef *dest;
+    uLongf *destLen;
+    const Bytef *source;
+    uLong sourceLen;
+{
+    return compress2(dest, destLen, source, sourceLen, Z_DEFAULT_COMPRESSION);
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/configure b/contrib/vmap_extractor_v2/stormlib/zlib/configure
new file mode 100644
index 00000000000..e8942359bc1
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/configure
@@ -0,0 +1,212 @@
+#!/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
+SHAREDLIB=libz.so
+VER=`sed -n -e '/VERSION "/s/.*"\(.*\)".*/\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'}
+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;;
+    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) LDSHARED=${LDSHARED-"gcc -shared -Wl,-soname,libz.so.1"};;
+  *)             LDSHARED=${LDSHARED-"gcc -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"}
+	     shared_ext='.sl'
+	     SHAREDLIB='libz.sl';;
+  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,$SHAREDLIB -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"};;
+  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"};;
+  # send working options for other systems to support@gzip.org
+  *)         SFLAGS=${CFLAGS-"-O"}
+	     CFLAGS=${CFLAGS-"-O"}
+	     LDSHARED=${LDSHARED-"cc -shared"};;
+  esac
+fi
+
+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="$SHAREDLIB.$VER"
+    echo Building shared library $SHAREDLIB.$VER with $CC.
+  elif test -z "$old_cc" -a -z "$old_cflags"; then
+    echo No shared library suppport.
+    shared=0;
+  else
+    echo 'No shared library suppport; 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.
+fi
+
+cat > $test.c <<EOF
+#include <unistd.h>
+int main() { return 0; }
+EOF
+if test "`($CC -c $CFLAGS $test.c) 2>&1`" = ""; then
+  CFLAGS="$CFLAGS -DHAVE_UNISTD_H"
+  echo "Checking for unistd.h... Yes."
+else
+  echo "Checking for unistd.h... No."
+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$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%
+/^AR *=/s%=.*%=$AR%
+/^RANLIB *=/s%=.*%=$RANLIB%
+/^VER *=/s%=.*%=$VER%
+/^prefix *=/s%=.*%=$prefix%
+/^exec_prefix *=/s%=.*%=$exec_prefix%
+/^libdir *=/s%=.*%=$libdir%
+/^includedir *=/s%=.*%=$includedir%
+" > Makefile
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/README.contrib b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/README.contrib
new file mode 100644
index 00000000000..7ad191cf598
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/README.contrib
@@ -0,0 +1,34 @@
+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.
+
+
+asm386/     by Gilles Vollant <info@winimage.com>
+	386 asm code replacing longest_match(), for Visual C++ 4.2 and ML 6.11c
+
+asm586/ and asm686/    by Brian Raiter <breadbox@muppetlabs.com> 
+        asm code for Pentium and Pentium Pro
+        See http://www.muppetlabs.com/~breadbox/software/assembly.html
+
+delphi/      by Bob Dellaca <bobdl@xtra.co.nz>
+	Support for Delphi
+
+delphi2/     by Davide Moretti <dave@rimini.com>
+        Another support for C++Builder and Delphi
+
+minizip/    by Gilles Vollant <info@winimage.com>
+	Mini zip and unzip based on zlib
+        See http://www.winimage.com/zLibDll/unzip.html
+
+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
+
+untgz/      by "Pedro A. Aranda Guti\irrez" <paag@tid.es>
+	A very simple tar.gz file extractor using zlib
+
+visual-basic.txt by Carlos Rios <c_rios@sonda.cl>
+        How to use compress(), uncompress() and the gz* functions from VB.
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/gvmat32.asm b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/gvmat32.asm
new file mode 100644
index 00000000000..28d527f47f8
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/gvmat32.asm
@@ -0,0 +1,559 @@
+;
+; 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
+; It need wmask == 0x7fff
+;     (assembly code is faster with a fixed wmask)
+;
+; For Visual C++ 4.2 and ML 6.11c (version in directory \MASM611C of Win95 DDK)
+;   I compile with : "ml /coff /Zi /c gvmat32.asm"
+;
+
+;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 +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
+    dep_chain_length    equ     70h+4
+    dep_window          equ     2ch+4
+    dep_strstart        equ     60h+4
+    dep_prev_length     equ     6ch+4
+    dep_nice_match      equ     84h+4
+    dep_w_size          equ     20h+4
+    dep_prev            equ     34h+4
+    dep_w_mask          equ     28h+4
+    dep_good_match      equ     80h+4
+    dep_match_start     equ     64h+4
+    dep_lookahead       equ     68h+4
+
+
+_TEXT                   segment
+
+IFDEF NOUNDERLINE
+                        public  longest_match_7fff
+;                        public  match_init
+ELSE
+                        public  _longest_match_7fff
+;                        public  _match_init
+ENDIF
+
+    MAX_MATCH           equ     258
+    MIN_MATCH           equ     3
+    MIN_LOOKAHEAD       equ     (MAX_MATCH+MIN_MATCH+1)
+
+
+
+IFDEF NOUNDERLINE
+;match_init      proc near
+;                ret
+;match_init      endp
+ELSE
+;_match_init     proc near
+;                ret
+;_match_init     endp
+ENDIF
+
+
+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
+
+
+	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:
+	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
+
+_TEXT   ends
+end
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/gvmat32c.c b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/gvmat32c.c
new file mode 100644
index 00000000000..d853bb7ce8a
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/gvmat32c.c
@@ -0,0 +1,200 @@
+/* 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)
+ *
+ */
+
+#include "deflate.h"
+
+#undef FAR
+#include <windows.h>
+
+#ifdef ASMV
+#define NIL 0
+
+#define UNALIGNED_OK
+
+
+/* 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
+#endif
+
+
+
+void match_init()
+{
+}
+
+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(
+    deflate_state *s,
+    IPos cur_match)                             /* current match */
+{
+	static uInt iIsPPro=2;
+
+    if ((s->w_mask == 0x7fff) && (iIsPPro==0))
+        return longest_match_7fff(s,cur_match);
+
+	if (iIsPPro==2)
+		iIsPPro = (((cpudetect32()/0x100)&0xf)>=6) ? 1 : 0;
+
+	return longest_match_c(s,cur_match);
+}
+
+
+
+uInt longest_match_c(s, cur_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:
+         */
+#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 */
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/mkgvmt32.bat b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/mkgvmt32.bat
new file mode 100644
index 00000000000..6c5ffd7a024
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/mkgvmt32.bat
@@ -0,0 +1 @@
+c:\masm611\bin\ml /coff /Zi /c /Flgvmat32.lst gvmat32.asm
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/zlibvc.def b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/zlibvc.def
new file mode 100644
index 00000000000..7e9d60d55d9
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/zlibvc.def
@@ -0,0 +1,74 @@
+LIBRARY		"zlib"
+
+DESCRIPTION	'"""zlib data compression library"""'
+
+
+VERSION		1.11
+
+
+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
+
+	unzOpen                       @61
+	unzClose                      @62
+	unzGetGlobalInfo              @63
+	unzGetCurrentFileInfo         @64
+	unzGoToFirstFile              @65
+	unzGoToNextFile               @66
+	unzOpenCurrentFile            @67
+	unzReadCurrentFile            @68
+	unztell                       @70
+	unzeof                        @71
+	unzCloseCurrentFile           @72
+	unzGetGlobalComment           @73
+	unzStringFileNameCompare      @74
+	unzLocateFile                 @75
+	unzGetLocalExtrafield         @76
+
+	zipOpen                       @80
+	zipOpenNewFileInZip           @81
+	zipWriteInFileInZip           @82
+	zipCloseFileInZip             @83
+	zipClose                      @84
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/zlibvc.dsp b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/zlibvc.dsp
new file mode 100644
index 00000000000..a70d4d4a6b0
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/zlibvc.dsp
@@ -0,0 +1,651 @@
+# Microsoft Developer Studio Project File - Name="zlibvc" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 5.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
+# TARGTYPE "Win32 (ALPHA) Dynamic-Link Library" 0x0602
+
+CFG=zlibvc - Win32 Release
+!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 "zlibvc.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 "zlibvc.mak" CFG="zlibvc - Win32 Release"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "zlibvc - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "zlibvc - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "zlibvc - Win32 ReleaseAxp" (based on\
+ "Win32 (ALPHA) Dynamic-Link Library")
+!MESSAGE "zlibvc - Win32 ReleaseWithoutAsm" (based on\
+ "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "zlibvc - Win32 ReleaseWithoutCrtdll" (based on\
+ "Win32 (x86) Dynamic-Link Library")
+!MESSAGE 
+
+# Begin Project
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+
+!IF  "$(CFG)" == "zlibvc - 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 ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /YX /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /D "ASMV" /FAcs /FR /FD /c
+# SUBTRACT CPP /YX
+MTL=midl.exe
+# ADD BASE MTL /nologo /D "NDEBUG" /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+RSC=rc.exe
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /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 gvmat32.obj kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib crtdll.lib /nologo /subsystem:windows /dll /map /machine:I386 /nodefaultlib /out:".\Release\zlib.dll"
+# SUBTRACT LINK32 /pdb:none
+
+!ELSEIF  "$(CFG)" == "zlibvc - 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 Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MTd /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /YX /c
+# ADD CPP /nologo /MTd /W3 /Gm /GX /Zi /Od /D "_DEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /FD /c
+# SUBTRACT CPP /YX
+MTL=midl.exe
+# ADD BASE MTL /nologo /D "_DEBUG" /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+RSC=rc.exe
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /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
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib /nologo /subsystem:windows /dll /debug /machine:I386 /out:".\Debug\zlib.dll"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "zlibvc__"
+# PROP BASE Intermediate_Dir "zlibvc__"
+# PROP BASE Ignore_Export_Lib 0
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "zlibvc__"
+# PROP Intermediate_Dir "zlibvc__"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+MTL=midl.exe
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+CPP=cl.exe
+# ADD BASE CPP /nologo /MT /Gt0 /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /FAcs /FR /YX /FD /c
+# ADD CPP /nologo /MT /Gt0 /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /FAcs /FR /FD /c
+# SUBTRACT CPP /YX
+RSC=rc.exe
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 crtdll.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib /nologo /subsystem:windows /dll /map /machine:ALPHA /nodefaultlib /out:".\Release\zlib.dll"
+# SUBTRACT BASE LINK32 /pdb:none
+# ADD LINK32 crtdll.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib /nologo /subsystem:windows /dll /map /machine:ALPHA /nodefaultlib /out:"zlibvc__\zlib.dll"
+# SUBTRACT LINK32 /pdb:none
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "zlibvc_0"
+# PROP BASE Intermediate_Dir "zlibvc_0"
+# PROP BASE Ignore_Export_Lib 0
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "zlibvc_0"
+# PROP Intermediate_Dir "zlibvc_0"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /FAcs /FR /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /FAcs /FR /FD /c
+# SUBTRACT CPP /YX
+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 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /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 crtdll.lib /nologo /subsystem:windows /dll /map /machine:I386 /nodefaultlib /out:".\Release\zlib.dll"
+# SUBTRACT BASE LINK32 /pdb:none
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib crtdll.lib /nologo /subsystem:windows /dll /map /machine:I386 /nodefaultlib /out:".\zlibvc_0\zlib.dll"
+# SUBTRACT LINK32 /pdb:none
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "zlibvc_1"
+# PROP BASE Intermediate_Dir "zlibvc_1"
+# PROP BASE Ignore_Export_Lib 0
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "zlibvc_1"
+# PROP Intermediate_Dir "zlibvc_1"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /D "ASMV" /FAcs /FR /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /D "ASMV" /FAcs /FR /FD /c
+# SUBTRACT CPP /YX
+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 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 gvmat32.obj kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib crtdll.lib /nologo /subsystem:windows /dll /map /machine:I386 /nodefaultlib /out:".\Release\zlib.dll"
+# SUBTRACT BASE LINK32 /pdb:none
+# ADD LINK32 gvmat32.obj kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib crtdll.lib /nologo /subsystem:windows /dll /map /machine:I386 /nodefaultlib /out:".\zlibvc_1\zlib.dll"
+# SUBTRACT LINK32 /pdb:none
+
+!ENDIF 
+
+# Begin Target
+
+# Name "zlibvc - Win32 Release"
+# Name "zlibvc - Win32 Debug"
+# Name "zlibvc - Win32 ReleaseAxp"
+# Name "zlibvc - Win32 ReleaseWithoutAsm"
+# Name "zlibvc - Win32 ReleaseWithoutCrtdll"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;hpj;bat;for;f90"
+# Begin Source File
+
+SOURCE=.\adler32.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_ADLER=\
+	".\zconf.h"\
+	".\zlib.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\compress.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_COMPR=\
+	".\zconf.h"\
+	".\zlib.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\crc32.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_CRC32=\
+	".\zconf.h"\
+	".\zlib.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\deflate.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_DEFLA=\
+	".\deflate.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\gvmat32c.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\gzio.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_GZIO_=\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\infblock.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFBL=\
+	".\infblock.h"\
+	".\infcodes.h"\
+	".\inftrees.h"\
+	".\infutil.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\infcodes.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFCO=\
+	".\infblock.h"\
+	".\infcodes.h"\
+	".\inffast.h"\
+	".\inftrees.h"\
+	".\infutil.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\inffast.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFFA=\
+	".\infblock.h"\
+	".\infcodes.h"\
+	".\inffast.h"\
+	".\inftrees.h"\
+	".\infutil.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\inflate.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFLA=\
+	".\infblock.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\inftrees.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFTR=\
+	".\inftrees.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\infutil.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFUT=\
+	".\infblock.h"\
+	".\infcodes.h"\
+	".\inftrees.h"\
+	".\infutil.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\trees.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_TREES=\
+	".\deflate.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\uncompr.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_UNCOM=\
+	".\zconf.h"\
+	".\zlib.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\unzip.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\zip.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib.rc
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlibvc.def
+# End Source File
+# Begin Source File
+
+SOURCE=.\zutil.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_ZUTIL=\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl;fi;fd"
+# Begin Source File
+
+SOURCE=.\deflate.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\infblock.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\infcodes.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\inffast.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\inftrees.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\infutil.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;cnt;rtf;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/zlibvc.dsw b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/zlibvc.dsw
new file mode 100644
index 00000000000..493cd870365
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm386/zlibvc.dsw
@@ -0,0 +1,41 @@
+Microsoft Developer Studio Workspace File, Format Version 5.00
+# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
+
+###############################################################################
+
+Project: "zlibstat"=.\zlibstat.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "zlibvc"=.\zlibvc.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Global:
+
+Package=<5>
+{{{
+}}}
+
+Package=<3>
+{{{
+}}}
+
+###############################################################################
+
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm586/README.586 b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm586/README.586
new file mode 100644
index 00000000000..6bb78f32069
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm586/match.S b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm586/match.S
new file mode 100644
index 00000000000..8f1614078f8
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm586/match.S
@@ -0,0 +1,354 @@
+/* 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.)
+ */
+#define	dsWSize			36
+#define	dsWMask			44
+#define	dsWindow		48
+#define	dsPrev			56
+#define	dsMatchLen		88
+#define	dsPrevMatch		92
+#define	dsStrStart		100
+#define	dsMatchStart		104
+#define	dsLookahead		108
+#define	dsPrevLen		112
+#define	dsMaxChainLen		116
+#define	dsGoodMatch		132
+#define	dsNiceMatch		136
+
+
+.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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm686/README.686 b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm686/README.686
new file mode 100644
index 00000000000..a593f23afd6
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm686/match.S b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm686/match.S
new file mode 100644
index 00000000000..8e86c33c288
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/asm686/match.S
@@ -0,0 +1,327 @@
+/* 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
+
+/* 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.)
+ */
+#define	dsWSize			36
+#define	dsWMask			44
+#define	dsWindow		48
+#define	dsPrev			56
+#define	dsMatchLen		88
+#define	dsPrevMatch		92
+#define	dsStrStart		100
+#define	dsMatchStart		104
+#define	dsLookahead		108
+#define	dsPrevLen		112
+#define	dsMaxChainLen		116
+#define	dsGoodMatch		132
+#define	dsNiceMatch		136
+
+
+.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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi/zlib.mak b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi/zlib.mak
new file mode 100644
index 00000000000..ba557e2b977
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi/zlib.mak
@@ -0,0 +1,36 @@
+# Makefile for zlib32bd.lib
+# ------------- Borland C++ 4.5 -------------
+
+# The (32-bit) zlib32bd.lib made with this makefile is intended for use 
+# in making the (32-bit) DLL, png32bd.dll. It uses the "stdcall" calling 
+# convention.
+
+CFLAGS= -ps -O2 -C -K -N- -k- -d -3 -r- -w-par -w-aus -WDE
+CC=f:\bc45\bin\bcc32
+LIBFLAGS= /C
+LIB=f:\bc45\bin\tlib
+ZLIB=zlib32bd.lib
+
+.autodepend
+.c.obj:
+        $(CC) -c $(CFLAGS) $<
+
+OBJ1=adler32.obj compress.obj crc32.obj deflate.obj gzio.obj infblock.obj 
+OBJ2=infcodes.obj inflate.obj inftrees.obj infutil.obj inffast.obj 
+OBJ3=trees.obj uncompr.obj zutil.obj
+pOBJ1=+adler32.obj+compress.obj+crc32.obj+deflate.obj+gzio.obj+infblock.obj 
+pOBJ2=+infcodes.obj+inflate.obj+inftrees.obj+infutil.obj+inffast.obj 
+pOBJ3=+trees.obj+uncompr.obj+zutil.obj
+
+all: $(ZLIB)
+
+$(ZLIB): $(OBJ1) $(OBJ2) $(OBJ3)
+        @if exist $@ del $@
+        $(LIB) @&&|
+$@ $(LIBFLAGS) &
+$(pOBJ1) &
+$(pOBJ2) &
+$(pOBJ3)
+|
+
+# End of makefile for zlib32bd.lib
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi/zlibdef.pas b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi/zlibdef.pas
new file mode 100644
index 00000000000..4f96b7d2c50
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi/zlibdef.pas
@@ -0,0 +1,169 @@
+unit zlibdef;
+
+interface
+
+uses
+  Windows;
+
+const
+  ZLIB_VERSION = '1.1.3';
+
+type
+  voidpf = Pointer;
+  int    = Integer;
+  uInt   = Cardinal;
+  pBytef = PChar;
+  uLong  = Cardinal;
+
+  alloc_func = function(opaque: voidpf; items, size: uInt): voidpf;
+                    stdcall;
+  free_func  = procedure(opaque, address: voidpf);
+                    stdcall;
+
+  internal_state = Pointer;
+
+  z_streamp = ^z_stream;
+  z_stream = packed record
+    next_in: pBytef;          // next input byte
+    avail_in: uInt;           // number of bytes available at next_in
+    total_in: uLong;          // total nb of input bytes read so far
+
+    next_out: pBytef;         // next output byte should be put there
+    avail_out: uInt;          // remaining free space at next_out
+    total_out: uLong;         // total nb of bytes output so far
+
+    msg: PChar;               // last error message, NULL if no error
+    state: internal_state;    // not visible by applications
+
+    zalloc: alloc_func;       // used to allocate the internal state
+    zfree: free_func;         // used to free the internal state
+    opaque: voidpf;           // 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;
+
+const
+  Z_NO_FLUSH      = 0;
+  Z_SYNC_FLUSH    = 2;
+  Z_FULL_FLUSH    = 3;
+  Z_FINISH        = 4;
+
+  Z_OK            = 0;
+  Z_STREAM_END    = 1;
+
+  Z_NO_COMPRESSION         =  0;
+  Z_BEST_SPEED             =  1;
+  Z_BEST_COMPRESSION       =  9;
+  Z_DEFAULT_COMPRESSION    = -1;
+
+  Z_FILTERED            = 1;
+  Z_HUFFMAN_ONLY        = 2;
+  Z_DEFAULT_STRATEGY    = 0;
+
+  Z_BINARY   = 0;
+  Z_ASCII    = 1;
+  Z_UNKNOWN  = 2;
+
+  Z_DEFLATED    = 8;
+
+  MAX_MEM_LEVEL = 9;
+
+function adler32(adler: uLong; const buf: pBytef; len: uInt): uLong;
+             stdcall;
+function crc32(crc: uLong; const buf: pBytef; len: uInt): uLong;
+             stdcall;
+function deflate(strm: z_streamp; flush: int): int;
+             stdcall;
+function deflateCopy(dest, source: z_streamp): int;
+             stdcall;
+function deflateEnd(strm: z_streamp): int;
+             stdcall;
+function deflateInit2_(strm: z_streamp; level, method,
+                       windowBits, memLevel, strategy: int;
+                       const version: PChar; stream_size: int): int;
+             stdcall;
+function deflateInit_(strm: z_streamp; level: int;
+                      const version: PChar; stream_size: int): int;
+             stdcall;
+function deflateParams(strm: z_streamp; level, strategy: int): int;
+             stdcall;
+function deflateReset(strm: z_streamp): int;
+             stdcall;
+function deflateSetDictionary(strm: z_streamp;
+                              const dictionary: pBytef;
+                              dictLength: uInt): int;
+             stdcall;
+function inflate(strm: z_streamp; flush: int): int;
+             stdcall;
+function inflateEnd(strm: z_streamp): int;
+             stdcall;
+function inflateInit2_(strm: z_streamp; windowBits: int;
+                       const version: PChar; stream_size: int): int;
+             stdcall;
+function inflateInit_(strm: z_streamp; const version: PChar;
+                      stream_size: int): int;
+             stdcall;
+function inflateReset(strm: z_streamp): int;
+             stdcall;
+function inflateSetDictionary(strm: z_streamp;
+                              const dictionary: pBytef;
+                              dictLength: uInt): int;
+             stdcall;
+function inflateSync(strm: z_streamp): int;
+             stdcall;
+
+function deflateInit(strm: z_streamp; level: int): int;
+function deflateInit2(strm: z_streamp; level, method, windowBits,
+                      memLevel, strategy: int): int;
+function inflateInit(strm: z_streamp): int;
+function inflateInit2(strm: z_streamp; windowBits: int): int;
+
+implementation
+
+function deflateInit(strm: z_streamp; level: int): int;
+begin
+  Result := deflateInit_(strm, level, ZLIB_VERSION, sizeof(z_stream));
+end;
+
+function deflateInit2(strm: z_streamp; level, method, windowBits,
+                      memLevel, strategy: int): int;
+begin
+  Result := deflateInit2_(strm, level, method, windowBits, memLevel,
+                          strategy, ZLIB_VERSION, sizeof(z_stream));
+end;
+
+function inflateInit(strm: z_streamp): int;
+begin
+  Result := inflateInit_(strm, ZLIB_VERSION, sizeof(z_stream));
+end;
+
+function inflateInit2(strm: z_streamp; windowBits: int): int;
+begin
+  Result := inflateInit2_(strm, windowBits, ZLIB_VERSION,
+                          sizeof(z_stream));
+end;
+
+const
+  zlibDLL = 'png32bd.dll';
+
+function adler32; external zlibDLL;
+function crc32; external zlibDLL;
+function deflate; external zlibDLL;
+function deflateCopy; external zlibDLL;
+function deflateEnd; external zlibDLL;
+function deflateInit2_; external zlibDLL;
+function deflateInit_; external zlibDLL;
+function deflateParams; external zlibDLL;
+function deflateReset; external zlibDLL;
+function deflateSetDictionary; external zlibDLL;
+function inflate; external zlibDLL;
+function inflateEnd; external zlibDLL;
+function inflateInit2_; external zlibDLL;
+function inflateInit_; external zlibDLL;
+function inflateReset; external zlibDLL;
+function inflateSetDictionary; external zlibDLL;
+function inflateSync; external zlibDLL;
+
+end.
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/d_zlib.bpr b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/d_zlib.bpr
new file mode 100644
index 00000000000..78bb254088a
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/d_zlib.bpr
@@ -0,0 +1,224 @@
+# ---------------------------------------------------------------------------
+!if !$d(BCB)
+BCB = $(MAKEDIR)\..
+!endif
+
+# ---------------------------------------------------------------------------
+# IDE SECTION
+# ---------------------------------------------------------------------------
+# The following section of the project makefile is managed by the BCB IDE.
+# It is recommended to use the IDE to change any of the values in this
+# section.
+# ---------------------------------------------------------------------------
+
+VERSION = BCB.03
+# ---------------------------------------------------------------------------
+PROJECT = d_zlib.lib
+OBJFILES = d_zlib.obj adler32.obj deflate.obj infblock.obj infcodes.obj inffast.obj \
+  inflate.obj inftrees.obj infutil.obj trees.obj
+RESFILES =
+RESDEPEN = $(RESFILES)
+LIBFILES =
+LIBRARIES = VCL35.lib
+SPARELIBS = VCL35.lib
+DEFFILE =
+PACKAGES = VCLX35.bpi VCL35.bpi VCLDB35.bpi VCLDBX35.bpi ibsmp35.bpi bcbsmp35.bpi \
+  dclocx35.bpi QRPT35.bpi TEEUI35.bpi TEEDB35.bpi TEE35.bpi DSS35.bpi \
+  NMFAST35.bpi INETDB35.bpi INET35.bpi VCLMID35.bpi
+# ---------------------------------------------------------------------------
+PATHCPP = .;
+PATHASM = .;
+PATHPAS = .;
+PATHRC = .;
+DEBUGLIBPATH = $(BCB)\lib\debug
+RELEASELIBPATH = $(BCB)\lib\release
+# ---------------------------------------------------------------------------
+CFLAG1 = -O2 -Ve -d -k- -vi
+CFLAG2 = -I$(BCB)\include;$(BCB)\include\vcl -H=$(BCB)\lib\vcl35.csm
+CFLAG3 = -ff -pr -5
+PFLAGS = -U;$(DEBUGLIBPATH) -I$(BCB)\include;$(BCB)\include\vcl -H -W -$I- -v -JPHN -M
+RFLAGS = -i$(BCB)\include;$(BCB)\include\vcl 
+AFLAGS = /i$(BCB)\include /i$(BCB)\include\vcl /mx /w2 /zn
+LFLAGS =
+IFLAGS = -g -Gn
+# ---------------------------------------------------------------------------
+ALLOBJ = c0w32.obj $(OBJFILES)
+ALLRES = $(RESFILES)
+ALLLIB = $(LIBFILES) $(LIBRARIES) import32.lib cp32mt.lib
+# ---------------------------------------------------------------------------
+!!ifdef IDEOPTIONS
+
+[Version Info]
+IncludeVerInfo=0
+AutoIncBuild=0
+MajorVer=1
+MinorVer=0
+Release=0
+Build=0
+Debug=0
+PreRelease=0
+Special=0
+Private=0
+DLL=0
+Locale=1040
+CodePage=1252
+
+[Version Info Keys]
+CompanyName=
+FileDescription=
+FileVersion=1.0.0.0
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=1.0.0.0
+Comments=
+
+[HistoryLists\hlIncludePath]
+Count=2
+Item0=$(BCB)\include
+Item1=$(BCB)\include;$(BCB)\include\vcl
+
+[HistoryLists\hlLibraryPath]
+Count=1
+Item0=$(BCB)\lib\obj;$(BCB)\lib
+
+[HistoryLists\hlDebugSourcePath]
+Count=1
+Item0=$(BCB)\source\vcl
+
+[Debugging]
+DebugSourceDirs=
+
+[Parameters]
+RunParams=
+HostApplication=
+
+!endif
+
+ ---------------------------------------------------------------------------
+# MAKE SECTION
+# ---------------------------------------------------------------------------
+# This section of the project file is not used by the BCB IDE.  It is for
+# the benefit of building from the command-line using the MAKE utility.
+# ---------------------------------------------------------------------------
+
+.autodepend
+# ---------------------------------------------------------------------------
+!if !$d(BCC32)
+BCC32 = bcc32
+!endif
+
+!if !$d(DCC32)
+DCC32 = dcc32
+!endif
+
+!if !$d(TASM32)
+TASM32 = tasm32
+!endif
+
+!if !$d(LINKER)
+LINKER = TLib
+!endif
+
+!if !$d(BRCC32)
+BRCC32 = brcc32
+!endif
+# ---------------------------------------------------------------------------
+!if $d(PATHCPP)
+.PATH.CPP = $(PATHCPP)
+.PATH.C   = $(PATHCPP)
+!endif
+
+!if $d(PATHPAS)
+.PATH.PAS = $(PATHPAS)
+!endif
+
+!if $d(PATHASM)
+.PATH.ASM = $(PATHASM)
+!endif
+
+!if $d(PATHRC)
+.PATH.RC  = $(PATHRC)
+!endif
+# ---------------------------------------------------------------------------
+!ifdef IDEOPTIONS
+
+[Version Info]
+IncludeVerInfo=0
+AutoIncBuild=0
+MajorVer=1
+MinorVer=0
+Release=0
+Build=0
+Debug=0
+PreRelease=0
+Special=0
+Private=0
+DLL=0
+Locale=1040
+CodePage=1252
+
+[Version Info Keys]
+CompanyName=
+FileDescription=
+FileVersion=1.0.0.0
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=1.0.0.0
+Comments=
+
+[HistoryLists\hlIncludePath]
+Count=2
+Item0=$(BCB)\include;$(BCB)\include\vcl
+Item1=$(BCB)\include
+
+[HistoryLists\hlLibraryPath]
+Count=1
+Item0=$(BCB)\lib\obj;$(BCB)\lib
+
+[HistoryLists\hlDebugSourcePath]
+Count=1
+Item0=$(BCB)\source\vcl
+
+[Debugging]
+DebugSourceDirs=
+
+[Parameters]
+RunParams=
+HostApplication=
+
+!endif
+
+$(PROJECT): $(OBJFILES) $(RESDEPEN) $(DEFFILE)
+    $(BCB)\BIN\$(LINKER) @&&!
+    $(LFLAGS) $(IFLAGS) +
+    $(ALLOBJ), +
+    $(PROJECT),, +
+    $(ALLLIB), +
+    $(DEFFILE), +
+    $(ALLRES)
+!
+# ---------------------------------------------------------------------------
+.pas.hpp:
+    $(BCB)\BIN\$(DCC32) $(PFLAGS) {$< }
+
+.pas.obj:
+    $(BCB)\BIN\$(DCC32) $(PFLAGS) {$< }
+
+.cpp.obj:
+    $(BCB)\BIN\$(BCC32) $(CFLAG1) $(CFLAG2) $(CFLAG3) -n$(@D) {$< }
+
+.c.obj:
+    $(BCB)\BIN\$(BCC32) $(CFLAG1) $(CFLAG2) $(CFLAG3) -n$(@D) {$< }
+
+.asm.obj:
+    $(BCB)\BIN\$(TASM32) $(AFLAGS) $<, $@
+
+.rc.res:
+    $(BCB)\BIN\$(BRCC32) $(RFLAGS) -fo$@ $<
+# ---------------------------------------------------------------------------
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/d_zlib.cpp b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/d_zlib.cpp
new file mode 100644
index 00000000000..f5dea59b762
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/d_zlib.cpp
@@ -0,0 +1,17 @@
+#include <condefs.h>
+#pragma hdrstop
+//---------------------------------------------------------------------------
+USEUNIT("adler32.c");
+USEUNIT("deflate.c");
+USEUNIT("infblock.c");
+USEUNIT("infcodes.c");
+USEUNIT("inffast.c");
+USEUNIT("inflate.c");
+USEUNIT("inftrees.c");
+USEUNIT("infutil.c");
+USEUNIT("trees.c");
+//---------------------------------------------------------------------------
+#define Library
+
+// To add a file to the library use the Project menu 'Add to Project'.
+
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/readme.txt b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/readme.txt
new file mode 100644
index 00000000000..cbd31620d87
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/readme.txt
@@ -0,0 +1,17 @@
+These are files used to compile zlib under Borland C++ Builder 3.
+
+zlib.bpg is the main project group that can be loaded in the BCB IDE and
+loads all other *.bpr projects
+
+zlib.bpr is a project used to create a static zlib.lib library with C calling
+convention for functions.
+
+zlib32.bpr creates a zlib32.dll dynamic link library with Windows standard
+calling convention.
+
+d_zlib.bpr creates a set of .obj files with register calling convention.
+These files are used by zlib.pas to create a Delphi unit containing zlib.
+The d_zlib.lib file generated isn't useful and can be deleted.
+
+zlib.cpp, zlib32.cpp and d_zlib.cpp are used by the above projects.
+
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.bpg b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.bpg
new file mode 100644
index 00000000000..b6c9acdf8c9
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.bpg
@@ -0,0 +1,26 @@
+#------------------------------------------------------------------------------
+VERSION = BWS.01
+#------------------------------------------------------------------------------
+!ifndef ROOT
+ROOT = $(MAKEDIR)\..
+!endif
+#------------------------------------------------------------------------------
+MAKE = $(ROOT)\bin\make.exe -$(MAKEFLAGS) -f$**
+DCC = $(ROOT)\bin\dcc32.exe $**
+BRCC = $(ROOT)\bin\brcc32.exe $**
+#------------------------------------------------------------------------------
+PROJECTS = zlib zlib32 d_zlib
+#------------------------------------------------------------------------------
+default: $(PROJECTS)
+#------------------------------------------------------------------------------
+
+zlib: zlib.bpr
+  $(MAKE)
+
+zlib32: zlib32.bpr
+  $(MAKE)
+
+d_zlib: d_zlib.bpr
+  $(MAKE)
+
+
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.bpr b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.bpr
new file mode 100644
index 00000000000..cf3945b2523
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.bpr
@@ -0,0 +1,225 @@
+# ---------------------------------------------------------------------------
+!if !$d(BCB)
+BCB = $(MAKEDIR)\..
+!endif
+
+# ---------------------------------------------------------------------------
+# IDE SECTION
+# ---------------------------------------------------------------------------
+# The following section of the project makefile is managed by the BCB IDE.
+# It is recommended to use the IDE to change any of the values in this
+# section.
+# ---------------------------------------------------------------------------
+
+VERSION = BCB.03
+# ---------------------------------------------------------------------------
+PROJECT = zlib.lib
+OBJFILES = zlib.obj adler32.obj compress.obj crc32.obj deflate.obj gzio.obj infblock.obj \
+  infcodes.obj inffast.obj inflate.obj inftrees.obj infutil.obj trees.obj \
+  uncompr.obj zutil.obj
+RESFILES =
+RESDEPEN = $(RESFILES)
+LIBFILES =
+LIBRARIES = VCL35.lib
+SPARELIBS = VCL35.lib
+DEFFILE =
+PACKAGES = VCLX35.bpi VCL35.bpi VCLDB35.bpi VCLDBX35.bpi ibsmp35.bpi bcbsmp35.bpi \
+  dclocx35.bpi QRPT35.bpi TEEUI35.bpi TEEDB35.bpi TEE35.bpi DSS35.bpi \
+  NMFAST35.bpi INETDB35.bpi INET35.bpi VCLMID35.bpi
+# ---------------------------------------------------------------------------
+PATHCPP = .;
+PATHASM = .;
+PATHPAS = .;
+PATHRC = .;
+DEBUGLIBPATH = $(BCB)\lib\debug
+RELEASELIBPATH = $(BCB)\lib\release
+# ---------------------------------------------------------------------------
+CFLAG1 = -O2 -Ve -d -k- -vi
+CFLAG2 = -I$(BCB)\include;$(BCB)\include\vcl -H=$(BCB)\lib\vcl35.csm
+CFLAG3 = -ff -5
+PFLAGS = -U;$(DEBUGLIBPATH) -I$(BCB)\include;$(BCB)\include\vcl -H -W -$I- -v -JPHN -M
+RFLAGS = -i$(BCB)\include;$(BCB)\include\vcl 
+AFLAGS = /i$(BCB)\include /i$(BCB)\include\vcl /mx /w2 /zn
+LFLAGS =
+IFLAGS = -g -Gn
+# ---------------------------------------------------------------------------
+ALLOBJ = c0w32.obj $(OBJFILES)
+ALLRES = $(RESFILES)
+ALLLIB = $(LIBFILES) $(LIBRARIES) import32.lib cp32mt.lib
+# ---------------------------------------------------------------------------
+!!ifdef IDEOPTIONS
+
+[Version Info]
+IncludeVerInfo=0
+AutoIncBuild=0
+MajorVer=1
+MinorVer=0
+Release=0
+Build=0
+Debug=0
+PreRelease=0
+Special=0
+Private=0
+DLL=0
+Locale=1040
+CodePage=1252
+
+[Version Info Keys]
+CompanyName=
+FileDescription=
+FileVersion=1.0.0.0
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=1.0.0.0
+Comments=
+
+[HistoryLists\hlIncludePath]
+Count=2
+Item0=$(BCB)\include
+Item1=$(BCB)\include;$(BCB)\include\vcl
+
+[HistoryLists\hlLibraryPath]
+Count=1
+Item0=$(BCB)\lib\obj;$(BCB)\lib
+
+[HistoryLists\hlDebugSourcePath]
+Count=1
+Item0=$(BCB)\source\vcl
+
+[Debugging]
+DebugSourceDirs=
+
+[Parameters]
+RunParams=
+HostApplication=
+
+!endif
+
+ ---------------------------------------------------------------------------
+# MAKE SECTION
+# ---------------------------------------------------------------------------
+# This section of the project file is not used by the BCB IDE.  It is for
+# the benefit of building from the command-line using the MAKE utility.
+# ---------------------------------------------------------------------------
+
+.autodepend
+# ---------------------------------------------------------------------------
+!if !$d(BCC32)
+BCC32 = bcc32
+!endif
+
+!if !$d(DCC32)
+DCC32 = dcc32
+!endif
+
+!if !$d(TASM32)
+TASM32 = tasm32
+!endif
+
+!if !$d(LINKER)
+LINKER = TLib
+!endif
+
+!if !$d(BRCC32)
+BRCC32 = brcc32
+!endif
+# ---------------------------------------------------------------------------
+!if $d(PATHCPP)
+.PATH.CPP = $(PATHCPP)
+.PATH.C   = $(PATHCPP)
+!endif
+
+!if $d(PATHPAS)
+.PATH.PAS = $(PATHPAS)
+!endif
+
+!if $d(PATHASM)
+.PATH.ASM = $(PATHASM)
+!endif
+
+!if $d(PATHRC)
+.PATH.RC  = $(PATHRC)
+!endif
+# ---------------------------------------------------------------------------
+!ifdef IDEOPTIONS
+
+[Version Info]
+IncludeVerInfo=0
+AutoIncBuild=0
+MajorVer=1
+MinorVer=0
+Release=0
+Build=0
+Debug=0
+PreRelease=0
+Special=0
+Private=0
+DLL=0
+Locale=1040
+CodePage=1252
+
+[Version Info Keys]
+CompanyName=
+FileDescription=
+FileVersion=1.0.0.0
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=1.0.0.0
+Comments=
+
+[HistoryLists\hlIncludePath]
+Count=2
+Item0=$(BCB)\include;$(BCB)\include\vcl
+Item1=$(BCB)\include
+
+[HistoryLists\hlLibraryPath]
+Count=1
+Item0=$(BCB)\lib\obj;$(BCB)\lib
+
+[HistoryLists\hlDebugSourcePath]
+Count=1
+Item0=$(BCB)\source\vcl
+
+[Debugging]
+DebugSourceDirs=
+
+[Parameters]
+RunParams=
+HostApplication=
+
+!endif
+
+$(PROJECT): $(OBJFILES) $(RESDEPEN) $(DEFFILE)
+    $(BCB)\BIN\$(LINKER) @&&!
+    $(LFLAGS) $(IFLAGS) +
+    $(ALLOBJ), +
+    $(PROJECT),, +
+    $(ALLLIB), +
+    $(DEFFILE), +
+    $(ALLRES)
+!
+# ---------------------------------------------------------------------------
+.pas.hpp:
+    $(BCB)\BIN\$(DCC32) $(PFLAGS) {$< }
+
+.pas.obj:
+    $(BCB)\BIN\$(DCC32) $(PFLAGS) {$< }
+
+.cpp.obj:
+    $(BCB)\BIN\$(BCC32) $(CFLAG1) $(CFLAG2) $(CFLAG3) -n$(@D) {$< }
+
+.c.obj:
+    $(BCB)\BIN\$(BCC32) $(CFLAG1) $(CFLAG2) $(CFLAG3) -n$(@D) {$< }
+
+.asm.obj:
+    $(BCB)\BIN\$(TASM32) $(AFLAGS) $<, $@
+
+.rc.res:
+    $(BCB)\BIN\$(BRCC32) $(RFLAGS) -fo$@ $<
+# ---------------------------------------------------------------------------
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.cpp b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.cpp
new file mode 100644
index 00000000000..bf6953ba198
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.cpp
@@ -0,0 +1,22 @@
+#include <condefs.h>
+#pragma hdrstop
+//---------------------------------------------------------------------------
+USEUNIT("adler32.c");
+USEUNIT("compress.c");
+USEUNIT("crc32.c");
+USEUNIT("deflate.c");
+USEUNIT("gzio.c");
+USEUNIT("infblock.c");
+USEUNIT("infcodes.c");
+USEUNIT("inffast.c");
+USEUNIT("inflate.c");
+USEUNIT("inftrees.c");
+USEUNIT("infutil.c");
+USEUNIT("trees.c");
+USEUNIT("uncompr.c");
+USEUNIT("zutil.c");
+//---------------------------------------------------------------------------
+#define Library
+
+// To add a file to the library use the Project menu 'Add to Project'.
+
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.pas b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.pas
new file mode 100644
index 00000000000..10ae4cae256
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib.pas
@@ -0,0 +1,534 @@
+{*******************************************************}
+{                                                       }
+{       Delphi Supplemental Components                  }
+{       ZLIB Data Compression Interface Unit            }
+{                                                       }
+{       Copyright (c) 1997 Borland International        }
+{                                                       }
+{*******************************************************}
+
+{ Modified for zlib 1.1.3 by Davide Moretti <dave@rimini.com }
+
+unit zlib;
+
+interface
+
+uses Sysutils, Classes;
+
+type
+  TAlloc = function (AppData: Pointer; Items, Size: Integer): Pointer;
+  TFree = procedure (AppData, Block: Pointer);
+
+  // Internal structure.  Ignore.
+  TZStreamRec = packed record
+    next_in: PChar;       // next input byte
+    avail_in: Integer;    // number of bytes available at next_in
+    total_in: Integer;    // 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: Integer;   // 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: Integer;       // adler32 value of the uncompressed data
+    reserved: Integer;    // 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);
+
+const
+  zlib_version = '1.1.3';
+
+type
+  EZlibError = class(Exception);
+  ECompressionError = class(EZlibError);
+  EDecompressionError = class(EZlibError);
+
+function adler32(adler: Integer; buf: PChar; len: Integer): Integer;
+
+implementation
+
+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_DEFAULT_STRATEGY    = 0;
+
+  Z_BINARY   = 0;
+  Z_ASCII    = 1;
+  Z_UNKNOWN  = 2;
+
+  Z_DEFLATED = 8;
+
+  _z_errmsg: array[0..9] of PChar = (
+    '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)
+    ''
+  );
+
+{$L deflate.obj}
+{$L inflate.obj}
+{$L inftrees.obj}
+{$L trees.obj}
+{$L adler32.obj}
+{$L infblock.obj}
+{$L infcodes.obj}
+{$L infutil.obj}
+{$L inffast.obj}
+
+procedure _tr_init; external;
+procedure _tr_tally; external;
+procedure _tr_flush_block; external;
+procedure _tr_align; external;
+procedure _tr_stored_block; external;
+function adler32; external;
+procedure inflate_blocks_new; external;
+procedure inflate_blocks; external;
+procedure inflate_blocks_reset; external;
+procedure inflate_blocks_free; external;
+procedure inflate_set_dictionary; external;
+procedure inflate_trees_bits; external;
+procedure inflate_trees_dynamic; external;
+procedure inflate_trees_fixed; external;
+procedure inflate_codes_new; external;
+procedure inflate_codes; external;
+procedure inflate_codes_free; external;
+procedure _inflate_mask; external;
+procedure inflate_flush; external;
+procedure inflate_fast; external;
+
+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 zcalloc(AppData: Pointer; Items, Size: Integer): Pointer;
+begin
+  GetMem(Result, Items*Size);
+end;
+
+procedure zcfree(AppData, Block: Pointer);
+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);
+  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);
+  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_FINISH)) <> 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;
+
+
+// TCustomZlibStream
+
+constructor TCustomZLibStream.Create(Strm: TStream);
+begin
+  inherited Create;
+  FStrm := Strm;
+  FStrmPos := Strm.Position;
+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.Create('Invalid stream operation');
+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.Create('Invalid stream operation');
+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
+  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;
+    DCheck(inflate(FZRec, 0));
+  end;
+  Result := Count;
+end;
+
+function TDecompressionStream.Write(const Buffer; Count: Longint): Longint;
+begin
+  raise EDecompressionError.Create('Invalid stream operation');
+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.Create('Invalid stream operation');
+  Result := FZRec.total_out;
+end;
+
+end.
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib32.bpr b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib32.bpr
new file mode 100644
index 00000000000..cabcec44947
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib32.bpr
@@ -0,0 +1,174 @@
+# ---------------------------------------------------------------------------
+!if !$d(BCB)
+BCB = $(MAKEDIR)\..
+!endif
+
+# ---------------------------------------------------------------------------
+# IDE SECTION
+# ---------------------------------------------------------------------------
+# The following section of the project makefile is managed by the BCB IDE.
+# It is recommended to use the IDE to change any of the values in this
+# section.
+# ---------------------------------------------------------------------------
+
+VERSION = BCB.03
+# ---------------------------------------------------------------------------
+PROJECT = zlib32.dll
+OBJFILES = zlib32.obj adler32.obj compress.obj crc32.obj deflate.obj gzio.obj infblock.obj \
+  infcodes.obj inffast.obj inflate.obj inftrees.obj infutil.obj trees.obj \
+  uncompr.obj zutil.obj
+RESFILES =
+RESDEPEN = $(RESFILES)
+LIBFILES =
+LIBRARIES = 
+SPARELIBS = 
+DEFFILE =
+PACKAGES = VCLX35.bpi VCL35.bpi VCLDB35.bpi VCLDBX35.bpi ibsmp35.bpi bcbsmp35.bpi \
+  dclocx35.bpi QRPT35.bpi TEEUI35.bpi TEEDB35.bpi TEE35.bpi DSS35.bpi \
+  NMFAST35.bpi INETDB35.bpi INET35.bpi VCLMID35.bpi
+# ---------------------------------------------------------------------------
+PATHCPP = .;
+PATHASM = .;
+PATHPAS = .;
+PATHRC = .;
+DEBUGLIBPATH = $(BCB)\lib\debug
+RELEASELIBPATH = $(BCB)\lib\release
+# ---------------------------------------------------------------------------
+CFLAG1 = -WD -O2 -Ve -d -k- -vi -c -tWD
+CFLAG2 = -D_NO_VCL;ZLIB_DLL -I$(BCB)\include
+CFLAG3 = -ff -5
+PFLAGS = -D_NO_VCL;ZLIB_DLL -U$(BCB)\lib;$(RELEASELIBPATH) -I$(BCB)\include -$I- -v \
+  -JPHN -M
+RFLAGS = -D_NO_VCL;ZLIB_DLL -i$(BCB)\include
+AFLAGS = /i$(BCB)\include /d_NO_VCL /dZLIB_DLL /mx /w2 /zn
+LFLAGS = -L$(BCB)\lib;$(RELEASELIBPATH) -aa -Tpd -x -Gi
+IFLAGS = -Gn -g
+# ---------------------------------------------------------------------------
+ALLOBJ = c0d32.obj $(OBJFILES)
+ALLRES = $(RESFILES)
+ALLLIB = $(LIBFILES)  import32.lib cw32mt.lib
+# ---------------------------------------------------------------------------
+!ifdef IDEOPTIONS
+
+[Version Info]
+IncludeVerInfo=0
+AutoIncBuild=0
+MajorVer=1
+MinorVer=0
+Release=0
+Build=0
+Debug=0
+PreRelease=0
+Special=0
+Private=0
+DLL=1
+Locale=1040
+CodePage=1252
+
+[Version Info Keys]
+CompanyName=
+FileDescription=DLL (GUI)
+FileVersion=1.0.0.0
+InternalName=
+LegalCopyright=
+LegalTrademarks=
+OriginalFilename=
+ProductName=
+ProductVersion=1.0.0.0
+Comments=
+
+[HistoryLists\hlIncludePath]
+Count=1
+Item0=$(BCB)\include
+
+[HistoryLists\hlLibraryPath]
+Count=1
+Item0=$(BCB)\lib
+
+[HistoryLists\hlConditionals]
+Count=1
+Item0=_NO_VCL;ZLIB_DLL
+
+[Debugging]
+DebugSourceDirs=
+
+[Parameters]
+RunParams=
+HostApplication=
+
+!endif
+
+# ---------------------------------------------------------------------------
+# MAKE SECTION
+# ---------------------------------------------------------------------------
+# This section of the project file is not used by the BCB IDE.  It is for
+# the benefit of building from the command-line using the MAKE utility.
+# ---------------------------------------------------------------------------
+
+.autodepend
+# ---------------------------------------------------------------------------
+!if !$d(BCC32)
+BCC32 = bcc32
+!endif
+
+!if !$d(DCC32)
+DCC32 = dcc32
+!endif
+
+!if !$d(TASM32)
+TASM32 = tasm32
+!endif
+
+!if !$d(LINKER)
+LINKER = ilink32
+!endif
+
+!if !$d(BRCC32)
+BRCC32 = brcc32
+!endif
+# ---------------------------------------------------------------------------
+!if $d(PATHCPP)
+.PATH.CPP = $(PATHCPP)
+.PATH.C   = $(PATHCPP)
+!endif
+
+!if $d(PATHPAS)
+.PATH.PAS = $(PATHPAS)
+!endif
+
+!if $d(PATHASM)
+.PATH.ASM = $(PATHASM)
+!endif
+
+!if $d(PATHRC)
+.PATH.RC  = $(PATHRC)
+!endif
+# ---------------------------------------------------------------------------
+$(PROJECT): $(OBJFILES) $(RESDEPEN) $(DEFFILE)
+    $(BCB)\BIN\$(LINKER) @&&!
+    $(LFLAGS) $(IFLAGS) +
+    $(ALLOBJ), +
+    $(PROJECT),, +
+    $(ALLLIB), +
+    $(DEFFILE), +
+    $(ALLRES)
+!
+# ---------------------------------------------------------------------------
+.pas.hpp:
+    $(BCB)\BIN\$(DCC32) $(PFLAGS) {$< }
+
+.pas.obj:
+    $(BCB)\BIN\$(DCC32) $(PFLAGS) {$< }
+
+.cpp.obj:
+    $(BCB)\BIN\$(BCC32) $(CFLAG1) $(CFLAG2) $(CFLAG3) -n$(@D) {$< }
+
+.c.obj:
+    $(BCB)\BIN\$(BCC32) $(CFLAG1) $(CFLAG2) $(CFLAG3) -n$(@D) {$< }
+
+.asm.obj:
+    $(BCB)\BIN\$(TASM32) $(AFLAGS) $<, $@
+
+.rc.res:
+    $(BCB)\BIN\$(BRCC32) $(RFLAGS) -fo$@ $<
+# ---------------------------------------------------------------------------
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib32.cpp b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib32.cpp
new file mode 100644
index 00000000000..7372f6b985f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/delphi2/zlib32.cpp
@@ -0,0 +1,42 @@
+
+#include <windows.h>
+#pragma hdrstop
+#include <condefs.h>
+
+
+//---------------------------------------------------------------------------
+//   Important note about DLL memory management in a VCL DLL:
+//
+//
+//
+// If your DLL uses VCL and exports any functions that pass VCL String objects
+// (or structs/classes containing nested Strings) as parameter or function
+// results, you will need to build both your DLL project and any EXE projects
+// that use your DLL with the dynamic RTL (the RTL DLL).  This will change your
+// DLL and its calling EXE's to use BORLNDMM.DLL as their memory manager. In
+// these cases, the file BORLNDMM.DLL should be deployed along with your DLL
+// and the RTL DLL (CP3240MT.DLL). To avoid the requiring BORLNDMM.DLL in
+// these situations, pass string information using "char *" or ShortString
+// parameters and then link with the static RTL.
+//
+//---------------------------------------------------------------------------
+USEUNIT("adler32.c");
+USEUNIT("compress.c");
+USEUNIT("crc32.c");
+USEUNIT("deflate.c");
+USEUNIT("gzio.c");
+USEUNIT("infblock.c");
+USEUNIT("infcodes.c");
+USEUNIT("inffast.c");
+USEUNIT("inflate.c");
+USEUNIT("inftrees.c");
+USEUNIT("infutil.c");
+USEUNIT("trees.c");
+USEUNIT("uncompr.c");
+USEUNIT("zutil.c");
+//---------------------------------------------------------------------------
+#pragma argsused
+int WINAPI DllEntryPoint(HINSTANCE hinst, unsigned long reason, void*)
+{
+        return 1;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream/test.cpp b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream/test.cpp
new file mode 100644
index 00000000000..7d265b3b5c0
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream/zfstream.cpp b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream/zfstream.cpp
new file mode 100644
index 00000000000..a690bbefceb
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream/zfstream.cpp
@@ -0,0 +1,329 @@
+
+#include <memory.h>
+#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;
+  memset(char_mode,'\0',10);
+  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';
+  }
+
+  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;
+  memset(char_mode,'\0',10);
+  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';
+  }
+
+  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( short comp_level ) {
+
+  return gzsetparams(file, comp_level, -2);
+
+}
+
+int gzfilebuf::setcompressionstrategy( short 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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream/zfstream.h b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream/zfstream.h
new file mode 100644
index 00000000000..c87fa08e9d1
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream/zfstream.h
@@ -0,0 +1,142 @@
+
+#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( short comp_level );
+  int setcompressionstrategy( short 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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream2/zstream.h b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream2/zstream.h
new file mode 100644
index 00000000000..43d2332b79b
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream2/zstream_test.cpp b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/iostream2/zstream_test.cpp
new file mode 100644
index 00000000000..5bbd56c3ad8
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/ChangeLogUnzip b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/ChangeLogUnzip
new file mode 100644
index 00000000000..9987c543cdc
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/ChangeLogUnzip
@@ -0,0 +1,38 @@
+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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/Makefile b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/Makefile
new file mode 100644
index 00000000000..a1dfc161437
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/Makefile
@@ -0,0 +1,25 @@
+CC=cc
+CFLAGS=-O -I../..
+
+UNZ_OBJS = miniunz.o unzip.o ../../libz.a
+ZIP_OBJS = minizip.o zip.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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/miniunz.c b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/miniunz.c
new file mode 100644
index 00000000000..f3b7832878f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/miniunz.c
@@ -0,0 +1,508 @@
+#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 "unzip.h"
+
+#define CASESENSITIVITY (0)
+#define WRITEBUFFERSIZE (8192)
+
+/*
+  mini unzip, demo of unzip package
+
+  usage :
+  Usage : miniunz [-exvlo] file.zip [file_to_extract]
+
+  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(filename,dosdate,tmu_date)
+	const char *filename;
+	uLong dosdate;
+	tm_unz tmu_date;
+{
+#ifdef WIN32
+  HANDLE hFile;
+  FILETIME ftm,ftLocal,ftCreate,ftLastAcc,ftLastWrite;
+
+  hFile = CreateFile(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(dirname)
+	const char* dirname;
+{
+    int ret=0;
+#ifdef WIN32
+	ret = mkdir(dirname);
+#else
+#ifdef unix
+	ret = mkdir (dirname,0775);
+#endif
+#endif
+	return ret;
+}
+
+int makedir (newdir)
+    char *newdir;
+{
+  char *buffer ;
+  char *p;
+  int  len = strlen(newdir);  
+
+  if (len <= 0) 
+    return 0;
+
+  buffer = (char*)malloc(len+1);
+  strcpy(buffer,newdir);
+  
+  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 0.15, demo of zLib + Unz package written by Gilles Vollant\n");
+	printf("more info at http://wwww.winimage/zLibDll/unzip.htm\n\n");
+}
+
+void do_help()
+{	
+	printf("Usage : miniunz [-exvlo] file.zip [file_to_extract]\n\n") ;
+}
+
+
+int do_list(uf)
+	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;
+		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;
+
+		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 %7lu %3lu%%  %2.2lu-%2.2lu-%2.2lu  %2.2lu:%2.2lu  %8.8lx   %s\n",
+			    file_info.uncompressed_size,string_method,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(uf,popt_extract_without_path,popt_overwrite)
+	unzFile uf;
+	const int* popt_extract_without_path;
+    int* popt_overwrite;
+{
+	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 = unzOpenCurrentFile(uf);
+		if (err!=UNZ_OK)
+		{
+			printf("error %d with zipfile in unzOpenCurrentFile\n",err);
+		}
+
+		if (((*popt_overwrite)==0) && (err==UNZ_OK))
+		{
+			char rep;
+			FILE* ftestexist;
+			ftestexist = fopen(write_filename,"rb");
+			if (ftestexist!=NULL)
+			{
+				fclose(ftestexist);
+				do
+				{
+					char answer[128];
+					printf("The file %s exist. Overwrite ? [y]es, [n]o, [A]ll: ",write_filename);
+					scanf("%1s",answer);
+					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(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);
+			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(uf,opt_extract_without_path,opt_overwrite)
+	unzFile uf;
+	int opt_extract_without_path;
+    int opt_overwrite;
+{
+	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) != 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(uf,filename,opt_extract_without_path,opt_overwrite)
+	unzFile uf;
+	const char* filename;
+	int opt_extract_without_path;
+    int opt_overwrite;
+{
+    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) == UNZ_OK)
+        return 0;
+    else
+        return 1;
+}
+
+
+int main(argc,argv)
+	int argc;
+	char *argv[];
+{
+	const char *zipfilename=NULL;
+    const char *filename_to_extract=NULL;
+	int i;
+	int opt_do_list=0;
+	int opt_do_extract=1;
+	int opt_do_extract_withoutpath=0;
+	int opt_overwrite=0;
+	char filename_try[512];
+	unzFile uf=NULL;
+
+	do_banner();
+	if (argc==1)
+	{
+		do_help();
+		exit(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;
+				}
+			}
+			else
+            {
+				if (zipfilename == NULL)
+					zipfilename = argv[i];
+                else if (filename_to_extract==NULL)
+                        filename_to_extract = argv[i] ;
+            }
+		}
+	}
+
+	if (zipfilename!=NULL)
+	{
+		strcpy(filename_try,zipfilename);
+		uf = unzOpen(zipfilename);
+		if (uf==NULL)
+		{
+			strcat(filename_try,".zip");
+			uf = unzOpen(filename_try);
+		}
+	}
+
+	if (uf==NULL)
+	{
+		printf("Cannot open %s or %s.zip\n",zipfilename,zipfilename);
+		exit (1);
+	}
+    printf("%s opened\n",filename_try);
+
+	if (opt_do_list==1)
+		return do_list(uf);
+	else if (opt_do_extract==1)
+    {
+        if (filename_to_extract == NULL)
+		    return do_extract(uf,opt_do_extract_withoutpath,opt_overwrite);
+        else
+            return do_extract_onefile(uf,filename_to_extract,
+                                      opt_do_extract_withoutpath,opt_overwrite);
+    }
+	unzCloseCurrentFile(uf);
+
+	return 0;  /* to avoid warning */
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/minizip.c b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/minizip.c
new file mode 100644
index 00000000000..5e492d209b1
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/minizip.c
@@ -0,0 +1,302 @@
+#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"
+
+
+#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];
+    int len = strlen(f);
+    strcpy(name, f);
+    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 0.15, demo of zLib + Zip package written by Gilles Vollant\n");
+	printf("more info at http://wwww.winimage/zLibDll/unzip.htm\n\n");
+}
+
+void do_help()
+{	
+	printf("Usage : minizip [-o] file.zip [files_to_add]\n\n") ;
+}
+
+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];
+    int zipok;
+    int err=0;
+    int size_buf=0;
+    void* buf=NULL,
+
+
+	do_banner();
+	if (argc==1)
+	{
+		do_help();
+		exit(0);
+        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>='0') && (c<='9'))
+                        opt_compress_level = c-'0';
+				}
+			}
+			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 ;
+		strcpy(filename_try,argv[zipfilenamearg]);
+        len=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==0)
+            if (check_exist_file(filename_try)!=0)
+			{
+                char rep;
+				do
+				{
+					char answer[128];
+					printf("The file %s exist. Overwrite ? [y]es, [n]o : ",filename_try);
+					scanf("%1s",answer);
+					rep = answer[0] ;
+					if ((rep>='a') && (rep<='z'))
+						rep -= 0x20;
+				}
+				while ((rep!='Y') && (rep!='N'));
+                if (rep=='N')
+                    zipok = 0;
+			}
+    }
+
+    if (zipok==1)
+    {
+        zipFile zf;
+        int errclose;
+        zf = zipOpen(filename_try,0);
+        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]))!='/'))
+            {
+                FILE * fin;
+                int size_read;
+                const char* filenameinzip = argv[i];
+                zip_fileinfo zi;
+
+                zi.tmz_date.tm_sec = zi.tmz_date.tm_min = zi.tmz_date.tm_hour = 
+                zi.tmz_date.tm_mday = zi.tmz_date.tm_min = 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 (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 = 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));
+
+                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);
+   }
+
+    free(buf);
+    exit(0);
+	return 0;  /* to avoid warning */
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/readme.txt b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/readme.txt
new file mode 100644
index 00000000000..1fc023c720b
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/readme.txt
@@ -0,0 +1,37 @@
+
+UnZip 0.15 additionnal library
+
+
+  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, and old compression used by old 
+PKZip 1.x are not supported.
+
+See probdesc.zip from PKWare for specification of .ZIP format.
+
+What is Unzip
+  The Zlib library support the deflate compression and the creation of gzip (.gz) 
+file. Zlib is free and small.
+  The .Zip format, which can contain several compressed files (.gz can containt
+only one file) is a very popular format. This is why I've written a package for reading file compressed in Zipfile.
+
+Using Unzip package
+
+You need source of Zlib (get zlib111.zip and read zlib.h).
+Get unzlb015.zip and read unzip.h (whith documentation of unzip functions)
+
+The Unzip package is only two file : unzip.h and unzip.c. But it use the Zlib 
+  files.
+unztst.c is a simple sample program, which list file in a zipfile and display
+  README.TXT or FILE_ID.DIZ (if these files are found).
+miniunz.c is a mini unzip program.
+
+I'm also currenlyt writing a zipping portion (zip.h, zip.c and test with minizip.c)
+
+Please email me for feedback.
+I hope my source is compatible with Unix system, but I need your help for be sure
+
+Latest revision : Mar 04th, 1998
+
+Check http://www.winimage.com/zLibDll/unzip.html for up to date info.
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/unzip.c b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/unzip.c
new file mode 100644
index 00000000000..ff71a474da1
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/unzip.c
@@ -0,0 +1,1294 @@
+/* unzip.c -- IO on .zip files using zlib 
+   Version 0.15 beta, Mar 19th, 1998,
+
+   Read unzip.h for more info
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include "zlib.h"
+#include "unzip.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 */
+
+
+
+#if !defined(unix) && !defined(CASESENSITIVITYDEFAULT_YES) && \
+                      !defined(CASESENSITIVITYDEFAULT_NO)
+#define CASESENSITIVITYDEFAULT_NO
+#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)
+
+
+/* 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
+
+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;
+
+
+/* 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*/
+	FILE* 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)*/
+} file_in_zip_read_info_s;
+
+
+/* unz_s contain internal information about the zipfile
+*/
+typedef struct
+{
+	FILE* 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;
+
+
+/* ===========================================================================
+     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(fin,pi)
+	FILE *fin;
+	int *pi;
+{
+    unsigned char c;
+	int err = fread(&c, 1, 1, fin);
+    if (err==1)
+    {
+        *pi = (int)c;
+        return UNZ_OK;
+    }
+    else
+    {
+        if (ferror(fin)) 
+            return UNZ_ERRNO;
+        else
+            return UNZ_EOF;
+    }
+}
+
+
+/* ===========================================================================
+   Reads a long in LSB order from the given gz_stream. Sets 
+*/
+local int unzlocal_getShort (fin,pX)
+	FILE* 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;
+}
+
+local int unzlocal_getLong (fin,pX)
+	FILE* 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 */
+local int strcmpcasenosensitive_internal (fileName1,fileName2)
+	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 (fileName1,fileName2,iCaseSensitivity)
+	const char* fileName1;
+	const char* fileName2;
+	int iCaseSensitivity;
+{
+	if (iCaseSensitivity==0)
+		iCaseSensitivity=CASESENSITIVITYDEFAULTVALUE;
+
+	if (iCaseSensitivity==1)
+		return strcmp(fileName1,fileName2);
+
+	return STRCMPCASENOSENTIVEFUNCTION(fileName1,fileName2);
+} 
+
+#define BUFREADCOMMENT (0x400)
+
+/*
+  Locate the Central directory of a zipfile (at the end, just before
+    the global comment)
+*/
+local uLong unzlocal_SearchCentralDir(fin)
+	FILE *fin;
+{
+	unsigned char* buf;
+	uLong uSizeFile;
+	uLong uBackRead;
+	uLong uMaxBack=0xffff; /* maximum size of global comment */
+	uLong uPosFound=0;
+	
+	if (fseek(fin,0,SEEK_END) != 0)
+		return 0;
+
+
+	uSizeFile = ftell( fin );
+	
+	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 (fseek(fin,uReadPos,SEEK_SET)!=0)
+			break;
+
+		if (fread(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;
+	}
+	TRYFREE(buf);
+	return uPosFound;
+}
+
+/*
+  Open a Zip file. path contain the full pathname (by example,
+     on a Windows NT computer "c:\\test\\zlib109.zip" or on an Unix computer
+	 "zlib/zlib109.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 unzOpen (path)
+	const char *path;
+{
+	unz_s us;
+	unz_s *s;
+	uLong central_pos,uL;
+	FILE * fin ;
+
+	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;
+
+    fin=fopen(path,"rb");
+	if (fin==NULL)
+		return NULL;
+
+	central_pos = unzlocal_SearchCentralDir(fin);
+	if (central_pos==0)
+		err=UNZ_ERRNO;
+
+	if (fseek(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 */
+	if (unzlocal_getShort(fin,&number_disk)!=UNZ_OK)
+		err=UNZ_ERRNO;
+
+	/* number of the disk with the start of the central directory */
+	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 */
+	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<us.offset_central_dir+us.size_central_dir) && 
+		(err==UNZ_OK))
+		err=UNZ_BADZIPFILE;
+
+	if (err!=UNZ_OK)
+	{
+		fclose(fin);
+		return NULL;
+	}
+
+	us.file=fin;
+	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;
+	
+
+	s=(unz_s*)ALLOC(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. */
+extern int ZEXPORT unzClose (file)
+	unzFile file;
+{
+	unz_s* s;
+	if (file==NULL)
+		return UNZ_PARAMERROR;
+	s=(unz_s*)file;
+
+    if (s->pfile_in_zip_read!=NULL)
+        unzCloseCurrentFile(file);
+
+	fclose(s->file);
+	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 (file,pglobal_info)
+	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 (ulDosDate, ptm)
+    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 (file,
+                                              pfile_info,
+                                              pfile_info_internal,
+                                              szFileName, fileNameBufferSize,
+                                              extraField, extraFieldBufferSize,
+                                              szComment,  commentBufferSize)
+	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 (fseek(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 (fread(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 (fseek(s->file,lSeek,SEEK_CUR)==0)
+				lSeek=0;
+			else
+				err=UNZ_ERRNO;
+		if ((file_info.size_file_extra>0) && (extraFieldBufferSize>0))
+			if (fread(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 (fseek(s->file,lSeek,SEEK_CUR)==0)
+				lSeek=0;
+			else
+				err=UNZ_ERRNO;
+		if ((file_info.size_file_comment>0) && (commentBufferSize>0))
+			if (fread(szComment,(uInt)uSizeRead,1,s->file)!=1)
+				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 (file,
+                                                  pfile_info,
+                                                  szFileName, fileNameBufferSize,
+                                                  extraField, extraFieldBufferSize,
+                                                  szComment,  commentBufferSize)
+	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 (file)
+	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 (file)
+	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 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 (file, szFileName, iCaseSensitivity)
+	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)
+*/
+local int unzlocal_CheckCurrentFileCoherencyHeader (s,piSizeVar,
+													poffset_local_extrafield,
+													psize_local_extrafield)
+	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 (fseek(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.
+*/
+extern int ZEXPORT unzOpenCurrentFile (file)
+	unzFile file;
+{
+	int err=UNZ_OK;
+	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*)
+									    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;
+
+	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 ((s->cur_file_info.compression_method!=0) &&
+        (s->cur_file_info.compression_method!=Z_DEFLATED))
+		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, -MAX_WBITS);
+	  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->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
+  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  (file, buf, len)
+	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->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)
+				return UNZ_EOF;
+			if (fseek(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 (fread(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 = 
+                (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)
+		{
+			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 = 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);
+
+			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 (file)
+	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 (file)
+	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 (file,buf,len)
+	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 (fseek(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 (fread(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
+*/
+extern int ZEXPORT unzCloseCurrentFile (file)
+	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;
+	}
+
+
+	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 (file, szComment, uSizeBuf)
+	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 (fseek(s->file,s->central_pos+22,SEEK_SET)!=0)
+		return UNZ_ERRNO;
+
+	if (uReadThis>0)
+    {
+      *szComment='\0';
+	  if (fread(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;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/unzip.def b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/unzip.def
new file mode 100644
index 00000000000..f6ede89bc96
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/unzip.def
@@ -0,0 +1,15 @@
+	unzOpen                       @61
+	unzClose                      @62
+	unzGetGlobalInfo              @63
+	unzGetCurrentFileInfo         @64
+	unzGoToFirstFile              @65
+	unzGoToNextFile               @66
+	unzOpenCurrentFile            @67
+	unzReadCurrentFile            @68
+	unztell                       @70
+	unzeof                        @71
+	unzCloseCurrentFile           @72
+	unzGetGlobalComment           @73
+	unzStringFileNameCompare      @74
+	unzLocateFile                 @75
+	unzGetLocalExtrafield         @76
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/unzip.h b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/unzip.h
new file mode 100644
index 00000000000..76692cb703c
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/unzip.h
@@ -0,0 +1,275 @@
+/* unzip.h -- IO for uncompress .zip files using zlib 
+   Version 0.15 beta, Mar 19th, 1998,
+
+   Copyright (C) 1998 Gilles Vollant
+
+   This unzip package allow extract file from .ZIP file, compatible with PKZip 2.04g
+     WinZip, InfoZip tools and compatible.
+   Encryption and multi volume ZipFile (span) are not supported.
+   Old compressions used by old PKZip 1.x are not supported
+
+   THIS IS AN ALPHA VERSION. AT THIS STAGE OF DEVELOPPEMENT, SOMES API OR STRUCTURE
+   CAN CHANGE IN FUTURE VERSION !!
+   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 
+      ftp://ftp.cdrom.com/pub/infozip/doc/appnote-970311-iz.zip
+   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
+
+#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 NT computer "c:\\zlib\\zlib111.zip" or on an Unix computer
+	 "zlib/zlib111.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 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
+*/
+
+
+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 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
+*/
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* _unz_H */
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zip.c b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zip.c
new file mode 100644
index 00000000000..0cae64ab7b1
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zip.c
@@ -0,0 +1,718 @@
+/* zip.c -- IO on .zip files using zlib 
+   Version 0.15 beta, Mar 19th, 1998,
+
+   Read zip.h for more info
+*/
+
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.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
+
+const char zip_copyright[] =
+   " zip 0.15 Copyright 1998 Gilles Vollant ";
+
+
+#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.*/
+    Byte buffered_data[Z_BUFSIZE];/* buffer contain compressed data to be writ*/
+    uLong dosDate;
+    uLong crc32;
+} curfile_info;
+
+typedef struct
+{
+    FILE * filezip;
+    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 number_entry;
+} zip_internal;
+
+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;
+}
+
+
+local int write_datablock(fout,ll)
+    FILE * fout;
+    linkedlist_data* ll;    
+{
+    linkedlist_datablock_internal* ldi;
+    ldi = ll->first_block;
+    while (ldi!=NULL)
+    {
+        if (ldi->filled_in_this_block > 0)
+            if (fwrite(ldi->data,(uInt)ldi->filled_in_this_block,1,fout)!=1)
+                return ZIP_ERRNO;
+        ldi = ldi->next_datablock;
+    }
+    return ZIP_OK;
+}
+
+/****************************************************************************/
+
+/* ===========================================================================
+   Outputs a long in LSB order to the given file
+   nbByte == 1, 2 or 4 (byte, short or long)
+*/
+
+local int ziplocal_putValue OF((FILE *file, uLong x, int nbByte));
+local int ziplocal_putValue (file, x, nbByte)
+    FILE *file;
+    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 (fwrite(buf,nbByte,1,file)!=1)
+        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;
+    }
+}
+/****************************************************************************/
+
+
+local uLong ziplocal_TmzDateToDosDate(ptm,dosDate)
+    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));
+}
+
+
+/****************************************************************************/
+
+extern zipFile ZEXPORT zipOpen (pathname, append)
+    const char *pathname;
+    int append;
+{
+    zip_internal ziinit;
+    zip_internal* zi;
+
+    ziinit.filezip = fopen(pathname,(append == 0) ? "wb" : "ab");
+    if (ziinit.filezip == NULL)
+        return NULL;
+    ziinit.begin_pos = ftell(ziinit.filezip);
+    ziinit.in_opened_file_inzip = 0;
+    ziinit.ci.stream_initialised = 0;
+    ziinit.number_entry = 0;
+    init_linkedlist(&(ziinit.central_dir));
+
+
+    zi = (zip_internal*)ALLOC(sizeof(zip_internal));
+    if (zi==NULL)
+    {
+        fclose(ziinit.filezip);
+        return NULL;
+    }
+
+    *zi = ziinit;
+    return (zipFile)zi;
+}
+
+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;
+{
+    zip_internal* zi;
+    uInt size_filename;
+    uInt size_comment;
+    uInt i;
+    int err = ZIP_OK;
+
+    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 = strlen(comment);
+
+    size_filename = 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;
+
+    zi->ci.crc32 = 0;
+    zi->ci.method = method;
+    zi->ci.stream_initialised = 0;
+    zi->ci.pos_in_buffered_data = 0;
+    zi->ci.pos_local_header = ftell(zi->filezip);
+    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,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) = *(filename+i);
+    if (zi->ci.central_header == NULL)
+        return ZIP_INTERNALERROR;
+
+    /* write the local header */
+    err = ziplocal_putValue(zi->filezip,(uLong)LOCALHEADERMAGIC,4);
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(zi->filezip,(uLong)20,2);/* version needed to extract */
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(zi->filezip,(uLong)zi->ci.flag,2);
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(zi->filezip,(uLong)zi->ci.method,2);
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(zi->filezip,(uLong)zi->ci.dosDate,4);
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(zi->filezip,(uLong)0,4); /* crc 32, unknown */
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(zi->filezip,(uLong)0,4); /* compressed size, unknown */
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(zi->filezip,(uLong)0,4); /* uncompressed size, unknown */
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(zi->filezip,(uLong)size_filename,2);
+
+    if (err==ZIP_OK)
+        err = ziplocal_putValue(zi->filezip,(uLong)size_extrafield_local,2);
+
+    if ((err==ZIP_OK) && (size_filename>0))
+        if (fwrite(filename,(uInt)size_filename,1,zi->filezip)!=1)
+                err = ZIP_ERRNO;
+
+    if ((err==ZIP_OK) && (size_extrafield_local>0))
+        if (fwrite(extrafield_local,(uInt)size_extrafield_local,1,zi->filezip)
+                                                                           !=1)
+                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.stream.zalloc = (alloc_func)0;
+        zi->ci.stream.zfree = (free_func)0;
+        zi->ci.stream.opaque = (voidpf)0;
+
+        err = deflateInit2(&zi->ci.stream, level,
+               Z_DEFLATED, -MAX_WBITS, DEF_MEM_LEVEL, 0);
+
+        if (err==Z_OK)
+            zi->ci.stream_initialised = 1;
+    }
+
+
+    if (err==Z_OK)
+        zi->in_opened_file_inzip = 1;
+    return err;
+}
+
+extern int ZEXPORT zipWriteInFileInZip (file, buf, len)
+    zipFile file;
+    const voidp 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 = 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 (fwrite(zi->ci.buffered_data,(uInt)zi->ci.pos_in_buffered_data,1,zi->filezip)
+                                                                           !=1)
+                err = ZIP_ERRNO;
+            zi->ci.pos_in_buffered_data = 0;
+            zi->ci.stream.avail_out = (uInt)Z_BUFSIZE;
+            zi->ci.stream.next_out = zi->ci.buffered_data;
+        }
+
+        if (zi->ci.method == Z_DEFLATED)
+        {
+            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 0;
+}
+
+extern int ZEXPORT zipCloseFileInZip (file)
+    zipFile file;
+{
+    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.avail_in = 0;
+    
+    if (zi->ci.method == Z_DEFLATED)
+        while (err==ZIP_OK)
+    {
+        uLong uTotalOutBefore;
+        if (zi->ci.stream.avail_out == 0)
+        {
+            if (fwrite(zi->ci.buffered_data,(uInt)zi->ci.pos_in_buffered_data,1,zi->filezip)
+                                                                           !=1)
+                err = ZIP_ERRNO;
+            zi->ci.pos_in_buffered_data = 0;
+            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 (fwrite(zi->ci.buffered_data,(uInt)zi->ci.pos_in_buffered_data,1,zi->filezip)
+                                                                       !=1)
+            err = ZIP_ERRNO;
+
+    if ((zi->ci.method == Z_DEFLATED) && (err==ZIP_OK))
+    {
+        err=deflateEnd(&zi->ci.stream);
+        zi->ci.stream_initialised = 0;
+    }
+
+    ziplocal_putValue_inmemory(zi->ci.central_header+16,(uLong)zi->ci.crc32,4); /*crc*/
+    ziplocal_putValue_inmemory(zi->ci.central_header+20,
+                                (uLong)zi->ci.stream.total_out,4); /*compr size*/
+    ziplocal_putValue_inmemory(zi->ci.central_header+24,
+                                (uLong)zi->ci.stream.total_in,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 = ftell(zi->filezip);
+	    if (fseek(zi->filezip,
+                  zi->ci.pos_local_header + 14,SEEK_SET)!=0)
+		    err = ZIP_ERRNO;
+
+        if (err==ZIP_OK)
+            err = ziplocal_putValue(zi->filezip,(uLong)zi->ci.crc32,4); /* crc 32, unknown */
+
+        if (err==ZIP_OK) /* compressed size, unknown */
+            err = ziplocal_putValue(zi->filezip,(uLong)zi->ci.stream.total_out,4); 
+
+        if (err==ZIP_OK) /* uncompressed size, unknown */
+            err = ziplocal_putValue(zi->filezip,(uLong)zi->ci.stream.total_in,4);
+
+	    if (fseek(zi->filezip,
+                  cur_pos_inzip,SEEK_SET)!=0)
+		    err = ZIP_ERRNO;
+    }
+
+    zi->number_entry ++;
+    zi->in_opened_file_inzip = 0;
+
+    return err;
+}
+
+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);
+    }
+
+    if (global_comment==NULL)
+        size_global_comment = 0;
+    else
+        size_global_comment = strlen(global_comment);
+
+
+    centraldir_pos_inzip = ftell(zi->filezip);
+    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 (fwrite(ldi->data,(uInt)ldi->filled_in_this_block,
+                                        1,zi->filezip) !=1 )
+                    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->filezip,(uLong)ENDHEADERMAGIC,4);
+
+    if (err==ZIP_OK) /* number of this disk */
+        err = ziplocal_putValue(zi->filezip,(uLong)0,2);
+
+    if (err==ZIP_OK) /* number of the disk with the start of the central directory */
+        err = ziplocal_putValue(zi->filezip,(uLong)0,2);
+
+    if (err==ZIP_OK) /* total number of entries in the central dir on this disk */
+        err = ziplocal_putValue(zi->filezip,(uLong)zi->number_entry,2);
+
+    if (err==ZIP_OK) /* total number of entries in the central dir */
+        err = ziplocal_putValue(zi->filezip,(uLong)zi->number_entry,2);
+
+    if (err==ZIP_OK) /* size of the central directory */
+        err = ziplocal_putValue(zi->filezip,(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->filezip,(uLong)centraldir_pos_inzip ,4);
+
+    if (err==ZIP_OK) /* zipfile comment length */
+        err = ziplocal_putValue(zi->filezip,(uLong)size_global_comment,2);
+
+    if ((err==ZIP_OK) && (size_global_comment>0))
+        if (fwrite(global_comment,(uInt)size_global_comment,1,zi->filezip) !=1 )
+                err = ZIP_ERRNO;
+    fclose(zi->filezip);
+    TRYFREE(zi);
+
+    return err;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zip.def b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zip.def
new file mode 100644
index 00000000000..5d5079fbcee
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zip.def
@@ -0,0 +1,5 @@
+	zipOpen                       @80
+	zipOpenNewFileInZip           @81
+	zipWriteInFileInZip           @82
+	zipCloseFileInZip             @83
+	zipClose                      @84
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zip.h b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zip.h
new file mode 100644
index 00000000000..678260b330b
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zip.h
@@ -0,0 +1,150 @@
+/* zip.h -- IO for compress .zip files using zlib 
+   Version 0.15 alpha, Mar 19th, 1998,
+
+   Copyright (C) 1998 Gilles Vollant
+
+   This unzip package allow creates .ZIP file, compatible with PKZip 2.04g
+     WinZip, InfoZip tools and compatible.
+   Encryption and multi volume ZipFile (span) are not supported.
+   Old compressions used by old PKZip 1.x are not supported
+
+  For uncompress .zip file, look at unzip.h
+
+   THIS IS AN ALPHA VERSION. AT THIS STAGE OF DEVELOPPEMENT, SOMES API OR STRUCTURE
+   CAN CHANGE IN FUTURE VERSION !!
+   I WAIT FEEDBACK at mail info@winimage.com
+   Visit also http://www.winimage.com/zLibDll/zip.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 
+      ftp://ftp.cdrom.com/pub/infozip/doc/appnote-970311-iz.zip
+   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
+
+#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_ERRNO               (Z_ERRNO)
+#define ZIP_PARAMERROR                  (-102)
+#define ZIP_INTERNALERROR               (-104)
+
+/* 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;
+
+extern zipFile ZEXPORT zipOpen OF((const char *pathname, int append));
+/*
+  Create a zipfile.
+	 pathname contain on Windows NT a filename like "c:\\zlib\\zlib111.zip" or on
+	   an Unix computer "zlib/zlib111.zip".
+	 if the file pathname exist and append=1, the zip will be created at the end
+	   of the file. (useful if the file contain a self extractor code)
+	 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.
+
+
+*/
+
+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 zipWriteInFileInZip OF((zipFile file,
+					   const voidp 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 zipClose OF((zipFile file,
+				const char* global_comment));
+/*
+  Close the zipfile
+*/
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif /* _zip_H */
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zlibvc.def b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zlibvc.def
new file mode 100644
index 00000000000..7e9d60d55d9
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zlibvc.def
@@ -0,0 +1,74 @@
+LIBRARY		"zlib"
+
+DESCRIPTION	'"""zlib data compression library"""'
+
+
+VERSION		1.11
+
+
+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
+
+	unzOpen                       @61
+	unzClose                      @62
+	unzGetGlobalInfo              @63
+	unzGetCurrentFileInfo         @64
+	unzGoToFirstFile              @65
+	unzGoToNextFile               @66
+	unzOpenCurrentFile            @67
+	unzReadCurrentFile            @68
+	unztell                       @70
+	unzeof                        @71
+	unzCloseCurrentFile           @72
+	unzGetGlobalComment           @73
+	unzStringFileNameCompare      @74
+	unzLocateFile                 @75
+	unzGetLocalExtrafield         @76
+
+	zipOpen                       @80
+	zipOpenNewFileInZip           @81
+	zipWriteInFileInZip           @82
+	zipCloseFileInZip             @83
+	zipClose                      @84
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zlibvc.dsp b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zlibvc.dsp
new file mode 100644
index 00000000000..a70d4d4a6b0
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zlibvc.dsp
@@ -0,0 +1,651 @@
+# Microsoft Developer Studio Project File - Name="zlibvc" - Package Owner=<4>
+# Microsoft Developer Studio Generated Build File, Format Version 5.00
+# ** DO NOT EDIT **
+
+# TARGTYPE "Win32 (x86) Dynamic-Link Library" 0x0102
+# TARGTYPE "Win32 (ALPHA) Dynamic-Link Library" 0x0602
+
+CFG=zlibvc - Win32 Release
+!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 "zlibvc.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 "zlibvc.mak" CFG="zlibvc - Win32 Release"
+!MESSAGE 
+!MESSAGE Possible choices for configuration are:
+!MESSAGE 
+!MESSAGE "zlibvc - Win32 Release" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "zlibvc - Win32 Debug" (based on "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "zlibvc - Win32 ReleaseAxp" (based on\
+ "Win32 (ALPHA) Dynamic-Link Library")
+!MESSAGE "zlibvc - Win32 ReleaseWithoutAsm" (based on\
+ "Win32 (x86) Dynamic-Link Library")
+!MESSAGE "zlibvc - Win32 ReleaseWithoutCrtdll" (based on\
+ "Win32 (x86) Dynamic-Link Library")
+!MESSAGE 
+
+# Begin Project
+# PROP Scc_ProjName ""
+# PROP Scc_LocalPath ""
+
+!IF  "$(CFG)" == "zlibvc - 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 ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /YX /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /D "ASMV" /FAcs /FR /FD /c
+# SUBTRACT CPP /YX
+MTL=midl.exe
+# ADD BASE MTL /nologo /D "NDEBUG" /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+RSC=rc.exe
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /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 gvmat32.obj kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib crtdll.lib /nologo /subsystem:windows /dll /map /machine:I386 /nodefaultlib /out:".\Release\zlib.dll"
+# SUBTRACT LINK32 /pdb:none
+
+!ELSEIF  "$(CFG)" == "zlibvc - 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 Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MTd /W3 /Gm /GX /Zi /Od /D "WIN32" /D "_DEBUG" /D "_WINDOWS" /YX /c
+# ADD CPP /nologo /MTd /W3 /Gm /GX /Zi /Od /D "_DEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /FD /c
+# SUBTRACT CPP /YX
+MTL=midl.exe
+# ADD BASE MTL /nologo /D "_DEBUG" /win32
+# ADD MTL /nologo /D "_DEBUG" /mktyplib203 /win32
+RSC=rc.exe
+# ADD BASE RSC /l 0x40c /d "_DEBUG"
+# ADD RSC /l 0x40c /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
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib /nologo /subsystem:windows /dll /debug /machine:I386 /out:".\Debug\zlib.dll"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "zlibvc__"
+# PROP BASE Intermediate_Dir "zlibvc__"
+# PROP BASE Ignore_Export_Lib 0
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "zlibvc__"
+# PROP Intermediate_Dir "zlibvc__"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+MTL=midl.exe
+# ADD BASE MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+# ADD MTL /nologo /D "NDEBUG" /mktyplib203 /win32
+CPP=cl.exe
+# ADD BASE CPP /nologo /MT /Gt0 /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /FAcs /FR /YX /FD /c
+# ADD CPP /nologo /MT /Gt0 /W3 /GX /O2 /D "WIN32" /D "NDEBUG" /D "_WINDOWS" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /FAcs /FR /FD /c
+# SUBTRACT CPP /YX
+RSC=rc.exe
+# ADD BASE RSC /l 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 crtdll.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib /nologo /subsystem:windows /dll /map /machine:ALPHA /nodefaultlib /out:".\Release\zlib.dll"
+# SUBTRACT BASE LINK32 /pdb:none
+# ADD LINK32 crtdll.lib kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib /nologo /subsystem:windows /dll /map /machine:ALPHA /nodefaultlib /out:"zlibvc__\zlib.dll"
+# SUBTRACT LINK32 /pdb:none
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "zlibvc_0"
+# PROP BASE Intermediate_Dir "zlibvc_0"
+# PROP BASE Ignore_Export_Lib 0
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "zlibvc_0"
+# PROP Intermediate_Dir "zlibvc_0"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /FAcs /FR /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /FAcs /FR /FD /c
+# SUBTRACT CPP /YX
+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 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /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 crtdll.lib /nologo /subsystem:windows /dll /map /machine:I386 /nodefaultlib /out:".\Release\zlib.dll"
+# SUBTRACT BASE LINK32 /pdb:none
+# ADD LINK32 kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib crtdll.lib /nologo /subsystem:windows /dll /map /machine:I386 /nodefaultlib /out:".\zlibvc_0\zlib.dll"
+# SUBTRACT LINK32 /pdb:none
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+# PROP BASE Use_MFC 0
+# PROP BASE Use_Debug_Libraries 0
+# PROP BASE Output_Dir "zlibvc_1"
+# PROP BASE Intermediate_Dir "zlibvc_1"
+# PROP BASE Ignore_Export_Lib 0
+# PROP BASE Target_Dir ""
+# PROP Use_MFC 0
+# PROP Use_Debug_Libraries 0
+# PROP Output_Dir "zlibvc_1"
+# PROP Intermediate_Dir "zlibvc_1"
+# PROP Ignore_Export_Lib 0
+# PROP Target_Dir ""
+CPP=cl.exe
+# ADD BASE CPP /nologo /MT /W3 /GX /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /D "ASMV" /FAcs /FR /YX /FD /c
+# ADD CPP /nologo /MT /W3 /GX /O2 /D "NDEBUG" /D "WIN32" /D "_WINDOWS" /D "_WINDLL" /D "_WIN32" /D "BUILD_ZLIBDLL" /D "ZLIB_DLL" /D "DYNAMIC_CRC_TABLE" /D "ASMV" /FAcs /FR /FD /c
+# SUBTRACT CPP /YX
+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 0x40c /d "NDEBUG"
+# ADD RSC /l 0x40c /d "NDEBUG"
+BSC32=bscmake.exe
+# ADD BASE BSC32 /nologo
+# ADD BSC32 /nologo
+LINK32=link.exe
+# ADD BASE LINK32 gvmat32.obj kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib crtdll.lib /nologo /subsystem:windows /dll /map /machine:I386 /nodefaultlib /out:".\Release\zlib.dll"
+# SUBTRACT BASE LINK32 /pdb:none
+# ADD LINK32 gvmat32.obj kernel32.lib user32.lib gdi32.lib winspool.lib comdlg32.lib advapi32.lib shell32.lib ole32.lib oleaut32.lib uuid.lib crtdll.lib /nologo /subsystem:windows /dll /map /machine:I386 /nodefaultlib /out:".\zlibvc_1\zlib.dll"
+# SUBTRACT LINK32 /pdb:none
+
+!ENDIF 
+
+# Begin Target
+
+# Name "zlibvc - Win32 Release"
+# Name "zlibvc - Win32 Debug"
+# Name "zlibvc - Win32 ReleaseAxp"
+# Name "zlibvc - Win32 ReleaseWithoutAsm"
+# Name "zlibvc - Win32 ReleaseWithoutCrtdll"
+# Begin Group "Source Files"
+
+# PROP Default_Filter "cpp;c;cxx;rc;def;r;odl;hpj;bat;for;f90"
+# Begin Source File
+
+SOURCE=.\adler32.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_ADLER=\
+	".\zconf.h"\
+	".\zlib.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\compress.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_COMPR=\
+	".\zconf.h"\
+	".\zlib.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\crc32.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_CRC32=\
+	".\zconf.h"\
+	".\zlib.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\deflate.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_DEFLA=\
+	".\deflate.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\gvmat32c.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\gzio.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_GZIO_=\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\infblock.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFBL=\
+	".\infblock.h"\
+	".\infcodes.h"\
+	".\inftrees.h"\
+	".\infutil.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\infcodes.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFCO=\
+	".\infblock.h"\
+	".\infcodes.h"\
+	".\inffast.h"\
+	".\inftrees.h"\
+	".\infutil.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\inffast.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFFA=\
+	".\infblock.h"\
+	".\infcodes.h"\
+	".\inffast.h"\
+	".\inftrees.h"\
+	".\infutil.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\inflate.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFLA=\
+	".\infblock.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\inftrees.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFTR=\
+	".\inftrees.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\infutil.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_INFUT=\
+	".\infblock.h"\
+	".\infcodes.h"\
+	".\inftrees.h"\
+	".\infutil.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\trees.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_TREES=\
+	".\deflate.h"\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\uncompr.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_UNCOM=\
+	".\zconf.h"\
+	".\zlib.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\unzip.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\zip.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlib.rc
+# End Source File
+# Begin Source File
+
+SOURCE=.\zlibvc.def
+# End Source File
+# Begin Source File
+
+SOURCE=.\zutil.c
+
+!IF  "$(CFG)" == "zlibvc - Win32 Release"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 Debug"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseAxp"
+
+DEP_CPP_ZUTIL=\
+	".\zconf.h"\
+	".\zlib.h"\
+	".\zutil.h"\
+	
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutAsm"
+
+!ELSEIF  "$(CFG)" == "zlibvc - Win32 ReleaseWithoutCrtdll"
+
+!ENDIF 
+
+# End Source File
+# End Group
+# Begin Group "Header Files"
+
+# PROP Default_Filter "h;hpp;hxx;hm;inl;fi;fd"
+# Begin Source File
+
+SOURCE=.\deflate.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\infblock.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\infcodes.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\inffast.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\inftrees.h
+# End Source File
+# Begin Source File
+
+SOURCE=.\infutil.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;cnt;rtf;gif;jpg;jpeg;jpe"
+# End Group
+# End Target
+# End Project
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zlibvc.dsw b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zlibvc.dsw
new file mode 100644
index 00000000000..493cd870365
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/minizip/zlibvc.dsw
@@ -0,0 +1,41 @@
+Microsoft Developer Studio Workspace File, Format Version 5.00
+# WARNING: DO NOT EDIT OR DELETE THIS WORKSPACE FILE!
+
+###############################################################################
+
+Project: "zlibstat"=.\zlibstat.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Project: "zlibvc"=.\zlibvc.dsp - Package Owner=<4>
+
+Package=<5>
+{{{
+}}}
+
+Package=<4>
+{{{
+}}}
+
+###############################################################################
+
+Global:
+
+Package=<5>
+{{{
+}}}
+
+Package=<3>
+{{{
+}}}
+
+###############################################################################
+
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/untgz/Makefile b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/untgz/Makefile
new file mode 100644
index 00000000000..409b4bdeaae
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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 ../..; make
+
+clean:
+	rm -f untgz untgz.o *~
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/untgz/makefile.w32 b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/untgz/makefile.w32
new file mode 100644
index 00000000000..c99dc28cf55
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/untgz/makefile.w32
@@ -0,0 +1,63 @@
+# Makefile for zlib.  Modified for mingw32
+# For conditions of distribution and use, see copyright notice in zlib.h 
+
+# To compile, 
+# 
+#   make -fmakefile.w32
+# 
+
+CC=gcc
+
+# Generate dependencies (see end of the file)
+
+CPPFLAGS=-MMD 
+
+#CFLAGS=-MMD -O
+#CFLAGS=-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7
+#CFLAGS=-MMD -g -DDEBUG
+CFLAGS=-O3 $(BUTT) -Wall -Wwrite-strings -Wpointer-arith -Wconversion \
+             -Wstrict-prototypes -Wmissing-prototypes
+
+# If cp.exe is not found, replace with copy /Y .
+CP=cp -f
+
+# The default value of RM is "rm -f."  
+# If "rm.exe" is not found, uncomment:
+# RM=del
+
+LD=gcc
+LDLIBS=-L. -lz
+LDFLAGS=-s
+
+
+INCL=zlib.h zconf.h
+LIBS=libz.a
+
+AR=ar rcs
+
+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 = minigzip.o untgz.o
+
+all: minigzip.exe untgz.exe
+
+rebuild:	clean	all
+
+libz.a: $(OBJS)
+	$(AR) $@ $(OBJS)
+
+%.exe : %.o $(LIBS)
+	$(LD) $(LDFLAGS) -o $@ $< $(LDLIBS)
+
+.PHONY : clean
+
+clean:
+	$(RM) *.d *.o *.exe libz.a foo.gz
+
+DEPS := $(wildcard *.d)
+ifneq ($(DEPS),)
+include $(DEPS)
+endif
+
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/contrib/untgz/untgz.c b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/untgz/untgz.c
new file mode 100644
index 00000000000..4a431ff3163
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/untgz/untgz.c
@@ -0,0 +1,522 @@
+/*
+ * untgz.c -- Display contents and/or extract file from
+ * a gzip'd TAR file
+ * written by "Pedro A. Aranda Guti\irrez" <paag@tid.es>
+ * adaptation to Unix by Jean-loup Gailly <jloup@gzip.org>
+ */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include <string.h>
+#include <time.h>
+#include <errno.h>
+#include <fcntl.h>
+#ifdef unix
+# include <unistd.h>
+#else
+# include <direct.h>
+# include <io.h>
+#endif
+
+#include "zlib.h"
+
+#ifdef WIN32
+#  ifndef F_OK
+#    define F_OK (0)
+#  endif
+#  ifdef _MSC_VER
+#    define mkdir(dirname,mode) _mkdir(dirname)
+#    define strdup(str)         _strdup(str)
+#    define unlink(fn)          _unlink(fn)
+#    define access(path,mode)   _access(path,mode)
+#  else
+#    define mkdir(dirname,mode) _mkdir(dirname)
+#  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 */
+
+#define BLOCKSIZE 512
+
+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;
+};
+
+enum { TGZ_EXTRACT = 0, TGZ_LIST };
+
+static char *TGZfname	OF((const char *));
+void TGZnotfound	OF((const char *));
+
+int getoct		OF((char *, int));
+char *strtime		OF((time_t *));
+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;
+
+/* This will give a benign warning */
+
+static char *TGZprefix[] = { "\0", ".tgz", ".tar.gz", ".tar", NULL };
+
+/* Return the real name of the TGZ archive */
+/* or NULL if it does not exist. */
+
+static char *TGZfname OF((const char *fname))
+{
+  static char buffer[1024];
+  int origlen,i;
+  
+  strcpy(buffer,fname);
+  origlen = strlen(buffer);
+
+  for (i=0; TGZprefix[i]; i++)
+    {
+       strcpy(buffer+origlen,TGZprefix[i]);
+       if (access(buffer,F_OK) == 0)
+         return buffer;
+    }
+  return NULL;
+}
+
+/* error message for the filename */
+
+void TGZnotfound OF((const char *fname))
+{
+  int i;
+
+  fprintf(stderr,"%s : couldn't find ",prog);
+  for (i=0;TGZprefix[i];i++)
+    fprintf(stderr,(TGZprefix[i+1]) ? "%s%s, " : "or %s%s\n",
+            fname,
+            TGZprefix[i]);
+  exit(1);
+}
+
+
+/* help functions */
+
+int getoct(char *p,int width)
+{
+  int result = 0;
+  char c;
+  
+  while (width --)
+    {
+      c = *p++;
+      if (c == ' ')
+	continue;
+      if (c == 0)
+	break;
+      result = result * 8 + (c - '0');
+    }
+  return result;
+}
+
+char *strtime (time_t *t)
+{
+  struct tm   *local;
+  static char result[32];
+
+  local = localtime(t);
+  sprintf(result,"%2d/%02d/%4d %02d:%02d:%02d",
+	  local->tm_mday, local->tm_mon+1, local->tm_year+1900,
+	  local->tm_hour, local->tm_min,   local->tm_sec);
+  return result;
+}
+
+
+/* regular expression matching */
+
+#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 make directory */
+/* abort if you get an ENOENT errno somewhere in the middle */
+/* e.g. ignore error "mkdir on existing directory" */
+/* */
+/* 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, 0775) == 0)
+    {
+      free(buffer);
+      return 1;
+    }
+
+  p = buffer+1;
+  while (1)
+    {
+      char hold;
+      
+      while(*p && *p != '\\' && *p != '/')
+	p++;
+      hold = *p;
+      *p = 0;
+      if ((mkdir(buffer, 0775) == -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];
+  time_t tartime;
+  
+  if (action == TGZ_LIST)
+    printf("     day      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)
+	error("gzread: incomplete block read");
+      
+      /*
+       * 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;
+
+	  tartime = (time_t)getoct(buffer.header.mtime,12);
+	  strcpy(fname,buffer.header.name);
+	  
+	  switch (buffer.header.typeflag)
+	    {
+	    case DIRTYPE:
+	      if (action == TGZ_LIST)
+		printf(" %s     <dir> %s\n",strtime(&tartime),fname);
+	      if (action == TGZ_EXTRACT)
+		makedir(fname);
+	      break;
+	    case REGTYPE:
+	    case AREGTYPE:
+	      remaining = getoct(buffer.header.size,12);
+	      if (action == TGZ_LIST)
+		printf(" %s %9d %s\n",strtime(&tartime),remaining,fname);
+	      if (action == TGZ_EXTRACT)
+		{
+		  if ((remaining) && (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");
+			}
+		      }
+		      fprintf(stderr,
+			      "%s %s\n",
+			      (outfile) ? "Extracting" : "Couldn't create",
+			      fname);
+		    }
+		  else
+		    outfile = NULL;
+		}
+	      /*
+	       * could have no contents
+	       */
+	      getheader = (remaining) ? 0 : 1;
+	      break;
+	    default:
+	      if (action == TGZ_LIST)
+		printf(" %s     <---> %s\n",strtime(&tartime),fname);
+	      break;
+	    }
+	}
+      else
+	{
+	  unsigned int bytes = (remaining > BLOCKSIZE) ? BLOCKSIZE : remaining;
+
+	  if ((action == TGZ_EXTRACT) && (outfile != NULL))
+	    {
+	      if (fwrite(&buffer,sizeof(char),bytes,outfile) != bytes)
+		{
+		  fprintf(stderr,"%s : error writing %s skipping...\n",prog,fname);
+		  fclose(outfile);
+		  unlink(fname);
+		}
+	    }
+	  remaining -= bytes;
+	  if (remaining == 0)
+	    {
+	      getheader = 1;
+	      if ((action == TGZ_EXTRACT) && (outfile != NULL))
+		{
+#ifdef WIN32
+		  HANDLE hFile;
+		  FILETIME ftm,ftLocal;
+		  SYSTEMTIME st;
+		  struct tm localt;
+ 
+		  fclose(outfile);
+
+		  localt = *localtime(&tartime);
+
+		  hFile = CreateFile(fname, GENERIC_READ | GENERIC_WRITE,
+				     0, NULL, OPEN_EXISTING, 0, NULL);
+		  
+		  st.wYear = (WORD)localt.tm_year+1900;
+		  st.wMonth = (WORD)localt.tm_mon;
+		  st.wDayOfWeek = (WORD)localt.tm_wday;
+		  st.wDay = (WORD)localt.tm_mday;
+		  st.wHour = (WORD)localt.tm_hour;
+		  st.wMinute = (WORD)localt.tm_min;
+		  st.wSecond = (WORD)localt.tm_sec;
+		  st.wMilliseconds = 0;
+		  SystemTimeToFileTime(&st,&ftLocal);
+		  LocalFileTimeToFileTime(&ftLocal,&ftm);
+		  SetFileTime(hFile,&ftm,NULL,&ftm);
+		  CloseHandle(hFile);
+
+		  outfile = NULL;
+#else
+		  struct utimbuf settime;
+
+		  settime.actime = settime.modtime = tartime;
+
+		  fclose(outfile);
+		  outfile = NULL;
+		  utime(fname,&settime);
+#endif
+		}
+	    }
+	}
+    }
+  
+  if (gzclose(in) != Z_OK)
+    error("failed gzclose");
+
+  return 0;
+}
+
+
+/* =========================================================== */
+
+void help(int exitval)
+{
+  fprintf(stderr,
+	  "untgz v 0.1\n"
+	  " an sample application of zlib 1.0.4\n\n"
+          "Usage : untgz TGZfile            to extract all files\n"
+          "        untgz TGZfile fname ...  to extract selected files\n"
+          "        untgz -l TGZfile         to list archive contents\n"
+          "        untgz -h                 to display this help\n\n");
+  exit(exitval);
+}
+
+void error(const char *msg)
+{
+    fprintf(stderr, "%s: %s\n", prog, msg);
+    exit(1);
+}
+
+
+/* ====================================================================== */
+
+int _CRT_glob = 0;	/* disable globbing of the arguments */
+
+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/contrib/vmap_extractor_v2/stormlib/zlib/contrib/visual-basic.txt b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/visual-basic.txt
new file mode 100644
index 00000000000..10fb44bc593
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/contrib/visual-basic.txt
@@ -0,0 +1,69 @@
+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
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/crc32.c b/contrib/vmap_extractor_v2/stormlib/zlib/crc32.c
new file mode 100644
index 00000000000..60deca2ddf4
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/crc32.c
@@ -0,0 +1,162 @@
+/* crc32.c -- compute the CRC-32 of a data stream
+ * Copyright (C) 1995-2002 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+/* @(#) $Id$ */
+
+#include "zlib.h"
+
+#define local static
+
+#ifdef DYNAMIC_CRC_TABLE
+
+local int crc_table_empty = 1;
+local uLongf crc_table[256];
+local void make_crc_table OF((void));
+
+/*
+  Generate a table 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 table is simply the CRC of all possible eight bit values.  This is all
+  the information needed to generate CRC's on data a byte at a time for all
+  combinations of CRC register values and incoming bytes.
+*/
+local void make_crc_table()
+{
+  uLong c;
+  int n, k;
+  uLong poly;            /* polynomial exclusive-or pattern */
+  /* terms of polynomial defining this crc (except x^32): */
+  static const Byte p[] = {0,1,2,4,5,7,8,10,11,12,16,22,23,26};
+
+  /* make exclusive-or pattern from polynomial (0xedb88320L) */
+  poly = 0L;
+  for (n = 0; n < sizeof(p)/sizeof(Byte); n++)
+    poly |= 1L << (31 - p[n]);
+ 
+  for (n = 0; n < 256; n++)
+  {
+    c = (uLong)n;
+    for (k = 0; k < 8; k++)
+      c = c & 1 ? poly ^ (c >> 1) : c >> 1;
+    crc_table[n] = c;
+  }
+  crc_table_empty = 0;
+}
+#else
+/* ========================================================================
+ * Table of CRC-32's of all single-byte values (made by make_crc_table)
+ */
+local const uLongf 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
+};
+#endif
+
+/* =========================================================================
+ * This function can be used by asm versions of crc32()
+ */
+const uLongf * ZEXPORT get_crc_table()
+{
+#ifdef DYNAMIC_CRC_TABLE
+  if (crc_table_empty) make_crc_table();
+#endif
+  return (const uLongf *)crc_table;
+}
+
+/* ========================================================================= */
+#define DO1(buf) crc = crc_table[((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8);
+#define DO2(buf)  DO1(buf); DO1(buf);
+#define DO4(buf)  DO2(buf); DO2(buf);
+#define DO8(buf)  DO4(buf); DO4(buf);
+
+/* ========================================================================= */
+uLong ZEXPORT crc32(crc, buf, len)
+    uLong crc;
+    const Bytef *buf;
+    uInt len;
+{
+    if (buf == Z_NULL) return 0L;
+#ifdef DYNAMIC_CRC_TABLE
+    if (crc_table_empty)
+      make_crc_table();
+#endif
+    crc = crc ^ 0xffffffffL;
+    while (len >= 8)
+    {
+      DO8(buf);
+      len -= 8;
+    }
+    if (len) do {
+      DO1(buf);
+    } while (--len);
+    return crc ^ 0xffffffffL;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/deflate.c b/contrib/vmap_extractor_v2/stormlib/zlib/deflate.c
new file mode 100644
index 00000000000..16ebdade3f1
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/deflate.c
@@ -0,0 +1,1350 @@
+/* deflate.c -- compress data using the deflation algorithm
+ * Copyright (C) 1995-2002 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 ftp://ds.internic.net/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.1.4 Copyright 1995-2002 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));
+local block_state deflate_slow   OF((deflate_state *s, int flush));
+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));
+#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
+
+#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;
+
+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}, /* maximum 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}}; /* maximum compression */
+
+/* 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 */
+
+struct static_tree_desc_s {int dummy;}; /* for buggy compilers */
+
+/* ===========================================================================
+ * 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)]), \
+    s->prev[(str) & s->w_mask] = match_head = 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_(strm, level, version, stream_size)
+    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_(strm, level, method, windowBits, memLevel, strategy,
+		  version, stream_size)
+    z_streamp strm;
+    int  level;
+    int  method;
+    int  windowBits;
+    int  memLevel;
+    int  strategy;
+    const char *version;
+    int stream_size;
+{
+    deflate_state *s;
+    int noheader = 0;
+    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 == Z_NULL) {
+	strm->zalloc = zcalloc;
+	strm->opaque = (voidpf)0;
+    }
+    if (strm->zfree == Z_NULL) strm->zfree = zcfree;
+
+    if (level == Z_DEFAULT_COMPRESSION) level = 6;
+#ifdef FASTEST
+    level = 1;
+#endif
+
+    if (windowBits < 0) { /* undocumented feature: suppress zlib header */
+        noheader = 1;
+        windowBits = -windowBits;
+    }
+    if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method != Z_DEFLATED ||
+        windowBits < 9 || windowBits > 15 || level < 0 || level > 9 ||
+	strategy < 0 || strategy > Z_HUFFMAN_ONLY) {
+        return Z_STREAM_ERROR;
+    }
+    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->noheader = noheader;
+    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) {
+        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 (strm, dictionary, dictLength)
+    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->status != INIT_STATE) return Z_STREAM_ERROR;
+
+    s = strm->state;
+    strm->adler = adler32(strm->adler, dictionary, dictLength);
+
+    if (length < MIN_MATCH) return Z_OK;
+    if (length > MAX_DIST(s)) {
+	length = MAX_DIST(s);
+#ifndef USE_DICT_HEAD
+	dictionary += dictLength - length; /* use the tail of the dictionary */
+#endif
+    }
+    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 (strm)
+    z_streamp strm;
+{
+    deflate_state *s;
+    
+    if (strm == Z_NULL || strm->state == Z_NULL ||
+        strm->zalloc == Z_NULL || strm->zfree == Z_NULL) 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->noheader < 0) {
+        s->noheader = 0; /* was set to -1 by deflate(..., Z_FINISH); */
+    }
+    s->status = s->noheader ? BUSY_STATE : INIT_STATE;
+    strm->adler = 1;
+    s->last_flush = Z_NO_FLUSH;
+
+    _tr_init(s);
+    lm_init(s);
+
+    return Z_OK;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateParams(strm, level, strategy)
+    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;
+
+    if (level == Z_DEFAULT_COMPRESSION) {
+	level = 6;
+    }
+    if (level < 0 || level > 9 || strategy < 0 || strategy > Z_HUFFMAN_ONLY) {
+	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;
+}
+
+/* =========================================================================
+ * 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 (s, b)
+    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(strm)
+    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 (strm, flush)
+    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 zlib header */
+    if (s->status == INIT_STATE) {
+
+        uInt header = (Z_DEFLATED + ((s->w_bits-8)<<4)) << 8;
+        uInt level_flags = (s->level-1) >> 1;
+
+        if (level_flags > 3) 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 = 1L;
+    }
+
+    /* 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_BUFF_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->noheader) return Z_STREAM_END;
+
+    /* Write the zlib trailer (adler32) */
+    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.
+     */
+    s->noheader = -1; /* write the trailer only once! */
+    return s->pending != 0 ? Z_OK : Z_STREAM_END;
+}
+
+/* ========================================================================= */
+int ZEXPORT deflateEnd (strm)
+    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 != 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 (dest, source)
+    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;
+
+    *dest = *source;
+
+    ds = (deflate_state *) ZALLOC(dest, 1, sizeof(deflate_state));
+    if (ds == Z_NULL) return Z_MEM_ERROR;
+    dest->state = (struct internal_state FAR *) ds;
+    *ds = *ss;
+    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
+}
+
+/* ===========================================================================
+ * 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(strm, buf, size)
+    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->noheader) {
+        strm->adler = adler32(strm->adler, strm->next_in, len);
+    }
+    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 (s)
+    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;
+#ifdef ASMV
+    match_init(); /* initialize the asm code */
+#endif
+}
+
+/* ===========================================================================
+ * 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.
+ */
+#ifndef FASTEST
+local uInt longest_match(s, cur_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:
+         */
+#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;
+}
+
+#else /* FASTEST */
+/* ---------------------------------------------------------------------------
+ * Optimized version for level == 1 only
+ */
+local uInt longest_match(s, cur_match)
+    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 len <= s->lookahead ? len : s->lookahead;
+}
+#endif /* FASTEST */
+#endif /* ASMV */
+
+#ifdef DEBUG
+/* ===========================================================================
+ * Check that the match at match_start is indeed a match.
+ */
+local void check_match(s, start, match, length)
+    deflate_state *s;
+    IPos start, 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
+
+/* ===========================================================================
+ * 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(s)
+    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 (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
+             * and lookahead == 1 (input done one 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.
+         */
+        } else 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.)
+             */
+	    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(s, flush)
+    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(s, flush)
+    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).
+             */
+            if (s->strategy != Z_HUFFMAN_ONLY) {
+                s->match_length = longest_match (s, hash_head);
+            }
+            /* longest_match() 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 hash 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;
+}
+
+/* ===========================================================================
+ * 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(s, flush)
+    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->match_length = longest_match (s, hash_head);
+            }
+            /* longest_match() sets match_start */
+
+            if (s->match_length <= 5 && (s->strategy == Z_FILTERED ||
+                 (s->match_length == MIN_MATCH &&
+                  s->strstart - s->match_start > TOO_FAR))) {
+
+                /* 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;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/deflate.h b/contrib/vmap_extractor_v2/stormlib/zlib/deflate.h
new file mode 100644
index 00000000000..b99a48a5214
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/deflate.h
@@ -0,0 +1,318 @@
+/* deflate.h -- internal compression state
+ * Copyright (C) 1995-2002 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"
+
+/* ===========================================================================
+ * 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 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 */
+    int   pending;       /* nb of bytes in the pending buffer */
+    int   noheader;      /* suppress zlib header and adler32 */
+    Byte  data_type;     /* UNKNOWN, BINARY or ASCII */
+    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
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/descrip.mms b/contrib/vmap_extractor_v2/stormlib/zlib/descrip.mms
new file mode 100644
index 00000000000..9d364598a27
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/example.c b/contrib/vmap_extractor_v2/stormlib/zlib/example.c
new file mode 100644
index 00000000000..e7e3673333e
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/example.c
@@ -0,0 +1,556 @@
+/* example.c -- usage example of the zlib compression library
+ * Copyright (C) 1995-2002 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>
+#else
+   extern void exit  OF((int));
+#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 *out, const char *in, 
+		            Byte *uncompr, int 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 = 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(out, in, uncompr, uncomprLen)
+    const char *out; /* compressed output file */
+    const char *in;  /* compressed input file */
+    Byte *uncompr;
+    int  uncomprLen;
+{
+    int err;
+    int len = strlen(hello)+1;
+    gzFile file;
+    z_off_t pos;
+
+    file = gzopen(out, "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(in, "rb");
+    if (file == NULL) {
+        fprintf(stderr, "gzopen error\n");
+    }
+    strcpy((char*)uncompr, "garbage");
+
+    uncomprLen = gzread(file, uncompr, (unsigned)uncomprLen);
+    if (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);
+    }
+
+    gzgets(file, (char*)uncompr, uncomprLen);
+    uncomprLen = strlen((char*)uncompr);
+    if (uncomprLen != 6) { /* "hello!" */
+        fprintf(stderr, "gzgets err after gzseek: %s\n", gzerror(file, &err));
+	exit(1);
+    }
+    if (strcmp((char*)uncompr, hello+7)) {
+        fprintf(stderr, "bad gzgets after gzseek\n");
+	exit(1);
+    } else {
+        printf("gzgets() after gzseek: %s\n", (char *)uncompr);
+    }
+
+    gzclose(file);
+}
+
+/* ===========================================================================
+ * Test deflate() with small buffers
+ */
+void test_deflate(compr, comprLen)
+    Byte *compr;
+    uLong comprLen;
+{
+    z_stream c_stream; /* compression stream */
+    int err;
+    int len = 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 != (uLong)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;
+    int len = 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");
+    }
+
+    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),
+              (argc > 2 ? argv[2] : TESTFILE),
+	      uncompr, (int)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);
+
+    exit(0);
+    return 0; /* to avoid warning */
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/gzio.c b/contrib/vmap_extractor_v2/stormlib/zlib/gzio.c
new file mode 100644
index 00000000000..09e0a20b8ce
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/gzio.c
@@ -0,0 +1,875 @@
+/* gzio.c -- IO on .gz files
+ * Copyright (C) 1995-2002 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h
+ *
+ * Compile this file with -DNO_DEFLATE to avoid the compression code.
+ */
+
+/* @(#) $Id$ */
+
+#include <stdio.h>
+
+#include "zutil.h"
+
+struct internal_state {int dummy;}; /* for buggy compilers */
+
+#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
+
+#define ALLOC(size) malloc(size)
+#define TRYFREE(p) {if (p) free(p);}
+
+static int 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' */
+    long     startpos; /* start of compressed data in file (header skipped) */
+} 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 return 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 (path, mode, fd)
+    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->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 {
+	    *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_DEFLATE
+        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->startpos = 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
+         * startpos anyway in write mode, so this initialization is not
+         * necessary.
+         */
+    } else {
+	check_header(s); /* skip the .gz header */
+	s->startpos = (ftell(s->file) - s->stream.avail_in);
+    }
+    
+    return (gzFile)s;
+}
+
+/* ===========================================================================
+     Opens a gzip (.gz) file for reading or writing.
+*/
+gzFile ZEXPORT gzopen (path, mode)
+    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 (fd, mode)
+    int fd;
+    const char *mode;
+{
+    char name[20];
+
+    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 (file, level, strategy)
+    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(s)
+    gz_stream *s;
+{
+    if (s->z_eof) return EOF;
+    if (s->stream.avail_in == 0) {
+	errno = 0;
+	s->stream.avail_in = 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(s)
+    gz_stream *s;
+{
+    int method; /* method byte */
+    int flags;  /* flags byte */
+    uInt len;
+    int c;
+
+    /* Check the gzip magic header */
+    for (len = 0; len < 2; len++) {
+	c = get_byte(s);
+	if (c != gz_magic[len]) {
+	    if (len != 0) s->stream.avail_in++, s->stream.next_in--;
+	    if (c != EOF) {
+		s->stream.avail_in++, s->stream.next_in--;
+		s->transparent = 1;
+	    }
+	    s->z_err = s->stream.avail_in != 0 ? Z_OK : Z_STREAM_END;
+	    return;
+	}
+    }
+    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 (s)
+    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_DEFLATE
+	    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 (file, buf, len)
+    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;
+
+    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 -= fread(next_out, 1, s->stream.avail_out,
+					     s->file);
+	    }
+	    len -= s->stream.avail_out;
+	    s->stream.total_in  += (uLong)len;
+	    s->stream.total_out += (uLong)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 = 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->z_err = inflate(&(s->stream), Z_NO_FLUSH);
+
+	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->stream.total_out) in case of
+		 * concatenated .gz files. Check for such files:
+		 */
+		check_header(s);
+		if (s->z_err == Z_OK) {
+		    uLong total_in = s->stream.total_in;
+		    uLong total_out = s->stream.total_out;
+
+		    inflateReset(&(s->stream));
+		    s->stream.total_in = total_in;
+		    s->stream.total_out = total_out;
+		    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));
+
+    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(file)
+    gzFile file;
+{
+    unsigned char c;
+
+    return gzread(file, &c, 1) == 1 ? c : -1;
+}
+
+
+/* ===========================================================================
+      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(file, buf, len)
+    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_DEFLATE
+/* ===========================================================================
+     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 (file, buf, len)
+    gzFile file;
+    const voidp 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->z_err = deflate(&(s->stream), Z_NO_FLUSH);
+        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;
+
+    va_start(va, format);
+#ifdef HAS_vsnprintf
+    (void)vsnprintf(buf, sizeof(buf), format, va);
+#else
+    (void)vsprintf(buf, format, va);
+#endif
+    va_end(va);
+    len = strlen(buf); /* some *sprintf don't return the nb of bytes written */
+    if (len <= 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;
+
+#ifdef HAS_snprintf
+    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);
+#else
+    sprintf(buf, format, a1, a2, a3, a4, a5, a6, a7, a8,
+	    a9, a10, a11, a12, a13, a14, a15, a16, a17, a18, a19, a20);
+#endif
+    len = strlen(buf); /* old sprintf doesn't return the nb of bytes written */
+    if (len <= 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(file, c)
+    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(file, s)
+    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 (file, 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->z_err = deflate(&(s->stream), flush);
+
+	/* 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 (file, flush)
+     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_DEFLATE */
+
+/* ===========================================================================
+      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 (file, offset, whence)
+    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_DEFLATE
+	return -1L;
+#else
+	if (whence == SEEK_SET) {
+	    offset -= s->stream.total_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 */
+	    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 (z_off_t)s->stream.total_in;
+#endif
+    }
+    /* Rest of function is for reading only */
+
+    /* compute absolute position */
+    if (whence == SEEK_CUR) {
+	offset += s->stream.total_out;
+    }
+    if (offset < 0) return -1L;
+
+    if (s->transparent) {
+	/* map to fseek */
+	s->stream.avail_in = 0;
+	s->stream.next_in = s->inbuf;
+        if (fseek(s->file, offset, SEEK_SET) < 0) return -1L;
+
+	s->stream.total_in = s->stream.total_out = (uLong)offset;
+	return offset;
+    }
+
+    /* For a negative seek, rewind and use positive seek */
+    if ((uLong)offset >= s->stream.total_out) {
+	offset -= s->stream.total_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);
+    }
+    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 (z_off_t)s->stream.total_out;
+}
+
+/* ===========================================================================
+     Rewinds input file. 
+*/
+int ZEXPORT gzrewind (file)
+    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->stream.avail_in = 0;
+    s->stream.next_in = s->inbuf;
+    s->crc = crc32(0L, Z_NULL, 0);
+	
+    if (s->startpos == 0) { /* not a compressed file */
+	rewind(s->file);
+	return 0;
+    }
+
+    (void) inflateReset(&s->stream);
+    return fseek(s->file, s->startpos, 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 (file)
+    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 (file)
+    gzFile file;
+{
+    gz_stream *s = (gz_stream*)file;
+    
+    return (s == NULL || s->mode != 'r') ? 0 : s->z_eof;
+}
+
+/* ===========================================================================
+   Outputs a long in LSB order to the given file
+*/
+local void putLong (file, x)
+    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 (s)
+    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 (file)
+    gzFile file;
+{
+    int err;
+    gz_stream *s = (gz_stream*)file;
+
+    if (s == NULL) return Z_STREAM_ERROR;
+
+    if (s->mode == 'w') {
+#ifdef NO_DEFLATE
+	return Z_STREAM_ERROR;
+#else
+        err = do_flush (file, Z_FINISH);
+        if (err != Z_OK) return destroy((gz_stream*)file);
+
+        putLong (s->file, s->crc);
+        putLong (s->file, s->stream.total_in);
+#endif
+    }
+    return destroy((gz_stream*)file);
+}
+
+/* ===========================================================================
+     Returns the error message for the last error which occured on the
+   given compressed file. errnum is set to zlib error number. If an
+   error occured 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 (file, errnum)
+    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);
+    strcpy(s->msg, s->path);
+    strcat(s->msg, ": ");
+    strcat(s->msg, m);
+    return (const char*)s->msg;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/infblock.c b/contrib/vmap_extractor_v2/stormlib/zlib/infblock.c
new file mode 100644
index 00000000000..dd7a6d40a8d
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/infblock.c
@@ -0,0 +1,403 @@
+/* infblock.c -- interpret and process block types to last block
+ * Copyright (C) 1995-2002 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+#include "zutil.h"
+#include "infblock.h"
+#include "inftrees.h"
+#include "infcodes.h"
+#include "infutil.h"
+
+struct inflate_codes_state {int dummy;}; /* for buggy compilers */
+
+/* simplify the use of the inflate_huft type with some defines */
+#define exop word.what.Exop
+#define bits word.what.Bits
+
+/* Table for deflate from PKZIP's appnote.txt. */
+local 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(s, z, c)
+inflate_blocks_statef *s;
+z_streamp z;
+uLongf *c;
+{
+  if (c != Z_NULL)
+    *c = s->check;
+  if (s->mode == BTREE || s->mode == DTREE)
+    ZFREE(z, s->sub.trees.blens);
+  if (s->mode == CODES)
+    inflate_codes_free(s->sub.decode.codes, z);
+  s->mode = 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 Bytef *)Z_NULL, 0);
+  Tracev((stderr, "inflate:   blocks reset\n"));
+}
+
+
+inflate_blocks_statef *inflate_blocks_new(z, c, w)
+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 = (Bytef *)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 = TYPE;
+  Tracev((stderr, "inflate:   blocks allocated\n"));
+  inflate_blocks_reset(s, z, Z_NULL);
+  return s;
+}
+
+
+int inflate_blocks(s, z, r)
+inflate_blocks_statef *s;
+z_streamp z;
+int r;
+{
+  uInt t;               /* temporary storage */
+  uLong b;              /* bit buffer */
+  uInt k;               /* bits in bit buffer */
+  Bytef *p;             /* input data pointer */
+  uInt n;               /* bytes available there */
+  Bytef *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 */
+  while (1) switch (s->mode)
+  {
+    case TYPE:
+      NEEDBITS(3)
+      t = (uInt)b & 7;
+      s->last = t & 1;
+      switch (t >> 1)
+      {
+        case 0:                         /* stored */
+          Tracev((stderr, "inflate:     stored block%s\n",
+                 s->last ? " (last)" : ""));
+          DUMPBITS(3)
+          t = k & 7;                    /* go to byte boundary */
+          DUMPBITS(t)
+          s->mode = LENS;               /* get length of stored block */
+          break;
+        case 1:                         /* fixed */
+          Tracev((stderr, "inflate:     fixed codes block%s\n",
+                 s->last ? " (last)" : ""));
+          {
+            uInt bl, bd;
+            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 = CODES;
+          break;
+        case 2:                         /* dynamic */
+          Tracev((stderr, "inflate:     dynamic codes block%s\n",
+                 s->last ? " (last)" : ""));
+          DUMPBITS(3)
+          s->mode = TABLE;
+          break;
+        case 3:                         /* illegal */
+          DUMPBITS(3)
+          s->mode = BAD;
+          z->msg = (char*)"invalid block type";
+          r = Z_DATA_ERROR;
+          LEAVE
+      }
+      break;
+    case LENS:
+      NEEDBITS(32)
+      if ((((~b) >> 16) & 0xffff) != (b & 0xffff))
+      {
+        s->mode = BAD;
+        z->msg = (char*)"invalid stored block lengths";
+        r = Z_DATA_ERROR;
+        LEAVE
+      }
+      s->sub.left = (uInt)b & 0xffff;
+      b = k = 0;                      /* dump bits */
+      Tracev((stderr, "inflate:       stored length %u\n", s->sub.left));
+      s->mode = s->sub.left ? STORED : (s->last ? DRY : TYPE);
+      break;
+    case STORED:
+      if (n == 0)
+        LEAVE
+      NEEDOUT
+      t = s->sub.left;
+      if (t > n) t = n;
+      if (t > m) t = m;
+      zmemcpy(q, p, t);
+      p += t;  n -= t;
+      q += t;  m -= t;
+      if ((s->sub.left -= t) != 0)
+        break;
+      Tracev((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 ? DRY : TYPE;
+      break;
+    case TABLE:
+      NEEDBITS(14)
+      s->sub.trees.table = t = (uInt)b & 0x3fff;
+#ifndef PKZIP_BUG_WORKAROUND
+      if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29)
+      {
+        s->mode = BAD;
+        z->msg = (char*)"too many length or distance symbols";
+        r = Z_DATA_ERROR;
+        LEAVE
+      }
+#endif
+      t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);
+      if ((s->sub.trees.blens = (uIntf*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
+      {
+        r = Z_MEM_ERROR;
+        LEAVE
+      }
+      DUMPBITS(14)
+      s->sub.trees.index = 0;
+      Tracev((stderr, "inflate:       table sizes ok\n"));
+      s->mode = BTREE;
+    case 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 = BAD;
+        }
+        LEAVE
+      }
+      s->sub.trees.index = 0;
+      Tracev((stderr, "inflate:       bits tree ok\n"));
+      s->mode = DTREE;
+    case 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 = 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 = BAD;
+          }
+          r = t;
+          LEAVE
+        }
+        Tracev((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 = CODES;
+    case 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
+      Tracev((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 = TYPE;
+        break;
+      }
+      s->mode = DRY;
+    case DRY:
+      FLUSH
+      if (s->read != s->write)
+        LEAVE
+      s->mode = DONE;
+    case DONE:
+      r = Z_STREAM_END;
+      LEAVE
+    case BAD:
+      r = Z_DATA_ERROR;
+      LEAVE
+    default:
+      r = Z_STREAM_ERROR;
+      LEAVE
+  }
+}
+
+
+int inflate_blocks_free(s, z)
+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);
+  Tracev((stderr, "inflate:   blocks freed\n"));
+  return Z_OK;
+}
+
+
+void inflate_set_dictionary(s, d, n)
+inflate_blocks_statef *s;
+const Bytef *d;
+uInt  n;
+{
+  zmemcpy(s->window, d, n);
+  s->read = s->write = s->window + n;
+}
+
+
+/* Returns true if inflate is currently at the end of a block generated
+ * by Z_SYNC_FLUSH or Z_FULL_FLUSH. 
+ * IN assertion: s != Z_NULL
+ */
+int inflate_blocks_sync_point(s)
+inflate_blocks_statef *s;
+{
+  return s->mode == LENS;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/infblock.h b/contrib/vmap_extractor_v2/stormlib/zlib/infblock.h
new file mode 100644
index 00000000000..173b2267ade
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/infblock.h
@@ -0,0 +1,39 @@
+/* infblock.h -- header to use infblock.c
+ * Copyright (C) 1995-2002 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.
+ */
+
+struct inflate_blocks_state;
+typedef struct inflate_blocks_state FAR inflate_blocks_statef;
+
+extern inflate_blocks_statef * inflate_blocks_new OF((
+    z_streamp z,
+    check_func c,               /* check function */
+    uInt w));                   /* window size */
+
+extern int inflate_blocks OF((
+    inflate_blocks_statef *,
+    z_streamp ,
+    int));                      /* initial return code */
+
+extern void inflate_blocks_reset OF((
+    inflate_blocks_statef *,
+    z_streamp ,
+    uLongf *));                  /* check value on output */
+
+extern int inflate_blocks_free OF((
+    inflate_blocks_statef *,
+    z_streamp));
+
+extern void inflate_set_dictionary OF((
+    inflate_blocks_statef *s,
+    const Bytef *d,  /* dictionary */
+    uInt  n));       /* dictionary length */
+
+extern int inflate_blocks_sync_point OF((
+    inflate_blocks_statef *s));
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/infcodes.c b/contrib/vmap_extractor_v2/stormlib/zlib/infcodes.c
new file mode 100644
index 00000000000..9abe5412b9c
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/infcodes.c
@@ -0,0 +1,251 @@
+/* infcodes.c -- process literals and length/distance pairs
+ * Copyright (C) 1995-2002 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+#include "infblock.h"
+#include "infcodes.h"
+#include "infutil.h"
+#include "inffast.h"
+
+/* 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 {
+      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 */
+  inflate_huft *ltree;          /* literal/length/eob tree */
+  inflate_huft *dtree;          /* distance tree */
+
+};
+
+
+inflate_codes_statef *inflate_codes_new(bl, bd, tl, td, z)
+uInt bl, bd;
+inflate_huft *tl;
+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;
+    Tracev((stderr, "inflate:       codes new\n"));
+  }
+  return c;
+}
+
+
+int inflate_codes(s, z, r)
+inflate_blocks_statef *s;
+z_streamp z;
+int r;
+{
+  uInt j;               /* temporary storage */
+  inflate_huft *t;      /* temporary pointer */
+  uInt e;               /* extra bits or operation */
+  uLong b;              /* bit buffer */
+  uInt k;               /* bits in bit buffer */
+  Bytef *p;             /* input data pointer */
+  uInt n;               /* bytes available there */
+  Bytef *q;             /* output window write pointer */
+  uInt m;               /* bytes to end of window or read pointer */
+  Bytef *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 */
+  while (1) 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;
+        Tracevv((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 */
+      {
+        Tracevv((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;
+      Tracevv((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)
+      Tracevv((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
+  }
+#ifdef NEED_DUMMY_RETURN
+  return Z_STREAM_ERROR;  /* Some dumb compilers complain without this */
+#endif
+}
+
+
+void inflate_codes_free(c, z)
+inflate_codes_statef *c;
+z_streamp z;
+{
+  ZFREE(z, c);
+  Tracev((stderr, "inflate:       codes free\n"));
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/infcodes.h b/contrib/vmap_extractor_v2/stormlib/zlib/infcodes.h
new file mode 100644
index 00000000000..46821a02be6
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/infcodes.h
@@ -0,0 +1,27 @@
+/* infcodes.h -- header to use infcodes.c
+ * Copyright (C) 1995-2002 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.
+ */
+
+struct inflate_codes_state;
+typedef struct inflate_codes_state FAR inflate_codes_statef;
+
+extern inflate_codes_statef *inflate_codes_new OF((
+    uInt, uInt,
+    inflate_huft *, inflate_huft *,
+    z_streamp ));
+
+extern int inflate_codes OF((
+    inflate_blocks_statef *,
+    z_streamp ,
+    int));
+
+extern void inflate_codes_free OF((
+    inflate_codes_statef *,
+    z_streamp ));
+
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/inffast.c b/contrib/vmap_extractor_v2/stormlib/zlib/inffast.c
new file mode 100644
index 00000000000..aa7f1d4d2ad
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/inffast.c
@@ -0,0 +1,183 @@
+/* inffast.c -- process literals and length/distance pairs fast
+ * Copyright (C) 1995-2002 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+#include "infblock.h"
+#include "infcodes.h"
+#include "infutil.h"
+#include "inffast.h"
+
+struct inflate_codes_state {int dummy;}; /* for buggy compilers */
+
+/* simplify the use of the inflate_huft type with some defines */
+#define exop word.what.Exop
+#define bits word.what.Bits
+
+/* 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(bl, bd, tl, td, s, z)
+uInt bl, bd;
+inflate_huft *tl;
+inflate_huft *td; /* need separate declaration for Borland C++ */
+inflate_blocks_statef *s;
+z_streamp z;
+{
+  inflate_huft *t;      /* temporary pointer */
+  uInt e;               /* extra bits or operation */
+  uLong b;              /* bit buffer */
+  uInt k;               /* bits in bit buffer */
+  Bytef *p;             /* input data pointer */
+  uInt n;               /* bytes available there */
+  Bytef *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 */
+  Bytef *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)
+      Tracevv((stderr, t->base >= 0x20 && t->base < 0x7f ?
+                "inflate:         * literal '%c'\n" :
+                "inflate:         * literal 0x%02x\n", t->base));
+      *q++ = (Byte)t->base;
+      m--;
+      continue;
+    }
+    do {
+      DUMPBITS(t->bits)
+      if (e & 16)
+      {
+        /* get extra bits for length */
+        e &= 15;
+        c = t->base + ((uInt)b & inflate_mask[e]);
+        DUMPBITS(e)
+        Tracevv((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;
+        do {
+          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)
+            Tracevv((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 = 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;
+          }
+        } while (1);
+        break;
+      }
+      if ((e & 64) == 0)
+      {
+        t += t->base;
+        if ((e = (t += ((uInt)b & inflate_mask[e]))->exop) == 0)
+        {
+          DUMPBITS(t->bits)
+          Tracevv((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)
+      {
+        Tracevv((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 (1);
+  } while (m >= 258 && n >= 10);
+
+  /* not enough input or output--restore pointers and return */
+  UNGRAB
+  UPDATE
+  return Z_OK;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/inffast.h b/contrib/vmap_extractor_v2/stormlib/zlib/inffast.h
new file mode 100644
index 00000000000..a31a4bbb058
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/inffast.h
@@ -0,0 +1,17 @@
+/* inffast.h -- header to use inffast.c
+ * Copyright (C) 1995-2002 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.
+ */
+
+extern int inflate_fast OF((
+    uInt,
+    uInt,
+    inflate_huft *,
+    inflate_huft *,
+    inflate_blocks_statef *,
+    z_streamp ));
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/inffixed.h b/contrib/vmap_extractor_v2/stormlib/zlib/inffixed.h
new file mode 100644
index 00000000000..77f7e763145
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/inffixed.h
@@ -0,0 +1,151 @@
+/* inffixed.h -- table for decoding fixed codes
+ * Generated automatically by the maketree.c program
+ */
+
+/* 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.
+ */
+
+local uInt fixed_bl = 9;
+local uInt fixed_bd = 5;
+local 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}
+  };
+local 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}
+  };
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/inflate.c b/contrib/vmap_extractor_v2/stormlib/zlib/inflate.c
new file mode 100644
index 00000000000..dfb2e867d81
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/inflate.c
@@ -0,0 +1,366 @@
+/* inflate.c -- zlib interface to inflate modules
+ * Copyright (C) 1995-2002 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+#include "zutil.h"
+#include "infblock.h"
+
+struct inflate_blocks_state {int dummy;}; /* for buggy compilers */
+
+typedef enum {
+      METHOD,   /* waiting for method byte */
+      FLAG,     /* waiting for flag byte */
+      DICT4,    /* four dictionary check bytes to go */
+      DICT3,    /* three dictionary check bytes to go */
+      DICT2,    /* two dictionary check bytes to go */
+      DICT1,    /* one dictionary check byte to go */
+      DICT0,    /* waiting for inflateSetDictionary */
+      BLOCKS,   /* decompressing blocks */
+      CHECK4,   /* four check bytes to go */
+      CHECK3,   /* three check bytes to go */
+      CHECK2,   /* two check bytes to go */
+      CHECK1,   /* one check byte to go */
+      DONE,     /* finished check, done */
+      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 FLAGS, method byte */
+    struct {
+      uLong was;                /* computed check value */
+      uLong need;               /* stream check value */
+    } check;            /* if CHECK, check values to compare */
+    uInt marker;        /* if 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 ZEXPORT inflateReset(z)
+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 ? BLOCKS : METHOD;
+  inflate_blocks_reset(z->state->blocks, z, Z_NULL);
+  Tracev((stderr, "inflate: reset\n"));
+  return Z_OK;
+}
+
+
+int ZEXPORT inflateEnd(z)
+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;
+  Tracev((stderr, "inflate: end\n"));
+  return Z_OK;
+}
+
+
+int ZEXPORT inflateInit2_(z, w, version, stream_size)
+z_streamp z;
+int w;
+const char *version;
+int stream_size;
+{
+  if (version == Z_NULL || version[0] != ZLIB_VERSION[0] ||
+      stream_size != sizeof(z_stream))
+      return Z_VERSION_ERROR;
+
+  /* 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 FAR *)
+       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;
+  }
+  Tracev((stderr, "inflate: allocated\n"));
+
+  /* reset state */
+  inflateReset(z);
+  return Z_OK;
+}
+
+
+int ZEXPORT inflateInit_(z, version, stream_size)
+z_streamp z;
+const char *version;
+int stream_size;
+{
+  return inflateInit2_(z, DEF_WBITS, version, stream_size);
+}
+
+
+#define NEEDBYTE {if(z->avail_in==0)return r;r=f;}
+#define NEXTBYTE (z->avail_in--,z->total_in++,*z->next_in++)
+
+int ZEXPORT inflate(z, f)
+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;
+  while (1) switch (z->state->mode)
+  {
+    case METHOD:
+      NEEDBYTE
+      if (((z->state->sub.method = NEXTBYTE) & 0xf) != Z_DEFLATED)
+      {
+        z->state->mode = 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 = BAD;
+        z->msg = (char*)"invalid window size";
+        z->state->sub.marker = 5;       /* can't try inflateSync */
+        break;
+      }
+      z->state->mode = FLAG;
+    case FLAG:
+      NEEDBYTE
+      b = NEXTBYTE;
+      if (((z->state->sub.method << 8) + b) % 31)
+      {
+        z->state->mode = BAD;
+        z->msg = (char*)"incorrect header check";
+        z->state->sub.marker = 5;       /* can't try inflateSync */
+        break;
+      }
+      Tracev((stderr, "inflate: zlib header ok\n"));
+      if (!(b & PRESET_DICT))
+      {
+        z->state->mode = BLOCKS;
+        break;
+      }
+      z->state->mode = DICT4;
+    case DICT4:
+      NEEDBYTE
+      z->state->sub.check.need = (uLong)NEXTBYTE << 24;
+      z->state->mode = DICT3;
+    case DICT3:
+      NEEDBYTE
+      z->state->sub.check.need += (uLong)NEXTBYTE << 16;
+      z->state->mode = DICT2;
+    case DICT2:
+      NEEDBYTE
+      z->state->sub.check.need += (uLong)NEXTBYTE << 8;
+      z->state->mode = DICT1;
+    case DICT1:
+      NEEDBYTE
+      z->state->sub.check.need += (uLong)NEXTBYTE;
+      z->adler = z->state->sub.check.need;
+      z->state->mode = DICT0;
+      return Z_NEED_DICT;
+    case DICT0:
+      z->state->mode = BAD;
+      z->msg = (char*)"need dictionary";
+      z->state->sub.marker = 0;       /* can try inflateSync */
+      return Z_STREAM_ERROR;
+    case BLOCKS:
+      r = inflate_blocks(z->state->blocks, z, r);
+      if (r == Z_DATA_ERROR)
+      {
+        z->state->mode = 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 = DONE;
+        break;
+      }
+      z->state->mode = CHECK4;
+    case CHECK4:
+      NEEDBYTE
+      z->state->sub.check.need = (uLong)NEXTBYTE << 24;
+      z->state->mode = CHECK3;
+    case CHECK3:
+      NEEDBYTE
+      z->state->sub.check.need += (uLong)NEXTBYTE << 16;
+      z->state->mode = CHECK2;
+    case CHECK2:
+      NEEDBYTE
+      z->state->sub.check.need += (uLong)NEXTBYTE << 8;
+      z->state->mode = CHECK1;
+    case CHECK1:
+      NEEDBYTE
+      z->state->sub.check.need += (uLong)NEXTBYTE;
+
+      if (z->state->sub.check.was != z->state->sub.check.need)
+      {
+        z->state->mode = BAD;
+        z->msg = (char*)"incorrect data check";
+        z->state->sub.marker = 5;       /* can't try inflateSync */
+        break;
+      }
+      Tracev((stderr, "inflate: zlib check ok\n"));
+      z->state->mode = DONE;
+    case DONE:
+      return Z_STREAM_END;
+    case BAD:
+      return Z_DATA_ERROR;
+    default:
+      return Z_STREAM_ERROR;
+  }
+#ifdef NEED_DUMMY_RETURN
+  return Z_STREAM_ERROR;  /* Some dumb compilers complain without this */
+#endif
+}
+
+
+int ZEXPORT inflateSetDictionary(z, dictionary, dictLength)
+z_streamp z;
+const Bytef *dictionary;
+uInt  dictLength;
+{
+  uInt length = dictLength;
+
+  if (z == Z_NULL || z->state == Z_NULL || z->state->mode != DICT0)
+    return Z_STREAM_ERROR;
+
+  if (adler32(1L, dictionary, dictLength) != z->adler) return Z_DATA_ERROR;
+  z->adler = 1L;
+
+  if (length >= ((uInt)1<<z->state->wbits))
+  {
+    length = (1<<z->state->wbits)-1;
+    dictionary += dictLength - length;
+  }
+  inflate_set_dictionary(z->state->blocks, dictionary, length);
+  z->state->mode = BLOCKS;
+  return Z_OK;
+}
+
+
+int ZEXPORT inflateSync(z)
+z_streamp z;
+{
+  uInt n;       /* number of bytes to look at */
+  Bytef *p;     /* pointer to bytes */
+  uInt m;       /* number of marker bytes found in a row */
+  uLong r, w;   /* temporaries to save total_in and total_out */
+
+  /* set up */
+  if (z == Z_NULL || z->state == Z_NULL)
+    return Z_STREAM_ERROR;
+  if (z->state->mode != BAD)
+  {
+    z->state->mode = BAD;
+    z->state->sub.marker = 0;
+  }
+  if ((n = z->avail_in) == 0)
+    return Z_BUF_ERROR;
+  p = z->next_in;
+  m = z->state->sub.marker;
+
+  /* search */
+  while (n && m < 4)
+  {
+    static const Byte mark[4] = {0, 0, 0xff, 0xff};
+    if (*p == mark[m])
+      m++;
+    else if (*p)
+      m = 0;
+    else
+      m = 4 - m;
+    p++, n--;
+  }
+
+  /* restore */
+  z->total_in += p - z->next_in;
+  z->next_in = p;
+  z->avail_in = n;
+  z->state->sub.marker = m;
+
+  /* return no joy or set up to restart on a new block */
+  if (m != 4)
+    return Z_DATA_ERROR;
+  r = z->total_in;  w = z->total_out;
+  inflateReset(z);
+  z->total_in = r;  z->total_out = w;
+  z->state->mode = BLOCKS;
+  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)
+z_streamp z;
+{
+  if (z == Z_NULL || z->state == Z_NULL || z->state->blocks == Z_NULL)
+    return Z_STREAM_ERROR;
+  return inflate_blocks_sync_point(z->state->blocks);
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/inftrees.c b/contrib/vmap_extractor_v2/stormlib/zlib/inftrees.c
new file mode 100644
index 00000000000..4c32ca30d99
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/inftrees.c
@@ -0,0 +1,454 @@
+/* inftrees.c -- generate Huffman trees for efficient decoding
+ * Copyright (C) 1995-2002 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+#include "zutil.h"
+#include "inftrees.h"
+
+#if !defined(BUILDFIXED) && !defined(STDC)
+#  define BUILDFIXED   /* non ANSI compilers may not accept inffixed.h */
+#endif
+
+const char inflate_copyright[] =
+   " inflate 1.1.4 Copyright 1995-2002 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.
+ */
+struct internal_state  {int dummy;}; /* for buggy compilers */
+
+/* simplify the use of the inflate_huft type with some defines */
+#define exop word.what.Exop
+#define bits word.what.Bits
+
+
+local int huft_build OF((
+    uIntf *,            /* code lengths in bits */
+    uInt,               /* number of codes */
+    uInt,               /* number of "simple" codes */
+    const uIntf *,      /* list of base values for non-simple codes */
+    const uIntf *,      /* list of extra bits for non-simple codes */
+    inflate_huft * FAR*,/* result: starting table */
+    uIntf *,            /* maximum lookup bits (returns actual) */
+    inflate_huft *,     /* space for trees */
+    uInt *,             /* hufts used in space */
+    uIntf * ));         /* space for values */
+
+/* Tables for deflate from PKZIP's appnote.txt. */
+local 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 */
+local 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 */
+local 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};
+local 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 */
+
+local int huft_build(b, n, s, d, e, t, m, hp, hn, v)
+uIntf *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 uIntf *d;         /* list of base values for non-simple codes */
+const uIntf *e;         /* list of extra bits for non-simple codes */
+inflate_huft * FAR *t;  /* result: starting table */
+uIntf *m;               /* maximum lookup bits, returns actual */
+inflate_huft *hp;       /* space for trees */
+uInt *hn;               /* hufts used in space */
+uIntf *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 uIntf *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 */
+  uIntf *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                            /* 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(c, bb, tb, hp, z)
+uIntf *c;               /* 19 code lengths */
+uIntf *bb;              /* bits tree desired/actual depth */
+inflate_huft * FAR *tb; /* bits tree result */
+inflate_huft *hp;       /* space for trees */
+z_streamp z;            /* for messages */
+{
+  int r;
+  uInt hn = 0;          /* hufts used in space */
+  uIntf *v;             /* work area for huft_build */
+
+  if ((v = (uIntf*)ZALLOC(z, 19, sizeof(uInt))) == Z_NULL)
+    return Z_MEM_ERROR;
+  r = huft_build(c, 19, 19, (uIntf*)Z_NULL, (uIntf*)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(nl, nd, c, bl, bd, tl, td, hp, z)
+uInt nl;                /* number of literal/length codes */
+uInt nd;                /* number of distance codes */
+uIntf *c;               /* that many (total) code lengths */
+uIntf *bl;              /* literal desired/actual bit depth */
+uIntf *bd;              /* distance desired/actual bit depth */
+inflate_huft * FAR *tl; /* literal/length tree result */
+inflate_huft * FAR *td; /* distance tree result */
+inflate_huft *hp;       /* space for trees */
+z_streamp z;            /* for messages */
+{
+  int r;
+  uInt hn = 0;          /* hufts used in space */
+  uIntf *v;             /* work area for huft_build */
+
+  /* allocate work area */
+  if ((v = (uIntf*)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) {
+#ifdef PKZIP_BUG_WORKAROUND
+      r = Z_OK;
+    }
+#else
+      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;
+#endif
+  }
+
+  /* done */
+  ZFREE(z, v);
+  return Z_OK;
+}
+
+
+/* build fixed tables only once--keep them here */
+#ifdef BUILDFIXED
+local int fixed_built = 0;
+#define FIXEDH 544      /* number of hufts used by fixed tables */
+local inflate_huft fixed_mem[FIXEDH];
+local uInt fixed_bl;
+local uInt fixed_bd;
+local inflate_huft *fixed_tl;
+local inflate_huft *fixed_td;
+#else
+#include "inffixed.h"
+#endif
+
+
+int inflate_trees_fixed(bl, bd, tl, td, z)
+uIntf *bl;               /* literal desired/actual bit depth */
+uIntf *bd;               /* distance desired/actual bit depth */
+inflate_huft * FAR *tl;  /* literal/length tree result */
+inflate_huft * FAR *td;  /* distance tree result */
+z_streamp z;             /* for memory allocation */
+{
+#ifdef BUILDFIXED
+  /* build fixed tables if not already */
+  if (!fixed_built)
+  {
+    int k;              /* temporary variable */
+    uInt f = 0;         /* number of hufts used in fixed_mem */
+    uIntf *c;           /* length list for huft_build */
+    uIntf *v;           /* work area for huft_build */
+
+    /* allocate memory */
+    if ((c = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL)
+      return Z_MEM_ERROR;
+    if ((v = (uIntf*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL)
+    {
+      ZFREE(z, c);
+      return Z_MEM_ERROR;
+    }
+
+    /* literal table */
+    for (k = 0; k < 144; k++)
+      c[k] = 8;
+    for (; k < 256; k++)
+      c[k] = 9;
+    for (; k < 280; k++)
+      c[k] = 7;
+    for (; k < 288; k++)
+      c[k] = 8;
+    fixed_bl = 9;
+    huft_build(c, 288, 257, cplens, cplext, &fixed_tl, &fixed_bl,
+               fixed_mem, &f, v);
+
+    /* distance table */
+    for (k = 0; k < 30; k++)
+      c[k] = 5;
+    fixed_bd = 5;
+    huft_build(c, 30, 0, cpdist, cpdext, &fixed_td, &fixed_bd,
+               fixed_mem, &f, v);
+
+    /* done */
+    ZFREE(z, v);
+    ZFREE(z, c);
+    fixed_built = 1;
+  }
+#endif
+  *bl = fixed_bl;
+  *bd = fixed_bd;
+  *tl = fixed_tl;
+  *td = fixed_td;
+  return Z_OK;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/inftrees.h b/contrib/vmap_extractor_v2/stormlib/zlib/inftrees.h
new file mode 100644
index 00000000000..04b73b7296a
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/inftrees.h
@@ -0,0 +1,58 @@
+/* inftrees.h -- header to use inftrees.c
+ * Copyright (C) 1995-2002 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.
+ */
+
+/* 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 FAR 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
+
+extern int inflate_trees_bits OF((
+    uIntf *,                    /* 19 code lengths */
+    uIntf *,                    /* bits tree desired/actual depth */
+    inflate_huft * FAR *,       /* bits tree result */
+    inflate_huft *,             /* space for trees */
+    z_streamp));                /* for messages */
+
+extern int inflate_trees_dynamic OF((
+    uInt,                       /* number of literal/length codes */
+    uInt,                       /* number of distance codes */
+    uIntf *,                    /* that many (total) code lengths */
+    uIntf *,                    /* literal desired/actual bit depth */
+    uIntf *,                    /* distance desired/actual bit depth */
+    inflate_huft * FAR *,       /* literal/length tree result */
+    inflate_huft * FAR *,       /* distance tree result */
+    inflate_huft *,             /* space for trees */
+    z_streamp));                /* for messages */
+
+extern int inflate_trees_fixed OF((
+    uIntf *,                    /* literal desired/actual bit depth */
+    uIntf *,                    /* distance desired/actual bit depth */
+    inflate_huft * FAR *,       /* literal/length tree result */
+    inflate_huft * FAR *,       /* distance tree result */
+    z_streamp));                /* for memory allocation */
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/infutil.c b/contrib/vmap_extractor_v2/stormlib/zlib/infutil.c
new file mode 100644
index 00000000000..9a076221f2a
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/infutil.c
@@ -0,0 +1,87 @@
+/* inflate_util.c -- data and routines common to blocks and codes
+ * Copyright (C) 1995-2002 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+#include "zutil.h"
+#include "infblock.h"
+#include "inftrees.h"
+#include "infcodes.h"
+#include "infutil.h"
+
+struct inflate_codes_state {int dummy;}; /* for buggy compilers */
+
+/* And'ing with mask[n] masks the lower n bits */
+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(s, z, r)
+inflate_blocks_statef *s;
+z_streamp z;
+int r;
+{
+  uInt n;
+  Bytef *p;
+  Bytef *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 */
+  zmemcpy(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 */
+    zmemcpy(p, q, n);
+    p += n;
+    q += n;
+  }
+
+  /* update pointers */
+  z->next_out = p;
+  s->read = q;
+
+  /* done */
+  return r;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/infutil.h b/contrib/vmap_extractor_v2/stormlib/zlib/infutil.h
new file mode 100644
index 00000000000..4401df82fc8
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/infutil.h
@@ -0,0 +1,98 @@
+/* infutil.h -- types and macros common to blocks and codes
+ * Copyright (C) 1995-2002 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.
+ */
+
+#ifndef _INFUTIL_H
+#define _INFUTIL_H
+
+typedef enum {
+      TYPE,     /* get type bits (3, including end bit) */
+      LENS,     /* get lengths for stored */
+      STORED,   /* processing stored block */
+      TABLE,    /* get table lengths */
+      BTREE,    /* get bit lengths tree for a dynamic block */
+      DTREE,    /* get length, distance trees for a dynamic block */
+      CODES,    /* processing fixed or dynamic block */
+      DRY,      /* output remaining window bytes */
+      DONE,     /* finished last block, done */
+      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) */
+      uIntf *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 */
+  Bytef *window;        /* sliding window */
+  Bytef *end;           /* one byte after sliding window */
+  Bytef *read;          /* window read pointer */
+  Bytef *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+=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;}
+#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++) */
+extern uInt inflate_mask[17];
+
+/* copy as much as possible from the sliding window to the output area */
+extern int inflate_flush OF((
+    inflate_blocks_statef *,
+    z_streamp ,
+    int));
+
+struct internal_state      {int dummy;}; /* for buggy compilers */
+
+#endif
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/maketree.c b/contrib/vmap_extractor_v2/stormlib/zlib/maketree.c
new file mode 100644
index 00000000000..a16d4b14608
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/maketree.c
@@ -0,0 +1,85 @@
+/* maketree.c -- make inffixed.h table for decoding fixed codes
+ * Copyright (C) 1995-2002 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.
+ */
+
+/* This program is included in the distribution for completeness.
+   You do not need to compile or run this program since inffixed.h
+   is already included in the distribution.  To use this program
+   you need to compile zlib with BUILDFIXED defined and then compile
+   and link this program with the zlib library.  Then the output of
+   this program can be piped to inffixed.h. */
+
+#include <stdio.h>
+#include <stdlib.h>
+#include "zutil.h"
+#include "inftrees.h"
+
+/* simplify the use of the inflate_huft type with some defines */
+#define exop word.what.Exop
+#define bits word.what.Bits
+
+/* generate initialization table for an inflate_huft structure array */
+void maketree(uInt b, inflate_huft *t)
+{
+  int i, e;
+
+  i = 0;
+  while (1)
+  {
+    e = t[i].exop;
+    if (e && (e & (16+64)) == 0)        /* table pointer */
+    {
+      fprintf(stderr, "maketree: cannot initialize sub-tables!\n");
+      exit(1);
+    }
+    if (i % 4 == 0)
+      printf("\n   ");
+    printf(" {{{%u,%u}},%u}", t[i].exop, t[i].bits, t[i].base);
+    if (++i == (1<<b))
+      break;
+    putchar(',');
+  }
+  puts("");
+}
+
+/* create the fixed tables in C initialization syntax */
+void main(void)
+{
+  int r;
+  uInt bl, bd;
+  inflate_huft *tl, *td;
+  z_stream z;
+
+  z.zalloc = zcalloc;
+  z.opaque = (voidpf)0;
+  z.zfree = zcfree;
+  r = inflate_trees_fixed(&bl, &bd, &tl, &td, &z);
+  if (r)
+  {
+    fprintf(stderr, "inflate_trees_fixed error %d\n", r);
+    return;
+  }
+  puts("/* inffixed.h -- table for decoding fixed codes");
+  puts(" * Generated automatically by the maketree.c program");
+  puts(" */");
+  puts("");
+  puts("/* WARNING: this file should *not* be used by applications. It is");
+  puts("   part of the implementation of the compression library and is");
+  puts("   subject to change. Applications should only use zlib.h.");
+  puts(" */");
+  puts("");
+  printf("local uInt fixed_bl = %d;\n", bl);
+  printf("local uInt fixed_bd = %d;\n", bd);
+  printf("local inflate_huft fixed_tl[] = {");
+  maketree(bl, tl);
+  puts("  };");
+  printf("local inflate_huft fixed_td[] = {");
+  maketree(bd, td);
+  puts("  };");
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/minigzip.c b/contrib/vmap_extractor_v2/stormlib/zlib/minigzip.c
new file mode 100644
index 00000000000..97b7c2d93b2
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/minigzip.c
@@ -0,0 +1,320 @@
+/* minigzip.c -- simulate gzip using the zlib compression library
+ * Copyright (C) 1995-2002 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>
+#else
+   extern void exit  OF((int));
+#endif
+
+#ifdef USE_MMAP
+#  include <sys/types.h>
+#  include <sys/mman.h>
+#  include <sys/stat.h>
+#endif
+
+#if defined(MSDOS) || defined(OS2) || 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
+
+#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 = 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;
+    int len = 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] [-1 to -9] [files...]
+ *   -d : decompress
+ *   -f : compress with Z_FILTERED
+ *   -h : compress with Z_HUFFMAN_ONLY
+ *   -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 ((*argv)[0] == '-' && (*argv)[1] >= '1' && (*argv)[1] <= '9' &&
+	       (*argv)[2] == 0)
+	outmode[2] = (*argv)[1];
+      else
+	break;
+      argc--, argv++;
+    }
+    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);
+    }
+    exit(0);
+    return 0; /* to avoid warning */
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.b32 b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.b32
new file mode 100644
index 00000000000..f476da91649
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.b32
@@ -0,0 +1,104 @@
+# Makefile for zlib
+# Borland C++   
+
+# This version of the zlib makefile was adapted by Chris Young for use
+# with Borland C 4.5x with the Dos Power Pack for a 32-bit protected mode
+# flat memory model.  It was created for use with POV-Ray ray tracer and
+# you may choose to edit the CFLAGS to suit your needs but the
+# switches -WX and -DMSDOS are required.
+# -- Chris Young 76702.1655@compuserve.com
+
+# To use, do "make -fmakefile.b32"
+
+# See zconf.h for details about the memory requirements.
+
+# ------------- Borland C++ -------------
+MODEL=-WX 
+CFLAGS= $(MODEL) -P-C -K -N- -k- -d -3 -r- -v- -f -DMSDOS
+CC=bcc32
+LD=bcc32
+LIB=tlib
+LDFLAGS= $(MODEL)
+O=.obj
+
+# variables
+OBJ1 = adler32$(O) compress$(O) crc32$(O) gzio$(O) uncompr$(O) deflate$(O) \
+  trees$(O)
+OBJP1 = adler32$(O)+compress$(O)+crc32$(O)+gzio$(O)+uncompr$(O)+deflate$(O)+\
+  trees$(O)
+OBJ2 = zutil$(O) inflate$(O) infblock$(O) inftrees$(O) infcodes$(O) \
+  infutil$(O) inffast$(O)
+OBJP2 = zutil$(O)+inflate$(O)+infblock$(O)+inftrees$(O)+infcodes$(O)+\
+  infutil$(O)+inffast$(O)
+
+all: test
+
+adler32.obj: adler32.c zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+compress.obj: compress.c zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+crc32.obj: crc32.c zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+infblock.obj: infblock.c zutil.h zlib.h zconf.h infblock.h inftrees.h\
+   infcodes.h infutil.h
+	$(CC) -c $(CFLAGS) $*.c
+
+infcodes.obj: infcodes.c zutil.h zlib.h zconf.h inftrees.h infutil.h\
+   infcodes.h inffast.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h infblock.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+	$(CC) -c $(CFLAGS) $*.c
+
+infutil.obj: infutil.c zutil.h zlib.h zconf.h inftrees.h infutil.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h infutil.h inffast.h
+	$(CC) -c $(CFLAGS) $*.c
+
+trees.obj: trees.c deflate.h zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+example.obj: example.c zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+	$(CC) -c $(CFLAGS) $*.c
+
+# we must cut the command line to fit in the MS/DOS 128 byte limit:
+zlib.lib: $(OBJ1) $(OBJ2)
+	del zlib.lib
+	$(LIB) zlib +$(OBJP1)
+	$(LIB) zlib +$(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 *.exe
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.bor b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.bor
new file mode 100644
index 00000000000..f5651b40fec
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.bor
@@ -0,0 +1,125 @@
+# Makefile for zlib
+# Borland C++   ************ UNTESTED ***********
+
+# 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
+
+CC=bcc
+#   replace bcc with tcc for Turbo C++ 1.0, with bcc32 for the 32 bit version
+LD=$(CC)
+AR=tlib
+
+# compiler flags
+CFLAGS=-O2 -Z -m$(MODEL) $(LOC)
+#   replace "-O2" by "-O -G -a -d" for Turbo C++ 1.0
+
+LDFLAGS=-m$(MODEL)
+
+O=.obj
+
+# variables
+OBJ1 = adler32$(O) compress$(O) crc32$(O) gzio$(O) uncompr$(O) deflate$(O) \
+  trees$(O)
+OBJP1 = adler32$(O)+compress$(O)+crc32$(O)+gzio$(O)+uncompr$(O)+deflate$(O)+\
+  trees$(O)
+OBJ2 = zutil$(O) inflate$(O) infblock$(O) inftrees$(O) infcodes$(O) \
+  infutil$(O) inffast$(O)
+OBJP2 = zutil$(O)+inflate$(O)+infblock$(O)+inftrees$(O)+infcodes$(O)+\
+  infutil$(O)+inffast$(O)
+
+ZLIB_H = zlib.h zconf.h
+ZUTIL_H = zutil.h $(ZLIB_H)
+
+ZLIB_LIB = zlib_$(MODEL).lib
+
+all: test
+
+# individual dependencies and action rules:
+adler32.obj: adler32.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+compress.obj: compress.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+crc32.obj: crc32.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+deflate.obj: deflate.c deflate.h $(ZUTIL_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+gzio.obj: gzio.c $(ZUTIL_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+infblock.obj: infblock.c $(ZUTIL_H) infblock.h inftrees.h infcodes.h infutil.h
+	$(CC) -c $(CFLAGS) $*.c
+
+infcodes.obj: infcodes.c $(ZUTIL_H) inftrees.h infutil.h infcodes.h inffast.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inflate.obj: inflate.c $(ZUTIL_H) infblock.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inftrees.obj: inftrees.c $(ZUTIL_H) inftrees.h
+	$(CC) -c $(CFLAGS) $*.c
+
+infutil.obj: infutil.c $(ZUTIL_H) inftrees.h infutil.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inffast.obj: inffast.c $(ZUTIL_H) inftrees.h infutil.h inffast.h
+	$(CC) -c $(CFLAGS) $*.c
+
+trees.obj: trees.c deflate.h $(ZUTIL_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+uncompr.obj: uncompr.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+zutil.obj: zutil.c $(ZUTIL_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+example.obj: example.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+minigzip.obj: minigzip.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+# we must cut the command line 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 *.exe
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.dj2 b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.dj2
new file mode 100644
index 00000000000..0ab431c8a11
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.dj2
@@ -0,0 +1,100 @@
+# 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 infblock.o inftrees.o infcodes.o infutil.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 $@
+
+libz.a: $(OBJS)
+	$(AR) $@ $(OBJS)
+
+%.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/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.emx b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.emx
new file mode 100644
index 00000000000..0e5e5cc4338
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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 infblock.o inftrees.o infcodes.o infutil.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/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.msc b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.msc
new file mode 100644
index 00000000000..562201d87ea
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.msc
@@ -0,0 +1,121 @@
+# Makefile for zlib
+# Microsoft C 5.1 or later
+
+# 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.
+
+O=.obj
+
+# variables
+OBJ1 = adler32$(O) compress$(O) crc32$(O) gzio$(O) uncompr$(O) deflate$(O) \
+  trees$(O)
+OBJP1 = adler32$(O)+compress$(O)+crc32$(O)+gzio$(O)+uncompr$(O)+deflate$(O)+\
+  trees$(O)
+OBJ2 = zutil$(O) inflate$(O) infblock$(O) inftrees$(O) infcodes$(O) \
+  infutil$(O) inffast$(O)
+OBJP2 = zutil$(O)+inflate$(O)+infblock$(O)+inftrees$(O)+infcodes$(O)+\
+  infutil$(O)+inffast$(O)
+
+ZLIB_H = zlib.h zconf.h
+ZUTIL_H = zutil.h $(ZLIB_H)
+
+ZLIB_LIB = zlib_$(MODEL).lib
+
+all:  $(ZLIB_LIB) example.exe minigzip.exe
+
+# individual dependencies and action rules:
+adler32.obj: adler32.c $(ZLIB_H)
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+compress.obj: compress.c $(ZLIB_H)
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+crc32.obj: crc32.c $(ZLIB_H)
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+deflate.obj: deflate.c deflate.h $(ZUTIL_H)
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+gzio.obj: gzio.c $(ZUTIL_H)
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+infblock.obj: infblock.c $(ZUTIL_H) infblock.h inftrees.h infcodes.h infutil.h
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+infcodes.obj: infcodes.c $(ZUTIL_H) inftrees.h infutil.h infcodes.h inffast.h
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+inflate.obj: inflate.c $(ZUTIL_H) infblock.h
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+inftrees.obj: inftrees.c $(ZUTIL_H) inftrees.h
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+infutil.obj: infutil.c $(ZUTIL_H) inftrees.h infutil.h
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+inffast.obj: inffast.c $(ZUTIL_H) inftrees.h infutil.h inffast.h
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+trees.obj: trees.c deflate.h $(ZUTIL_H)
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+uncompr.obj: uncompr.c $(ZLIB_H)
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+zutil.obj: zutil.c $(ZUTIL_H)
+	$(CC) -c $(LIB_CFLAGS) $*.c
+
+example.obj: example.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+minigzip.obj: minigzip.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+# we must cut the command line 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 *.exe
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.tc b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.tc
new file mode 100644
index 00000000000..63e0550359f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.tc
@@ -0,0 +1,108 @@
+# Makefile for zlib
+# TurboC 2.0
+
+# To use, do "make -fmakefile.tc"
+# To compile in small model, set below: MODEL=-ms
+
+# 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.0 -------------
+MODEL=l
+# CFLAGS=-O2 -G -Z -m$(MODEL) -DMAX_WBITS=11 -DMAX_MEM_LEVEL=3
+CFLAGS=-O2 -G -Z -m$(MODEL)
+CC=tcc -I\tc\include
+LD=tcc -L\tc\lib
+AR=tlib
+LDFLAGS=-m$(MODEL) -f-
+O=.obj
+
+# variables
+OBJ1 = adler32$(O) compress$(O) crc32$(O) gzio$(O) uncompr$(O) deflate$(O) \
+  trees$(O)
+OBJP1 = adler32$(O)+compress$(O)+crc32$(O)+gzio$(O)+uncompr$(O)+deflate$(O)+\
+  trees$(O)
+OBJ2 = zutil$(O) inflate$(O) infblock$(O) inftrees$(O) infcodes$(O) \
+  infutil$(O) inffast$(O)
+OBJP2 = zutil$(O)+inflate$(O)+infblock$(O)+inftrees$(O)+infcodes$(O)+\
+  infutil$(O)+inffast$(O)
+
+ZLIB_H = zlib.h zconf.h
+ZUTIL_H = zutil.h $(ZLIB_H)
+
+ZLIB_LIB = zlib_$(MODEL).lib
+
+all: test
+
+adler32.obj: adler32.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+compress.obj: compress.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+crc32.obj: crc32.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+deflate.obj: deflate.c deflate.h $(ZUTIL_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+gzio.obj: gzio.c $(ZUTIL_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+infblock.obj: infblock.c $(ZUTIL_H) infblock.h inftrees.h infcodes.h infutil.h
+	$(CC) -c $(CFLAGS) $*.c
+
+infcodes.obj: infcodes.c $(ZUTIL_H) inftrees.h infutil.h infcodes.h inffast.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inflate.obj: inflate.c $(ZUTIL_H) infblock.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inftrees.obj: inftrees.c $(ZUTIL_H) inftrees.h
+	$(CC) -c $(CFLAGS) $*.c
+
+infutil.obj: infutil.c $(ZUTIL_H) inftrees.h infutil.h
+	$(CC) -c $(CFLAGS) $*.c
+
+inffast.obj: inffast.c $(ZUTIL_H) inftrees.h infutil.h inffast.h
+	$(CC) -c $(CFLAGS) $*.c
+
+trees.obj: trees.c deflate.h $(ZUTIL_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+uncompr.obj: uncompr.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+zutil.obj: zutil.c $(ZUTIL_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+example.obj: example.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+minigzip.obj: minigzip.c $(ZLIB_H)
+	$(CC) -c $(CFLAGS) $*.c
+
+# we must cut the command line 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) -eexample.exe example.obj $(ZLIB_LIB)
+
+minigzip.exe: minigzip.obj $(ZLIB_LIB)
+	$(LD) $(LDFLAGS) -eminigzip.exe minigzip.obj $(ZLIB_LIB)
+
+test: example.exe minigzip.exe
+	example
+	echo hello world | minigzip | minigzip -d 
+
+#clean:
+#	del *.obj
+#	del *.exe
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.w32 b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.w32
new file mode 100644
index 00000000000..0a05fa9a469
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.w32
@@ -0,0 +1,97 @@
+# Makefile for zlib
+# Microsoft 32-bit Visual C++ 4.0 or later (may work on earlier versions)
+
+# To use, do "nmake /f makefile.w32"
+
+# 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.
+
+# ------------- Microsoft Visual C++ 4.0 and later -------------
+MODEL=
+CFLAGS=-Ox -GA3s -nologo -W3
+CC=cl
+LD=link
+LDFLAGS=
+O=.obj
+
+# variables
+OBJ1 = adler32$(O) compress$(O) crc32$(O) gzio$(O) uncompr$(O) deflate$(O) \
+  trees$(O)
+OBJP1 = adler32$(O)+compress$(O)+crc32$(O)+gzio$(O)+uncompr$(O)+deflate$(O)+\
+  trees$(O)
+OBJ2 = zutil$(O) inflate$(O) infblock$(O) inftrees$(O) infcodes$(O) \
+  infutil$(O) inffast$(O)
+OBJP2 = zutil$(O)+inflate$(O)+infblock$(O)+inftrees$(O)+infcodes$(O)+\
+  infutil$(O)+inffast$(O)
+
+all:  zlib.lib example.exe minigzip.exe
+
+adler32.obj: adler32.c zlib.h zconf.h
+  $(CC) -c $(CFLAGS) $*.c
+
+compress.obj: compress.c zlib.h zconf.h
+  $(CC) -c $(CFLAGS) $*.c
+
+crc32.obj: crc32.c zlib.h zconf.h
+  $(CC) -c $(CFLAGS) $*.c
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+  $(CC) -c $(CFLAGS) $*.c
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+  $(CC) -c $(CFLAGS) $*.c
+
+infblock.obj: infblock.c zutil.h zlib.h zconf.h infblock.h inftrees.h\
+   infcodes.h infutil.h
+  $(CC) -c $(CFLAGS) $*.c
+
+infcodes.obj: infcodes.c zutil.h zlib.h zconf.h inftrees.h infutil.h\
+   infcodes.h inffast.h
+  $(CC) -c $(CFLAGS) $*.c
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h infblock.h
+  $(CC) -c $(CFLAGS) $*.c
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+  $(CC) -c $(CFLAGS) $*.c
+
+infutil.obj: infutil.c zutil.h zlib.h zconf.h inftrees.h infutil.h
+  $(CC) -c $(CFLAGS) $*.c
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h infutil.h inffast.h
+  $(CC) -c $(CFLAGS) $*.c
+
+trees.obj: trees.c deflate.h zutil.h zlib.h zconf.h
+  $(CC) -c $(CFLAGS) $*.c
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+  $(CC) -c $(CFLAGS) $*.c
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+  $(CC) -c $(CFLAGS) $*.c
+
+example.obj: example.c zlib.h zconf.h
+  $(CC) -c $(CFLAGS) $*.c
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+  $(CC) -c $(CFLAGS) $*.c
+
+zlib.lib: $(OBJ1) $(OBJ2)
+  if exist zlib.lib del zlib.lib
+  lib /OUT:zlib.lib $(OBJ1) $(OBJ2)
+
+example.exe: example.obj zlib.lib
+  $(LD) $(LDFLAGS) example.obj zlib.lib /OUT:example.exe /SUBSYSTEM:CONSOLE
+
+minigzip.exe: minigzip.obj zlib.lib
+  $(LD) $(LDFLAGS) minigzip.obj zlib.lib /OUT:minigzip.exe /SUBSYSTEM:CONSOLE
+
+test: example.exe minigzip.exe
+  example
+  echo hello world | minigzip | minigzip -d 
+
+#clean:
+#  del *.obj
+#  del *.exe
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.wat b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.wat
new file mode 100644
index 00000000000..44bf8607f6f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/Makefile.wat
@@ -0,0 +1,103 @@
+# Makefile for zlib
+# Watcom 10a
+
+# This version of the zlib makefile was adapted by Chris Young for use
+# with Watcom 10a 32-bit protected mode flat memory model.  It was created 
+# for use with POV-Ray ray tracer and you may choose to edit the CFLAGS to 
+# suit your needs but the -DMSDOS is required.
+# -- Chris Young 76702.1655@compuserve.com
+
+# To use, do "wmake -f makefile.wat"
+
+# See zconf.h for details about the memory requirements.
+
+# ------------- Watcom 10a -------------
+MODEL=-mf 
+CFLAGS= $(MODEL) -fpi87 -fp5 -zp4 -5r -w5 -oneatx -DMSDOS
+CC=wcc386
+LD=wcl386
+LIB=wlib -b -c 
+LDFLAGS= 
+O=.obj
+
+# variables
+OBJ1=adler32$(O) compress$(O) crc32$(O) gzio$(O) uncompr$(O) deflate$(O) 
+OBJ2=trees$(O) zutil$(O) inflate$(O) infblock$(O) inftrees$(O) infcodes$(O) 
+OBJ3=infutil$(O) inffast$(O)
+OBJP1=adler32$(O)+compress$(O)+crc32$(O)+gzio$(O)+uncompr$(O)+deflate$(O)
+OBJP2=trees$(O)+zutil$(O)+inflate$(O)+infblock$(O)+inftrees$(O)+infcodes$(O)
+OBJP3=infutil$(O)+inffast$(O)
+
+all: test
+
+adler32.obj: adler32.c zlib.h zconf.h
+	$(CC) $(CFLAGS) $*.c
+
+compress.obj: compress.c zlib.h zconf.h
+	$(CC) $(CFLAGS) $*.c
+
+crc32.obj: crc32.c zlib.h zconf.h
+	$(CC) $(CFLAGS) $*.c
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+	$(CC) $(CFLAGS) $*.c
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+	$(CC) $(CFLAGS) $*.c
+
+infblock.obj: infblock.c zutil.h zlib.h zconf.h infblock.h inftrees.h &
+  infcodes.h infutil.h
+	$(CC) $(CFLAGS) $*.c
+
+infcodes.obj: infcodes.c zutil.h zlib.h zconf.h inftrees.h infutil.h &
+  infcodes.h inffast.h
+	$(CC) $(CFLAGS) $*.c
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h infblock.h
+	$(CC) $(CFLAGS) $*.c
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+	$(CC) $(CFLAGS) $*.c
+
+infutil.obj: infutil.c zutil.h zlib.h zconf.h inftrees.h infutil.h
+	$(CC) $(CFLAGS) $*.c
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h infutil.h inffast.h
+	$(CC) $(CFLAGS) $*.c
+
+trees.obj: trees.c deflate.h zutil.h zlib.h zconf.h
+	$(CC) $(CFLAGS) $*.c
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+	$(CC) $(CFLAGS) $*.c
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+	$(CC) $(CFLAGS) $*.c
+
+example.obj: example.c zlib.h zconf.h
+	$(CC) $(CFLAGS) $*.c
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+	$(CC) $(CFLAGS) $*.c
+
+# we must cut the command line to fit in the MS/DOS 128 byte limit:
+zlib.lib: $(OBJ1) $(OBJ2) $(OBJ3) 
+	del zlib.lib
+	$(LIB) zlib.lib +$(OBJP1)
+	$(LIB) zlib.lib +$(OBJP2)
+	$(LIB) zlib.lib +$(OBJP3)
+
+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: minigzip.exe example.exe
+	example
+	echo hello world | minigzip | minigzip -d >test
+	type test
+
+#clean:
+#	del *.obj
+#	del *.exe
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/msdos/zlib.def b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/zlib.def
new file mode 100644
index 00000000000..6c04412f9b0
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/zlib.def
@@ -0,0 +1,60 @@
+LIBRARY		"zlib"
+
+DESCRIPTION	'"""zlib data compression library"""'
+
+EXETYPE		NT
+
+SUBSYSTEM	WINDOWS
+
+STUB		'WINSTUB.EXE'
+
+VERSION		1.13
+
+CODE		 EXECUTE READ
+
+DATA		 READ WRITE
+
+HEAPSIZE	1048576,4096
+
+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
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/msdos/zlib.rc b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/zlib.rc
new file mode 100644
index 00000000000..556d4ff950a
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/msdos/zlib.rc
@@ -0,0 +1,32 @@
+#include <windows.h>
+
+#define IDR_VERSION1  1
+IDR_VERSION1	VERSIONINFO	MOVEABLE IMPURE LOADONCALL DISCARDABLE
+  FILEVERSION	 1,1,3,0
+  PRODUCTVERSION 1,1,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.1.3\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-1998 Jean-loup Gailly & Mark Adler\0"
+    END
+  END
+  BLOCK "VarFileInfo"
+  BEGIN
+    VALUE "Translation", 0x0409, 1252
+  END
+END
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/nt/Makefile.emx b/contrib/vmap_extractor_v2/stormlib/zlib/nt/Makefile.emx
new file mode 100644
index 00000000000..2d475b1847e
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/nt/Makefile.emx
@@ -0,0 +1,138 @@
+# 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 infblock.o inftrees.o infcodes.o infutil.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
+# 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 infblock.o inftrees.o infcodes.o infutil.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/contrib/vmap_extractor_v2/stormlib/zlib/nt/Makefile.gcc b/contrib/vmap_extractor_v2/stormlib/zlib/nt/Makefile.gcc
new file mode 100644
index 00000000000..cdd652f2360
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/nt/Makefile.gcc
@@ -0,0 +1,87 @@
+# Makefile for zlib.  Modified for mingw32 by C. Spieler, 6/16/98.
+# (This Makefile is directly derived from Makefile.dj2)
+# 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.gcc;  make test -fmakefile.gcc
+# 
+# To install libz.a, zconf.h and zlib.h in the mingw32 directories, type:
+# 
+#    make install -fmakefile.gcc
+# 
+
+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 infblock.o inftrees.o infcodes.o infutil.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 $@
+
+libz.a: $(OBJS)
+	$(AR) $@ $(OBJS)
+
+%.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/contrib/vmap_extractor_v2/stormlib/zlib/nt/Makefile.nt b/contrib/vmap_extractor_v2/stormlib/zlib/nt/Makefile.nt
new file mode 100644
index 00000000000..b250f2ac7d2
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/nt/Makefile.nt
@@ -0,0 +1,88 @@
+# Makefile for zlib
+
+!include <ntwin32.mak>
+
+CC=cl
+LD=link
+CFLAGS=-O -nologo
+LDFLAGS=
+O=.obj
+
+# variables
+OBJ1 = adler32$(O) compress$(O) crc32$(O) gzio$(O) uncompr$(O) deflate$(O) \
+  trees$(O)
+OBJ2 = zutil$(O) inflate$(O) infblock$(O) inftrees$(O) infcodes$(O) \
+  infutil$(O) inffast$(O)
+
+all:  zlib.dll example.exe minigzip.exe
+
+adler32.obj: adler32.c zutil.h zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+compress.obj: compress.c zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+crc32.obj: crc32.c zutil.h zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+deflate.obj: deflate.c deflate.h zutil.h zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+gzio.obj: gzio.c zutil.h zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+infblock.obj: infblock.c zutil.h zlib.h zconf.h infblock.h inftrees.h\
+   infcodes.h infutil.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+infcodes.obj: infcodes.c zutil.h zlib.h zconf.h inftrees.h infutil.h\
+   infcodes.h inffast.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+inflate.obj: inflate.c zutil.h zlib.h zconf.h infblock.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+inftrees.obj: inftrees.c zutil.h zlib.h zconf.h inftrees.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+infutil.obj: infutil.c zutil.h zlib.h zconf.h inftrees.h infutil.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+inffast.obj: inffast.c zutil.h zlib.h zconf.h inftrees.h infutil.h inffast.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+trees.obj: trees.c deflate.h zutil.h zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+uncompr.obj: uncompr.c zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+zutil.obj: zutil.c zutil.h zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+example.obj: example.c zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+minigzip.obj: minigzip.c zlib.h zconf.h
+	$(CC) -c $(cvarsdll) $(CFLAGS) $*.c
+
+zlib.dll: $(OBJ1) $(OBJ2) zlib.dnt
+	link $(dlllflags) -out:$@ -def:zlib.dnt $(OBJ1) $(OBJ2) $(guilibsdll)
+
+zlib.lib: zlib.dll
+
+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 *.exe
+	del *.dll
+	del *.lib
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/nt/zlib.dnt b/contrib/vmap_extractor_v2/stormlib/zlib/nt/zlib.dnt
new file mode 100644
index 00000000000..7f9475cfb0e
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/nt/zlib.dnt
@@ -0,0 +1,47 @@
+LIBRARY		zlib.dll
+EXETYPE WINDOWS
+CODE		 PRELOAD MOVEABLE DISCARDABLE
+DATA		 PRELOAD MOVEABLE MULTIPLE
+
+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
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/os2/Makefile.os2 b/contrib/vmap_extractor_v2/stormlib/zlib/os2/Makefile.os2
new file mode 100644
index 00000000000..4f569471eca
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/os2/zlib.def b/contrib/vmap_extractor_v2/stormlib/zlib/os2/zlib.def
new file mode 100644
index 00000000000..4c753f1a3b9
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/trees.c b/contrib/vmap_extractor_v2/stormlib/zlib/trees.c
new file mode 100644
index 00000000000..0a984056738
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/trees.c
@@ -0,0 +1,1214 @@
+/* trees.c -- output deflated data using Huffman coding
+ * Copyright (C) 1995-2002 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 */
+
+
+#define MAX(a,b) (a >= b ? a : b)
+/* 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(s)
+    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(s)
+    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(s, tree, k)
+    deflate_state *s;
+    ct_data *tree;  /* the tree to restore */
+    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(s, desc)
+    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 (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 (tree, max_code, bl_count)
+    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(s, desc)
+    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) (MAX(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 (s, tree, max_code)
+    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 (s, tree, max_code)
+    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(s)
+    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(s, lcodes, dcodes, blcodes)
+    deflate_state *s;
+    int lcodes, dcodes, 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(s, buf, stored_len, eof)
+    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(s)
+    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(s, buf, stored_len, eof)
+    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 ascii or binary */
+	if (s->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 first the block length 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 (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 (s, dist, lc)
+    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(s, ltree, dtree)
+    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(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 ASCII or BINARY, using a crude approximation:
+ * binary if more than 20% of the bytes are <= 6 or >= 128, ascii otherwise.
+ * IN assertion: the fields freq of dyn_ltree are set and the total of all
+ * frequencies does not exceed 64K (to fit in an int on 16 bit machines).
+ */
+local void set_data_type(s)
+    deflate_state *s;
+{
+    int n = 0;
+    unsigned ascii_freq = 0;
+    unsigned bin_freq = 0;
+    while (n < 7)        bin_freq += s->dyn_ltree[n++].Freq;
+    while (n < 128)    ascii_freq += s->dyn_ltree[n++].Freq;
+    while (n < LITERALS) bin_freq += s->dyn_ltree[n++].Freq;
+    s->data_type = (Byte)(bin_freq > (ascii_freq >> 2) ? Z_BINARY : Z_ASCII);
+}
+
+/* ===========================================================================
+ * 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(code, len)
+    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(s)
+    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(s)
+    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(s, buf, len, header)
+    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/contrib/vmap_extractor_v2/stormlib/zlib/trees.h b/contrib/vmap_extractor_v2/stormlib/zlib/trees.h
new file mode 100644
index 00000000000..72facf900f7
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/uncompr.c b/contrib/vmap_extractor_v2/stormlib/zlib/uncompr.c
new file mode 100644
index 00000000000..a287714f5de
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/uncompr.c
@@ -0,0 +1,58 @@
+/* uncompr.c -- decompress a memory buffer
+ * Copyright (C) 1995-2002 Jean-loup Gailly.
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+/* @(#) $Id$ */
+
+#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 (dest, destLen, source, sourceLen)
+    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);
+        return err == Z_OK ? Z_BUF_ERROR : err;
+    }
+    *destLen = stream.total_out;
+
+    err = inflateEnd(&stream);
+    return err;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/zconf.h b/contrib/vmap_extractor_v2/stormlib/zlib/zconf.h
new file mode 100644
index 00000000000..eb0ae2e1a0c
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/zconf.h
@@ -0,0 +1,279 @@
+/* zconf.h -- configuration of the zlib compression library
+ * Copyright (C) 1995-2002 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 inflateInit2_	z_inflateInit2_
+#  define inflateSetDictionary z_inflateSetDictionary
+#  define inflateSync	z_inflateSync
+#  define inflateSyncPoint z_inflateSyncPoint
+#  define inflateReset	z_inflateReset
+#  define compress	z_compress
+#  define compress2	z_compress2
+#  define uncompress	z_uncompress
+#  define adler32	z_adler32
+#  define crc32		z_crc32
+#  define get_crc_table z_get_crc_table
+
+#  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(_WIN32) || defined(__WIN32__)) && !defined(WIN32)
+#  define WIN32
+#endif
+#if defined(__GNUC__) || defined(WIN32) || defined(__386__) || defined(i386)
+#  ifndef __32BIT__
+#    define __32BIT__
+#  endif
+#endif
+#if defined(__MSDOS__) && !defined(MSDOS)
+#  define MSDOS
+#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).
+ */
+#if defined(MSDOS) && !defined(__32BIT__)
+#  define MAXSEG_64K
+#endif
+#ifdef MSDOS
+#  define UNALIGNED_OK
+#endif
+
+#if (defined(MSDOS) || defined(_WINDOWS) || defined(WIN32))  && !defined(STDC)
+#  define STDC
+#endif
+#if defined(__STDC__) || defined(__cplusplus) || defined(__OS2__)
+#  ifndef STDC
+#    define STDC
+#  endif
+#endif
+
+#ifndef STDC
+#  ifndef const /* cannot use !defined(STDC) && !defined(const) on Mac */
+#    define const
+#  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
+
+/* Old Borland C incorrectly complains about missing returns: */
+#if defined(__BORLANDC__) && (__BORLANDC__ < 0x500)
+#  define NEED_DUMMY_RETURN
+#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.
+ */
+#if (defined(M_I86SM) || defined(M_I86MM)) && !defined(__32BIT__)
+   /* MSC small or medium model */
+#  define SMALL_MEDIUM
+#  ifdef _MSC_VER
+#    define FAR _far
+#  else
+#    define FAR far
+#  endif
+#endif
+#if defined(__BORLANDC__) && (defined(__SMALL__) || defined(__MEDIUM__))
+#  ifndef __32BIT__
+#    define SMALL_MEDIUM
+#    define FAR _far
+#  endif
+#endif
+
+/* Compile with -DZLIB_DLL for Windows DLL support */
+#if defined(ZLIB_DLL)
+#  if defined(_WINDOWS) || defined(WINDOWS)
+#    ifdef FAR
+#      undef FAR
+#    endif
+#    include <windows.h>
+#    define ZEXPORT  WINAPI
+#    ifdef WIN32
+#      define ZEXPORTVA  WINAPIV
+#    else
+#      define ZEXPORTVA  FAR _cdecl _export
+#    endif
+#  endif
+#  if defined (__BORLANDC__)
+#    if (__BORLANDC__ >= 0x0500) && defined (WIN32)
+#      include <windows.h>
+#      define ZEXPORT __declspec(dllexport) WINAPI
+#      define ZEXPORTRVA __declspec(dllexport) WINAPIV
+#    else
+#      if defined (_Windows) && defined (__DLL__)
+#        define ZEXPORT _export
+#        define ZEXPORTVA _export
+#      endif
+#    endif
+#  endif
+#endif
+
+#if defined (__BEOS__)
+#  if defined (ZLIB_DLL)
+#    define ZEXTERN extern __declspec(dllexport)
+#  else
+#    define ZEXTERN extern __declspec(dllimport)
+#  endif
+#endif
+
+#ifndef ZEXPORT
+#  define ZEXPORT
+#endif
+#ifndef ZEXPORTVA
+#  define ZEXPORTVA
+#endif
+#ifndef ZEXTERN
+#  define ZEXTERN extern
+#endif
+
+#ifndef FAR
+#   define FAR
+#endif
+
+#if !defined(MACOS) && !defined(TARGET_OS_MAC)
+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 FAR *voidpf;
+   typedef void     *voidp;
+#else
+   typedef Byte FAR *voidpf;
+   typedef Byte     *voidp;
+#endif
+
+#ifdef HAVE_UNISTD_H
+#  include <sys/types.h> /* for off_t */
+#  include <unistd.h>    /* for SEEK_* and off_t */
+#  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
+
+/* 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(inflateInit_,"ININ")
+#   pragma map(inflateInit2_,"ININ2")
+#   pragma map(inflateEnd,"INEND")
+#   pragma map(inflateSync,"INSY")
+#   pragma map(inflateSetDictionary,"INSEDI")
+#   pragma map(inflate_blocks,"INBL")
+#   pragma map(inflate_blocks_new,"INBLNE")
+#   pragma map(inflate_blocks_free,"INBLFR")
+#   pragma map(inflate_blocks_reset,"INBLRE")
+#   pragma map(inflate_codes_free,"INCOFR")
+#   pragma map(inflate_codes,"INCO")
+#   pragma map(inflate_fast,"INFA")
+#   pragma map(inflate_flush,"INFLU")
+#   pragma map(inflate_mask,"INMA")
+#   pragma map(inflate_set_dictionary,"INSEDI2")
+#   pragma map(inflate_copyright,"INCOPY")
+#   pragma map(inflate_trees_bits,"INTRBI")
+#   pragma map(inflate_trees_dynamic,"INTRDY")
+#   pragma map(inflate_trees_fixed,"INTRFI")
+#   pragma map(inflate_trees_free,"INTRFR")
+#endif
+
+#endif /* _ZCONF_H */
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/zlib.3 b/contrib/vmap_extractor_v2/stormlib/zlib/zlib.3
new file mode 100644
index 00000000000..3a6e45047fe
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/zlib.3
@@ -0,0 +1,107 @@
+.TH ZLIB 3 "11 March 2002"
+.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
+.I gzip
+(.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
+the files
+.I example.c
+and
+.IR minigzip.c .
+.LP
+A Java implementation of
+.IR 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 (pmarquess@bfsec.bt.co.uk)
+is available at CPAN (Comprehensive Perl Archive Network) sites,
+such as:
+.IP
+ftp://ftp.cis.ufl.edu/pub/perl/CPAN/modules/by-module/Compress/Compress-Zlib*
+.LP
+A Python interface to
+.IR zlib
+written by A.M. Kuchling <amk@magnet.com>
+is available from the Python Software Association sites, such as:
+.IP
+ftp://ftp.python.org/pub/python/contrib/Encoding/zlib*.tar.gz
+.SH "SEE ALSO"
+Questions about zlib should be sent to:
+.IP
+zlib@quest.jpl.nasa.gov
+or, if this fails, to the author addresses given below.
+The zlib home page is:
+.IP
+http://www.cdrom.com/pub/infozip/zlib/
+.LP
+The data format used by the zlib library is described by RFC
+(Request for Comments) 1950 to 1952 in the files: 
+.IP
+ftp://ds.internic.net/rfc/rfc1950.txt (zlib format)
+.br
+rfc1951.txt (deflate format)
+.br
+rfc1952.txt (gzip format)
+.LP
+These documents are also available in other formats from:
+.IP
+ftp://ftp.uu.net/graphics/png/documents/zlib/zdoc-index.html
+.SH AUTHORS
+Version 1.1.4
+Copyright (C) 1995-2002 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/contrib/vmap_extractor_v2/stormlib/zlib/zlib.h b/contrib/vmap_extractor_v2/stormlib/zlib/zlib.h
new file mode 100644
index 00000000000..52cb529f6f3
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/zlib.h
@@ -0,0 +1,893 @@
+/* zlib.h -- interface of the 'zlib' general purpose compression library
+  version 1.1.4, March 11th, 2002
+
+  Copyright (C) 1995-2002 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).
+*/
+
+#ifndef _ZLIB_H
+#define _ZLIB_H
+
+#include "zconf.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#define ZLIB_VERSION "1.1.4"
+
+/* 
+     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.
+*/
+
+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: ascii or binary */
+    uLong   adler;      /* adler32 value of the uncompressed data */
+    uLong   reserved;   /* reserved for future use */
+} z_stream;
+
+typedef z_stream FAR *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.
+
+   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
+/* Allowed flush values; see deflate() 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_DEFAULT_STRATEGY    0
+/* compression strategy; see deflateInit2() below for details */
+
+#define Z_BINARY   0
+#define Z_ASCII    1
+#define Z_UNKNOWN  2
+/* Possible values of the data_type field */
+
+#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.
+
+    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
+  the 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).
+
+    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
+  0.1% larger than avail_in plus 12 bytes.  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 data_type if it can make a good guess about
+  the input data type (Z_ASCII or Z_BINARY). 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).
+*/
+
+
+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 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.
+*/
+
+
+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.
+
+     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), or Z_HUFFMAN_ONLY 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 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. The strategy parameter only affects
+   the compression ratio but not the correctness of the compressed output even
+   if it is not set appropriately.
+
+      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.
+
+     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.)
+
+     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 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. 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.
+
+      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 negative
+   memLevel). 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 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 (see deflateSetDictionary).
+
+     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 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).
+*/
+
+
+                        /* 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 0.1% larger than
+   sourceLen plus 12 bytes. 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 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.
+*/
+
+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.
+*/
+
+
+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". (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, 
+				   const voidp 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).
+*/
+
+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    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    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.
+*/
+
+                        /* 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 crc32   OF((uLong crc, const Bytef *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();
+*/
+
+
+                        /* 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));
+#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))
+
+
+#if !defined(_Z_UTIL_H) && !defined(NO_DUMMY_DECL)
+    struct internal_state {int dummy;}; /* hack for buggy compilers */
+#endif
+
+ZEXTERN const char   * ZEXPORT zError           OF((int err));
+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/contrib/vmap_extractor_v2/stormlib/zlib/zlib.html b/contrib/vmap_extractor_v2/stormlib/zlib/zlib.html
new file mode 100644
index 00000000000..c3437038693
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/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/contrib/vmap_extractor_v2/stormlib/zlib/zmemory.c b/contrib/vmap_extractor_v2/stormlib/zlib/zmemory.c
new file mode 100644
index 00000000000..fc9749c5711
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/zmemory.c
@@ -0,0 +1,19 @@
+/* zmemory.c
+   Internal memory alloc and memory free functions
+ */
+
+#include <malloc.h>
+
+#include "zlib.h"
+
+const char *z_errmsg[10];               // Needed by zlib
+
+voidpf zcalloc(voidpf opaque, uInt items, uInt size)
+{
+    return (voidpf)calloc(items, size);
+}
+
+void zcfree(voidpf opaque, voidpf address)
+{
+    free(address);
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/zutil.c b/contrib/vmap_extractor_v2/stormlib/zlib/zutil.c
new file mode 100644
index 00000000000..9a076221f2a
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/zutil.c
@@ -0,0 +1,87 @@
+/* inflate_util.c -- data and routines common to blocks and codes
+ * Copyright (C) 1995-2002 Mark Adler
+ * For conditions of distribution and use, see copyright notice in zlib.h 
+ */
+
+#include "zutil.h"
+#include "infblock.h"
+#include "inftrees.h"
+#include "infcodes.h"
+#include "infutil.h"
+
+struct inflate_codes_state {int dummy;}; /* for buggy compilers */
+
+/* And'ing with mask[n] masks the lower n bits */
+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(s, z, r)
+inflate_blocks_statef *s;
+z_streamp z;
+int r;
+{
+  uInt n;
+  Bytef *p;
+  Bytef *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 */
+  zmemcpy(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 */
+    zmemcpy(p, q, n);
+    p += n;
+    q += n;
+  }
+
+  /* update pointers */
+  z->next_out = p;
+  s->read = q;
+
+  /* done */
+  return r;
+}
diff --git a/contrib/vmap_extractor_v2/stormlib/zlib/zutil.h b/contrib/vmap_extractor_v2/stormlib/zlib/zutil.h
new file mode 100644
index 00000000000..718ebc15be1
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlib/zlib/zutil.h
@@ -0,0 +1,220 @@
+/* zutil.h -- internal interface and configuration of the compression library
+ * Copyright (C) 1995-2002 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 _Z_UTIL_H
+#define _Z_UTIL_H
+
+#include "zlib.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 */
+
+typedef unsigned char  uch;
+typedef uch FAR uchf;
+typedef unsigned short ush;
+typedef ush FAR ushf;
+typedef unsigned long  ulg;
+
+extern const char *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 */
+
+#ifdef MSDOS
+#  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 OS2
+#  define OS_CODE  0x06
+#endif
+
+#ifdef WIN32 /* Window 95 & Windows NT */
+#  define OS_CODE  0x0b
+#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
+
+#ifdef AMIGA
+#  define OS_CODE  0x01
+#endif
+
+#if defined(ATARI) || defined(atarist)
+#  define OS_CODE  0x05
+#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 __50SERIES /* Prime/PRIMOS */
+#  define OS_CODE  0x0F
+#endif
+
+#ifdef TOPS20
+#  define OS_CODE  0x0a
+#endif
+
+#if defined(_BEOS_) || defined(RISCOS)
+#  define fdopen(fd,mode) NULL /* No fdopen() */
+#endif
+
+#if (defined(_MSC_VER) && (_MSC_VER > 600))
+#  define fdopen(fd,type)  _fdopen(fd,type)
+#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 */
+
+#ifdef HAVE_STRERROR
+   extern char *strerror OF((int));
+#  define zstrerror(errnum) strerror(errnum)
+#else
+#  define zstrerror(errnum) ""
+#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
+
+
+typedef uLong (ZEXPORT *check_func) OF((uLong check, const Bytef *buf,
+				       uInt len));
+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 /* _Z_UTIL_H */
diff --git a/contrib/vmap_extractor_v2/stormlibdll/DllMain.c b/contrib/vmap_extractor_v2/stormlibdll/DllMain.c
new file mode 100644
index 00000000000..cbfa84a08a8
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlibdll/DllMain.c
@@ -0,0 +1,24 @@
+/*****************************************************************************/
+/* DllMain.c                              Copyright (c) Ladislav Zezula 2006 */
+/*---------------------------------------------------------------------------*/
+/* Description: DllMain for the StormLib.dll library                         */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 23.11.06  1.00  Lad  The first version of DllMain.c                       */
+/*****************************************************************************/
+
+#define WIN32_LEAN_AND_MEAN
+#include <windows.h>
+
+//-----------------------------------------------------------------------------
+// DllMain
+
+DWORD WINAPI DllMain(HINSTANCE hInst, DWORD dwReason, LPVOID lpReserved)
+{
+    UNREFERENCED_PARAMETER(hInst);
+    UNREFERENCED_PARAMETER(dwReason);
+    UNREFERENCED_PARAMETER(lpReserved);
+
+    return TRUE;    
+}
diff --git a/contrib/vmap_extractor_v2/stormlibdll/StormLib.def b/contrib/vmap_extractor_v2/stormlibdll/StormLib.def
new file mode 100644
index 00000000000..c220b6dcca4
--- /dev/null
+++ b/contrib/vmap_extractor_v2/stormlibdll/StormLib.def
@@ -0,0 +1,47 @@
+LIBRARY StormLib.dll
+
+EXPORTS
+
+    SFileSetLocale
+    SFileGetLocale
+    SFileOpenArchive
+    SFileCloseArchive
+    
+    SFileOpenFileEx
+    SFileCloseFile
+    SFileGetFilePos
+    SFileGetFileSize
+    SFileSetFilePointer
+    SFileReadFile
+    SFileExtractFile
+    
+    SFileAddListFile
+    
+    SFileCreateArchiveEx
+    
+    SFileAddFile
+    SFileAddWave
+    SFileRemoveFile
+    SFileRenameFile
+    SFileSetFileLocale
+
+    SFileHasFile
+    SFileGetFileName
+    SFileGetFileInfo
+
+    SFileFindFirstFile
+    SFileFindNextFile
+    SFileFindClose
+
+    SListFileFindFirstFile
+    SListFileFindNextFile
+    SListFileFindClose
+
+    SFileSetCompactCallback
+    SFileCompactArchive
+
+    SFileEnumLocales
+
+    SCompCompress   
+    SCompDecompress 
+    SCompSetDataCompression
diff --git a/contrib/vmap_extractor_v2/vmapExtractor_VC71.sln b/contrib/vmap_extractor_v2/vmapExtractor_VC71.sln
new file mode 100644
index 00000000000..13156cd66bd
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapExtractor_VC71.sln
@@ -0,0 +1,23 @@
+Microsoft Visual Studio Solution File, Format Version 8.00
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "vmapExtractor", "vmapExtractor_VC71.vcproj", "{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}"
+	ProjectSection(ProjectDependencies) = postProject
+	EndProjectSection
+EndProject
+Global
+	GlobalSection(SolutionConfiguration) = preSolution
+		Debug Ansi Static = Debug Ansi Static
+		Release Ansi Static = Release Ansi Static
+	EndGlobalSection
+	GlobalSection(ProjectDependencies) = postSolution
+	EndGlobalSection
+	GlobalSection(ProjectConfiguration) = postSolution
+		{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}.Debug Ansi Static.ActiveCfg = Debug Ansi Static|Win32
+		{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}.Debug Ansi Static.Build.0 = Debug Ansi Static|Win32
+		{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}.Release Ansi Static.ActiveCfg = Release Ansi Static|Win32
+		{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}.Release Ansi Static.Build.0 = Release Ansi Static|Win32
+	EndGlobalSection
+	GlobalSection(ExtensibilityGlobals) = postSolution
+	EndGlobalSection
+	GlobalSection(ExtensibilityAddIns) = postSolution
+	EndGlobalSection
+EndGlobal
diff --git a/contrib/vmap_extractor_v2/vmapExtractor_VC71.vcproj b/contrib/vmap_extractor_v2/vmapExtractor_VC71.vcproj
new file mode 100644
index 00000000000..c546fcc336b
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapExtractor_VC71.vcproj
@@ -0,0 +1,786 @@
+<?xml version="1.0" encoding="windows-1251"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="7.10"
+	Name="vmapExtractor"
+	ProjectGUID="{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}"
+	SccProjectName=""
+	SccLocalPath="">
+	<Platforms>
+		<Platform
+			Name="Win32"/>
+	</Platforms>
+	<Configurations>
+		<Configuration
+			Name="Debug Ansi Static|Win32"
+			OutputDirectory=".\bin\Win32\DebugAS"
+			IntermediateDirectory=".\bin\Win32\DebugAS"
+			ConfigurationType="1"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE"
+			CharacterSet="2">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="0"
+				AdditionalIncludeDirectories=".\stormlib"
+				PreprocessorDefinitions="_DEBUG;_CONSOLE;WIN32"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="5"
+				UsePrecompiledHeader="2"
+				PrecompiledHeaderFile=".\bin\Win32\DebugAS/StormLib.pch"
+				AssemblerListingLocation=".\bin\Win32\DebugAS/"
+				ObjectFile=".\bin\Win32\DebugAS/"
+				ProgramDataBaseFileName=".\bin\Win32\DebugAS/"
+				BrowseInformation="1"
+				WarningLevel="4"
+				SuppressStartupBanner="TRUE"
+				DebugInformationFormat="4"
+				CompileAs="0"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile=".\bin\Win32\DebugAS\vmapextract_v2.exe"
+				LinkIncremental="2"
+				SuppressStartupBanner="TRUE"
+				GenerateDebugInformation="TRUE"
+				ProgramDatabaseFile=".\bin\Win32\DebugAS/StormLib.pdb"
+				SubSystem="1"
+				TargetMachine="1"/>
+			<Tool
+				Name="VCMIDLTool"
+				TypeLibraryName=".\bin\StormLibTest\Win32\DebugAS/StormLibTest.tlb"
+				HeaderFileName=""/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+				Culture="1029"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+			<Tool
+				Name="VCManagedWrapperGeneratorTool"/>
+			<Tool
+				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
+		</Configuration>
+		<Configuration
+			Name="Release Ansi Static|Win32"
+			OutputDirectory=".\bin\Win32\ReleaseAS"
+			IntermediateDirectory=".\bin\Win32\ReleaseAS"
+			ConfigurationType="1"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="FALSE"
+			CharacterSet="2">
+			<Tool
+				Name="VCCLCompilerTool"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories=".\stormlib"
+				PreprocessorDefinitions="NDEBUG;_CONSOLE;WIN32"
+				StringPooling="TRUE"
+				RuntimeLibrary="4"
+				EnableFunctionLevelLinking="TRUE"
+				UsePrecompiledHeader="2"
+				PrecompiledHeaderFile=".\bin\Win32\ReleaseAS/StormLib.pch"
+				AssemblerListingLocation=".\bin\Win32\ReleaseAS/"
+				ObjectFile=".\bin\Win32\ReleaseAS/"
+				ProgramDataBaseFileName=".\bin\Win32\ReleaseAS/"
+				WarningLevel="4"
+				SuppressStartupBanner="TRUE"
+				CompileAs="0"/>
+			<Tool
+				Name="VCCustomBuildTool"/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile=".\bin\Win32\ReleaseAS\vmapextract_v2.exe"
+				LinkIncremental="1"
+				SuppressStartupBanner="TRUE"
+				ProgramDatabaseFile=".\bin\Win32\ReleaseAS/StormLib.pdb"
+				SubSystem="1"
+				TargetMachine="1"/>
+			<Tool
+				Name="VCMIDLTool"
+				TypeLibraryName=".\bin\StormLibTest\Win32\ReleaseAS/StormLibTest.tlb"
+				HeaderFileName=""/>
+			<Tool
+				Name="VCPostBuildEventTool"/>
+			<Tool
+				Name="VCPreBuildEventTool"/>
+			<Tool
+				Name="VCPreLinkEventTool"/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1029"/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"/>
+			<Tool
+				Name="VCWebDeploymentTool"/>
+			<Tool
+				Name="VCManagedWrapperGeneratorTool"/>
+			<Tool
+				Name="VCAuxiliaryManagedWrapperGeneratorTool"/>
+		</Configuration>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;rc;def;r;odl;idl;hpj;bat">
+			<Filter
+				Name="pklib"
+				Filter="">
+				<File
+					RelativePath="stormlib\pklib\crc32.c">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\pklib\explode.c">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\pklib\implode.c">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\pklib\pklib.h">
+				</File>
+			</Filter>
+			<Filter
+				Name="zlib"
+				Filter="">
+				<Filter
+					Name="Zlib Headers"
+					Filter="">
+					<File
+						RelativePath="stormlib\zlib\zconf.h">
+					</File>
+					<File
+						RelativePath="stormlib\zlib\zlib.h">
+					</File>
+				</Filter>
+				<Filter
+					Name="Zlib Sources"
+					Filter="">
+					<File
+						RelativePath="stormlib\zlib\adler32.c">
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\deflate.c">
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\infblock.c">
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\infcodes.c">
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\inffast.c">
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\inflate.c">
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\inftrees.c">
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\infutil.c">
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\trees.c">
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\zmemory.c">
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32">
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"/>
+						</FileConfiguration>
+					</File>
+				</Filter>
+			</Filter>
+			<Filter
+				Name="huffman"
+				Filter="">
+				<File
+					RelativePath="stormlib\huffman\huff.cpp">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\huffman\huff.h">
+				</File>
+			</Filter>
+			<Filter
+				Name="wave"
+				Filter="">
+				<File
+					RelativePath="stormlib\wave\wave.cpp">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\wave\wave.h">
+				</File>
+			</Filter>
+			<Filter
+				Name="bzip2"
+				Filter="*.h;*.c">
+				<File
+					RelativePath="stormlib\bzip2\blocksort.c">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\bzlib.c">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\compress.c">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\crctable.c">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\decompress.c">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\huffman.c">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\randtable.c">
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32">
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"/>
+					</FileConfiguration>
+				</File>
+			</Filter>
+			<Filter
+				Name="vmap"
+				Filter="">
+				<File
+					RelativePath=".\vmapextract\adtfile.cpp">
+				</File>
+				<File
+					RelativePath=".\vmapextract\adtfile.h">
+				</File>
+				<File
+					RelativePath=".\vmapextract\dbcfile.cpp">
+				</File>
+				<File
+					RelativePath=".\vmapextract\dbcfile.h">
+				</File>
+				<File
+					RelativePath=".\vmapextract\model.cpp">
+				</File>
+				<File
+					RelativePath=".\vmapextract\model.h">
+				</File>
+				<File
+					RelativePath=".\vmapextract\modelheaders.h">
+				</File>
+				<File
+					RelativePath=".\vmapextract\mpq.cpp">
+				</File>
+				<File
+					RelativePath=".\vmapextract\mpq.h">
+				</File>
+				<File
+					RelativePath=".\vmapextract\vec3d.h">
+				</File>
+				<File
+					RelativePath=".\vmapextract\vmapexport.cpp">
+				</File>
+				<File
+					RelativePath=".\vmapextract\wdtfile.cpp">
+				</File>
+				<File
+					RelativePath=".\vmapextract\wdtfile.h">
+				</File>
+				<File
+					RelativePath=".\vmapextract\wmo.cpp">
+				</File>
+				<File
+					RelativePath=".\vmapextract\wmo.h">
+				</File>
+			</Filter>
+			<Filter
+				Name="stormlib"
+				Filter="">
+				<File
+					RelativePath=".\stormlib\SCommon.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\SCommon.h">
+				</File>
+				<File
+					RelativePath=".\stormlib\SCompression.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileCompactArchive.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileCreateArchiveEx.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileExtractFile.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileFindFile.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileOpenArchive.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileOpenFileEx.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileReadFile.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\SListFile.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\StormDll.h">
+				</File>
+				<File
+					RelativePath=".\stormlib\StormLib.h">
+				</File>
+				<File
+					RelativePath=".\stormlib\StormPort.h">
+				</File>
+				<File
+					RelativePath=".\stormlib\StormPortLinux.cpp">
+				</File>
+				<File
+					RelativePath=".\stormlib\StormPortMac.cpp">
+				</File>
+			</Filter>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/contrib/vmap_extractor_v2/vmapExtractor_VC80.sln b/contrib/vmap_extractor_v2/vmapExtractor_VC80.sln
new file mode 100644
index 00000000000..cc24730b192
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapExtractor_VC80.sln
@@ -0,0 +1,19 @@
+Microsoft Visual Studio Solution File, Format Version 9.00
+# Visual C++ Express 2005
+Project("{8BC9CEB8-8B4A-11D0-8D11-00A0C91BC942}") = "vmapExtractor", "vmapExtractor_VC80.vcproj", "{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}"
+EndProject
+Global
+	GlobalSection(SolutionConfigurationPlatforms) = preSolution
+		Debug Ansi Static|Win32 = Debug Ansi Static|Win32
+		Release Ansi Static|Win32 = Release Ansi Static|Win32
+	EndGlobalSection
+	GlobalSection(ProjectConfigurationPlatforms) = postSolution
+		{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}.Debug Ansi Static|Win32.ActiveCfg = Debug Ansi Static|Win32
+		{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}.Debug Ansi Static|Win32.Build.0 = Debug Ansi Static|Win32
+		{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}.Release Ansi Static|Win32.ActiveCfg = Release Ansi Static|Win32
+		{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}.Release Ansi Static|Win32.Build.0 = Release Ansi Static|Win32
+	EndGlobalSection
+	GlobalSection(SolutionProperties) = preSolution
+		HideSolutionNode = FALSE
+	EndGlobalSection
+EndGlobal
diff --git a/contrib/vmap_extractor_v2/vmapExtractor_VC80.vcproj b/contrib/vmap_extractor_v2/vmapExtractor_VC80.vcproj
new file mode 100644
index 00000000000..5d8cdea90f7
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapExtractor_VC80.vcproj
@@ -0,0 +1,1000 @@
+<?xml version="1.0" encoding="Windows-1252"?>
+<VisualStudioProject
+	ProjectType="Visual C++"
+	Version="8,00"
+	Name="vmapExtractor"
+	ProjectGUID="{87335BBF-5DA8-4FEC-A51E-1FB948F2FFE9}"
+	>
+	<Platforms>
+		<Platform
+			Name="Win32"
+		/>
+	</Platforms>
+	<ToolFiles>
+	</ToolFiles>
+	<Configurations>
+		<Configuration
+			Name="Debug Ansi Static|Win32"
+			OutputDirectory=".\bin\Win32\DebugAS"
+			IntermediateDirectory=".\bin\Win32\DebugAS"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TypeLibraryName=".\bin\StormLibTest\Win32\DebugAS/StormLibTest.tlb"
+				HeaderFileName=""
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				AdditionalOptions="/wd 4996"
+				Optimization="0"
+				AdditionalIncludeDirectories=".\stormlib"
+				PreprocessorDefinitions="_DEBUG;_CONSOLE;WIN32"
+				BasicRuntimeChecks="3"
+				RuntimeLibrary="1"
+				EnableEnhancedInstructionSet="1"
+				UsePrecompiledHeader="0"
+				PrecompiledHeaderFile=""
+				AssemblerListingLocation=".\bin\Win32\DebugAS/"
+				ObjectFile=".\bin\Win32\DebugAS/"
+				ProgramDataBaseFileName=".\bin\Win32\DebugAS/"
+				BrowseInformation="1"
+				WarningLevel="4"
+				SuppressStartupBanner="true"
+				DebugInformationFormat="4"
+				CompileAs="0"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="_DEBUG"
+				Culture="1029"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile=".\bin\Win32\DebugAS\vmapextract_v2.exe"
+				LinkIncremental="2"
+				SuppressStartupBanner="true"
+				GenerateDebugInformation="true"
+				ProgramDatabaseFile=".\bin\Win32\DebugAS/StormLib.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="Release Ansi Static|Win32"
+			OutputDirectory=".\bin\Win32\ReleaseAS"
+			IntermediateDirectory=".\bin\Win32\ReleaseAS"
+			ConfigurationType="1"
+			InheritedPropertySheets="$(VCInstallDir)VCProjectDefaults\UpgradeFromVC71.vsprops"
+			UseOfMFC="0"
+			ATLMinimizesCRunTimeLibraryUsage="false"
+			CharacterSet="2"
+			>
+			<Tool
+				Name="VCPreBuildEventTool"
+			/>
+			<Tool
+				Name="VCCustomBuildTool"
+			/>
+			<Tool
+				Name="VCXMLDataGeneratorTool"
+			/>
+			<Tool
+				Name="VCWebServiceProxyGeneratorTool"
+			/>
+			<Tool
+				Name="VCMIDLTool"
+				TypeLibraryName=".\bin\StormLibTest\Win32\ReleaseAS/StormLibTest.tlb"
+				HeaderFileName=""
+			/>
+			<Tool
+				Name="VCCLCompilerTool"
+				AdditionalOptions="/wd 4996"
+				Optimization="2"
+				InlineFunctionExpansion="1"
+				AdditionalIncludeDirectories=".\stormlib"
+				PreprocessorDefinitions="NDEBUG;_CONSOLE;WIN32"
+				StringPooling="true"
+				RuntimeLibrary="0"
+				EnableFunctionLevelLinking="true"
+				EnableEnhancedInstructionSet="1"
+				UsePrecompiledHeader="0"
+				PrecompiledHeaderFile=""
+				AssemblerListingLocation=".\bin\Win32\ReleaseAS/"
+				ObjectFile=".\bin\Win32\ReleaseAS/"
+				ProgramDataBaseFileName=".\bin\Win32\ReleaseAS/"
+				WarningLevel="4"
+				SuppressStartupBanner="true"
+				CompileAs="0"
+			/>
+			<Tool
+				Name="VCManagedResourceCompilerTool"
+			/>
+			<Tool
+				Name="VCResourceCompilerTool"
+				PreprocessorDefinitions="NDEBUG"
+				Culture="1029"
+			/>
+			<Tool
+				Name="VCPreLinkEventTool"
+			/>
+			<Tool
+				Name="VCLinkerTool"
+				OutputFile=".\bin\Win32\ReleaseAS\vmapextract_v2.exe"
+				LinkIncremental="1"
+				SuppressStartupBanner="true"
+				ProgramDatabaseFile=".\bin\Win32\ReleaseAS/StormLib.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>
+	</Configurations>
+	<References>
+	</References>
+	<Files>
+		<Filter
+			Name="Source Files"
+			Filter="cpp;c;cxx;rc;def;r;odl;idl;hpj;bat"
+			>
+			<Filter
+				Name="pklib"
+				>
+				<File
+					RelativePath="stormlib\pklib\crc32.c"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\pklib\explode.c"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\pklib\implode.c"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\pklib\pklib.h"
+					>
+				</File>
+			</Filter>
+			<Filter
+				Name="zlib"
+				>
+				<Filter
+					Name="Zlib Headers"
+					>
+					<File
+						RelativePath="stormlib\zlib\zconf.h"
+						>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\zlib.h"
+						>
+					</File>
+				</Filter>
+				<Filter
+					Name="Zlib Sources"
+					>
+					<File
+						RelativePath="stormlib\zlib\adler32.c"
+						>
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\deflate.c"
+						>
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\infblock.c"
+						>
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\infcodes.c"
+						>
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\inffast.c"
+						>
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\inflate.c"
+						>
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\inftrees.c"
+						>
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\infutil.c"
+						>
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\trees.c"
+						>
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+					</File>
+					<File
+						RelativePath="stormlib\zlib\zmemory.c"
+						>
+						<FileConfiguration
+							Name="Debug Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="0"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								BasicRuntimeChecks="3"
+								BrowseInformation="1"
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+						<FileConfiguration
+							Name="Release Ansi Static|Win32"
+							>
+							<Tool
+								Name="VCCLCompilerTool"
+								Optimization="2"
+								AdditionalIncludeDirectories=""
+								PreprocessorDefinitions=""
+								WarningLevel="3"
+							/>
+						</FileConfiguration>
+					</File>
+				</Filter>
+			</Filter>
+			<Filter
+				Name="huffman"
+				>
+				<File
+					RelativePath="stormlib\huffman\huff.cpp"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\huffman\huff.h"
+					>
+				</File>
+			</Filter>
+			<Filter
+				Name="wave"
+				>
+				<File
+					RelativePath="stormlib\wave\wave.cpp"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\wave\wave.h"
+					>
+				</File>
+			</Filter>
+			<Filter
+				Name="bzip2"
+				Filter="*.h;*.c"
+				>
+				<File
+					RelativePath="stormlib\bzip2\blocksort.c"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\bzlib.c"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\compress.c"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\crctable.c"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\decompress.c"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\huffman.c"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+				</File>
+				<File
+					RelativePath="stormlib\bzip2\randtable.c"
+					>
+					<FileConfiguration
+						Name="Debug Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="0"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							BasicRuntimeChecks="3"
+							BrowseInformation="1"
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+					<FileConfiguration
+						Name="Release Ansi Static|Win32"
+						>
+						<Tool
+							Name="VCCLCompilerTool"
+							Optimization="2"
+							AdditionalIncludeDirectories=""
+							PreprocessorDefinitions=""
+							WarningLevel="3"
+						/>
+					</FileConfiguration>
+				</File>
+			</Filter>
+			<Filter
+				Name="vmap"
+				>
+				<File
+					RelativePath=".\vmapextract\adtfile.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\adtfile.h"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\dbcfile.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\dbcfile.h"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\model.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\model.h"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\modelheaders.h"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\mpq.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\mpq.h"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\vec3d.h"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\vmapexport.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\wdtfile.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\wdtfile.h"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\wmo.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\vmapextract\wmo.h"
+					>
+				</File>
+			</Filter>
+			<Filter
+				Name="stormlib"
+				>
+				<File
+					RelativePath=".\stormlib\SCommon.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\SCommon.h"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\SCompression.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileCompactArchive.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileCreateArchiveEx.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileExtractFile.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileFindFile.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileOpenArchive.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileOpenFileEx.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\SFileReadFile.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\SListFile.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\StormDll.h"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\StormLib.h"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\StormPort.h"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\StormPortLinux.cpp"
+					>
+				</File>
+				<File
+					RelativePath=".\stormlib\StormPortMac.cpp"
+					>
+				</File>
+			</Filter>
+		</Filter>
+	</Files>
+	<Globals>
+	</Globals>
+</VisualStudioProject>
diff --git a/contrib/vmap_extractor_v2/vmapextract/adtfile.cpp b/contrib/vmap_extractor_v2/vmapextract/adtfile.cpp
new file mode 100644
index 00000000000..b798263ca64
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/adtfile.cpp
@@ -0,0 +1,227 @@
+#include "adtfile.h"
+
+
+char * GetPlainName(char * FileName)
+{
+    char * szTemp;
+
+    if((szTemp = strrchr(FileName, '\\')) != NULL)
+        FileName = szTemp + 1;
+    return FileName;
+}
+
+void fixnamen(char *name, size_t len)
+{
+	for (size_t i=0; i<len-3; i++) {
+		if (i>0 && name[i]>='A' && name[i]<='Z' && isalpha(name[i-1])) 
+		{
+			name[i] |= 0x20;
+		} else if ((i==0 || !isalpha(name[i-1])) && name[i]>='a' && name[i]<='z') 
+		{
+			name[i] &= ~0x20;
+		}
+	}
+}
+void fixname2(char *name, size_t len)
+{
+	for (size_t i=0; i<len-3; i++) 
+	{
+		if(name[i] == ' ') 
+		name[i] = '_';
+	}
+}
+
+ADTFile::ADTFile(char* filename): ADT(filename)
+{
+	Adtfilename.append(filename);
+}
+
+bool ADTFile::init(char *map_id)
+{
+
+	if(ADT.isEof ())
+		return false;
+
+	size_t size;
+	
+	string xMap;
+	string yMap;
+	
+	Adtfilename.erase(Adtfilename.find(".adt"),4);
+	string TempMapNumber;
+	TempMapNumber = Adtfilename.substr(Adtfilename.length()-6,6);
+    xMap = TempMapNumber.substr(TempMapNumber.find("_")+1,(TempMapNumber.find_last_of("_")-1) - (TempMapNumber.find("_")));
+    yMap = TempMapNumber.substr(TempMapNumber.find_last_of("_")+1,(TempMapNumber.length()) - (TempMapNumber.find_last_of("_")));
+	Adtfilename.erase((Adtfilename.length()-xMap.length()-yMap.length()-2), (xMap.length()+yMap.length()+2));
+	string AdtMapNumber = xMap + ' ' + yMap + ' ' + GetPlainName((char*)Adtfilename.c_str());
+	printf("Processing map %s...\n", AdtMapNumber.c_str());
+	//printf("MapNumber = %s\n", TempMapNumber.c_str());
+    //printf("xMap = %s\n", xMap.c_str());
+    //printf("yMap = %s\n", yMap.c_str());
+
+	const char dirname[] = "buildings\\dir";
+	FILE *dirfile;
+    dirfile = fopen(dirname, "ab");
+	if(!dirfile)
+	{
+		printf("Can't open dirfile!'%s'\n");
+		return false;
+	}
+
+
+	while (!ADT.isEof  ())
+	{
+		char fourcc[5];
+		ADT.read(&fourcc,4);
+		ADT.read(&size, 4);
+		flipcc(fourcc);
+		fourcc[4] = 0;
+
+		size_t nextpos = ADT.getPos () + size;
+		
+		if (!strcmp(fourcc,"MCIN"))//MCIN
+		{
+		
+		}
+		else if (!strcmp(fourcc,"MTEX")) 
+		{
+		}
+		else if (!strcmp(fourcc,"MMDX")) 
+		{
+			
+			if (size) 
+			{
+			    char *buf = new char[size];
+				ADT.read(buf, size);
+				char *p=buf;
+				int t=0;	
+				ModelInstansName = new string[size];
+				while (p<buf+size) 
+				{
+					fixnamen(p,strlen(p));
+					string path(p);
+					char* s=GetPlainName(p);
+					fixname2(s,strlen(s));
+					p=p+strlen(p)+1;
+					ModelInstansName[t++] = s;
+	                path.erase(path.length()-2,2);
+	                path.append("2");
+					char* szLocalFile[512];
+					sprintf((char*)szLocalFile, ".\\buildings\\%s", s);
+					FILE * output = fopen((char*)szLocalFile,"rb");
+	                if(!output)
+	                {
+					
+						Model * m2 = new Model(path);
+					    if(m2->open())
+					        {
+					           m2->ConvertToVMAPModel((char*)szLocalFile); 
+					        }	
+						delete m2;
+
+					}
+					else
+                    fclose(output);    
+				}
+				
+				delete[] buf;
+			}
+			
+		}
+		else if (!strcmp(fourcc,"MWMO")) 
+		{
+			if (size) 
+			{
+			
+				char *buf = new char[size];
+				ADT.read(buf, size);
+				char *p=buf;
+				int q = 0;
+                WmoInstansName = new string[size];
+				while (p<buf+size) 
+				{
+					string path(p);
+                    char* s=GetPlainName(p);
+					fixnamen(s,strlen(s));
+					fixname2(s,strlen(s));
+					p=p+strlen(p)+1;
+					WmoInstansName[q++] = s;
+				}
+				delete[] buf;
+	
+			}
+        
+		}
+        //======================
+        else if (!strcmp(fourcc,"MDDF"))
+        {
+            if (size)
+            {            
+            nMDX = (int)size / 36;
+            for (int i=0; i<nMDX; i++)
+                {
+                    int id;
+                    ADT.read(&id, 4);
+                    ModelInstance inst(ADT,ModelInstansName[id].c_str(),map_id, dirfile);//!!!!!!!!!!!
+                }
+            delete[] ModelInstansName;
+            }
+        }
+        else if (!strcmp(fourcc,"MODF"))
+        {
+            if (size)
+            {
+                nWMO = (int)size / 64;
+                for (int i=0; i<nWMO; i++)
+                {
+                    int id;
+                    ADT.read(&id, 4);
+                    WMOInstance inst(ADT,WmoInstansName[id].c_str(),map_id, dirfile);//!!!!!!!!!!!!!
+                }
+                delete[] WmoInstansName;
+            }        
+        }
+        //======================
+#if 0 
+		else if (!strcmp(fourcc,"MDDF")) 
+		{
+			if (size)
+            {			
+			nMDX = (int)size / 36;
+			for (int i=0; i<nMDX; i++) 
+			    {
+				    int id;
+				    ADT.read(&id, 4);
+				    ModelInstance inst(ADT,ModelInstansName[id].c_str(),AdtMapNumber.c_str(), dirfile);
+			    }
+			delete[] ModelInstansName;
+			}
+		}
+		else if (!strcmp(fourcc,"MODF")) 
+		{
+			if (size)
+            {
+				nWMO = (int)size / 64;
+			    for (int i=0; i<nWMO; i++) 
+			    {
+				    int id;
+				    ADT.read(&id, 4);
+				    WMOInstance inst(ADT,WmoInstansName[id].c_str(),AdtMapNumber.c_str(), dirfile);
+			    }
+                delete[] WmoInstansName;
+			}		
+		}
+#endif
+		ADT.seek(nextpos);
+	}
+	ADT.close();
+    fclose(dirfile);
+	return true;
+}
+
+ADTFile::~ADTFile()
+{
+	ADT.close();
+}
+
+
diff --git a/contrib/vmap_extractor_v2/vmapextract/adtfile.h b/contrib/vmap_extractor_v2/vmapextract/adtfile.h
new file mode 100644
index 00000000000..c1c3de5bc56
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/adtfile.h
@@ -0,0 +1,124 @@
+#ifndef ADT_H
+#define ADT_H
+
+#include "mpq.h"
+#include "wmo.h"
+#include "model.h"
+
+#define __STORMLIB_SELF__ 
+
+#define TILESIZE (533.33333f)
+#define CHUNKSIZE ((TILESIZE) / 16.0f)
+#define UNITSIZE (CHUNKSIZE / 8.0f)
+
+typedef unsigned char uint8;
+typedef unsigned short uint16;
+typedef unsigned int uint32;
+
+class Liquid;
+
+typedef struct {
+float x;
+float y;
+float z;
+}svec;
+
+typedef struct {
+double x;
+double y;
+double z;
+}vec;
+
+typedef struct{
+	vec v[3];
+
+}triangle;	
+
+typedef struct{
+float v9[16*8+1][16*8+1];
+float v8[16*8][16*8];
+}Cell;
+
+typedef struct{
+double v9[9][9];
+double v8[8][8];
+uint16 area_id;
+//Liquid *lq;
+float waterlevel[9][9];
+uint8 flag;
+}chunk;
+
+typedef struct
+{
+chunk ch[16][16];
+}mcell;
+
+struct MapChunkHeader {
+	uint32 flags;
+	uint32 ix;
+	uint32 iy;
+	uint32 nLayers;
+	uint32 nDoodadRefs;
+	uint32 ofsHeight;
+	uint32 ofsNormal;
+	uint32 ofsLayer;
+	uint32 ofsRefs;
+	uint32 ofsAlpha;
+	uint32 sizeAlpha;
+	uint32 ofsShadow;
+	uint32 sizeShadow;
+	uint32 areaid;
+	uint32 nMapObjRefs;
+	uint32 holes;
+	uint16 s1;
+	uint16 s2;
+	uint32 d1;
+	uint32 d2;
+	uint32 d3;
+	uint32 predTex;
+	uint32 nEffectDoodad;
+	uint32 ofsSndEmitters;
+	uint32 nSndEmitters;
+	uint32 ofsLiquid;
+	uint32 sizeLiquid;
+	float  zpos;
+	float  xpos;
+	float  ypos;
+	uint32 textureId;
+	uint32 props;
+	uint32 effectId;
+};
+
+
+class ADTFile
+{
+public:
+	ADTFile(char* filename);
+	~ADTFile();
+	int nWMO;
+	int nMDX;
+	string* WmoInstansName;
+	string* ModelInstansName;
+	bool init(char *map_id);
+	//void LoadMapChunks();
+
+	//uint32 wmo_count;
+/*
+	const mcell& Getmcell() const
+	{
+		return Mcell;
+	}
+*/
+private:
+	//size_t mcnk_offsets[256], mcnk_sizes[256];
+	MPQFile ADT;
+	//mcell Mcell;
+	string Adtfilename;
+};
+
+void fixnamen(char *name, size_t len);
+//void fixMapNamen(char *name, size_t len);
+
+
+#endif
+
diff --git a/contrib/vmap_extractor_v2/vmapextract/dbcfile.cpp b/contrib/vmap_extractor_v2/vmapextract/dbcfile.cpp
new file mode 100644
index 00000000000..d8c8d4a663f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/dbcfile.cpp
@@ -0,0 +1,75 @@
+#include "dbcfile.h"
+#include "mpq.h"
+#include "Stormlib.h"
+#define __STORMLIB_SELF__
+
+DBCFile::DBCFile(const std::string &filename) : filename(filename)
+{
+	data = NULL;
+}
+
+bool DBCFile::open()
+{
+	MPQFile f(filename.c_str());
+
+	// Need some error checking, otherwise an unhandled exception error occurs
+	// if people screw with the data path.
+	if (f.isEof() == true)
+		return false;
+
+	unsigned char header[4];
+	unsigned int na,nb,es,ss;
+
+	f.read(header,4); // File Header
+
+	if (header[0]!='W' || header[1]!='D' || header[2]!='B' || header[3] != 'C') {
+
+		f.close();
+		data = NULL;
+		printf("Critical Error: An error occured while trying to read the DBCFile %s.", filename.c_str());
+		return false;
+	}
+
+	//assert(header[0]=='W' && header[1]=='D' && header[2]=='B' && header[3] == 'C');
+
+	f.read(&na,4); // Number of records
+	f.read(&nb,4); // Number of fields
+	f.read(&es,4); // Size of a record
+	f.read(&ss,4); // String size
+	
+	recordSize = es;
+	recordCount = na;
+	fieldCount = nb;
+	stringSize = ss;
+	//assert(fieldCount*4 == recordSize);
+	assert(fieldCount*4 >= recordSize);
+
+	data = new unsigned char[recordSize*recordCount+stringSize];
+	stringTable = data + recordSize*recordCount;
+	f.read(data,recordSize*recordCount+stringSize);
+	f.close();
+	return true;
+}
+
+DBCFile::~DBCFile()
+{
+	delete [] data;
+}
+
+DBCFile::Record DBCFile::getRecord(size_t id)
+{
+	assert(data);
+	return Record(*this, data + id*recordSize);
+}
+
+DBCFile::Iterator DBCFile::begin()
+{
+	assert(data);
+	return Iterator(*this, data);
+}
+DBCFile::Iterator DBCFile::end()
+{
+	assert(data);
+	return Iterator(*this, stringTable);
+}
+
diff --git a/contrib/vmap_extractor_v2/vmapextract/dbcfile.h b/contrib/vmap_extractor_v2/vmapextract/dbcfile.h
new file mode 100644
index 00000000000..bf6b8635a96
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/dbcfile.h
@@ -0,0 +1,139 @@
+#ifndef DBCFILE_H
+#define DBCFILE_H
+#define __STORMLIB_SELF__
+
+#include <cassert>
+#include <string>
+#include "Stormlib.h"
+
+class DBCFile
+{
+public:
+	DBCFile(const std::string &filename);
+	~DBCFile();
+
+	// Open database. It must be openened before it can be used.
+	bool open();
+
+	// TODO: Add a close function?
+
+	// Database exceptions
+	class Exception
+	{
+	public:
+		Exception(const std::string &message): message(message)
+		{ }
+		virtual ~Exception()
+		{ }
+		const std::string &getMessage() {return message;}
+	private:
+		std::string message;
+	};
+
+	// 
+	class NotFound: public Exception
+	{
+	public:
+		NotFound(): Exception("Key was not found")
+		{ }
+	};
+
+	// Iteration over database
+	class Iterator;
+	class Record
+	{
+	public:
+		Record& operator= (const Record& r)
+		{
+            file = r.file;
+			offset = r.offset;
+			return *this;
+		}
+		float getFloat(size_t field) const
+		{
+			assert(field < file.fieldCount);
+			return *reinterpret_cast<float*>(offset+field*4);
+		}
+		unsigned int getUInt(size_t field) const
+		{
+			assert(field < file.fieldCount);
+			return *reinterpret_cast<unsigned int*>(offset+(field*4));
+		}
+		int getInt(size_t field) const
+		{
+			assert(field < file.fieldCount);
+			return *reinterpret_cast<int*>(offset+field*4);
+		}
+		unsigned char getByte(size_t ofs) const
+		{
+			assert(ofs < file.recordSize);
+			return *reinterpret_cast<unsigned char*>(offset+ofs);
+		}
+		const char *getString(size_t field) const
+		{
+			assert(field < file.fieldCount);
+			size_t stringOffset = getUInt(field);
+			assert(stringOffset < file.stringSize);
+			//char * tmp = (char*)file.stringTable + stringOffset;
+			//unsigned char * tmp2 = file.stringTable + stringOffset;
+			return reinterpret_cast<char*>(file.stringTable + stringOffset);
+		}
+	private:
+		Record(DBCFile &file, unsigned char *offset): file(file), offset(offset) {}
+		unsigned char *offset;
+		DBCFile &file;
+
+		friend class DBCFile;
+		friend class Iterator;
+	};
+
+	/* Iterator that iterates over records */
+	class Iterator
+	{
+	public:
+		Iterator(DBCFile &file, unsigned char *offset): 
+			record(file, offset) {}
+		/// Advance (prefix only)
+		Iterator & operator++() { 
+			record.offset += record.file.recordSize;
+			return *this; 
+		}	
+		/// Return address of current instance
+		Record const & operator*() const { return record; }
+		const Record* operator->() const {
+			return &record;
+		}
+		/// Comparison
+		bool operator==(const Iterator &b) const
+		{
+			return record.offset == b.record.offset;
+		}
+		bool operator!=(const Iterator &b) const
+		{
+			return record.offset != b.record.offset;
+		}
+	private:
+		Record record;
+	};
+
+	// Get record by id
+	Record getRecord(size_t id);
+	/// Get begin iterator over records
+	Iterator begin();
+	/// Get begin iterator over records
+	Iterator end();
+	/// Trivial
+	size_t getRecordCount() const { return recordCount;}
+	size_t getFieldCount() const { return fieldCount; }
+
+private:
+	std::string filename;
+	size_t recordSize;
+	size_t recordCount;
+	size_t fieldCount;
+	size_t stringSize;
+	unsigned char *data;
+	unsigned char *stringTable;
+};
+
+#endif
diff --git a/contrib/vmap_extractor_v2/vmapextract/model.cpp b/contrib/vmap_extractor_v2/vmapextract/model.cpp
new file mode 100644
index 00000000000..7dca7841d74
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/model.cpp
@@ -0,0 +1,261 @@
+//#include "common.h"
+#include "model.h"
+//#include "world.h"
+#include <cassert>
+#include <algorithm>
+
+//int globalTime = 0;
+
+Model::Model(std::string &filename) : filename(filename)
+{
+}
+
+bool Model::open()
+{
+    MPQFile f(filename.c_str());
+
+    ok = !f.isEof();
+
+    if (!ok) 
+    {
+        f.close();
+        printf("Error loading model %s\n", filename.c_str());
+        return false;
+    }
+
+    memcpy(&header, f.getBuffer(), sizeof(ModelHeader));
+    if(header.nBoundingTriangles > 0) {
+
+#if 0
+        animated = isAnimated(f);
+        if(animated)
+        {
+            f.close();
+            return false;
+        }
+#endif
+        trans = 1.0f;
+        origVertices = (ModelVertex*)(f.getBuffer() + header.ofsVertices);
+
+        vertices = new Vec3D[header.nVertices];
+        normals = new Vec3D[header.nVertices];
+
+        for (size_t i=0; i<header.nVertices; i++) 
+        {
+            origVertices[i].pos = fixCoordSystem(origVertices[i].pos);
+            origVertices[i].normal = fixCoordSystem(origVertices[i].normal);
+            vertices[i] = origVertices[i].pos;
+            normals[i] = origVertices[i].normal.normalize();	
+        }
+
+        ModelView *view = (ModelView*)(f.getBuffer() + header.ofsViews);
+
+        uint16 *indexLookup = (uint16*)(f.getBuffer() + view->ofsIndex);
+        uint16 *triangles = (uint16*)(f.getBuffer() + view->ofsTris);
+
+        nIndices = view->nTris;
+        indices = new uint16[nIndices];
+        for (size_t i = 0; i<nIndices; i++) 
+        {
+            indices[i] = indexLookup[triangles[i]];
+        }
+        f.close();
+    } else {
+        //printf("not included %s\n", filename.c_str());
+        return false;
+    }
+    return true;
+
+}
+
+bool Model::isAnimated(MPQFile &f)
+{
+    // see if we have any animated bones
+    ModelBoneDef *bo = (ModelBoneDef*)(f.getBuffer() + header.ofsBones);
+
+    animGeometry = false;
+    animBones = false;
+    ind = false;
+
+    ModelVertex *verts = (ModelVertex*)(f.getBuffer() + header.ofsVertices);
+    for (size_t i=0; i<header.nVertices && !animGeometry; i++) {
+        for (size_t b=0; b<4; b++) {
+            if (verts[i].weights[b]>0) {
+                ModelBoneDef &bb = bo[verts[i].bones[b]];
+                if (bb.translation.type || bb.rotation.type || bb.scaling.type || (bb.flags&8)) {
+                    if (bb.flags&8) {
+                        // if we have billboarding, the model will need per-instance animation
+                        ind = true;
+                    }
+                    animGeometry = true;
+                    break;
+                }
+            }
+        }
+    }
+
+    if (animGeometry) animBones = true;
+    else {
+        for (size_t i=0; i<header.nBones; i++) {
+            ModelBoneDef &bb = bo[i];
+            if (bb.translation.type || bb.rotation.type || bb.scaling.type) {
+                animBones = true;
+                break;
+            }
+        }
+    }
+
+    animTextures = header.nTexAnims > 0;
+
+    bool animMisc = header.nCameras>0 || // why waste time, pretty much all models with cameras need animation
+        header.nLights>0 || // same here
+        header.nParticleEmitters>0 ||
+        header.nRibbonEmitters>0;
+
+    if (animMisc) animBones = true;
+
+    // animated colors
+    if (header.nColors) {
+        ModelColorDef *cols = (ModelColorDef*)(f.getBuffer() + header.ofsColors);
+        for (size_t i=0; i<header.nColors; i++) {
+            if (cols[i].color.type!=0 || cols[i].opacity.type!=0) {
+                animMisc = true;
+                break;
+            }
+        }
+    }
+
+    // animated opacity
+    if (header.nTransparency && !animMisc) {
+        ModelTransDef *trs = (ModelTransDef*)(f.getBuffer() + header.ofsTransparency);
+        for (size_t i=0; i<header.nTransparency; i++) {
+            if (trs[i].trans.type!=0) {
+                animMisc = true;
+                break;
+            }
+        }
+    }
+
+    // guess not...
+    return animGeometry || animTextures || animMisc;
+}
+
+bool Model::ConvertToVMAPModel(char * outfilename)
+{
+
+    int N[] = {0x00000000};
+    FILE * output=fopen(outfilename,"wb");
+    if(!output)
+    {
+        printf("Can't create the output file '%s'\n",outfilename);
+        return false;
+    }
+    fwrite("VMAP002",8,1,output);
+    int nVertices = header.nVertices;
+    fwrite(&nVertices, sizeof(int), 1, output);
+    uint32 nofgroups = 1;
+    fwrite(&nofgroups,sizeof(uint32), 1, output);
+    fwrite(N,4,1,output);
+    fwrite("GRP ",4,1,output);
+    uint32 branches = 1;
+    int wsize;
+    wsize = sizeof(branches) + sizeof(uint32) * branches;
+    fwrite(&wsize, sizeof(int), 1, output);
+    fwrite(&branches,sizeof(branches), 1, output);
+    uint32 nIdexes = (uint32) nIndices;
+    fwrite(&nIndices,sizeof(uint32), 1, output);
+    fwrite("INDX",4, 1, output);
+    wsize = sizeof(uint32) + sizeof(unsigned short) * nIdexes;
+    fwrite(&wsize, sizeof(int), 1, output);
+    fwrite(&nIdexes, sizeof(uint32), 1, output);
+    if(nIdexes >0) 
+    {
+        fwrite(indices, sizeof(unsigned short), nIdexes, output);
+    }
+    fwrite("VERT",4, 1, output);
+    wsize = sizeof(int) + sizeof(float) * 3 * nVertices;
+    fwrite(&wsize, sizeof(int), 1, output);
+    fwrite(&nVertices, sizeof(int), 1, output);
+    if(nVertices >0) 
+    {
+        for(int vpos=0; vpos <nVertices; ++vpos) 
+        {
+            float sy = vertices[vpos].y;
+            vertices[vpos].y = vertices[vpos].z;
+            vertices[vpos].z = sy;
+        }
+        fwrite(vertices, sizeof(float)*3, nVertices, output);
+    }
+
+    delete[] vertices;
+    delete[] indices;
+    delete[] normals;
+
+    fclose(output);
+
+    return true;
+}
+
+Model::~Model()
+{
+}
+
+Vec3D fixCoordSystem(Vec3D v)
+{
+    return Vec3D(v.x, v.z, -v.y);
+}
+
+Vec3D fixCoordSystem2(Vec3D v)
+{
+    return Vec3D(v.x, v.z, v.y);
+}
+
+ModelInstance::ModelInstance(MPQFile &f,const char* ModelInstName,const char*MapName,  FILE *pDirfile)
+{
+    float ff[3];
+    f.read(&d1, 4);
+    f.read(ff,12);
+    pos = Vec3D(ff[0],ff[1],ff[2]);
+    f.read(ff,12);
+    rot = Vec3D(ff[0],ff[1],ff[2]);
+    f.read(&scale,4);
+    // scale factor - divide by 1024. blizzard devs must be on crack, why not just use a float?
+    sc = scale / 1024.0f;
+
+    char tempname[512];
+    sprintf(tempname, ".\\buildings\\%s", ModelInstName);
+    FILE *input;
+    input = fopen(tempname, "r+b");
+    if(!input)
+    {
+        return;
+    }
+    fseek(input, 8, SEEK_SET); // get the correct no of vertices
+	int nVertices;
+	fread(&nVertices, sizeof (int), 1, input);
+	fclose(input);
+    if(nVertices == 0)
+    {
+        return;
+    }
+
+    if(pDirfile) 
+    {
+        int realx1 = (int) ((float) pos.x / 533.333333f);
+        int realy1 = (int) ((float) pos.z / 533.333333f);
+        int realx2 = (int) ((float) pos.x / 533.333333f);
+        int realy2 = (int) ((float) pos.z / 533.333333f);
+
+
+        fprintf(pDirfile,"%s/%s %f,%f,%f_%f,%f,%f %f %d %d %d,%d %d\n",
+            MapName,
+            ModelInstName,
+            (float) pos.x, (float) pos.y, (float) pos.z,
+            (float) rot.x, (float) rot.y, (float) rot.z,
+            sc,
+            nVertices,
+            realx1, realy1,
+            realx2, realy2
+            );				
+    }
+}
diff --git a/contrib/vmap_extractor_v2/vmapextract/model.h b/contrib/vmap_extractor_v2/vmapextract/model.h
new file mode 100644
index 00000000000..0af492f922c
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/model.h
@@ -0,0 +1,77 @@
+#ifndef MODEL_H
+#define MODEL_H
+
+#include "vec3d.h"
+#include "mpq.h"
+#include "modelheaders.h"
+//#include "quaternion.h"
+#include <vector>
+
+class Model;
+class WMOInstance;
+
+Vec3D fixCoordSystem(Vec3D v);
+
+
+
+
+class Model
+{ 
+public:
+	ModelHeader header;
+	ModelAnimation *anims;
+	int *globalSequences;
+	
+public:
+	bool animGeometry,animTextures,animBones;
+	bool animated;
+
+	bool isAnimated(MPQFile &f);
+	ModelVertex *origVertices;
+	Vec3D *vertices, *normals;
+	uint16 *indices;
+	size_t nIndices;
+	
+	bool open();
+	bool ConvertToVMAPModel(char * outfilename);
+
+public:
+
+	bool ok;
+	bool ind;
+
+	float rad;
+	float trans;
+	bool animcalc;
+	int anim, animtime;
+
+	Model(std::string &filename);
+	~Model();
+	
+private:
+	std::string filename;
+	char outfilename;
+};
+
+class ModelInstance 
+{
+public:
+	Model *model;
+
+	int id;
+
+	Vec3D pos, rot;
+	unsigned int d1, scale;
+
+	float frot,w,sc;
+
+	int light;
+	Vec3D ldir;
+	Vec3D lcol;
+
+	ModelInstance() {}
+	ModelInstance(MPQFile &f,const char* ModelInstName,const char*MapName, FILE *pDirfile);
+
+};
+
+#endif
diff --git a/contrib/vmap_extractor_v2/vmapextract/modelheaders.h b/contrib/vmap_extractor_v2/vmapextract/modelheaders.h
new file mode 100644
index 00000000000..7d5e800e796
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/modelheaders.h
@@ -0,0 +1,304 @@
+#ifndef MODELHEADERS_H
+#define MODELHEADERS_H
+
+typedef unsigned char uint8;
+typedef char int8;
+typedef unsigned short uint16;
+typedef short int16;
+typedef unsigned int uint32;
+typedef int int32;
+
+#pragma pack(push,1)
+
+struct ModelHeader {
+	char id[4];
+	uint8 version[4];
+	uint32 nameLength;
+	uint32 nameOfs;
+	uint32 type;
+
+	uint32 nGlobalSequences;
+	uint32 ofsGlobalSequences;
+	uint32 nAnimations;
+	uint32 ofsAnimations;
+	uint32 nC;
+	uint32 ofsC;
+	uint32 nD;
+	uint32 ofsD;
+	uint32 nBones;
+	uint32 ofsBones;
+	uint32 nF;
+	uint32 ofsF;
+
+	uint32 nVertices;
+	uint32 ofsVertices;
+	uint32 nViews;
+	uint32 ofsViews;
+
+	uint32 nColors;
+	uint32 ofsColors;
+
+	uint32 nTextures;
+	uint32 ofsTextures;
+
+	uint32 nTransparency; // H
+	uint32 ofsTransparency;
+	uint32 nI;   // always unused ?
+	uint32 ofsI;
+	uint32 nTexAnims;	// J
+	uint32 ofsTexAnims;
+	uint32 nK;
+	uint32 ofsK;
+
+	uint32 nTexFlags;
+	uint32 ofsTexFlags;
+	uint32 nY;
+	uint32 ofsY;
+
+	uint32 nTexLookup;
+	uint32 ofsTexLookup;
+
+	uint32 nTexUnitLookup;		// L
+	uint32 ofsTexUnitLookup;
+	uint32 nTransparencyLookup; // M
+	uint32 ofsTransparencyLookup;
+	uint32 nTexAnimLookup;
+	uint32 ofsTexAnimLookup;
+
+	float floats[14];
+
+	uint32 nBoundingTriangles;
+	uint32 ofsBoundingTriangles;
+	uint32 nBoundingVertices;
+	uint32 ofsBoundingVertices;
+	uint32 nBoundingNormals;
+	uint32 ofsBoundingNormals;
+
+	uint32 nO;
+	uint32 ofsO;
+	uint32 nP;
+	uint32 ofsP;
+	uint32 nQ;
+	uint32 ofsQ;
+	uint32 nLights; // R
+	uint32 ofsLights;
+	uint32 nCameras; // S
+	uint32 ofsCameras;
+	uint32 nT;
+	uint32 ofsT;
+	uint32 nRibbonEmitters; // U
+	uint32 ofsRibbonEmitters;
+	uint32 nParticleEmitters; // V
+	uint32 ofsParticleEmitters;
+
+};
+
+// block B - animations
+struct ModelAnimation {
+	uint32 animID;
+	uint32 timeStart;
+	uint32 timeEnd;
+
+	float moveSpeed;
+
+	uint32 loopType;
+	uint32 flags;
+	uint32 d1;
+	uint32 d2;
+	uint32 playSpeed;  // note: this can't be play speed because it's 0 for some models
+
+	Vec3D boxA, boxB;
+	float rad;
+
+	int16 s[2];
+};
+
+
+// sub-block in block E - animation data
+struct AnimationBlock {
+	int16 type;		// interpolation type (0=none, 1=linear, 2=hermite)
+	int16 seq;		// global sequence id or -1
+	uint32 nRanges;
+	uint32 ofsRanges;
+	uint32 nTimes;
+	uint32 ofsTimes;
+	uint32 nKeys;
+	uint32 ofsKeys;
+};
+
+// block E - bones
+struct ModelBoneDef {
+	int32 animid;
+	int32 flags;
+	int16 parent; // parent bone index
+	int16 geoid;
+	// new int added to the bone definitions.  Added in WoW 2.0
+	int32 unknown;
+	AnimationBlock translation;
+	AnimationBlock rotation;
+	AnimationBlock scaling;
+	Vec3D pivot;
+};
+
+struct ModelTexAnimDef {
+	AnimationBlock trans, rot, scale;
+};
+
+struct ModelVertex {
+	Vec3D pos;
+	uint8 weights[4];
+	uint8 bones[4];
+	Vec3D normal;
+	Vec2D texcoords;
+	int unk1, unk2; // always 0,0 so this is probably unused
+};
+
+struct ModelView {
+    uint32 nIndex, ofsIndex; // Vertices in this model (index into vertices[])
+    uint32 nTris, ofsTris;	 // indices
+    uint32 nProps, ofsProps; // additional vtx properties
+    uint32 nSub, ofsSub;	 // materials/renderops/submeshes
+    uint32 nTex, ofsTex;	 // material properties/textures
+	int32 lod;				 // LOD bias?
+};
+
+
+/// One material + render operation
+struct ModelGeoset {
+	uint16 d1;		// mesh part id?
+	uint16 d2;		// ?
+	uint16 vstart;	// first vertex
+	uint16 vcount;	// num vertices
+	uint16 istart;	// first index
+	uint16 icount;	// num indices
+	uint16 d3;		// number of bone indices
+	uint16 d4;		// offset into bone index list
+	uint16 d5;		// ?
+	uint16 d6;		// root bone?
+	Vec3D v;
+	float unknown[4];	// Added in WoW 2.0?
+};
+
+/// A texture unit (sub of material)
+struct ModelTexUnit{
+	// probably the texture units
+	// size always >=number of materials it seems
+	uint16 flags;		// Flags
+	uint16 order;		// ?
+	uint16 op;			// Material this texture is part of (index into mat)
+	uint16 op2;			// Always same as above?
+	int16 colorIndex;	// color or -1
+	uint16 flagsIndex;	// more flags...
+	uint16 texunit;		// Texture unit (0 or 1)
+	uint16 d4;			// ? (seems to be always 1)
+	uint16 textureid;	// Texture id (index into global texture list)
+	uint16 texunit2;	// copy of texture unit value?
+	uint16 transid;		// transparency id (index into transparency list)
+	uint16 texanimid;	// texture animation id
+};
+
+// block X - render flags
+struct ModelRenderFlags {
+	uint16 flags;
+	uint16 blend;
+};
+
+// block G - color defs
+struct ModelColorDef {
+	AnimationBlock color;
+	AnimationBlock opacity;
+};
+
+// block H - transp defs
+struct ModelTransDef {
+	AnimationBlock trans;
+};
+
+struct ModelTextureDef {
+	uint32 type;
+	uint32 flags;
+	uint32 nameLen;
+	uint32 nameOfs;
+};
+
+struct ModelLightDef {
+	int16 type;
+	int16 bone;
+	Vec3D pos;
+	AnimationBlock ambColor;
+	AnimationBlock ambIntensity;
+	AnimationBlock color;
+	AnimationBlock intensity;
+	AnimationBlock attStart;
+	AnimationBlock attEnd;
+	AnimationBlock unk1;
+};
+
+struct ModelCameraDef {
+	int32 id;
+	float fov, farclip, nearclip;
+	AnimationBlock transPos;
+	Vec3D pos;
+	AnimationBlock transTarget;
+	Vec3D target;
+	AnimationBlock rot;
+};
+
+
+struct ModelParticleParams {
+	float mid;
+	uint32 colors[3];
+	float sizes[3];
+	int16 d[10];
+	float unk[3];
+	float scales[3];
+	float slowdown;
+	float rotation;
+	float f2[16];
+};
+
+struct ModelParticleEmitterDef {
+    int32 id;
+	int32 flags;
+	Vec3D pos;
+	int16 bone;
+	int16 texture;
+	int32 nZero1;
+	int32 ofsZero1;
+	int32 nZero2;
+	int32 ofsZero2;
+	int16 blend;
+	int16 type;
+	int16 s1;
+	int16 s2;
+	int16 cols;
+	int16 rows;
+	AnimationBlock params[10];
+	ModelParticleParams p;
+	AnimationBlock unk;
+};
+
+
+struct ModelRibbonEmitterDef {
+	int32 id;
+	int32 bone;
+	Vec3D pos;
+	int32 nTextures;
+	int32 ofsTextures;
+	int32 nUnknown;
+	int32 ofsUnknown;
+	AnimationBlock color;
+	AnimationBlock opacity;
+	AnimationBlock above;
+	AnimationBlock below;
+	float res, length, unk;
+	int16 s1, s2;
+	AnimationBlock unk1;
+	AnimationBlock unk2;
+};
+
+
+#pragma pack(pop)
+
+
+#endif
+\ No newline at end of file
diff --git a/contrib/vmap_extractor_v2/vmapextract/mpq.cpp b/contrib/vmap_extractor_v2/vmapextract/mpq.cpp
new file mode 100644
index 00000000000..ae847d8be33
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/mpq.cpp
@@ -0,0 +1,136 @@
+#include "mpq.h"
+//#include <vector>
+#include "Stormlib.h"
+#define __STORMLIB_SELF__
+
+typedef std::vector<MPQArchive*> ArchiveSet;
+ArchiveSet gOpenArchives;
+//xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+MPQArchive::MPQArchive(const char* filename)
+{
+	BOOL succ = SFileOpenArchive(filename, 0, 0,&hMPQ);
+	if (succ) 
+	{
+		MPQArchive*ar = (MPQArchive*)(hMPQ);
+		printf("Opening %s\n", filename);
+		gOpenArchives.push_back(ar);
+        succ = true;
+		
+	} 
+	else 
+	{
+		printf("Error!!!Not open archive %s\n", filename);
+	}
+}
+
+void MPQArchive::close()
+{
+	SFileCloseArchive(hMPQ);
+}
+
+//xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+MPQFile::MPQFile(const char* filename):
+	eof(false),
+	buffer(0),
+	pointer(0),
+	size(0)
+{
+	for(ArchiveSet::iterator i=gOpenArchives.begin(); i!=gOpenArchives.end();++i)
+	{  
+		
+	 HANDLE hFile = "";
+	 MPQArchive*(hMPQ) = *i;
+	 BOOL succ = SFileOpenFileEx(hMPQ,filename,0, &hFile);
+	   if (succ) 
+	   {
+		 DWORD s = SFileGetFileSize(hFile, 0);
+		 if (!s)
+		 {
+			eof = true;
+			buffer = 0;
+			return;
+		 }
+         size = (size_t)s;
+		 buffer = new char[s];
+		 SFileReadFile(hFile, buffer, s, 0, 0);
+		 SFileCloseFile(hFile);
+		 
+		 eof = false;
+		 return;
+	   }
+	}   
+     
+	eof = true;
+	buffer = 0;
+	  
+}
+
+MPQFile::~MPQFile()
+{
+	close();
+}
+
+size_t MPQFile::read(void* dest, size_t bytes)
+{
+	if (eof) 
+	return 0;
+
+	size_t rpos = pointer + bytes;
+	if (rpos > size) 
+	{
+		bytes = size - pointer;
+		eof = true;
+	}
+
+	memcpy(dest, &(buffer[pointer]), bytes);
+
+	pointer = rpos;
+
+	return bytes;
+}
+
+bool MPQFile::isEof()
+{
+    return eof;
+}
+
+void MPQFile::seek(int offset)
+{
+	pointer = offset;
+	eof = (pointer >= size);
+}
+
+void MPQFile::seekRelative(int offset)
+{
+	pointer += offset;
+	eof = (pointer >= size);
+}
+
+void MPQFile::close()
+{
+	if (buffer) 
+	delete[] buffer;
+	buffer = 0;
+	eof = true;
+}
+
+size_t MPQFile::getSize()
+{
+	return size;
+}
+
+size_t MPQFile::getPos()
+{
+	return pointer;
+}
+
+char* MPQFile::getBuffer()
+{
+	return buffer;
+}
+
+char* MPQFile::getPointer()
+{
+	return buffer + pointer;
+}
+
diff --git a/contrib/vmap_extractor_v2/vmapextract/mpq.h b/contrib/vmap_extractor_v2/vmapextract/mpq.h
new file mode 100644
index 00000000000..79f30afc79b
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/mpq.h
@@ -0,0 +1,69 @@
+#define _CRT_SECURE_NO_DEPRECATE
+
+#ifndef MPQ_H
+#define MPQ_H
+
+#define __STORMLIB_SELF__ 
+
+#include <string.h>
+#include <ctype.h>
+#include <vector>
+#include <iostream>
+#include "Stormlib.h"
+
+using namespace std;
+
+typedef unsigned int uint32;
+
+
+class MPQArchive
+{
+	
+public:
+	HANDLE hMPQ;
+	MPQArchive(const char* filename);
+	void close();
+};
+ 
+class MPQFile
+{
+	HANDLE hFile;
+    HANDLE hMPQ;
+	bool eof;
+	char *buffer;
+	size_t pointer,
+	size;
+
+	// disable copying
+	//MPQFile(const MPQFile &f) {}
+	//void operator=(const MPQFile &f) {}
+
+public:
+	MPQFile(const char* filename);
+	~MPQFile();
+	size_t read(void* dest, size_t bytes);
+	size_t getSize();
+	size_t getPos();
+	char* getBuffer();
+	char* getPointer();
+	bool isEof();
+	void seek(int offset);
+	void seekRelative(int offset);
+	void close();
+};
+
+inline void flipcc(char *fcc)
+{
+	char t;
+	t=fcc[0];
+	fcc[0]=fcc[3];
+	fcc[3]=t;
+	t=fcc[1];
+	fcc[1]=fcc[2];
+	fcc[2]=t;
+}
+
+
+
+#endif
+
diff --git a/contrib/vmap_extractor_v2/vmapextract/vec3d.h b/contrib/vmap_extractor_v2/vmapextract/vec3d.h
new file mode 100644
index 00000000000..88b8e1c4f32
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/vec3d.h
@@ -0,0 +1,230 @@
+#ifndef VEC3D_H
+#define VEC3D_H
+
+#include <iostream>
+#include <cmath>
+
+
+
+class Vec3D {
+public:
+	float x,y,z;
+
+	Vec3D(float x0 = 0.0f, float y0 = 0.0f, float z0 = 0.0f) : x(x0), y(y0), z(z0) {}
+
+	Vec3D(const Vec3D& v) : x(v.x), y(v.y), z(v.z) {}
+
+	Vec3D& operator= (const Vec3D &v) {
+        x = v.x;
+		y = v.y;
+		z = v.z;
+		return *this;
+	}
+
+	Vec3D operator+ (const Vec3D &v) const
+	{
+		Vec3D r(x+v.x,y+v.y,z+v.z);
+        return r;
+	}
+
+	Vec3D operator- (const Vec3D &v) const
+	{
+		Vec3D r(x-v.x,y-v.y,z-v.z);
+		return r;
+	}
+
+	float operator* (const Vec3D &v) const
+	{
+        return x*v.x + y*v.y + z*v.z;
+	}
+
+	Vec3D operator* (float d) const
+	{
+		Vec3D r(x*d,y*d,z*d);
+        return r;
+	}
+
+	friend Vec3D operator* (float d, const Vec3D& v)
+	{
+		return v * d;
+	}
+
+	Vec3D operator% (const Vec3D &v) const
+	{
+        Vec3D r(y*v.z-z*v.y, z*v.x-x*v.z, x*v.y-y*v.x);
+		return r;
+	}
+
+	Vec3D& operator+= (const Vec3D &v)
+	{
+		x += v.x;
+		y += v.y;
+		z += v.z;
+		return *this;
+	}
+
+	Vec3D& operator-= (const Vec3D &v)
+	{
+		x -= v.x;
+		y -= v.y;
+		z -= v.z;
+		return *this;
+	}
+
+	Vec3D& operator*= (float d)
+	{
+		x *= d;
+		y *= d;
+		z *= d;
+		return *this;
+	}
+
+	float lengthSquared() const
+	{
+		return x*x+y*y+z*z;
+	}
+
+	float length() const
+	{
+        return sqrt(x*x+y*y+z*z);
+	}
+
+	Vec3D& normalize()
+	{
+		this->operator*= (1.0f/length());
+		return *this;
+	}
+
+	Vec3D operator~ () const
+	{
+		Vec3D r(*this);
+        r.normalize();
+		return r;
+	}
+
+	friend std::istream& operator>>(std::istream& in, Vec3D& v)
+	{
+		in >> v.x >> v.y >> v.z;
+		return in;
+	}
+
+	operator float*()
+	{
+		return (float*)this;
+	}
+
+};
+
+
+class Vec2D {
+public:
+	float x,y;
+	
+	Vec2D(float x0 = 0.0f, float y0 = 0.0f) : x(x0), y(y0) {}
+
+	Vec2D(const Vec2D& v) : x(v.x), y(v.y) {}
+
+	Vec2D& operator= (const Vec2D &v) {
+        x = v.x;
+		y = v.y;
+		return *this;
+	}
+
+	Vec2D operator+ (const Vec2D &v) const
+	{
+		Vec2D r(x+v.x,y+v.y);
+        return r;
+	}
+
+	Vec2D operator- (const Vec2D &v) const
+	{
+		Vec2D r(x-v.x,y-v.y);
+		return r;
+	}
+
+	float operator* (const Vec2D &v) const
+	{
+        return x*v.x + y*v.y;
+	}
+
+	Vec2D operator* (float d) const
+	{
+		Vec2D r(x*d,y*d);
+        return r;
+	}
+
+	friend Vec2D operator* (float d, const Vec2D& v)
+	{
+		return v * d;
+	}
+
+	Vec2D& operator+= (const Vec2D &v)
+	{
+		x += v.x;
+		y += v.y;
+		return *this;
+	}
+
+	Vec2D& operator-= (const Vec2D &v)
+	{
+		x -= v.x;
+		y -= v.y;
+		return *this;
+	}
+
+	Vec2D& operator*= (float d)
+	{
+		x *= d;
+		y *= d;
+		return *this;
+	}
+
+	float lengthSquared() const
+	{
+		return x*x+y*y;
+	}
+
+	float length() const
+	{
+        return sqrt(x*x+y*y);
+	}
+
+	Vec2D& normalize()
+	{
+		this->operator*= (1.0f/length());
+		return *this;
+	}
+
+	Vec2D operator~ () const
+	{
+		Vec2D r(*this);
+        r.normalize();
+		return r;
+	}
+
+
+	friend std::istream& operator>>(std::istream& in, Vec2D& v)
+	{
+        in >> v.x >> v.y;
+		return in;
+	}
+
+	operator float*()
+	{
+		return (float*)this;
+	}
+
+};
+
+
+inline void rotate(float x0, float y0, float *x, float *y, float angle)
+{
+	float xa = *x - x0, ya = *y - y0;
+	*x = xa*cosf(angle) - ya*sinf(angle) + x0;
+	*y = xa*sinf(angle) + ya*cosf(angle) + y0;
+}
+
+
+
+#endif
+
diff --git a/contrib/vmap_extractor_v2/vmapextract/vmapexport.cpp b/contrib/vmap_extractor_v2/vmapextract/vmapexport.cpp
new file mode 100644
index 00000000000..dfc7cddcfdd
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/vmapexport.cpp
@@ -0,0 +1,566 @@
+/*****************************************************************************/
+/* StormLibTest.cpp                       Copyright (c) Ladislav Zezula 2003 */
+/*---------------------------------------------------------------------------*/
+/* This module uses very brutal test methods for StormLib. It extracts all   */
+/* files from the archive with Storm.dll and with stormlib and compares them,*/
+/* then tries to build a copy of the entire archive, then removes a few files*/
+/* from the archive and adds them back, then compares the two archives, ...  */
+/*---------------------------------------------------------------------------*/
+/*   Date    Ver   Who  Comment                                              */
+/* --------  ----  ---  -------                                              */
+/* 25.03.03  1.00  Lad  The first version of StormLibTest.cpp                */
+/*****************************************************************************/
+
+#define _CRT_SECURE_NO_DEPRECATE
+#include <io.h>
+#include <conio.h>
+#include <stdio.h>
+#include <windows.h>
+#include <mmsystem.h>
+#include <vector>
+#include <list>
+
+
+#define __STORMLIB_SELF__               // Don't use StormLib.lib
+#include "StormLib.h"
+
+#pragma warning(disable : 4505) 
+#pragma comment(lib, "Winmm.lib")
+
+//From Extractor
+#include "adtfile.h"
+#include "wdtfile.h"
+#include "dbcfile.h"
+#include "mpq.h"
+#include "wmo.h"
+
+//------------------------------------------------------------------------------
+// Defines
+
+#define MPQ_BLOCK_SIZE 0x1000
+
+//-----------------------------------------------------------------------------
+// from extractor
+typedef unsigned char uint8;
+typedef unsigned short uint16;
+typedef unsigned int uint32;
+typedef struct{
+    char name[64];
+    unsigned int id;
+}map_id;
+
+map_id * map_ids;
+uint16 * areas;
+uint16 *areamax;
+uint32 map_count;
+char output_path[128]=".";
+char input_path[1024]=".";
+bool hasInputPathParam = false;
+char tmp[512];
+bool preciseVectorData = false;
+//char gamepath[1024];	
+
+//Convert function
+//bool ConvertADT(char*,char*);
+
+// Constants
+
+//static const char * szWorkDirMaps = ".\\Maps";
+static const char * szWorkDirWmo = ".\\buildings";
+
+//static LPBYTE pbBuffer1 = NULL;
+//static LPBYTE pbBuffer2 = NULL;
+
+// Local testing functions
+
+static void clreol()
+{
+    printf("\r                                                                              \r");
+}
+
+static const char * GetPlainName(const char * szFileName)
+{
+    const char * szTemp;
+
+    if((szTemp = strrchr(szFileName, '\\')) != NULL)
+        szFileName = szTemp + 1;
+    return szFileName;
+}
+//------------------------------------------------------------------------------
+static void ShowProcessedFile(const char * szFileName)
+{
+    char szLine[80];
+    size_t nLength = strlen(szFileName);
+
+    memset(szLine, 0x20, sizeof(szLine));
+    szLine[sizeof(szLine)-1] = 0;
+
+    if(nLength > sizeof(szLine)-1)
+        nLength = sizeof(szLine)-1;
+    memcpy(szLine, szFileName, nLength);
+    printf("\r%s\n", szLine);
+}
+
+
+//----------------------------------------------------------------------------------------------------------------------------------------------------------------------
+int ExtractWmo(const std::vector<std::string>& pArchiveNames)
+{
+
+    char* szListFile = ""; 
+    char   szLocalFile[MAX_PATH] = "";
+    HANDLE hMpq = ""; 
+    BOOL bResult = FALSE;
+
+    //const char* ParsArchiveNames[] = {"patch-2.MPQ", "patch.MPQ", "common.MPQ", "expansion.MPQ"};
+
+    int nError = ERROR_SUCCESS;
+    if(szListFile == NULL || *szListFile == 0)
+        szListFile = NULL;
+    //char tmp[1024];
+    //for (size_t i=0; i<4; i++)
+    for (size_t i=0; i<pArchiveNames.size(); i++)
+    {
+
+        //sprintf(tmp,"%s\\%s", input_path, ParsArchiveNames[i]);
+        //if(!SFileOpenArchive(tmp, 0, 0, &hMpq))
+        if(!SFileOpenArchive(pArchiveNames[i].c_str(), 0, 0, &hMpq))
+            printf("NOT open!!! %s\n",pArchiveNames[i].c_str());
+
+        // Copy files from archive
+        if(nError == ERROR_SUCCESS)
+        {	
+            SFILE_FIND_DATA wf;
+            HANDLE hFind = SFileFindFirstFile(hMpq,"*.wmo*", &wf, szListFile);
+            bResult = TRUE;
+
+            while(hFind != NULL && bResult == TRUE)
+            {
+                ShowProcessedFile(wf.cFileName);
+                SFileSetLocale(wf.lcLocale);
+                sprintf(szLocalFile, "%s\\%s", szWorkDirWmo, GetPlainName(wf.cFileName));
+                fixnamen(szLocalFile,strlen(szLocalFile));
+                FILE * n;
+                if ((n = fopen(szLocalFile, "rb"))== NULL)
+                {
+                    int p = 0;
+                    //Select root wmo files
+                    const char * rchr = strrchr(GetPlainName(wf.cFileName),0x5f);
+                    if(rchr != NULL)
+                    {
+                        char cpy[4];
+                        strncpy((char*)cpy,rchr,4);
+                        for (int i=0;i<4;i++)
+                        {
+                            int m = cpy[i];
+                            if(isdigit(m))
+                                p++;	
+                        }
+                    }
+                    if(p != 3)
+                    {
+                        //printf("RootWmo!\n");
+                        string s = wf.cFileName;
+                        WMORoot * froot = new WMORoot(s);
+                        if(!froot->open())
+                        {
+                            printf("Not open RootWmo!!!\n");
+                            bResult = SFileFindNextFile(hFind, &wf);
+                            continue;
+                        }
+                         FILE *output=fopen(szLocalFile,"wb");
+                        froot->ConvertToVMAPRootWmo(output);
+                        int Wmo_nVertices = 0;
+                        if(froot->nGroups !=0)
+                        {
+                            for (int i=0; i<froot->nGroups; i++)
+                            {
+                                char temp[512];
+                                strcpy(temp, wf.cFileName);
+                                temp[strlen(wf.cFileName)-4] = 0;
+                                char groupFileName[512];
+                                sprintf(groupFileName,"%s_%03d.wmo",temp, i);
+                                printf("%s\n",groupFileName);
+                                //printf("GroupWmo!\n");
+                                string s = groupFileName;
+                                WMOGroup * fgroup = new WMOGroup(s);
+                                if(!fgroup->open())
+                                {
+                                    printf("Not all open Group file for: %s\n",GetPlainName(wf.cFileName));
+                                    bResult = SFileFindNextFile(hFind, &wf);
+                                    break;
+                                }
+								Wmo_nVertices += fgroup->ConvertToVMAPGroupWmo(output, preciseVectorData);	
+                            }
+                        }
+                        fseek(output, 8, SEEK_SET); // store the correct no of vertices
+                        fwrite(&Wmo_nVertices,sizeof(int),1,output);
+                        fclose(output);	
+                    }
+                } else {
+                    fclose(n);
+                }
+                wf.dwFileFlags &= ~MPQ_FILE_HAS_EXTRA;
+                wf.dwFileFlags &= ~MPQ_FILE_EXISTS;
+                // Find the next file
+                bResult = SFileFindNextFile(hFind, &wf);
+            }
+            // Delete the extracted file in the case of an error
+            if(nError != ERROR_SUCCESS)
+                DeleteFile(szLocalFile);
+            // Close the search handle
+            if(hFind != NULL)
+                SFileFindClose(hFind);
+
+        }
+    }
+    // Close both archives
+    if(hMpq != NULL)
+        //SFileCloseArchive(hMpq);
+        if(nError == ERROR_SUCCESS)
+            printf("\nExtract wmo complete (No errors)\n");
+
+    return nError;
+
+}
+
+void ExtractMapsFromMpq()
+{
+
+}
+//-----------------------------------------------------------------------------
+void ParsMapFiles()
+{
+    char fn[512];
+    char id_filename[64];
+    char id[10];
+    for (unsigned int i=0; i<map_count; i++)
+    {
+        sprintf(id,"%03u",map_ids[i].id);
+        sprintf(fn,"World\\Maps\\%s\\%s.wdt", map_ids[i].name, map_ids[i].name);
+        WDTFile WDT(fn,map_ids[i].name);
+        if(WDT.init(id))
+        {
+            for (int x=0; x<64; x++)
+            {
+                for (int y=0; y<64; y++)
+                {
+                    if (ADTFile*ADT = WDT.GetMap(x,y))
+                    {
+                        sprintf(id_filename,"%02u %02u %03u",x,y,map_ids[i].id);//!!!!!!!!!
+                        ADT->init(id_filename);
+                        delete ADT;
+                    }
+
+                }
+            }
+        }
+    }
+}
+#if 0
+void ParsMapFiles()
+{
+
+    char fn[512];
+    for (unsigned int i=0; i<map_count; i++)
+    {
+        sprintf(fn,"World\\Maps\\%s\\%s.wdt", map_ids[i].name, map_ids[i].name);
+        WDTFile WDT(fn,map_ids[i].name);
+        if(WDT.init())
+        {
+            for (int x=0; x<64; x++)
+            {
+                for (int y=0; y<64; y++) 
+                {
+                    if (ADTFile*ADT = WDT.GetMap(x,y))
+                    {
+                        ADT->init();
+                        delete ADT;
+                    }
+
+                }
+            }
+        }
+    }
+}
+#endif
+//xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+
+void getGamePath()
+{
+#ifdef _WIN32
+    HKEY key;
+    DWORD t,s;
+    LONG l;
+    s = sizeof(input_path);
+    memset(input_path,0,s);
+    l = RegOpenKeyEx(HKEY_LOCAL_MACHINE,"SOFTWARE\\Blizzard Entertainment\\World of Warcraft",0,KEY_QUERY_VALUE,&key);
+    //l = RegOpenKeyEx(HKEY_LOCAL_MACHINE,"SOFTWARE\\Blizzard Entertainment\\Burning Crusade Closed Beta",0,KEY_QUERY_VALUE,&key);
+    l = RegQueryValueEx(key,"InstallPath",0,&t,(LPBYTE)input_path,&s);
+    RegCloseKey(key);
+	if (strlen(input_path) > 0)
+	{
+		if (input_path[strlen(input_path) - 1] != '\\') strcat(input_path, "\\");
+	}
+    strcat(input_path,"Data\\");
+#else
+    strcpy(input_path,"data/");
+#endif
+}
+
+//xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+
+bool scan_patches(char* scanmatch, std::vector<std::string>& pArchiveNames)
+{
+    int i;
+    char path[512];
+    std::list<std::string> matches;
+
+    WIN32_FIND_DATA ffData;
+    HANDLE hFind;
+
+    for (i = 1; i <= 99; i++)
+    {
+        if (i != 1)
+        {
+            sprintf(path, "%s-%d.mpq", scanmatch, i);
+        }
+        else
+        {
+            sprintf(path, "%s.mpq", scanmatch);
+        }
+
+        hFind = INVALID_HANDLE_VALUE;
+        hFind = FindFirstFile(path, &ffData);
+        if (hFind == INVALID_HANDLE_VALUE) break;
+        FindClose(hFind);
+
+        matches.push_back(path);
+    }
+
+    matches.reverse();
+    for (std::list<std::string>::iterator i = matches.begin(); i != matches.end(); i++)
+    {
+        pArchiveNames.push_back(i->c_str());
+    }
+
+    printf("\n");
+
+    return(true);
+}
+
+//xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+
+bool fillArchiveNameVector(std::vector<std::string>& pArchiveNames) {
+    //srand((unsigned int)time(0));
+
+    if(!hasInputPathParam)
+        getGamePath();
+
+    printf("\nGame path: %s\n", input_path);
+
+    char path[512];
+    std::vector<std::string> locales;
+
+    // scan game directories
+    WIN32_FIND_DATA ffData;
+    HANDLE hFind;
+    DWORD dwError;
+
+    // first, scan for locales (4-letter directories)
+    printf("Scanning for locales.\n");
+    sprintf(path, "%s*.*", input_path);
+    hFind = INVALID_HANDLE_VALUE;
+    hFind = FindFirstFile(path, &ffData);
+    if (hFind == INVALID_HANDLE_VALUE)
+    {
+        printf("\nCould not open data directory for reading. Aborting.\n");
+        return(false);
+    }
+    do
+    {
+        if (ffData.dwFileAttributes & FILE_ATTRIBUTE_DIRECTORY)
+        {
+            if (ffData.cFileName[0] != '.')
+            {
+                if (strlen(ffData.cFileName) == 4)
+                {
+                    printf("Found locale: %s\n", ffData.cFileName);
+                    locales.push_back(ffData.cFileName);
+                }
+            }
+        }
+    } while (FindNextFile(hFind, &ffData) != 0);
+    dwError = GetLastError();
+    FindClose(hFind);
+    if (dwError != ERROR_NO_MORE_FILES)
+    {
+        printf("\nError reading data directory while scanning locales. Aborting.\n");
+        return(false);
+    }
+    printf("\n");
+
+    if (locales.size() == 0)
+    {
+        printf("Sorry, no locales found. Aborting.\n");
+        return(false);
+    }
+
+    // now, scan for the patch levels in the core dir
+    printf("Loading patch levels from data directory.\n");
+    sprintf(path, "%spatch", input_path);
+    if (!scan_patches(path, pArchiveNames)) return(false);
+
+    // now, scan for the patch levels in locale dirs
+    printf("Loading patch levels from locale directories.\n");
+    for (std::vector<std::string>::iterator i = locales.begin(); i != locales.end(); i++)
+    {
+        printf("Locale: %s\n", i->c_str());
+        sprintf(path, "%s%s\\patch-%s", input_path, i->c_str(), i->c_str());
+        if (!scan_patches(path, pArchiveNames)) return(false);
+    }
+
+    // open expansion and common files
+    printf("Opening data files from data directory.\n");
+    sprintf(path, "%sexpansion.mpq", input_path);
+    pArchiveNames.push_back(path);
+    sprintf(path, "%scommon.mpq", input_path);
+    pArchiveNames.push_back(path);
+    printf("\n");
+
+    // open locale expansion and common files
+    printf("Opening data files from locale directories.\n");
+    for (std::vector<std::string>::iterator i = locales.begin(); i != locales.end(); i++)
+    {
+        printf("Locale: %s\n", i->c_str());
+        sprintf(path, "%s%s\\expansion-locale-%s.mpq", input_path, i->c_str(), i->c_str());
+        pArchiveNames.push_back(path);
+        sprintf(path, "%s%s\\locale-%s.mpq", input_path, i->c_str(), i->c_str());
+        pArchiveNames.push_back(path);
+        printf("\n");
+    }
+    return true;
+}
+//xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+// return false it normal processing can not proceed
+
+bool processArgv(int argc, char ** argv, char*versionString)
+{
+    bool result = true;
+    hasInputPathParam = false;
+    bool preciseVectorData = false;
+
+    for(int i=1; i< argc; ++i) {
+		if(strcmp("-s",argv[i]) == 0) {
+			preciseVectorData = false;
+		} else if(strcmp("-d",argv[i]) == 0) {
+            if((i+1)<argc) {
+                hasInputPathParam = true;
+                strcpy(input_path, argv[i+1]);
+                if (input_path[strlen(input_path) - 1] != '\\' || input_path[strlen(input_path) - 1] != '/')
+                    strcat(input_path, "\\");
+                ++i;
+            } else {
+                result = false;
+            }
+		} else if(strcmp("-?",argv[1]) == 0) {
+            result = false;
+		} else if(strcmp("-l",argv[i]) == 0) {
+			preciseVectorData = true;
+        } else {
+            result = false;
+            break;
+        }
+    }
+    if(!result)     {
+        printf("Extract %s.\n",versionString);
+        printf("%s [-?][-s][-l][-d <path>]\n", argv[0]);
+        printf("   -s : (default) small size (data size optimization), ~500MB less vmap data.\n");
+        printf("   -l : large size, ~500MB more vmap data. (might contain more details)\n");
+        printf("   -d <path>: Path to the vector data source folder.\n");
+        printf("   -? : This message.\n");
+    }
+    return result;
+}
+
+//xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+// Main
+// 
+// The program must be run with two command line arguments
+//
+// Arg1 - The source MPQ name (for testing reading and file find)
+// Arg2 - Listfile name
+//
+
+int main(int argc, char ** argv)
+{
+    //char tmp[512];
+//    FILE* pDatei;
+//    char tmp[512];
+//    char tmp1[512];
+    //char tmp2[512];
+//    char tmp3[512];
+//    char tmp4[512];
+//    char szMpqName[MAX_PATH] = "";
+//    char szListFile[MAX_PATH] = "";
+    int nError = ERROR_SUCCESS;
+    char *versionString = "V2.4 2007_07_12";
+
+    // Use command line arguments, when some
+    if(!processArgv(argc, argv, versionString)) 
+        return 1;
+ 
+    printf("Extract %s. Beginning work ....\n",versionString);
+    // Set the lowest priority to allow running in the background
+    SetThreadPriority(GetCurrentThread(), THREAD_PRIORITY_BELOW_NORMAL);
+    //xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+    // Create the working directory
+    if(nError == ERROR_SUCCESS)
+    {
+        //if(!CreateDirectory(szWorkDirMaps, NULL))
+        // nError = GetLastError();
+        if(!CreateDirectory(szWorkDirWmo, NULL))
+            nError = GetLastError();
+        if(nError == ERROR_ALREADY_EXISTS)
+            nError = ERROR_SUCCESS;
+    } 
+    //xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+    // patch goes first -> fake priority handling
+    std::vector<MPQArchive*> archives;
+
+    //xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+    std::vector<std::string> archiveNames;
+
+    fillArchiveNameVector(archiveNames);
+    for (size_t i=0; i<archiveNames.size(); i++) {
+        archives.push_back(new MPQArchive(archiveNames[i].c_str()));
+    }
+    ExtractWmo(archiveNames);
+
+     //xxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+    //map.dbc
+    if(nError == ERROR_SUCCESS)
+    {
+        DBCFile * dbc = new DBCFile("DBFilesClient\\Map.dbc");
+        dbc->open();
+        map_count=dbc->getRecordCount ();
+        map_ids=new map_id[map_count];
+        for(unsigned int x=0;x<map_count;x++)
+        {
+            map_ids[x].id=dbc->getRecord (x).getUInt(0);
+            strcpy(map_ids[x].name,dbc->getRecord(x).getString(1));
+            printf("Map - %s\n",map_ids[x].name);		 
+        }
+
+        delete dbc;
+        ParsMapFiles();
+        delete [] map_ids;
+        nError = ERROR_SUCCESS;
+    }
+
+    clreol();
+    if(nError != ERROR_SUCCESS) {
+        printf("ERROR: Extract %s. Work NOT complete.\n   Precise vector data=%d.\nPress any key.\n",versionString, preciseVectorData);
+        _getch();
+    }
+    printf("Extract %s. Work complete. No errors.",versionString);
+}
diff --git a/contrib/vmap_extractor_v2/vmapextract/wdtfile.cpp b/contrib/vmap_extractor_v2/vmapextract/wdtfile.cpp
new file mode 100644
index 00000000000..831cdaae79f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/wdtfile.cpp
@@ -0,0 +1,120 @@
+#define __STORMLIB_SELF__ 
+
+#include "wdtfile.h"
+#include "adtfile.h"
+
+
+char * wdtGetPlainName(char * FileName)
+{
+    char * szTemp;
+
+    if((szTemp = strrchr(FileName, '\\')) != NULL)
+        FileName = szTemp + 1;
+    return FileName;
+}
+
+WDTFile::WDTFile(char* file_name, char* file_name1):WDT(file_name)
+{
+	filename.append(file_name1,strlen(file_name1));
+}
+
+bool WDTFile::init(char *map_id)
+{
+
+	if (WDT.isEof())
+	{
+	//printf("Can't find WDT file.\n");
+	return false;
+	}
+	
+	char fourcc[5];
+	size_t size;
+	
+
+	const char dirname[] = "buildings\\dir";
+	FILE *dirfile;
+    dirfile = fopen(dirname, "ab");
+	if(!dirfile)
+	{
+		printf("Can't open dirfile!'%s'\n");
+		return false;
+	}
+
+
+	while (!WDT.isEof()) 
+	{
+		WDT.read(fourcc,4);
+		WDT.read(&size, 4);
+
+		flipcc(fourcc);
+		fourcc[4] = 0;
+
+		size_t nextpos = WDT.getPos() + size;
+
+		if (!strcmp(fourcc,"MAIN")) 
+		{
+		}
+        if (!strcmp(fourcc,"MWMO")) 
+		{
+			// global map objects
+			if (size) 
+			{
+			    char *buf = new char[size];
+				WDT.read(buf, size);
+				char *p=buf;
+				int q = 0;
+                gWmoInstansName = new string[size];
+				while (p<buf+size) 
+				{
+					string path(p);
+                    char* s=wdtGetPlainName(p);
+					fixnamen(s,strlen(s));
+					p=p+strlen(p)+1;
+					gWmoInstansName[q++] = s;
+				}
+				delete[] buf;
+			}
+		}		
+		else 
+		if (!strcmp(fourcc,"MODF")) 
+		{
+			// global wmo instance data
+			if (size)
+            {
+			    gnWMO = (int)size / 64;
+				string gWMO_mapname;
+				string fake_mapname;
+				fake_mapname = "65 65 ";
+                //gWMO_mapname = fake_mapname + filename;
+                gWMO_mapname = fake_mapname + std::string(map_id);
+			    for (int i=0; i<gnWMO; i++) 
+			    {
+				    int id;
+				    WDT.read(&id, 4);
+				    WMOInstance inst(WDT,gWmoInstansName[id].c_str(),gWMO_mapname.c_str(), dirfile);
+			    }
+			delete[] gWmoInstansName;
+			}
+		}
+		WDT.seek((int)nextpos);
+	}
+
+	WDT.close();
+    fclose(dirfile);
+	return true;
+}
+
+WDTFile::~WDTFile(void)
+{
+	WDT.close();
+}
+
+ADTFile* WDTFile::GetMap(int x, int z)
+{
+	if(!(x>=0 && z >= 0 && x<64 && z<64)) return NULL;
+	
+	char name[512];
+
+	sprintf(name,"World\\Maps\\%s\\%s_%d_%d.adt", filename.c_str(), filename.c_str(), x, z);
+	return new ADTFile(name);
+}
diff --git a/contrib/vmap_extractor_v2/vmapextract/wdtfile.h b/contrib/vmap_extractor_v2/vmapextract/wdtfile.h
new file mode 100644
index 00000000000..7a7002a2ed8
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/wdtfile.h
@@ -0,0 +1,30 @@
+#ifndef WDTFILE_H
+#define WDTFILE_H
+
+#define __STORMLIB_SELF__ 
+
+#include "mpq.h"
+#include "adtfile.h"
+#include "wmo.h"
+#include <string>
+#include "stdlib.h"
+
+class WDTFile
+{
+public:
+	WDTFile(char* file_name, char* file_name1);
+	~WDTFile(void);
+	bool init(char *map_id);
+    
+	string* gWmoInstansName;
+	int gnWMO, nMaps;
+	
+	ADTFile* GetMap(int x, int z);
+
+private:
+	MPQFile WDT;
+	bool maps[64][64];
+	string filename;
+};
+
+#endif
diff --git a/contrib/vmap_extractor_v2/vmapextract/wmo.cpp b/contrib/vmap_extractor_v2/vmapextract/wmo.cpp
new file mode 100644
index 00000000000..9dfda6f771f
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/wmo.cpp
@@ -0,0 +1,531 @@
+#define __STORMLIB_SELF__
+
+#include "wmo.h"
+#include "Stormlib.h"
+#include "mpq.h"
+
+using namespace std;
+
+
+WMORoot::WMORoot(std::string &filename) : filename(filename)
+{
+}
+//xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+
+bool WMORoot::open()
+{
+
+	MPQFile f(filename.c_str());
+	if(f.isEof ())
+	{
+		printf("No such file.\n");	
+		return false;
+	}
+
+	size_t size;
+	char fourcc[5];
+	bbcorn1[3] = 0;
+	bbcorn2[3]= 0;
+
+	while (!f.isEof  ())
+	{
+		f.read(fourcc,4);
+		f.read(&size, 4);
+
+		flipcc(fourcc);
+		fourcc[4] = 0;
+
+		size_t nextpos = f.getPos() + size;
+
+		if (!strcmp(fourcc,"MOHD"))//header
+		{
+
+			f.read(&nTextures, 4);
+			f.read(&nGroups, 4);
+			f.read(&nP, 4);
+			f.read(&nLights, 4);
+			f.read(&nModels, 4);
+			f.read(&nDoodads, 4);
+			f.read(&nDoodadSets, 4);
+			f.read(&col, 4);
+			f.read(&RootID, 4);
+			f.read(bbcorn1,12);
+			f.read(bbcorn2,12);
+			break;
+		}
+		/*
+		else if (!strcmp(fourcc,"MOTX"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MOMT"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MOGN"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MOGI"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MOLT"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MODN"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MODS"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MODD"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MOSB"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MOPV"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MOPT"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MOPR"))
+		{
+
+		}
+		else if (!strcmp(fourcc,"MFOG"))
+		{
+
+		}
+		*/
+		f.seek((int)nextpos);	
+	}
+	f.close ();
+	return true;
+}
+//---------------------------------------------------------------------------
+
+bool WMORoot::ConvertToVMAPRootWmo(FILE *pOutfile)
+{
+	//printf("Convert RootWmo...\n");
+
+	fwrite("VMAP002",1,8,pOutfile);
+	unsigned int nVectors = 0;
+	fwrite(&nVectors,sizeof(nVectors),1,pOutfile); // will be filled later
+	fwrite(&nGroups,4,1,pOutfile);
+	return true;
+}
+
+//----------------------------------------------------------------------------
+WMORoot::~WMORoot()
+{
+}
+//xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx
+
+WMOGroup::WMOGroup(std::string &filename) : filename(filename)
+{
+}
+//---------------------------------------------------------------------------
+bool WMOGroup::open()
+{
+	MPQFile f(filename.c_str());
+	if(f.isEof ())
+	{
+		printf("No such file.\n");	
+		return false;
+	}
+	size_t size;
+	char fourcc[5];
+	bbcorn1[3] = 0;
+	bbcorn2[3] = 0;	
+	while (!f.isEof  ())
+	{
+		f.read(fourcc,4);
+		f.read(&size, 4);
+		flipcc(fourcc);
+		if (!strcmp(fourcc,"MOGP"))//Fix sizeoff = Data size.
+		{
+			size = 68;
+		}
+		fourcc[4] = 0;
+		size_t nextpos = f.getPos() + size;
+		LiquEx_size = 0;
+		liquflags = 0;
+
+		if (!strcmp(fourcc,"MOGP"))//header
+		{
+			f.seekRelative(-4);
+			f.read(&offsize, 4);
+			f.read(&flag, 4);
+			f.read(&flag1, 4);
+			f.read(&Xid, 4);
+			f.read(bbcorn1, 12);
+			f.read(bbcorn2, 12);
+			f.read(&Xid2, 4);
+			f.read(&Xid3, 4);
+			f.read(&zero1, 4);
+			f.read(&Xflag, 4);
+			f.read(&nTexture,4);
+			f.read(&GroupID,4);
+		}
+		else if (!strcmp(fourcc,"MOPY"))
+		{
+			MOPY = new char[size];
+			mopy_size = size;
+			nTriangles = (int)size / 2;
+			f.read(MOPY, size);
+		}
+		else if (!strcmp(fourcc,"MOVI"))
+		{
+			MOVI = new uint16[size/2];
+			f.read(MOVI, size);
+
+		}
+		else if (!strcmp(fourcc,"MOVT"))
+		{
+			MOVT = new float[size/4];
+			f.read(MOVT, size);
+			nVertices = (int)size / 12;
+		}
+		else if (!strcmp(fourcc,"MONR"))
+		{
+		}
+		else if (!strcmp(fourcc,"MOTV"))
+		{
+		}
+		else if (!strcmp(fourcc,"MOBA"))
+		{
+			MOBA = new uint16[size/2];
+			moba_size = size/2;
+			f.read(MOBA, size);
+		}
+		else if (!strcmp(fourcc,"MLIQ"))
+		{
+			liquflags |= 1;
+			WMOLiquidHeader hlq;
+			f.read(&hlq, 0x1E);
+			float ydir = -1.0f;
+			hlq_xverts = hlq.xverts;
+			hlq_yverts = hlq.yverts;
+			int noVer = hlq.xverts * hlq.yverts;
+			float tilesize  = CHUNKSIZE / 8.0f;
+			LiquEx_size = sizeof(float) * 3 * noVer;
+			LiquEx = new float[sizeof(float) * 3 * noVer];
+			int p = 0;
+
+			for (int j=0; j<hlq.yverts; j++) 
+			{
+				for (int i=0; i<hlq.xverts; i++) 
+				{
+					LiquEx[p++] = hlq.pos_x + tilesize * i;
+					LiquEx[p++] = hlq.pos_z;
+					LiquEx[p++] = ydir * (hlq.pos_y + tilesize * j);
+				}
+			}
+
+		}
+		f.seek((int)nextpos);
+	}
+	f.close ();
+	return true;
+}
+//----------------------------------------------------------------------------
+int WMOGroup::ConvertToVMAPGroupWmo(FILE *output, bool pPreciseVectorData)
+{
+	if(pPreciseVectorData) {
+		fwrite(&liquflags,sizeof(uint32),1,output); 
+		char GRP[] = "GRP ";
+		fwrite(GRP,1,4,output);
+
+		int k = 0;
+		int moba_batch = moba_size/12;
+		MobaEx = new int[moba_batch*4];
+		for(int i=8; i<moba_size; i+=12)
+		{
+			MobaEx[k++] = MOBA[i];
+		}
+		delete [] MOBA;
+		int moba_size_grp = moba_batch*4+4;
+		fwrite(&moba_size_grp,4,1,output); 
+		fwrite(&moba_batch,4,1,output);
+		fwrite(MobaEx,4,k,output);
+		delete [] MobaEx;
+
+		uint32 nIdexes = nTriangles * 3;
+
+		if(fwrite("INDX",4, 1, output) != 1) { printf("Error while writing file nbraches ID"); exit(0); }
+		int wsize = sizeof(uint32) + sizeof(unsigned short) * nIdexes;
+		if(fwrite(&wsize, sizeof(int), 1, output) != 1) { printf("Error while writing file wsize"); }
+		if(fwrite(&nIdexes, sizeof(uint32), 1, output) != 1) { printf("Error while writing file nIndexes"); exit(0); }
+		if(nIdexes >0) {
+			if(fwrite(MOVI, sizeof(unsigned short), nIdexes, output) != nIdexes) { printf("Error while writing file indexarray"); exit(0); }
+		}
+
+		if(fwrite("VERT",4, 1, output) != 1) { printf("Error while writing file nbraches ID"); exit(0); }
+		wsize = sizeof(int) + sizeof(float) * 3 * nVertices;
+		if(fwrite(&wsize, sizeof(int), 1, output) != 1) { printf("Error while writing file wsize"); }
+		if(fwrite(&nVertices, sizeof(int), 1, output) != 1) { printf("Error while writing file nVertices"); exit(0); }
+		if(nVertices >0) {
+			if(fwrite(MOVT, sizeof(float)*3, nVertices, output) != nVertices) { printf("Error while writing file vectors"); exit(0); }
+		}
+
+		if(LiquEx_size != 0)
+		{
+			int LIQU_h[] = {0x5551494C,LiquEx_size+8,hlq_xverts,hlq_yverts};// "LIQU"	
+			fwrite(LIQU_h,4,4,output);
+			fwrite(LiquEx,4,LiquEx_size/4,output);	
+			delete [] LiquEx;
+		}
+
+		return nTriangles;
+	} 	else {
+		//printf("Convert GroupWmo...\n");
+		//-------GRP -------------------------------------
+		fwrite(&liquflags,sizeof(uint32),1,output); 
+		char GRP[] = "GRP ";
+		fwrite(GRP,1,4,output);
+		int k = 0;
+		int moba_batch = moba_size/12;
+		MobaEx = new int[moba_batch*4];
+		for(int i=8; i<moba_size; i+=12)
+		{
+			MobaEx[k++] = MOBA[i];
+		}
+		delete [] MOBA;
+		int moba_size_grp = moba_batch*4+4;
+		fwrite(&moba_size_grp,4,1,output); 
+		fwrite(&moba_batch,4,1,output);
+		fwrite(MobaEx,4,k,output);
+		delete [] MobaEx;
+
+		//-------INDX------------------------------------
+		//-------MOPY--------
+		int n = 0;
+		int j = 0;
+		MopyEx = new char[mopy_size];
+		IndexExTr = new int[mopy_size];
+		for (int i=0; i<mopy_size; i+=2)
+		{
+			if ((int)MOPY[i]==0x00000008 ||(int)MOPY[i]==0x00000009 ||(int)MOPY[i]==0x00000020 ||(int)MOPY[i]==0x00000021 ||(int)MOPY[i]==0x00000022 ||(int)MOPY[i]==0x00000048 ||(int)MOPY[i]==0x00000049 ||(int)MOPY[i]==0x00000060 ||(int)MOPY[i]==0x00000061 ||(int)MOPY[i]==0x00000062 ||(int)MOPY[i]==0x0000000A ||(int)MOPY[i]==0x0000004A)
+			{    
+				MopyEx[n] = MOPY[i];
+				MopyEx[(n+1)] = MOPY[(i+1)];
+				IndexExTr[j] = i/2;
+				j+=1;        
+				n+=2;
+			}    
+		}
+		MopyEx_size = n;
+		IndexExTr_size = j;
+		delete [] MOPY;
+		delete [] MopyEx;
+
+		//---------MOVI-----------
+		MoviEx = new uint16[IndexExTr_size*3];
+		int m = 0;
+		for (int i=0; i<IndexExTr_size; i++)
+		{
+			int n = 0;
+			n = IndexExTr[i]*3;
+			for (int x=0; x<3; x++)
+			{
+				MoviEx[m] = MOVI[n];
+				n++;
+				m++;
+			}
+		}
+		delete [] MOVI;
+
+		MoviExSort = new uint16[IndexExTr_size*3];
+		for(int y=0; y<IndexExTr_size*3; y++)
+		{
+			MoviExSort[y]=MoviEx[y];		
+		}
+
+		uint16 hold;
+		for (int pass = 1; pass < IndexExTr_size*3; pass++)
+		{
+			for (int i=0; i < IndexExTr_size*3-1; i++)
+			{
+				if (MoviExSort[i] > MoviExSort[i+1]) 
+				{
+					hold = MoviExSort[i];
+					MoviExSort[i] = MoviExSort[i+1];
+					MoviExSort[i+1] = hold;
+				}
+				//double = 65535	
+				else
+					if (MoviExSort[i] == MoviExSort[i+1])
+						MoviExSort[i+1] = 65535;	
+			}
+		}
+		// double delet
+		uint16 s = 0;
+		for (int i=0; i < IndexExTr_size*3; i++)
+		{
+			if (MoviExSort[i]!=65535)
+			{
+				MoviExSort[s] = MoviExSort[i];
+				s++;
+			}
+		}
+		MovtExSort = new uint16[s];
+		for (int i=0; i < s; i++)
+		{
+			MovtExSort[i] = MoviExSort[i];
+		}
+
+		for (int i=0; i < IndexExTr_size*3; i++)
+		{
+			uint16 b = MoviEx[i];
+			for (uint16 x = 0; x < s; x++)
+			{
+				if(MoviExSort[x] == b)
+				{
+
+					MoviEx[i] = x;
+					break;
+				}
+			}	
+
+		}
+		int INDX[] = {0x58444E49,IndexExTr_size*6+4,IndexExTr_size*3};
+		fwrite(INDX,4,3,output);
+		fwrite(MoviEx,2,IndexExTr_size*3,output);
+
+		delete [] MoviEx;
+		delete [] MoviExSort;
+		delete [] IndexExTr;
+
+		//----------VERT---------
+		//-----MOVT----------
+		int d = 0;
+		MovtEx = new float[s*3];
+		for (uint16 i=0; i<s; i++)
+		{
+			int c=0;//!!!!data in MovtExSort[i] more uint16 in great group wmo files!!!!
+			c = MovtExSort[i]*3;
+			for (int y=0; y<3; y++)
+			{
+				MovtEx[d] = MOVT[c];
+				c++;
+				d++;
+			}
+		}
+		int VERT[] = {0x54524556,d*4+4,d*4/12};// "VERT"
+		fwrite(VERT,4,3,output);
+		fwrite(MovtEx,4,d,output);	
+		//------LIQU------------------------
+		if(LiquEx_size != 0)
+		{
+			int LIQU_h[] = {0x5551494C,LiquEx_size+8,hlq_xverts,hlq_yverts};// "LIQU"	
+			fwrite(LIQU_h,4,4,output);
+			fwrite(LiquEx,4,LiquEx_size/4,output);	
+			delete [] LiquEx;
+		}
+
+		delete [] MOVT;
+		delete [] MovtEx;
+		delete [] MovtExSort;
+
+		//---------------------------------------------	
+		return IndexExTr_size;
+	}
+}
+
+WMOGroup::~WMOGroup()
+{
+}
+
+WMOInstance::WMOInstance(MPQFile &f,const char* WmoInstName,const char*MapName, FILE *pDirfile)
+{
+	pos = Vec3D(0,0,0);
+
+	float ff[3];
+	f.read(&id, 4);
+	f.read(ff,12);
+	pos = Vec3D(ff[0],ff[1],ff[2]);
+	f.read(ff,12);
+	rot = Vec3D(ff[0],ff[1],ff[2]);
+	f.read(ff,12);
+	pos2 = Vec3D(ff[0],ff[1],ff[2]);
+	f.read(ff,12);
+	pos3 = Vec3D(ff[0],ff[1],ff[2]);
+	f.read(&d2,4);
+	f.read(&d3,4);
+
+	doodadset = (d2 & 0xFFFF0000) >> 16;
+
+	int realx1 = (int) ((float) pos2.x / 533.333333f);
+	int realy1 = (int) ((float) pos2.z / 533.333333f);
+	int realx2 = (int) ((float) pos3.x / 533.333333f);
+	int realy2 = (int) ((float) pos3.z / 533.333333f);
+
+	if(realx1 < 0) 
+	{ 
+		realx1 +=20; realx2+=20; 
+	}
+	if(realy1 < 0) 
+	{ 
+		realy1 +=20; realy2+=20; 
+	} // hack to prevent neg. values
+
+	//-----------add_in _dir_file----------------
+
+	char tempname[512];
+	//	const char dirname[] = "buildings\\dir";
+
+	sprintf(tempname, "buildings\\%s", WmoInstName);
+	FILE *input;
+	input = fopen(tempname, "r+b");
+	if(!input)
+	{
+		return;
+	}
+	fseek(input, 8, SEEK_SET); // get the correct no of vertices
+	int nVertices;
+	fread(&nVertices, sizeof (int), 1, input);
+	fclose(input);
+	if(nVertices == 0)
+	{
+		return;
+	}
+
+	/*	FILE *dirfile;
+	dirfile = fopen(dirname, "ab");
+	if(!dirfile)
+	{
+	printf("Can't open dirfile!'%s'\n");
+	return;
+	}
+	*/
+	float x,z;
+	x = pos.x;
+	z = pos.z;
+	if(x==0 && z == 0) 
+	{ x = 533.33333f*32; z = 533.33333f*32; }
+	fprintf(pDirfile,"%s/%s %f,%f,%f_%f,%f,%f 1.0 %d %d %d,%d %d\n",
+		MapName,
+		WmoInstName,
+		(float) x, (float) pos.y, (float) z,
+		(float) rot.x, (float) rot.y, (float) rot.z,
+		nVertices,
+		realx1, realy1,
+		realx2, realy2
+		);
+
+	// fclose(dirfile);
+}	
+
+
+
+
diff --git a/contrib/vmap_extractor_v2/vmapextract/wmo.h b/contrib/vmap_extractor_v2/vmapextract/wmo.h
new file mode 100644
index 00000000000..b8f6439e381
--- /dev/null
+++ b/contrib/vmap_extractor_v2/vmapextract/wmo.h
@@ -0,0 +1,107 @@
+#ifndef WMO_H
+#define WMO_H
+#define __STORMLIB_SELF__
+#define TILESIZE (533.33333f)
+#define CHUNKSIZE ((TILESIZE) / 16.0f)
+
+#include "Stormlib.h"
+#include <string>
+#include "vec3d.h"
+#include <set>
+#include "mpq.h"
+
+
+class WMOInstance;
+class WMOManager;
+
+typedef unsigned char uint8;
+typedef unsigned short uint16;
+typedef unsigned int uint32;
+
+
+class WMORoot
+{
+public:
+	int nTextures, nGroups, nP, nLights, nModels, nDoodads, nDoodadSets, RootID;
+	unsigned int col;
+	int bbcorn1[3];
+	int bbcorn2[3];
+
+	WMORoot(std::string &filename);
+	~WMORoot();
+	
+	bool open();
+	bool ConvertToVMAPRootWmo(FILE *output);
+private:
+	std::string filename;
+	char outfilename;
+
+};
+
+class WMOGroup
+{
+public:
+	
+	int offsize,flag,flag1,Xid,Xid2,Xid3,zero1,Xflag,nTexture,GroupID;
+	int mopy_size,moba_size,hlq_xverts,hlq_yverts;
+	int MopyEx_size,IndexExTr_size,LiquEx_size;
+	unsigned int nVertices; // number when loaded
+	int nTriangles; // number when loaded
+	int bbcorn1[3];
+	int bbcorn2[3];
+	int * IndexExTr;
+	char* MOPY;
+	char* MopyEx;
+	uint16* MOVI;
+	uint16* MoviEx;
+	uint16* MoviExSort;
+	float* MOVT;
+	float* MovtEx;
+	uint16* MovtExSort;
+	float* MONR;
+	float* MonrEx;
+	uint16* MOBA;
+	int* MobaEx;
+	float* LiquEx;
+	uint32 liquflags;
+	
+	WMOGroup(std::string &filename);
+	~WMOGroup();
+
+	bool open();
+	int ConvertToVMAPGroupWmo(FILE *output, bool pPreciseVectorData);
+
+private:
+	std::string filename;
+	char outfilename;
+
+};
+
+struct WMOLiquidHeader 
+{
+	int xverts, yverts, xtiles, ytiles;
+	float pos_x;
+	float pos_y;
+	float pos_z;
+	short type;
+};
+
+class WMOInstance 
+{
+	static std::set<int> ids;
+public:
+    string MapName;
+    int currx;
+	int curry;
+	WMOGroup *wmo;
+	Vec3D pos;
+	Vec3D pos2, pos3, rot;
+	int indx,id, d2, d3;
+	int doodadset;
+
+	WMOInstance(MPQFile &f,const char* WmoInstName,const char*MapName, FILE *pDirfile);
+
+	static void reset();
+};
+
+#endif
+\ No newline at end of file