diff --git a/Demos/bdwallpaper/BDWallPaper.aps b/Demos/bdwallpaper/BDWallPaper.aps
new file mode 100644
index 00000000..fc22b1cd
Binary files /dev/null and b/Demos/bdwallpaper/BDWallPaper.aps differ
diff --git a/Demos/bdwallpaper/BDWallPaper.cpp b/Demos/bdwallpaper/BDWallPaper.cpp
new file mode 100644
index 00000000..c057c225
--- /dev/null
+++ b/Demos/bdwallpaper/BDWallPaper.cpp
@@ -0,0 +1,25 @@
+#include "stdafx.h"
+#include "resource.h"
+#include "MainWnd.h"
+
+static LPBYTE resource_zip_buffer_ = NULL;
+
+//#define USE_EMBEDED_RESOURCE
+
+int APIENTRY WinMain(HINSTANCE hInstance, HINSTANCE /*hPrevInstance*/, LPSTR /*lpCmdLine*/, int nCmdShow)
+{
+ CPaintManagerUI::SetInstance(hInstance);
+
+ HRESULT Hr = ::CoInitialize(NULL);
+ if( FAILED(Hr) ) return 0;
+
+ CMainWnd* pFrame = new CMainWnd();
+ if( pFrame == NULL ) return 0;
+ pFrame->Create(NULL, _T("ѸϷ"), UI_WNDSTYLE_FRAME, 0L, 0, 0, 884, 652);
+ pFrame->CenterWindow();
+
+ CPaintManagerUI::MessageLoop();
+
+ ::CoUninitialize();
+ return 0;
+}
\ No newline at end of file
diff --git a/Demos/bdwallpaper/BDWallPaper.rc b/Demos/bdwallpaper/BDWallPaper.rc
new file mode 100644
index 00000000..79de65ae
Binary files /dev/null and b/Demos/bdwallpaper/BDWallPaper.rc differ
diff --git a/Demos/bdwallpaper/BDWallPaper.vcxproj b/Demos/bdwallpaper/BDWallPaper.vcxproj
new file mode 100644
index 00000000..a98bfd1e
--- /dev/null
+++ b/Demos/bdwallpaper/BDWallPaper.vcxproj
@@ -0,0 +1,210 @@
+
+
+
+
+ Debug
+ Win32
+
+
+ Release
+ Win32
+
+
+
+ BDWallPaper
+ {565089A1-60C0-4281-99D7-A459E7354EEF}
+ 360
+
+
+
+
+
+
+
+
+
+
+
+ Application
+ false
+ Unicode
+
+
+ Application
+ false
+ Unicode
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ <_ProjectFileVersion>10.0.40219.1
+ $(SolutionDir)bin\
+ $(SolutionDir)temp\BDWallPaper\$(Configuration)\
+ true
+ $(SolutionDir)bin\
+ $(SolutionDir)temp\BDWallPaper\$(Configuration)\
+ false
+ AllRules.ruleset
+
+
+ AllRules.ruleset
+
+
+ $(ProjectName)_d
+ $(ProjectName)
+
+
+
+ _DEBUG;%(PreprocessorDefinitions)
+ true
+ true
+ Win32
+ .\Debug/BDWallPaper.tlb
+
+
+
+
+ Disabled
+ WIN32;_DEBUG;_WINDOWS;%(PreprocessorDefinitions)
+ true
+ EnableFastChecks
+ MultiThreadedDebug
+ Use
+ stdafx.h
+ true
+ Level3
+ true
+ ProgramDatabase
+ helper;controlex;helper\jsoncpp;
+
+
+ _DEBUG;%(PreprocessorDefinitions)
+ 0x0406
+
+
+ true
+ true
+ true
+ Windows
+ MachineX86
+
+
+ true
+ .\Debug/BDWallPaper.bsc
+
+
+
+
+ NDEBUG;%(PreprocessorDefinitions)
+ true
+ true
+ Win32
+ .\Release/BDWallPaper.tlb
+
+
+
+
+ MinSpace
+ OnlyExplicitInline
+ WIN32;NDEBUG;_WINDOWS;%(PreprocessorDefinitions)
+ true
+ MultiThreaded
+ true
+ Use
+ stdafx.h
+ Level3
+ true
+ helper;controlex;helper\jsoncpp;
+
+
+ NDEBUG;%(PreprocessorDefinitions)
+ 0x0406
+
+
+ true
+ Windows
+ MachineX86
+
+
+
+
+ true
+ .\Release/BDWallPaper.bsc
+
+
+
+
+
+ NotUsing
+ NotUsing
+
+
+ NotUsing
+ NotUsing
+
+
+ NotUsing
+ NotUsing
+
+
+ NotUsing
+ NotUsing
+
+
+ NotUsing
+ NotUsing
+
+
+
+
+ %(PreprocessorDefinitions)
+ Create
+ %(PreprocessorDefinitions)
+ Create
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+
+ Designer
+
+
+
+
+
+
+
+
+
+
+
\ No newline at end of file
diff --git a/Demos/bdwallpaper/BDWallPaper.vcxproj.filters b/Demos/bdwallpaper/BDWallPaper.vcxproj.filters
new file mode 100644
index 00000000..f812d7bb
--- /dev/null
+++ b/Demos/bdwallpaper/BDWallPaper.vcxproj.filters
@@ -0,0 +1,132 @@
+
+
+
+
+ {c75b9d7c-452a-4867-a585-e8aee4a05f51}
+ cpp;c;cxx;rc;def;r;odl;idl;hpj;bat
+
+
+ {249f81db-516d-4a60-9882-d3fd674e412c}
+ h;hpp;hxx;hm;inl
+
+
+ {057557f5-517e-47cf-a695-8b482beaf54a}
+
+
+ {effdb570-d6be-45fe-9ac5-7dedf6a14a93}
+
+
+ {8b578ff8-5c34-471e-8ab6-0dccfac7dbb4}
+
+
+ {ff8c0161-870e-4f0d-abcb-a2e94b301694}
+
+
+ {ce067cf0-2c17-4761-9766-9a8cbab56a7c}
+
+
+
+
+ Source Files
+
+
+ Source Files
+
+
+ Source Files
+
+
+ ControlEx
+
+
+ Helper
+
+
+ Helper
+
+
+ Helper\jsoncpp
+
+
+ Helper\jsoncpp
+
+
+ Helper\jsoncpp
+
+
+
+
+ Header Files
+
+
+ Header Files
+
+
+ Header Files
+
+
+ ControlEx
+
+
+ Helper\jsoncpp
+
+
+ Helper\jsoncpp
+
+
+ Helper\jsoncpp
+
+
+ Helper\jsoncpp
+
+
+ Helper\jsoncpp
+
+
+ Helper\jsoncpp
+
+
+ Helper\jsoncpp
+
+
+ Helper\jsoncpp
+
+
+ Helper\jsoncpp
+
+
+ Header Files
+
+
+ ControlEx
+
+
+ ControlEx
+
+
+ ControlEx
+
+
+ ControlEx
+
+
+ Helper
+
+
+
+
+ Resources
+
+
+ Resources\skin
+
+
+ Helper\jsoncpp
+
+
+
+
+ Resources
+
+
+
\ No newline at end of file
diff --git a/Demos/bdwallpaper/BDWallPaper.vcxproj.user b/Demos/bdwallpaper/BDWallPaper.vcxproj.user
new file mode 100644
index 00000000..ace9a86a
--- /dev/null
+++ b/Demos/bdwallpaper/BDWallPaper.vcxproj.user
@@ -0,0 +1,3 @@
+
+
+
\ No newline at end of file
diff --git a/Demos/bdwallpaper/DataMgr.h b/Demos/bdwallpaper/DataMgr.h
new file mode 100644
index 00000000..d0206838
--- /dev/null
+++ b/Demos/bdwallpaper/DataMgr.h
@@ -0,0 +1,189 @@
+#include "StdAfx.h"
+#include
+#include
+#pragma comment(lib, "WinInet.lib")
+#include
+using namespace std;
+#include "json.h"
+#include
+#pragma comment(lib, "Urlmon.lib")
+
+#define WM_GETWPPAGE_OK WM_USER + 100
+#define WM_GETWPINFO_OK WM_USER + 101
+
+struct WPInfoKey
+{
+ CString sType;
+ int nPage;
+};
+
+static bool operator == (const WPInfoKey& key1, const WPInfoKey& key2)
+{
+ return (key1.sType.CompareNoCase(key2.sType) == 0) && (key1.nPage == key2.nPage);
+}
+
+static bool operator < (const WPInfoKey& key1, const WPInfoKey& key2)
+{
+ if(key1.sType.CompareNoCase(key2.sType) == 0)
+ {
+ return key1.nPage < key2.nPage;
+ }
+ else
+ {
+ return key1.sType < key2.sType;
+ }
+}
+
+struct WPPage
+{
+ CString sType;
+ int nTotalPage;
+};
+
+struct WPInfo
+{
+ string flag;
+ string flag_desc;
+ string id;
+ string thumb_mid;
+ string thumb_nail;
+};
+
+class CDataMgr
+{
+public:
+ CDataMgr()
+ {
+ m_hWnd = NULL;
+ }
+
+public:
+ void Init(HWND hWnd)
+ {
+ m_hWnd = hWnd;
+ }
+
+ int LoadBizhi(CString sType, int nPage, int nCount = 10)
+ {
+ WPInfoKey* pKey = new WPInfoKey;
+ pKey->sType = sType;
+ pKey->nPage = nPage;
+ if(m_mapWPInfos.find(*pKey) != m_mapWPInfos.end())
+ {
+ return 1;
+ }
+
+ CString sUrl;
+ sUrl.Format(_T("http://bizhi.baidu.com/wallpaper/getList?type=%s&page=%d&count=%d&g=C_0-D_100825PBN40317ERB89E-M_206A8A1263C4-V_DE5571AC-T_20140714225619485&tn=bdwp&version=2.0.0.1160&_t=%d"), sType, nPage, nCount, GetTickCount());
+ std::string data = WebReadFile(sUrl);
+
+ Json::Reader reader;
+ Json::Value root;
+ if (!reader.parse(data.c_str(), root, false))
+ {
+ return -1;
+ }
+
+ string errormsg = root["errormsg"].asString();
+ int errorno = root["errorno"].asInt();
+ if(errorno != 0) return -1;
+ int ntotal = 0;
+ if(root["totalPage"].type() == Json::intValue)
+ {
+ ntotal = root["totalPage"].asInt();
+ }
+ else
+ {
+ string totalpage = root["totalPage"].asString();
+ ntotal = atoi(totalpage.c_str());
+ }
+ // ҳ
+ WPPage *pPage = new WPPage;
+ pPage->sType = sType;
+ pPage->nTotalPage = ntotal;
+ m_mapWPPages[sType] = *pPage;
+ ::PostMessage(m_hWnd, WM_GETWPPAGE_OK, (WPARAM)pPage, 0);
+
+ int page = root["page"].asInt();
+ Json::Value urls = root["list"];
+ for(int i = 0; i < urls.size(); ++i)
+ {
+ Json::Value url = urls[i];
+ WPInfo Info;
+ Info.flag = url["flag"].asString();
+ Info.flag_desc = url["flag_desc"].asString();
+ Info.id = url["id"].asString();
+ Info.thumb_mid = url["thumb_mid"].asString();
+ Info.thumb_nail = url["thumbnail"].asString();
+ m_mapWPInfos[*pKey].push_back(Info);
+ }
+
+ ::PostMessage(m_hWnd, WM_GETWPINFO_OK, (WPARAM)pKey, 0);
+ return 0;
+ }
+
+ bool GetBizhi(CString sType, int nPage, std::vector& vInfos)
+ {
+ WPInfoKey Key;
+ Key.sType = sType;
+ Key.nPage = nPage;
+ std::map>::iterator it = m_mapWPInfos.find(Key);
+ if(it != m_mapWPInfos.end())
+ {
+ vInfos = it->second;
+ return true;
+ }
+
+ return false;
+ }
+private:
+ static string WebReadFile(CString sUrl)
+ {
+ string data;
+ // http
+ HINTERNET hConnect = InternetOpen(NULL, INTERNET_OPEN_TYPE_DIRECT, NULL, NULL, 0);
+
+ if (hConnect)
+ {
+ DWORD dwTimeOut = 0;
+ InternetSetOption(hConnect, INTERNET_OPTION_CONNECT_TIMEOUT, &dwTimeOut, sizeof(dwTimeOut));
+
+ HINTERNET hSession = InternetOpenUrl(hConnect, sUrl, NULL, 0, INTERNET_FLAG_TRANSFER_BINARY | INTERNET_FLAG_PRAGMA_NOCACHE, 0);
+ if (hSession)
+ {
+ // ݻ
+ DWORD dwRead = 0;
+ DWORD dwBuffer = 1024 * 1024;
+ char *szBuffer = new char[dwBuffer];
+ memset(szBuffer, 0, dwBuffer);
+
+ if(InternetReadFile(hSession, szBuffer, dwBuffer, &dwRead) && (dwRead > 0))
+ {
+ int nLen = dwRead;
+ char* pBuffer = new char[nLen + 1];
+ memset(pBuffer, 0, nLen + 1);
+ memcpy(pBuffer, szBuffer, nLen);
+ if(pBuffer != NULL)
+ {
+ data = pBuffer;
+ }
+ }
+
+ // ݻ
+ delete []szBuffer;
+ szBuffer = NULL;
+
+ InternetCloseHandle(hSession);
+ }
+ InternetCloseHandle(hConnect);
+ }
+
+ return data;
+ }
+
+
+private:
+ HWND m_hWnd;
+ std::map m_mapWPPages;
+ std::map> m_mapWPInfos;
+};
\ No newline at end of file
diff --git a/Demos/bdwallpaper/Debug/BDWallPaper.bsc b/Demos/bdwallpaper/Debug/BDWallPaper.bsc
new file mode 100644
index 00000000..ca3ba4a8
Binary files /dev/null and b/Demos/bdwallpaper/Debug/BDWallPaper.bsc differ
diff --git a/Demos/bdwallpaper/MainWnd.cpp b/Demos/bdwallpaper/MainWnd.cpp
new file mode 100644
index 00000000..3cc48717
--- /dev/null
+++ b/Demos/bdwallpaper/MainWnd.cpp
@@ -0,0 +1,242 @@
+#include "StdAfx.h"
+#include "MainWnd.h"
+#include
+//////////////////////////////////////////////////////////////////////////
+///
+
+DUI_BEGIN_MESSAGE_MAP(CMainPage, CNotifyPump)
+ DUI_ON_MSGTYPE(DUI_MSGTYPE_CLICK,OnClick)
+ DUI_ON_MSGTYPE(DUI_MSGTYPE_SELECTCHANGED,OnSelectChanged)
+ DUI_ON_MSGTYPE(DUI_MSGTYPE_ITEMCLICK,OnItemClick)
+ DUI_END_MESSAGE_MAP()
+
+ CMainPage::CMainPage()
+{
+ m_pPaintManager = NULL;
+}
+
+void CMainPage::SetPaintMagager(CPaintManagerUI* pPaintMgr)
+{
+ m_pPaintManager = pPaintMgr;
+}
+
+void CMainPage::OnClick(TNotifyUI& msg)
+{
+
+}
+
+void CMainPage::OnSelectChanged( TNotifyUI &msg )
+{
+
+}
+
+void CMainPage::OnItemClick( TNotifyUI &msg )
+{
+
+}
+
+//////////////////////////////////////////////////////////////////////////
+///
+
+DUI_BEGIN_MESSAGE_MAP(CMainWnd, WindowImplBase)
+ DUI_ON_MSGTYPE(DUI_MSGTYPE_CLICK,OnClick)
+ DUI_ON_MSGTYPE(DUI_MSGTYPE_SELECTCHANGED,OnSelectChanged)
+ DUI_ON_MSGTYPE(DUI_MSGTYPE_ITEMCLICK,OnItemClick)
+ DUI_END_MESSAGE_MAP()
+
+ CMainWnd::CMainWnd(void)
+{
+ m_MainPage.SetPaintMagager(&m_PaintManager);
+
+ AddVirtualWnd(_T("mainpage"),&m_MainPage);
+}
+
+CMainWnd::~CMainWnd(void)
+{
+ RemoveVirtualWnd(_T("mainpage"));
+}
+
+DuiLib::CDuiString CMainWnd::GetSkinFolder()
+{
+#ifdef _DEBUG
+ return _T("skin\\BDWallPaper\\");
+#else
+ return _T("skin\\");
+#endif
+}
+
+DuiLib::CDuiString CMainWnd::GetSkinFile()
+{
+ return _T("main.xml");
+}
+
+UILIB_RESOURCETYPE CMainWnd::GetResourceType() const
+{
+#ifdef _DEBUG
+ return UILIB_FILE;
+#else
+ return UILIB_ZIPRESOURCE;
+#endif
+}
+
+LPCTSTR CMainWnd::GetResourceID() const
+{
+ return _T("IDR_SKIN");
+}
+
+DuiLib::CDuiString CMainWnd::GetZIPFileName() const
+{
+ return _T("skin.zip");
+}
+
+LPCTSTR CMainWnd::GetWindowClassName( void ) const
+{
+ return _T("MainWnd");
+}
+
+CControlUI* CMainWnd::CreateControl(LPCTSTR pstrClass)
+{
+ return ::CreateControl(pstrClass);
+}
+
+void CMainWnd::OnFinalMessage( HWND hWnd)
+{
+ __super::OnFinalMessage(hWnd);
+ delete this;
+}
+
+struct TABBTN
+{
+ CString sType;
+ CString sText;
+};
+void CMainWnd::InitWindow()
+{
+ // ʼݹ
+ m_Data.Init(m_hWnd);
+ // ఴť
+ CHorizontalLayoutUI* pTabBar = (CHorizontalLayoutUI*)m_PaintManager.FindControl(_T("tabbar"));
+ if(pTabBar)
+ {
+ TABBTN aTypes[] = {
+ {_T("8009|1003|1004|1007|1002|1005|1006|1001|1008"), _T("ѡ")},
+ {_T("1003"), _T("羰")},
+ {_T("1004"), _T("Ů")},
+ {_T("1007"), _T("С")},
+ {_T("1002"), _T("")},
+ {_T("1005"), _T("ȳ")},
+ {_T("1006"), _T("")},
+ {_T("1001"), _T("")},
+ {_T("1008"), _T("")},
+ {_T("8009"), _T("ɫ")},
+ };
+ COptionUI* pFirst = NULL;
+ for(int i = 0; i < sizeof(aTypes) / sizeof(TABBTN); ++i)
+ {
+ TABBTN Tab = aTypes[i];
+ COptionUI* pOption = new COptionUI();
+ pOption->SetName(_T("wp_tabbtn"));
+ pOption->SetText(Tab.sText);
+ pOption->SetUserData(Tab.sType);
+ pOption->SetGroup(_T("tabbar"));
+ pOption->SetFixedHeight(25);
+ pOption->SetFixedWidth(65);
+ pOption->SetHotImage(_T("file='main/224.bmp' corner='4,4,4,4'"));
+ pOption->SetSelectedImage(_T("file='main/224.bmp' corner='4,4,4,4'"));
+ pTabBar->Add(pOption);
+ if(pFirst == NULL) pFirst = pOption;
+ }
+
+ if(pFirst != NULL) pFirst->Selected(true);
+ }
+
+ m_Data.LoadBizhi(_T("8009|1003|1004|1007|1002|1005|1006|1001|1008"), 1, 10);
+}
+
+void CMainWnd::Notify( TNotifyUI &msg )
+{
+ if(msg.sType.CompareNoCase(DUI_MSGTYPE_SCROLL) == 0)
+ {
+ CVerticalLayoutUI* pTabPanel = (CVerticalLayoutUI*)msg.pSender;
+ CString sName = msg.pSender->GetName();
+ int nPage = (int)msg.wParam;
+ CString sTabPanel = sName;
+ int nIdx = sTabPanel.Find(_T("@"));
+ if(nIdx == -1) return;
+ CString sType = sTabPanel.Mid(nIdx + 1);
+ if(nPage < 1) nPage = 1;
+ if(nPage > 200) nPage = 200;
+
+ int nScrollPos = (nPage - 1) * pTabPanel->GetVerticalScrollBar()->GetLineSize();
+ SIZE szSize = {0, nScrollPos};
+ pTabPanel->SetScrollPos(szSize, false);
+
+ m_Data.LoadBizhi(sType, nPage, 10);
+ }
+ else if(msg.sType.CompareNoCase(DUI_MSGTYPE_SELECTCHANGED) == 0)
+ {
+ COptionUI* pTabBtn = (COptionUI*)msg.pSender;
+ CTabLayoutUI* pTabLayout = (CTabLayoutUI*)m_PaintManager.FindControl(_T("wp_tablayout"));
+ CString sName = pTabBtn->GetName();
+ if(sName == _T("wp_tabbtn") && pTabLayout)
+ {
+ CString sType = pTabBtn->GetUserData();
+ CString sTabPanel;
+ sTabPanel.Format(_T("wp_tabpanel@%s"), sType);
+ CVerticalLayoutUI* pTabPanel = (CVerticalLayoutUI*)m_PaintManager.FindControl(sTabPanel);
+ if(pTabPanel == NULL)
+ {
+ m_Data.LoadBizhi(sType, 1, 10);
+ }
+ else
+ {
+ pTabLayout->SelectItem(pTabPanel);
+ }
+ }
+ }
+ else if(msg.sType.CompareNoCase(DUI_MSGTYPE_CLICK_WPFAV) == 0)
+ {
+ MessageBox(NULL, _T("ղسɹ"), _T("ٶȱֽ - ʾ"), MB_OK);
+ }
+ else if(msg.sType.CompareNoCase(DUI_MSGTYPE_CLICK_WPSET) == 0)
+ {
+ CWPButton* pWPBtn = (CWPButton*)msg.pSender;
+ pWPBtn->SetWP();
+ }
+ return WindowImplBase::Notify(msg);
+}
+
+void CMainWnd::OnClick( TNotifyUI &msg )
+{
+ CDuiString sCtrlName = msg.pSender->GetName();
+ if( sCtrlName == _T("closebtn") )
+ {
+ Close();
+ return;
+ }
+ else if( sCtrlName == _T("minbtn"))
+ {
+ SendMessage(WM_SYSCOMMAND, SC_MINIMIZE, 0);
+ return;
+ }
+ else if( sCtrlName == _T("maxbtn"))
+ {
+ SendMessage(WM_SYSCOMMAND, SC_MAXIMIZE, 0);
+ return;
+ }
+ else if( sCtrlName == _T("restorebtn"))
+ {
+ SendMessage(WM_SYSCOMMAND, SC_RESTORE, 0);
+ return;
+ }
+}
+
+void CMainWnd::OnSelectChanged( TNotifyUI &msg )
+{
+
+}
+
+void CMainWnd::OnItemClick( TNotifyUI &msg )
+{
+
+}
\ No newline at end of file
diff --git a/Demos/bdwallpaper/MainWnd.h b/Demos/bdwallpaper/MainWnd.h
new file mode 100644
index 00000000..cfe2a5fe
--- /dev/null
+++ b/Demos/bdwallpaper/MainWnd.h
@@ -0,0 +1,165 @@
+#pragma once
+
+#include "Utils.h"
+#include "DataMgr.h"
+#include "ControlInclude.h"
+//////////////////////////////////////////////////////////////////////////
+///
+
+class CMainPage : public CNotifyPump
+{
+public:
+ CMainPage();
+
+public:
+ void SetPaintMagager(CPaintManagerUI* pPaintMgr);
+
+ DUI_DECLARE_MESSAGE_MAP()
+ virtual void OnClick(TNotifyUI& msg);
+ virtual void OnSelectChanged( TNotifyUI &msg );
+ virtual void OnItemClick( TNotifyUI &msg );
+
+private:
+ CPaintManagerUI* m_pPaintManager;
+};
+
+//////////////////////////////////////////////////////////////////////////
+///
+
+class CMainWnd : public WindowImplBase
+{
+public:
+ CMainWnd(void);
+ ~CMainWnd(void);
+
+public:
+ virtual LPCTSTR GetWindowClassName( void ) const;
+
+ virtual CDuiString GetSkinFolder();
+ virtual CDuiString GetSkinFile();
+ virtual UILIB_RESOURCETYPE GetResourceType() const;
+ virtual LPCTSTR GetResourceID() const;
+ virtual CDuiString GetZIPFileName() const;
+
+ virtual CControlUI* CreateControl(LPCTSTR pstrClass);
+ virtual void OnFinalMessage( HWND );
+ virtual void InitWindow();
+ virtual LRESULT HandleCustomMessage(UINT uMsg, WPARAM wParam, LPARAM lParam, BOOL& bHandled)
+ {
+ bHandled = FALSE;
+
+ LRESULT lResult = 0;
+
+ switch(uMsg)
+ {
+ case WM_GETWPPAGE_OK:
+ {
+ lResult = OnGetWPPageOK(uMsg, wParam, lParam, bHandled);
+ break;
+ }
+ case WM_GETWPINFO_OK:
+ {
+ lResult = OnGetWPInfoOK(uMsg, wParam, lParam, bHandled);
+ break;
+ }
+ default: break;
+ }
+ return lResult;
+ }
+public:
+ virtual LRESULT OnClose(UINT /*uMsg*/, WPARAM /*wParam*/, LPARAM /*lParam*/, BOOL& bHandled)
+ {
+ PostQuitMessage(0);
+ return 0;
+ }
+
+ virtual LRESULT OnGetWPPageOK(UINT /*uMsg*/, WPARAM wParam, LPARAM /*lParam*/, BOOL& bHandled)
+ {
+ WPPage* pPage = (WPPage*)wParam;
+ if(pPage != NULL)
+ {
+ CTabLayoutUI* pTabLayout = (CTabLayoutUI*)m_PaintManager.FindControl(_T("wp_tablayout"));
+ if(pTabLayout)
+ {
+ CString sTabPanel;
+ sTabPanel.Format(_T("wp_tabpanel@%s"), pPage->sType);
+ CVerticalLayoutUI* pTabPanel = (CVerticalLayoutUI*)m_PaintManager.FindControl(sTabPanel);
+ if(pTabPanel == NULL)
+ {
+ pTabPanel = new CVerticalLayoutUI();
+ pTabPanel->SetName(sTabPanel);
+ pTabPanel->SetFixedHeight(pTabLayout->GetFixedHeight());
+ pTabLayout->Add(pTabPanel);
+ pTabPanel->EnableScrollBar(true, false);
+ pTabPanel->SetScrollStepSize(pTabLayout->GetFixedHeight() - 12);
+ pTabPanel->GetVerticalScrollBar()->SetLineSize(pTabLayout->GetFixedHeight() - 12);
+ pTabLayout->SelectItem(pTabPanel);
+ for(int i = 1; i <= pPage->nTotalPage; i++)
+ {
+ CString sPanel;
+ sPanel.Format(_T("wp_panel_%s_%d"), pPage->sType, i);
+ CWPPanel* pPanel = new CWPPanel();
+ pPanel->SetFixedHeight(pTabPanel->GetFixedHeight() - 12);
+ pPanel->SetName(sPanel);
+ pTabPanel->Add(pPanel);
+ DoEvents();
+ }
+ }
+ }
+
+ delete pPage;
+ pPage = NULL;
+ }
+ return 0;
+ }
+
+ virtual LRESULT OnGetWPInfoOK(UINT /*uMsg*/, WPARAM wParam, LPARAM /*lParam*/, BOOL& bHandled)
+ {
+ WPInfoKey* pKey = (WPInfoKey*)wParam;
+ if(pKey != NULL)
+ {
+ CString sPanel;
+ sPanel.Format(_T("wp_panel_%s_%d"), pKey->sType, pKey->nPage);
+ CWPPanel* pPanel = (CWPPanel*)m_PaintManager.FindControl(sPanel);
+ if(pPanel != NULL)
+ {
+ std::vector vInfos;
+ if(m_Data.GetBizhi(pKey->sType, pKey->nPage, vInfos))
+ {
+ for(int i = 0; i < vInfos.size(); i++)
+ {
+ WPInfo Info = vInfos[i];
+ CString sID = Info.id.c_str();
+ CString sThumbMid = Info.thumb_mid.c_str();
+ CString sThumbNail = Info.thumb_nail.c_str();
+ CString sButton;
+ sButton.Format(_T("wp_button_%s_%d"), pKey->sType, atoi(Info.id.c_str()));
+ CWPButton* pButton = new CWPButton();
+ pButton->SetName(sButton);
+ pButton->SetWPImage(sThumbMid);
+ pButton->SetWPToolbarImage(_T("file='main/toolbar.png' corner='4,4,4,4'"));
+ pButton->SetWPSetImage(_T("file='main/set.png' dest='0,0,94,25'"));
+ pButton->SetWPFavImage(_T("file='main/fav.png' dest='0,0,94,25'"));
+ pButton->SetUserData(CString(Info.id.c_str()));
+ pPanel->Add(pButton);
+ DoEvents();
+ }
+ }
+ }
+ delete pKey;
+ pKey = NULL;
+ }
+ return 0;
+ }
+
+public:
+ virtual void Notify( TNotifyUI &msg );
+ DUI_DECLARE_MESSAGE_MAP()
+ virtual void OnClick(TNotifyUI& msg);
+ virtual void OnSelectChanged( TNotifyUI &msg );
+ virtual void OnItemClick( TNotifyUI &msg );
+
+private:
+ CMainPage m_MainPage;
+ CDataMgr m_Data;
+};
diff --git a/Demos/bdwallpaper/Res/BDWallPaper.ico b/Demos/bdwallpaper/Res/BDWallPaper.ico
new file mode 100644
index 00000000..c38850de
Binary files /dev/null and b/Demos/bdwallpaper/Res/BDWallPaper.ico differ
diff --git a/Demos/bdwallpaper/Res/bdwallpaper.zip b/Demos/bdwallpaper/Res/bdwallpaper.zip
new file mode 100644
index 00000000..feaac8dd
Binary files /dev/null and b/Demos/bdwallpaper/Res/bdwallpaper.zip differ
diff --git a/Demos/bdwallpaper/StdAfx.cpp b/Demos/bdwallpaper/StdAfx.cpp
new file mode 100644
index 00000000..79228f61
--- /dev/null
+++ b/Demos/bdwallpaper/StdAfx.cpp
@@ -0,0 +1,15 @@
+// stdafx.cpp : source file that includes just the standard includes
+// App.pch will be the pre-compiled header
+// stdafx.obj will contain the pre-compiled type information
+
+#include "stdafx.h"
+
+#if defined _M_IX86
+#pragma comment(linker, "/manifestdependency:\"type='win32' name='Microsoft.Windows.Common-Controls' version='6.0.0.0' processorArchitecture='x86' publicKeyToken='6595b64144ccf1df' language='*'\"")
+#elif defined _M_IA64
+#pragma comment(linker, "/manifestdependency:\"type='win32' name='Microsoft.Windows.Common-Controls' version='6.0.0.0' processorArchitecture='ia64' publicKeyToken='6595b64144ccf1df' language='*'\"")
+#elif defined _M_X64
+#pragma comment(linker, "/manifestdependency:\"type='win32' name='Microsoft.Windows.Common-Controls' version='6.0.0.0' processorArchitecture='amd64' publicKeyToken='6595b64144ccf1df' language='*'\"")
+#else
+#pragma comment(linker, "/manifestdependency:\"type='win32' name='Microsoft.Windows.Common-Controls' version='6.0.0.0' processorArchitecture='*' publicKeyToken='6595b64144ccf1df' language='*'\"")
+#endif
diff --git a/Demos/bdwallpaper/StdAfx.h b/Demos/bdwallpaper/StdAfx.h
new file mode 100644
index 00000000..6191eb85
--- /dev/null
+++ b/Demos/bdwallpaper/StdAfx.h
@@ -0,0 +1,36 @@
+
+#if !defined(AFX_STDAFX_H__A9DB83DB_A9FD_11D0_BFD1_444553540000__INCLUDED_)
+#define AFX_STDAFX_H__A9DB83DB_A9FD_11D0_BFD1_444553540000__INCLUDED_
+
+#pragma once
+
+#define WIN32_LEAN_AND_MEAN
+#define _CRT_SECURE_NO_DEPRECATE
+
+#include
+#include
+#include
+#include
+#include
+
+#include "..\..\DuiLib\UIlib.h"
+using namespace DuiLib;
+
+#ifdef _DEBUG
+# ifdef _UNICODE
+# pragma comment(lib, "..\\..\\lib\\DuiLib_d.lib")
+# else
+# pragma comment(lib, "..\\..\\lib\\DuiLib_d.lib")
+# endif
+#else
+# ifdef _UNICODE
+# pragma comment(lib, "..\\..\\lib\\DuiLib.lib")
+# else
+# pragma comment(lib, "..\\..\\lib\\DuiLib.lib")
+# endif
+#endif
+
+//{{AFX_INSERT_LOCATION}}
+// Microsoft Visual C++ will insert additional declarations immediately before the previous line.
+
+#endif // !defined(AFX_STDAFX_H__A9DB83DB_A9FD_11D0_BFD1_444553540000__INCLUDED_)
diff --git a/Demos/bdwallpaper/controlex/AnimationHelper.cpp b/Demos/bdwallpaper/controlex/AnimationHelper.cpp
new file mode 100644
index 00000000..25d2f1d8
--- /dev/null
+++ b/Demos/bdwallpaper/controlex/AnimationHelper.cpp
@@ -0,0 +1,1201 @@
+#include "stdafx.h"
+#include "AnimationHelper.h"
+
+///////////////////////////////////////////////////////////////////////////////////////
+DECLARE_HANDLE(HZIP); // An HZIP identifies a zip file that has been opened
+typedef DWORD ZRESULT;
+typedef struct
+{
+ int index; // index of this file within the zip
+ char name[MAX_PATH]; // filename within the zip
+ DWORD attr; // attributes, as in GetFileAttributes.
+ FILETIME atime,ctime,mtime;// access, create, modify filetimes
+ long comp_size; // sizes of item, compressed and uncompressed. These
+ long unc_size; // may be -1 if not yet known (e.g. being streamed in)
+} ZIPENTRY;
+typedef struct
+{
+ int index; // index of this file within the zip
+ TCHAR name[MAX_PATH]; // filename within the zip
+ DWORD attr; // attributes, as in GetFileAttributes.
+ FILETIME atime,ctime,mtime;// access, create, modify filetimes
+ long comp_size; // sizes of item, compressed and uncompressed. These
+ long unc_size; // may be -1 if not yet known (e.g. being streamed in)
+} ZIPENTRYW;
+#define OpenZip OpenZipU
+#define CloseZip(hz) CloseZipU(hz)
+extern HZIP OpenZipU(void *z,unsigned int len,DWORD flags);
+extern ZRESULT CloseZipU(HZIP hz);
+#ifdef _UNICODE
+#define ZIPENTRY ZIPENTRYW
+#define GetZipItem GetZipItemW
+#define FindZipItem FindZipItemW
+#else
+#define GetZipItem GetZipItemA
+#define FindZipItem FindZipItemA
+#endif
+extern ZRESULT GetZipItemA(HZIP hz, int index, ZIPENTRY *ze);
+extern ZRESULT GetZipItemW(HZIP hz, int index, ZIPENTRYW *ze);
+extern ZRESULT FindZipItemA(HZIP hz, const TCHAR *name, bool ic, int *index, ZIPENTRY *ze);
+extern ZRESULT FindZipItemW(HZIP hz, const TCHAR *name, bool ic, int *index, ZIPENTRYW *ze);
+extern ZRESULT UnzipItem(HZIP hz, int index, void *dst, unsigned int len, DWORD flags);
+///////////////////////////////////////////////////////////////////////////////////////
+
+extern "C"
+{
+ extern unsigned char *stbi_load_from_memory(unsigned char const *buffer, int len, int *x, int *y, \
+ int *comp, int req_comp);
+ extern void stbi_image_free(void *retval_from_stbi_load);
+
+};
+
+namespace DuiLib
+{
+ /************************************************************************/
+ /* CAnimation */
+ /************************************************************************/
+
+ //////////////////////////////////////////////////////////////////////
+ // Nested structures member functions
+ //////////////////////////////////////////////////////////////////////
+ inline int CAnimation::TGIFControlExt::GetPackedValue(enum ControlExtValues Value)
+ {
+ int nRet = (int) m_cPacked;
+ switch(Value)
+ {
+ case GCX_PACKED_DISPOSAL:
+ nRet = (nRet & 28) >> 2;
+ break;
+
+ case GCX_PACKED_USERINPUT:
+ nRet = (nRet & 2) >> 1;
+ break;
+
+ case GCX_PACKED_TRANSPCOLOR:
+ nRet &= 1;
+ break;
+ };
+
+ return nRet;
+ }
+
+ inline int CAnimation::TGIFLSDescriptor::GetPackedValue(enum LSDPackedValues Value)
+ {
+ int nRet = (int) m_cPacked;
+
+ switch(Value)
+ {
+ case LSD_PACKED_GLOBALCT:
+ nRet = nRet >> 7;
+ break;
+
+ case LSD_PACKED_CRESOLUTION:
+ nRet = ((nRet & 0x70) >> 4) + 1;
+ break;
+
+ case LSD_PACKED_SORT:
+ nRet = (nRet & 8) >> 3;
+ break;
+
+ case LSD_PACKED_GLOBALCTSIZE:
+ nRet &= 7;
+ break;
+ };
+
+ return nRet;
+ }
+
+ inline int CAnimation::TGIFImageDescriptor::GetPackedValue(enum IDPackedValues Value)
+ {
+ int nRet = (int) m_cPacked;
+
+ switch(Value)
+ {
+ case ID_PACKED_LOCALCT:
+ nRet >>= 7;
+ break;
+
+ case ID_PACKED_INTERLACE:
+ nRet = ((nRet & 0x40) >> 6);
+ break;
+
+ case ID_PACKED_SORT:
+ nRet = (nRet & 0x20) >> 5;
+ break;
+
+ case ID_PACKED_LOCALCTSIZE:
+ nRet &= 7;
+ break;
+ };
+
+ return nRet;
+ }
+
+ //////////////////////////////////////////////////////////////////////
+ // ctor && dtor
+ //////////////////////////////////////////////////////////////////////
+ CAnimation::CAnimation(IAnimationCallback* pCallback) : m_pCallback(pCallback)
+ {
+ // check structures size
+ assert(sizeof(TGIFImageDescriptor) == 10);
+ assert(sizeof(TGIFAppExtension) == 14);
+ assert(sizeof(TGIFPlainTextExt) == 15);
+ assert(sizeof(TGIFLSDescriptor) == 7);
+ assert(sizeof(TGIFControlExt) == 8);
+ assert(sizeof(TGIFCommentExt) == 2);
+ assert(sizeof(TGIFHeader) == 6);
+
+ m_pRawData = NULL;
+ m_nDataSize = 0;
+ m_pGIFHeader = NULL;
+ m_pGIFLSDescriptor = NULL;
+ m_nGlobalCTSize = 0;
+ m_PictureSize.cx = m_PictureSize.cy = 0;
+ m_clrBackground = RGB(255, 255, 255); // white by default
+ m_nCurrFrame = 0;
+ m_nCurrOffset = 0;
+ m_hThread = NULL;
+ m_bExitThread = true;
+
+ m_hDrawEvent = ::CreateEvent(NULL, FALSE, FALSE, NULL);
+ assert(m_hDrawEvent);
+ m_pvFrames = new VTFRAME;
+ assert(m_pvFrames);
+ }
+
+ CAnimation::~CAnimation()
+ {
+ UnLoad();
+ delete m_pvFrames;
+ m_pvFrames = NULL;
+ CloseHandle(m_hDrawEvent);
+ m_hDrawEvent = NULL;
+ }
+
+ const TImageInfo* CAnimation::LoadGIF(LPCTSTR bitmap, LPCTSTR type/* = NULL*/, DWORD mask/* = 0*/)
+ {
+ LPBYTE pData = NULL;
+ DWORD dwSize = 0;
+ if( type != NULL && isdigit(*bitmap) )
+ {
+ LPTSTR pstr = NULL;
+ int iIndex = _tcstol(bitmap, &pstr, 10);
+ HRSRC hPicture = ::FindResource(CPaintManagerUI::GetResourceDll(), MAKEINTRESOURCE(iIndex), type);
+ if (!hPicture)
+ return NULL;
+ HGLOBAL hResData;
+ if (!(hResData = ::LoadResource(CPaintManagerUI::GetResourceDll(), hPicture)))
+ {
+ ::FreeResource(hPicture);
+ return NULL;
+ };
+ dwSize = ::SizeofResource(CPaintManagerUI::GetResourceDll(),hPicture);
+ if( dwSize < sizeof(TGIFHeader))
+ {
+ ::FreeResource(hPicture);
+ return NULL;
+ }
+ pData = static_cast( malloc(dwSize*sizeof(BYTE)) );
+ if (!pData)
+ {
+ ::FreeResource(hPicture);
+ return NULL;
+ }
+ LPBYTE pSrc = static_cast( ::LockResource(hResData) );
+ if (!pSrc)
+ {
+ free(pData);
+ ::FreeResource(hPicture);
+ return NULL;
+ }
+ ::CopyMemory(pData, pSrc, dwSize);
+ ::FreeResource(hPicture);
+ }
+ else
+ {
+ CDuiString sFile = CPaintManagerUI::GetResourcePath();
+ if( CPaintManagerUI::GetResourceZip().IsEmpty() ) {
+ sFile += bitmap;
+ HANDLE hFile = INVALID_HANDLE_VALUE;
+ DWORD dwRead=0;
+ hFile = ::CreateFile(sFile.GetData(), GENERIC_READ, FILE_SHARE_READ, NULL, OPEN_EXISTING, \
+ FILE_ATTRIBUTE_NORMAL|FILE_FLAG_SEQUENTIAL_SCAN, NULL);
+ if(INVALID_HANDLE_VALUE == hFile)
+ return NULL;
+ dwSize = ::GetFileSize(hFile, NULL);
+ if (dwSize < sizeof(TGIFHeader))
+ {
+ CloseHandle(hFile);
+ return NULL;
+ }
+ pData = static_cast( malloc(dwSize*sizeof(BYTE)) );
+ if (!pData)
+ {
+ CloseHandle(hFile);
+ return NULL;
+ }
+ ::ReadFile(hFile, pData, dwSize, &dwRead, NULL);
+ ::CloseHandle(hFile);
+ }
+ else
+ {
+ sFile += CPaintManagerUI::GetResourceZip();
+ HZIP hz = NULL;
+ if( CPaintManagerUI::IsCachedResourceZip() ) hz = (HZIP)CPaintManagerUI::GetResourceZipHandle();
+ else hz = OpenZip((void*)sFile.GetData(), 0, 2);
+ if( hz == NULL )
+ return NULL;
+ ZIPENTRY ze;
+ int i;
+ if( FindZipItem(hz, bitmap, true, &i, &ze) != 0 )
+ {
+ if( !CPaintManagerUI::IsCachedResourceZip() )
+ CloseZip(hz);
+ return NULL;
+ }
+ dwSize = ze.unc_size;
+ if (dwSize < sizeof(TGIFHeader))
+ {
+ if( !CPaintManagerUI::IsCachedResourceZip() )
+ CloseZip(hz);
+ return NULL;
+ }
+ pData = static_cast( malloc(dwSize*sizeof(BYTE)) );
+ if (!pData)
+ {
+ if( !CPaintManagerUI::IsCachedResourceZip() )
+ CloseZip(hz);
+ return NULL;
+ }
+ int res = UnzipItem(hz, i, pData, dwSize, 3);
+ if( res != 0x00000000 && res != 0x00000600) {
+ free(pData);
+ if( !CPaintManagerUI::IsCachedResourceZip() )
+ CloseZip(hz);
+ return NULL;
+ }
+ if( !CPaintManagerUI::IsCachedResourceZip() )
+ CloseZip(hz);
+ }
+ }
+
+ const TImageInfo* data = LoadGIF(pData, dwSize);
+ free(pData);
+ return data;
+ }
+
+ const TImageInfo* CAnimation::LoadGIF(const LPBYTE pData, DWORD dwSize, DWORD mask/* = 0*/)
+ {
+ if (!pData || dwSize==0)
+ return NULL;
+
+ UnLoad();
+
+ if(!(m_pRawData = const_cast(pData)))
+ return NULL;
+
+ m_nDataSize = dwSize;
+ m_pGIFHeader = (TGIFHeader*)m_pRawData;
+
+ if((memcmp(&m_pGIFHeader->m_cSignature, "GIF", 3) != 0)
+ && ((memcmp(&m_pGIFHeader->m_cVersion, "87a", 3) != 0)
+ || (memcmp(&m_pGIFHeader->m_cVersion, "89a", 3) != 0)))
+ {
+ // it's neither GIF87a nor GIF89a
+ // do nothing
+ // clear GIF variables
+ m_pRawData = NULL;
+ m_pGIFHeader = NULL;
+ m_nDataSize = 0;
+
+ return NULL;
+ }
+
+ m_pGIFLSDescriptor = (TGIFLSDescriptor*)(m_pRawData + sizeof(TGIFHeader));
+ if(m_pGIFLSDescriptor->GetPackedValue(LSD_PACKED_GLOBALCT) == 1)
+ {
+ // calculate the globat color table size
+ m_nGlobalCTSize = static_cast(3 * (1
+ << (m_pGIFLSDescriptor->GetPackedValue(LSD_PACKED_GLOBALCTSIZE)
+ + 1)));
+ // get the background color if GCT is present
+ unsigned char * pBkClr = m_pRawData
+ + sizeof(TGIFHeader) + sizeof(TGIFLSDescriptor)
+ + 3 * m_pGIFLSDescriptor->m_cBkIndex;
+ m_clrBackground = RGB(pBkClr[0], pBkClr[1], pBkClr[2]);
+ };
+
+ // store the picture's size
+ m_PictureSize.cx = m_pGIFLSDescriptor->m_wWidth;
+ m_PictureSize.cy = m_pGIFLSDescriptor->m_wHeight;
+
+ // determine frame count for this picture
+ UINT nFrameCount = 0;
+ ResetDataPointer();
+ while(SkipNextGraphicBlock())
+ nFrameCount++;
+
+#ifdef GIF_TRACING
+ OutputDebugString(_T(" -= GIF encountered\n"
+ "Logical Screen dimensions = %dx%d\n"
+ "Global color table = %d\n"
+ "Color depth = %d\n"
+ "Sort flag = %d\n"
+ "Size of Global Color Table = %d\n"
+ "Background color index = %d\n"
+ "Pixel aspect ratio = %d\n"
+ "Frame count = %d\n"
+ "Background color = %06Xh\n\n"),
+ m_pGIFLSDescriptor->m_wWidth,
+ m_pGIFLSDescriptor->m_wHeight,
+ m_pGIFLSDescriptor->GetPackedValue(LSD_PACKED_GLOBALCT),
+ m_pGIFLSDescriptor->GetPackedValue(LSD_PACKED_CRESOLUTION),
+ m_pGIFLSDescriptor->GetPackedValue(LSD_PACKED_SORT),
+ m_pGIFLSDescriptor->GetPackedValue(LSD_PACKED_GLOBALCTSIZE),
+ m_pGIFLSDescriptor->m_cBkIndex,
+ m_pGIFLSDescriptor->m_cPixelAspect,
+ nFrameCount,
+ m_clrBackground);
+ EnumGIFBlocks();
+#endif
+
+ if(nFrameCount <= 1)
+ {
+ // now check the frame count
+ // if there's an empty GIF or only one frame,
+ // no need to animate this GIF
+ // therefore, treat it like any other pic
+ m_pRawData = NULL;
+ return NULL;
+ }
+
+ // if, on the contrary, there are several frames
+ // then store separate frames in an array
+ TFrame frame;
+ UINT nBlockLen = 0;
+ LPBYTE pFrameData = NULL;
+ UINT nCurFrame = 0;
+ //////////////////////////////////////////////////////////////////////////
+ // Before rendering a frame we should take care of what's
+ // behind that frame. TFrame::m_nDisposal will be our guide:
+ // 0 - no disposal specified (do nothing)
+ // 1 - do not dispose (again, do nothing)
+ // 2 - restore to background color (m_clrBackground)
+ // 3 - restore to previous
+ // background color for first frame
+ LPBYTE pDispData = static_cast(malloc(m_PictureSize.cx * m_PictureSize.cy * sizeof(COLORREF)));
+ if (!pDispData)
+ {
+ m_pRawData = NULL;
+ return NULL;
+ }
+ for (int n = 0; n < m_PictureSize.cx*m_PictureSize.cy; n++)
+ ((COLORREF*)pDispData)[n] = m_clrBackground;
+
+ ResetDataPointer();
+ while(pFrameData = GetNextGraphicBlock(&nBlockLen,
+ &frame.m_nDelay,
+ &frame.m_frameSize,
+ &frame.m_frameOffset,
+ &frame.m_nDisposal))
+ {
+#ifdef GIF_TRACING
+ //////////////////////////////////////////////
+ // uncomment the following strings if you want
+ // to write separate frames on disk
+ //
+ // CString szName;
+ // szName.Format(_T("%.4d.gif"),nCurFrame);
+ // WriteDataOnDisk(szName,hFrameData,nBlockLen);
+ // nCurFrame++;
+#endif // GIF_TRACING
+ if (!pFrameData)
+ continue;
+
+ LPBYTE pImage = NULL;
+ int x,y,n;
+ pImage = stbi_load_from_memory(pFrameData, nBlockLen, &x, &y, &n, 4);
+ free(pFrameData);
+ pFrameData = NULL;
+ BITMAPINFO bmi;
+ ::ZeroMemory(&bmi, sizeof(BITMAPINFO));
+ bmi.bmiHeader.biSize = sizeof(BITMAPINFOHEADER);
+ bmi.bmiHeader.biWidth = x;
+ bmi.bmiHeader.biHeight = -y;
+ bmi.bmiHeader.biPlanes = 1;
+ bmi.bmiHeader.biBitCount = 32;
+ bmi.bmiHeader.biCompression = BI_RGB;
+ bmi.bmiHeader.biSizeImage = x * y * 4;
+
+ bool bAlphaChannel = false;
+ LPBYTE pDest = NULL;
+ HBITMAP hBitmap = ::CreateDIBSection(NULL, &bmi, DIB_RGB_COLORS, (void**)&pDest, NULL, 0);
+ if( !hBitmap )
+ {
+ stbi_image_free(pImage);
+ continue;
+ }
+
+ for( int i = 0; i < x * y; i++ )
+ {
+ DWORD dwPixel = pImage[i*4+3]==BYTE(0) ? ((DWORD*)pDispData)[i] : ((DWORD*)pImage)[i];;
+ LPBYTE pPixel = (LPBYTE)(&dwPixel);
+ pDest[i*4 + 3] = pPixel[3];
+ if( pDest[i*4 + 3] < 255 )
+ {
+ pDest[i*4] = (BYTE)(DWORD(pPixel[2])*pPixel[3]/255);
+ pDest[i*4 + 1] = (BYTE)(DWORD(pPixel[1])*pPixel[3]/255);
+ pDest[i*4 + 2] = (BYTE)(DWORD(pPixel[0])*pPixel[3]/255);
+ bAlphaChannel = true;
+ }
+ else
+ {
+ pDest[i*4] = pPixel[2];
+ pDest[i*4 + 1] = pPixel[1];
+ pDest[i*4 + 2] = pPixel[0];
+ }
+
+ if( *(DWORD*)(&pDest[i*4]) == mask ) {
+ pDest[i*4] = (BYTE)0;
+ pDest[i*4 + 1] = (BYTE)0;
+ pDest[i*4 + 2] = (BYTE)0;
+ pDest[i*4 + 3] = (BYTE)0;
+ bAlphaChannel = true;
+ }
+ }
+ stbi_image_free(pImage);
+
+ switch (frame.m_nDisposal)
+ {
+ case 0:
+ memset(pDispData, 0, m_PictureSize.cx*m_PictureSize.cy*sizeof(COLORREF));
+ break;
+ case 1:
+ memcpy(pDispData, pDest, x * y * 4);
+ break;
+ case 2:
+ for (int n = 0; n < m_PictureSize.cx*m_PictureSize.cy; n++)
+ ((COLORREF*)pDispData)[n] = m_clrBackground;
+ break;
+ case 3:
+ break;
+ }
+
+ frame.m_pImage = new TImageInfo;
+ frame.m_pImage->hBitmap = hBitmap;
+ frame.m_pImage->nX = x;
+ frame.m_pImage->nY = y;
+ frame.m_pImage->alphaChannel = bAlphaChannel;
+
+ nCurFrame++;
+ // everything went well, add this frame
+ m_pvFrames->push_back(frame);
+ };
+
+ // clean after ourselves
+ free(pDispData); pDispData = NULL;
+ m_pRawData = NULL;
+ m_nDataSize = 0;
+ m_pGIFHeader = NULL;
+ m_pGIFLSDescriptor = NULL;
+ m_nGlobalCTSize = 0;
+ m_nCurrOffset = 0;
+
+ return m_pvFrames->empty() ? NULL : ((*m_pvFrames)[0]).m_pImage;
+ }
+
+ void CAnimation::UnLoad()
+ {
+ Stop();
+
+ std::vector::iterator it;
+ for(it = m_pvFrames->begin();it < m_pvFrames->end();it++)
+ {
+ if ((*it).m_pImage)
+ {
+ ::DeleteObject((*it).m_pImage->hBitmap);
+ delete (*it).m_pImage;
+ }
+ }
+ m_pvFrames->clear();
+ m_PictureSize.cx = m_PictureSize.cy = 0;
+ m_clrBackground = RGB(255, 255, 255); // white by default
+ m_nCurrFrame = 0;
+ }
+
+ bool CAnimation::Play()
+ {
+ if(!m_bExitThread)
+ return false;
+
+ if (m_hThread != NULL)
+ {
+ ::WaitForSingleObject(m_hThread, 5000);
+ ::CloseHandle(m_hThread);
+ m_hThread = NULL;
+ }
+
+ DWORD nDummy;
+ m_bExitThread = false;
+ m_hThread = (HANDLE) ::CreateThread(NULL,
+ 0,
+ _ThreadAnimation,
+ (void *)this,
+ CREATE_SUSPENDED,
+ &nDummy);
+ if(!m_hThread)
+ {
+ m_bExitThread = true;
+ return false;
+ }
+ else
+ ::ResumeThread(m_hThread);
+
+ return true;
+ }
+
+ void CAnimation::Stop()
+ {
+ m_bExitThread = true;
+ ::SetEvent(m_hDrawEvent);
+ // we'll wait for 5 seconds then continue execution
+ ::WaitForSingleObject(m_hThread, 5000);
+ ::CloseHandle(m_hThread);
+ m_hThread = NULL;
+ }
+
+ bool CAnimation::IsPlaying() const
+ {
+ return !m_bExitThread;
+ }
+
+ SIZE CAnimation::GetSize() const
+ {
+ return m_PictureSize;
+ }
+
+ int CAnimation::GetFrameCount() const
+ {
+ if (m_pvFrames)
+ return m_pvFrames->size();
+ else
+ return 0;
+ }
+
+ COLORREF CAnimation::GetBkColor() const
+ {
+ return m_clrBackground;
+ }
+
+ const TImageInfo* CAnimation::GetCurImage()
+ {
+ TImageInfo* data = ((*m_pvFrames)[m_nCurrFrame]).m_pImage;
+ if (!IsPlaying())
+ Play();
+ ::SetEvent(m_hDrawEvent);
+ return data;
+ }
+
+ //////////////////////////////////////////////////////////////////////
+ // protected methods
+ //////////////////////////////////////////////////////////////////////
+ int CAnimation::GetNextBlockLen() const
+ {
+ GIFBlockTypes nBlock = GetNextBlock();
+
+ int nTmp;
+
+ switch(nBlock)
+ {
+ case BLOCK_UNKNOWN:
+ return -1;
+ break;
+
+ case BLOCK_TRAILER:
+ return 1;
+ break;
+
+ case BLOCK_APPEXT:
+ nTmp = GetSubBlocksLen(m_nCurrOffset + sizeof(TGIFAppExtension));
+ if(nTmp > 0)
+ return sizeof(TGIFAppExtension) + nTmp;
+ break;
+
+ case BLOCK_COMMEXT:
+ nTmp = GetSubBlocksLen(m_nCurrOffset + sizeof(TGIFCommentExt));
+ if(nTmp > 0)
+ return sizeof(TGIFCommentExt) + nTmp;
+ break;
+
+ case BLOCK_CONTROLEXT:
+ return sizeof(TGIFControlExt);
+ break;
+
+ case BLOCK_PLAINTEXT:
+ nTmp = GetSubBlocksLen(m_nCurrOffset + sizeof(TGIFPlainTextExt));
+ if(nTmp > 0)
+ return sizeof(TGIFPlainTextExt) + nTmp;
+ break;
+
+ case BLOCK_IMAGE:
+ TGIFImageDescriptor* pIDescr = reinterpret_cast(&m_pRawData[m_nCurrOffset]);
+ int nLCTSize = (int)
+ (pIDescr->GetPackedValue(ID_PACKED_LOCALCT) * 3 * (1
+ << (pIDescr->GetPackedValue(ID_PACKED_LOCALCTSIZE)
+ + 1)));
+
+ int nTmp = GetSubBlocksLen(m_nCurrOffset + sizeof(TGIFImageDescriptor) + nLCTSize + 1);
+ if(nTmp > 0)
+ return sizeof(TGIFImageDescriptor) + nLCTSize + 1 + nTmp;
+ break;
+ };
+
+ return 0;
+ }
+
+ BOOL CAnimation::SkipNextBlock()
+ {
+ if(!m_pRawData)
+ return FALSE;
+
+ int nLen = GetNextBlockLen();
+ if((nLen <= 0) || ((m_nCurrOffset + nLen) > m_nDataSize))
+ return FALSE;
+
+ m_nCurrOffset += nLen;
+ return TRUE;
+ }
+
+ BOOL CAnimation::SkipNextGraphicBlock()
+ {
+ if(!m_pRawData)
+ return FALSE;
+
+ // GIF header + LSDescriptor [+ GCT] [+ Control block] + Data
+
+ enum GIFBlockTypes nBlock;
+
+ nBlock = GetNextBlock();
+
+ while((nBlock != BLOCK_CONTROLEXT)
+ && (nBlock != BLOCK_IMAGE)
+ && (nBlock != BLOCK_PLAINTEXT)
+ && (nBlock != BLOCK_UNKNOWN)
+ && (nBlock != BLOCK_TRAILER))
+ {
+ if(!SkipNextBlock())
+ return NULL;
+ nBlock = GetNextBlock();
+ };
+
+ if((nBlock == BLOCK_UNKNOWN) || (nBlock == BLOCK_TRAILER))
+ return FALSE;
+
+ // it's either a control ext.block, an image or a plain text
+
+ if(GetNextBlockLen() <= 0)
+ return FALSE;
+
+ if(nBlock == BLOCK_CONTROLEXT)
+ {
+ if(!SkipNextBlock())
+ return FALSE;
+ nBlock = GetNextBlock();
+
+ // skip everything until we meet an image block or a plain-text block
+ while((nBlock != BLOCK_IMAGE)
+ && (nBlock != BLOCK_PLAINTEXT)
+ && (nBlock != BLOCK_UNKNOWN)
+ && (nBlock != BLOCK_TRAILER))
+ {
+ if(!SkipNextBlock())
+ return NULL;
+ nBlock = GetNextBlock();
+ };
+
+ if((nBlock == BLOCK_UNKNOWN) || (nBlock == BLOCK_TRAILER))
+ return FALSE;
+ };
+
+ // skip the found data block (image or plain-text)
+ if(!SkipNextBlock())
+ return FALSE;
+
+ return TRUE;
+ }
+
+ void CAnimation::ResetDataPointer()
+ {
+ // skip header and logical screen descriptor
+ m_nCurrOffset = sizeof(TGIFHeader) + sizeof(TGIFLSDescriptor) + m_nGlobalCTSize;
+ }
+
+ enum CAnimation::GIFBlockTypes CAnimation::GetNextBlock() const
+ {
+ switch(m_pRawData[m_nCurrOffset])
+ {
+ case 0x21:
+ // extension block
+ switch(m_pRawData[m_nCurrOffset + 1])
+ {
+ case 0x01:
+ // plain text extension
+ return BLOCK_PLAINTEXT;
+ break;
+
+ case 0xF9:
+ // graphic control extension
+ return BLOCK_CONTROLEXT;
+ break;
+
+ case 0xFE:
+ // comment extension
+ return BLOCK_COMMEXT;
+ break;
+
+ case 0xFF:
+ // application extension
+ return BLOCK_APPEXT;
+ break;
+ };
+ break;
+
+ case 0x3B:
+ // trailer
+ return BLOCK_TRAILER;
+ break;
+
+ case 0x2C:
+ // image data
+ return BLOCK_IMAGE;
+ break;
+ };
+
+ return BLOCK_UNKNOWN;
+ }
+
+ UINT CAnimation::GetSubBlocksLen(UINT nStartingOffset) const
+ {
+ UINT nRet = 0;
+ UINT nCurOffset = nStartingOffset;
+
+ while(m_pRawData[nCurOffset] != 0 )
+ {
+ nRet += m_pRawData[nCurOffset] + 1;
+ nCurOffset += m_pRawData[nCurOffset] + 1;
+ };
+
+ return nRet + 1;
+ }
+
+ LPBYTE CAnimation::GetNextGraphicBlock(UINT* pBlockLen, UINT* pDelay, SIZE* pBlockSize, SIZE* pBlockOffset, UINT* pDisposal)
+ {
+ if(!m_pRawData)
+ return NULL;
+
+ // GIF header + LSDescriptor [+ GCT] [+ Control block] + Data
+
+ *pDisposal = 0;
+ enum GIFBlockTypes nBlock;
+ nBlock = GetNextBlock();
+
+ while((nBlock != BLOCK_CONTROLEXT)
+ && (nBlock != BLOCK_IMAGE)
+ && (nBlock != BLOCK_PLAINTEXT)
+ && (nBlock != BLOCK_UNKNOWN)
+ && (nBlock != BLOCK_TRAILER))
+ {
+ if(!SkipNextBlock())
+ return NULL;
+ nBlock = GetNextBlock();
+ };
+
+ if((nBlock == BLOCK_UNKNOWN) || (nBlock == BLOCK_TRAILER))
+ return NULL;
+
+ // it's either a control ext.block, an image or a plain text
+
+ int nStart = m_nCurrOffset;
+ int nBlockLen = GetNextBlockLen();
+
+ if(nBlockLen <= 0)
+ return NULL;
+
+ if(nBlock == BLOCK_CONTROLEXT)
+ {
+ // get the following data
+ TGIFControlExt* pControl = reinterpret_cast(&m_pRawData[m_nCurrOffset]);
+ // store delay time
+ *pDelay = pControl->m_wDelayTime;
+ // store disposal method
+ *pDisposal = pControl->GetPackedValue(GCX_PACKED_DISPOSAL);
+
+ if(!SkipNextBlock())
+ return NULL;
+ nBlock = GetNextBlock();
+
+ // skip everything until we find data to display
+ // (image block or plain-text block)
+
+ while((nBlock != BLOCK_IMAGE)
+ && (nBlock != BLOCK_PLAINTEXT)
+ && (nBlock != BLOCK_UNKNOWN)
+ && (nBlock != BLOCK_TRAILER))
+ {
+ if(!SkipNextBlock())
+ return NULL;
+ nBlock = GetNextBlock();
+ nBlockLen += GetNextBlockLen();
+ };
+
+ if((nBlock == BLOCK_UNKNOWN) || (nBlock == BLOCK_TRAILER))
+ return NULL;
+ nBlockLen += GetNextBlockLen();
+ }
+ else
+ *pDelay = -1; // to indicate that there was no delay value
+
+ if(nBlock == BLOCK_IMAGE)
+ {
+ // store size and offsets
+ TGIFImageDescriptor* pImage = reinterpret_cast(&m_pRawData[m_nCurrOffset]);
+ pBlockSize->cx = pImage->m_wWidth;
+ pBlockSize->cy = pImage->m_wHeight;
+ pBlockOffset->cx = pImage->m_wLeftPos;
+ pBlockOffset->cy = pImage->m_wTopPos;
+ };
+
+ if(!SkipNextBlock())
+ return NULL;
+
+ LPBYTE pData = static_cast(malloc(sizeof(TGIFHeader) + sizeof(TGIFLSDescriptor) + m_nGlobalCTSize + nBlockLen + 1));
+ if (!pData)
+ return NULL;
+
+ int nOffset = 0;
+
+ CopyMemory(pData, m_pRawData, sizeof(TGIFHeader) + sizeof(TGIFLSDescriptor) + m_nGlobalCTSize);
+ nOffset += sizeof(TGIFHeader) + sizeof(TGIFLSDescriptor) + m_nGlobalCTSize;
+
+ CopyMemory(pData + nOffset, &m_pRawData[nStart], nBlockLen);
+ nOffset += nBlockLen;
+
+ pData[nOffset] = 0x3B; // trailer
+ nOffset++;
+
+ *pBlockLen = nOffset;
+
+ return pData;
+ }
+
+#ifdef GIF_TRACING
+ void CAnimation::WriteDataOnDisk(CString szFileName, HGLOBAL hData, DWORD dwSize)
+ {
+ CFile file;
+
+ if(!file.Open(szFileName, CFile::modeCreate | CFile::modeWrite | CFile::shareDenyNone))
+ {
+ OutputDebugString(_T("WriteData: Error creating file %s\n"), szFileName);
+ return;
+ };
+
+ char* pData = reinterpret_cast(GlobalLock(hData));
+ if(!pData)
+ {
+ OutputDebugString(_T("WriteData: Error locking memory\n"));
+ return;
+ };
+
+ TRY
+ {
+ file.Write(pData, dwSize);
+ }
+ CATCH(CFileException, e);
+ {
+ OutputDebugString(_T("WriteData: An exception occured while writing to the file %s\n"), szFileName);
+ e->Delete();
+ GlobalUnlock(hData);
+ file.Close();
+ return;
+ }
+ END_CATCH GlobalUnlock(hData);
+ file.Close();
+ }
+
+ void CAnimation::EnumGIFBlocks()
+ {
+ enum GIFBlockTypes nBlock;
+ ResetDataPointer();
+ while(m_nCurrOffset < m_nDataSize)
+ {
+ nBlock = GetNextBlock();
+ switch(nBlock)
+ {
+ case BLOCK_UNKNOWN:
+ OutputDebugString(_T("- Unknown block\n"));
+ return;
+ break;
+ case BLOCK_TRAILER:
+ OutputDebugString(_T("- Trailer block\n"));
+ break;
+ case BLOCK_APPEXT:
+ OutputDebugString(_T("- Application extension block\n"));
+ break;
+ case BLOCK_COMMEXT:
+ OutputDebugString(_T("- Comment extension block\n"));
+ break;
+ case BLOCK_CONTROLEXT:
+ {
+ TGIFControlExt* pControl = reinterpret_cast(&m_pRawData[m_nCurrOffset]);
+ OutputDebugString(_T("- Graphic control extension block (delay %d, disposal %d)\n"),
+ pControl->m_wDelayTime,
+ pControl->GetPackedValue(GCX_PACKED_DISPOSAL));
+ };
+ break;
+ case BLOCK_PLAINTEXT:
+ OutputDebugString(_T("- Plain text extension block\n"));
+ break;
+ case BLOCK_IMAGE:
+ TGIFImageDescriptor* pIDescr = reinterpret_cast(&m_pRawData[m_nCurrOffset]);
+ OutputDebugString(_T("- Image data block (%dx%d %d,%d)\n"),
+ pIDescr->m_wWidth,
+ pIDescr->m_wHeight,
+ pIDescr->m_wLeftPos,
+ pIDescr->m_wTopPos);
+ break;
+ };
+ SkipNextBlock();
+ };
+ OutputDebugString(_T("\n"));
+ }
+#endif // GIF_TRACING
+
+ DWORD CAnimation::ThreadAnimation()
+ {
+ while(!m_bExitThread)
+ {
+ if (m_pCallback) m_pCallback->OnFrame();
+ // wait until currframe is drawn. if currframe is not drawn over 1min
+ // this ani may be no use in the future. so exit this thread to stop
+ // the animation playing by herself.
+ if (::WaitForSingleObject(m_hDrawEvent, 60*1000) != WAIT_OBJECT_0)
+ {
+ m_bExitThread = true;
+ continue;
+ }
+
+ // if the delay time is too short (like in old GIFs), wait for 100ms
+ if((*m_pvFrames)[m_nCurrFrame].m_nDelay < 5)
+ Sleep(100);
+ else
+ Sleep(10 * (*m_pvFrames)[m_nCurrFrame].m_nDelay);
+
+ ::InterlockedIncrement(&m_nCurrFrame);
+ if(m_nCurrFrame == m_pvFrames->size())
+ ::InterlockedExchange(&m_nCurrFrame, (LONG)0);
+ }
+
+ return 0;
+ }
+
+ DWORD __stdcall CAnimation::_ThreadAnimation(LPVOID pParam)
+ {
+ assert(pParam);
+ CAnimation* pAni = static_cast(pParam);
+ if (!pAni)
+ return 1;
+
+ return pAni->ThreadAnimation();
+ }
+
+ //************************************************************************/
+ //* CEUIAniHelper */
+ //************************************************************************/
+
+
+ bool CEUIAniHelper::DrawAniImage(HDC hDC, CPaintManagerUI* pManager, const RECT& rc, const RECT& rcPaint, const CDuiString& sImageName, \
+ const CDuiString& sImageResType, RECT rcItem, RECT rcBmpPart, RECT rcCorner, DWORD dwMask, BYTE bFade, \
+ bool bHole, bool bTiledX, bool bTiledY)
+ {
+ const TImageInfo* data = NULL;
+ if ( !(data=GetAniImage((LPCTSTR)sImageName)) && !(data=pManager->GetImage((LPCTSTR)sImageName)) )
+ {
+ // new Image
+ // try GIF first
+ data = AddAniImage(pManager->GetPaintDC(), (LPCTSTR)sImageName, (LPCTSTR)sImageResType, dwMask);
+ if (!data)
+ {
+ // may be not GIF
+ if( sImageResType.IsEmpty() ) {
+ data = pManager->GetImageEx((LPCTSTR)sImageName, NULL, dwMask);
+ }
+ else {
+ data = pManager->GetImageEx((LPCTSTR)sImageName, (LPCTSTR)sImageResType, dwMask);
+ }
+ }
+ }
+
+ if (!data)
+ return false;
+
+ if( rcBmpPart.left == 0 && rcBmpPart.right == 0 && rcBmpPart.top == 0 && rcBmpPart.bottom == 0 ) {
+ rcBmpPart.right = data->nX;
+ rcBmpPart.bottom = data->nY;
+ }
+ if (rcBmpPart.right > data->nX) rcBmpPart.right = data->nX;
+ if (rcBmpPart.bottom > data->nY) rcBmpPart.bottom = data->nY;
+
+ RECT rcTemp;
+ if( !::IntersectRect(&rcTemp, &rcItem, &rc) ) return true;
+ if( !::IntersectRect(&rcTemp, &rcItem, &rcPaint) ) return true;
+
+ CRenderEngine::DrawImage(hDC, data->hBitmap, rcItem, rcPaint, rcBmpPart, rcCorner, data->alphaChannel, bFade, bHole, bTiledX, bTiledY);
+
+ return true;
+ }
+
+ bool CEUIAniHelper::DrawImageEx(HDC hDC, CPaintManagerUI* pManager, const RECT& rc, const RECT& rcPaint,
+ LPCTSTR pStrImage, LPCTSTR pStrModify)
+ {
+ if ((pManager == NULL) || (hDC == NULL)) return false;
+
+ // 1aaa.jpg
+ // 2file='aaa.jpg' res='' restype='0' dest='0,0,0,0' source='0,0,0,0' corner='0,0,0,0'
+ // mask='#FF0000' fade='255' hole='false' xtiled='false' ytiled='false'
+
+ CDuiString sImageName = pStrImage;
+ CDuiString sImageResType;
+ RECT rcItem = rc;
+ RECT rcBmpPart = {0};
+ RECT rcCorner = {0};
+ DWORD dwMask = 0;
+ BYTE bFade = 0xFF;
+ bool bHole = false;
+ bool bTiledX = false;
+ bool bTiledY = false;
+
+ int image_count = 0;
+
+ CDuiString sItem;
+ CDuiString sValue;
+ LPTSTR pstr = NULL;
+
+ for( int i = 0; i < 2; ++i,image_count = 0 ) {
+ if( i == 1)
+ pStrImage = pStrModify;
+
+ if( !pStrImage ) continue;
+
+ while( *pStrImage != _T('\0') ) {
+ sItem.Empty();
+ sValue.Empty();
+ while( *pStrImage > _T('\0') && *pStrImage <= _T(' ') ) pStrImage = ::CharNext(pStrImage);
+ while( *pStrImage != _T('\0') && *pStrImage != _T('=') && *pStrImage > _T(' ') ) {
+ LPTSTR pstrTemp = ::CharNext(pStrImage);
+ while( pStrImage < pstrTemp) {
+ sItem += *pStrImage++;
+ }
+ }
+ while( *pStrImage > _T('\0') && *pStrImage <= _T(' ') ) pStrImage = ::CharNext(pStrImage);
+ if( *pStrImage++ != _T('=') ) break;
+ while( *pStrImage > _T('\0') && *pStrImage <= _T(' ') ) pStrImage = ::CharNext(pStrImage);
+ if( *pStrImage++ != _T('\'') ) break;
+ while( *pStrImage != _T('\0') && *pStrImage != _T('\'') ) {
+ LPTSTR pstrTemp = ::CharNext(pStrImage);
+ while( pStrImage < pstrTemp) {
+ sValue += *pStrImage++;
+ }
+ }
+ if( *pStrImage++ != _T('\'') ) break;
+ if( !sValue.IsEmpty() ) {
+ if( sItem == _T("file") || sItem == _T("res") ) {
+ if( image_count > 0 )
+ DrawAniImage(hDC, pManager, rc, rcPaint, sImageName, sImageResType,
+ rcItem, rcBmpPart, rcCorner, dwMask, bFade, bHole, bTiledX, bTiledY);
+
+ sImageName = sValue;
+ if( sItem == _T("file") )
+ ++image_count;
+ }
+ else if( sItem == _T("restype") ) {
+ if( image_count > 0 )
+ DrawAniImage(hDC, pManager, rc, rcPaint, sImageName, sImageResType,
+ rcItem, rcBmpPart, rcCorner, dwMask, bFade, bHole, bTiledX, bTiledY);
+
+ sImageResType = sValue;
+ ++image_count;
+ }
+ else if( sItem == _T("dest") ) {
+ rcItem.left = rc.left + _tcstol(sValue.GetData(), &pstr, 10); ASSERT(pstr);
+ rcItem.top = rc.top + _tcstol(pstr + 1, &pstr, 10); ASSERT(pstr);
+ rcItem.right = rc.left + _tcstol(pstr + 1, &pstr, 10); ASSERT(pstr);
+ if (rcItem.right > rc.right) rcItem.right = rc.right;
+ rcItem.bottom = rc.top + _tcstol(pstr + 1, &pstr, 10); ASSERT(pstr);
+ if (rcItem.bottom > rc.bottom) rcItem.bottom = rc.bottom;
+ }
+ else if( sItem == _T("source") ) {
+ rcBmpPart.left = _tcstol(sValue.GetData(), &pstr, 10); ASSERT(pstr);
+ rcBmpPart.top = _tcstol(pstr + 1, &pstr, 10); ASSERT(pstr);
+ rcBmpPart.right = _tcstol(pstr + 1, &pstr, 10); ASSERT(pstr);
+ rcBmpPart.bottom = _tcstol(pstr + 1, &pstr, 10); ASSERT(pstr);
+ }
+ else if( sItem == _T("corner") ) {
+ rcCorner.left = _tcstol(sValue.GetData(), &pstr, 10); ASSERT(pstr);
+ rcCorner.top = _tcstol(pstr + 1, &pstr, 10); ASSERT(pstr);
+ rcCorner.right = _tcstol(pstr + 1, &pstr, 10); ASSERT(pstr);
+ rcCorner.bottom = _tcstol(pstr + 1, &pstr, 10); ASSERT(pstr);
+ }
+ else if( sItem == _T("mask") ) {
+ if( sValue[0] == _T('#')) dwMask = _tcstoul(sValue.GetData() + 1, &pstr, 16);
+ else dwMask = _tcstoul(sValue.GetData(), &pstr, 16);
+ }
+ else if( sItem == _T("fade") ) {
+ bFade = (BYTE)_tcstoul(sValue.GetData(), &pstr, 10);
+ }
+ else if( sItem == _T("hole") ) {
+ bHole = (_tcscmp(sValue.GetData(), _T("true")) == 0);
+ }
+ else if( sItem == _T("xtiled") ) {
+ bTiledX = (_tcscmp(sValue.GetData(), _T("true")) == 0);
+ }
+ else if( sItem == _T("ytiled") ) {
+ bTiledY = (_tcscmp(sValue.GetData(), _T("true")) == 0);
+ }
+ }
+ if( *pStrImage++ != _T(' ') ) break;
+ }
+ }
+
+ DrawAniImage(hDC, pManager, rc, rcPaint, sImageName, sImageResType,
+ rcItem, rcBmpPart, rcCorner, dwMask, bFade, bHole, bTiledX, bTiledY);
+
+ return true;
+ }
+
+ const TImageInfo* CEUIAniHelper::GetAniImage(LPCTSTR bitmap)
+ {
+ CAnimation* data = static_cast(m_mAniHash.Find(bitmap));
+ if (data)
+ return data->GetCurImage();
+ else
+ return NULL;
+ }
+
+ const TImageInfo* CEUIAniHelper::AddAniImage(HDC hDC, LPCTSTR bitmap, LPCTSTR type/* = NULL*/, DWORD mask/* = 0*/)
+ {
+ CAnimation* pAniImage = new CAnimation(this);
+ if (!pAniImage->LoadGIF(bitmap, type, mask))
+ {
+ delete pAniImage;
+ return NULL;
+ }
+ if ( !m_mAniHash.Insert(bitmap, pAniImage) )
+ {
+ delete pAniImage;
+ return NULL;
+ }
+
+ pAniImage->Play();
+ return pAniImage->GetCurImage();
+ }
+}
diff --git a/Demos/bdwallpaper/controlex/AnimationHelper.h b/Demos/bdwallpaper/controlex/AnimationHelper.h
new file mode 100644
index 00000000..a1bd8aa8
--- /dev/null
+++ b/Demos/bdwallpaper/controlex/AnimationHelper.h
@@ -0,0 +1,229 @@
+#ifndef _EUI_ANIMATION_HELPER__H__
+#define _EUI_ANIMATION_HELPER__H__
+
+#include
+
+namespace DuiLib
+{
+ class IAnimationCallback
+ {
+ public:
+ virtual void OnFrame() = 0;
+ };
+
+ class CAnimation
+ {
+#pragma pack(1) // turn byte alignment on
+ enum GIFBlockTypes
+ {
+ BLOCK_UNKNOWN,
+ BLOCK_APPEXT,
+ BLOCK_COMMEXT,
+ BLOCK_CONTROLEXT,
+ BLOCK_PLAINTEXT,
+ BLOCK_IMAGE,
+ BLOCK_TRAILER
+ };
+
+ enum ControlExtValues // graphic control extension packed field values
+ {
+ GCX_PACKED_DISPOSAL, // disposal method
+ GCX_PACKED_USERINPUT,
+ GCX_PACKED_TRANSPCOLOR
+ };
+
+ enum LSDPackedValues // logical screen descriptor packed field values
+ {
+ LSD_PACKED_GLOBALCT,
+ LSD_PACKED_CRESOLUTION,
+ LSD_PACKED_SORT,
+ LSD_PACKED_GLOBALCTSIZE
+ };
+
+ enum IDPackedValues // image descriptor packed field values
+ {
+ ID_PACKED_LOCALCT,
+ ID_PACKED_INTERLACE,
+ ID_PACKED_SORT,
+ ID_PACKED_LOCALCTSIZE
+ };
+
+ struct TGIFHeader // GIF header
+ {
+ char m_cSignature[3]; // Signature - Identifies the GIF Data Stream
+ // This field contains the fixed value 'GIF'
+ char m_cVersion[3]; // Version number. May be one of the following:
+ // "87a" or "89a"
+ };
+
+ struct TGIFLSDescriptor // Logical Screen Descriptor
+ {
+ WORD m_wWidth; // 2 bytes. Logical screen width
+ WORD m_wHeight; // 2 bytes. Logical screen height
+ unsigned char m_cPacked; // packed field
+ unsigned char m_cBkIndex; // 1 byte. Background color index
+ unsigned char m_cPixelAspect; // 1 byte. Pixel aspect ratio
+ inline int GetPackedValue(enum LSDPackedValues Value);
+ };
+
+ struct TGIFAppExtension // application extension block
+ {
+ unsigned char m_cExtIntroducer; // extension introducer (0x21)
+ unsigned char m_cExtLabel; // app. extension label (0xFF)
+ unsigned char m_cBlockSize; // fixed value of 11
+ char m_cAppIdentifier[8]; // application identifier
+ char m_cAppAuth[3]; // application authentication code
+ };
+
+ struct TGIFControlExt // graphic control extension block
+ {
+ unsigned char m_cExtIntroducer; // extension introducer (0x21)
+ unsigned char m_cControlLabel; // control extension label (0xF9)
+ unsigned char m_cBlockSize; // fixed value of 4
+ unsigned char m_cPacked; // packed field
+ WORD m_wDelayTime; // delay time
+ unsigned char m_cTColorIndex; // transparent color index
+ unsigned char m_cBlockTerm; // block terminator (0x00)
+ inline int GetPackedValue(enum ControlExtValues Value);
+ };
+
+ struct TGIFCommentExt // comment extension block
+ {
+ unsigned char m_cExtIntroducer; // extension introducer (0x21)
+ unsigned char m_cCommentLabel; // comment extension label (0xFE)
+ };
+
+ struct TGIFPlainTextExt // plain text extension block
+ {
+ unsigned char m_cExtIntroducer; // extension introducer (0x21)
+ unsigned char m_cPlainTextLabel; // text extension label (0x01)
+ unsigned char m_cBlockSize; // fixed value of 12
+ WORD m_wLeftPos; // text grid left position
+ WORD m_wTopPos; // text grid top position
+ WORD m_wGridWidth; // text grid width
+ WORD m_wGridHeight; // text grid height
+ unsigned char m_cCellWidth; // character cell width
+ unsigned char m_cCellHeight; // character cell height
+ unsigned char m_cFgColor; // text foreground color index
+ unsigned char m_cBkColor; // text background color index
+ };
+
+ struct TGIFImageDescriptor // image descriptor block
+ {
+ unsigned char m_cImageSeparator; // image separator byte (0x2C)
+ WORD m_wLeftPos; // image left position
+ WORD m_wTopPos; // image top position
+ WORD m_wWidth; // image width
+ WORD m_wHeight; // image height
+ unsigned char m_cPacked; // packed field
+ inline int GetPackedValue(enum IDPackedValues Value);
+ };
+#pragma pack() // turn byte alignment off
+ struct TFrame // structure that keeps a single frame info
+ {
+ TImageInfo* m_pImage; // pointer to one frame image
+ SIZE m_frameSize;
+ SIZE m_frameOffset;
+ UINT m_nDelay; // delay (in 1/100s of a second)
+ UINT m_nDisposal; // disposal method
+ };
+ typedef std::vector VTFRAME;
+
+ public:
+ CAnimation(IAnimationCallback* pCallback);
+ ~CAnimation();
+
+ const TImageInfo* GetCurImage();
+ // loads a picture from a file or a program resource
+ const TImageInfo* LoadGIF(LPCTSTR bitmap, LPCTSTR type = NULL, DWORD mask = 0);
+ // loads a picture from a memory block (allocated by malloc)
+ // Warning: this function DOES NOT free the memory, pointed to by pData
+ const TImageInfo* LoadGIF(const LPBYTE pData, DWORD dwSize, DWORD mask = 0);
+ SIZE GetSize() const;
+ int GetFrameCount() const;
+ COLORREF GetBkColor() const;
+
+ bool Play(); // play the animation (just change m_nCurrFrame)
+ void Stop(); // stops animation
+ void UnLoad(); // stops animation plus releases all resources
+ bool IsPlaying() const;
+
+ protected:
+ int GetNextBlockLen() const;
+ BOOL SkipNextBlock();
+ BOOL SkipNextGraphicBlock();
+ void ResetDataPointer();
+ enum GIFBlockTypes GetNextBlock() const;
+ UINT GetSubBlocksLen(UINT nStartingOffset) const;
+ // create a single-frame GIF from one of frames, and put in a memeory block (allocated by malloc)
+ // Warning: we should free the memeory block, pointed to by return value
+ LPBYTE GetNextGraphicBlock(UINT* pBlockLen, UINT* pDelay, SIZE* pBlockSize, SIZE* pBlockOffset, UINT* pDisposal);
+#ifdef GIF_TRACING
+ void EnumGIFBlocks();
+ void WriteDataOnDisk(CString szFileName, HGLOBAL hData, DWORD dwSize);
+#endif // GIF_TRACING
+
+ private:
+ unsigned char* m_pRawData; // ʱݴ涯ļ Ч
+ UINT m_nDataSize; // GIFļС
+ TGIFHeader* m_pGIFHeader; // GIFļͷ
+ TGIFLSDescriptor* m_pGIFLSDescriptor; // Ļʶ
+ UINT m_nGlobalCTSize; // ȫɫбС
+ SIZE m_PictureSize; // ͼߴ
+ COLORREF m_clrBackground; // ɫ
+ volatile long m_nCurrFrame; // ǰֵ֡
+ UINT m_nCurrOffset; // ȡƫ
+ VTFRAME* m_pvFrames; // ֡
+
+ HANDLE m_hThread;
+ HANDLE m_hDrawEvent; // ͼ¼ ǰ֡Ѿȡڻ ֹȾٶ֡
+ volatile bool m_bExitThread;
+ IAnimationCallback* m_pCallback;
+
+ DWORD ThreadAnimation();
+ static DWORD __stdcall _ThreadAnimation(LPVOID pParam);
+ };
+
+ class CEUIAniHelper : public IAnimationCallback
+ {
+ public:
+ ~CEUIAniHelper()
+ {
+ CAnimation* data = NULL;
+ while (m_mAniHash.GetSize() > 0)
+ {
+ if(LPCTSTR key = m_mAniHash.GetAt(0)) {
+ data = static_cast(m_mAniHash.Find(key));
+ if (data)
+ {
+ delete data;
+ data = NULL;
+ }
+ m_mAniHash.Remove(key);
+ }
+ }
+ }
+ /**
+ * ͼǿ ԭCControlUI::DrawImage CRenderEngine::DrawImageString
+ * Note: PaintXXImage
+ */
+ bool DrawImageEx(HDC hDC, CPaintManagerUI* pManager, const RECT& rc, const RECT& rcPaint,
+ LPCTSTR pStrImage, LPCTSTR pStrModify = NULL);
+ /**
+ * ͼǿ ԭDuiLib::DrawImage
+ * Note: жļ͡ʼȡGIFݵ
+ */
+ bool DrawAniImage(HDC hDC, CPaintManagerUI* pManager, const RECT& rc, const RECT& rcPaint, const CDuiString& sImageName, \
+ const CDuiString& sImageResType, RECT rcItem, RECT rcBmpPart, RECT rcCorner, DWORD dwMask, BYTE bFade, \
+ bool bHole, bool bTiledX, bool bTiledY);
+
+ protected:
+ const TImageInfo* GetAniImage(LPCTSTR bitmap);
+ const TImageInfo* AddAniImage(HDC hDC, LPCTSTR bitmap, LPCTSTR type = NULL, DWORD mask = 0);
+
+ protected:
+ CStdStringPtrMap m_mAniHash;
+ };
+}
+
+#endif
diff --git a/Demos/bdwallpaper/controlex/ControlInclude.h b/Demos/bdwallpaper/controlex/ControlInclude.h
new file mode 100644
index 00000000..0c84b69d
--- /dev/null
+++ b/Demos/bdwallpaper/controlex/ControlInclude.h
@@ -0,0 +1,32 @@
+#ifndef __CONTROL_INCLUDE_H__
+#define __CONTROL_INCLUDE_H__
+
+#include
+#include
+#include "UILableEx.h"
+#include "UIButtonEx.h"
+#include "UIWPPanel.h"
+
+static CControlUI* CreateControl(LPCTSTR pstrClass)
+{
+ if( _tcsicmp(pstrClass, _T("LabelEx")) == 0 ) return new CLabelEx;
+ else if( _tcsicmp(pstrClass, _T("LabelMutiline")) == 0 ) return new CLabelMutiline;
+ else if( _tcsicmp(pstrClass, _T("WPButton")) == 0 ) return new CWPButton;
+ else if( _tcsicmp(pstrClass, _T("WPPanel")) == 0 ) return new CWPPanel;
+ return NULL;
+}
+
+class CDialogBuilderCallbackEx : public IDialogBuilderCallback
+{
+public:
+ CControlUI* CreateControl(LPCTSTR pstrClass)
+ {
+ if( _tcsicmp(pstrClass, _T("LabelEx")) == 0 ) return new CLabelEx;
+ else if( _tcsicmp(pstrClass, _T("LabelMutiline")) == 0 ) return new CLabelMutiline;
+ else if( _tcsicmp(pstrClass, _T("WPButton")) == 0 ) return new CWPButton;
+ else if( _tcsicmp(pstrClass, _T("WPPanel")) == 0 ) return new CWPPanel;
+ return NULL;
+ }
+};
+
+#endif __CONTROL_INCLUDE_H__
diff --git a/Demos/bdwallpaper/controlex/UIButtonEx.h b/Demos/bdwallpaper/controlex/UIButtonEx.h
new file mode 100644
index 00000000..c5bb1823
--- /dev/null
+++ b/Demos/bdwallpaper/controlex/UIButtonEx.h
@@ -0,0 +1,283 @@
+#ifndef __BUTTONEX_H__
+#define __BUTTONEX_H__
+#include
+namespace DuiLib
+{
+ #define DUI_MSGTYPE_CLICK_WPFAV (_T("click_wpfav"))
+ #define DUI_MSGTYPE_CLICK_WPSET (_T("click_wpset"))
+
+ class CWPButton : public CButtonUI
+ {
+ public:
+ CWPButton()
+ {
+ }
+ ~CWPButton(void)
+ {
+ }
+
+ public:
+ virtual void PaintStatusImage(HDC hDC)
+ {
+ // ؼλ
+ RECT rcItem = m_rcItem;
+ // ƱֽͼƬ
+ CRenderEngine::DrawImageString(hDC, m_pManager, rcItem, m_rcPaint, PrepareImage(), NULL);
+ // ״̬
+ CButtonUI::PaintStatusImage(hDC);
+ if(m_uButtonState & UISTATE_HOT)
+ {
+ // λ
+ RECT rcToolBar = rcItem;
+ RECT rcFav = rcItem;
+ RECT rcSet = rcItem;
+ rcToolBar.top = rcToolBar.bottom - 25;
+ rcFav.top = rcFav.bottom - 25;
+ rcFav.right = rcFav.left + 94;
+ rcSet.top = rcSet.bottom - 25;
+ rcSet.left = rcSet.right - 94;
+ //
+ CRenderEngine::DrawImageString(hDC, m_pManager, rcToolBar, m_rcPaint, m_sWPToolbarImage, NULL);
+ CRenderEngine::DrawImageString(hDC, m_pManager, rcFav, m_rcPaint, m_sWPFavImage, NULL);
+ CRenderEngine::DrawImageString(hDC, m_pManager, rcSet, m_rcPaint, m_sWPSetImage, NULL);
+ }
+ }
+
+ void DoEvent(TEventUI& event)
+ {
+ if( event.Type == UIEVENT_BUTTONUP )
+ {
+ if( (m_uButtonState & UISTATE_CAPTURED) != 0 ) {
+ // λ
+ RECT rcFav = m_rcItem;
+ RECT rcSet = m_rcItem;
+ rcFav.top = rcFav.bottom - 25;
+ rcFav.right = rcFav.left + 94;
+ rcSet.top = rcSet.bottom - 25;
+ rcSet.left = rcSet.right - 94;
+ if( ::PtInRect(&rcFav, event.ptMouse) ) {
+ if( m_pManager != NULL ) m_pManager->SendNotify(this, DUI_MSGTYPE_CLICK_WPFAV);
+ }
+ else if( ::PtInRect(&rcSet, event.ptMouse) ) {
+ if( m_pManager != NULL ) m_pManager->SendNotify(this, DUI_MSGTYPE_CLICK_WPSET);
+ }
+ else if( ::PtInRect(&m_rcItem, event.ptMouse) ) Activate();
+ m_uButtonState &= ~(UISTATE_PUSHED | UISTATE_CAPTURED);
+ Invalidate();
+ }
+ return;
+ }
+
+ return CButtonUI::DoEvent(event);
+ }
+
+ CString PrepareImage()
+ {
+ CString sAppPath = CPaintManagerUI::GetInstancePath().GetData();
+ CString sImageName = CrackUrl(m_sWPImage.GetData());
+ sImageName.Replace(_T("/"), _T("\\"));
+ TCHAR szFile[MAX_PATH] = {0};
+ lstrcpy(szFile, sAppPath);
+ ::PathAppend(szFile, sImageName);
+ if(!::PathFileExists(szFile))
+ {
+ CreateDirectory(szFile, NULL);
+ ::URLDownloadToFile(NULL, m_sWPImage, szFile, 0, NULL);
+ }
+ return szFile;
+
+ }
+
+ CString PrepareWPImage()
+ {
+ int cx = GetSystemMetrics(SM_CXSCREEN);
+ int cy = GetSystemMetrics(SM_CYSCREEN);
+ CString sAppPath = CPaintManagerUI::GetInstancePath().GetData();
+ CString sUrl;
+ sUrl.Format(_T("http://bizhi.baidu.com/wallpaper/getWallpaperById?t=%d&name=baiduwp&v=2.0.0.1160&g=C_0-D_100825PBN40317ERB89E-M_206A8A1263C4-V_DE5571AC-T_20140714225619485&x=%d&y=%d&tn=bdwp&dtn=bdwp&uinf=8704-0-8&id=%s&resolution=%d_%d"), GetTickCount(), cx, cy, GetUserData().GetData(), cx, cy);
+ CString sRealUrl = RealWebFile(sUrl);
+ CString sImageName = CrackUrl(sRealUrl);
+ sImageName.Replace(_T("/"), _T("\\"));
+ TCHAR szFile[MAX_PATH] = {0};
+ lstrcpy(szFile, sAppPath);
+ ::PathAppend(szFile, sImageName);
+ if(!::PathFileExists(szFile))
+ {
+ CreateDirectory(szFile, NULL);
+ ::URLDownloadToFile(NULL, sRealUrl, szFile, 0, NULL);
+ }
+ return szFile;
+
+ }
+
+ BOOL CreateDirectory(LPCTSTR lpPathName, LPSECURITY_ATTRIBUTES lpSecurityAttributes)
+ {
+ TCHAR cPath[MAX_PATH] = {0};
+ TCHAR cTmpPath[MAX_PATH] = {0};
+ TCHAR * lpPos = NULL;
+ TCHAR cTmp = _T('\0');
+
+ if (NULL == lpPathName || NULL == *lpPathName)
+ return FALSE;
+
+ _tcsncpy(cPath, lpPathName, MAX_PATH);
+
+ for (int i = 0; i < (int)_tcslen(cPath); i++)
+ {
+ if (_T('\\') == cPath[i])
+ cPath[i] = _T('/');
+ }
+
+ lpPos = _tcschr(cPath, _T('/'));
+ while (lpPos != NULL)
+ {
+ if (lpPos == cPath)
+ {
+ lpPos++;
+ }
+ else
+ {
+ cTmp = *lpPos;
+ *lpPos = _T('\0');
+ _tcsncpy(cTmpPath, cPath, MAX_PATH);
+ ::CreateDirectory(cTmpPath, lpSecurityAttributes);
+ *lpPos = cTmp;
+ lpPos++;
+ }
+ lpPos = _tcschr(lpPos, _T('/'));
+ }
+
+ return TRUE;
+ }
+
+ CString QueryInfo(HINTERNET hRequest, DWORD dwInfoLevel)
+ {
+ CString sInfo;
+ DWORD dwLen = 0;
+ if (!HttpQueryInfo (hRequest, dwInfoLevel, NULL, &dwLen, 0) && dwLen)
+ {
+ void * buf = malloc(dwLen + 2);
+ ZeroMemory (buf, dwLen + 2);
+ ::HttpQueryInfo (hRequest, dwInfoLevel, buf, &dwLen, 0);
+ sInfo = (LPCTSTR)buf;
+ free(buf);
+ }
+ return sInfo;
+ }
+
+ CString RealWebFile(CString sUrl)
+ {
+ CString sRealUrl = sUrl;
+ // http
+ HINTERNET hConnect = InternetOpen(NULL, INTERNET_OPEN_TYPE_PRECONFIG, NULL, NULL, 0);
+
+ if (hConnect)
+ {
+ DWORD dwTimeOut = 0;
+ InternetSetOption(hConnect, INTERNET_OPTION_CONNECT_TIMEOUT, &dwTimeOut, sizeof(dwTimeOut));
+
+ HINTERNET hSession = InternetOpenUrl(hConnect, sUrl, NULL, 0, INTERNET_FLAG_NO_AUTO_REDIRECT | INTERNET_FLAG_RELOAD, 0);
+ if (hSession)
+ {
+ DWORD dwStatus = 0;
+ DWORD dwBuffLen = sizeof(dwStatus);
+ BOOL bSuccess = HttpQueryInfo(hSession, HTTP_QUERY_STATUS_CODE|HTTP_QUERY_FLAG_NUMBER, &dwStatus, &dwBuffLen, 0);
+ if(bSuccess) {
+ sRealUrl = QueryInfo(hSession, HTTP_QUERY_LOCATION);
+ }
+
+ InternetCloseHandle(hSession);
+ }
+ InternetCloseHandle(hConnect);
+ }
+
+ return sRealUrl;
+ }
+
+ CString CrackUrl(CString sUrl)
+ {
+ URL_COMPONENTS uc;
+ TCHAR Scheme[1000];
+ TCHAR HostName[1000];
+ TCHAR UserName[1000];
+ TCHAR Password[1000];
+ TCHAR UrlPath[1000];
+ TCHAR ExtraInfo[1000];
+
+ uc.dwStructSize = sizeof(uc);
+ uc.lpszScheme = Scheme;
+ uc.lpszHostName = HostName;
+ uc.lpszUserName = UserName;
+ uc.lpszPassword = Password;
+ uc.lpszUrlPath = UrlPath;
+ uc.lpszExtraInfo = ExtraInfo;
+
+ uc.dwSchemeLength = 1000;
+ uc.dwHostNameLength = 1000;
+ uc.dwUserNameLength = 1000;
+ uc.dwPasswordLength = 1000;
+ uc.dwUrlPathLength = 1000;
+ uc.dwExtraInfoLength = 1000;
+
+ InternetCrackUrl(sUrl, 0, 0, &uc);
+ return UrlPath;
+ }
+
+ public:
+ void SetWP()
+ {
+ CString sWPImage = PrepareWPImage();
+ HRESULT hr = S_OK;
+ IActiveDesktop *pIAD = NULL;
+ hr = CoCreateInstance(CLSID_ActiveDesktop, NULL, CLSCTX_INPROC_SERVER, IID_IActiveDesktop, (void**)&pIAD);
+ if( !SUCCEEDED(hr) ) return;
+
+ hr = pIAD->SetWallpaper(sWPImage, 0);
+ if( !SUCCEEDED(hr) ) return;
+
+ WALLPAPEROPT wp = {0};
+ wp.dwSize = sizeof(WALLPAPEROPT);
+ wp.dwStyle |= 2;
+ hr = pIAD->SetWallpaperOptions(&wp, 0);
+ if( !SUCCEEDED(hr) ) return;
+
+ hr = pIAD->ApplyChanges(AD_APPLY_ALL);
+ if( !SUCCEEDED(hr) ) return;
+
+ pIAD->Release();
+ }
+
+ void SetWPImage(LPCTSTR pstrImage)
+ {
+ m_sWPImage = pstrImage;
+ Invalidate();
+ }
+ void SetWPToolbarImage(LPCTSTR pstrImage)
+ {
+ m_sWPToolbarImage = pstrImage;
+ }
+ void SetWPFavImage(LPCTSTR pstrImage)
+ {
+ m_sWPFavImage = pstrImage;
+ }
+ void SetWPSetImage(LPCTSTR pstrImage)
+ {
+ m_sWPSetImage = pstrImage;
+ }
+ void SetAttribute(LPCTSTR pstrName, LPCTSTR pstrValue)
+ {
+ if( _tcsicmp(pstrName, _T("wpimage")) == 0 ) SetWPImage(pstrValue);
+ else if( _tcsicmp(pstrName, _T("wptoolbarimage")) == 0 ) SetWPToolbarImage(pstrValue);
+ else if( _tcsicmp(pstrName, _T("wpfavimage")) == 0 ) SetWPFavImage(pstrValue);
+ else if( _tcsicmp(pstrName, _T("wpsetimage")) == 0 ) SetWPSetImage(pstrValue);
+ else CButtonUI::SetAttribute(pstrName, pstrValue);
+ }
+ private:
+ CDuiString m_sWPImage;
+ CDuiString m_sWPToolbarImage;
+ CDuiString m_sWPFavImage;
+ CDuiString m_sWPSetImage;
+ };
+}
+
+#endif __BUTTONEX_H__
diff --git a/Demos/bdwallpaper/controlex/UILableEx.h b/Demos/bdwallpaper/controlex/UILableEx.h
new file mode 100644
index 00000000..1f2ab3d0
--- /dev/null
+++ b/Demos/bdwallpaper/controlex/UILableEx.h
@@ -0,0 +1,130 @@
+#ifndef __LABELEX_H__
+#define __LABELEX_H__
+#include "AnimationHelper.h"
+
+namespace DuiLib
+{
+ class CLabelEx : public CLabelUI, public CEUIAniHelper
+ {
+ public:
+ void CLabelEx::PaintBkImage(HDC hDC)
+ {
+ if( m_sBkImage.IsEmpty() )
+ return;
+ if( !DrawImageEx(hDC, m_pManager, m_rcItem, m_rcPaint, (LPCTSTR)m_sBkImage) )
+ m_sBkImage.Empty();
+ }
+
+ void CLabelEx::OnFrame()
+ {
+ Invalidate();
+ }
+
+ void PaintText(HDC hDC)
+ {
+ if( m_dwTextColor == 0 ) m_dwTextColor = m_pManager->GetDefaultFontColor();
+ if( m_dwDisabledTextColor == 0 ) m_dwDisabledTextColor = m_pManager->GetDefaultDisabledColor();
+
+ if( m_sText.IsEmpty() ) return;
+ int nLinks = 0;
+ RECT rc = m_rcItem;
+ rc.left += m_rcTextPadding.left;
+ rc.right -= m_rcTextPadding.right;
+ rc.top += m_rcTextPadding.top;
+ rc.bottom -= m_rcTextPadding.bottom;
+ if( IsEnabled() ) {
+ if( m_bShowHtml )
+ CRenderEngine::DrawHtmlText(hDC, m_pManager, rc, m_sText, m_dwTextColor, \
+ NULL, NULL, nLinks, m_uTextStyle);
+ else
+ CRenderEngine::DrawText(hDC, m_pManager, rc, m_sText, m_dwTextColor, \
+ m_iFont, m_uTextStyle);
+ }
+ else {
+ if( m_bShowHtml )
+ CRenderEngine::DrawHtmlText(hDC, m_pManager, rc, m_sText, m_dwDisabledTextColor, \
+ NULL, NULL, nLinks, m_uTextStyle);
+ else
+ CRenderEngine::DrawText(hDC, m_pManager, rc, m_sText, m_dwDisabledTextColor, \
+ m_iFont, m_uTextStyle);
+ }
+ }
+ };
+
+ class CLabelIcon : public CLabelUI
+ {
+ public:
+ CLabelIcon()
+ {
+ m_hIcon = NULL;
+ }
+ ~CLabelIcon(void)
+ {
+ if(m_hIcon != NULL)
+ ::DestroyIcon(m_hIcon);
+ }
+
+ public:
+ virtual void PaintStatusImage(HDC hDC)
+ {
+ CLabelUI::PaintStatusImage(hDC);
+ if(m_hIcon != NULL)
+ {
+ ICONINFO ii;
+ if(::GetIconInfo(m_hIcon, &ii))
+ {
+ BITMAP bmp;
+ if(::GetObject(ii.hbmColor, sizeof(bmp), &bmp))
+ ::DrawIcon(hDC, m_rcItem.left+(m_rcItem.right-m_rcItem.left-bmp.bmWidth)/2, m_rcItem.top+4, m_hIcon);
+ ::DeleteObject(ii.hbmColor);
+ ::DeleteObject(ii.hbmMask);
+ }
+ }
+ }
+
+ public:
+ void SetIcon(HICON hIcon)
+ {
+ m_hIcon = hIcon;
+ }
+
+ private:
+ HICON m_hIcon;
+ };
+
+ class CLabelMutiline: public CLabelUI
+ {
+ public:
+ void PaintText(HDC hDC)
+ {
+ if( m_dwTextColor == 0 ) m_dwTextColor = m_pManager->GetDefaultFontColor();
+ if( m_dwDisabledTextColor == 0 ) m_dwDisabledTextColor = m_pManager->GetDefaultDisabledColor();
+
+ if( m_sText.IsEmpty() ) return;
+ int nLinks = 0;
+ RECT rc = m_rcItem;
+ rc.left += m_rcTextPadding.left;
+ rc.right -= m_rcTextPadding.right;
+ rc.top += m_rcTextPadding.top;
+ rc.bottom -= m_rcTextPadding.bottom;
+ if( IsEnabled() ) {
+ if( m_bShowHtml )
+ CRenderEngine::DrawHtmlText(hDC, m_pManager, rc, m_sText, m_dwTextColor, \
+ NULL, NULL, nLinks, m_uTextStyle);
+ else
+ CRenderEngine::DrawText(hDC, m_pManager, rc, m_sText, m_dwTextColor, \
+ m_iFont, m_uTextStyle);
+ }
+ else {
+ if( m_bShowHtml )
+ CRenderEngine::DrawHtmlText(hDC, m_pManager, rc, m_sText, m_dwDisabledTextColor, \
+ NULL, NULL, nLinks, m_uTextStyle);
+ else
+ CRenderEngine::DrawText(hDC, m_pManager, rc, m_sText, m_dwDisabledTextColor, \
+ m_iFont, m_uTextStyle);
+ }
+ }
+ };
+}
+
+#endif __LABELEX_H__
diff --git a/Demos/bdwallpaper/controlex/UIWPPanel.h b/Demos/bdwallpaper/controlex/UIWPPanel.h
new file mode 100644
index 00000000..db948e5b
--- /dev/null
+++ b/Demos/bdwallpaper/controlex/UIWPPanel.h
@@ -0,0 +1,81 @@
+#ifndef __WPPANEL_H__
+#define __WPPANEL_H__
+#include
+#include
+
+namespace DuiLib
+{
+ class CWPPanel : public CContainerUI
+ {
+ public:
+ CWPPanel()
+ {
+ // ּ
+ int aaLayouts[4][4] = {{4,1,1,4},{1,4,4,1},{4,4,1,1},{1,1,4,4}};
+ srand(time(NULL));
+ int nLayout = rand() % 4;
+ for(int i = 0; i < 4; i++)
+ {
+ m_aLayouts[i] = aaLayouts[nLayout][i];
+ }
+ }
+ ~CWPPanel(void)
+ {
+ }
+
+ public:
+ void SetPos(RECT rc)
+ {
+ CControlUI::SetPos(rc);
+ RECT rcItem = m_rcItem;
+
+ rcItem.left += m_rcInset.left;
+ rcItem.top += m_rcInset.top;
+ rcItem.right -= m_rcInset.right;
+ rcItem.bottom -= m_rcInset.bottom;
+
+ int nWidth = rcItem.right - rcItem.left;
+ int nHeight = rcItem.bottom - rcItem.top;
+ int nBlockWidth = nWidth / 2;
+ int nBlockHeight = nHeight / 2;
+ int nSBlockWidth = nBlockWidth / 2;
+ int nSBlockHeight = nBlockHeight / 2;
+
+ int it = 0;
+ for (int it1 = 0; it1 < 4; ++it1) {
+ int nX = it1 % 2 * nBlockWidth;
+ int nY = it1 / 2 * nBlockHeight;
+ RECT rcBlock = {rcItem.left + nX, rcItem.top + nY, rcItem.left + nX + nBlockWidth, rcItem.top + nY + nBlockHeight};
+
+ int nBlocks = m_aLayouts[it1];
+ if(nBlocks == 1) {
+ CControlUI* pBlock = (CControlUI*)m_items.GetAt(it);
+ if(pBlock != NULL) {
+ pBlock->SetPos(rcBlock);
+ }
+ }
+ else if(nBlocks == 4) {
+ for(int it2 = 0; it2 < nBlocks; ++it2) {
+ int nSX = it2 % 2 * nSBlockWidth;
+ int nSY = it2 / 2 * nSBlockHeight;
+ RECT rcSBlock = {rcBlock.left + nSX, rcBlock.top + nSY, rcBlock.left + nSX + nSBlockWidth, rcBlock.top + nSY + nSBlockHeight};
+ CControlUI* pBlock = (CControlUI*)m_items.GetAt(it + it2);
+ if(pBlock != NULL) {
+ pBlock->SetPos(rcSBlock);
+ }
+ }
+ }
+ it += nBlocks;
+ }
+ }
+ void SetAttribute(LPCTSTR pstrName, LPCTSTR pstrValue)
+ {
+ CContainerUI::SetAttribute(pstrName, pstrValue);
+ }
+
+ private:
+ int m_aLayouts[4];
+ };
+}
+
+#endif __WPPANEL_H__
diff --git a/Demos/bdwallpaper/helper/Utils.h b/Demos/bdwallpaper/helper/Utils.h
new file mode 100644
index 00000000..ea886ab7
--- /dev/null
+++ b/Demos/bdwallpaper/helper/Utils.h
@@ -0,0 +1,17 @@
+#pragma once
+
+static BOOL DoEvents()
+{
+ MSG msg = {0};
+ while (PeekMessage(&msg, NULL, 0, 0, PM_REMOVE))
+ {
+ if (msg.message == WM_QUIT)
+ {
+ PostQuitMessage(msg.wParam);
+ return FALSE;
+ }
+ TranslateMessage(&msg);
+ DispatchMessage( & msg);
+ }
+ return TRUE;
+}
diff --git a/Demos/bdwallpaper/helper/XUnzip.cpp b/Demos/bdwallpaper/helper/XUnzip.cpp
new file mode 100644
index 00000000..2f7b40a8
--- /dev/null
+++ b/Demos/bdwallpaper/helper/XUnzip.cpp
@@ -0,0 +1,4445 @@
+// XUnzip.cpp Version 1.3
+//
+// Authors: Mark Adler et al. (see below)
+//
+// Modified by: Lucian Wischik
+// lu@wischik.com
+//
+// Version 1.0 - Turned C files into just a single CPP file
+// - Made them compile cleanly as C++ files
+// - Gave them simpler APIs
+// - Added the ability to zip/unzip directly in memory without
+// any intermediate files
+//
+// Modified by: Hans Dietrich
+// hdietrich@gmail.com
+//
+// Version 1.3: - Corrected size bug introduced by 1.2
+//
+// Version 1.2: - Many bug fixes. See CodeProject article for list.
+//
+// Version 1.1: - Added Unicode support to CreateZip() and ZipAdd()
+// - Changed file names to avoid conflicts with Lucian's files
+//
+///////////////////////////////////////////////////////////////////////////////
+//
+// Lucian Wischik's comments:
+// --------------------------
+// THIS FILE is almost entirely based upon code by Info-ZIP.
+// It has been modified by Lucian Wischik.
+// The original code may be found at http://www.info-zip.org
+// The original copyright text follows.
+//
+///////////////////////////////////////////////////////////////////////////////
+//
+// Original authors' comments:
+// ---------------------------
+// This is version 2002-Feb-16 of the Info-ZIP copyright and license. The
+// definitive version of this document should be available at
+// ftp://ftp.info-zip.org/pub/infozip/license.html indefinitely.
+//
+// Copyright (c) 1990-2002 Info-ZIP. All rights reserved.
+//
+// For the purposes of this copyright and license, "Info-ZIP" is defined as
+// the following set of individuals:
+//
+// Mark Adler, John Bush, Karl Davis, Harald Denker, Jean-Michel Dubois,
+// Jean-loup Gailly, Hunter Goatley, Ian Gorman, Chris Herborth, Dirk Haase,
+// Greg Hartwig, Robert Heath, Jonathan Hudson, Paul Kienitz,
+// David Kirschbaum, Johnny Lee, Onno van der Linden, Igor Mandrichenko,
+// Steve P. Miller, Sergio Monesi, Keith Owens, George Petrov, Greg Roelofs,
+// Kai Uwe Rommel, Steve Salisbury, Dave Smith, Christian Spieler,
+// Antoine Verheijen, Paul von Behren, Rich Wales, Mike White
+//
+// This software is provided "as is", without warranty of any kind, express
+// or implied. In no event shall Info-ZIP or its contributors be held liable
+// for any direct, indirect, incidental, special or consequential damages
+// arising out of the use of or inability to use this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. Redistributions of source code must retain the above copyright notice,
+// definition, disclaimer, and this list of conditions.
+//
+// 2. Redistributions in binary form (compiled executables) must reproduce
+// the above copyright notice, definition, disclaimer, and this list of
+// conditions in documentation and/or other materials provided with the
+// distribution. The sole exception to this condition is redistribution
+// of a standard UnZipSFX binary as part of a self-extracting archive;
+// that is permitted without inclusion of this license, as long as the
+// normal UnZipSFX banner has not been removed from the binary or disabled.
+//
+// 3. Altered versions--including, but not limited to, ports to new
+// operating systems, existing ports with new graphical interfaces, and
+// dynamic, shared, or static library versions--must be plainly marked
+// as such and must not be misrepresented as being the original source.
+// Such altered versions also must not be misrepresented as being
+// Info-ZIP releases--including, but not limited to, labeling of the
+// altered versions with the names "Info-ZIP" (or any variation thereof,
+// including, but not limited to, different capitalizations),
+// "Pocket UnZip", "WiZ" or "MacZip" without the explicit permission of
+// Info-ZIP. Such altered versions are further prohibited from
+// misrepresentative use of the Zip-Bugs or Info-ZIP e-mail addresses or
+// of the Info-ZIP URL(s).
+//
+// 4. Info-ZIP retains the right to use the names "Info-ZIP", "Zip", "UnZip",
+// "UnZipSFX", "WiZ", "Pocket UnZip", "Pocket Zip", and "MacZip" for its
+// own source and binary releases.
+//
+///////////////////////////////////////////////////////////////////////////////
+
+
+//#define _USE_32BIT_TIME_T //+++1.2
+
+
+#define STRICT
+#define WIN32_LEAN_AND_MEAN
+#include
+#include
+#include
+#include
+#include
+#include
+
+#pragma warning(disable : 4996) // disable bogus deprecation warning
+
+// THIS FILE is almost entirely based upon code by Jean-loup Gailly
+// and Mark Adler. It has been modified by Lucian Wischik.
+// The original code may be found at http://www.gzip.org/zlib/
+// The original copyright text follows.
+//
+//
+//
+// zlib.h -- interface of the 'zlib' general purpose compression library
+// version 1.1.3, July 9th, 1998
+//
+// Copyright (C) 1995-1998 Jean-loup Gailly and Mark Adler
+//
+// This software is provided 'as-is', without any express or implied
+// warranty. In no event will the authors be held liable for any damages
+// arising from the use of this software.
+//
+// Permission is granted to anyone to use this software for any purpose,
+// including commercial applications, and to alter it and redistribute it
+// freely, subject to the following restrictions:
+//
+// 1. The origin of this software must not be misrepresented; you must not
+// claim that you wrote the original software. If you use this software
+// in a product, an acknowledgment in the product documentation would be
+// appreciated but is not required.
+// 2. Altered source versions must be plainly marked as such, and must not be
+// misrepresented as being the original software.
+// 3. This notice may not be removed or altered from any source distribution.
+//
+// Jean-loup Gailly Mark Adler
+// jloup@gzip.org madler@alumni.caltech.edu
+//
+//
+// The data format used by the zlib library is described by RFCs (Request for
+// Comments) 1950 to 1952 in the files ftp://ds.internic.net/rfc/rfc1950.txt
+// (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).
+//
+//
+// The 'zlib' compression library provides in-memory compression and
+// decompression functions, including integrity checks of the uncompressed
+// data. This version of the library supports only one compression method
+// (deflation) but other algorithms will be added later and will have the same
+// stream interface.
+//
+// Compression can be done in a single step if the buffers are large
+// enough (for example if an input file is mmap'ed), or can be done by
+// repeated calls of the compression function. In the latter case, the
+// application must provide more input and/or consume the output
+// (providing more output space) before each call.
+//
+// The library also supports reading and writing files in gzip (.gz) format
+// with an interface similar to that of stdio.
+//
+// The library does not install any signal handler. The decoder checks
+// the consistency of the compressed data, so the library should never
+// crash even in case of corrupted input.
+//
+// for more info about .ZIP format, see ftp://ftp.cdrom.com/pub/infozip/doc/appnote-970311-iz.zip
+// PkWare has also a specification at ftp://ftp.pkware.com/probdesc.zip
+
+#define zmalloc(len) malloc(len)
+
+#define zfree(p) free(p)
+
+/*
+void *zmalloc(unsigned int len)
+{ char *buf = new char[len+32];
+ for (int i=0; i<16; i++)
+ { buf[i]=i;
+ buf[len+31-i]=i;
+ }
+ *((unsigned int*)buf) = len;
+ char c[1000]; wsprintf(c,"malloc 0x%lx - %lu",buf+16,len);
+ OutputDebugString(c);
+ return buf+16;
+}
+
+void zfree(void *buf)
+{ char c[1000]; wsprintf(c,"free 0x%lx",buf);
+ OutputDebugString(c);
+ char *p = ((char*)buf)-16;
+ unsigned int len = *((unsigned int*)p);
+ bool blown=false;
+ for (int i=0; i<16; i++)
+ { char lo = p[i];
+ char hi = p[len+31-i];
+ if (hi!=i || (lo!=i && i>4)) blown=true;
+ }
+ if (blown)
+ { OutputDebugString("BLOWN!!!");
+ }
+ delete[] p;
+}
+*/
+
+DECLARE_HANDLE(HZIP); // An HZIP identifies a zip file that has been opened
+
+typedef DWORD ZRESULT;
+// return codes from any of the zip functions. Listed later.
+
+#define ZIP_HANDLE 1
+#define ZIP_FILENAME 2
+#define ZIP_MEMORY 3
+
+typedef struct
+{ int index; // index of this file within the zip
+char name[MAX_PATH]; // filename within the zip
+DWORD attr; // attributes, as in GetFileAttributes.
+FILETIME atime,ctime,mtime;// access, create, modify filetimes
+long comp_size; // sizes of item, compressed and uncompressed. These
+long unc_size; // may be -1 if not yet known (e.g. being streamed in)
+} ZIPENTRY;
+
+typedef struct
+{ int index; // index of this file within the zip
+TCHAR name[MAX_PATH]; // filename within the zip
+DWORD attr; // attributes, as in GetFileAttributes.
+FILETIME atime,ctime,mtime;// access, create, modify filetimes
+long comp_size; // sizes of item, compressed and uncompressed. These
+long unc_size; // may be -1 if not yet known (e.g. being streamed in)
+} ZIPENTRYW;
+
+// These are the result codes:
+#define ZR_OK 0x00000000 // nb. the pseudo-code zr-recent is never returned,
+#define ZR_RECENT 0x00000001 // but can be passed to FormatZipMessage.
+// The following come from general system stuff (e.g. files not openable)
+#define ZR_GENMASK 0x0000FF00
+#define ZR_NODUPH 0x00000100 // couldn't duplicate the handle
+#define ZR_NOFILE 0x00000200 // couldn't create/open the file
+#define ZR_NOALLOC 0x00000300 // failed to allocate some resource
+#define ZR_WRITE 0x00000400 // a general error writing to the file
+#define ZR_NOTFOUND 0x00000500 // couldn't find that file in the zip
+#define ZR_MORE 0x00000600 // there's still more data to be unzipped
+#define ZR_CORRUPT 0x00000700 // the zipfile is corrupt or not a zipfile
+#define ZR_READ 0x00000800 // a general error reading the file
+// The following come from mistakes on the part of the caller
+#define ZR_CALLERMASK 0x00FF0000
+#define ZR_ARGS 0x00010000 // general mistake with the arguments
+#define ZR_NOTMMAP 0x00020000 // tried to ZipGetMemory, but that only works on mmap zipfiles, which yours wasn't
+#define ZR_MEMSIZE 0x00030000 // the memory size is too small
+#define ZR_FAILED 0x00040000 // the thing was already failed when you called this function
+#define ZR_ENDED 0x00050000 // the zip creation has already been closed
+#define ZR_MISSIZE 0x00060000 // the indicated input file size turned out mistaken
+#define ZR_PARTIALUNZ 0x00070000 // the file had already been partially unzipped
+#define ZR_ZMODE 0x00080000 // tried to mix creating/opening a zip
+// The following come from bugs within the zip library itself
+#define ZR_BUGMASK 0xFF000000
+#define ZR_NOTINITED 0x01000000 // initialisation didn't work
+#define ZR_SEEK 0x02000000 // trying to seek in an unseekable file
+#define ZR_NOCHANGE 0x04000000 // changed its mind on storage, but not allowed
+#define ZR_FLATE 0x05000000 // an internal error in the de/inflation code
+
+#pragma warning(disable : 4702) // unreachable code
+
+static ZRESULT zopenerror = ZR_OK; //+++1.2
+
+typedef struct tm_unz_s
+{ unsigned int tm_sec; // seconds after the minute - [0,59]
+ unsigned int tm_min; // minutes after the hour - [0,59]
+ unsigned int tm_hour; // hours since midnight - [0,23]
+ unsigned int tm_mday; // day of the month - [1,31]
+ unsigned int tm_mon; // months since January - [0,11]
+ unsigned int tm_year; // years - [1980..2044]
+} tm_unz;
+
+
+// unz_global_info structure contain global data about the ZIPfile
+typedef struct unz_global_info_s
+{ unsigned long number_entry; // total number of entries in the central dir on this disk
+ unsigned long size_comment; // size of the global comment of the zipfile
+} unz_global_info;
+
+// unz_file_info contain information about a file in the zipfile
+typedef struct unz_file_info_s
+{ unsigned long version; // version made by 2 bytes
+ unsigned long version_needed; // version needed to extract 2 bytes
+ unsigned long flag; // general purpose bit flag 2 bytes
+ unsigned long compression_method; // compression method 2 bytes
+ unsigned long dosDate; // last mod file date in Dos fmt 4 bytes
+ unsigned long crc; // crc-32 4 bytes
+ unsigned long compressed_size; // compressed size 4 bytes
+ unsigned long uncompressed_size; // uncompressed size 4 bytes
+ unsigned long size_filename; // filename length 2 bytes
+ unsigned long size_file_extra; // extra field length 2 bytes
+ unsigned long size_file_comment; // file comment length 2 bytes
+ unsigned long disk_num_start; // disk number start 2 bytes
+ unsigned long internal_fa; // internal file attributes 2 bytes
+ unsigned long external_fa; // external file attributes 4 bytes
+ tm_unz tmu_date;
+} unz_file_info;
+
+
+#define UNZ_OK (0)
+#define UNZ_END_OF_LIST_OF_FILE (-100)
+#define UNZ_ERRNO (Z_ERRNO)
+#define UNZ_EOF (0)
+#define UNZ_PARAMERROR (-102)
+#define UNZ_BADZIPFILE (-103)
+#define UNZ_INTERNALERROR (-104)
+#define UNZ_CRCERROR (-105)
+
+
+
+
+
+
+
+#define ZLIB_VERSION "1.1.3"
+
+
+// Allowed flush values; see deflate() for details
+#define Z_NO_FLUSH 0
+#define Z_SYNC_FLUSH 2
+#define Z_FULL_FLUSH 3
+#define Z_FINISH 4
+
+
+// compression levels
+#define Z_NO_COMPRESSION 0
+#define Z_BEST_SPEED 1
+#define Z_BEST_COMPRESSION 9
+#define Z_DEFAULT_COMPRESSION (-1)
+
+// compression strategy; see deflateInit2() for details
+#define Z_FILTERED 1
+#define Z_HUFFMAN_ONLY 2
+#define Z_DEFAULT_STRATEGY 0
+
+// Possible values of the data_type field
+#define Z_BINARY 0
+#define Z_ASCII 1
+#define Z_UNKNOWN 2
+
+// The deflate compression method (the only one supported in this version)
+#define Z_DEFLATED 8
+
+// for initializing zalloc, zfree, opaque
+#define Z_NULL 0
+
+// case sensitivity when searching for filenames
+#define CASE_SENSITIVE 1
+#define CASE_INSENSITIVE 2
+
+
+// Return codes for the compression/decompression functions. Negative
+// values are errors, positive values are used for special but normal events.
+#define Z_OK 0
+#define Z_STREAM_END 1
+#define Z_NEED_DICT 2
+#define Z_ERRNO (-1)
+#define Z_STREAM_ERROR (-2)
+#define Z_DATA_ERROR (-3)
+#define Z_MEM_ERROR (-4)
+#define Z_BUF_ERROR (-5)
+#define Z_VERSION_ERROR (-6)
+
+
+
+// Basic data types
+typedef unsigned char Byte; // 8 bits
+typedef unsigned int uInt; // 16 bits or more
+typedef unsigned long uLong; // 32 bits or more
+typedef void *voidpf;
+typedef void *voidp;
+typedef long z_off_t;
+
+
+
+
+
+
+
+
+
+
+
+
+typedef voidpf (*alloc_func) (voidpf opaque, uInt items, uInt size);
+typedef void (*free_func) (voidpf opaque, voidpf address);
+
+struct internal_state;
+
+typedef struct z_stream_s {
+ Byte *next_in; // next input byte
+ uInt avail_in; // number of bytes available at next_in
+ uLong total_in; // total nb of input bytes read so far
+
+ Byte *next_out; // next output byte should be put there
+ uInt avail_out; // remaining free space at next_out
+ uLong total_out; // total nb of bytes output so far
+
+ char *msg; // last error message, NULL if no error
+ struct internal_state *state; // not visible by applications
+
+ alloc_func zalloc; // used to allocate the internal state
+ free_func zfree; // used to free the internal state
+ voidpf opaque; // private data object passed to zalloc and zfree
+
+ int data_type; // best guess about the data type: ascii or binary
+ uLong adler; // adler32 value of the uncompressed data
+ uLong reserved; // reserved for future use
+} z_stream;
+
+typedef z_stream *z_streamp;
+
+
+// The application must update next_in and avail_in when avail_in has
+// dropped to zero. It must update next_out and avail_out when avail_out
+// has dropped to zero. The application must initialize zalloc, zfree and
+// opaque before calling the init function. All other fields are set by the
+// compression library and must not be updated by the application.
+//
+// The opaque value provided by the application will be passed as the first
+// parameter for calls of zalloc and zfree. This can be useful for custom
+// memory management. The compression library attaches no meaning to the
+// opaque value.
+//
+// zalloc must return Z_NULL if there is not enough memory for the object.
+// If zlib is used in a multi-threaded application, zalloc and zfree must be
+// thread safe.
+//
+// The fields total_in and total_out can be used for statistics or
+// progress reports. After compression, total_in holds the total size of
+// the uncompressed data and may be saved for use in the decompressor
+// (particularly if the decompressor wants to decompress everything in
+// a single step).
+//
+
+
+// basic functions
+
+const char *zlibVersion ();
+// The application can compare zlibVersion and ZLIB_VERSION for consistency.
+// If the first character differs, the library code actually used is
+// not compatible with the zlib.h header file used by the application.
+// This check is automatically made by inflateInit.
+
+
+
+
+
+
+int inflate (z_streamp strm, int flush);
+//
+// inflate decompresses as much data as possible, and stops when the input
+// buffer becomes empty or the output buffer becomes full. It may some
+// introduce some output latency (reading input without producing any output)
+// except when forced to flush.
+//
+// The detailed semantics are as follows. inflate performs one or both of the
+// following actions:
+//
+// - Decompress more input starting at next_in and update next_in and avail_in
+// accordingly. If not all input can be processed (because there is not
+// enough room in the output buffer), next_in is updated and processing
+// will resume at this point for the next call of inflate().
+//
+// - Provide more output starting at next_out and update next_out and avail_out
+// accordingly. inflate() provides as much output as possible, until there
+// is no more input data or no more space in the output buffer (see below
+// about the flush parameter).
+//
+// Before the call of inflate(), the application should ensure that at least
+// one of the actions is possible, by providing more input and/or consuming
+// more output, and updating the next_* and avail_* values accordingly.
+// The application can consume the uncompressed output when it wants, for
+// example when the output buffer is full (avail_out == 0), or after each
+// call of inflate(). If inflate returns Z_OK and with zero avail_out, it
+// must be called again after making room in the output buffer because there
+// might be more output pending.
+//
+// If the parameter flush is set to Z_SYNC_FLUSH, inflate flushes as much
+// output as possible to the output buffer. The flushing behavior of inflate is
+// not specified for values of the flush parameter other than Z_SYNC_FLUSH
+// and Z_FINISH, but the current implementation actually flushes as much output
+// as possible anyway.
+//
+// inflate() should normally be called until it returns Z_STREAM_END or an
+// error. However if all decompression is to be performed in a single step
+// (a single call of inflate), the parameter flush should be set to
+// Z_FINISH. In this case all pending input is processed and all pending
+// output is flushed; avail_out must be large enough to hold all the
+// uncompressed data. (The size of the uncompressed data may have been saved
+// by the compressor for this purpose.) The next operation on this stream must
+// be inflateEnd to deallocate the decompression state. The use of Z_FINISH
+// is never required, but can be used to inform inflate that a faster routine
+// may be used for the single inflate() call.
+//
+// If a preset dictionary is needed at this point (see inflateSetDictionary
+// below), inflate sets strm-adler to the adler32 checksum of the
+// dictionary chosen by the compressor and returns Z_NEED_DICT; otherwise
+// it sets strm->adler to the adler32 checksum of all output produced
+// so far (that is, total_out bytes) and returns Z_OK, Z_STREAM_END or
+// an error code as described below. At the end of the stream, inflate()
+// checks that its computed adler32 checksum is equal to that saved by the
+// compressor and returns Z_STREAM_END only if the checksum is correct.
+//
+// inflate() returns Z_OK if some progress has been made (more input processed
+// or more output produced), Z_STREAM_END if the end of the compressed data has
+// been reached and all uncompressed output has been produced, Z_NEED_DICT if a
+// preset dictionary is needed at this point, Z_DATA_ERROR if the input data was
+// corrupted (input stream not conforming to the zlib format or incorrect
+// adler32 checksum), Z_STREAM_ERROR if the stream structure was inconsistent
+// (for example if next_in or next_out was NULL), Z_MEM_ERROR if there was not
+// enough memory, Z_BUF_ERROR if no progress is possible or if there was not
+// enough room in the output buffer when Z_FINISH is used. In the Z_DATA_ERROR
+// case, the application may then call inflateSync to look for a good
+// compression block.
+//
+
+
+int inflateEnd (z_streamp strm);
+//
+// All dynamically allocated data structures for this stream are freed.
+// This function discards any unprocessed input and does not flush any
+// pending output.
+//
+// inflateEnd returns Z_OK if success, Z_STREAM_ERROR if the stream state
+// was inconsistent. In the error case, msg may be set but then points to a
+// static string (which must not be deallocated).
+
+ // Advanced functions
+
+// The following functions are needed only in some special applications.
+
+
+
+
+
+int inflateSetDictionary (z_streamp strm,
+ const Byte *dictionary,
+ uInt dictLength);
+//
+// Initializes the decompression dictionary from the given uncompressed byte
+// sequence. This function must be called immediately after a call of inflate
+// if this call returned Z_NEED_DICT. The dictionary chosen by the compressor
+// can be determined from the Adler32 value returned by this call of
+// inflate. The compressor and decompressor must use exactly the same
+// dictionary.
+//
+// inflateSetDictionary returns Z_OK if success, Z_STREAM_ERROR if a
+// parameter is invalid (such as NULL dictionary) or the stream state is
+// inconsistent, Z_DATA_ERROR if the given dictionary doesn't match the
+// expected one (incorrect Adler32 value). inflateSetDictionary does not
+// perform any decompression: this will be done by subsequent calls of
+// inflate().
+
+
+int inflateSync (z_streamp strm);
+//
+// Skips invalid compressed data until a full flush point can be found, or until all
+// available input is skipped. No output is provided.
+//
+// inflateSync returns Z_OK if a full flush point has been found, Z_BUF_ERROR
+// if no more input was provided, Z_DATA_ERROR if no flush point has been found,
+// or Z_STREAM_ERROR if the stream structure was inconsistent. In the success
+// case, the application may save the current current value of total_in which
+// indicates where valid compressed data was found. In the error case, the
+// application may repeatedly call inflateSync, providing more input each time,
+// until success or end of the input data.
+
+
+int inflateReset (z_streamp strm);
+// This function is equivalent to inflateEnd followed by inflateInit,
+// but does not free and reallocate all the internal decompression state.
+// The stream will keep attributes that may have been set by inflateInit2.
+//
+// inflateReset returns Z_OK if success, or Z_STREAM_ERROR if the source
+// stream state was inconsistent (such as zalloc or state being NULL).
+//
+
+
+
+// checksum functions
+// These functions are not related to compression but are exported
+// anyway because they might be useful in applications using the
+// compression library.
+
+uLong adler32 (uLong adler, const Byte *buf, uInt len);
+// Update a running Adler-32 checksum with the bytes buf[0..len-1] and
+// return the updated checksum. If buf is NULL, this function returns
+// the required initial value for the checksum.
+// An Adler-32 checksum is almost as reliable as a CRC32 but can be computed
+// much faster. Usage example:
+//
+// uLong adler = adler32(0L, Z_NULL, 0);
+//
+// while (read_buffer(buffer, length) != EOF) {
+// adler = adler32(adler, buffer, length);
+// }
+// if (adler != original_adler) error();
+
+uLong ucrc32 (uLong crc, const Byte *buf, uInt len);
+// Update a running crc with the bytes buf[0..len-1] and return the updated
+// crc. If buf is NULL, this function returns the required initial value
+// for the crc. Pre- and post-conditioning (one's complement) is performed
+// within this function so it shouldn't be done by the application.
+// Usage example:
+//
+// uLong crc = crc32(0L, Z_NULL, 0);
+//
+// while (read_buffer(buffer, length) != EOF) {
+// crc = crc32(crc, buffer, length);
+// }
+// if (crc != original_crc) error();
+
+
+
+
+const char *zError (int err);
+int inflateSyncPoint (z_streamp z);
+const uLong *get_crc_table (void);
+
+
+
+typedef unsigned char uch;
+typedef uch uchf;
+typedef unsigned short ush;
+typedef ush ushf;
+typedef unsigned long ulg;
+
+
+
+const char * const z_errmsg[10] = { // indexed by 2-zlib_error
+"need dictionary", // Z_NEED_DICT 2
+"stream end", // Z_STREAM_END 1
+"", // Z_OK 0
+"file error", // Z_ERRNO (-1)
+"stream error", // Z_STREAM_ERROR (-2)
+"data error", // Z_DATA_ERROR (-3)
+"insufficient memory", // Z_MEM_ERROR (-4)
+"buffer error", // Z_BUF_ERROR (-5)
+"incompatible version",// Z_VERSION_ERROR (-6)
+""};
+
+
+#define ERR_MSG(err) z_errmsg[Z_NEED_DICT-(err)]
+
+#define ERR_RETURN(strm,err) \
+ return (strm->msg = (char*)ERR_MSG(err), (err))
+// To be used only when the state is known to be valid
+
+ // common constants
+
+
+#define STORED_BLOCK 0
+#define STATIC_TREES 1
+#define DYN_TREES 2
+// The three kinds of block type
+
+#define MIN_MATCH 3
+#define MAX_MATCH 258
+// The minimum and maximum match lengths
+
+#define PRESET_DICT 0x20 // preset dictionary flag in zlib header
+
+ // target dependencies
+
+#define OS_CODE 0x0b // Window 95 & Windows NT
+
+
+
+ // functions
+
+#define zmemzero(dest, len) memset(dest, 0, len)
+
+// Diagnostic functions
+#undef Assert
+#undef Trace
+#undef Tracev
+#undef Tracevv
+#undef Tracec
+#undef Tracecv
+
+#ifdef DEBUG
+
+ int z_verbose = 0;
+ void z_error (char *m) {fprintf(stderr, "%s\n", m); exit(1);}
+
+#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
+
+#ifndef __noop
+#if _MSC_VER < 1300
+#define __noop ((void)0)
+#endif
+#endif
+
+#define Assert(cond,msg) __noop
+#define Trace(x) __noop
+#define Tracev(x) __noop
+#define Tracevv(x) __noop
+#define Tracec(c,x) __noop
+#define Tracecv(c,x) __noop
+
+#endif
+
+
+typedef uLong (*check_func) (uLong check, const Byte *buf, uInt len);
+voidpf zcalloc (voidpf opaque, unsigned items, unsigned size);
+void zcfree (voidpf opaque, voidpf ptr);
+
+#define ZALLOC(strm, items, size) \
+ (*((strm)->zalloc))((strm)->opaque, (items), (size))
+#define ZFREE(strm, addr) (*((strm)->zfree))((strm)->opaque, (voidpf)(addr))
+
+//void ZFREE(z_streamp strm,voidpf addr)
+//{ *((strm)->zfree))((strm)->opaque, addr);
+//}
+
+#define TRY_FREE(s, p) {if (p) ZFREE(s, p);}
+
+
+
+
+// Huffman code lookup table entry--this entry is four bytes for machines
+// that have 16-bit pointers (e.g. PC's in the small or medium model).
+
+
+typedef struct inflate_huft_s inflate_huft;
+
+struct inflate_huft_s {
+ union {
+ struct {
+ Byte Exop; // number of extra bits or operation
+ Byte Bits; // number of bits in this code or subcode
+ } what;
+ uInt pad; // pad structure to a power of 2 (4 bytes for
+ } word; // 16-bit, 8 bytes for 32-bit int's)
+ uInt base; // literal, length base, distance base, or table offset
+};
+
+// Maximum size of dynamic tree. The maximum found in a long but non-
+// exhaustive search was 1004 huft structures (850 for length/literals
+// and 154 for distances, the latter actually the result of an
+// exhaustive search). The actual maximum is not known, but the
+// value below is more than safe.
+#define MANY 1440
+
+int inflate_trees_bits (
+ uInt *, // 19 code lengths
+ uInt *, // bits tree desired/actual depth
+ inflate_huft * *, // bits tree result
+ inflate_huft *, // space for trees
+ z_streamp); // for messages
+
+int inflate_trees_dynamic (
+ uInt, // number of literal/length codes
+ uInt, // number of distance codes
+ uInt *, // that many (total) code lengths
+ uInt *, // literal desired/actual bit depth
+ uInt *, // distance desired/actual bit depth
+ inflate_huft * *, // literal/length tree result
+ inflate_huft * *, // distance tree result
+ inflate_huft *, // space for trees
+ z_streamp); // for messages
+
+int inflate_trees_fixed (
+ uInt *, // literal desired/actual bit depth
+ uInt *, // distance desired/actual bit depth
+ const inflate_huft * *, // literal/length tree result
+ const inflate_huft * *, // distance tree result
+ z_streamp); // for memory allocation
+
+
+
+
+
+struct inflate_blocks_state;
+typedef struct inflate_blocks_state inflate_blocks_statef;
+
+inflate_blocks_statef * inflate_blocks_new (
+ z_streamp z,
+ check_func c, // check function
+ uInt w); // window size
+
+int inflate_blocks (
+ inflate_blocks_statef *,
+ z_streamp ,
+ int); // initial return code
+
+void inflate_blocks_reset (
+ inflate_blocks_statef *,
+ z_streamp ,
+ uLong *); // check value on output
+
+int inflate_blocks_free (
+ inflate_blocks_statef *,
+ z_streamp);
+
+void inflate_set_dictionary (
+ inflate_blocks_statef *s,
+ const Byte *d, // dictionary
+ uInt n); // dictionary length
+
+int inflate_blocks_sync_point (
+ inflate_blocks_statef *s);
+
+
+
+
+struct inflate_codes_state;
+typedef struct inflate_codes_state inflate_codes_statef;
+
+inflate_codes_statef *inflate_codes_new (
+ uInt, uInt,
+ const inflate_huft *, const inflate_huft *,
+ z_streamp );
+
+int inflate_codes (
+ inflate_blocks_statef *,
+ z_streamp ,
+ int);
+
+void inflate_codes_free (
+ inflate_codes_statef *,
+ z_streamp );
+
+
+
+
+typedef enum {
+ IBM_TYPE, // get type bits (3, including end bit)
+ IBM_LENS, // get lengths for stored
+ IBM_STORED, // processing stored block
+ IBM_TABLE, // get table lengths
+ IBM_BTREE, // get bit lengths tree for a dynamic block
+ IBM_DTREE, // get length, distance trees for a dynamic block
+ IBM_CODES, // processing fixed or dynamic block
+ IBM_DRY, // output remaining window bytes
+ IBM_DONE, // finished last block, done
+ IBM_BAD} // got a data error--stuck here
+inflate_block_mode;
+
+// inflate blocks semi-private state
+struct inflate_blocks_state {
+
+ // mode
+ inflate_block_mode mode; // current inflate_block mode
+
+ // mode dependent information
+ union {
+ uInt left; // if STORED, bytes left to copy
+ struct {
+ uInt table; // table lengths (14 bits)
+ uInt index; // index into blens (or border)
+ uInt *blens; // bit lengths of codes
+ uInt bb; // bit length tree depth
+ inflate_huft *tb; // bit length decoding tree
+ } trees; // if DTREE, decoding info for trees
+ struct {
+ inflate_codes_statef
+ *codes;
+ } decode; // if CODES, current state
+ } sub; // submode
+ uInt last; // true if this block is the last block
+
+ // mode independent information
+ uInt bitk; // bits in bit buffer
+ uLong bitb; // bit buffer
+ inflate_huft *hufts; // single malloc for tree space
+ Byte *window; // sliding window
+ Byte *end; // one byte after sliding window
+ Byte *read; // window read pointer
+ Byte *write; // window write pointer
+ check_func checkfn; // check function
+ uLong check; // check on output
+
+};
+
+
+// defines for inflate input/output
+// update pointers and return
+#define UPDBITS {s->bitb=b;s->bitk=k;}
+#define UPDIN {z->avail_in=n;z->total_in+=(uLong)(p-z->next_in);z->next_in=p;}
+#define UPDOUT {s->write=q;}
+#define UPDATE {UPDBITS UPDIN UPDOUT}
+#define LEAVE {UPDATE return inflate_flush(s,z,r);}
+// get bytes and bits
+#define LOADIN {p=z->next_in;n=z->avail_in;b=s->bitb;k=s->bitk;}
+#define NEEDBYTE {if(n)r=Z_OK;else LEAVE}
+#define NEXTBYTE (n--,*p++)
+#define NEEDBITS(j) {while(k<(j)){NEEDBYTE;b|=((uLong)NEXTBYTE)<>=(j);k-=(j);}
+// output bytes
+#define WAVAIL (uInt)(qread?s->read-q-1:s->end-q)
+#define LOADOUT {q=s->write;m=(uInt)WAVAIL;m;}
+#define WRAP {if(q==s->end&&s->read!=s->window){q=s->window;m=(uInt)WAVAIL;}}
+#define FLUSH {UPDOUT r=inflate_flush(s,z,r); LOADOUT}
+#define NEEDOUT {if(m==0){WRAP if(m==0){FLUSH WRAP if(m==0) LEAVE}}r=Z_OK;}
+#define OUTBYTE(a) {*q++=(Byte)(a);m--;}
+// load local pointers
+#define LOAD {LOADIN LOADOUT}
+
+// masks for lower bits (size given to avoid silly warnings with Visual C++)
+// And'ing with mask[n] masks the lower n bits
+const uInt inflate_mask[17] = {
+ 0x0000,
+ 0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff,
+ 0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff
+};
+
+// copy as much as possible from the sliding window to the output area
+int inflate_flush (inflate_blocks_statef *, z_streamp, int);
+
+int inflate_fast (uInt, uInt, const inflate_huft *, const inflate_huft *, inflate_blocks_statef *, z_streamp );
+
+
+
+const uInt fixed_bl = 9;
+const uInt fixed_bd = 5;
+const inflate_huft fixed_tl[] = {
+ {{{96,7}},256}, {{{0,8}},80}, {{{0,8}},16}, {{{84,8}},115},
+ {{{82,7}},31}, {{{0,8}},112}, {{{0,8}},48}, {{{0,9}},192},
+ {{{80,7}},10}, {{{0,8}},96}, {{{0,8}},32}, {{{0,9}},160},
+ {{{0,8}},0}, {{{0,8}},128}, {{{0,8}},64}, {{{0,9}},224},
+ {{{80,7}},6}, {{{0,8}},88}, {{{0,8}},24}, {{{0,9}},144},
+ {{{83,7}},59}, {{{0,8}},120}, {{{0,8}},56}, {{{0,9}},208},
+ {{{81,7}},17}, {{{0,8}},104}, {{{0,8}},40}, {{{0,9}},176},
+ {{{0,8}},8}, {{{0,8}},136}, {{{0,8}},72}, {{{0,9}},240},
+ {{{80,7}},4}, {{{0,8}},84}, {{{0,8}},20}, {{{85,8}},227},
+ {{{83,7}},43}, {{{0,8}},116}, {{{0,8}},52}, {{{0,9}},200},
+ {{{81,7}},13}, {{{0,8}},100}, {{{0,8}},36}, {{{0,9}},168},
+ {{{0,8}},4}, {{{0,8}},132}, {{{0,8}},68}, {{{0,9}},232},
+ {{{80,7}},8}, {{{0,8}},92}, {{{0,8}},28}, {{{0,9}},152},
+ {{{84,7}},83}, {{{0,8}},124}, {{{0,8}},60}, {{{0,9}},216},
+ {{{82,7}},23}, {{{0,8}},108}, {{{0,8}},44}, {{{0,9}},184},
+ {{{0,8}},12}, {{{0,8}},140}, {{{0,8}},76}, {{{0,9}},248},
+ {{{80,7}},3}, {{{0,8}},82}, {{{0,8}},18}, {{{85,8}},163},
+ {{{83,7}},35}, {{{0,8}},114}, {{{0,8}},50}, {{{0,9}},196},
+ {{{81,7}},11}, {{{0,8}},98}, {{{0,8}},34}, {{{0,9}},164},
+ {{{0,8}},2}, {{{0,8}},130}, {{{0,8}},66}, {{{0,9}},228},
+ {{{80,7}},7}, {{{0,8}},90}, {{{0,8}},26}, {{{0,9}},148},
+ {{{84,7}},67}, {{{0,8}},122}, {{{0,8}},58}, {{{0,9}},212},
+ {{{82,7}},19}, {{{0,8}},106}, {{{0,8}},42}, {{{0,9}},180},
+ {{{0,8}},10}, {{{0,8}},138}, {{{0,8}},74}, {{{0,9}},244},
+ {{{80,7}},5}, {{{0,8}},86}, {{{0,8}},22}, {{{192,8}},0},
+ {{{83,7}},51}, {{{0,8}},118}, {{{0,8}},54}, {{{0,9}},204},
+ {{{81,7}},15}, {{{0,8}},102}, {{{0,8}},38}, {{{0,9}},172},
+ {{{0,8}},6}, {{{0,8}},134}, {{{0,8}},70}, {{{0,9}},236},
+ {{{80,7}},9}, {{{0,8}},94}, {{{0,8}},30}, {{{0,9}},156},
+ {{{84,7}},99}, {{{0,8}},126}, {{{0,8}},62}, {{{0,9}},220},
+ {{{82,7}},27}, {{{0,8}},110}, {{{0,8}},46}, {{{0,9}},188},
+ {{{0,8}},14}, {{{0,8}},142}, {{{0,8}},78}, {{{0,9}},252},
+ {{{96,7}},256}, {{{0,8}},81}, {{{0,8}},17}, {{{85,8}},131},
+ {{{82,7}},31}, {{{0,8}},113}, {{{0,8}},49}, {{{0,9}},194},
+ {{{80,7}},10}, {{{0,8}},97}, {{{0,8}},33}, {{{0,9}},162},
+ {{{0,8}},1}, {{{0,8}},129}, {{{0,8}},65}, {{{0,9}},226},
+ {{{80,7}},6}, {{{0,8}},89}, {{{0,8}},25}, {{{0,9}},146},
+ {{{83,7}},59}, {{{0,8}},121}, {{{0,8}},57}, {{{0,9}},210},
+ {{{81,7}},17}, {{{0,8}},105}, {{{0,8}},41}, {{{0,9}},178},
+ {{{0,8}},9}, {{{0,8}},137}, {{{0,8}},73}, {{{0,9}},242},
+ {{{80,7}},4}, {{{0,8}},85}, {{{0,8}},21}, {{{80,8}},258},
+ {{{83,7}},43}, {{{0,8}},117}, {{{0,8}},53}, {{{0,9}},202},
+ {{{81,7}},13}, {{{0,8}},101}, {{{0,8}},37}, {{{0,9}},170},
+ {{{0,8}},5}, {{{0,8}},133}, {{{0,8}},69}, {{{0,9}},234},
+ {{{80,7}},8}, {{{0,8}},93}, {{{0,8}},29}, {{{0,9}},154},
+ {{{84,7}},83}, {{{0,8}},125}, {{{0,8}},61}, {{{0,9}},218},
+ {{{82,7}},23}, {{{0,8}},109}, {{{0,8}},45}, {{{0,9}},186},
+ {{{0,8}},13}, {{{0,8}},141}, {{{0,8}},77}, {{{0,9}},250},
+ {{{80,7}},3}, {{{0,8}},83}, {{{0,8}},19}, {{{85,8}},195},
+ {{{83,7}},35}, {{{0,8}},115}, {{{0,8}},51}, {{{0,9}},198},
+ {{{81,7}},11}, {{{0,8}},99}, {{{0,8}},35}, {{{0,9}},166},
+ {{{0,8}},3}, {{{0,8}},131}, {{{0,8}},67}, {{{0,9}},230},
+ {{{80,7}},7}, {{{0,8}},91}, {{{0,8}},27}, {{{0,9}},150},
+ {{{84,7}},67}, {{{0,8}},123}, {{{0,8}},59}, {{{0,9}},214},
+ {{{82,7}},19}, {{{0,8}},107}, {{{0,8}},43}, {{{0,9}},182},
+ {{{0,8}},11}, {{{0,8}},139}, {{{0,8}},75}, {{{0,9}},246},
+ {{{80,7}},5}, {{{0,8}},87}, {{{0,8}},23}, {{{192,8}},0},
+ {{{83,7}},51}, {{{0,8}},119}, {{{0,8}},55}, {{{0,9}},206},
+ {{{81,7}},15}, {{{0,8}},103}, {{{0,8}},39}, {{{0,9}},174},
+ {{{0,8}},7}, {{{0,8}},135}, {{{0,8}},71}, {{{0,9}},238},
+ {{{80,7}},9}, {{{0,8}},95}, {{{0,8}},31}, {{{0,9}},158},
+ {{{84,7}},99}, {{{0,8}},127}, {{{0,8}},63}, {{{0,9}},222},
+ {{{82,7}},27}, {{{0,8}},111}, {{{0,8}},47}, {{{0,9}},190},
+ {{{0,8}},15}, {{{0,8}},143}, {{{0,8}},79}, {{{0,9}},254},
+ {{{96,7}},256}, {{{0,8}},80}, {{{0,8}},16}, {{{84,8}},115},
+ {{{82,7}},31}, {{{0,8}},112}, {{{0,8}},48}, {{{0,9}},193},
+ {{{80,7}},10}, {{{0,8}},96}, {{{0,8}},32}, {{{0,9}},161},
+ {{{0,8}},0}, {{{0,8}},128}, {{{0,8}},64}, {{{0,9}},225},
+ {{{80,7}},6}, {{{0,8}},88}, {{{0,8}},24}, {{{0,9}},145},
+ {{{83,7}},59}, {{{0,8}},120}, {{{0,8}},56}, {{{0,9}},209},
+ {{{81,7}},17}, {{{0,8}},104}, {{{0,8}},40}, {{{0,9}},177},
+ {{{0,8}},8}, {{{0,8}},136}, {{{0,8}},72}, {{{0,9}},241},
+ {{{80,7}},4}, {{{0,8}},84}, {{{0,8}},20}, {{{85,8}},227},
+ {{{83,7}},43}, {{{0,8}},116}, {{{0,8}},52}, {{{0,9}},201},
+ {{{81,7}},13}, {{{0,8}},100}, {{{0,8}},36}, {{{0,9}},169},
+ {{{0,8}},4}, {{{0,8}},132}, {{{0,8}},68}, {{{0,9}},233},
+ {{{80,7}},8}, {{{0,8}},92}, {{{0,8}},28}, {{{0,9}},153},
+ {{{84,7}},83}, {{{0,8}},124}, {{{0,8}},60}, {{{0,9}},217},
+ {{{82,7}},23}, {{{0,8}},108}, {{{0,8}},44}, {{{0,9}},185},
+ {{{0,8}},12}, {{{0,8}},140}, {{{0,8}},76}, {{{0,9}},249},
+ {{{80,7}},3}, {{{0,8}},82}, {{{0,8}},18}, {{{85,8}},163},
+ {{{83,7}},35}, {{{0,8}},114}, {{{0,8}},50}, {{{0,9}},197},
+ {{{81,7}},11}, {{{0,8}},98}, {{{0,8}},34}, {{{0,9}},165},
+ {{{0,8}},2}, {{{0,8}},130}, {{{0,8}},66}, {{{0,9}},229},
+ {{{80,7}},7}, {{{0,8}},90}, {{{0,8}},26}, {{{0,9}},149},
+ {{{84,7}},67}, {{{0,8}},122}, {{{0,8}},58}, {{{0,9}},213},
+ {{{82,7}},19}, {{{0,8}},106}, {{{0,8}},42}, {{{0,9}},181},
+ {{{0,8}},10}, {{{0,8}},138}, {{{0,8}},74}, {{{0,9}},245},
+ {{{80,7}},5}, {{{0,8}},86}, {{{0,8}},22}, {{{192,8}},0},
+ {{{83,7}},51}, {{{0,8}},118}, {{{0,8}},54}, {{{0,9}},205},
+ {{{81,7}},15}, {{{0,8}},102}, {{{0,8}},38}, {{{0,9}},173},
+ {{{0,8}},6}, {{{0,8}},134}, {{{0,8}},70}, {{{0,9}},237},
+ {{{80,7}},9}, {{{0,8}},94}, {{{0,8}},30}, {{{0,9}},157},
+ {{{84,7}},99}, {{{0,8}},126}, {{{0,8}},62}, {{{0,9}},221},
+ {{{82,7}},27}, {{{0,8}},110}, {{{0,8}},46}, {{{0,9}},189},
+ {{{0,8}},14}, {{{0,8}},142}, {{{0,8}},78}, {{{0,9}},253},
+ {{{96,7}},256}, {{{0,8}},81}, {{{0,8}},17}, {{{85,8}},131},
+ {{{82,7}},31}, {{{0,8}},113}, {{{0,8}},49}, {{{0,9}},195},
+ {{{80,7}},10}, {{{0,8}},97}, {{{0,8}},33}, {{{0,9}},163},
+ {{{0,8}},1}, {{{0,8}},129}, {{{0,8}},65}, {{{0,9}},227},
+ {{{80,7}},6}, {{{0,8}},89}, {{{0,8}},25}, {{{0,9}},147},
+ {{{83,7}},59}, {{{0,8}},121}, {{{0,8}},57}, {{{0,9}},211},
+ {{{81,7}},17}, {{{0,8}},105}, {{{0,8}},41}, {{{0,9}},179},
+ {{{0,8}},9}, {{{0,8}},137}, {{{0,8}},73}, {{{0,9}},243},
+ {{{80,7}},4}, {{{0,8}},85}, {{{0,8}},21}, {{{80,8}},258},
+ {{{83,7}},43}, {{{0,8}},117}, {{{0,8}},53}, {{{0,9}},203},
+ {{{81,7}},13}, {{{0,8}},101}, {{{0,8}},37}, {{{0,9}},171},
+ {{{0,8}},5}, {{{0,8}},133}, {{{0,8}},69}, {{{0,9}},235},
+ {{{80,7}},8}, {{{0,8}},93}, {{{0,8}},29}, {{{0,9}},155},
+ {{{84,7}},83}, {{{0,8}},125}, {{{0,8}},61}, {{{0,9}},219},
+ {{{82,7}},23}, {{{0,8}},109}, {{{0,8}},45}, {{{0,9}},187},
+ {{{0,8}},13}, {{{0,8}},141}, {{{0,8}},77}, {{{0,9}},251},
+ {{{80,7}},3}, {{{0,8}},83}, {{{0,8}},19}, {{{85,8}},195},
+ {{{83,7}},35}, {{{0,8}},115}, {{{0,8}},51}, {{{0,9}},199},
+ {{{81,7}},11}, {{{0,8}},99}, {{{0,8}},35}, {{{0,9}},167},
+ {{{0,8}},3}, {{{0,8}},131}, {{{0,8}},67}, {{{0,9}},231},
+ {{{80,7}},7}, {{{0,8}},91}, {{{0,8}},27}, {{{0,9}},151},
+ {{{84,7}},67}, {{{0,8}},123}, {{{0,8}},59}, {{{0,9}},215},
+ {{{82,7}},19}, {{{0,8}},107}, {{{0,8}},43}, {{{0,9}},183},
+ {{{0,8}},11}, {{{0,8}},139}, {{{0,8}},75}, {{{0,9}},247},
+ {{{80,7}},5}, {{{0,8}},87}, {{{0,8}},23}, {{{192,8}},0},
+ {{{83,7}},51}, {{{0,8}},119}, {{{0,8}},55}, {{{0,9}},207},
+ {{{81,7}},15}, {{{0,8}},103}, {{{0,8}},39}, {{{0,9}},175},
+ {{{0,8}},7}, {{{0,8}},135}, {{{0,8}},71}, {{{0,9}},239},
+ {{{80,7}},9}, {{{0,8}},95}, {{{0,8}},31}, {{{0,9}},159},
+ {{{84,7}},99}, {{{0,8}},127}, {{{0,8}},63}, {{{0,9}},223},
+ {{{82,7}},27}, {{{0,8}},111}, {{{0,8}},47}, {{{0,9}},191},
+ {{{0,8}},15}, {{{0,8}},143}, {{{0,8}},79}, {{{0,9}},255}
+ };
+const inflate_huft fixed_td[] = {
+ {{{80,5}},1}, {{{87,5}},257}, {{{83,5}},17}, {{{91,5}},4097},
+ {{{81,5}},5}, {{{89,5}},1025}, {{{85,5}},65}, {{{93,5}},16385},
+ {{{80,5}},3}, {{{88,5}},513}, {{{84,5}},33}, {{{92,5}},8193},
+ {{{82,5}},9}, {{{90,5}},2049}, {{{86,5}},129}, {{{192,5}},24577},
+ {{{80,5}},2}, {{{87,5}},385}, {{{83,5}},25}, {{{91,5}},6145},
+ {{{81,5}},7}, {{{89,5}},1537}, {{{85,5}},97}, {{{93,5}},24577},
+ {{{80,5}},4}, {{{88,5}},769}, {{{84,5}},49}, {{{92,5}},12289},
+ {{{82,5}},13}, {{{90,5}},3073}, {{{86,5}},193}, {{{192,5}},24577}
+ };
+
+
+
+
+
+
+
+// copy as much as possible from the sliding window to the output area
+int inflate_flush(inflate_blocks_statef *s,z_streamp z,int r)
+{
+ uInt n;
+ Byte *p;
+ Byte *q;
+
+ // local copies of source and destination pointers
+ p = z->next_out;
+ q = s->read;
+
+ // compute number of bytes to copy as far as end of window
+ n = (uInt)((q <= s->write ? s->write : s->end) - q);
+ if (n > z->avail_out) n = z->avail_out;
+ if (n && r == Z_BUF_ERROR) r = Z_OK;
+
+ // update counters
+ z->avail_out -= n;
+ z->total_out += n;
+
+ // update check information
+ if (s->checkfn != Z_NULL)
+ z->adler = s->check = (*s->checkfn)(s->check, q, n);
+
+ // copy as far as end of window
+ if (n!=0) // check for n!=0 to avoid waking up CodeGuard
+ { memcpy(p, q, n);
+ p += n;
+ q += n;
+ }
+
+ // see if more to copy at beginning of window
+ if (q == s->end)
+ {
+ // wrap pointers
+ q = s->window;
+ if (s->write == s->end)
+ s->write = s->window;
+
+ // compute bytes to copy
+ n = (uInt)(s->write - q);
+ if (n > z->avail_out) n = z->avail_out;
+ if (n && r == Z_BUF_ERROR) r = Z_OK;
+
+ // update counters
+ z->avail_out -= n;
+ z->total_out += n;
+
+ // update check information
+ if (s->checkfn != Z_NULL)
+ z->adler = s->check = (*s->checkfn)(s->check, q, n);
+
+ // copy
+ memcpy(p, q, n);
+ p += n;
+ q += n;
+ }
+
+ // update pointers
+ z->next_out = p;
+ s->read = q;
+
+ // done
+ return r;
+}
+
+
+
+
+
+
+// simplify the use of the inflate_huft type with some defines
+#define exop word.what.Exop
+#define bits word.what.Bits
+
+typedef enum { // waiting for "i:"=input, "o:"=output, "x:"=nothing
+ START, // x: set up for LEN
+ LEN, // i: get length/literal/eob next
+ LENEXT, // i: getting length extra (have base)
+ DIST, // i: get distance next
+ DISTEXT, // i: getting distance extra
+ COPY, // o: copying bytes in window, waiting for space
+ LIT, // o: got literal, waiting for output space
+ WASH, // o: got eob, possibly still output waiting
+ END, // x: got eob and all data flushed
+ BADCODE} // x: got error
+inflate_codes_mode;
+
+// inflate codes private state
+struct inflate_codes_state {
+
+ // mode
+ inflate_codes_mode mode; // current inflate_codes mode
+
+ // mode dependent information
+ uInt len;
+ union {
+ struct {
+ const inflate_huft *tree; // pointer into tree
+ uInt need; // bits needed
+ } code; // if LEN or DIST, where in tree
+ uInt lit; // if LIT, literal
+ struct {
+ uInt get; // bits to get for extra
+ uInt dist; // distance back to copy from
+ } copy; // if EXT or COPY, where and how much
+ } sub; // submode
+
+ // mode independent information
+ Byte lbits; // ltree bits decoded per branch
+ Byte dbits; // dtree bits decoder per branch
+ const inflate_huft *ltree; // literal/length/eob tree
+ const inflate_huft *dtree; // distance tree
+
+};
+
+
+inflate_codes_statef *inflate_codes_new(
+uInt bl, uInt bd,
+const inflate_huft *tl,
+const inflate_huft *td, // need separate declaration for Borland C++
+z_streamp z)
+{
+ inflate_codes_statef *c;
+
+ if ((c = (inflate_codes_statef *)
+ ZALLOC(z,1,sizeof(struct inflate_codes_state))) != Z_NULL)
+ {
+ c->mode = START;
+ c->lbits = (Byte)bl;
+ c->dbits = (Byte)bd;
+ c->ltree = tl;
+ c->dtree = td;
+ Tracev((stderr, "inflate: codes new\n"));
+ }
+ return c;
+}
+
+
+int inflate_codes(inflate_blocks_statef *s, z_streamp z, int r)
+{
+ uInt j; // temporary storage
+ const inflate_huft *t; // temporary pointer
+ uInt e; // extra bits or operation
+ uLong b; // bit buffer
+ uInt k; // bits in bit buffer
+ Byte *p; // input data pointer
+ uInt n; // bytes available there
+ Byte *q; // output window write pointer
+ uInt m; // bytes to end of window or read pointer
+ Byte *f; // pointer to copy strings from
+ inflate_codes_statef *c = s->sub.decode.codes; // codes state
+
+ // copy input/output information to locals (UPDATE macro restores)
+ LOAD
+
+ // process input and output based on current state
+ for(;;) switch (c->mode)
+ { // waiting for "i:"=input, "o:"=output, "x:"=nothing
+ case START: // x: set up for LEN
+#ifndef SLOW
+ if (m >= 258 && n >= 10)
+ {
+ UPDATE
+ r = inflate_fast(c->lbits, c->dbits, c->ltree, c->dtree, s, z);
+ LOAD
+ if (r != Z_OK)
+ {
+ c->mode = r == Z_STREAM_END ? WASH : BADCODE;
+ break;
+ }
+ }
+#endif // !SLOW
+ c->sub.code.need = c->lbits;
+ c->sub.code.tree = c->ltree;
+ c->mode = LEN;
+ case LEN: // i: get length/literal/eob next
+ j = c->sub.code.need;
+ NEEDBITS(j)
+ t = c->sub.code.tree + ((uInt)b & inflate_mask[j]);
+ DUMPBITS(t->bits)
+ e = (uInt)(t->exop);
+ if (e == 0) // literal
+ {
+ c->sub.lit = t->base;
+ 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 = (uInt)(q - s->window) < c->sub.copy.dist ?
+ s->end - (c->sub.copy.dist - (q - s->window)) :
+ q - c->sub.copy.dist;
+ while (c->len)
+ {
+ NEEDOUT
+ OUTBYTE(*f++)
+ if (f == s->end)
+ f = s->window;
+ c->len--;
+ }
+ c->mode = START;
+ break;
+ case LIT: // o: got literal, waiting for output space
+ NEEDOUT
+ OUTBYTE(c->sub.lit)
+ c->mode = START;
+ break;
+ case WASH: // o: got eob, possibly more output
+ if (k > 7) // return unused byte, if any
+ {
+ Assert(k < 16, "inflate_codes grabbed too many bytes");
+ k -= 8;
+ n++;
+ p--; // can always return one
+ }
+ FLUSH
+ if (s->read != s->write)
+ LEAVE
+ c->mode = END;
+ case END:
+ r = Z_STREAM_END;
+ LEAVE
+ case BADCODE: // x: got error
+ r = Z_DATA_ERROR;
+ LEAVE
+ default:
+ r = Z_STREAM_ERROR;
+ LEAVE
+ }
+}
+
+
+void inflate_codes_free(inflate_codes_statef *c,z_streamp z)
+{ ZFREE(z, c);
+ Tracev((stderr, "inflate: codes free\n"));
+}
+
+
+
+// infblock.c -- interpret and process block types to last block
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+
+//struct inflate_codes_state {int dummy;}; // for buggy compilers
+
+
+
+// Table for deflate from PKZIP's appnote.txt.
+const uInt border[] = { // Order of the bit length code lengths
+ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15};
+
+//
+// Notes beyond the 1.93a appnote.txt:
+//
+// 1. Distance pointers never point before the beginning of the output stream.
+// 2. Distance pointers can point back across blocks, up to 32k away.
+// 3. There is an implied maximum of 7 bits for the bit length table and
+// 15 bits for the actual data.
+// 4. If only one code exists, then it is encoded using one bit. (Zero
+// would be more efficient, but perhaps a little confusing.) If two
+// codes exist, they are coded using one bit each (0 and 1).
+// 5. There is no way of sending zero distance codes--a dummy must be
+// sent if there are none. (History: a pre 2.0 version of PKZIP would
+// store blocks with no distance codes, but this was discovered to be
+// too harsh a criterion.) Valid only for 1.93a. 2.04c does allow
+// zero distance codes, which is sent as one code of zero bits in
+// length.
+// 6. There are up to 286 literal/length codes. Code 256 represents the
+// end-of-block. Note however that the static length tree defines
+// 288 codes just to fill out the Huffman codes. Codes 286 and 287
+// cannot be used though, since there is no length base or extra bits
+// defined for them. Similarily, there are up to 30 distance codes.
+// However, static trees define 32 codes (all 5 bits) to fill out the
+// Huffman codes, but the last two had better not show up in the data.
+// 7. Unzip can check dynamic Huffman blocks for complete code sets.
+// The exception is that a single code would not be complete (see #4).
+// 8. The five bits following the block type is really the number of
+// literal codes sent minus 257.
+// 9. Length codes 8,16,16 are interpreted as 13 length codes of 8 bits
+// (1+6+6). Therefore, to output three times the length, you output
+// three codes (1+1+1), whereas to output four times the same length,
+// you only need two codes (1+3). Hmm.
+//10. In the tree reconstruction algorithm, Code = Code + Increment
+// only if BitLength(i) is not zero. (Pretty obvious.)
+//11. Correction: 4 Bits: # of Bit Length codes - 4 (4 - 19)
+//12. Note: length code 284 can represent 227-258, but length code 285
+// really is 258. The last length deserves its own, short code
+// since it gets used a lot in very redundant files. The length
+// 258 is special since 258 - 3 (the min match length) is 255.
+//13. The literal/length and distance code bit lengths are read as a
+// single stream of lengths. It is possible (and advantageous) for
+// a repeat code (16, 17, or 18) to go across the boundary between
+// the two sets of lengths.
+
+
+void inflate_blocks_reset(inflate_blocks_statef *s, z_streamp z, uLong *c)
+{
+ if (c != Z_NULL)
+ *c = s->check;
+ if (s->mode == IBM_BTREE || s->mode == IBM_DTREE)
+ ZFREE(z, s->sub.trees.blens);
+ if (s->mode == IBM_CODES)
+ inflate_codes_free(s->sub.decode.codes, z);
+ s->mode = IBM_TYPE;
+ s->bitk = 0;
+ s->bitb = 0;
+ s->read = s->write = s->window;
+ if (s->checkfn != Z_NULL)
+ z->adler = s->check = (*s->checkfn)(0L, (const Byte *)Z_NULL, 0);
+ Tracev((stderr, "inflate: blocks reset\n"));
+}
+
+
+inflate_blocks_statef *inflate_blocks_new(z_streamp z, check_func c, uInt w)
+{
+ inflate_blocks_statef *s;
+
+ if ((s = (inflate_blocks_statef *)ZALLOC
+ (z,1,sizeof(struct inflate_blocks_state))) == Z_NULL)
+ return s;
+ if ((s->hufts =
+ (inflate_huft *)ZALLOC(z, sizeof(inflate_huft), MANY)) == Z_NULL)
+ {
+ ZFREE(z, s);
+ return Z_NULL;
+ }
+ if ((s->window = (Byte *)ZALLOC(z, 1, w)) == Z_NULL)
+ {
+ ZFREE(z, s->hufts);
+ ZFREE(z, s);
+ return Z_NULL;
+ }
+ s->end = s->window + w;
+ s->checkfn = c;
+ s->mode = IBM_TYPE;
+ Tracev((stderr, "inflate: blocks allocated\n"));
+ inflate_blocks_reset(s, z, Z_NULL);
+ return s;
+}
+
+
+int inflate_blocks(inflate_blocks_statef *s, z_streamp z, int r)
+{
+ uInt t; // temporary storage
+ uLong b; // bit buffer
+ uInt k; // bits in bit buffer
+ Byte *p; // input data pointer
+ uInt n; // bytes available there
+ Byte *q; // output window write pointer
+ uInt m; // bytes to end of window or read pointer
+
+ // copy input/output information to locals (UPDATE macro restores)
+ LOAD
+
+ // process input based on current state
+ for(;;) switch (s->mode)
+ {
+ case IBM_TYPE:
+ NEEDBITS(3)
+ t = (uInt)b & 7;
+ s->last = t & 1;
+ switch (t >> 1)
+ {
+ case 0: // stored
+ Tracev((stderr, "inflate: stored block%s\n",
+ s->last ? " (last)" : ""));
+ DUMPBITS(3)
+ t = k & 7; // go to byte boundary
+ DUMPBITS(t)
+ s->mode = IBM_LENS; // get length of stored block
+ break;
+ case 1: // fixed
+ Tracev((stderr, "inflate: fixed codes block%s\n",
+ s->last ? " (last)" : ""));
+ {
+ uInt bl, bd;
+ const inflate_huft *tl, *td;
+
+ inflate_trees_fixed(&bl, &bd, &tl, &td, z);
+ s->sub.decode.codes = inflate_codes_new(bl, bd, tl, td, z);
+ if (s->sub.decode.codes == Z_NULL)
+ {
+ r = Z_MEM_ERROR;
+ LEAVE
+ }
+ }
+ DUMPBITS(3)
+ s->mode = IBM_CODES;
+ break;
+ case 2: // dynamic
+ Tracev((stderr, "inflate: dynamic codes block%s\n",
+ s->last ? " (last)" : ""));
+ DUMPBITS(3)
+ s->mode = IBM_TABLE;
+ break;
+ case 3: // illegal
+ DUMPBITS(3)
+ s->mode = IBM_BAD;
+ z->msg = (char*)"invalid block type";
+ r = Z_DATA_ERROR;
+ LEAVE
+ }
+ break;
+ case IBM_LENS:
+ NEEDBITS(32)
+ if ((((~b) >> 16) & 0xffff) != (b & 0xffff))
+ {
+ s->mode = IBM_BAD;
+ z->msg = (char*)"invalid stored block lengths";
+ r = Z_DATA_ERROR;
+ LEAVE
+ }
+ s->sub.left = (uInt)b & 0xffff;
+ b = k = 0; // dump bits
+ Tracev((stderr, "inflate: stored length %u\n", s->sub.left));
+ s->mode = s->sub.left ? IBM_STORED : (s->last ? IBM_DRY : IBM_TYPE);
+ break;
+ case IBM_STORED:
+ if (n == 0)
+ LEAVE
+ NEEDOUT
+ t = s->sub.left;
+ if (t > n) t = n;
+ if (t > m) t = m;
+ memcpy(q, p, t);
+ p += t; n -= t;
+ q += t; m -= t;
+ if ((s->sub.left -= t) != 0)
+ break;
+ 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 ? IBM_DRY : IBM_TYPE;
+ break;
+ case IBM_TABLE:
+ NEEDBITS(14)
+ s->sub.trees.table = t = (uInt)b & 0x3fff;
+ // remove this section to workaround bug in pkzip
+ if ((t & 0x1f) > 29 || ((t >> 5) & 0x1f) > 29)
+ {
+ s->mode = IBM_BAD;
+ z->msg = (char*)"too many length or distance symbols";
+ r = Z_DATA_ERROR;
+ LEAVE
+ }
+ // end remove
+ t = 258 + (t & 0x1f) + ((t >> 5) & 0x1f);
+ if ((s->sub.trees.blens = (uInt*)ZALLOC(z, t, sizeof(uInt))) == Z_NULL)
+ {
+ r = Z_MEM_ERROR;
+ LEAVE
+ }
+ DUMPBITS(14)
+ s->sub.trees.index = 0;
+ Tracev((stderr, "inflate: table sizes ok\n"));
+ s->mode = IBM_BTREE;
+ case IBM_BTREE:
+ while (s->sub.trees.index < 4 + (s->sub.trees.table >> 10))
+ {
+ NEEDBITS(3)
+ s->sub.trees.blens[border[s->sub.trees.index++]] = (uInt)b & 7;
+ DUMPBITS(3)
+ }
+ while (s->sub.trees.index < 19)
+ s->sub.trees.blens[border[s->sub.trees.index++]] = 0;
+ s->sub.trees.bb = 7;
+ t = inflate_trees_bits(s->sub.trees.blens, &s->sub.trees.bb,
+ &s->sub.trees.tb, s->hufts, z);
+ if (t != Z_OK)
+ {
+ ZFREE(z, s->sub.trees.blens);
+ r = t;
+ if (r == Z_DATA_ERROR)
+ s->mode = IBM_BAD;
+ LEAVE
+ }
+ s->sub.trees.index = 0;
+ Tracev((stderr, "inflate: bits tree ok\n"));
+ s->mode = IBM_DTREE;
+ case IBM_DTREE:
+ while (t = s->sub.trees.table,
+ s->sub.trees.index < 258 + (t & 0x1f) + ((t >> 5) & 0x1f))
+ {
+ inflate_huft *h;
+ uInt i, j, c;
+
+ t = s->sub.trees.bb;
+ NEEDBITS(t)
+ h = s->sub.trees.tb + ((uInt)b & inflate_mask[t]);
+ t = h->bits;
+ c = h->base;
+ if (c < 16)
+ {
+ DUMPBITS(t)
+ s->sub.trees.blens[s->sub.trees.index++] = c;
+ }
+ else // c == 16..18
+ {
+ i = c == 18 ? 7 : c - 14;
+ j = c == 18 ? 11 : 3;
+ NEEDBITS(t + i)
+ DUMPBITS(t)
+ j += (uInt)b & inflate_mask[i];
+ DUMPBITS(i)
+ i = s->sub.trees.index;
+ t = s->sub.trees.table;
+ if (i + j > 258 + (t & 0x1f) + ((t >> 5) & 0x1f) ||
+ (c == 16 && i < 1))
+ {
+ ZFREE(z, s->sub.trees.blens);
+ s->mode = IBM_BAD;
+ z->msg = (char*)"invalid bit length repeat";
+ r = Z_DATA_ERROR;
+ LEAVE
+ }
+ c = c == 16 ? s->sub.trees.blens[i - 1] : 0;
+ do {
+ s->sub.trees.blens[i++] = c;
+ } while (--j);
+ s->sub.trees.index = i;
+ }
+ }
+ s->sub.trees.tb = Z_NULL;
+ {
+ uInt bl, bd;
+ inflate_huft *tl, *td;
+ inflate_codes_statef *c;
+
+ bl = 9; // must be <= 9 for lookahead assumptions
+ bd = 6; // must be <= 9 for lookahead assumptions
+ t = s->sub.trees.table;
+ t = inflate_trees_dynamic(257 + (t & 0x1f), 1 + ((t >> 5) & 0x1f),
+ s->sub.trees.blens, &bl, &bd, &tl, &td,
+ s->hufts, z);
+ ZFREE(z, s->sub.trees.blens);
+ if (t != Z_OK)
+ {
+ if (t == (uInt)Z_DATA_ERROR)
+ s->mode = IBM_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;
+ }
+ s->mode = IBM_CODES;
+ case IBM_CODES:
+ UPDATE
+ if ((r = inflate_codes(s, z, r)) != Z_STREAM_END)
+ return inflate_flush(s, z, r);
+ r = Z_OK;
+ inflate_codes_free(s->sub.decode.codes, z);
+ LOAD
+ 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 = IBM_TYPE;
+ break;
+ }
+ s->mode = IBM_DRY;
+ case IBM_DRY:
+ FLUSH
+ if (s->read != s->write)
+ LEAVE
+ s->mode = IBM_DONE;
+ case IBM_DONE:
+ r = Z_STREAM_END;
+ LEAVE
+ case IBM_BAD:
+ r = Z_DATA_ERROR;
+ LEAVE
+ default:
+ r = Z_STREAM_ERROR;
+ LEAVE
+ }
+}
+
+
+int inflate_blocks_free(inflate_blocks_statef *s, z_streamp z)
+{
+ inflate_blocks_reset(s, z, Z_NULL);
+ ZFREE(z, s->window);
+ ZFREE(z, s->hufts);
+ ZFREE(z, s);
+ Tracev((stderr, "inflate: blocks freed\n"));
+ return Z_OK;
+}
+
+
+
+// inftrees.c -- generate Huffman trees for efficient decoding
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+//
+
+
+
+extern const char inflate_copyright[] =
+ " ";//inflate 1.1.3 Copyright 1995-1998 Mark Adler ";
+// If you use the zlib library in a product, an acknowledgment is welcome
+// in the documentation of your product. If for some reason you cannot
+// include such an acknowledgment, I would appreciate that you keep this
+// copyright string in the executable of your product.
+
+
+
+int huft_build (
+ uInt *, // code lengths in bits
+ uInt, // number of codes
+ uInt, // number of "simple" codes
+ const uInt *, // list of base values for non-simple codes
+ const uInt *, // list of extra bits for non-simple codes
+ inflate_huft **,// result: starting table
+ uInt *, // maximum lookup bits (returns actual)
+ inflate_huft *, // space for trees
+ uInt *, // hufts used in space
+ uInt * ); // space for values
+
+// Tables for deflate from PKZIP's appnote.txt.
+const uInt cplens[31] = { // Copy lengths for literal codes 257..285
+ 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,
+ 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0};
+ // see note #13 above about 258
+const uInt cplext[31] = { // Extra bits for literal codes 257..285
+ 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2,
+ 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 0, 112, 112}; // 112==invalid
+const uInt cpdist[30] = { // Copy offsets for distance codes 0..29
+ 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,
+ 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,
+ 8193, 12289, 16385, 24577};
+const uInt cpdext[30] = { // Extra bits for distance codes
+ 0, 0, 0, 0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6,
+ 7, 7, 8, 8, 9, 9, 10, 10, 11, 11,
+ 12, 12, 13, 13};
+
+//
+// Huffman code decoding is performed using a multi-level table lookup.
+// The fastest way to decode is to simply build a lookup table whose
+// size is determined by the longest code. However, the time it takes
+// to build this table can also be a factor if the data being decoded
+// is not very long. The most common codes are necessarily the
+// shortest codes, so those codes dominate the decoding time, and hence
+// the speed. The idea is you can have a shorter table that decodes the
+// shorter, more probable codes, and then point to subsidiary tables for
+// the longer codes. The time it costs to decode the longer codes is
+// then traded against the time it takes to make longer tables.
+//
+// This results of this trade are in the variables lbits and dbits
+// below. lbits is the number of bits the first level table for literal/
+// length codes can decode in one step, and dbits is the same thing for
+// the distance codes. Subsequent tables are also less than or equal to
+// those sizes. These values may be adjusted either when all of the
+// codes are shorter than that, in which case the longest code length in
+// bits is used, or when the shortest code is *longer* than the requested
+// table size, in which case the length of the shortest code in bits is
+// used.
+//
+// There are two different values for the two tables, since they code a
+// different number of possibilities each. The literal/length table
+// codes 286 possible values, or in a flat code, a little over eight
+// bits. The distance table codes 30 possible values, or a little less
+// than five bits, flat. The optimum values for speed end up being
+// about one bit more than those, so lbits is 8+1 and dbits is 5+1.
+// The optimum values may differ though from machine to machine, and
+// possibly even between compilers. Your mileage may vary.
+//
+
+
+// If BMAX needs to be larger than 16, then h and x[] should be uLong.
+#define BMAX 15 // maximum bit length of any code
+
+int huft_build(
+uInt *b, // code lengths in bits (all assumed <= BMAX)
+uInt n, // number of codes (assumed <= 288)
+uInt s, // number of simple-valued codes (0..s-1)
+const uInt *d, // list of base values for non-simple codes
+const uInt *e, // list of extra bits for non-simple codes
+inflate_huft * *t, // result: starting table
+uInt *m, // maximum lookup bits, returns actual
+inflate_huft *hp, // space for trees
+uInt *hn, // hufts used in space
+uInt *v) // working area: values in order of bit length
+// Given a list of code lengths and a maximum table size, make a set of
+// tables to decode that set of codes. Return Z_OK on success, Z_BUF_ERROR
+// if the given code set is incomplete (the tables are still built in this
+// case), Z_DATA_ERROR if the input is invalid (an over-subscribed set of
+// lengths), or Z_MEM_ERROR if not enough memory.
+{
+
+ uInt a; // counter for codes of length k
+ uInt c[BMAX+1]; // bit length count table
+ uInt f; // i repeats in table every f entries
+ int g; // maximum code length
+ int h; // table level
+ register uInt i; // counter, current code
+ register uInt j; // counter
+ register int k; // number of bits in current code
+ int l; // bits per table (returned in m)
+ uInt mask; // (1 << w) - 1, to avoid cc -O bug on HP
+ register uInt *p; // pointer into c[], b[], or v[]
+ inflate_huft *q; // points to current table
+ struct inflate_huft_s r; // table entry for structure assignment
+ inflate_huft *u[BMAX]; // table stack
+ register int w; // bits before this table == (l * h)
+ uInt x[BMAX+1]; // bit offsets, then code stack
+ uInt *xp; // pointer into x
+ int y; // number of dummy codes added
+ uInt z; // number of entries in current table
+
+
+ // Generate counts for each bit length
+ p = c;
+#define C0 *p++ = 0;
+#define C2 C0 C0 C0 C0
+#define C4 C2 C2 C2 C2
+ C4; p; // clear c[]--assume BMAX+1 is 16
+ p = b; i = n;
+ do {
+ c[*p++]++; // assume all entries <= BMAX
+ } while (--i);
+ if (c[0] == n) // null input--all zero length codes
+ {
+ *t = (inflate_huft *)Z_NULL;
+ *m = 0;
+ return Z_OK;
+ }
+
+
+ // Find minimum and maximum length, bound *m by those
+ l = *m;
+ for (j = 1; j <= BMAX; j++)
+ if (c[j])
+ break;
+ k = j; // minimum code length
+ if ((uInt)l < j)
+ l = j;
+ for (i = BMAX; i; i--)
+ if (c[i])
+ break;
+ g = i; // maximum code length
+ if ((uInt)l > i)
+ l = i;
+ *m = l;
+
+
+ // Adjust last length count to fill out codes, if needed
+ for (y = 1 << j; j < i; j++, y <<= 1)
+ if ((y -= c[j]) < 0)
+ return Z_DATA_ERROR;
+ if ((y -= c[i]) < 0)
+ return Z_DATA_ERROR;
+ c[i] += y;
+
+
+ // Generate starting offsets into the value table for each length
+ x[1] = j = 0;
+ p = c + 1; xp = x + 2;
+ while (--i) { // note that i == g from above
+ *xp++ = (j += *p++);
+ }
+
+
+ // Make a table of values in order of bit lengths
+ p = b; i = 0;
+ do {
+ if ((j = *p++) != 0)
+ v[x[j]++] = i;
+ } while (++i < n);
+ n = x[g]; // set n to length of v
+
+
+ // Generate the Huffman codes and for each, make the table entries
+ x[0] = i = 0; // first Huffman code is zero
+ p = v; // grab values in bit order
+ h = -1; // no tables yet--level -1
+ w = -l; // bits decoded == (l * h)
+ u[0] = (inflate_huft *)Z_NULL; // just to keep compilers happy
+ q = (inflate_huft *)Z_NULL; // ditto
+ z = 0; // ditto
+
+ // go through the bit lengths (k already is bits in shortest code)
+ for (; k <= g; k++)
+ {
+ a = c[k];
+ while (a--)
+ {
+ // here i is the Huffman code of length k bits for value *p
+ // make tables up to required level
+ while (k > w + l)
+ {
+ h++;
+ w += l; // previous table always l bits
+
+ // compute minimum size table less than or equal to l bits
+ z = g - w;
+ z = z > (uInt)l ? l : z; // table size upper limit
+ if ((f = 1 << (j = k - w)) > a + 1) // try a k-w bit table
+ { // too few codes for k-w bit table
+ f -= a + 1; // deduct codes from patterns left
+ xp = c + k;
+ if (j < z)
+ while (++j < z) // try smaller tables up to z bits
+ {
+ if ((f <<= 1) <= *++xp)
+ break; // enough codes to use up j bits
+ f -= *xp; // else deduct codes from patterns
+ }
+ }
+ z = 1 << j; // table entries for j-bit table
+
+ // allocate new table
+ if (*hn + z > MANY) // (note: doesn't matter for fixed)
+ return Z_MEM_ERROR; // not enough memory
+ u[h] = q = hp + *hn;
+ *hn += z;
+
+ // connect to last table, if there is one
+ if (h)
+ {
+ x[h] = i; // save pattern for backing up
+ r.bits = (Byte)l; // bits to dump before this table
+ r.exop = (Byte)j; // bits in this table
+ j = i >> (w - l);
+ r.base = (uInt)(q - u[h-1] - j); // offset to this table
+ u[h-1][j] = r; // connect to last table
+ }
+ else
+ *t = q; // first table is returned result
+ }
+
+ // set up table entry in r
+ r.bits = (Byte)(k - w);
+ if (p >= v + n)
+ r.exop = 128 + 64; // out of values--invalid code
+ else if (*p < s)
+ {
+ r.exop = (Byte)(*p < 256 ? 0 : 32 + 64); // 256 is end-of-block
+ r.base = *p++; // simple code is just the value
+ }
+ else
+ {
+ r.exop = (Byte)(e[*p - s] + 16 + 64);// non-simple--look up in lists
+ r.base = d[*p++ - s];
+ }
+
+ // fill code-like entries with r
+ f = 1 << (k - w);
+ for (j = i >> w; j < z; j += f)
+ q[j] = r;
+
+ // backwards increment the k-bit code i
+ for (j = 1 << (k - 1); i & j; j >>= 1)
+ i ^= j;
+ i ^= j;
+
+ // backup over finished tables
+ mask = (1 << w) - 1; // needed on HP, cc -O bug
+ while ((i & mask) != x[h])
+ {
+ h--; // don't need to update q
+ w -= l;
+ mask = (1 << w) - 1;
+ }
+ }
+ }
+
+
+ // Return Z_BUF_ERROR if we were given an incomplete table
+ return y != 0 && g != 1 ? Z_BUF_ERROR : Z_OK;
+}
+
+
+int inflate_trees_bits(
+uInt *c, // 19 code lengths
+uInt *bb, // bits tree desired/actual depth
+inflate_huft * *tb, // bits tree result
+inflate_huft *hp, // space for trees
+z_streamp z) // for messages
+{
+ int r;
+ uInt hn = 0; // hufts used in space
+ uInt *v; // work area for huft_build
+
+ if ((v = (uInt*)ZALLOC(z, 19, sizeof(uInt))) == Z_NULL)
+ return Z_MEM_ERROR;
+ r = huft_build(c, 19, 19, (uInt*)Z_NULL, (uInt*)Z_NULL,
+ tb, bb, hp, &hn, v);
+ if (r == Z_DATA_ERROR)
+ z->msg = (char*)"oversubscribed dynamic bit lengths tree";
+ else if (r == Z_BUF_ERROR || *bb == 0)
+ {
+ z->msg = (char*)"incomplete dynamic bit lengths tree";
+ r = Z_DATA_ERROR;
+ }
+ ZFREE(z, v);
+ return r;
+}
+
+
+int inflate_trees_dynamic(
+uInt nl, // number of literal/length codes
+uInt nd, // number of distance codes
+uInt *c, // that many (total) code lengths
+uInt *bl, // literal desired/actual bit depth
+uInt *bd, // distance desired/actual bit depth
+inflate_huft * *tl, // literal/length tree result
+inflate_huft * *td, // distance tree result
+inflate_huft *hp, // space for trees
+z_streamp z) // for messages
+{
+ int r;
+ uInt hn = 0; // hufts used in space
+ uInt *v; // work area for huft_build
+
+ // allocate work area
+ if ((v = (uInt*)ZALLOC(z, 288, sizeof(uInt))) == Z_NULL)
+ return Z_MEM_ERROR;
+
+ // build literal/length tree
+ r = huft_build(c, nl, 257, cplens, cplext, tl, bl, hp, &hn, v);
+ if (r != Z_OK || *bl == 0)
+ {
+ if (r == Z_DATA_ERROR)
+ z->msg = (char*)"oversubscribed literal/length tree";
+ else if (r != Z_MEM_ERROR)
+ {
+ z->msg = (char*)"incomplete literal/length tree";
+ r = Z_DATA_ERROR;
+ }
+ ZFREE(z, v);
+ return r;
+ }
+
+ // build distance tree
+ r = huft_build(c + nl, nd, 0, cpdist, cpdext, td, bd, hp, &hn, v);
+ if (r != Z_OK || (*bd == 0 && nl > 257))
+ {
+ if (r == Z_DATA_ERROR)
+ z->msg = (char*)"oversubscribed distance tree";
+ else if (r == Z_BUF_ERROR) {
+ z->msg = (char*)"incomplete distance tree";
+ r = Z_DATA_ERROR;
+ }
+ else if (r != Z_MEM_ERROR)
+ {
+ z->msg = (char*)"empty distance tree with lengths";
+ r = Z_DATA_ERROR;
+ }
+ ZFREE(z, v);
+ return r;
+ }
+
+ // done
+ ZFREE(z, v);
+ return Z_OK;
+}
+
+
+
+
+
+int inflate_trees_fixed(
+uInt *bl, // literal desired/actual bit depth
+uInt *bd, // distance desired/actual bit depth
+const inflate_huft * * tl, // literal/length tree result
+const inflate_huft * *td, // distance tree result
+z_streamp ) // for memory allocation
+{
+ *bl = fixed_bl;
+ *bd = fixed_bd;
+ *tl = fixed_tl;
+ *td = fixed_td;
+ return Z_OK;
+}
+
+
+// inffast.c -- process literals and length/distance pairs fast
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+//
+
+
+//struct inflate_codes_state {int dummy;}; // for buggy compilers
+
+
+// macros for bit input with no checking and for returning unused bytes
+#define GRABBITS(j) {while(k<(j)){b|=((uLong)NEXTBYTE)<avail_in-n;c=(k>>3)>3:c;n+=c;p-=c;k-=c<<3;}
+
+// Called with number of bytes left to write in window at least 258
+// (the maximum string length) and number of input bytes available
+// at least ten. The ten bytes are six bytes for the longest length/
+// distance pair plus four bytes for overloading the bit buffer.
+
+int inflate_fast(
+uInt bl, uInt bd,
+const inflate_huft *tl,
+const inflate_huft *td, // need separate declaration for Borland C++
+inflate_blocks_statef *s,
+z_streamp z)
+{
+ const inflate_huft *t; // temporary pointer
+ uInt e; // extra bits or operation
+ uLong b; // bit buffer
+ uInt k; // bits in bit buffer
+ Byte *p; // input data pointer
+ uInt n; // bytes available there
+ Byte *q; // output window write pointer
+ uInt m; // bytes to end of window or read pointer
+ uInt ml; // mask for literal/length tree
+ uInt md; // mask for distance tree
+ uInt c; // bytes to copy
+ uInt d; // distance back to copy from
+ Byte *r; // copy source pointer
+
+ // load input, output, bit values
+ LOAD
+
+ // initialize masks
+ ml = inflate_mask[bl];
+ md = inflate_mask[bd];
+
+ // do until not enough input or output space for fast loop
+ do { // assume called with m >= 258 && n >= 10
+ // get literal/length code
+ GRABBITS(20) // max bits for literal/length code
+ if ((e = (t = tl + ((uInt)b & ml))->exop) == 0)
+ {
+ DUMPBITS(t->bits)
+ 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;
+ }
+ for (;;) {
+ 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;
+ for (;;) {
+ DUMPBITS(t->bits)
+ if (e & 16)
+ {
+ // get extra bits to add to distance base
+ e &= 15;
+ GRABBITS(e) // get extra bits (up to 13)
+ d = t->base + ((uInt)b & inflate_mask[e]);
+ DUMPBITS(e)
+ Tracevv((stderr, "inflate: * distance %u\n", d));
+
+ // do the copy
+ m -= c;
+ if ((uInt)(q - s->window) >= d) // offset before dest
+ { // just copy
+ r = q - d;
+ *q++ = *r++; c--; // minimum count is three,
+ *q++ = *r++; c--; // so unroll loop a little
+ }
+ else // else offset after destination
+ {
+ e = d - (uInt)(q - s->window); // bytes from offset to end
+ r = s->end - e; // pointer to offset
+ if (c > e) // if source crosses,
+ {
+ c -= e; // copy to end of window
+ do {
+ *q++ = *r++;
+ } while (--e);
+ r = s->window; // copy rest from start of window
+ }
+ }
+ do { // copy all or what's left
+ *q++ = *r++;
+ } while (--c);
+ break;
+ }
+ else if ((e & 64) == 0)
+ {
+ t += t->base;
+ e = (t += ((uInt)b & inflate_mask[e]))->exop;
+ }
+ else
+ {
+ z->msg = (char*)"invalid distance code";
+ UNGRAB
+ UPDATE
+ return Z_DATA_ERROR;
+ }
+ };
+ break;
+ }
+ if ((e & 64) == 0)
+ {
+ t += t->base;
+ if ((e = (t += ((uInt)b & inflate_mask[e]))->exop) == 0)
+ {
+ DUMPBITS(t->bits)
+ 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 (m >= 258 && n >= 10);
+
+ // not enough input or output--restore pointers and return
+ UNGRAB
+ UPDATE
+ return Z_OK;
+}
+
+
+
+
+
+
+// crc32.c -- compute the CRC-32 of a data stream
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+
+// @(#) $Id$
+
+
+
+
+
+
+// Table of CRC-32's of all single-byte values (made by make_crc_table)
+const uLong crc_table[256] = {
+ 0x00000000L, 0x77073096L, 0xee0e612cL, 0x990951baL, 0x076dc419L,
+ 0x706af48fL, 0xe963a535L, 0x9e6495a3L, 0x0edb8832L, 0x79dcb8a4L,
+ 0xe0d5e91eL, 0x97d2d988L, 0x09b64c2bL, 0x7eb17cbdL, 0xe7b82d07L,
+ 0x90bf1d91L, 0x1db71064L, 0x6ab020f2L, 0xf3b97148L, 0x84be41deL,
+ 0x1adad47dL, 0x6ddde4ebL, 0xf4d4b551L, 0x83d385c7L, 0x136c9856L,
+ 0x646ba8c0L, 0xfd62f97aL, 0x8a65c9ecL, 0x14015c4fL, 0x63066cd9L,
+ 0xfa0f3d63L, 0x8d080df5L, 0x3b6e20c8L, 0x4c69105eL, 0xd56041e4L,
+ 0xa2677172L, 0x3c03e4d1L, 0x4b04d447L, 0xd20d85fdL, 0xa50ab56bL,
+ 0x35b5a8faL, 0x42b2986cL, 0xdbbbc9d6L, 0xacbcf940L, 0x32d86ce3L,
+ 0x45df5c75L, 0xdcd60dcfL, 0xabd13d59L, 0x26d930acL, 0x51de003aL,
+ 0xc8d75180L, 0xbfd06116L, 0x21b4f4b5L, 0x56b3c423L, 0xcfba9599L,
+ 0xb8bda50fL, 0x2802b89eL, 0x5f058808L, 0xc60cd9b2L, 0xb10be924L,
+ 0x2f6f7c87L, 0x58684c11L, 0xc1611dabL, 0xb6662d3dL, 0x76dc4190L,
+ 0x01db7106L, 0x98d220bcL, 0xefd5102aL, 0x71b18589L, 0x06b6b51fL,
+ 0x9fbfe4a5L, 0xe8b8d433L, 0x7807c9a2L, 0x0f00f934L, 0x9609a88eL,
+ 0xe10e9818L, 0x7f6a0dbbL, 0x086d3d2dL, 0x91646c97L, 0xe6635c01L,
+ 0x6b6b51f4L, 0x1c6c6162L, 0x856530d8L, 0xf262004eL, 0x6c0695edL,
+ 0x1b01a57bL, 0x8208f4c1L, 0xf50fc457L, 0x65b0d9c6L, 0x12b7e950L,
+ 0x8bbeb8eaL, 0xfcb9887cL, 0x62dd1ddfL, 0x15da2d49L, 0x8cd37cf3L,
+ 0xfbd44c65L, 0x4db26158L, 0x3ab551ceL, 0xa3bc0074L, 0xd4bb30e2L,
+ 0x4adfa541L, 0x3dd895d7L, 0xa4d1c46dL, 0xd3d6f4fbL, 0x4369e96aL,
+ 0x346ed9fcL, 0xad678846L, 0xda60b8d0L, 0x44042d73L, 0x33031de5L,
+ 0xaa0a4c5fL, 0xdd0d7cc9L, 0x5005713cL, 0x270241aaL, 0xbe0b1010L,
+ 0xc90c2086L, 0x5768b525L, 0x206f85b3L, 0xb966d409L, 0xce61e49fL,
+ 0x5edef90eL, 0x29d9c998L, 0xb0d09822L, 0xc7d7a8b4L, 0x59b33d17L,
+ 0x2eb40d81L, 0xb7bd5c3bL, 0xc0ba6cadL, 0xedb88320L, 0x9abfb3b6L,
+ 0x03b6e20cL, 0x74b1d29aL, 0xead54739L, 0x9dd277afL, 0x04db2615L,
+ 0x73dc1683L, 0xe3630b12L, 0x94643b84L, 0x0d6d6a3eL, 0x7a6a5aa8L,
+ 0xe40ecf0bL, 0x9309ff9dL, 0x0a00ae27L, 0x7d079eb1L, 0xf00f9344L,
+ 0x8708a3d2L, 0x1e01f268L, 0x6906c2feL, 0xf762575dL, 0x806567cbL,
+ 0x196c3671L, 0x6e6b06e7L, 0xfed41b76L, 0x89d32be0L, 0x10da7a5aL,
+ 0x67dd4accL, 0xf9b9df6fL, 0x8ebeeff9L, 0x17b7be43L, 0x60b08ed5L,
+ 0xd6d6a3e8L, 0xa1d1937eL, 0x38d8c2c4L, 0x4fdff252L, 0xd1bb67f1L,
+ 0xa6bc5767L, 0x3fb506ddL, 0x48b2364bL, 0xd80d2bdaL, 0xaf0a1b4cL,
+ 0x36034af6L, 0x41047a60L, 0xdf60efc3L, 0xa867df55L, 0x316e8eefL,
+ 0x4669be79L, 0xcb61b38cL, 0xbc66831aL, 0x256fd2a0L, 0x5268e236L,
+ 0xcc0c7795L, 0xbb0b4703L, 0x220216b9L, 0x5505262fL, 0xc5ba3bbeL,
+ 0xb2bd0b28L, 0x2bb45a92L, 0x5cb36a04L, 0xc2d7ffa7L, 0xb5d0cf31L,
+ 0x2cd99e8bL, 0x5bdeae1dL, 0x9b64c2b0L, 0xec63f226L, 0x756aa39cL,
+ 0x026d930aL, 0x9c0906a9L, 0xeb0e363fL, 0x72076785L, 0x05005713L,
+ 0x95bf4a82L, 0xe2b87a14L, 0x7bb12baeL, 0x0cb61b38L, 0x92d28e9bL,
+ 0xe5d5be0dL, 0x7cdcefb7L, 0x0bdbdf21L, 0x86d3d2d4L, 0xf1d4e242L,
+ 0x68ddb3f8L, 0x1fda836eL, 0x81be16cdL, 0xf6b9265bL, 0x6fb077e1L,
+ 0x18b74777L, 0x88085ae6L, 0xff0f6a70L, 0x66063bcaL, 0x11010b5cL,
+ 0x8f659effL, 0xf862ae69L, 0x616bffd3L, 0x166ccf45L, 0xa00ae278L,
+ 0xd70dd2eeL, 0x4e048354L, 0x3903b3c2L, 0xa7672661L, 0xd06016f7L,
+ 0x4969474dL, 0x3e6e77dbL, 0xaed16a4aL, 0xd9d65adcL, 0x40df0b66L,
+ 0x37d83bf0L, 0xa9bcae53L, 0xdebb9ec5L, 0x47b2cf7fL, 0x30b5ffe9L,
+ 0xbdbdf21cL, 0xcabac28aL, 0x53b39330L, 0x24b4a3a6L, 0xbad03605L,
+ 0xcdd70693L, 0x54de5729L, 0x23d967bfL, 0xb3667a2eL, 0xc4614ab8L,
+ 0x5d681b02L, 0x2a6f2b94L, 0xb40bbe37L, 0xc30c8ea1L, 0x5a05df1bL,
+ 0x2d02ef8dL
+};
+
+const uLong * get_crc_table()
+{ return (const uLong *)crc_table;
+}
+
+#define CRC_DO1(buf) crc = crc_table[((int)crc ^ (*buf++)) & 0xff] ^ (crc >> 8);
+#define CRC_DO2(buf) CRC_DO1(buf); CRC_DO1(buf);
+#define CRC_DO4(buf) CRC_DO2(buf); CRC_DO2(buf);
+#define CRC_DO8(buf) CRC_DO4(buf); CRC_DO4(buf);
+
+uLong ucrc32(uLong crc, const Byte *buf, uInt len)
+{ if (buf == Z_NULL) return 0L;
+ crc = crc ^ 0xffffffffL;
+ while (len >= 8) {CRC_DO8(buf); len -= 8;}
+ if (len) do {CRC_DO1(buf);} while (--len);
+ return crc ^ 0xffffffffL;
+}
+
+
+// adler32.c -- compute the Adler-32 checksum of a data stream
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+
+// @(#) $Id$
+
+
+#define BASE 65521L // largest prime smaller than 65536
+#define NMAX 5552
+// NMAX is the largest n such that 255n(n+1)/2 + (n+1)(BASE-1) <= 2^32-1
+
+#define AD_DO1(buf,i) {s1 += buf[i]; s2 += s1;}
+#define AD_DO2(buf,i) AD_DO1(buf,i); AD_DO1(buf,i+1);
+#define AD_DO4(buf,i) AD_DO2(buf,i); AD_DO2(buf,i+2);
+#define AD_DO8(buf,i) AD_DO4(buf,i); AD_DO4(buf,i+4);
+#define AD_DO16(buf) AD_DO8(buf,0); AD_DO8(buf,8);
+
+// =========================================================================
+uLong adler32(uLong adler, const Byte *buf, uInt len)
+{
+ unsigned long s1 = adler & 0xffff;
+ unsigned long s2 = (adler >> 16) & 0xffff;
+ int k;
+
+ if (buf == Z_NULL) return 1L;
+
+ while (len > 0) {
+ k = len < NMAX ? len : NMAX;
+ len -= k;
+ while (k >= 16) {
+ AD_DO16(buf);
+ buf += 16;
+ k -= 16;
+ }
+ if (k != 0) do {
+ s1 += *buf++;
+ s2 += s1;
+ } while (--k);
+ s1 %= BASE;
+ s2 %= BASE;
+ }
+ return (s2 << 16) | s1;
+}
+
+
+
+// zutil.c -- target dependent utility functions for the compression library
+// Copyright (C) 1995-1998 Jean-loup Gailly.
+// For conditions of distribution and use, see copyright notice in zlib.h
+// @(#) $Id$
+
+
+
+
+
+
+const char * zlibVersion()
+{
+ return ZLIB_VERSION;
+}
+
+// exported to allow conversion of error code to string for compress() and
+// uncompress()
+const char * zError(int err)
+{ return ERR_MSG(err);
+}
+
+
+
+
+voidpf zcalloc (voidpf opaque, unsigned items, unsigned size)
+{
+ if (opaque) items += size - size; // make compiler happy
+ return (voidpf)calloc(items, size);
+}
+
+void zcfree (voidpf opaque, voidpf ptr)
+{
+ zfree(ptr);
+ if (opaque) return; // make compiler happy
+}
+
+
+
+// inflate.c -- zlib interface to inflate modules
+// Copyright (C) 1995-1998 Mark Adler
+// For conditions of distribution and use, see copyright notice in zlib.h
+
+//struct inflate_blocks_state {int dummy;}; // for buggy compilers
+
+typedef enum {
+ IM_METHOD, // waiting for method byte
+ IM_FLAG, // waiting for flag byte
+ IM_DICT4, // four dictionary check bytes to go
+ IM_DICT3, // three dictionary check bytes to go
+ IM_DICT2, // two dictionary check bytes to go
+ IM_DICT1, // one dictionary check byte to go
+ IM_DICT0, // waiting for inflateSetDictionary
+ IM_BLOCKS, // decompressing blocks
+ IM_CHECK4, // four check bytes to go
+ IM_CHECK3, // three check bytes to go
+ IM_CHECK2, // two check bytes to go
+ IM_CHECK1, // one check byte to go
+ IM_DONE, // finished check, done
+ IM_BAD} // got an error--stay here
+inflate_mode;
+
+// inflate private state
+struct internal_state {
+
+ // mode
+ inflate_mode mode; // current inflate mode
+
+ // mode dependent information
+ union {
+ uInt method; // if IM_FLAGS, method byte
+ struct {
+ uLong was; // computed check value
+ uLong need; // stream check value
+ } check; // if CHECK, check values to compare
+ uInt marker; // if IM_BAD, inflateSync's marker bytes count
+ } sub; // submode
+
+ // mode independent information
+ int nowrap; // flag for no wrapper
+ uInt wbits; // log2(window size) (8..15, defaults to 15)
+ inflate_blocks_statef
+ *blocks; // current inflate_blocks state
+
+};
+
+int inflateReset(z_streamp z)
+{
+ if (z == Z_NULL || z->state == Z_NULL)
+ return Z_STREAM_ERROR;
+ z->total_in = z->total_out = 0;
+ z->msg = Z_NULL;
+ z->state->mode = z->state->nowrap ? IM_BLOCKS : IM_METHOD;
+ inflate_blocks_reset(z->state->blocks, z, Z_NULL);
+ Tracev((stderr, "inflate: reset\n"));
+ return Z_OK;
+}
+
+int inflateEnd(z_streamp z)
+{
+ if (z == Z_NULL || z->state == Z_NULL || z->zfree == Z_NULL)
+ return Z_STREAM_ERROR;
+ if (z->state->blocks != Z_NULL)
+ inflate_blocks_free(z->state->blocks, z);
+ ZFREE(z, z->state);
+ z->state = Z_NULL;
+ Tracev((stderr, "inflate: end\n"));
+ return Z_OK;
+}
+
+
+int inflateInit2(z_streamp z)
+{ const char *version = ZLIB_VERSION; int stream_size = sizeof(z_stream);
+ if (version == Z_NULL || version[0] != ZLIB_VERSION[0] || stream_size != sizeof(z_stream)) return Z_VERSION_ERROR;
+
+ int w = -15; // MAX_WBITS: 32K LZ77 window.
+ // Warning: reducing MAX_WBITS makes minigzip unable to extract .gz files created by gzip.
+ // The memory requirements for deflate are (in bytes):
+ // (1 << (windowBits+2)) + (1 << (memLevel+9))
+ // that is: 128K for windowBits=15 + 128K for memLevel = 8 (default values)
+ // plus a few kilobytes for small objects. For example, if you want to reduce
+ // the default memory requirements from 256K to 128K, compile with
+ // make CFLAGS="-O -DMAX_WBITS=14 -DMAX_MEM_LEVEL=7"
+ // Of course this will generally degrade compression (there's no free lunch).
+ //
+ // The memory requirements for inflate are (in bytes) 1 << windowBits
+ // that is, 32K for windowBits=15 (default value) plus a few kilobytes
+ // for small objects.
+
+ // initialize state
+ if (z == Z_NULL) return Z_STREAM_ERROR;
+ z->msg = Z_NULL;
+ if (z->zalloc == Z_NULL)
+ {
+ z->zalloc = zcalloc;
+ z->opaque = (voidpf)0;
+ }
+ if (z->zfree == Z_NULL) z->zfree = zcfree;
+ if ((z->state = (struct internal_state *)
+ ZALLOC(z,1,sizeof(struct internal_state))) == Z_NULL)
+ return Z_MEM_ERROR;
+ z->state->blocks = Z_NULL;
+
+ // handle undocumented nowrap option (no zlib header or check)
+ z->state->nowrap = 0;
+ if (w < 0)
+ {
+ w = - w;
+ z->state->nowrap = 1;
+ }
+
+ // set window size
+ if (w < 8 || w > 15)
+ {
+ inflateEnd(z);
+ return Z_STREAM_ERROR;
+ }
+ z->state->wbits = (uInt)w;
+
+ // create inflate_blocks state
+ if ((z->state->blocks =
+ inflate_blocks_new(z, z->state->nowrap ? Z_NULL : adler32, (uInt)1 << w))
+ == Z_NULL)
+ {
+ inflateEnd(z);
+ return Z_MEM_ERROR;
+ }
+ Tracev((stderr, "inflate: allocated\n"));
+
+ // reset state
+ inflateReset(z);
+ return Z_OK;
+}
+
+
+
+#define IM_NEEDBYTE {if(z->avail_in==0)return r;r=f;}
+#define IM_NEXTBYTE (z->avail_in--,z->total_in++,*z->next_in++)
+
+int inflate(z_streamp z, int f)
+{
+ int r;
+ uInt b;
+
+ if (z == Z_NULL || z->state == Z_NULL || z->next_in == Z_NULL)
+ return Z_STREAM_ERROR;
+ f = f == Z_FINISH ? Z_BUF_ERROR : Z_OK;
+ r = Z_BUF_ERROR;
+ for (;;) switch (z->state->mode)
+ {
+ case IM_METHOD:
+ IM_NEEDBYTE
+ if (((z->state->sub.method = IM_NEXTBYTE) & 0xf) != Z_DEFLATED)
+ {
+ z->state->mode = IM_BAD;
+ z->msg = (char*)"unknown compression method";
+ z->state->sub.marker = 5; // can't try inflateSync
+ break;
+ }
+ if ((z->state->sub.method >> 4) + 8 > z->state->wbits)
+ {
+ z->state->mode = IM_BAD;
+ z->msg = (char*)"invalid window size";
+ z->state->sub.marker = 5; // can't try inflateSync
+ break;
+ }
+ z->state->mode = IM_FLAG;
+ case IM_FLAG:
+ IM_NEEDBYTE
+ b = IM_NEXTBYTE;
+ if (((z->state->sub.method << 8) + b) % 31)
+ {
+ z->state->mode = IM_BAD;
+ z->msg = (char*)"incorrect header check";
+ z->state->sub.marker = 5; // can't try inflateSync
+ break;
+ }
+ Tracev((stderr, "inflate: zlib header ok\n"));
+ if (!(b & PRESET_DICT))
+ {
+ z->state->mode = IM_BLOCKS;
+ break;
+ }
+ z->state->mode = IM_DICT4;
+ case IM_DICT4:
+ IM_NEEDBYTE
+ z->state->sub.check.need = (uLong)IM_NEXTBYTE << 24;
+ z->state->mode = IM_DICT3;
+ case IM_DICT3:
+ IM_NEEDBYTE
+ z->state->sub.check.need += (uLong)IM_NEXTBYTE << 16;
+ z->state->mode = IM_DICT2;
+ case IM_DICT2:
+ IM_NEEDBYTE
+ z->state->sub.check.need += (uLong)IM_NEXTBYTE << 8;
+ z->state->mode = IM_DICT1;
+ case IM_DICT1:
+ IM_NEEDBYTE; r;
+ z->state->sub.check.need += (uLong)IM_NEXTBYTE;
+ z->adler = z->state->sub.check.need;
+ z->state->mode = IM_DICT0;
+ return Z_NEED_DICT;
+ case IM_DICT0:
+ z->state->mode = IM_BAD;
+ z->msg = (char*)"need dictionary";
+ z->state->sub.marker = 0; // can try inflateSync
+ return Z_STREAM_ERROR;
+ case IM_BLOCKS:
+ r = inflate_blocks(z->state->blocks, z, r);
+ if (r == Z_DATA_ERROR)
+ {
+ z->state->mode = IM_BAD;
+ z->state->sub.marker = 0; // can try inflateSync
+ break;
+ }
+ if (r == Z_OK)
+ r = f;
+ if (r != Z_STREAM_END)
+ return r;
+ r = f;
+ inflate_blocks_reset(z->state->blocks, z, &z->state->sub.check.was);
+ if (z->state->nowrap)
+ {
+ z->state->mode = IM_DONE;
+ break;
+ }
+ z->state->mode = IM_CHECK4;
+ case IM_CHECK4:
+ IM_NEEDBYTE
+ z->state->sub.check.need = (uLong)IM_NEXTBYTE << 24;
+ z->state->mode = IM_CHECK3;
+ case IM_CHECK3:
+ IM_NEEDBYTE
+ z->state->sub.check.need += (uLong)IM_NEXTBYTE << 16;
+ z->state->mode = IM_CHECK2;
+ case IM_CHECK2:
+ IM_NEEDBYTE
+ z->state->sub.check.need += (uLong)IM_NEXTBYTE << 8;
+ z->state->mode = IM_CHECK1;
+ case IM_CHECK1:
+ IM_NEEDBYTE
+ z->state->sub.check.need += (uLong)IM_NEXTBYTE;
+
+ if (z->state->sub.check.was != z->state->sub.check.need)
+ {
+ z->state->mode = IM_BAD;
+ z->msg = (char*)"incorrect data check";
+ z->state->sub.marker = 5; // can't try inflateSync
+ break;
+ }
+ Tracev((stderr, "inflate: zlib check ok\n"));
+ z->state->mode = IM_DONE;
+ case IM_DONE:
+ return Z_STREAM_END;
+ case IM_BAD:
+ return Z_DATA_ERROR;
+ default:
+ return Z_STREAM_ERROR;
+ }
+}
+
+
+
+#ifdef _UNICODE
+
+static int GetAnsiFileName(LPCWSTR name, char * buf, int nBufSize)
+{
+ memset(buf, 0, nBufSize);
+
+ int n = WideCharToMultiByte(CP_ACP, // code page
+ 0, // performance and mapping flags
+ name, // wide-character string
+ -1, // number of chars in string
+ buf, // buffer for new string
+ nBufSize, // size of buffer
+ NULL, // default for unmappable chars
+ NULL); // set when default char used
+ return n;
+}
+
+static int GetUnicodeFileName(const char * name, LPWSTR buf, int nBufSize)
+{
+ memset(buf, 0, nBufSize*sizeof(TCHAR));
+
+ int n = MultiByteToWideChar(CP_ACP, // code page
+ 0, // character-type options
+ name, // string to map
+ -1, // number of bytes in string
+ buf, // wide-character buffer
+ nBufSize); // size of buffer
+
+ return n;
+}
+
+#endif
+
+
+// unzip.c -- IO on .zip files using zlib
+// Version 0.15 beta, Mar 19th, 1998,
+// Read unzip.h for more info
+
+
+
+
+#define UNZ_BUFSIZE (16384)
+#define UNZ_MAXFILENAMEINZIP (256)
+#define SIZECENTRALDIRITEM (0x2e)
+#define SIZEZIPLOCALHEADER (0x1e)
+
+
+
+
+const char unz_copyright[] = " ";//unzip 0.15 Copyright 1998 Gilles Vollant ";
+
+// unz_file_info_interntal contain internal info about a file in zipfile
+typedef struct unz_file_info_internal_s
+{
+ uLong offset_curfile;// relative offset of local header 4 bytes
+} unz_file_info_internal;
+
+
+typedef struct
+{ bool is_handle; // either a handle or memory
+ bool canseek;
+ // for handles:
+ HANDLE h; bool herr; unsigned long initial_offset;
+ // for memory:
+ void *buf; unsigned int len,pos; // if it's a memory block
+} LUFILE;
+
+
+LUFILE *lufopen(void *z,unsigned int len,DWORD flags,ZRESULT *err)
+{
+ if (flags!=ZIP_HANDLE && flags!=ZIP_FILENAME && flags!=ZIP_MEMORY)
+ {
+ *err=ZR_ARGS;
+ return NULL;
+ }
+ //
+ HANDLE h=0; bool canseek=false; *err=ZR_OK;
+ if (flags==ZIP_HANDLE||flags==ZIP_FILENAME)
+ {
+ if (flags==ZIP_HANDLE)
+ {
+ HANDLE hf = z;
+
+ BOOL res = DuplicateHandle(GetCurrentProcess(),hf,GetCurrentProcess(),&h,0,FALSE,DUPLICATE_SAME_ACCESS);
+
+ if (!res)
+ {
+ *err=ZR_NODUPH;
+ return NULL;
+ }
+ }
+ else
+ {
+ h = CreateFile((const TCHAR *)z, GENERIC_READ, FILE_SHARE_READ,
+ NULL, OPEN_EXISTING, FILE_ATTRIBUTE_NORMAL, NULL);
+
+ if (h == INVALID_HANDLE_VALUE)
+ {
+ *err = ZR_NOFILE;
+ return NULL;
+ }
+ }
+ DWORD type = GetFileType(h);
+ canseek = (type==FILE_TYPE_DISK);
+ }
+ LUFILE *lf = new LUFILE;
+ if (flags==ZIP_HANDLE||flags==ZIP_FILENAME)
+ {
+ lf->is_handle=true;
+ lf->canseek=canseek;
+ lf->h=h; lf->herr=false;
+ lf->initial_offset=0;
+ if (canseek)
+ lf->initial_offset = SetFilePointer(h,0,NULL,FILE_CURRENT);
+ }
+ else
+ {
+ lf->is_handle=false;
+ lf->canseek=true;
+ lf->buf=z;
+ lf->len=len;
+ lf->pos=0;
+ lf->initial_offset=0;
+ }
+ *err=ZR_OK;
+ return lf;
+}
+
+
+int lufclose(LUFILE *stream)
+{ if (stream==NULL) return EOF;
+ if (stream->is_handle) CloseHandle(stream->h);
+ delete stream;
+ return 0;
+}
+
+int luferror(LUFILE *stream)
+{ if (stream->is_handle && stream->herr) return 1;
+ else return 0;
+}
+
+long int luftell(LUFILE *stream)
+{ if (stream->is_handle && stream->canseek) return SetFilePointer(stream->h,0,NULL,FILE_CURRENT)-stream->initial_offset;
+ else if (stream->is_handle) return 0;
+ else return stream->pos;
+}
+
+int lufseek(LUFILE *stream, long offset, int whence)
+{ if (stream->is_handle && stream->canseek)
+ { if (whence==SEEK_SET) SetFilePointer(stream->h,stream->initial_offset+offset,0,FILE_BEGIN);
+ else if (whence==SEEK_CUR) SetFilePointer(stream->h,offset,NULL,FILE_CURRENT);
+ else if (whence==SEEK_END) SetFilePointer(stream->h,offset,NULL,FILE_END);
+ else return 19; // EINVAL
+ return 0;
+ }
+ else if (stream->is_handle) return 29; // ESPIPE
+ else
+ { if (whence==SEEK_SET) stream->pos=offset;
+ else if (whence==SEEK_CUR) stream->pos+=offset;
+ else if (whence==SEEK_END) stream->pos=stream->len+offset;
+ return 0;
+ }
+}
+
+
+size_t lufread(void *ptr,size_t size,size_t n,LUFILE *stream)
+{ unsigned int toread = (unsigned int)(size*n);
+ if (stream->is_handle)
+ { DWORD red; BOOL res = ReadFile(stream->h,ptr,toread,&red,NULL);
+ if (!res) stream->herr=true;
+ return red/size;
+ }
+ if (stream->pos+toread > stream->len) toread = stream->len-stream->pos;
+ memcpy(ptr, (char*)stream->buf + stream->pos, toread); DWORD red = toread;
+ stream->pos += red;
+ return red/size;
+}
+
+
+
+
+// file_in_zip_read_info_s contain internal information about a file in zipfile,
+// when reading and decompress it
+typedef struct
+{
+ char *read_buffer; // internal buffer for compressed data
+ z_stream stream; // zLib stream structure for inflate
+
+ uLong pos_in_zipfile; // position in byte on the zipfile, for fseek
+ uLong stream_initialised; // flag set if stream structure is initialised
+
+ uLong offset_local_extrafield;// offset of the local extra field
+ uInt size_local_extrafield;// size of the local extra field
+ uLong pos_local_extrafield; // position in the local extra field in read
+
+ uLong crc32; // crc32 of all data uncompressed
+ uLong crc32_wait; // crc32 we must obtain after decompress all
+ uLong rest_read_compressed; // number of byte to be decompressed
+ uLong rest_read_uncompressed;//number of byte to be obtained after decomp
+ LUFILE* file; // io structore of the zipfile
+ uLong compression_method; // compression method (0==store)
+ uLong byte_before_the_zipfile;// byte before the zipfile, (>0 for sfx)
+} file_in_zip_read_info_s;
+
+
+// unz_s contain internal information about the zipfile
+typedef struct
+{
+ LUFILE* file; // io structore of the zipfile
+ unz_global_info gi; // public global information
+ uLong byte_before_the_zipfile;// byte before the zipfile, (>0 for sfx)
+ uLong num_file; // number of the current file in the zipfile
+ uLong pos_in_central_dir; // pos of the current file in the central dir
+ uLong current_file_ok; // flag about the usability of the current file
+ uLong central_pos; // position of the beginning of the central dir
+
+ uLong size_central_dir; // size of the central directory
+ uLong offset_central_dir; // offset of start of central directory with respect to the starting disk number
+
+ unz_file_info cur_file_info; // public info about the current file in zip
+ unz_file_info_internal cur_file_info_internal; // private info about it
+ file_in_zip_read_info_s* pfile_in_zip_read; // structure about the current file if we are decompressing it
+} unz_s, *unzFile;
+
+
+int unzStringFileNameCompare (const char* fileName1,const char* fileName2,int iCaseSensitivity);
+// Compare two filename (fileName1,fileName2).
+
+z_off_t unztell (unzFile file);
+// Give the current position in uncompressed data
+
+int unzeof (unzFile file);
+// return 1 if the end of file was reached, 0 elsewhere
+
+int unzGetLocalExtrafield (unzFile file, voidp buf, unsigned len);
+// Read extra field from the current file (opened by unzOpenCurrentFile)
+// This is the local-header version of the extra field (sometimes, there is
+// more info in the local-header version than in the central-header)
+//
+// if buf==NULL, it return the size of the local extra field
+//
+// if buf!=NULL, len is the size of the buffer, the extra header is copied in
+// buf.
+// the return value is the number of bytes copied in buf, or (if <0)
+// the error code
+
+
+
+// ===========================================================================
+// Read a byte from a gz_stream; update next_in and avail_in. Return EOF
+// for end of file.
+// IN assertion: the stream s has been sucessfully opened for reading.
+
+int unzlocal_getByte(LUFILE *fin,int *pi)
+{ unsigned char c;
+ int err = (int)lufread(&c, 1, 1, fin);
+ if (err==1)
+ { *pi = (int)c;
+ return UNZ_OK;
+ }
+ else
+ { if (luferror(fin)) return UNZ_ERRNO;
+ else return UNZ_EOF;
+ }
+}
+
+
+// ===========================================================================
+// Reads a long in LSB order from the given gz_stream. Sets
+int unzlocal_getShort (LUFILE *fin,uLong *pX)
+{
+ uLong x ;
+ int i;
+ int err;
+
+ err = unzlocal_getByte(fin,&i);
+ x = (uLong)i;
+
+ if (err==UNZ_OK)
+ err = unzlocal_getByte(fin,&i);
+ x += ((uLong)i)<<8;
+
+ if (err==UNZ_OK)
+ *pX = x;
+ else
+ *pX = 0;
+ return err;
+}
+
+int unzlocal_getLong (LUFILE *fin,uLong *pX)
+{
+ uLong x ;
+ int i;
+ int err;
+
+ err = unzlocal_getByte(fin,&i);
+ x = (uLong)i;
+
+ if (err==UNZ_OK)
+ err = unzlocal_getByte(fin,&i);
+ x += ((uLong)i)<<8;
+
+ if (err==UNZ_OK)
+ err = unzlocal_getByte(fin,&i);
+ x += ((uLong)i)<<16;
+
+ if (err==UNZ_OK)
+ err = unzlocal_getByte(fin,&i);
+ x += ((uLong)i)<<24;
+
+ if (err==UNZ_OK)
+ *pX = x;
+ else
+ *pX = 0;
+ return err;
+}
+
+
+// My own strcmpi / strcasecmp
+int strcmpcasenosensitive_internal (const char* fileName1,const char *fileName2)
+{
+ for (;;)
+ {
+ char c1=*(fileName1++);
+ char c2=*(fileName2++);
+ if ((c1>='a') && (c1<='z'))
+ c1 -= (char)0x20;
+ if ((c2>='a') && (c2<='z'))
+ c2 -= (char)0x20;
+ if (c1=='\0')
+ return ((c2=='\0') ? 0 : -1);
+ if (c2=='\0')
+ return 1;
+ if (c1c2)
+ return 1;
+ }
+}
+
+
+
+
+//
+// Compare two filename (fileName1,fileName2).
+// If iCaseSenisivity = 1, comparision is case sensitivity (like strcmp)
+// If iCaseSenisivity = 2, comparision is not case sensitivity (like strcmpi or strcasecmp)
+//
+int unzStringFileNameCompare (const char*fileName1,const char*fileName2,int iCaseSensitivity)
+{ if (iCaseSensitivity==1) return strcmp(fileName1,fileName2);
+ else return strcmpcasenosensitive_internal(fileName1,fileName2);
+}
+
+#define BUFREADCOMMENT (0x400)
+
+
+// Locate the Central directory of a zipfile (at the end, just before
+// the global comment)
+uLong unzlocal_SearchCentralDir(LUFILE *fin)
+{ if (lufseek(fin,0,SEEK_END) != 0) return 0;
+ uLong uSizeFile = luftell(fin);
+
+ uLong uMaxBack=0xffff; // maximum size of global comment
+ if (uMaxBack>uSizeFile) uMaxBack = uSizeFile;
+
+ unsigned char *buf = (unsigned char*)zmalloc(BUFREADCOMMENT+4);
+ if (buf==NULL) return 0;
+ uLong uPosFound=0;
+
+ uLong uBackRead = 4;
+ while (uBackReaduMaxBack) uBackRead = uMaxBack;
+ else uBackRead+=BUFREADCOMMENT;
+ uReadPos = uSizeFile-uBackRead ;
+ uReadSize = ((BUFREADCOMMENT+4) < (uSizeFile-uReadPos)) ? (BUFREADCOMMENT+4) : (uSizeFile-uReadPos);
+ if (lufseek(fin,uReadPos,SEEK_SET)!=0) break;
+ if (lufread(buf,(uInt)uReadSize,1,fin)!=1) break;
+ for (i=(int)uReadSize-3; (i--)>0;)
+ { if (((*(buf+i))==0x50) && ((*(buf+i+1))==0x4b) && ((*(buf+i+2))==0x05) && ((*(buf+i+3))==0x06))
+ { uPosFound = uReadPos+i; break;
+ }
+ }
+ if (uPosFound!=0) break;
+ }
+ if (buf) zfree(buf);
+ return uPosFound;
+}
+
+
+int unzGoToFirstFile (unzFile file);
+int unzCloseCurrentFile (unzFile file);
+
+// Open a Zip file.
+// If the zipfile cannot be opened (file don't exist or in not valid), return NULL.
+// Otherwise, the return value is a unzFile Handle, usable with other unzip functions
+unzFile unzOpenInternal(LUFILE *fin)
+{
+ zopenerror = ZR_OK; //+++1.2
+ if (fin==NULL) { zopenerror = ZR_ARGS; return NULL; } //+++1.2
+ if (unz_copyright[0]!=' ') {lufclose(fin); zopenerror = ZR_CORRUPT; return NULL; } //+++1.2
+
+ int err=UNZ_OK;
+ unz_s us;
+ uLong central_pos,uL;
+ central_pos = unzlocal_SearchCentralDir(fin);
+ if (central_pos==0) err=UNZ_ERRNO;
+ if (lufseek(fin,central_pos,SEEK_SET)!=0) err=UNZ_ERRNO;
+ // the signature, already checked
+ if (unzlocal_getLong(fin,&uL)!=UNZ_OK) err=UNZ_ERRNO;
+ // number of this disk
+ uLong number_disk; // number of the current dist, used for spanning ZIP, unsupported, always 0
+ if (unzlocal_getShort(fin,&number_disk)!=UNZ_OK) err=UNZ_ERRNO;
+ // number of the disk with the start of the central directory
+ uLong number_disk_with_CD; // number the the disk with central dir, used for spaning ZIP, unsupported, always 0
+ if (unzlocal_getShort(fin,&number_disk_with_CD)!=UNZ_OK) err=UNZ_ERRNO;
+ // total number of entries in the central dir on this disk
+ if (unzlocal_getShort(fin,&us.gi.number_entry)!=UNZ_OK) err=UNZ_ERRNO;
+ // total number of entries in the central dir
+ uLong number_entry_CD; // total number of entries in the central dir (same than number_entry on nospan)
+ if (unzlocal_getShort(fin,&number_entry_CD)!=UNZ_OK) err=UNZ_ERRNO;
+ if ((number_entry_CD!=us.gi.number_entry) || (number_disk_with_CD!=0) || (number_disk!=0)) err=UNZ_BADZIPFILE;
+ // size of the central directory
+ if (unzlocal_getLong(fin,&us.size_central_dir)!=UNZ_OK) err=UNZ_ERRNO;
+ // offset of start of central directory with respect to the starting disk number
+ if (unzlocal_getLong(fin,&us.offset_central_dir)!=UNZ_OK) err=UNZ_ERRNO;
+ // zipfile comment length
+ if (unzlocal_getShort(fin,&us.gi.size_comment)!=UNZ_OK) err=UNZ_ERRNO;
+ if ((central_pos+fin->initial_offsetinitial_offset - (us.offset_central_dir+us.size_central_dir);
+ us.central_pos = central_pos;
+ us.pfile_in_zip_read = NULL;
+ fin->initial_offset = 0; // since the zipfile itself is expected to handle this
+
+ unz_s *s = (unz_s*)zmalloc(sizeof(unz_s));
+ *s=us;
+ unzGoToFirstFile((unzFile)s);
+ return (unzFile)s;
+}
+
+
+
+// Close a ZipFile opened with unzipOpen.
+// If there is files inside the .Zip opened with unzipOpenCurrentFile (see later),
+// these files MUST be closed with unzipCloseCurrentFile before call unzipClose.
+// return UNZ_OK if there is no problem.
+int unzClose (unzFile file)
+{
+ unz_s* s;
+ if (file==NULL)
+ return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+
+ if (s->pfile_in_zip_read!=NULL)
+ unzCloseCurrentFile(file);
+
+ lufclose(s->file);
+ if (s) zfree(s); // unused s=0;
+ return UNZ_OK;
+}
+
+
+// Write info about the ZipFile in the *pglobal_info structure.
+// No preparation of the structure is needed
+// return UNZ_OK if there is no problem.
+int unzGetGlobalInfo (unzFile file,unz_global_info *pglobal_info)
+{
+ unz_s* s;
+ if (file==NULL)
+ return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+ *pglobal_info=s->gi;
+ return UNZ_OK;
+}
+
+
+// Translate date/time from Dos format to tm_unz (readable more easilty)
+void unzlocal_DosDateToTmuDate (uLong ulDosDate, tm_unz* ptm)
+{
+ uLong uDate;
+ uDate = (uLong)(ulDosDate>>16);
+ ptm->tm_mday = (uInt)(uDate&0x1f) ;
+ ptm->tm_mon = (uInt)((((uDate)&0x1E0)/0x20)-1) ;
+ ptm->tm_year = (uInt)(((uDate&0x0FE00)/0x0200)+1980) ;
+
+ ptm->tm_hour = (uInt) ((ulDosDate &0xF800)/0x800);
+ ptm->tm_min = (uInt) ((ulDosDate&0x7E0)/0x20) ;
+ ptm->tm_sec = (uInt) (2*(ulDosDate&0x1f)) ;
+}
+
+// Get Info about the current file in the zipfile, with internal only info
+int unzlocal_GetCurrentFileInfoInternal (unzFile file,
+ unz_file_info *pfile_info,
+ unz_file_info_internal
+ *pfile_info_internal,
+ char *szFileName,
+ uLong fileNameBufferSize,
+ void *extraField,
+ uLong extraFieldBufferSize,
+ char *szComment,
+ uLong commentBufferSize);
+
+int unzlocal_GetCurrentFileInfoInternal (unzFile file, unz_file_info *pfile_info,
+ unz_file_info_internal *pfile_info_internal, char *szFileName,
+ uLong fileNameBufferSize, void *extraField, uLong extraFieldBufferSize,
+ char *szComment, uLong commentBufferSize)
+{
+ unz_s* s;
+ unz_file_info file_info;
+ unz_file_info_internal file_info_internal;
+ int err=UNZ_OK;
+ uLong uMagic;
+ long lSeek=0;
+
+ if (file==NULL)
+ return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+ if (lufseek(s->file,s->pos_in_central_dir+s->byte_before_the_zipfile,SEEK_SET)!=0)
+ err=UNZ_ERRNO;
+
+
+ // we check the magic
+ if (err==UNZ_OK)
+ if (unzlocal_getLong(s->file,&uMagic) != UNZ_OK)
+ err=UNZ_ERRNO;
+ else if (uMagic!=0x02014b50)
+ err=UNZ_BADZIPFILE;
+
+ if (unzlocal_getShort(s->file,&file_info.version) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getShort(s->file,&file_info.version_needed) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getShort(s->file,&file_info.flag) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getShort(s->file,&file_info.compression_method) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getLong(s->file,&file_info.dosDate) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ unzlocal_DosDateToTmuDate(file_info.dosDate,&file_info.tmu_date);
+
+ if (unzlocal_getLong(s->file,&file_info.crc) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getLong(s->file,&file_info.compressed_size) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getLong(s->file,&file_info.uncompressed_size) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getShort(s->file,&file_info.size_filename) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getShort(s->file,&file_info.size_file_extra) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getShort(s->file,&file_info.size_file_comment) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getShort(s->file,&file_info.disk_num_start) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getShort(s->file,&file_info.internal_fa) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getLong(s->file,&file_info.external_fa) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getLong(s->file,&file_info_internal.offset_curfile) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ lSeek+=file_info.size_filename;
+ if ((err==UNZ_OK) && (szFileName!=NULL))
+ {
+ uLong uSizeRead ;
+ if (file_info.size_filename0) && (fileNameBufferSize>0))
+ if (lufread(szFileName,(uInt)uSizeRead,1,s->file)!=1)
+ err=UNZ_ERRNO;
+ lSeek -= uSizeRead;
+ }
+
+
+ if ((err==UNZ_OK) && (extraField!=NULL))
+ {
+ uLong uSizeRead ;
+ if (file_info.size_file_extrafile,lSeek,SEEK_CUR)==0)
+ lSeek=0;
+ else
+ err=UNZ_ERRNO;
+ if ((file_info.size_file_extra>0) && (extraFieldBufferSize>0))
+ if (lufread(extraField,(uInt)uSizeRead,1,s->file)!=1)
+ err=UNZ_ERRNO;
+ lSeek += file_info.size_file_extra - uSizeRead;
+ }
+ else
+ lSeek+=file_info.size_file_extra;
+
+
+ if ((err==UNZ_OK) && (szComment!=NULL))
+ {
+ uLong uSizeRead ;
+ if (file_info.size_file_commentfile,lSeek,SEEK_CUR)==0)
+ {} // unused lSeek=0;
+ else
+ err=UNZ_ERRNO;
+ if ((file_info.size_file_comment>0) && (commentBufferSize>0))
+ if (lufread(szComment,(uInt)uSizeRead,1,s->file)!=1)
+ err=UNZ_ERRNO;
+ //unused lSeek+=file_info.size_file_comment - uSizeRead;
+ }
+ else {} //unused lSeek+=file_info.size_file_comment;
+
+ if ((err==UNZ_OK) && (pfile_info!=NULL))
+ *pfile_info=file_info;
+
+ if ((err==UNZ_OK) && (pfile_info_internal!=NULL))
+ *pfile_info_internal=file_info_internal;
+
+ return err;
+}
+
+
+
+// Write info about the ZipFile in the *pglobal_info structure.
+// No preparation of the structure is needed
+// return UNZ_OK if there is no problem.
+int unzGetCurrentFileInfo (unzFile file, unz_file_info *pfile_info,
+ char *szFileName, uLong fileNameBufferSize, void *extraField, uLong extraFieldBufferSize,
+ char *szComment, uLong commentBufferSize)
+{ return unzlocal_GetCurrentFileInfoInternal(file,pfile_info,NULL,szFileName,fileNameBufferSize,
+ extraField,extraFieldBufferSize, szComment,commentBufferSize);
+}
+
+
+// Set the current file of the zipfile to the first file.
+// return UNZ_OK if there is no problem
+int unzGoToFirstFile (unzFile file)
+{
+ int err;
+ unz_s* s;
+ if (file==NULL) return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+ s->pos_in_central_dir=s->offset_central_dir;
+ s->num_file=0;
+ err=unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info,
+ &s->cur_file_info_internal,
+ NULL,0,NULL,0,NULL,0);
+ s->current_file_ok = (err == UNZ_OK);
+ return err;
+}
+
+
+// Set the current file of the zipfile to the next file.
+// return UNZ_OK if there is no problem
+// return UNZ_END_OF_LIST_OF_FILE if the actual file was the latest.
+int unzGoToNextFile (unzFile file)
+{
+ unz_s* s;
+ int err;
+
+ if (file==NULL)
+ return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+ if (!s->current_file_ok)
+ return UNZ_END_OF_LIST_OF_FILE;
+ if (s->num_file+1==s->gi.number_entry)
+ return UNZ_END_OF_LIST_OF_FILE;
+
+ s->pos_in_central_dir += SIZECENTRALDIRITEM + s->cur_file_info.size_filename +
+ s->cur_file_info.size_file_extra + s->cur_file_info.size_file_comment ;
+ s->num_file++;
+ err = unzlocal_GetCurrentFileInfoInternal(file,&s->cur_file_info,
+ &s->cur_file_info_internal,
+ NULL,0,NULL,0,NULL,0);
+ s->current_file_ok = (err == UNZ_OK);
+ return err;
+}
+
+
+// Try locate the file szFileName in the zipfile.
+// For the iCaseSensitivity signification, see unzStringFileNameCompare
+// return value :
+// UNZ_OK if the file is found. It becomes the current file.
+// UNZ_END_OF_LIST_OF_FILE if the file is not found
+int unzLocateFile (unzFile file, const TCHAR *szFileName, int iCaseSensitivity)
+{
+ unz_s* s;
+ int err;
+
+ uLong num_fileSaved;
+ uLong pos_in_central_dirSaved;
+
+ if (file==NULL)
+ return UNZ_PARAMERROR;
+
+ if (_tcslen(szFileName)>=UNZ_MAXFILENAMEINZIP)
+ return UNZ_PARAMERROR;
+
+ char szFileNameA[MAX_PATH];
+
+#ifdef _UNICODE
+ GetAnsiFileName(szFileName, szFileNameA, MAX_PATH-1);
+#else
+ strcpy(szFileNameA, szFileName);
+#endif
+
+ // support Windows subdirectory by:daviyang35
+ int iLen=strlen(szFileNameA);
+ for (int i=0;icurrent_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,szFileNameA,iCaseSensitivity)==0)
+ return UNZ_OK;
+ err = unzGoToNextFile(file);
+ }
+
+ s->num_file = num_fileSaved ;
+ s->pos_in_central_dir = pos_in_central_dirSaved ;
+ return err;
+}
+
+
+// Read the local header of the current zipfile
+// Check the coherency of the local header and info in the end of central
+// directory about this file
+// store in *piSizeVar the size of extra info in local header
+// (filename and size of extra field data)
+int unzlocal_CheckCurrentFileCoherencyHeader (unz_s *s,uInt *piSizeVar,
+ uLong *poffset_local_extrafield, uInt *psize_local_extrafield)
+{
+ uLong uMagic,uData,uFlags;
+ uLong size_filename;
+ uLong size_extra_field;
+ int err=UNZ_OK;
+
+ *piSizeVar = 0;
+ *poffset_local_extrafield = 0;
+ *psize_local_extrafield = 0;
+
+ if (lufseek(s->file,s->cur_file_info_internal.offset_curfile + s->byte_before_the_zipfile,SEEK_SET)!=0)
+ return UNZ_ERRNO;
+
+
+ if (err==UNZ_OK)
+ if (unzlocal_getLong(s->file,&uMagic) != UNZ_OK)
+ err=UNZ_ERRNO;
+ else if (uMagic!=0x04034b50)
+ err=UNZ_BADZIPFILE;
+
+ if (unzlocal_getShort(s->file,&uData) != UNZ_OK)
+ err=UNZ_ERRNO;
+// else if ((err==UNZ_OK) && (uData!=s->cur_file_info.wVersion))
+// err=UNZ_BADZIPFILE;
+ if (unzlocal_getShort(s->file,&uFlags) != UNZ_OK)
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getShort(s->file,&uData) != UNZ_OK)
+ err=UNZ_ERRNO;
+ else if ((err==UNZ_OK) && (uData!=s->cur_file_info.compression_method))
+ err=UNZ_BADZIPFILE;
+
+ if ((err==UNZ_OK) && (s->cur_file_info.compression_method!=0) &&
+ (s->cur_file_info.compression_method!=Z_DEFLATED))
+ err=UNZ_BADZIPFILE;
+
+ if (unzlocal_getLong(s->file,&uData) != UNZ_OK) // date/time
+ err=UNZ_ERRNO;
+
+ if (unzlocal_getLong(s->file,&uData) != UNZ_OK) // crc
+ err=UNZ_ERRNO;
+ else if ((err==UNZ_OK) && (uData!=s->cur_file_info.crc) &&
+ ((uFlags & 8)==0))
+ err=UNZ_BADZIPFILE;
+
+ if (unzlocal_getLong(s->file,&uData) != UNZ_OK) // size compr
+ err=UNZ_ERRNO;
+ else if ((err==UNZ_OK) && (uData!=s->cur_file_info.compressed_size) &&
+ ((uFlags & 8)==0))
+ err=UNZ_BADZIPFILE;
+
+ if (unzlocal_getLong(s->file,&uData) != UNZ_OK) // size uncompr
+ err=UNZ_ERRNO;
+ else if ((err==UNZ_OK) && (uData!=s->cur_file_info.uncompressed_size) &&
+ ((uFlags & 8)==0))
+ err=UNZ_BADZIPFILE;
+
+
+ if (unzlocal_getShort(s->file,&size_filename) != UNZ_OK)
+ err=UNZ_ERRNO;
+ else if ((err==UNZ_OK) && (size_filename!=s->cur_file_info.size_filename))
+ err=UNZ_BADZIPFILE;
+
+ *piSizeVar += (uInt)size_filename;
+
+ if (unzlocal_getShort(s->file,&size_extra_field) != UNZ_OK)
+ err=UNZ_ERRNO;
+ *poffset_local_extrafield= s->cur_file_info_internal.offset_curfile +
+ SIZEZIPLOCALHEADER + size_filename;
+ *psize_local_extrafield = (uInt)size_extra_field;
+
+ *piSizeVar += (uInt)size_extra_field;
+
+ return err;
+}
+
+
+
+
+
+// Open for reading data the current file in the zipfile.
+// If there is no error and the file is opened, the return value is UNZ_OK.
+int unzOpenCurrentFile (unzFile file)
+{
+ int err;
+ int Store;
+ uInt iSizeVar;
+ unz_s* s;
+ file_in_zip_read_info_s* pfile_in_zip_read_info;
+ uLong offset_local_extrafield; // offset of the local extra field
+ uInt size_local_extrafield; // size of the local extra field
+
+ if (file==NULL)
+ return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+ if (!s->current_file_ok)
+ return UNZ_PARAMERROR;
+
+ if (s->pfile_in_zip_read != NULL)
+ unzCloseCurrentFile(file);
+
+ if (unzlocal_CheckCurrentFileCoherencyHeader(s,&iSizeVar,
+ &offset_local_extrafield,&size_local_extrafield)!=UNZ_OK)
+ return UNZ_BADZIPFILE;
+
+ pfile_in_zip_read_info = (file_in_zip_read_info_s*)zmalloc(sizeof(file_in_zip_read_info_s));
+ if (pfile_in_zip_read_info==NULL)
+ return UNZ_INTERNALERROR;
+
+ pfile_in_zip_read_info->read_buffer=(char*)zmalloc(UNZ_BUFSIZE);
+ pfile_in_zip_read_info->offset_local_extrafield = offset_local_extrafield;
+ pfile_in_zip_read_info->size_local_extrafield = size_local_extrafield;
+ pfile_in_zip_read_info->pos_local_extrafield=0;
+
+ if (pfile_in_zip_read_info->read_buffer==NULL)
+ {
+ if (pfile_in_zip_read_info!=0) zfree(pfile_in_zip_read_info); //unused pfile_in_zip_read_info=0;
+ return UNZ_INTERNALERROR;
+ }
+
+ pfile_in_zip_read_info->stream_initialised=0;
+
+ if ((s->cur_file_info.compression_method!=0) && (s->cur_file_info.compression_method!=Z_DEFLATED))
+ { // unused err=UNZ_BADZIPFILE;
+ }
+ Store = s->cur_file_info.compression_method==0;
+
+ pfile_in_zip_read_info->crc32_wait=s->cur_file_info.crc;
+ pfile_in_zip_read_info->crc32=0;
+ pfile_in_zip_read_info->compression_method =
+ s->cur_file_info.compression_method;
+ pfile_in_zip_read_info->file=s->file;
+ pfile_in_zip_read_info->byte_before_the_zipfile=s->byte_before_the_zipfile;
+
+ pfile_in_zip_read_info->stream.total_out = 0;
+
+ if (!Store)
+ {
+ pfile_in_zip_read_info->stream.zalloc = (alloc_func)0;
+ pfile_in_zip_read_info->stream.zfree = (free_func)0;
+ pfile_in_zip_read_info->stream.opaque = (voidpf)0;
+
+ err=inflateInit2(&pfile_in_zip_read_info->stream);
+ if (err == Z_OK)
+ pfile_in_zip_read_info->stream_initialised=1;
+ // windowBits is passed < 0 to tell that there is no zlib header.
+ // Note that in this case inflate *requires* an extra "dummy" byte
+ // after the compressed stream in order to complete decompression and
+ // return Z_STREAM_END.
+ // In unzip, i don't wait absolutely Z_STREAM_END because I known the
+ // size of both compressed and uncompressed data
+ }
+ pfile_in_zip_read_info->rest_read_compressed =
+ s->cur_file_info.compressed_size ;
+ pfile_in_zip_read_info->rest_read_uncompressed =
+ s->cur_file_info.uncompressed_size ;
+
+
+ pfile_in_zip_read_info->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)
+int unzReadCurrentFile (unzFile file, voidp buf, unsigned len)
+{ int err=UNZ_OK;
+ uInt iRead = 0;
+
+ unz_s *s = (unz_s*)file;
+ if (s==NULL) return UNZ_PARAMERROR;
+
+ file_in_zip_read_info_s* pfile_in_zip_read_info = s->pfile_in_zip_read;
+ if (pfile_in_zip_read_info==NULL) return UNZ_PARAMERROR;
+ if ((pfile_in_zip_read_info->read_buffer == NULL)) return UNZ_END_OF_LIST_OF_FILE;
+ if (len==0) return 0;
+
+ pfile_in_zip_read_info->stream.next_out = (Byte*)buf;
+ pfile_in_zip_read_info->stream.avail_out = (uInt)len;
+
+ if (len>pfile_in_zip_read_info->rest_read_uncompressed)
+ { pfile_in_zip_read_info->stream.avail_out = (uInt)pfile_in_zip_read_info->rest_read_uncompressed;
+ }
+
+ while (pfile_in_zip_read_info->stream.avail_out>0)
+ { if ((pfile_in_zip_read_info->stream.avail_in==0) && (pfile_in_zip_read_info->rest_read_compressed>0))
+ { uInt uReadThis = UNZ_BUFSIZE;
+ if (pfile_in_zip_read_info->rest_read_compressedrest_read_compressed;
+ if (uReadThis == 0) return UNZ_EOF;
+ if (lufseek(pfile_in_zip_read_info->file, pfile_in_zip_read_info->pos_in_zipfile + pfile_in_zip_read_info->byte_before_the_zipfile,SEEK_SET)!=0) return UNZ_ERRNO;
+ if (lufread(pfile_in_zip_read_info->read_buffer,uReadThis,1,pfile_in_zip_read_info->file)!=1) return UNZ_ERRNO;
+ pfile_in_zip_read_info->pos_in_zipfile += uReadThis;
+ pfile_in_zip_read_info->rest_read_compressed-=uReadThis;
+ pfile_in_zip_read_info->stream.next_in = (Byte*)pfile_in_zip_read_info->read_buffer;
+ pfile_in_zip_read_info->stream.avail_in = (uInt)uReadThis;
+ }
+
+ if (pfile_in_zip_read_info->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;istream.next_out+i) = *(pfile_in_zip_read_info->stream.next_in+i);
+ }
+ pfile_in_zip_read_info->crc32 = ucrc32(pfile_in_zip_read_info->crc32,pfile_in_zip_read_info->stream.next_out,uDoCopy);
+ pfile_in_zip_read_info->rest_read_uncompressed-=uDoCopy;
+ pfile_in_zip_read_info->stream.avail_in -= uDoCopy;
+ pfile_in_zip_read_info->stream.avail_out -= uDoCopy;
+ pfile_in_zip_read_info->stream.next_out += uDoCopy;
+ pfile_in_zip_read_info->stream.next_in += uDoCopy;
+ pfile_in_zip_read_info->stream.total_out += uDoCopy;
+ iRead += uDoCopy;
+ }
+ else
+ { uLong uTotalOutBefore,uTotalOutAfter;
+ const Byte *bufBefore;
+ uLong uOutThis;
+ int flush=Z_SYNC_FLUSH;
+ uTotalOutBefore = pfile_in_zip_read_info->stream.total_out;
+ bufBefore = pfile_in_zip_read_info->stream.next_out;
+ err=inflate(&pfile_in_zip_read_info->stream,flush);
+ uTotalOutAfter = pfile_in_zip_read_info->stream.total_out;
+ uOutThis = uTotalOutAfter-uTotalOutBefore;
+ pfile_in_zip_read_info->crc32 = ucrc32(pfile_in_zip_read_info->crc32,bufBefore,(uInt)(uOutThis));
+ pfile_in_zip_read_info->rest_read_uncompressed -= uOutThis;
+ iRead += (uInt)(uTotalOutAfter - uTotalOutBefore);
+ if (err==Z_STREAM_END) return (iRead==0) ? UNZ_EOF : iRead; //+++1.3
+ //if (err==Z_STREAM_END) return (iRead==len) ? UNZ_EOF : iRead; //+++1.2
+
+ if (err != Z_OK) break;
+ }
+ }
+
+ if (err==Z_OK) return iRead;
+
+ return iRead;
+}
+
+
+// Give the current position in uncompressed data
+z_off_t unztell (unzFile file)
+{
+ unz_s* s;
+ file_in_zip_read_info_s* pfile_in_zip_read_info;
+ if (file==NULL)
+ return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+ pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+ if (pfile_in_zip_read_info==NULL)
+ return UNZ_PARAMERROR;
+
+ return (z_off_t)pfile_in_zip_read_info->stream.total_out;
+}
+
+
+// return 1 if the end of file was reached, 0 elsewhere
+int unzeof (unzFile file)
+{
+ unz_s* s;
+ file_in_zip_read_info_s* pfile_in_zip_read_info;
+ if (file==NULL)
+ return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+ pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+ if (pfile_in_zip_read_info==NULL)
+ return UNZ_PARAMERROR;
+
+ if (pfile_in_zip_read_info->rest_read_uncompressed == 0)
+ return 1;
+ else
+ return 0;
+}
+
+
+
+// Read extra field from the current file (opened by unzOpenCurrentFile)
+// This is the local-header version of the extra field (sometimes, there is
+// more info in the local-header version than in the central-header)
+// if buf==NULL, it return the size of the local extra field that can be read
+// if buf!=NULL, len is the size of the buffer, the extra header is copied in buf.
+// the return value is the number of bytes copied in buf, or (if <0) the error code
+int unzGetLocalExtrafield (unzFile file,voidp buf,unsigned len)
+{
+ unz_s* s;
+ file_in_zip_read_info_s* pfile_in_zip_read_info;
+ uInt read_now;
+ uLong size_to_read;
+
+ if (file==NULL)
+ return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+ pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+ if (pfile_in_zip_read_info==NULL)
+ return UNZ_PARAMERROR;
+
+ size_to_read = (pfile_in_zip_read_info->size_local_extrafield -
+ pfile_in_zip_read_info->pos_local_extrafield);
+
+ if (buf==NULL)
+ return (int)size_to_read;
+
+ if (len>size_to_read)
+ read_now = (uInt)size_to_read;
+ else
+ read_now = (uInt)len ;
+
+ if (read_now==0)
+ return 0;
+
+ if (lufseek(pfile_in_zip_read_info->file, pfile_in_zip_read_info->offset_local_extrafield + pfile_in_zip_read_info->pos_local_extrafield,SEEK_SET)!=0)
+ return UNZ_ERRNO;
+
+ if (lufread(buf,(uInt)size_to_read,1,pfile_in_zip_read_info->file)!=1)
+ return UNZ_ERRNO;
+
+ return (int)read_now;
+}
+
+// Close the file in zip opened with unzipOpenCurrentFile
+// Return UNZ_CRCERROR if all the file was read but the CRC is not good
+int unzCloseCurrentFile (unzFile file)
+{
+ int err=UNZ_OK;
+
+ unz_s* s;
+ file_in_zip_read_info_s* pfile_in_zip_read_info;
+ if (file==NULL)
+ return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+ pfile_in_zip_read_info=s->pfile_in_zip_read;
+
+ if (pfile_in_zip_read_info==NULL)
+ return UNZ_PARAMERROR;
+
+
+ if (pfile_in_zip_read_info->rest_read_uncompressed == 0)
+ {
+ if (pfile_in_zip_read_info->crc32 != pfile_in_zip_read_info->crc32_wait)
+ err=UNZ_CRCERROR;
+ }
+
+
+ if (pfile_in_zip_read_info->read_buffer!=0)
+ { void *buf = pfile_in_zip_read_info->read_buffer;
+ zfree(buf);
+ pfile_in_zip_read_info->read_buffer=0;
+ }
+ pfile_in_zip_read_info->read_buffer = NULL;
+ if (pfile_in_zip_read_info->stream_initialised)
+ inflateEnd(&pfile_in_zip_read_info->stream);
+
+ pfile_in_zip_read_info->stream_initialised = 0;
+ if (pfile_in_zip_read_info!=0) zfree(pfile_in_zip_read_info); // unused pfile_in_zip_read_info=0;
+
+ s->pfile_in_zip_read=NULL;
+
+ return err;
+}
+
+
+// Get the global comment string of the ZipFile, in the szComment buffer.
+// uSizeBuf is the size of the szComment buffer.
+// return the number of byte copied or an error code <0
+int unzGetGlobalComment (unzFile file, char *szComment, uLong uSizeBuf)
+{ //int err=UNZ_OK;
+ unz_s* s;
+ uLong uReadThis ;
+ if (file==NULL) return UNZ_PARAMERROR;
+ s=(unz_s*)file;
+ uReadThis = uSizeBuf;
+ if (uReadThis>s->gi.size_comment) uReadThis = s->gi.size_comment;
+ if (lufseek(s->file,s->central_pos+22,SEEK_SET)!=0) return UNZ_ERRNO;
+ if (uReadThis>0)
+ { *szComment='\0';
+ if (lufread(szComment,(uInt)uReadThis,1,s->file)!=1) return UNZ_ERRNO;
+ }
+ if ((szComment != NULL) && (uSizeBuf > s->gi.size_comment)) *(szComment+s->gi.size_comment)='\0';
+ return (int)uReadThis;
+}
+
+
+
+
+
+int unzOpenCurrentFile (unzFile file);
+int unzReadCurrentFile (unzFile file, void *buf, unsigned len);
+int unzCloseCurrentFile (unzFile file);
+
+
+FILETIME timet2filetime(time_t timer)
+{
+ struct tm *tm = gmtime(&timer);
+ SYSTEMTIME st;
+ st.wYear = (WORD)(tm->tm_year+1900);
+ st.wMonth = (WORD)(tm->tm_mon+1);
+ st.wDay = (WORD)(tm->tm_mday);
+ st.wHour = (WORD)(tm->tm_hour);
+ st.wMinute = (WORD)(tm->tm_min);
+ st.wSecond = (WORD)(tm->tm_sec);
+ st.wMilliseconds=0;
+ FILETIME ft;
+ SystemTimeToFileTime(&st,&ft);
+ return ft;
+}
+
+///////////////////////////////////////////////////////////////////////////////
+///////////////////////////////////////////////////////////////////////////////
+///////////////////////////////////////////////////////////////////////////////
+class TUnzip
+{ public:
+ TUnzip() : uf(0), currentfile(-1), czei(-1) {}
+
+ unzFile uf; int currentfile; ZIPENTRY cze; int czei;
+ TCHAR rootdir[MAX_PATH];
+
+ ZRESULT Open(void *z,unsigned int len,DWORD flags);
+ ZRESULT Get(int index,ZIPENTRY *ze);
+ ZRESULT Find(const TCHAR *name,bool ic,int *index,ZIPENTRY *ze);
+ ZRESULT Unzip(int index,void *dst,unsigned int len,DWORD flags);
+ ZRESULT Close();
+};
+
+
+ZRESULT TUnzip::Open(void *z,unsigned int len,DWORD flags)
+{
+ if (uf!=0 || currentfile!=-1)
+ return ZR_NOTINITED;
+ GetCurrentDirectory(MAX_PATH,rootdir);
+ _tcscat(rootdir,_T("\\"));
+ if (flags==ZIP_HANDLE)
+ {
+ DWORD type = GetFileType(z);
+ if (type!=FILE_TYPE_DISK)
+ return ZR_SEEK;
+ }
+ ZRESULT e;
+ LUFILE *f = lufopen(z,len,flags,&e);
+ if (f==NULL)
+ return e;
+ uf = unzOpenInternal(f);
+ //return ZR_OK;
+ return zopenerror; //+++1.2
+}
+
+ZRESULT TUnzip::Get(int index,ZIPENTRY *ze)
+{ if (index<-1 || index>=(int)uf->gi.number_entry)
+ return ZR_ARGS;
+ if (currentfile!=-1)
+ unzCloseCurrentFile(uf);
+ currentfile=-1;
+ if (index==czei && index!=-1) {memcpy(ze,&cze,sizeof(ZIPENTRY)); return ZR_OK;}
+ if (index==-1)
+ { ze->index = uf->gi.number_entry;
+ ze->name[0]=0;
+ ze->attr=0;
+ ze->atime.dwLowDateTime=0; ze->atime.dwHighDateTime=0;
+ ze->ctime.dwLowDateTime=0; ze->ctime.dwHighDateTime=0;
+ ze->mtime.dwLowDateTime=0; ze->mtime.dwHighDateTime=0;
+ ze->comp_size=0;
+ ze->unc_size=0;
+ return ZR_OK;
+ }
+ if (index<(int)uf->num_file) unzGoToFirstFile(uf);
+ while ((int)uf->num_filefile,offset,SEEK_SET)!=0) return ZR_READ;
+ char *extra = new char[extralen];
+ if (lufread(extra,1,(uInt)extralen,uf->file)!=extralen) {delete[] extra; return ZR_READ;}
+ //
+ ze->index=uf->num_file;
+ strcpy(ze->name,fn);
+ // zip has an 'attribute' 32bit value. Its lower half is windows stuff
+ // its upper half is standard unix attr.
+ unsigned long a = ufi.external_fa;
+ bool uisdir = (a&0x40000000)!=0;
+ //bool uwriteable= (a&0x08000000)!=0;
+ bool uwriteable= (a&0x00800000)!=0; // ***hd***
+ //bool ureadable= (a&0x01000000)!=0;
+ //bool uexecutable=(a&0x00400000)!=0;
+ bool wreadonly= (a&0x00000001)!=0;
+ bool whidden= (a&0x00000002)!=0;
+ bool wsystem= (a&0x00000004)!=0;
+ bool wisdir= (a&0x00000010)!=0;
+ bool warchive= (a&0x00000020)!=0;
+ ze->attr=FILE_ATTRIBUTE_NORMAL;
+ if (uisdir || wisdir) ze->attr |= FILE_ATTRIBUTE_DIRECTORY;
+ if (warchive) ze->attr|=FILE_ATTRIBUTE_ARCHIVE;
+ if (whidden) ze->attr|=FILE_ATTRIBUTE_HIDDEN;
+ if (!uwriteable||wreadonly) ze->attr|=FILE_ATTRIBUTE_READONLY;
+ if (wsystem) ze->attr|=FILE_ATTRIBUTE_SYSTEM;
+ ze->comp_size = ufi.compressed_size;
+ ze->unc_size = ufi.uncompressed_size;
+ //
+ WORD dostime = (WORD)(ufi.dosDate&0xFFFF);
+ WORD dosdate = (WORD)((ufi.dosDate>>16)&0xFFFF);
+ FILETIME ft;
+ DosDateTimeToFileTime(dosdate,dostime,&ft);
+ ze->atime=ft; ze->ctime=ft; ze->mtime=ft;
+ // the zip will always have at least that dostime. But if it also has
+ // an extra header, then we'll instead get the info from that.
+ unsigned int epos=0;
+ while (epos+4mtime = timet2filetime(mtime);
+ }
+ if (hasatime)
+ { time_t atime = *(__time32_t*)(extra+epos); epos+=4;
+ ze->atime = timet2filetime(atime);
+ }
+ if (hasctime)
+ { time_t ctime = *(__time32_t*)(extra+epos);
+ ze->ctime = timet2filetime(ctime);
+ }
+ break;
+ }
+ //
+ if (extra!=0) delete[] extra;
+ memcpy(&cze,ze,sizeof(ZIPENTRY)); czei=index;
+ return ZR_OK;
+}
+
+ZRESULT TUnzip::Find(const TCHAR *name, bool ic, int *index, ZIPENTRY *ze)
+{
+ int res = unzLocateFile(uf,name,ic?CASE_INSENSITIVE:CASE_SENSITIVE);
+ if (res!=UNZ_OK)
+ {
+ if (index!=0)
+ *index=-1;
+ if (ze!=NULL)
+ {
+ ZeroMemory(ze,sizeof(ZIPENTRY)); ze->index=-1;
+ }
+ return ZR_NOTFOUND;
+ }
+ if (currentfile!=-1)
+ unzCloseCurrentFile(uf); currentfile=-1;
+ int i = (int)uf->num_file;
+ if (index!=NULL)
+ *index=i;
+ if (ze!=NULL)
+ {
+ ZRESULT zres = Get(i,ze);
+ if (zres!=ZR_OK)
+ return zres;
+ }
+ return ZR_OK;
+}
+
+void EnsureDirectory(const TCHAR *rootdir, const TCHAR *dir)
+{
+ if (dir==NULL || dir[0] == _T('\0'))
+ return;
+ const TCHAR *lastslash = dir, *c = lastslash;
+ while (*c != _T('\0'))
+ {
+ if (*c==_T('/') || *c==_T('\\'))
+ lastslash=c;
+ c++;
+ }
+ const TCHAR *name=lastslash;
+ if (lastslash!=dir)
+ {
+ TCHAR tmp[MAX_PATH];
+ _tcsncpy(tmp, dir, lastslash-dir);
+ tmp[lastslash-dir] = _T('\0');
+ EnsureDirectory(rootdir,tmp);
+ name++;
+ }
+ TCHAR cd[MAX_PATH];
+ _tcscpy(cd,rootdir);
+ //_tcscat(cd,name);
+ _tcscat(cd,dir); //+++1.2
+ CreateDirectory(cd,NULL);
+}
+
+ZRESULT TUnzip::Unzip(int index,void *dst,unsigned int len,DWORD flags)
+{
+ if (flags!=ZIP_MEMORY && flags!=ZIP_FILENAME && flags!=ZIP_HANDLE)
+ return ZR_ARGS;
+ if (flags==ZIP_MEMORY)
+ {
+ if (index!=currentfile)
+ {
+ if (currentfile!=-1)
+ unzCloseCurrentFile(uf);
+ currentfile=-1;
+ if (index>=(int)uf->gi.number_entry)
+ return ZR_ARGS;
+ if (index<(int)uf->num_file)
+ unzGoToFirstFile(uf);
+ while ((int)uf->num_file0)
+ return ZR_MORE;
+ unzCloseCurrentFile(uf);
+ currentfile=-1;
+ if (res==0)
+ return ZR_OK;
+ else
+ return ZR_FLATE;
+ }
+
+ // otherwise we're writing to a handle or a file
+ if (currentfile!=-1)
+ unzCloseCurrentFile(uf);
+ currentfile=-1;
+ if (index >= (int)uf->gi.number_entry)
+ return ZR_ARGS;
+ if (index < (int)uf->num_file)
+ unzGoToFirstFile(uf);
+ while ((int)uf->num_filelen) n=len-1;
+ strncpy(buf,msg,n); buf[n]=0;
+ return mlen;
+}
+
+
+typedef struct
+{ DWORD flag;
+ TUnzip *unz;
+} TUnzipHandleData;
+
+HZIP OpenZipU(void *z,unsigned int len,DWORD flags)
+{
+ TUnzip *unz = new TUnzip();
+ lasterrorU = unz->Open(z,len,flags);
+ if (lasterrorU!=ZR_OK)
+ {
+ delete unz;
+ return 0;
+ }
+ TUnzipHandleData *han = new TUnzipHandleData;
+ han->flag=1;
+ han->unz=unz;
+ return (HZIP)han;
+}
+
+ZRESULT GetZipItemA(HZIP hz, int index, ZIPENTRY *ze)
+{
+ if (hz==0)
+ {
+ lasterrorU=ZR_ARGS;
+ return ZR_ARGS;
+ }
+ TUnzipHandleData *han = (TUnzipHandleData*)hz;
+ if (han->flag!=1)
+ {
+ lasterrorU=ZR_ZMODE;
+ return ZR_ZMODE;
+ }
+ TUnzip *unz = han->unz;
+ lasterrorU = unz->Get(index,ze);
+ return lasterrorU;
+}
+
+ZRESULT GetZipItemW(HZIP hz, int index, ZIPENTRYW *zew)
+{
+ if (hz==0)
+ {
+ lasterrorU=ZR_ARGS;
+ return ZR_ARGS;
+ }
+ TUnzipHandleData *han = (TUnzipHandleData*)hz;
+ if (han->flag!=1)
+ {
+ lasterrorU=ZR_ZMODE;
+ return ZR_ZMODE;
+ }
+ TUnzip *unz = han->unz;
+ ZIPENTRY ze;
+ lasterrorU = unz->Get(index,&ze);
+ if (lasterrorU == ZR_OK)
+ {
+ zew->index = ze.index;
+ zew->attr = ze.attr;
+ zew->atime = ze.atime;
+ zew->ctime = ze.ctime;
+ zew->mtime = ze.mtime;
+ zew->comp_size = ze.comp_size;
+ zew->unc_size = ze.unc_size;
+#ifdef _UNICODE
+ GetUnicodeFileName(ze.name, zew->name, MAX_PATH-1);
+#else
+ strcpy(zew->name, ze.name);
+#endif
+ }
+ return lasterrorU;
+}
+
+ZRESULT FindZipItemA(HZIP hz, const TCHAR *name, bool ic, int *index, ZIPENTRY *ze)
+{
+ if (hz==0)
+ {
+ lasterrorU=ZR_ARGS;
+ return ZR_ARGS;
+ }
+ TUnzipHandleData *han = (TUnzipHandleData*)hz;
+ if (han->flag!=1)
+ {
+ lasterrorU=ZR_ZMODE;
+ return ZR_ZMODE;
+ }
+ TUnzip *unz = han->unz;
+ lasterrorU = unz->Find(name,ic,index,ze);
+ return lasterrorU;
+}
+
+ZRESULT FindZipItemW(HZIP hz, const TCHAR *name, bool ic, int *index, ZIPENTRYW *zew)
+{
+ if (hz==0)
+ {
+ lasterrorU=ZR_ARGS;
+ return ZR_ARGS;
+ }
+ TUnzipHandleData *han = (TUnzipHandleData*)hz;
+ if (han->flag!=1)
+ {
+ lasterrorU=ZR_ZMODE;
+ return ZR_ZMODE;
+ }
+ TUnzip *unz = han->unz;
+ ZIPENTRY ze;
+ lasterrorU = unz->Find(name,ic,index,&ze);
+ if (lasterrorU == ZR_OK)
+ {
+ zew->index = ze.index;
+ zew->attr = ze.attr;
+ zew->atime = ze.atime;
+ zew->ctime = ze.ctime;
+ zew->mtime = ze.mtime;
+ zew->comp_size = ze.comp_size;
+ zew->unc_size = ze.unc_size;
+#ifdef _UNICODE
+ GetUnicodeFileName(ze.name, zew->name, MAX_PATH-1);
+#else
+ strcpy(zew->name, ze.name);
+#endif
+ }
+
+ return lasterrorU;
+}
+
+ZRESULT UnzipItem(HZIP hz, int index, void *dst, unsigned int len, DWORD flags)
+{
+ if (hz==0)
+ {
+ lasterrorU=ZR_ARGS;
+ return ZR_ARGS;
+ }
+ TUnzipHandleData *han = (TUnzipHandleData*)hz;
+ if (han->flag!=1)
+ {
+ lasterrorU=ZR_ZMODE;
+ return ZR_ZMODE;
+ }
+ TUnzip *unz = han->unz;
+ lasterrorU = unz->Unzip(index,dst,len,flags);
+ return lasterrorU;
+}
+
+ZRESULT CloseZipU(HZIP hz)
+{ if (hz==0) {lasterrorU=ZR_ARGS;return ZR_ARGS;}
+ TUnzipHandleData *han = (TUnzipHandleData*)hz;
+ if (han->flag!=1) {lasterrorU=ZR_ZMODE;return ZR_ZMODE;}
+ TUnzip *unz = han->unz;
+ lasterrorU = unz->Close();
+ delete unz;
+ delete han;
+ return lasterrorU;
+}
+
+bool IsZipHandleU(HZIP hz)
+{ if (hz==0) return true;
+ TUnzipHandleData *han = (TUnzipHandleData*)hz;
+ return (han->flag==1);
+}
+
+
diff --git a/Demos/bdwallpaper/helper/jsoncpp/autolink.h b/Demos/bdwallpaper/helper/jsoncpp/autolink.h
new file mode 100644
index 00000000..37c9258e
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/autolink.h
@@ -0,0 +1,19 @@
+#ifndef JSON_AUTOLINK_H_INCLUDED
+# define JSON_AUTOLINK_H_INCLUDED
+
+# include "config.h"
+
+# ifdef JSON_IN_CPPTL
+# include
+# endif
+
+# if !defined(JSON_NO_AUTOLINK) && !defined(JSON_DLL_BUILD) && !defined(JSON_IN_CPPTL)
+# define CPPTL_AUTOLINK_NAME "json"
+# undef CPPTL_AUTOLINK_DLL
+# ifdef JSON_DLL
+# define CPPTL_AUTOLINK_DLL
+# endif
+# include "autolink.h"
+# endif
+
+#endif // JSON_AUTOLINK_H_INCLUDED
diff --git a/Demos/bdwallpaper/helper/jsoncpp/config.h b/Demos/bdwallpaper/helper/jsoncpp/config.h
new file mode 100644
index 00000000..5d334cbc
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/config.h
@@ -0,0 +1,43 @@
+#ifndef JSON_CONFIG_H_INCLUDED
+# define JSON_CONFIG_H_INCLUDED
+
+/// If defined, indicates that json library is embedded in CppTL library.
+//# define JSON_IN_CPPTL 1
+
+/// If defined, indicates that json may leverage CppTL library
+//# define JSON_USE_CPPTL 1
+/// If defined, indicates that cpptl vector based map should be used instead of std::map
+/// as Value container.
+//# define JSON_USE_CPPTL_SMALLMAP 1
+/// If defined, indicates that Json specific container should be used
+/// (hash table & simple deque container with customizable allocator).
+/// THIS FEATURE IS STILL EXPERIMENTAL!
+//# define JSON_VALUE_USE_INTERNAL_MAP 1
+/// Force usage of standard new/malloc based allocator instead of memory pool based allocator.
+/// The memory pools allocator used optimization (initializing Value and ValueInternalLink
+/// as if it was a POD) that may cause some validation tool to report errors.
+/// Only has effects if JSON_VALUE_USE_INTERNAL_MAP is defined.
+//# define JSON_USE_SIMPLE_INTERNAL_ALLOCATOR 1
+
+/// If defined, indicates that Json use exception to report invalid type manipulation
+/// instead of C assert macro.
+# define JSON_USE_EXCEPTION 1
+
+# ifdef JSON_IN_CPPTL
+# include
+# ifndef JSON_USE_CPPTL
+# define JSON_USE_CPPTL 1
+# endif
+# endif
+
+# ifdef JSON_IN_CPPTL
+# define JSON_API CPPTL_API
+# elif defined(JSON_DLL_BUILD)
+# define JSON_API __declspec(dllexport)
+# elif defined(JSON_DLL)
+# define JSON_API __declspec(dllimport)
+# else
+# define JSON_API
+# endif
+
+#endif // JSON_CONFIG_H_INCLUDED
diff --git a/Demos/bdwallpaper/helper/jsoncpp/features.h b/Demos/bdwallpaper/helper/jsoncpp/features.h
new file mode 100644
index 00000000..5a9adec1
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/features.h
@@ -0,0 +1,42 @@
+#ifndef CPPTL_JSON_FEATURES_H_INCLUDED
+# define CPPTL_JSON_FEATURES_H_INCLUDED
+
+# include "forwards.h"
+
+namespace Json {
+
+ /** \brief Configuration passed to reader and writer.
+ * This configuration object can be used to force the Reader or Writer
+ * to behave in a standard conforming way.
+ */
+ class JSON_API Features
+ {
+ public:
+ /** \brief A configuration that allows all features and assumes all strings are UTF-8.
+ * - C & C++ comments are allowed
+ * - Root object can be any JSON value
+ * - Assumes Value strings are encoded in UTF-8
+ */
+ static Features all();
+
+ /** \brief A configuration that is strictly compatible with the JSON specification.
+ * - Comments are forbidden.
+ * - Root object must be either an array or an object value.
+ * - Assumes Value strings are encoded in UTF-8
+ */
+ static Features strictMode();
+
+ /** \brief Initialize the configuration like JsonConfig::allFeatures;
+ */
+ Features();
+
+ /// \c true if comments are allowed. Default: \c true.
+ bool allowComments_;
+
+ /// \c true if root must be either an array or an object value. Default: \c false.
+ bool strictRoot_;
+ };
+
+} // namespace Json
+
+#endif // CPPTL_JSON_FEATURES_H_INCLUDED
diff --git a/Demos/bdwallpaper/helper/jsoncpp/forwards.h b/Demos/bdwallpaper/helper/jsoncpp/forwards.h
new file mode 100644
index 00000000..d0ce8300
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/forwards.h
@@ -0,0 +1,39 @@
+#ifndef JSON_FORWARDS_H_INCLUDED
+# define JSON_FORWARDS_H_INCLUDED
+
+# include "config.h"
+
+namespace Json {
+
+ // writer.h
+ class FastWriter;
+ class StyledWriter;
+
+ // reader.h
+ class Reader;
+
+ // features.h
+ class Features;
+
+ // value.h
+ typedef int Int;
+ typedef unsigned int UInt;
+ class StaticString;
+ class Path;
+ class PathArgument;
+ class Value;
+ class ValueIteratorBase;
+ class ValueIterator;
+ class ValueConstIterator;
+#ifdef JSON_VALUE_USE_INTERNAL_MAP
+ class ValueAllocator;
+ class ValueMapAllocator;
+ class ValueInternalLink;
+ class ValueInternalArray;
+ class ValueInternalMap;
+#endif // #ifdef JSON_VALUE_USE_INTERNAL_MAP
+
+} // namespace Json
+
+
+#endif // JSON_FORWARDS_H_INCLUDED
diff --git a/Demos/bdwallpaper/helper/jsoncpp/json.h b/Demos/bdwallpaper/helper/jsoncpp/json.h
new file mode 100644
index 00000000..c71ed65a
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/json.h
@@ -0,0 +1,10 @@
+#ifndef JSON_JSON_H_INCLUDED
+# define JSON_JSON_H_INCLUDED
+
+# include "autolink.h"
+# include "value.h"
+# include "reader.h"
+# include "writer.h"
+# include "features.h"
+
+#endif // JSON_JSON_H_INCLUDED
diff --git a/Demos/bdwallpaper/helper/jsoncpp/json_batchallocator.h b/Demos/bdwallpaper/helper/jsoncpp/json_batchallocator.h
new file mode 100644
index 00000000..87ea5ed8
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/json_batchallocator.h
@@ -0,0 +1,125 @@
+#ifndef JSONCPP_BATCHALLOCATOR_H_INCLUDED
+# define JSONCPP_BATCHALLOCATOR_H_INCLUDED
+
+# include
+# include
+
+# ifndef JSONCPP_DOC_EXCLUDE_IMPLEMENTATION
+
+namespace Json {
+
+/* Fast memory allocator.
+ *
+ * This memory allocator allocates memory for a batch of object (specified by
+ * the page size, the number of object in each page).
+ *
+ * It does not allow the destruction of a single object. All the allocated objects
+ * can be destroyed at once. The memory can be either released or reused for future
+ * allocation.
+ *
+ * The in-place new operator must be used to construct the object using the pointer
+ * returned by allocate.
+ */
+template
+class BatchAllocator
+{
+public:
+ typedef AllocatedType Type;
+
+ BatchAllocator( unsigned int objectsPerPage = 255 )
+ : freeHead_( 0 )
+ , objectsPerPage_( objectsPerPage )
+ {
+// printf( "Size: %d => %s\n", sizeof(AllocatedType), typeid(AllocatedType).name() );
+ assert( sizeof(AllocatedType) * objectPerAllocation >= sizeof(AllocatedType *) ); // We must be able to store a slist in the object free space.
+ assert( objectsPerPage >= 16 );
+ batches_ = allocateBatch( 0 ); // allocated a dummy page
+ currentBatch_ = batches_;
+ }
+
+ ~BatchAllocator()
+ {
+ for ( BatchInfo *batch = batches_; batch; )
+ {
+ BatchInfo *nextBatch = batch->next_;
+ free( batch );
+ batch = nextBatch;
+ }
+ }
+
+ /// allocate space for an array of objectPerAllocation object.
+ /// @warning it is the responsability of the caller to call objects constructors.
+ AllocatedType *allocate()
+ {
+ if ( freeHead_ ) // returns node from free list.
+ {
+ AllocatedType *object = freeHead_;
+ freeHead_ = *(AllocatedType **)object;
+ return object;
+ }
+ if ( currentBatch_->used_ == currentBatch_->end_ )
+ {
+ currentBatch_ = currentBatch_->next_;
+ while ( currentBatch_ && currentBatch_->used_ == currentBatch_->end_ )
+ currentBatch_ = currentBatch_->next_;
+
+ if ( !currentBatch_ ) // no free batch found, allocate a new one
+ {
+ currentBatch_ = allocateBatch( objectsPerPage_ );
+ currentBatch_->next_ = batches_; // insert at the head of the list
+ batches_ = currentBatch_;
+ }
+ }
+ AllocatedType *allocated = currentBatch_->used_;
+ currentBatch_->used_ += objectPerAllocation;
+ return allocated;
+ }
+
+ /// Release the object.
+ /// @warning it is the responsability of the caller to actually destruct the object.
+ void release( AllocatedType *object )
+ {
+ assert( object != 0 );
+ *(AllocatedType **)object = freeHead_;
+ freeHead_ = object;
+ }
+
+private:
+ struct BatchInfo
+ {
+ BatchInfo *next_;
+ AllocatedType *used_;
+ AllocatedType *end_;
+ AllocatedType buffer_[objectPerAllocation];
+ };
+
+ // disabled copy constructor and assignement operator.
+ BatchAllocator( const BatchAllocator & );
+ void operator =( const BatchAllocator &);
+
+ static BatchInfo *allocateBatch( unsigned int objectsPerPage )
+ {
+ const unsigned int mallocSize = sizeof(BatchInfo) - sizeof(AllocatedType)* objectPerAllocation
+ + sizeof(AllocatedType) * objectPerAllocation * objectsPerPage;
+ BatchInfo *batch = static_cast( malloc( mallocSize ) );
+ batch->next_ = 0;
+ batch->used_ = batch->buffer_;
+ batch->end_ = batch->buffer_ + objectsPerPage;
+ return batch;
+ }
+
+ BatchInfo *batches_;
+ BatchInfo *currentBatch_;
+ /// Head of a single linked list within the allocated space of freeed object
+ AllocatedType *freeHead_;
+ unsigned int objectsPerPage_;
+};
+
+
+} // namespace Json
+
+# endif // ifndef JSONCPP_DOC_INCLUDE_IMPLEMENTATION
+
+#endif // JSONCPP_BATCHALLOCATOR_H_INCLUDED
+
diff --git a/Demos/bdwallpaper/helper/jsoncpp/json_reader.cpp b/Demos/bdwallpaper/helper/jsoncpp/json_reader.cpp
new file mode 100644
index 00000000..3623e71d
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/json_reader.cpp
@@ -0,0 +1,885 @@
+#include "reader.h"
+#include "value.h"
+#include
+#include
+#include
+#include
+#include
+#include
+
+#if _MSC_VER >= 1400 // VC++ 8.0
+#pragma warning( disable : 4996 ) // disable warning about strdup being deprecated.
+#endif
+
+namespace Json {
+
+// Implementation of class Features
+// ////////////////////////////////
+
+Features::Features()
+ : allowComments_( true )
+ , strictRoot_( false )
+{
+}
+
+
+Features
+Features::all()
+{
+ return Features();
+}
+
+
+Features
+Features::strictMode()
+{
+ Features features;
+ features.allowComments_ = false;
+ features.strictRoot_ = true;
+ return features;
+}
+
+// Implementation of class Reader
+// ////////////////////////////////
+
+
+static inline bool
+in( Reader::Char c, Reader::Char c1, Reader::Char c2, Reader::Char c3, Reader::Char c4 )
+{
+ return c == c1 || c == c2 || c == c3 || c == c4;
+}
+
+static inline bool
+in( Reader::Char c, Reader::Char c1, Reader::Char c2, Reader::Char c3, Reader::Char c4, Reader::Char c5 )
+{
+ return c == c1 || c == c2 || c == c3 || c == c4 || c == c5;
+}
+
+
+static bool
+containsNewLine( Reader::Location begin,
+ Reader::Location end )
+{
+ for ( ;begin < end; ++begin )
+ if ( *begin == '\n' || *begin == '\r' )
+ return true;
+ return false;
+}
+
+static std::string codePointToUTF8(unsigned int cp)
+{
+ std::string result;
+
+ // based on description from http://en.wikipedia.org/wiki/UTF-8
+
+ if (cp <= 0x7f)
+ {
+ result.resize(1);
+ result[0] = static_cast(cp);
+ }
+ else if (cp <= 0x7FF)
+ {
+ result.resize(2);
+ result[1] = static_cast(0x80 | (0x3f & cp));
+ result[0] = static_cast(0xC0 | (0x1f & (cp >> 6)));
+ }
+ else if (cp <= 0xFFFF)
+ {
+ result.resize(3);
+ result[2] = static_cast(0x80 | (0x3f & cp));
+ result[1] = 0x80 | static_cast((0x3f & (cp >> 6)));
+ result[0] = 0xE0 | static_cast((0xf & (cp >> 12)));
+ }
+ else if (cp <= 0x10FFFF)
+ {
+ result.resize(4);
+ result[3] = static_cast(0x80 | (0x3f & cp));
+ result[2] = static_cast(0x80 | (0x3f & (cp >> 6)));
+ result[1] = static_cast(0x80 | (0x3f & (cp >> 12)));
+ result[0] = static_cast(0xF0 | (0x7 & (cp >> 18)));
+ }
+
+ return result;
+}
+
+
+// Class Reader
+// //////////////////////////////////////////////////////////////////
+
+Reader::Reader()
+ : features_( Features::all() )
+{
+}
+
+
+Reader::Reader( const Features &features )
+ : features_( features )
+{
+}
+
+
+bool
+Reader::parse( const std::string &document,
+ Value &root,
+ bool collectComments )
+{
+ document_ = document;
+ const char *begin = document_.c_str();
+ const char *end = begin + document_.length();
+ return parse( begin, end, root, collectComments );
+}
+
+
+bool
+Reader::parse( std::istream& sin,
+ Value &root,
+ bool collectComments )
+{
+ //std::istream_iterator begin(sin);
+ //std::istream_iterator end;
+ // Those would allow streamed input from a file, if parse() were a
+ // template function.
+
+ // Since std::string is reference-counted, this at least does not
+ // create an extra copy.
+ std::string doc;
+ std::getline(sin, doc, (char)EOF);
+ return parse( doc, root, collectComments );
+}
+
+bool
+Reader::parse( const char *beginDoc, const char *endDoc,
+ Value &root,
+ bool collectComments )
+{
+ if ( !features_.allowComments_ )
+ {
+ collectComments = false;
+ }
+
+ begin_ = beginDoc;
+ end_ = endDoc;
+ collectComments_ = collectComments;
+ current_ = begin_;
+ lastValueEnd_ = 0;
+ lastValue_ = 0;
+ commentsBefore_ = "";
+ errors_.clear();
+ while ( !nodes_.empty() )
+ nodes_.pop();
+ nodes_.push( &root );
+
+ bool successful = readValue();
+ Token token;
+ skipCommentTokens( token );
+ if ( collectComments_ && !commentsBefore_.empty() )
+ root.setComment( commentsBefore_, commentAfter );
+ if ( features_.strictRoot_ )
+ {
+ if ( !root.isArray() && !root.isObject() )
+ {
+ // Set error location to start of doc, ideally should be first token found in doc
+ token.type_ = tokenError;
+ token.start_ = beginDoc;
+ token.end_ = endDoc;
+ addError( "A valid JSON document must be either an array or an object value.",
+ token );
+ return false;
+ }
+ }
+ return successful;
+}
+
+
+bool
+Reader::readValue()
+{
+ Token token;
+ skipCommentTokens( token );
+ bool successful = true;
+
+ if ( collectComments_ && !commentsBefore_.empty() )
+ {
+ currentValue().setComment( commentsBefore_, commentBefore );
+ commentsBefore_ = "";
+ }
+
+
+ switch ( token.type_ )
+ {
+ case tokenObjectBegin:
+ successful = readObject( token );
+ break;
+ case tokenArrayBegin:
+ successful = readArray( token );
+ break;
+ case tokenNumber:
+ successful = decodeNumber( token );
+ break;
+ case tokenString:
+ successful = decodeString( token );
+ break;
+ case tokenTrue:
+ currentValue() = true;
+ break;
+ case tokenFalse:
+ currentValue() = false;
+ break;
+ case tokenNull:
+ currentValue() = Value();
+ break;
+ default:
+ return addError( "Syntax error: value, object or array expected.", token );
+ }
+
+ if ( collectComments_ )
+ {
+ lastValueEnd_ = current_;
+ lastValue_ = ¤tValue();
+ }
+
+ return successful;
+}
+
+
+void
+Reader::skipCommentTokens( Token &token )
+{
+ if ( features_.allowComments_ )
+ {
+ do
+ {
+ readToken( token );
+ }
+ while ( token.type_ == tokenComment );
+ }
+ else
+ {
+ readToken( token );
+ }
+}
+
+
+bool
+Reader::expectToken( TokenType type, Token &token, const char *message )
+{
+ readToken( token );
+ if ( token.type_ != type )
+ return addError( message, token );
+ return true;
+}
+
+
+bool
+Reader::readToken( Token &token )
+{
+ skipSpaces();
+ token.start_ = current_;
+ Char c = getNextChar();
+ bool ok = true;
+ switch ( c )
+ {
+ case '{':
+ token.type_ = tokenObjectBegin;
+ break;
+ case '}':
+ token.type_ = tokenObjectEnd;
+ break;
+ case '[':
+ token.type_ = tokenArrayBegin;
+ break;
+ case ']':
+ token.type_ = tokenArrayEnd;
+ break;
+ case '"':
+ token.type_ = tokenString;
+ ok = readString();
+ break;
+ case '/':
+ token.type_ = tokenComment;
+ ok = readComment();
+ break;
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ case '-':
+ token.type_ = tokenNumber;
+ readNumber();
+ break;
+ case 't':
+ token.type_ = tokenTrue;
+ ok = match( "rue", 3 );
+ break;
+ case 'f':
+ token.type_ = tokenFalse;
+ ok = match( "alse", 4 );
+ break;
+ case 'n':
+ token.type_ = tokenNull;
+ ok = match( "ull", 3 );
+ break;
+ case ',':
+ token.type_ = tokenArraySeparator;
+ break;
+ case ':':
+ token.type_ = tokenMemberSeparator;
+ break;
+ case 0:
+ token.type_ = tokenEndOfStream;
+ break;
+ default:
+ ok = false;
+ break;
+ }
+ if ( !ok )
+ token.type_ = tokenError;
+ token.end_ = current_;
+ return true;
+}
+
+
+void
+Reader::skipSpaces()
+{
+ while ( current_ != end_ )
+ {
+ Char c = *current_;
+ if ( c == ' ' || c == '\t' || c == '\r' || c == '\n' )
+ ++current_;
+ else
+ break;
+ }
+}
+
+
+bool
+Reader::match( Location pattern,
+ int patternLength )
+{
+ if ( end_ - current_ < patternLength )
+ return false;
+ int index = patternLength;
+ while ( index-- )
+ if ( current_[index] != pattern[index] )
+ return false;
+ current_ += patternLength;
+ return true;
+}
+
+
+bool
+Reader::readComment()
+{
+ Location commentBegin = current_ - 1;
+ Char c = getNextChar();
+ bool successful = false;
+ if ( c == '*' )
+ successful = readCStyleComment();
+ else if ( c == '/' )
+ successful = readCppStyleComment();
+ if ( !successful )
+ return false;
+
+ if ( collectComments_ )
+ {
+ CommentPlacement placement = commentBefore;
+ if ( lastValueEnd_ && !containsNewLine( lastValueEnd_, commentBegin ) )
+ {
+ if ( c != '*' || !containsNewLine( commentBegin, current_ ) )
+ placement = commentAfterOnSameLine;
+ }
+
+ addComment( commentBegin, current_, placement );
+ }
+ return true;
+}
+
+
+void
+Reader::addComment( Location begin,
+ Location end,
+ CommentPlacement placement )
+{
+ assert( collectComments_ );
+ if ( placement == commentAfterOnSameLine )
+ {
+ assert( lastValue_ != 0 );
+ lastValue_->setComment( std::string( begin, end ), placement );
+ }
+ else
+ {
+ if ( !commentsBefore_.empty() )
+ commentsBefore_ += "\n";
+ commentsBefore_ += std::string( begin, end );
+ }
+}
+
+
+bool
+Reader::readCStyleComment()
+{
+ while ( current_ != end_ )
+ {
+ Char c = getNextChar();
+ if ( c == '*' && *current_ == '/' )
+ break;
+ }
+ return getNextChar() == '/';
+}
+
+
+bool
+Reader::readCppStyleComment()
+{
+ while ( current_ != end_ )
+ {
+ Char c = getNextChar();
+ if ( c == '\r' || c == '\n' )
+ break;
+ }
+ return true;
+}
+
+
+void
+Reader::readNumber()
+{
+ while ( current_ != end_ )
+ {
+ if ( !(*current_ >= '0' && *current_ <= '9') &&
+ !in( *current_, '.', 'e', 'E', '+', '-' ) )
+ break;
+ ++current_;
+ }
+}
+
+bool
+Reader::readString()
+{
+ Char c = 0;
+ while ( current_ != end_ )
+ {
+ c = getNextChar();
+ if ( c == '\\' )
+ getNextChar();
+ else if ( c == '"' )
+ break;
+ }
+ return c == '"';
+}
+
+
+bool
+Reader::readObject( Token &tokenStart )
+{
+ Token tokenName;
+ std::string name;
+ currentValue() = Value( objectValue );
+ while ( readToken( tokenName ) )
+ {
+ bool initialTokenOk = true;
+ while ( tokenName.type_ == tokenComment && initialTokenOk )
+ initialTokenOk = readToken( tokenName );
+ if ( !initialTokenOk )
+ break;
+ if ( tokenName.type_ == tokenObjectEnd && name.empty() ) // empty object
+ return true;
+ if ( tokenName.type_ != tokenString )
+ break;
+
+ name = "";
+ if ( !decodeString( tokenName, name ) )
+ return recoverFromError( tokenObjectEnd );
+
+ Token colon;
+ if ( !readToken( colon ) || colon.type_ != tokenMemberSeparator )
+ {
+ return addErrorAndRecover( "Missing ':' after object member name",
+ colon,
+ tokenObjectEnd );
+ }
+ Value &value = currentValue()[ name ];
+ nodes_.push( &value );
+ bool ok = readValue();
+ nodes_.pop();
+ if ( !ok ) // error already set
+ return recoverFromError( tokenObjectEnd );
+
+ Token comma;
+ if ( !readToken( comma )
+ || ( comma.type_ != tokenObjectEnd &&
+ comma.type_ != tokenArraySeparator &&
+ comma.type_ != tokenComment ) )
+ {
+ return addErrorAndRecover( "Missing ',' or '}' in object declaration",
+ comma,
+ tokenObjectEnd );
+ }
+ bool finalizeTokenOk = true;
+ while ( comma.type_ == tokenComment &&
+ finalizeTokenOk )
+ finalizeTokenOk = readToken( comma );
+ if ( comma.type_ == tokenObjectEnd )
+ return true;
+ }
+ return addErrorAndRecover( "Missing '}' or object member name",
+ tokenName,
+ tokenObjectEnd );
+}
+
+
+bool
+Reader::readArray( Token &tokenStart )
+{
+ currentValue() = Value( arrayValue );
+ skipSpaces();
+ if ( *current_ == ']' ) // empty array
+ {
+ Token endArray;
+ readToken( endArray );
+ return true;
+ }
+ int index = 0;
+ while ( true )
+ {
+ Value &value = currentValue()[ index++ ];
+ nodes_.push( &value );
+ bool ok = readValue();
+ nodes_.pop();
+ if ( !ok ) // error already set
+ return recoverFromError( tokenArrayEnd );
+
+ Token token;
+ // Accept Comment after last item in the array.
+ ok = readToken( token );
+ while ( token.type_ == tokenComment && ok )
+ {
+ ok = readToken( token );
+ }
+ bool badTokenType = ( token.type_ == tokenArraySeparator &&
+ token.type_ == tokenArrayEnd );
+ if ( !ok || badTokenType )
+ {
+ return addErrorAndRecover( "Missing ',' or ']' in array declaration",
+ token,
+ tokenArrayEnd );
+ }
+ if ( token.type_ == tokenArrayEnd )
+ break;
+ }
+ return true;
+}
+
+
+bool
+Reader::decodeNumber( Token &token )
+{
+ bool isDouble = false;
+ for ( Location inspect = token.start_; inspect != token.end_; ++inspect )
+ {
+ isDouble = isDouble
+ || in( *inspect, '.', 'e', 'E', '+' )
+ || ( *inspect == '-' && inspect != token.start_ );
+ }
+ if ( isDouble )
+ return decodeDouble( token );
+ Location current = token.start_;
+ bool isNegative = *current == '-';
+ if ( isNegative )
+ ++current;
+ Value::UInt threshold = (isNegative ? Value::UInt(-Value::minInt)
+ : Value::maxUInt) / 10;
+ Value::UInt value = 0;
+ while ( current < token.end_ )
+ {
+ Char c = *current++;
+ if ( c < '0' || c > '9' )
+ return addError( "'" + std::string( token.start_, token.end_ ) + "' is not a number.", token );
+ if ( value >= threshold )
+ return decodeDouble( token );
+ value = value * 10 + Value::UInt(c - '0');
+ }
+ if ( isNegative )
+ currentValue() = -Value::Int( value );
+ else if ( value <= Value::UInt(Value::maxInt) )
+ currentValue() = Value::Int( value );
+ else
+ currentValue() = value;
+ return true;
+}
+
+
+bool
+Reader::decodeDouble( Token &token )
+{
+ double value = 0;
+ const int bufferSize = 32;
+ int count;
+ int length = int(token.end_ - token.start_);
+ if ( length <= bufferSize )
+ {
+ Char buffer[bufferSize];
+ memcpy( buffer, token.start_, length );
+ buffer[length] = 0;
+ count = sscanf( buffer, "%lf", &value );
+ }
+ else
+ {
+ std::string buffer( token.start_, token.end_ );
+ count = sscanf( buffer.c_str(), "%lf", &value );
+ }
+
+ if ( count != 1 )
+ return addError( "'" + std::string( token.start_, token.end_ ) + "' is not a number.", token );
+ currentValue() = value;
+ return true;
+}
+
+
+bool
+Reader::decodeString( Token &token )
+{
+ std::string decoded;
+ if ( !decodeString( token, decoded ) )
+ return false;
+ currentValue() = decoded;
+ return true;
+}
+
+
+bool
+Reader::decodeString( Token &token, std::string &decoded )
+{
+ decoded.reserve( token.end_ - token.start_ - 2 );
+ Location current = token.start_ + 1; // skip '"'
+ Location end = token.end_ - 1; // do not include '"'
+ while ( current != end )
+ {
+ Char c = *current++;
+ if ( c == '"' )
+ break;
+ else if ( c == '\\' )
+ {
+ if ( current == end )
+ return addError( "Empty escape sequence in string", token, current );
+ Char escape = *current++;
+ switch ( escape )
+ {
+ case '"': decoded += '"'; break;
+ case '/': decoded += '/'; break;
+ case '\\': decoded += '\\'; break;
+ case 'b': decoded += '\b'; break;
+ case 'f': decoded += '\f'; break;
+ case 'n': decoded += '\n'; break;
+ case 'r': decoded += '\r'; break;
+ case 't': decoded += '\t'; break;
+ case 'u':
+ {
+ unsigned int unicode;
+ if ( !decodeUnicodeCodePoint( token, current, end, unicode ) )
+ return false;
+ decoded += codePointToUTF8(unicode);
+ }
+ break;
+ default:
+ return addError( "Bad escape sequence in string", token, current );
+ }
+ }
+ else
+ {
+ decoded += c;
+ }
+ }
+ return true;
+}
+
+bool
+Reader::decodeUnicodeCodePoint( Token &token,
+ Location ¤t,
+ Location end,
+ unsigned int &unicode )
+{
+
+ if ( !decodeUnicodeEscapeSequence( token, current, end, unicode ) )
+ return false;
+ if (unicode >= 0xD800 && unicode <= 0xDBFF)
+ {
+ // surrogate pairs
+ if (end - current < 6)
+ return addError( "additional six characters expected to parse unicode surrogate pair.", token, current );
+ unsigned int surrogatePair;
+ if (*(current++) == '\\' && *(current++)== 'u')
+ {
+ if (decodeUnicodeEscapeSequence( token, current, end, surrogatePair ))
+ {
+ unicode = 0x10000 + ((unicode & 0x3FF) << 10) + (surrogatePair & 0x3FF);
+ }
+ else
+ return false;
+ }
+ else
+ return addError( "expecting another \\u token to begin the second half of a unicode surrogate pair", token, current );
+ }
+ return true;
+}
+
+bool
+Reader::decodeUnicodeEscapeSequence( Token &token,
+ Location ¤t,
+ Location end,
+ unsigned int &unicode )
+{
+ if ( end - current < 4 )
+ return addError( "Bad unicode escape sequence in string: four digits expected.", token, current );
+ unicode = 0;
+ for ( int index =0; index < 4; ++index )
+ {
+ Char c = *current++;
+ unicode *= 16;
+ if ( c >= '0' && c <= '9' )
+ unicode += c - '0';
+ else if ( c >= 'a' && c <= 'f' )
+ unicode += c - 'a' + 10;
+ else if ( c >= 'A' && c <= 'F' )
+ unicode += c - 'A' + 10;
+ else
+ return addError( "Bad unicode escape sequence in string: hexadecimal digit expected.", token, current );
+ }
+ return true;
+}
+
+
+bool
+Reader::addError( const std::string &message,
+ Token &token,
+ Location extra )
+{
+ ErrorInfo info;
+ info.token_ = token;
+ info.message_ = message;
+ info.extra_ = extra;
+ errors_.push_back( info );
+ return false;
+}
+
+
+bool
+Reader::recoverFromError( TokenType skipUntilToken )
+{
+ int errorCount = int(errors_.size());
+ Token skip;
+ while ( true )
+ {
+ if ( !readToken(skip) )
+ errors_.resize( errorCount ); // discard errors caused by recovery
+ if ( skip.type_ == skipUntilToken || skip.type_ == tokenEndOfStream )
+ break;
+ }
+ errors_.resize( errorCount );
+ return false;
+}
+
+
+bool
+Reader::addErrorAndRecover( const std::string &message,
+ Token &token,
+ TokenType skipUntilToken )
+{
+ addError( message, token );
+ return recoverFromError( skipUntilToken );
+}
+
+
+Value &
+Reader::currentValue()
+{
+ return *(nodes_.top());
+}
+
+
+Reader::Char
+Reader::getNextChar()
+{
+ if ( current_ == end_ )
+ return 0;
+ return *current_++;
+}
+
+
+void
+Reader::getLocationLineAndColumn( Location location,
+ int &line,
+ int &column ) const
+{
+ Location current = begin_;
+ Location lastLineStart = current;
+ line = 0;
+ while ( current < location && current != end_ )
+ {
+ Char c = *current++;
+ if ( c == '\r' )
+ {
+ if ( *current == '\n' )
+ ++current;
+ lastLineStart = current;
+ ++line;
+ }
+ else if ( c == '\n' )
+ {
+ lastLineStart = current;
+ ++line;
+ }
+ }
+ // column & line start at 1
+ column = int(location - lastLineStart) + 1;
+ ++line;
+}
+
+
+std::string
+Reader::getLocationLineAndColumn( Location location ) const
+{
+ int line, column;
+ getLocationLineAndColumn( location, line, column );
+ char buffer[18+16+16+1];
+ sprintf( buffer, "Line %d, Column %d", line, column );
+ return buffer;
+}
+
+
+std::string
+Reader::getFormatedErrorMessages() const
+{
+ std::string formattedMessage;
+ for ( Errors::const_iterator itError = errors_.begin();
+ itError != errors_.end();
+ ++itError )
+ {
+ const ErrorInfo &error = *itError;
+ formattedMessage += "* " + getLocationLineAndColumn( error.token_.start_ ) + "\n";
+ formattedMessage += " " + error.message_ + "\n";
+ if ( error.extra_ )
+ formattedMessage += "See " + getLocationLineAndColumn( error.extra_ ) + " for detail.\n";
+ }
+ return formattedMessage;
+}
+
+
+std::istream& operator>>( std::istream &sin, Value &root )
+{
+ Json::Reader reader;
+ bool ok = reader.parse(sin, root, true);
+ //JSON_ASSERT( ok );
+ if (!ok) throw std::runtime_error(reader.getFormatedErrorMessages());
+ return sin;
+}
+
+
+} // namespace Json
diff --git a/Demos/bdwallpaper/helper/jsoncpp/json_value.cpp b/Demos/bdwallpaper/helper/jsoncpp/json_value.cpp
new file mode 100644
index 00000000..7e555be0
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/json_value.cpp
@@ -0,0 +1,1718 @@
+#include
+#include "value.h"
+#include "writer.h"
+#include
+#include
+#include
+#include
+#ifdef JSON_USE_CPPTL
+# include
+#endif
+#include // size_t
+#ifndef JSON_USE_SIMPLE_INTERNAL_ALLOCATOR
+# include "json_batchallocator.h"
+#endif // #ifndef JSON_USE_SIMPLE_INTERNAL_ALLOCATOR
+
+#define JSON_ASSERT_UNREACHABLE assert( false )
+#define JSON_ASSERT( condition ) assert( condition ); // @todo <= change this into an exception throw
+#define JSON_ASSERT_MESSAGE( condition, message ) if (!( condition )) throw std::runtime_error( message );
+
+namespace Json {
+
+const Value Value::null;
+const Int Value::minInt = Int( ~(UInt(-1)/2) );
+const Int Value::maxInt = Int( UInt(-1)/2 );
+const UInt Value::maxUInt = UInt(-1);
+
+// A "safe" implementation of strdup. Allow null pointer to be passed.
+// Also avoid warning on msvc80.
+//
+//inline char *safeStringDup( const char *czstring )
+//{
+// if ( czstring )
+// {
+// const size_t length = (unsigned int)( strlen(czstring) + 1 );
+// char *newString = static_cast( malloc( length ) );
+// memcpy( newString, czstring, length );
+// return newString;
+// }
+// return 0;
+//}
+//
+//inline char *safeStringDup( const std::string &str )
+//{
+// if ( !str.empty() )
+// {
+// const size_t length = str.length();
+// char *newString = static_cast( malloc( length + 1 ) );
+// memcpy( newString, str.c_str(), length );
+// newString[length] = 0;
+// return newString;
+// }
+// return 0;
+//}
+
+ValueAllocator::~ValueAllocator()
+{
+}
+
+class DefaultValueAllocator : public ValueAllocator
+{
+public:
+ virtual ~DefaultValueAllocator()
+ {
+ }
+
+ virtual char *makeMemberName( const char *memberName )
+ {
+ return duplicateStringValue( memberName );
+ }
+
+ virtual void releaseMemberName( char *memberName )
+ {
+ releaseStringValue( memberName );
+ }
+
+ virtual char *duplicateStringValue( const char *value,
+ unsigned int length = unknown )
+ {
+ //@todo invesgate this old optimization
+ //if ( !value || value[0] == 0 )
+ // return 0;
+
+ if ( length == unknown )
+ length = (unsigned int)strlen(value);
+ char *newString = static_cast( malloc( length + 1 ) );
+ memcpy( newString, value, length );
+ newString[length] = 0;
+ return newString;
+ }
+
+ virtual void releaseStringValue( char *value )
+ {
+ if ( value )
+ free( value );
+ }
+};
+
+static ValueAllocator *&valueAllocator()
+{
+ static DefaultValueAllocator defaultAllocator;
+ static ValueAllocator *valueAllocator = &defaultAllocator;
+ return valueAllocator;
+}
+
+static struct DummyValueAllocatorInitializer {
+ DummyValueAllocatorInitializer()
+ {
+ valueAllocator(); // ensure valueAllocator() statics are initialized before main().
+ }
+} dummyValueAllocatorInitializer;
+
+
+
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// ValueInternals...
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+#ifdef JSON_VALUE_USE_INTERNAL_MAP
+# include "json_internalarray.inl"
+# include "json_internalmap.inl"
+#endif // JSON_VALUE_USE_INTERNAL_MAP
+
+# include "json_valueiterator.inl"
+
+
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// class Value::CommentInfo
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+
+
+Value::CommentInfo::CommentInfo()
+ : comment_( 0 )
+{
+}
+
+Value::CommentInfo::~CommentInfo()
+{
+ if ( comment_ )
+ valueAllocator()->releaseStringValue( comment_ );
+}
+
+
+void
+Value::CommentInfo::setComment( const char *text )
+{
+ if ( comment_ )
+ valueAllocator()->releaseStringValue( comment_ );
+ JSON_ASSERT( text );
+ JSON_ASSERT_MESSAGE( text[0]=='\0' || text[0]=='/', "Comments must start with /");
+ // It seems that /**/ style comments are acceptable as well.
+ comment_ = valueAllocator()->duplicateStringValue( text );
+}
+
+
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// class Value::CZString
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+# ifndef JSON_VALUE_USE_INTERNAL_MAP
+
+// Notes: index_ indicates if the string was allocated when
+// a string is stored.
+
+Value::CZString::CZString( int index )
+ : cstr_( 0 )
+ , index_( index )
+{
+}
+
+Value::CZString::CZString( const char *cstr, DuplicationPolicy allocate )
+ : cstr_( allocate == duplicate ? valueAllocator()->makeMemberName(cstr)
+ : cstr )
+ , index_( allocate )
+{
+}
+
+Value::CZString::CZString( const CZString &other )
+: cstr_( other.index_ != noDuplication && other.cstr_ != 0
+ ? valueAllocator()->makeMemberName( other.cstr_ )
+ : other.cstr_ )
+ , index_( other.cstr_ ? (other.index_ == noDuplication ? noDuplication : duplicate)
+ : other.index_ )
+{
+}
+
+Value::CZString::~CZString()
+{
+ if ( cstr_ && index_ == duplicate )
+ valueAllocator()->releaseMemberName( const_cast( cstr_ ) );
+}
+
+void
+Value::CZString::swap( CZString &other )
+{
+ std::swap( cstr_, other.cstr_ );
+ std::swap( index_, other.index_ );
+}
+
+Value::CZString &
+Value::CZString::operator =( const CZString &other )
+{
+ CZString temp( other );
+ swap( temp );
+ return *this;
+}
+
+bool
+Value::CZString::operator<( const CZString &other ) const
+{
+ if ( cstr_ )
+ return strcmp( cstr_, other.cstr_ ) < 0;
+ return index_ < other.index_;
+}
+
+bool
+Value::CZString::operator==( const CZString &other ) const
+{
+ if ( cstr_ )
+ return strcmp( cstr_, other.cstr_ ) == 0;
+ return index_ == other.index_;
+}
+
+
+int
+Value::CZString::index() const
+{
+ return index_;
+}
+
+
+const char *
+Value::CZString::c_str() const
+{
+ return cstr_;
+}
+
+bool
+Value::CZString::isStaticString() const
+{
+ return index_ == noDuplication;
+}
+
+#endif // ifndef JSON_VALUE_USE_INTERNAL_MAP
+
+
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// class Value::Value
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+
+/*! \internal Default constructor initialization must be equivalent to:
+ * memset( this, 0, sizeof(Value) )
+ * This optimization is used in ValueInternalMap fast allocator.
+ */
+Value::Value( ValueType type )
+ : type_( type )
+ , allocated_( 0 )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ switch ( type )
+ {
+ case nullValue:
+ break;
+ case intValue:
+ case uintValue:
+ value_.int_ = 0;
+ break;
+ case realValue:
+ value_.real_ = 0.0;
+ break;
+ case stringValue:
+ value_.string_ = 0;
+ break;
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue:
+ case objectValue:
+ value_.map_ = new ObjectValues();
+ break;
+#else
+ case arrayValue:
+ value_.array_ = arrayAllocator()->newArray();
+ break;
+ case objectValue:
+ value_.map_ = mapAllocator()->newMap();
+ break;
+#endif
+ case booleanValue:
+ value_.bool_ = false;
+ break;
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+}
+
+
+Value::Value( Int value )
+ : type_( intValue )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ value_.int_ = value;
+}
+
+
+Value::Value( UInt value )
+ : type_( uintValue )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ value_.uint_ = value;
+}
+
+Value::Value( double value )
+ : type_( realValue )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ value_.real_ = value;
+}
+
+Value::Value( const char *value )
+ : type_( stringValue )
+ , allocated_( true )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ value_.string_ = valueAllocator()->duplicateStringValue( value );
+}
+
+
+Value::Value( const char *beginValue,
+ const char *endValue )
+ : type_( stringValue )
+ , allocated_( true )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ value_.string_ = valueAllocator()->duplicateStringValue( beginValue,
+ UInt(endValue - beginValue) );
+}
+
+
+Value::Value( const std::string &value )
+ : type_( stringValue )
+ , allocated_( true )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ value_.string_ = valueAllocator()->duplicateStringValue( value.c_str(),
+ (unsigned int)value.length() );
+
+}
+
+Value::Value( const StaticString &value )
+ : type_( stringValue )
+ , allocated_( false )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ value_.string_ = const_cast( value.c_str() );
+}
+
+
+# ifdef JSON_USE_CPPTL
+Value::Value( const CppTL::ConstString &value )
+ : type_( stringValue )
+ , allocated_( true )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ value_.string_ = valueAllocator()->duplicateStringValue( value, value.length() );
+}
+# endif
+
+Value::Value( bool value )
+ : type_( booleanValue )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ value_.bool_ = value;
+}
+
+
+Value::Value( const Value &other )
+ : type_( other.type_ )
+ , comments_( 0 )
+# ifdef JSON_VALUE_USE_INTERNAL_MAP
+ , itemIsUsed_( 0 )
+#endif
+{
+ switch ( type_ )
+ {
+ case nullValue:
+ case intValue:
+ case uintValue:
+ case realValue:
+ case booleanValue:
+ value_ = other.value_;
+ break;
+ case stringValue:
+ if ( other.value_.string_ )
+ {
+ value_.string_ = valueAllocator()->duplicateStringValue( other.value_.string_ );
+ allocated_ = true;
+ }
+ else
+ value_.string_ = 0;
+ break;
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue:
+ case objectValue:
+ value_.map_ = new ObjectValues( *other.value_.map_ );
+ break;
+#else
+ case arrayValue:
+ value_.array_ = arrayAllocator()->newArrayCopy( *other.value_.array_ );
+ break;
+ case objectValue:
+ value_.map_ = mapAllocator()->newMapCopy( *other.value_.map_ );
+ break;
+#endif
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ if ( other.comments_ )
+ {
+ comments_ = new CommentInfo[numberOfCommentPlacement];
+ for ( int comment =0; comment < numberOfCommentPlacement; ++comment )
+ {
+ const CommentInfo &otherComment = other.comments_[comment];
+ if ( otherComment.comment_ )
+ comments_[comment].setComment( otherComment.comment_ );
+ }
+ }
+}
+
+
+Value::~Value()
+{
+ switch ( type_ )
+ {
+ case nullValue:
+ case intValue:
+ case uintValue:
+ case realValue:
+ case booleanValue:
+ break;
+ case stringValue:
+ if ( allocated_ )
+ valueAllocator()->releaseStringValue( value_.string_ );
+ break;
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue:
+ case objectValue:
+ delete value_.map_;
+ break;
+#else
+ case arrayValue:
+ arrayAllocator()->destructArray( value_.array_ );
+ break;
+ case objectValue:
+ mapAllocator()->destructMap( value_.map_ );
+ break;
+#endif
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+
+ if ( comments_ )
+ delete[] comments_;
+}
+
+Value &
+Value::operator=( const Value &other )
+{
+ Value temp( other );
+ swap( temp );
+ return *this;
+}
+
+void
+Value::swap( Value &other )
+{
+ ValueType temp = type_;
+ type_ = other.type_;
+ other.type_ = temp;
+ std::swap( value_, other.value_ );
+ int temp2 = allocated_;
+ allocated_ = other.allocated_;
+ other.allocated_ = temp2;
+}
+
+ValueType
+Value::type() const
+{
+ return type_;
+}
+
+
+int
+Value::compare( const Value &other )
+{
+ /*
+ int typeDelta = other.type_ - type_;
+ switch ( type_ )
+ {
+ case nullValue:
+
+ return other.type_ == type_;
+ case intValue:
+ if ( other.type_.isNumeric()
+ case uintValue:
+ case realValue:
+ case booleanValue:
+ break;
+ case stringValue,
+ break;
+ case arrayValue:
+ delete value_.array_;
+ break;
+ case objectValue:
+ delete value_.map_;
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ */
+ return 0; // unreachable
+}
+
+bool
+Value::operator <( const Value &other ) const
+{
+ int typeDelta = type_ - other.type_;
+ if ( typeDelta )
+ return typeDelta < 0 ? true : false;
+ switch ( type_ )
+ {
+ case nullValue:
+ return false;
+ case intValue:
+ return value_.int_ < other.value_.int_;
+ case uintValue:
+ return value_.uint_ < other.value_.uint_;
+ case realValue:
+ return value_.real_ < other.value_.real_;
+ case booleanValue:
+ return value_.bool_ < other.value_.bool_;
+ case stringValue:
+ return ( value_.string_ == 0 && other.value_.string_ )
+ || ( other.value_.string_
+ && value_.string_
+ && strcmp( value_.string_, other.value_.string_ ) < 0 );
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue:
+ case objectValue:
+ {
+ int delta = int( value_.map_->size() - other.value_.map_->size() );
+ if ( delta )
+ return delta < 0;
+ return (*value_.map_) < (*other.value_.map_);
+ }
+#else
+ case arrayValue:
+ return value_.array_->compare( *(other.value_.array_) ) < 0;
+ case objectValue:
+ return value_.map_->compare( *(other.value_.map_) ) < 0;
+#endif
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ return 0; // unreachable
+}
+
+bool
+Value::operator <=( const Value &other ) const
+{
+ return !(other > *this);
+}
+
+bool
+Value::operator >=( const Value &other ) const
+{
+ return !(*this < other);
+}
+
+bool
+Value::operator >( const Value &other ) const
+{
+ return other < *this;
+}
+
+bool
+Value::operator ==( const Value &other ) const
+{
+ //if ( type_ != other.type_ )
+ // GCC 2.95.3 says:
+ // attempt to take address of bit-field structure member `Json::Value::type_'
+ // Beats me, but a temp solves the problem.
+ int temp = other.type_;
+ if ( type_ != temp )
+ return false;
+ switch ( type_ )
+ {
+ case nullValue:
+ return true;
+ case intValue:
+ return value_.int_ == other.value_.int_;
+ case uintValue:
+ return value_.uint_ == other.value_.uint_;
+ case realValue:
+ return value_.real_ == other.value_.real_;
+ case booleanValue:
+ return value_.bool_ == other.value_.bool_;
+ case stringValue:
+ return ( value_.string_ == other.value_.string_ )
+ || ( other.value_.string_
+ && value_.string_
+ && strcmp( value_.string_, other.value_.string_ ) == 0 );
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue:
+ case objectValue:
+ return value_.map_->size() == other.value_.map_->size()
+ && (*value_.map_) == (*other.value_.map_);
+#else
+ case arrayValue:
+ return value_.array_->compare( *(other.value_.array_) ) == 0;
+ case objectValue:
+ return value_.map_->compare( *(other.value_.map_) ) == 0;
+#endif
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ return 0; // unreachable
+}
+
+bool
+Value::operator !=( const Value &other ) const
+{
+ return !( *this == other );
+}
+
+const char *
+Value::asCString() const
+{
+ JSON_ASSERT( type_ == stringValue );
+ return value_.string_;
+}
+
+
+std::string
+Value::asString() const
+{
+ switch ( type_ )
+ {
+ case nullValue:
+ return "";
+ case stringValue:
+ return value_.string_ ? value_.string_ : "";
+ case booleanValue:
+ return value_.bool_ ? "true" : "false";
+ case intValue:
+ case uintValue:
+ case realValue:
+ case arrayValue:
+ case objectValue:
+ JSON_ASSERT_MESSAGE( false, "Type is not convertible to string" );
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ return ""; // unreachable
+}
+
+# ifdef JSON_USE_CPPTL
+CppTL::ConstString
+Value::asConstString() const
+{
+ return CppTL::ConstString( asString().c_str() );
+}
+# endif
+
+Value::Int
+Value::asInt() const
+{
+ switch ( type_ )
+ {
+ case nullValue:
+ return 0;
+ case intValue:
+ return value_.int_;
+ case uintValue:
+ JSON_ASSERT_MESSAGE( value_.uint_ < (unsigned)maxInt, "integer out of signed integer range" );
+ return value_.uint_;
+ case realValue:
+ JSON_ASSERT_MESSAGE( value_.real_ >= minInt && value_.real_ <= maxInt, "Real out of signed integer range" );
+ return Int( value_.real_ );
+ case booleanValue:
+ return value_.bool_ ? 1 : 0;
+ case stringValue:
+ case arrayValue:
+ case objectValue:
+ JSON_ASSERT_MESSAGE( false, "Type is not convertible to int" );
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ return 0; // unreachable;
+}
+
+Value::UInt
+Value::asUInt() const
+{
+ switch ( type_ )
+ {
+ case nullValue:
+ return 0;
+ case intValue:
+ JSON_ASSERT_MESSAGE( value_.int_ >= 0, "Negative integer can not be converted to unsigned integer" );
+ return value_.int_;
+ case uintValue:
+ return value_.uint_;
+ case realValue:
+ JSON_ASSERT_MESSAGE( value_.real_ >= 0 && value_.real_ <= maxUInt, "Real out of unsigned integer range" );
+ return UInt( value_.real_ );
+ case booleanValue:
+ return value_.bool_ ? 1 : 0;
+ case stringValue:
+ case arrayValue:
+ case objectValue:
+ JSON_ASSERT_MESSAGE( false, "Type is not convertible to uint" );
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ return 0; // unreachable;
+}
+
+double
+Value::asDouble() const
+{
+ switch ( type_ )
+ {
+ case nullValue:
+ return 0.0;
+ case intValue:
+ return value_.int_;
+ case uintValue:
+ return value_.uint_;
+ case realValue:
+ return value_.real_;
+ case booleanValue:
+ return value_.bool_ ? 1.0 : 0.0;
+ case stringValue:
+ case arrayValue:
+ case objectValue:
+ JSON_ASSERT_MESSAGE( false, "Type is not convertible to double" );
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ return 0; // unreachable;
+}
+
+bool
+Value::asBool() const
+{
+ switch ( type_ )
+ {
+ case nullValue:
+ return false;
+ case intValue:
+ case uintValue:
+ return value_.int_ != 0;
+ case realValue:
+ return value_.real_ != 0.0;
+ case booleanValue:
+ return value_.bool_;
+ case stringValue:
+ return value_.string_ && value_.string_[0] != 0;
+ case arrayValue:
+ case objectValue:
+ return value_.map_->size() != 0;
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ return false; // unreachable;
+}
+
+
+bool
+Value::isConvertibleTo( ValueType other ) const
+{
+ switch ( type_ )
+ {
+ case nullValue:
+ return true;
+ case intValue:
+ return ( other == nullValue && value_.int_ == 0 )
+ || other == intValue
+ || ( other == uintValue && value_.int_ >= 0 )
+ || other == realValue
+ || other == stringValue
+ || other == booleanValue;
+ case uintValue:
+ return ( other == nullValue && value_.uint_ == 0 )
+ || ( other == intValue && value_.uint_ <= (unsigned)maxInt )
+ || other == uintValue
+ || other == realValue
+ || other == stringValue
+ || other == booleanValue;
+ case realValue:
+ return ( other == nullValue && value_.real_ == 0.0 )
+ || ( other == intValue && value_.real_ >= minInt && value_.real_ <= maxInt )
+ || ( other == uintValue && value_.real_ >= 0 && value_.real_ <= maxUInt )
+ || other == realValue
+ || other == stringValue
+ || other == booleanValue;
+ case booleanValue:
+ return ( other == nullValue && value_.bool_ == false )
+ || other == intValue
+ || other == uintValue
+ || other == realValue
+ || other == stringValue
+ || other == booleanValue;
+ case stringValue:
+ return other == stringValue
+ || ( other == nullValue && (!value_.string_ || value_.string_[0] == 0) );
+ case arrayValue:
+ return other == arrayValue
+ || ( other == nullValue && value_.map_->size() == 0 );
+ case objectValue:
+ return other == objectValue
+ || ( other == nullValue && value_.map_->size() == 0 );
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ return false; // unreachable;
+}
+
+
+/// Number of values in array or object
+Value::UInt
+Value::size() const
+{
+ switch ( type_ )
+ {
+ case nullValue:
+ case intValue:
+ case uintValue:
+ case realValue:
+ case booleanValue:
+ case stringValue:
+ return 0;
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue: // size of the array is highest index + 1
+ if ( !value_.map_->empty() )
+ {
+ ObjectValues::const_iterator itLast = value_.map_->end();
+ --itLast;
+ return (*itLast).first.index()+1;
+ }
+ return 0;
+ case objectValue:
+ return Int( value_.map_->size() );
+#else
+ case arrayValue:
+ return Int( value_.array_->size() );
+ case objectValue:
+ return Int( value_.map_->size() );
+#endif
+ default:
+ JSON_ASSERT_UNREACHABLE;
+ }
+ return 0; // unreachable;
+}
+
+
+bool
+Value::empty() const
+{
+ if ( isNull() || isArray() || isObject() )
+ return size() == 0u;
+ else
+ return false;
+}
+
+
+bool
+Value::operator!() const
+{
+ return isNull();
+}
+
+
+void
+Value::clear()
+{
+ JSON_ASSERT( type_ == nullValue || type_ == arrayValue || type_ == objectValue );
+
+ switch ( type_ )
+ {
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue:
+ case objectValue:
+ value_.map_->clear();
+ break;
+#else
+ case arrayValue:
+ value_.array_->clear();
+ break;
+ case objectValue:
+ value_.map_->clear();
+ break;
+#endif
+ default:
+ break;
+ }
+}
+
+void
+Value::resize( UInt newSize )
+{
+ JSON_ASSERT( type_ == nullValue || type_ == arrayValue );
+ if ( type_ == nullValue )
+ *this = Value( arrayValue );
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ UInt oldSize = size();
+ if ( newSize == 0 )
+ clear();
+ else if ( newSize > oldSize )
+ (*this)[ newSize - 1 ];
+ else
+ {
+ for ( UInt index = newSize; index < oldSize; ++index )
+ value_.map_->erase( index );
+ assert( size() == newSize );
+ }
+#else
+ value_.array_->resize( newSize );
+#endif
+}
+
+
+Value &
+Value::operator[]( UInt index )
+{
+ JSON_ASSERT( type_ == nullValue || type_ == arrayValue );
+ if ( type_ == nullValue )
+ *this = Value( arrayValue );
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ CZString key( index );
+ ObjectValues::iterator it = value_.map_->lower_bound( key );
+ if ( it != value_.map_->end() && (*it).first == key )
+ return (*it).second;
+
+ ObjectValues::value_type defaultValue( key, null );
+ it = value_.map_->insert( it, defaultValue );
+ return (*it).second;
+#else
+ return value_.array_->resolveReference( index );
+#endif
+}
+
+
+const Value &
+Value::operator[]( UInt index ) const
+{
+ JSON_ASSERT( type_ == nullValue || type_ == arrayValue );
+ if ( type_ == nullValue )
+ return null;
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ CZString key( index );
+ ObjectValues::const_iterator it = value_.map_->find( key );
+ if ( it == value_.map_->end() )
+ return null;
+ return (*it).second;
+#else
+ Value *value = value_.array_->find( index );
+ return value ? *value : null;
+#endif
+}
+
+
+Value &
+Value::operator[]( const char *key )
+{
+ return resolveReference( key, false );
+}
+
+
+Value &
+Value::resolveReference( const char *key,
+ bool isStatic )
+{
+ JSON_ASSERT( type_ == nullValue || type_ == objectValue );
+ if ( type_ == nullValue )
+ *this = Value( objectValue );
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ CZString actualKey( key, isStatic ? CZString::noDuplication
+ : CZString::duplicateOnCopy );
+ ObjectValues::iterator it = value_.map_->lower_bound( actualKey );
+ if ( it != value_.map_->end() && (*it).first == actualKey )
+ return (*it).second;
+
+ ObjectValues::value_type defaultValue( actualKey, null );
+ it = value_.map_->insert( it, defaultValue );
+ Value &value = (*it).second;
+ return value;
+#else
+ return value_.map_->resolveReference( key, isStatic );
+#endif
+}
+
+
+Value
+Value::get( UInt index,
+ const Value &defaultValue ) const
+{
+ const Value *value = &((*this)[index]);
+ return value == &null ? defaultValue : *value;
+}
+
+
+bool
+Value::isValidIndex( UInt index ) const
+{
+ return index < size();
+}
+
+
+
+const Value &
+Value::operator[]( const char *key ) const
+{
+ JSON_ASSERT( type_ == nullValue || type_ == objectValue );
+ if ( type_ == nullValue )
+ return null;
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ CZString actualKey( key, CZString::noDuplication );
+ ObjectValues::const_iterator it = value_.map_->find( actualKey );
+ if ( it == value_.map_->end() )
+ return null;
+ return (*it).second;
+#else
+ const Value *value = value_.map_->find( key );
+ return value ? *value : null;
+#endif
+}
+
+
+Value &
+Value::operator[]( const std::string &key )
+{
+ return (*this)[ key.c_str() ];
+}
+
+
+const Value &
+Value::operator[]( const std::string &key ) const
+{
+ return (*this)[ key.c_str() ];
+}
+
+Value &
+Value::operator[]( const StaticString &key )
+{
+ return resolveReference( key, true );
+}
+
+
+# ifdef JSON_USE_CPPTL
+Value &
+Value::operator[]( const CppTL::ConstString &key )
+{
+ return (*this)[ key.c_str() ];
+}
+
+
+const Value &
+Value::operator[]( const CppTL::ConstString &key ) const
+{
+ return (*this)[ key.c_str() ];
+}
+# endif
+
+
+Value &
+Value::append( const Value &value )
+{
+ return (*this)[size()] = value;
+}
+
+
+Value
+Value::get( const char *key,
+ const Value &defaultValue ) const
+{
+ const Value *value = &((*this)[key]);
+ return value == &null ? defaultValue : *value;
+}
+
+
+Value
+Value::get( const std::string &key,
+ const Value &defaultValue ) const
+{
+ return get( key.c_str(), defaultValue );
+}
+
+Value
+Value::removeMember( const char* key )
+{
+ JSON_ASSERT( type_ == nullValue || type_ == objectValue );
+ if ( type_ == nullValue )
+ return null;
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ CZString actualKey( key, CZString::noDuplication );
+ ObjectValues::iterator it = value_.map_->find( actualKey );
+ if ( it == value_.map_->end() )
+ return null;
+ Value old(it->second);
+ value_.map_->erase(it);
+ return old;
+#else
+ Value *value = value_.map_->find( key );
+ if (value){
+ Value old(*value);
+ value_.map_.remove( key );
+ return old;
+ } else {
+ return null;
+ }
+#endif
+}
+
+Value
+Value::removeMember( const std::string &key )
+{
+ return removeMember( key.c_str() );
+}
+
+# ifdef JSON_USE_CPPTL
+Value
+Value::get( const CppTL::ConstString &key,
+ const Value &defaultValue ) const
+{
+ return get( key.c_str(), defaultValue );
+}
+# endif
+
+bool
+Value::isMember( const char *key ) const
+{
+ const Value *value = &((*this)[key]);
+ return value != &null;
+}
+
+
+bool
+Value::isMember( const std::string &key ) const
+{
+ return isMember( key.c_str() );
+}
+
+
+# ifdef JSON_USE_CPPTL
+bool
+Value::isMember( const CppTL::ConstString &key ) const
+{
+ return isMember( key.c_str() );
+}
+#endif
+
+Value::Members
+Value::getMemberNames() const
+{
+ JSON_ASSERT( type_ == nullValue || type_ == objectValue );
+ if ( type_ == nullValue )
+ return Value::Members();
+ Members members;
+ members.reserve( value_.map_->size() );
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ ObjectValues::const_iterator it = value_.map_->begin();
+ ObjectValues::const_iterator itEnd = value_.map_->end();
+ for ( ; it != itEnd; ++it )
+ members.push_back( std::string( (*it).first.c_str() ) );
+#else
+ ValueInternalMap::IteratorState it;
+ ValueInternalMap::IteratorState itEnd;
+ value_.map_->makeBeginIterator( it );
+ value_.map_->makeEndIterator( itEnd );
+ for ( ; !ValueInternalMap::equals( it, itEnd ); ValueInternalMap::increment(it) )
+ members.push_back( std::string( ValueInternalMap::key( it ) ) );
+#endif
+ return members;
+}
+//
+//# ifdef JSON_USE_CPPTL
+//EnumMemberNames
+//Value::enumMemberNames() const
+//{
+// if ( type_ == objectValue )
+// {
+// return CppTL::Enum::any( CppTL::Enum::transform(
+// CppTL::Enum::keys( *(value_.map_), CppTL::Type() ),
+// MemberNamesTransform() ) );
+// }
+// return EnumMemberNames();
+//}
+//
+//
+//EnumValues
+//Value::enumValues() const
+//{
+// if ( type_ == objectValue || type_ == arrayValue )
+// return CppTL::Enum::anyValues( *(value_.map_),
+// CppTL::Type() );
+// return EnumValues();
+//}
+//
+//# endif
+
+
+bool
+Value::isNull() const
+{
+ return type_ == nullValue;
+}
+
+
+bool
+Value::isBool() const
+{
+ return type_ == booleanValue;
+}
+
+
+bool
+Value::isInt() const
+{
+ return type_ == intValue;
+}
+
+
+bool
+Value::isUInt() const
+{
+ return type_ == uintValue;
+}
+
+
+bool
+Value::isIntegral() const
+{
+ return type_ == intValue
+ || type_ == uintValue
+ || type_ == booleanValue;
+}
+
+
+bool
+Value::isDouble() const
+{
+ return type_ == realValue;
+}
+
+
+bool
+Value::isNumeric() const
+{
+ return isIntegral() || isDouble();
+}
+
+
+bool
+Value::isString() const
+{
+ return type_ == stringValue;
+}
+
+
+bool
+Value::isArray() const
+{
+ return type_ == nullValue || type_ == arrayValue;
+}
+
+
+bool
+Value::isObject() const
+{
+ return type_ == nullValue || type_ == objectValue;
+}
+
+
+void
+Value::setComment( const char *comment,
+ CommentPlacement placement )
+{
+ if ( !comments_ )
+ comments_ = new CommentInfo[numberOfCommentPlacement];
+ comments_[placement].setComment( comment );
+}
+
+
+void
+Value::setComment( const std::string &comment,
+ CommentPlacement placement )
+{
+ setComment( comment.c_str(), placement );
+}
+
+
+bool
+Value::hasComment( CommentPlacement placement ) const
+{
+ return comments_ != 0 && comments_[placement].comment_ != 0;
+}
+
+std::string
+Value::getComment( CommentPlacement placement ) const
+{
+ if ( hasComment(placement) )
+ return comments_[placement].comment_;
+ return "";
+}
+
+
+std::string
+Value::toStyledString() const
+{
+ StyledWriter writer;
+ return writer.write( *this );
+}
+
+
+Value::const_iterator
+Value::begin() const
+{
+ switch ( type_ )
+ {
+#ifdef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue:
+ if ( value_.array_ )
+ {
+ ValueInternalArray::IteratorState it;
+ value_.array_->makeBeginIterator( it );
+ return const_iterator( it );
+ }
+ break;
+ case objectValue:
+ if ( value_.map_ )
+ {
+ ValueInternalMap::IteratorState it;
+ value_.map_->makeBeginIterator( it );
+ return const_iterator( it );
+ }
+ break;
+#else
+ case arrayValue:
+ case objectValue:
+ if ( value_.map_ )
+ return const_iterator( value_.map_->begin() );
+ break;
+#endif
+ default:
+ break;
+ }
+ return const_iterator();
+}
+
+Value::const_iterator
+Value::end() const
+{
+ switch ( type_ )
+ {
+#ifdef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue:
+ if ( value_.array_ )
+ {
+ ValueInternalArray::IteratorState it;
+ value_.array_->makeEndIterator( it );
+ return const_iterator( it );
+ }
+ break;
+ case objectValue:
+ if ( value_.map_ )
+ {
+ ValueInternalMap::IteratorState it;
+ value_.map_->makeEndIterator( it );
+ return const_iterator( it );
+ }
+ break;
+#else
+ case arrayValue:
+ case objectValue:
+ if ( value_.map_ )
+ return const_iterator( value_.map_->end() );
+ break;
+#endif
+ default:
+ break;
+ }
+ return const_iterator();
+}
+
+
+Value::iterator
+Value::begin()
+{
+ switch ( type_ )
+ {
+#ifdef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue:
+ if ( value_.array_ )
+ {
+ ValueInternalArray::IteratorState it;
+ value_.array_->makeBeginIterator( it );
+ return iterator( it );
+ }
+ break;
+ case objectValue:
+ if ( value_.map_ )
+ {
+ ValueInternalMap::IteratorState it;
+ value_.map_->makeBeginIterator( it );
+ return iterator( it );
+ }
+ break;
+#else
+ case arrayValue:
+ case objectValue:
+ if ( value_.map_ )
+ return iterator( value_.map_->begin() );
+ break;
+#endif
+ default:
+ break;
+ }
+ return iterator();
+}
+
+Value::iterator
+Value::end()
+{
+ switch ( type_ )
+ {
+#ifdef JSON_VALUE_USE_INTERNAL_MAP
+ case arrayValue:
+ if ( value_.array_ )
+ {
+ ValueInternalArray::IteratorState it;
+ value_.array_->makeEndIterator( it );
+ return iterator( it );
+ }
+ break;
+ case objectValue:
+ if ( value_.map_ )
+ {
+ ValueInternalMap::IteratorState it;
+ value_.map_->makeEndIterator( it );
+ return iterator( it );
+ }
+ break;
+#else
+ case arrayValue:
+ case objectValue:
+ if ( value_.map_ )
+ return iterator( value_.map_->end() );
+ break;
+#endif
+ default:
+ break;
+ }
+ return iterator();
+}
+
+
+// class PathArgument
+// //////////////////////////////////////////////////////////////////
+
+PathArgument::PathArgument()
+ : kind_( kindNone )
+{
+}
+
+
+PathArgument::PathArgument( Value::UInt index )
+ : index_( index )
+ , kind_( kindIndex )
+{
+}
+
+
+PathArgument::PathArgument( const char *key )
+ : key_( key )
+ , kind_( kindKey )
+{
+}
+
+
+PathArgument::PathArgument( const std::string &key )
+ : key_( key.c_str() )
+ , kind_( kindKey )
+{
+}
+
+// class Path
+// //////////////////////////////////////////////////////////////////
+
+Path::Path( const std::string &path,
+ const PathArgument &a1,
+ const PathArgument &a2,
+ const PathArgument &a3,
+ const PathArgument &a4,
+ const PathArgument &a5 )
+{
+ InArgs in;
+ in.push_back( &a1 );
+ in.push_back( &a2 );
+ in.push_back( &a3 );
+ in.push_back( &a4 );
+ in.push_back( &a5 );
+ makePath( path, in );
+}
+
+
+void
+Path::makePath( const std::string &path,
+ const InArgs &in )
+{
+ const char *current = path.c_str();
+ const char *end = current + path.length();
+ InArgs::const_iterator itInArg = in.begin();
+ while ( current != end )
+ {
+ if ( *current == '[' )
+ {
+ ++current;
+ if ( *current == '%' )
+ addPathInArg( path, in, itInArg, PathArgument::kindIndex );
+ else
+ {
+ Value::UInt index = 0;
+ for ( ; current != end && *current >= '0' && *current <= '9'; ++current )
+ index = index * 10 + Value::UInt(*current - '0');
+ args_.push_back( index );
+ }
+ if ( current == end || *current++ != ']' )
+ invalidPath( path, int(current - path.c_str()) );
+ }
+ else if ( *current == '%' )
+ {
+ addPathInArg( path, in, itInArg, PathArgument::kindKey );
+ ++current;
+ }
+ else if ( *current == '.' )
+ {
+ ++current;
+ }
+ else
+ {
+ const char *beginName = current;
+ while ( current != end && !strchr( "[.", *current ) )
+ ++current;
+ args_.push_back( std::string( beginName, current ) );
+ }
+ }
+}
+
+
+void
+Path::addPathInArg( const std::string &path,
+ const InArgs &in,
+ InArgs::const_iterator &itInArg,
+ PathArgument::Kind kind )
+{
+ if ( itInArg == in.end() )
+ {
+ // Error: missing argument %d
+ }
+ else if ( (*itInArg)->kind_ != kind )
+ {
+ // Error: bad argument type
+ }
+ else
+ {
+ args_.push_back( **itInArg );
+ }
+}
+
+
+void
+Path::invalidPath( const std::string &path,
+ int location )
+{
+ // Error: invalid path.
+}
+
+
+const Value &
+Path::resolve( const Value &root ) const
+{
+ const Value *node = &root;
+ for ( Args::const_iterator it = args_.begin(); it != args_.end(); ++it )
+ {
+ const PathArgument &arg = *it;
+ if ( arg.kind_ == PathArgument::kindIndex )
+ {
+ if ( !node->isArray() || node->isValidIndex( arg.index_ ) )
+ {
+ // Error: unable to resolve path (array value expected at position...
+ }
+ node = &((*node)[arg.index_]);
+ }
+ else if ( arg.kind_ == PathArgument::kindKey )
+ {
+ if ( !node->isObject() )
+ {
+ // Error: unable to resolve path (object value expected at position...)
+ }
+ node = &((*node)[arg.key_]);
+ if ( node == &Value::null )
+ {
+ // Error: unable to resolve path (object has no member named '' at position...)
+ }
+ }
+ }
+ return *node;
+}
+
+
+Value
+Path::resolve( const Value &root,
+ const Value &defaultValue ) const
+{
+ const Value *node = &root;
+ for ( Args::const_iterator it = args_.begin(); it != args_.end(); ++it )
+ {
+ const PathArgument &arg = *it;
+ if ( arg.kind_ == PathArgument::kindIndex )
+ {
+ if ( !node->isArray() || node->isValidIndex( arg.index_ ) )
+ return defaultValue;
+ node = &((*node)[arg.index_]);
+ }
+ else if ( arg.kind_ == PathArgument::kindKey )
+ {
+ if ( !node->isObject() )
+ return defaultValue;
+ node = &((*node)[arg.key_]);
+ if ( node == &Value::null )
+ return defaultValue;
+ }
+ }
+ return *node;
+}
+
+
+Value &
+Path::make( Value &root ) const
+{
+ Value *node = &root;
+ for ( Args::const_iterator it = args_.begin(); it != args_.end(); ++it )
+ {
+ const PathArgument &arg = *it;
+ if ( arg.kind_ == PathArgument::kindIndex )
+ {
+ if ( !node->isArray() )
+ {
+ // Error: node is not an array at position ...
+ }
+ node = &((*node)[arg.index_]);
+ }
+ else if ( arg.kind_ == PathArgument::kindKey )
+ {
+ if ( !node->isObject() )
+ {
+ // Error: node is not an object at position...
+ }
+ node = &((*node)[arg.key_]);
+ }
+ }
+ return *node;
+}
+
+
+} // namespace Json
diff --git a/Demos/bdwallpaper/helper/jsoncpp/json_valueiterator.inl b/Demos/bdwallpaper/helper/jsoncpp/json_valueiterator.inl
new file mode 100644
index 00000000..736e260e
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/json_valueiterator.inl
@@ -0,0 +1,292 @@
+// included by json_value.cpp
+// everything is within Json namespace
+
+
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// class ValueIteratorBase
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+
+ValueIteratorBase::ValueIteratorBase()
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ : current_()
+ , isNull_( true )
+{
+}
+#else
+ : isArray_( true )
+ , isNull_( true )
+{
+ iterator_.array_ = ValueInternalArray::IteratorState();
+}
+#endif
+
+
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ValueIteratorBase::ValueIteratorBase( const Value::ObjectValues::iterator ¤t )
+ : current_( current )
+ , isNull_( false )
+{
+}
+#else
+ValueIteratorBase::ValueIteratorBase( const ValueInternalArray::IteratorState &state )
+ : isArray_( true )
+{
+ iterator_.array_ = state;
+}
+
+
+ValueIteratorBase::ValueIteratorBase( const ValueInternalMap::IteratorState &state )
+ : isArray_( false )
+{
+ iterator_.map_ = state;
+}
+#endif
+
+Value &
+ValueIteratorBase::deref() const
+{
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ return current_->second;
+#else
+ if ( isArray_ )
+ return ValueInternalArray::dereference( iterator_.array_ );
+ return ValueInternalMap::value( iterator_.map_ );
+#endif
+}
+
+
+void
+ValueIteratorBase::increment()
+{
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ ++current_;
+#else
+ if ( isArray_ )
+ ValueInternalArray::increment( iterator_.array_ );
+ ValueInternalMap::increment( iterator_.map_ );
+#endif
+}
+
+
+void
+ValueIteratorBase::decrement()
+{
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ --current_;
+#else
+ if ( isArray_ )
+ ValueInternalArray::decrement( iterator_.array_ );
+ ValueInternalMap::decrement( iterator_.map_ );
+#endif
+}
+
+
+ValueIteratorBase::difference_type
+ValueIteratorBase::computeDistance( const SelfType &other ) const
+{
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+# ifdef JSON_USE_CPPTL_SMALLMAP
+ return current_ - other.current_;
+# else
+ // Iterator for null value are initialized using the default
+ // constructor, which initialize current_ to the default
+ // std::map::iterator. As begin() and end() are two instance
+ // of the default std::map::iterator, they can not be compared.
+ // To allow this, we handle this comparison specifically.
+ if ( isNull_ && other.isNull_ )
+ {
+ return 0;
+ }
+
+
+ // Usage of std::distance is not portable (does not compile with Sun Studio 12 RogueWave STL,
+ // which is the one used by default).
+ // Using a portable hand-made version for non random iterator instead:
+ // return difference_type( std::distance( current_, other.current_ ) );
+ difference_type myDistance = 0;
+ for ( Value::ObjectValues::iterator it = current_; it != other.current_; ++it )
+ {
+ ++myDistance;
+ }
+ return myDistance;
+# endif
+#else
+ if ( isArray_ )
+ return ValueInternalArray::distance( iterator_.array_, other.iterator_.array_ );
+ return ValueInternalMap::distance( iterator_.map_, other.iterator_.map_ );
+#endif
+}
+
+
+bool
+ValueIteratorBase::isEqual( const SelfType &other ) const
+{
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ if ( isNull_ )
+ {
+ return other.isNull_;
+ }
+ return current_ == other.current_;
+#else
+ if ( isArray_ )
+ return ValueInternalArray::equals( iterator_.array_, other.iterator_.array_ );
+ return ValueInternalMap::equals( iterator_.map_, other.iterator_.map_ );
+#endif
+}
+
+
+void
+ValueIteratorBase::copy( const SelfType &other )
+{
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ current_ = other.current_;
+#else
+ if ( isArray_ )
+ iterator_.array_ = other.iterator_.array_;
+ iterator_.map_ = other.iterator_.map_;
+#endif
+}
+
+
+Value
+ValueIteratorBase::key() const
+{
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ const Value::CZString czstring = (*current_).first;
+ if ( czstring.c_str() )
+ {
+ if ( czstring.isStaticString() )
+ return Value( StaticString( czstring.c_str() ) );
+ return Value( czstring.c_str() );
+ }
+ return Value( czstring.index() );
+#else
+ if ( isArray_ )
+ return Value( ValueInternalArray::indexOf( iterator_.array_ ) );
+ bool isStatic;
+ const char *memberName = ValueInternalMap::key( iterator_.map_, isStatic );
+ if ( isStatic )
+ return Value( StaticString( memberName ) );
+ return Value( memberName );
+#endif
+}
+
+
+UInt
+ValueIteratorBase::index() const
+{
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ const Value::CZString czstring = (*current_).first;
+ if ( !czstring.c_str() )
+ return czstring.index();
+ return Value::UInt( -1 );
+#else
+ if ( isArray_ )
+ return Value::UInt( ValueInternalArray::indexOf( iterator_.array_ ) );
+ return Value::UInt( -1 );
+#endif
+}
+
+
+const char *
+ValueIteratorBase::memberName() const
+{
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ const char *name = (*current_).first.c_str();
+ return name ? name : "";
+#else
+ if ( !isArray_ )
+ return ValueInternalMap::key( iterator_.map_ );
+ return "";
+#endif
+}
+
+
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// class ValueConstIterator
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+
+ValueConstIterator::ValueConstIterator()
+{
+}
+
+
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ValueConstIterator::ValueConstIterator( const Value::ObjectValues::iterator ¤t )
+ : ValueIteratorBase( current )
+{
+}
+#else
+ValueConstIterator::ValueConstIterator( const ValueInternalArray::IteratorState &state )
+ : ValueIteratorBase( state )
+{
+}
+
+ValueConstIterator::ValueConstIterator( const ValueInternalMap::IteratorState &state )
+ : ValueIteratorBase( state )
+{
+}
+#endif
+
+ValueConstIterator &
+ValueConstIterator::operator =( const ValueIteratorBase &other )
+{
+ copy( other );
+ return *this;
+}
+
+
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// class ValueIterator
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+// //////////////////////////////////////////////////////////////////
+
+ValueIterator::ValueIterator()
+{
+}
+
+
+#ifndef JSON_VALUE_USE_INTERNAL_MAP
+ValueIterator::ValueIterator( const Value::ObjectValues::iterator ¤t )
+ : ValueIteratorBase( current )
+{
+}
+#else
+ValueIterator::ValueIterator( const ValueInternalArray::IteratorState &state )
+ : ValueIteratorBase( state )
+{
+}
+
+ValueIterator::ValueIterator( const ValueInternalMap::IteratorState &state )
+ : ValueIteratorBase( state )
+{
+}
+#endif
+
+ValueIterator::ValueIterator( const ValueConstIterator &other )
+ : ValueIteratorBase( other )
+{
+}
+
+ValueIterator::ValueIterator( const ValueIterator &other )
+ : ValueIteratorBase( other )
+{
+}
+
+ValueIterator &
+ValueIterator::operator =( const SelfType &other )
+{
+ copy( other );
+ return *this;
+}
diff --git a/Demos/bdwallpaper/helper/jsoncpp/json_writer.cpp b/Demos/bdwallpaper/helper/jsoncpp/json_writer.cpp
new file mode 100644
index 00000000..2a9f0dba
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/json_writer.cpp
@@ -0,0 +1,829 @@
+#include "writer.h"
+#include
+#include
+#include
+#include
+#include
+#include
+#include
+
+#if _MSC_VER >= 1400 // VC++ 8.0
+#pragma warning( disable : 4996 ) // disable warning about strdup being deprecated.
+#endif
+
+namespace Json {
+
+static bool isControlCharacter(char ch)
+{
+ return ch > 0 && ch <= 0x1F;
+}
+
+static bool containsControlCharacter( const char* str )
+{
+ while ( *str )
+ {
+ if ( isControlCharacter( *(str++) ) )
+ return true;
+ }
+ return false;
+}
+static void uintToString( unsigned int value,
+ char *¤t )
+{
+ *--current = 0;
+ do
+ {
+ *--current = (value % 10) + '0';
+ value /= 10;
+ }
+ while ( value != 0 );
+}
+
+std::string valueToString( Int value )
+{
+ char buffer[32];
+ char *current = buffer + sizeof(buffer);
+ bool isNegative = value < 0;
+ if ( isNegative )
+ value = -value;
+ uintToString( UInt(value), current );
+ if ( isNegative )
+ *--current = '-';
+ assert( current >= buffer );
+ return current;
+}
+
+
+std::string valueToString( UInt value )
+{
+ char buffer[32];
+ char *current = buffer + sizeof(buffer);
+ uintToString( value, current );
+ assert( current >= buffer );
+ return current;
+}
+
+std::string valueToString( double value )
+{
+ char buffer[32];
+#if defined(_MSC_VER) && defined(__STDC_SECURE_LIB__) // Use secure version with visual studio 2005 to avoid warning.
+ sprintf_s(buffer, sizeof(buffer), "%#.16g", value);
+#else
+ sprintf(buffer, "%#.16g", value);
+#endif
+ char* ch = buffer + strlen(buffer) - 1;
+ if (*ch != '0') return buffer; // nothing to truncate, so save time
+ while(ch > buffer && *ch == '0'){
+ --ch;
+ }
+ char* last_nonzero = ch;
+ while(ch >= buffer){
+ switch(*ch){
+ case '0':
+ case '1':
+ case '2':
+ case '3':
+ case '4':
+ case '5':
+ case '6':
+ case '7':
+ case '8':
+ case '9':
+ --ch;
+ continue;
+ case '.':
+ // Truncate zeroes to save bytes in output, but keep one.
+ *(last_nonzero+2) = '\0';
+ return buffer;
+ default:
+ return buffer;
+ }
+ }
+ return buffer;
+}
+
+
+std::string valueToString( bool value )
+{
+ return value ? "true" : "false";
+}
+
+std::string valueToQuotedString( const char *value )
+{
+ // Not sure how to handle unicode...
+ if (strpbrk(value, "\"\\\b\f\n\r\t") == NULL && !containsControlCharacter( value ))
+ return std::string("\"") + value + "\"";
+ // We have to walk value and escape any special characters.
+ // Appending to std::string is not efficient, but this should be rare.
+ // (Note: forward slashes are *not* rare, but I am not escaping them.)
+ unsigned maxsize = strlen(value)*2 + 3; // allescaped+quotes+NULL
+ std::string result;
+ result.reserve(maxsize); // to avoid lots of mallocs
+ result += "\"";
+ for (const char* c=value; *c != 0; ++c)
+ {
+ switch(*c)
+ {
+ case '\"':
+ result += "\\\"";
+ break;
+ case '\\':
+ result += "\\\\";
+ break;
+ case '\b':
+ result += "\\b";
+ break;
+ case '\f':
+ result += "\\f";
+ break;
+ case '\n':
+ result += "\\n";
+ break;
+ case '\r':
+ result += "\\r";
+ break;
+ case '\t':
+ result += "\\t";
+ break;
+ //case '/':
+ // Even though \/ is considered a legal escape in JSON, a bare
+ // slash is also legal, so I see no reason to escape it.
+ // (I hope I am not misunderstanding something.
+ // blep notes: actually escaping \/ may be useful in javascript to avoid
+ // sequence.
+ // Should add a flag to allow this compatibility mode and prevent this
+ // sequence from occurring.
+ default:
+ if ( isControlCharacter( *c ) )
+ {
+ std::ostringstream oss;
+ oss << "\\u" << std::hex << std::uppercase << std::setfill('0') << std::setw(4) << static_cast(*c);
+ result += oss.str();
+ }
+ else
+ {
+ result += *c;
+ }
+ break;
+ }
+ }
+ result += "\"";
+ return result;
+}
+
+// Class Writer
+// //////////////////////////////////////////////////////////////////
+Writer::~Writer()
+{
+}
+
+
+// Class FastWriter
+// //////////////////////////////////////////////////////////////////
+
+FastWriter::FastWriter()
+ : yamlCompatiblityEnabled_( false )
+{
+}
+
+
+void
+FastWriter::enableYAMLCompatibility()
+{
+ yamlCompatiblityEnabled_ = true;
+}
+
+
+std::string
+FastWriter::write( const Value &root )
+{
+ document_ = "";
+ writeValue( root );
+ document_ += "\n";
+ return document_;
+}
+
+
+void
+FastWriter::writeValue( const Value &value )
+{
+ switch ( value.type() )
+ {
+ case nullValue:
+ document_ += "null";
+ break;
+ case intValue:
+ document_ += valueToString( value.asInt() );
+ break;
+ case uintValue:
+ document_ += valueToString( value.asUInt() );
+ break;
+ case realValue:
+ document_ += valueToString( value.asDouble() );
+ break;
+ case stringValue:
+ document_ += valueToQuotedString( value.asCString() );
+ break;
+ case booleanValue:
+ document_ += valueToString( value.asBool() );
+ break;
+ case arrayValue:
+ {
+ document_ += "[";
+ int size = value.size();
+ for ( int index =0; index < size; ++index )
+ {
+ if ( index > 0 )
+ document_ += ",";
+ writeValue( value[index] );
+ }
+ document_ += "]";
+ }
+ break;
+ case objectValue:
+ {
+ Value::Members members( value.getMemberNames() );
+ document_ += "{";
+ for ( Value::Members::iterator it = members.begin();
+ it != members.end();
+ ++it )
+ {
+ const std::string &name = *it;
+ if ( it != members.begin() )
+ document_ += ",";
+ document_ += valueToQuotedString( name.c_str() );
+ document_ += yamlCompatiblityEnabled_ ? ": "
+ : ":";
+ writeValue( value[name] );
+ }
+ document_ += "}";
+ }
+ break;
+ }
+}
+
+
+// Class StyledWriter
+// //////////////////////////////////////////////////////////////////
+
+StyledWriter::StyledWriter()
+ : rightMargin_( 74 )
+ , indentSize_( 3 )
+{
+}
+
+
+std::string
+StyledWriter::write( const Value &root )
+{
+ document_ = "";
+ addChildValues_ = false;
+ indentString_ = "";
+ writeCommentBeforeValue( root );
+ writeValue( root );
+ writeCommentAfterValueOnSameLine( root );
+ document_ += "\n";
+ return document_;
+}
+
+
+void
+StyledWriter::writeValue( const Value &value )
+{
+ switch ( value.type() )
+ {
+ case nullValue:
+ pushValue( "null" );
+ break;
+ case intValue:
+ pushValue( valueToString( value.asInt() ) );
+ break;
+ case uintValue:
+ pushValue( valueToString( value.asUInt() ) );
+ break;
+ case realValue:
+ pushValue( valueToString( value.asDouble() ) );
+ break;
+ case stringValue:
+ pushValue( valueToQuotedString( value.asCString() ) );
+ break;
+ case booleanValue:
+ pushValue( valueToString( value.asBool() ) );
+ break;
+ case arrayValue:
+ writeArrayValue( value);
+ break;
+ case objectValue:
+ {
+ Value::Members members( value.getMemberNames() );
+ if ( members.empty() )
+ pushValue( "{}" );
+ else
+ {
+ writeWithIndent( "{" );
+ indent();
+ Value::Members::iterator it = members.begin();
+ while ( true )
+ {
+ const std::string &name = *it;
+ const Value &childValue = value[name];
+ writeCommentBeforeValue( childValue );
+ writeWithIndent( valueToQuotedString( name.c_str() ) );
+ document_ += " : ";
+ writeValue( childValue );
+ if ( ++it == members.end() )
+ {
+ writeCommentAfterValueOnSameLine( childValue );
+ break;
+ }
+ document_ += ",";
+ writeCommentAfterValueOnSameLine( childValue );
+ }
+ unindent();
+ writeWithIndent( "}" );
+ }
+ }
+ break;
+ }
+}
+
+
+void
+StyledWriter::writeArrayValue( const Value &value )
+{
+ unsigned size = value.size();
+ if ( size == 0 )
+ pushValue( "[]" );
+ else
+ {
+ bool isArrayMultiLine = isMultineArray( value );
+ if ( isArrayMultiLine )
+ {
+ writeWithIndent( "[" );
+ indent();
+ bool hasChildValue = !childValues_.empty();
+ unsigned index =0;
+ while ( true )
+ {
+ const Value &childValue = value[index];
+ writeCommentBeforeValue( childValue );
+ if ( hasChildValue )
+ writeWithIndent( childValues_[index] );
+ else
+ {
+ writeIndent();
+ writeValue( childValue );
+ }
+ if ( ++index == size )
+ {
+ writeCommentAfterValueOnSameLine( childValue );
+ break;
+ }
+ document_ += ",";
+ writeCommentAfterValueOnSameLine( childValue );
+ }
+ unindent();
+ writeWithIndent( "]" );
+ }
+ else // output on a single line
+ {
+ assert( childValues_.size() == size );
+ document_ += "[ ";
+ for ( unsigned index =0; index < size; ++index )
+ {
+ if ( index > 0 )
+ document_ += ", ";
+ document_ += childValues_[index];
+ }
+ document_ += " ]";
+ }
+ }
+}
+
+
+bool
+StyledWriter::isMultineArray( const Value &value )
+{
+ int size = value.size();
+ bool isMultiLine = size*3 >= rightMargin_ ;
+ childValues_.clear();
+ for ( int index =0; index < size && !isMultiLine; ++index )
+ {
+ const Value &childValue = value[index];
+ isMultiLine = isMultiLine ||
+ ( (childValue.isArray() || childValue.isObject()) &&
+ childValue.size() > 0 );
+ }
+ if ( !isMultiLine ) // check if line length > max line length
+ {
+ childValues_.reserve( size );
+ addChildValues_ = true;
+ int lineLength = 4 + (size-1)*2; // '[ ' + ', '*n + ' ]'
+ for ( int index =0; index < size && !isMultiLine; ++index )
+ {
+ writeValue( value[index] );
+ lineLength += int( childValues_[index].length() );
+ isMultiLine = isMultiLine && hasCommentForValue( value[index] );
+ }
+ addChildValues_ = false;
+ isMultiLine = isMultiLine || lineLength >= rightMargin_;
+ }
+ return isMultiLine;
+}
+
+
+void
+StyledWriter::pushValue( const std::string &value )
+{
+ if ( addChildValues_ )
+ childValues_.push_back( value );
+ else
+ document_ += value;
+}
+
+
+void
+StyledWriter::writeIndent()
+{
+ if ( !document_.empty() )
+ {
+ char last = document_[document_.length()-1];
+ if ( last == ' ' ) // already indented
+ return;
+ if ( last != '\n' ) // Comments may add new-line
+ document_ += '\n';
+ }
+ document_ += indentString_;
+}
+
+
+void
+StyledWriter::writeWithIndent( const std::string &value )
+{
+ writeIndent();
+ document_ += value;
+}
+
+
+void
+StyledWriter::indent()
+{
+ indentString_ += std::string( indentSize_, ' ' );
+}
+
+
+void
+StyledWriter::unindent()
+{
+ assert( int(indentString_.size()) >= indentSize_ );
+ indentString_.resize( indentString_.size() - indentSize_ );
+}
+
+
+void
+StyledWriter::writeCommentBeforeValue( const Value &root )
+{
+ if ( !root.hasComment( commentBefore ) )
+ return;
+ document_ += normalizeEOL( root.getComment( commentBefore ) );
+ document_ += "\n";
+}
+
+
+void
+StyledWriter::writeCommentAfterValueOnSameLine( const Value &root )
+{
+ if ( root.hasComment( commentAfterOnSameLine ) )
+ document_ += " " + normalizeEOL( root.getComment( commentAfterOnSameLine ) );
+
+ if ( root.hasComment( commentAfter ) )
+ {
+ document_ += "\n";
+ document_ += normalizeEOL( root.getComment( commentAfter ) );
+ document_ += "\n";
+ }
+}
+
+
+bool
+StyledWriter::hasCommentForValue( const Value &value )
+{
+ return value.hasComment( commentBefore )
+ || value.hasComment( commentAfterOnSameLine )
+ || value.hasComment( commentAfter );
+}
+
+
+std::string
+StyledWriter::normalizeEOL( const std::string &text )
+{
+ std::string normalized;
+ normalized.reserve( text.length() );
+ const char *begin = text.c_str();
+ const char *end = begin + text.length();
+ const char *current = begin;
+ while ( current != end )
+ {
+ char c = *current++;
+ if ( c == '\r' ) // mac or dos EOL
+ {
+ if ( *current == '\n' ) // convert dos EOL
+ ++current;
+ normalized += '\n';
+ }
+ else // handle unix EOL & other char
+ normalized += c;
+ }
+ return normalized;
+}
+
+
+// Class StyledStreamWriter
+// //////////////////////////////////////////////////////////////////
+
+StyledStreamWriter::StyledStreamWriter( std::string indentation )
+ : document_(NULL)
+ , rightMargin_( 74 )
+ , indentation_( indentation )
+{
+}
+
+
+void
+StyledStreamWriter::write( std::ostream &out, const Value &root )
+{
+ document_ = &out;
+ addChildValues_ = false;
+ indentString_ = "";
+ writeCommentBeforeValue( root );
+ writeValue( root );
+ writeCommentAfterValueOnSameLine( root );
+ *document_ << "\n";
+ document_ = NULL; // Forget the stream, for safety.
+}
+
+
+void
+StyledStreamWriter::writeValue( const Value &value )
+{
+ switch ( value.type() )
+ {
+ case nullValue:
+ pushValue( "null" );
+ break;
+ case intValue:
+ pushValue( valueToString( value.asInt() ) );
+ break;
+ case uintValue:
+ pushValue( valueToString( value.asUInt() ) );
+ break;
+ case realValue:
+ pushValue( valueToString( value.asDouble() ) );
+ break;
+ case stringValue:
+ pushValue( valueToQuotedString( value.asCString() ) );
+ break;
+ case booleanValue:
+ pushValue( valueToString( value.asBool() ) );
+ break;
+ case arrayValue:
+ writeArrayValue( value);
+ break;
+ case objectValue:
+ {
+ Value::Members members( value.getMemberNames() );
+ if ( members.empty() )
+ pushValue( "{}" );
+ else
+ {
+ writeWithIndent( "{" );
+ indent();
+ Value::Members::iterator it = members.begin();
+ while ( true )
+ {
+ const std::string &name = *it;
+ const Value &childValue = value[name];
+ writeCommentBeforeValue( childValue );
+ writeWithIndent( valueToQuotedString( name.c_str() ) );
+ *document_ << " : ";
+ writeValue( childValue );
+ if ( ++it == members.end() )
+ {
+ writeCommentAfterValueOnSameLine( childValue );
+ break;
+ }
+ *document_ << ",";
+ writeCommentAfterValueOnSameLine( childValue );
+ }
+ unindent();
+ writeWithIndent( "}" );
+ }
+ }
+ break;
+ }
+}
+
+
+void
+StyledStreamWriter::writeArrayValue( const Value &value )
+{
+ unsigned size = value.size();
+ if ( size == 0 )
+ pushValue( "[]" );
+ else
+ {
+ bool isArrayMultiLine = isMultineArray( value );
+ if ( isArrayMultiLine )
+ {
+ writeWithIndent( "[" );
+ indent();
+ bool hasChildValue = !childValues_.empty();
+ unsigned index =0;
+ while ( true )
+ {
+ const Value &childValue = value[index];
+ writeCommentBeforeValue( childValue );
+ if ( hasChildValue )
+ writeWithIndent( childValues_[index] );
+ else
+ {
+ writeIndent();
+ writeValue( childValue );
+ }
+ if ( ++index == size )
+ {
+ writeCommentAfterValueOnSameLine( childValue );
+ break;
+ }
+ *document_ << ",";
+ writeCommentAfterValueOnSameLine( childValue );
+ }
+ unindent();
+ writeWithIndent( "]" );
+ }
+ else // output on a single line
+ {
+ assert( childValues_.size() == size );
+ *document_ << "[ ";
+ for ( unsigned index =0; index < size; ++index )
+ {
+ if ( index > 0 )
+ *document_ << ", ";
+ *document_ << childValues_[index];
+ }
+ *document_ << " ]";
+ }
+ }
+}
+
+
+bool
+StyledStreamWriter::isMultineArray( const Value &value )
+{
+ int size = value.size();
+ bool isMultiLine = size*3 >= rightMargin_ ;
+ childValues_.clear();
+ for ( int index =0; index < size && !isMultiLine; ++index )
+ {
+ const Value &childValue = value[index];
+ isMultiLine = isMultiLine ||
+ ( (childValue.isArray() || childValue.isObject()) &&
+ childValue.size() > 0 );
+ }
+ if ( !isMultiLine ) // check if line length > max line length
+ {
+ childValues_.reserve( size );
+ addChildValues_ = true;
+ int lineLength = 4 + (size-1)*2; // '[ ' + ', '*n + ' ]'
+ for ( int index =0; index < size && !isMultiLine; ++index )
+ {
+ writeValue( value[index] );
+ lineLength += int( childValues_[index].length() );
+ isMultiLine = isMultiLine && hasCommentForValue( value[index] );
+ }
+ addChildValues_ = false;
+ isMultiLine = isMultiLine || lineLength >= rightMargin_;
+ }
+ return isMultiLine;
+}
+
+
+void
+StyledStreamWriter::pushValue( const std::string &value )
+{
+ if ( addChildValues_ )
+ childValues_.push_back( value );
+ else
+ *document_ << value;
+}
+
+
+void
+StyledStreamWriter::writeIndent()
+{
+ /*
+ Some comments in this method would have been nice. ;-)
+
+ if ( !document_.empty() )
+ {
+ char last = document_[document_.length()-1];
+ if ( last == ' ' ) // already indented
+ return;
+ if ( last != '\n' ) // Comments may add new-line
+ *document_ << '\n';
+ }
+ */
+ *document_ << '\n' << indentString_;
+}
+
+
+void
+StyledStreamWriter::writeWithIndent( const std::string &value )
+{
+ writeIndent();
+ *document_ << value;
+}
+
+
+void
+StyledStreamWriter::indent()
+{
+ indentString_ += indentation_;
+}
+
+
+void
+StyledStreamWriter::unindent()
+{
+ assert( indentString_.size() >= indentation_.size() );
+ indentString_.resize( indentString_.size() - indentation_.size() );
+}
+
+
+void
+StyledStreamWriter::writeCommentBeforeValue( const Value &root )
+{
+ if ( !root.hasComment( commentBefore ) )
+ return;
+ *document_ << normalizeEOL( root.getComment( commentBefore ) );
+ *document_ << "\n";
+}
+
+
+void
+StyledStreamWriter::writeCommentAfterValueOnSameLine( const Value &root )
+{
+ if ( root.hasComment( commentAfterOnSameLine ) )
+ *document_ << " " + normalizeEOL( root.getComment( commentAfterOnSameLine ) );
+
+ if ( root.hasComment( commentAfter ) )
+ {
+ *document_ << "\n";
+ *document_ << normalizeEOL( root.getComment( commentAfter ) );
+ *document_ << "\n";
+ }
+}
+
+
+bool
+StyledStreamWriter::hasCommentForValue( const Value &value )
+{
+ return value.hasComment( commentBefore )
+ || value.hasComment( commentAfterOnSameLine )
+ || value.hasComment( commentAfter );
+}
+
+
+std::string
+StyledStreamWriter::normalizeEOL( const std::string &text )
+{
+ std::string normalized;
+ normalized.reserve( text.length() );
+ const char *begin = text.c_str();
+ const char *end = begin + text.length();
+ const char *current = begin;
+ while ( current != end )
+ {
+ char c = *current++;
+ if ( c == '\r' ) // mac or dos EOL
+ {
+ if ( *current == '\n' ) // convert dos EOL
+ ++current;
+ normalized += '\n';
+ }
+ else // handle unix EOL & other char
+ normalized += c;
+ }
+ return normalized;
+}
+
+
+std::ostream& operator<<( std::ostream &sout, const Value &root )
+{
+ Json::StyledStreamWriter writer;
+ writer.write(sout, root);
+ return sout;
+}
+
+
+} // namespace Json
diff --git a/Demos/bdwallpaper/helper/jsoncpp/reader.h b/Demos/bdwallpaper/helper/jsoncpp/reader.h
new file mode 100644
index 00000000..ee1d6a24
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/reader.h
@@ -0,0 +1,196 @@
+#ifndef CPPTL_JSON_READER_H_INCLUDED
+# define CPPTL_JSON_READER_H_INCLUDED
+
+# include "features.h"
+# include "value.h"
+# include
+# include
+# include
+# include
+
+namespace Json {
+
+ /** \brief Unserialize a JSON document into a Value.
+ *
+ */
+ class JSON_API Reader
+ {
+ public:
+ typedef char Char;
+ typedef const Char *Location;
+
+ /** \brief Constructs a Reader allowing all features
+ * for parsing.
+ */
+ Reader();
+
+ /** \brief Constructs a Reader allowing the specified feature set
+ * for parsing.
+ */
+ Reader( const Features &features );
+
+ /** \brief Read a Value from a JSON document.
+ * \param document UTF-8 encoded string containing the document to read.
+ * \param root [out] Contains the root value of the document if it was
+ * successfully parsed.
+ * \param collectComments \c true to collect comment and allow writing them back during
+ * serialization, \c false to discard comments.
+ * This parameter is ignored if Features::allowComments_
+ * is \c false.
+ * \return \c true if the document was successfully parsed, \c false if an error occurred.
+ */
+ bool parse( const std::string &document,
+ Value &root,
+ bool collectComments = true );
+
+ /** \brief Read a Value from a JSON document.
+ * \param document UTF-8 encoded string containing the document to read.
+ * \param root [out] Contains the root value of the document if it was
+ * successfully parsed.
+ * \param collectComments \c true to collect comment and allow writing them back during
+ * serialization, \c false to discard comments.
+ * This parameter is ignored if Features::allowComments_
+ * is \c false.
+ * \return \c true if the document was successfully parsed, \c false if an error occurred.
+ */
+ bool parse( const char *beginDoc, const char *endDoc,
+ Value &root,
+ bool collectComments = true );
+
+ /// \brief Parse from input stream.
+ /// \see Json::operator>>(std::istream&, Json::Value&).
+ bool parse( std::istream &is,
+ Value &root,
+ bool collectComments = true );
+
+ /** \brief Returns a user friendly string that list errors in the parsed document.
+ * \return Formatted error message with the list of errors with their location in
+ * the parsed document. An empty string is returned if no error occurred
+ * during parsing.
+ */
+ std::string getFormatedErrorMessages() const;
+
+ private:
+ enum TokenType
+ {
+ tokenEndOfStream = 0,
+ tokenObjectBegin,
+ tokenObjectEnd,
+ tokenArrayBegin,
+ tokenArrayEnd,
+ tokenString,
+ tokenNumber,
+ tokenTrue,
+ tokenFalse,
+ tokenNull,
+ tokenArraySeparator,
+ tokenMemberSeparator,
+ tokenComment,
+ tokenError
+ };
+
+ class Token
+ {
+ public:
+ TokenType type_;
+ Location start_;
+ Location end_;
+ };
+
+ class ErrorInfo
+ {
+ public:
+ Token token_;
+ std::string message_;
+ Location extra_;
+ };
+
+ typedef std::deque Errors;
+
+ bool expectToken( TokenType type, Token &token, const char *message );
+ bool readToken( Token &token );
+ void skipSpaces();
+ bool match( Location pattern,
+ int patternLength );
+ bool readComment();
+ bool readCStyleComment();
+ bool readCppStyleComment();
+ bool readString();
+ void readNumber();
+ bool readValue();
+ bool readObject( Token &token );
+ bool readArray( Token &token );
+ bool decodeNumber( Token &token );
+ bool decodeString( Token &token );
+ bool decodeString( Token &token, std::string &decoded );
+ bool decodeDouble( Token &token );
+ bool decodeUnicodeCodePoint( Token &token,
+ Location ¤t,
+ Location end,
+ unsigned int &unicode );
+ bool decodeUnicodeEscapeSequence( Token &token,
+ Location ¤t,
+ Location end,
+ unsigned int &unicode );
+ bool addError( const std::string &message,
+ Token &token,
+ Location extra = 0 );
+ bool recoverFromError( TokenType skipUntilToken );
+ bool addErrorAndRecover( const std::string &message,
+ Token &token,
+ TokenType skipUntilToken );
+ void skipUntilSpace();
+ Value ¤tValue();
+ Char getNextChar();
+ void getLocationLineAndColumn( Location location,
+ int &line,
+ int &column ) const;
+ std::string getLocationLineAndColumn( Location location ) const;
+ void addComment( Location begin,
+ Location end,
+ CommentPlacement placement );
+ void skipCommentTokens( Token &token );
+
+ typedef std::stack Nodes;
+ Nodes nodes_;
+ Errors errors_;
+ std::string document_;
+ Location begin_;
+ Location end_;
+ Location current_;
+ Location lastValueEnd_;
+ Value *lastValue_;
+ std::string commentsBefore_;
+ Features features_;
+ bool collectComments_;
+ };
+
+ /** \brief Read from 'sin' into 'root'.
+
+ Always keep comments from the input JSON.
+
+ This can be used to read a file into a particular sub-object.
+ For example:
+ \code
+ Json::Value root;
+ cin >> root["dir"]["file"];
+ cout << root;
+ \endcode
+ Result:
+ \verbatim
+ {
+ "dir": {
+ "file": {
+ // The input stream JSON would be nested here.
+ }
+ }
+ }
+ \endverbatim
+ \throw std::exception on parse error.
+ \see Json::operator<<()
+ */
+ std::istream& operator>>( std::istream&, Value& );
+
+} // namespace Json
+
+#endif // CPPTL_JSON_READER_H_INCLUDED
diff --git a/Demos/bdwallpaper/helper/jsoncpp/value.h b/Demos/bdwallpaper/helper/jsoncpp/value.h
new file mode 100644
index 00000000..58bfd88e
--- /dev/null
+++ b/Demos/bdwallpaper/helper/jsoncpp/value.h
@@ -0,0 +1,1069 @@
+#ifndef CPPTL_JSON_H_INCLUDED
+# define CPPTL_JSON_H_INCLUDED
+
+# include "forwards.h"
+# include
+# include
+
+# ifndef JSON_USE_CPPTL_SMALLMAP
+# include